We present a novel human body gesture recognition method using a linear programming based matching scheme. Instead of attempting to segment an object from the background, we develop a novel successive convexification linear programming method to locate the target by searching for the best matching region based on a graph template. The linear programming based matching scheme generates relativel...

No AccessEngineering NotesMars Entry Trajectory Planning with Range Discretization and Successive ConvexificationXu Liu, Shuang Li Ming XinXu LiuNanjing University of Aeronautics Astronautics, 211106 Nanjing, People’s Republic China*Ph.D. Candidate, Department Aerospace Control Engineering; .Search for more papers by this author, https://orcid.org/0000-0001-9142-5036Nanjing China†Professor, (Co...

This paper presents a new method of training neural networks including deep learning machines, which is based on the idea of convexifying the training error criterion by the use of the risk-averting error (RAE) criterion. Convexification creates tunnels between the depressed regions around saddle points, tilts the plateaus, and eliminates nonglobal local minima. The difficulties in computing th...

Let us define for a compact set A ⊂ R the sequence A(k) = { a1 + · · ·+ ak k : a1, . . . , ak ∈ A } = 1 k ( A+ · · ·+A } {{ } k times ) . It was independently proved by Shapley, Folkman and Starr (1969) and by Emerson and Greenleaf (1969) that A(k) approaches the convex hull of A in the Hausdorff distance induced by the Euclidean norm as k goes to ∞. We explore in this survey how exactly A(k) a...

Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be convexified by pop operations. This family contains simple, as well as non-simple (i.e., self-intersecting) polygons, as desired. We thereby answer in the negative an...

In this paper, an adaptive proximal bundle method is proposed for a class of nonconvex and nonsmooth composite problems with inexact information. The are the sum finite convex function information function. For function, we design convexification technique ensure linearization errors its augment to be nonnegative. Then, regarded as approximate primal problem. adopt disaggregate strategy regard ...

continuous four hours eeg (electroencephalogram) recordings and its power spectrum analysis using fast fourier transform (fft) in urethane anesthetized male charles foster rats were performed in two groups: open brain injury and p-cpa (para-chlorophenylalanine) pretreated before brain injury, respectively, and compared with the eeg power spectrum of control rats. the eeg power spectrum analysis...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy STRONG VALID INEQUALITIES FOR MIXED-INTEGER NONLINEAR PROGRAMS VIA DISJUNCTIVE PROGRAMMING AND LIFTING By Kwanghun Chung August 2010 Chair: Jean-Philippe. P. Richard Major: Industrial and Systems Engineering Mixed-Integer Nonlinear Progr...

in this paper by using concepts of graph theory, forces method and substructure ing method for analysis of structures, some methods have been introduced for optimal analysis of structures in a large scale, using substructuring method. planar rigid frames assuming linear behavior and small deformations, have been optimal analyzed, by using forces method. thus, a fortran power station computation...