Brief preliminary design for a method of FMS machine tools subsystem selection

The article presents the main points of methodology of machine tools subsystem selection for a flexible manufacturing system. In particular, it shows the main algorithm and stages of the methodology which is based on computer database systems, algorithms of elimination and method of multicriteria optimisation. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On periodic solutions to the von Foerster-Lasota equation

We show that the von Foerster-Lasota equation with parameter λ has a periodic solution in the space of Hölder continuous functions with exponent α if and only if α<λ. This generalizes the result from Dawidowicz and Haribash (Univ. Iagell. Acta Math. 37:321–324, 1999), in which existence of periodic solutions was proved only for λ>1.     

Large deviations and stochastic homogenization

Summary A general theorem is stated providing large deviations estimates for a family of measures on a topological vector space. Applications are given in the second part, where large deviations problems arising in stochastic homogenization are discussed. Another application is given in similar problems connected with Donsker's invariance principle.     

Controllability of quasi-linear Hamiltonian NLS equations

We prove internal controllability in arbitrary time, for small data, for quasi-linear Hamiltonian NLS equations on the circle. We use a procedure of reduction to constant coefficients up to order zero and HUM method to prove the controllability of the linearized problem. Then we apply a Nash–Moser–Hörmander implicit function theorem as a black box.     

Noisy colored point set matching

We propose a process for determining approximated matches, in terms of the bottleneck distance, under color preserving rigid motions, between two colored point sets A,B∈R², |A|≤|B|. We solve the matching problem by generating all representative motions that bring A close to a subset B^′ of set B and then using a graph matching algorithm. We also present an approximate matching algorithm with improved computational time. In order to get better running times for both algorithms we present a lossless filtering preprocessing step. By using it, we determine some candidate zones which are regions that contain a subset S of B such that A may match one or more subsets B^′ of S. Then, we solve the matching problem between A and every candidate zone. Experimental results using both synthetic and real data are reported to prove the effectiveness of the proposed approach.