Parallax displacement is used to determine a relative 3D conic projective structure. This value is invariant between any number of views in time if the conic is not moving with respect to the plane of the homography. It can be used to determine conic correspondence between three simultaneous views. The corresponding conics may then be used to determine the epipolar geometry. This method of dete...

Array syntax, existed in many languages, adds expressive power by allowing operations on and assignments to the array sections. When compiling to a uniprocessor machine, the array statement must be converted into a loop that maintains the correct semantics, by a process called scalarization. Scalarization presents a significant technical problem because an array assignment needs to be implement...

The occurrence frequencies of dayside ion conics with various conic angles are obtained as a function of altitude from Exos-D (Akebono) observations. We made a model calculation of ion conic evolution to match the observation results. The observed occurrence frequencies of ion conics with 80 to 90 conic angle are used as an input to the model and the occurrence frequencies of ion conics with sm...

In decision-theoretic planning problems, such as (partially observable) Markov decision problems [Wiering and Van Otterlo, 2012] or coordination graphs [Guestrin et al., 2002], agents typically aim to optimize a scalar value function. However, in many real-world problems agents are faced with multiple possibly conflicting objectives, e.g., maximizing the economic benefits of timber harvesting w...

We study the order of maximizers in linear conic programming (CP) as well as stability issues related to this. We do this by taking a semi-infinite view on conic programs: a linear conic problem can be formulated as a special instance of a linear semi-infinite program (SIP), for which characterizations of the stability of first order maximizers are well-known. However, conic problems are highly...

A continuous time mean-variance (MV) problem optimizes the bi-objective criteria 5 (V, E), respectively representing variance V and expected value E of a random variable at the end 6 of a time horizon T . This problem is computationally challenging since the dynamic programming 7 principle cannot be directly applied to the variance criterion. An embedding technique has been 8 proposed in [18, 2...

We show that the complexity (the number of elements) of an optimal parabolic or conic spline approximating a smooth curve with non-vanishing curvature to within symmetric difference distance ε is c1 ε −1/4 + O(1), if the spline consists of parabolic arcs and c2 ε −1/5 +O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the affine curvature of...

In this paper, under a suitable regularity condition, we establish that a broad class of conic convex polynomial optimization problems, called conic sum-of-squares convex polynomial programs, exhibits exact conic programming relaxation, which can be solved by various numerical methods such as interior point methods. By considering a general convex cone-program, we give unified results that appl...