arXiv research

Extends first-order flexes of surfaces to second-order flexes.

Lower bound for complexity of finding flex points on cubic curves.

For a real valued periodic smooth function u on R, $n\ge 0$, one defines the osculating polynomial $φ_s$ (of order 2n+1) at a point $s\in R$ to be the unique trigonometric polynomial of degree n, whose value and first 2n derivatives at s coincide with those of u at s. We will say that a point s is a clean maximal flex …

The paper studies geometric loci and their invariants in complex dynamics.

FLEX optimizes exploration for nonlinear systems with minimal data.

Study on choosing points on cubic curves, answering some questions about their flexibility.

Using Green's theorem we reduce the variation of the total mean curvature of a smooth surface in the Euclidean 3-space to a line integral of a special vector field and obtain the following well-known theorem as an immediate consequence: the total mean curvature of a closed smooth surface in the Euclidean 3-space is sta…

We show how the rotation and translation fields of a surface, introduced by G. Darboux, may be used to obtain short proofs of a well-known theorem (that reads that the total mean curvature of a surface is stationary under an infinitesimal bending) and a new theorem (that reads that every infinitesimal flex of any simpl…

Osculating spaces of decomposable scrolls (of any genus and not necessarily normal)are studied and their inflectional loci are related to those of their generating curves by using systematically an idea introduced by Piene and Sacchiero in the setting of rational normal scrolls. In this broader setting the extra compon…

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change its shape under the above restrictions. We prove that flexible polyhedral surfa…

This paper presents a kernel-based discriminative learning framework on probability measures. Rather than relying on large collections of vectorial training examples, our framework learns using a collection of probability distributions that have been constructed to meaningfully represent training data. By representing …

Hashing has been widely adopted for large-scale data retrieval in many domains, due to its low storage cost and high retrieval speed. Existing cross-modal hashing methods optimistically assume that the correspondence between training samples across modalities are readily available. This assumption is unrealistic in pra…

Combines local and global samplers for efficient sampling.

New spectral conditions ensure graph rigidity and global rigidity in the Euclidean plane.