Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.     

Phase Measurement Algorithm in Wavelength Scanned Fizeau Interferometer

Wavelength scanned interferometry allows the simultaneous measurement of top surface shape and optical thickness variation of a transparent object consisting of several parallel surfaces. Interference signals from these surfaces can be separated in frequency space, and their phases are detected by discrete Fourier analysis. However, these signal frequencies are shifted from the detection frequency by the refractive index dispersion of the object and a nonlinearity of the wavelength scanning. The Fourier analysis is sensitive to the detuning of the signal frequency and suffers from the multiple-beam interference noise. Conventional error-compensating algorithms cannot be applied to an object consisting of more than three reflecting surfaces. We derive a new 2N-1 sample error-compensating algorithm, which allows the phase detection of any order of harmonic frequency among the interference signals. The new algorithm suppresses the effect of signal frequency detuning as well as the multiple-beam interference noise and can be applied to the measurement of complex objects consisting of more than three reflecting surfaces.     

Catalytic allylic transfer reactions of functionalized aldehydes promoted by BINOL-Ti(IV) with synergistic reagent

Practical and efficient catalytic asymmetric allylic transfer reactions of tin reagents promoted by BINOL-Ti[OCH(CF₃)₂]₂ complex by the utilization of t-BuSBEt₂ are successful with a variety of functionalized aldehydes containing ketone, aldehyde, ester, amide, or carbamoyl functionality and affords products in high levels of enantioselectivity.     

Infine Functions, Nonsmooth Alternative Theorems and Vector Optimization Problems

In this paper we introduce a new notion of infine nonsmooth functions and give several characterizations of infineness property. We prove alternative theorems with mixed constraints (i.e., inequality and equality constraints) being described by invex-infine nonsmooth functions. We establish a necessary and sufficient condition for a solution of a vector optimization problem involving mixed constraints to be a properly efficient solution.