Generating Non-Linear Interpolants by Semidefinite Programming

Interpolation-based techniques have been widely and successfully applied in the verification of hardware and software, e.g., in bounded-model check- ing, CEGAR, SMT, etc., whose hardest part is how to synthesize interpolants. Various work for discovering interpolants for propositional logic, quantifier-free fragments of first-order theories and their combinations have been proposed. However, little work focuses on discovering polynomial interpolants in the literature. In this paper, we provide an approach for constructing non-linear interpolants based on semidefinite programming, and show how to apply such results to the verification of programs by examples.Comment: 22 pages, 4 figure

Computerized Recognition of Traffic Signs Setting Out Lane Arrangements

Traffic signs setting out lane arrangements provide important and useful information for drivers, even when the road signs painted on the road surface are not visible for some reason. Though automatic traffic sign recognition systems are gaining real momentum and recent high-end cars are equipped with such systems, lane info traffic signs are often neglected by these systems. It is because of the high variability of the lane arrangements and their arrow-based representations. Herein, a syntactic approach is presented to describe lane info traffic signs and to decode and recognize their message in an automatic manner. The morphological features used for the purpose are kept intentionally simple at this stage of the research

Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions

A standard method for proving the termination of a flowchart program is to exhibit a ranking function, i.e., a function from the program states to a well-founded set, which strictly decreases at each program step. Our main contribution is to give an efficient algorithm for the automatic generation of multi-dimensional affine nonnegative ranking functions, a restricted class of ranking functions that can be handled with linear programming techniques. Our algorithm is based on the combination of the generation of invariants (a technique from abstract interpretation) and on an adaptation of multi-dimensional affine scheduling (a technique from automatic parallelization). We also prove the completeness of our technique with respect to its input and the class of rankings we consider. Finally, as a byproduct, by computing the cardinal of the range of the ranking function, we obtain an upper bound for the computational complexity of the source program, which does not depend on restrictions on the shape of loops or on program structure. This estimate is a polynomial, which means that we can handle programs with more than linear complexity. The method is tested on a large collection of test cases from the literature. We also point out future improvements to handle larger programs

Geometric Aspects of Mirror Symmetry (with SYZ for Rigid CY manifolds)

In this article we discuss the geometry of moduli spaces of (1) flat bundles over special Lagrangian submanifolds and (2) deformed Hermitian-Yang-Mills bundles over complex submanifolds in Calabi-Yau manifolds. These moduli spaces reflect the geometry of the Calabi-Yau itself like a mirror. Strominger, Yau and Zaslow conjecture that the mirror Calabi-Yau manifold is such a moduli space and they argue that the mirror symmetry duality is a Fourier-Mukai transformation. We review various aspects of the mirror symmetry conjecture and discuss a geometric approach in proving it. The existence of rigid Calabi-Yau manifolds poses a serious challenge to the conjecture. The proposed mirror partners for them are higher dimensional generalized Calabi-Yau manifolds. For example, the mirror partner for a certain K3 surface is a cubic fourfold and its Fano variety of lines is birational to the Hilbert scheme of two points on the K3. This hyperkahler manifold can be interpreted as the SYZ mirror of the K3 by considering singular special Lagrangian tori. We also compare the geometries between a CY and its associated generalized CY. In particular we present a new construction of Lagrangian submanifolds.Comment: To appear in the proceedings of International Congress of Chinese Mathematicians 2001, 47 page

Reducing Occlusion in Cinema Databases through Feature-Centric Visualizations

In modern supercomputer architectures, the I/O capabilities do not keep up with the computational speed. Image-based techniques are one very promising approach to a scalable output format for visual analysis, in which a reduced output that corresponds to the visible state of the simulation is rendered in-situ and stored to disk. These techniques can support interactive exploration of the data through image compositing and other methods, but automatic methods of highlighting data and reducing clutter can make these methods more effective. In this paper, we suggest a method of assisted exploration through the combination of feature-centric analysis with image space techniques and show how the reduction of the data to features of interest reduces occlusion in the output for a set of example applications