This research aims at a substantial enhancement of the ability to conduct autonomous, video based, persistent intelligent surveillance, and reconnaissance and threat assessment in highly uncertain, adversarial scenarios such as urban environments. The main idea is the use of operator theoretic and convex analysis methods to recast several key sub-problems arising in this context -tracking, dyna...

Many problems in geometric optics or convex geometry can be recast as optimal transport problems and a popular way to solve these problems numerically is to assume that the source probability measure is absolutely continuous while the target measure is finitely supported. We introduce a damped Newton’s algorithm for this type of problems, which is experimentally efficient, and we establish its ...

In this paper we consider tree-level scattering in the minimal N = 4 topological string and show that a large class of N -point functions can be recast in terms of corresponding amplitudes in the (1, k) minimal bosonic string. This suggests a non-trivial relation between the minimal N = 4 topological strings, the (1, k) minimal bosonic strings and their corresponding ADE matrix models. This rel...

In spite of the huge literature on deconvolution problems, very little is done for hybrid contexts where signals are quantized. In this paper we undertake an information theoretic approach to the deconvolution problem of a simple integrator with quantized binary input and sampled noisy output. We recast it into a decoding problem and we propose and analyze (theoretically and numerically) some l...

Gaining an insight into the potential effectiveness of Multiple Kernel Learning (MKL) methods requires analysis of the underlying ensemble process and resulting loss. An attempt to suggest such directions is described in this work which presents some preliminary results based on the “Flat Maximum Effect” and decompositions of the loss which leads to MKL problem being recast as one of optimal De...

The logic underlying our current interpretations of all first-order formal languages—which provide the formal foundations for all computing languages—is Aristotle’s logic of predicates. I review Rosser’s claim that Gödel’s reasoning can be recast to arrive at his intended result without the assumption of ω-consistency, since Rosser’s argument appeals to a fundamental tenet of this logic, namely...

A general approach to optimal motion synthesis of constrained multibody systems is presented. It applies to controlled mechanical systems such as industrial manipulators and legged-locomotion systems. An optimal control problem is stated. A parametric optimization technique based on approximating joint motion coordinates using spline functions of class C is developed to recast this primary prob...

Zador’s classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. The equivalence of the two formulations is shown and the result is proved for source distributions that are absolutely continuous with respect to the Lebesgue measure which satisfy an ent...

Abstract. In this paper, the optimal fuel impulsive time-fixed rendezvous problem is considered. Under some simplifying assumptions, this problem may be recast as a non convex polynomial optimization problem. A numerical solving algorithm using a convex relaxation based on sum-of-squares representation of positive polynomials is proposed. Numerical results are evaluated on two examples and chec...

v Abstract. The chemical stability tests currently used for propellants suffer from some drawback. In this paper an attempt has been made to recast the existing system of stability testing in order to improve the reliability factor. A new stability concept has also been brought out based on the action of the stabilizer and its derivatives with the decomposed products of the nitric esters, the c...