Optimization for pattern classification using biased random search techniques

We demonstrate how optimization problems arise in the field of pattern classification, in particular in using piecewise-linear classification and classification based on an optimal linear separator. We motivate the need in this area for a general purpose optimization approach. We discuss ALOPEX, a biased random search approach, from the point of view of this need. While ALOPEX itself failed to fulfil our need, a newly-introduced generalization of it (iterated ALOPEX) was found to be appropriate for the optimization problems of our particular concern. We conclude the paper with a brief critical evaluation of this approach as compared to our original aims.     

Un théorème de type Beurling–Lax dans la boule unitéA Beurling–Lax type theorem in the unit ball

We prove a Beurling–Lax theorem for a family of reproducing kernel Hilbert spaces of functions analytic in an open subset of the unit ball containing the origin. The spaces under consideration are characterized by functions called Schur multipliers. Using the theory of linear relations in Pontryagin spaces we also give coisometric realizations of Schur multipliers. To cite this article: D. Alpay et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 349–354.     

On the relation between protonium level shifts and nucleon-antinucleon scattering amplitudes

We study the Coulomb and threshold corrections to the low-energy scattering parameters for the proton-antiproton system, with numerical examples based on current optical models. Some commonly used expressions are shown to be inconsistent with our results. We check that the Trueman formula is valid for the level shifts of protonium, provided one takes properly into account the Coulomb corrections to the scattering lengths and volumes.     

Testing Extreme Value Conditions

A test statistic is developed that checks the validity of the extreme value conditions without specifiying the shape parameter of the limiting extreme value distribution.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.     

Comparison theorems for weak splittings of bounded operators

Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502     

First passage percolation: The stationary case

Summary If the passage time of the edges of the ^d lattice are stationary, ergodic and have finite moment of orderp>d, then a.s. the set of vertices that can be reached within timet, has an asymptotic shape ast.