This paper addresses the recent development of real-time visual odometry system based on a dual optical-flow system and its integration to an inertial navigation system aiming for smallscale flying robots. To overcome the unknown depth information in optic-flow, a dual opticflow system is developed and tested. The flow measurements are fused with a low-cost inertial sensor using an extended Kal...

In this paper, we consider a continuous version of the convex network flow problem which involves the integral of the Euclidean norm of the flow and its square in the objective function. A discretized version of this problem can be cast as a secondorder cone program, for which efficient primal-dual interior-point algorithms have been developed recently. An optimal magnetic shielding design prob...

We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. The algorithms are of the primal-dual type. They maintain primat feasibility with respect to capacity constraints, while trying to satisfy the conservation of flow equation at each node by means of a wide variety of procedures based on flow augmentation, price adjustment, and ascent of a dual func...

The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex algorithm is one of the most efficient solution methods for MFP in practice. The theoretical properties of established pivot algorithms for MFP is less understood. Variants of the primal simplex and dual simplex methods for MFP have been proven strongly polynomial, but no similar result exists for ...

We consider D7-branes in the gauge theory/string theory correspondence, using a probe approximation. The D7-branes have four directions embedded holomorphically in a non-compact Calabi-Yau 3-fold (which for specificity we take to be the conifold) and their remaining four directions are parallel to a stack of D3-branes transverse to the Calabi-Yau space. The dual gauge theory, which has N = 1 su...

The EPDiff equation (or dispersionless Camassa-Holm equation in 1D) is a well known example of geodesic motion on the Diff group of smooth invertible maps (diffeomorphisms). Its recent two-component extension governs geodesic motion on the semidirect product Diff sF , where F denotes the space of scalar functions. This paper generalizes the second construction to consider geodesic motion on Dif...

We consider the use of low speed preconditioning for time dependent problems. These are solved using a dual time step approach. We consider the effect of this dual time step on the parameter of the low speed precondi-tioning. In addition, we compare the use of two sets of variables, conservation and primitive variables, to solve the system. We show the effect of these choices on both the conver...

We consider the minimum cost network flow problem min(cx : Ax=b , x > 0) on a graph G = (V,E). First we give a minor modification of Edmonds-Karp scaling technique, and we show that it solves the minimum cost flow problem in 0((|V|'^ log 1v|)(|e| + |V| log |v|)) steps. We also provide two dual simplex algorithms that solve the minimum cost flow problem in 0(|v| log |v|) pivots and 0(|v| log |v|...