Bending loss measurement using a fiber cavity ringdown scheme

A novel sensitive technique for the determination of losses in fiber cavities is presented. The method is based on the cavity ringdown scheme implemented in silica-based single-mode fibers. Bending losses of fiber cavities of different lengths have been measured showing all an oscillating behavior with respect to the curvature radius of the fiber as predicted by a theoretical model. The best minimum detectable absorbance per cavity pass achieved by this new method is 1.72×10⁻³ dB within a 10 m-long cavity. This limit suffices well for an accurate determination of optical bending losses even in bend-insensitive fibers. Furthermore, the comparison of the measured bending losses with a theoretical model allows the extraction of different fiber parameters. Good agreement has been found between the experimentally derived parameters and literature data.     

Second Dissociation Constant of Bis-[(2-hydroxyethyl)amino]acetic Acid (BICINE) and pH of Its Buffer Solutions from 5 to 55 °C

The values of the second dissociation constant, K ₂, and related thermodynamic quantities of the ampholyte bis[(2-hydroxyethyl)amino]acetic acid (BICINE) have been determined at temperatures from 5 to 55 ^∘C. The pH values of six equimolal buffer solutions, and four buffer solutions having ionic strengths (I = 0.16 mol⋅kg⁻¹) similar to those in blood plasma, have been evaluated at 12 temperatures from 5 to 55 ^∘C using the Bates–Guggenheim convention. The liquid junction potentials (E _j ) between the buffer solutions of BICINE and saturated KCl solution of the calomel electrode at 25 and 37 ^∘C have been estimated by measurement with a flowing junction cell. These values of E _j have been used to ascertain the operational pH values at 25 and 37 ^∘C. The pK ₂ values at 25 and 37 ^∘C are 8.333 and 8.156, respectively. The thermodynamic quantities associated with the second acid dissociation have been calculated from the values of pK ₂ as a function of temperature. The zwitterionic buffer BICINE was shown to be useful as a pH standard in the region close to that of blood serum.     

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.     

Long-range predictive adaptive fuzzy relational control

A class of long-range predictive adaptive fuzzy relational controllers is presented. The plant behavior is described over an extended time horizon by a fuzzy relational model which is identified based on input-output closed-loop observations of the plant variables. In this class of adaptive controllers the control law attempts to minimize a quadratic cost over an extended control horizon. When used with linear models, this approach has revealed a significant potential for overcoming the limitations of one-step ahead schemes, such as the stabilization of non-minimum phase plants. Here, a uniform framework is adopted for implementing both the fuzzy model and the fuzzy controller, namely distributed fuzzy relational structures gaining from their massive parallel processing features and from the learning capabilities typical of the connectivist approaches. Issues such as maintenance during the adaptation process of the meaning of linguistic terms used at both fuzzy systems interfaces are addressed, namely by introducing a new design methodology for on-line fuzzy systems interface adaptation. The examples presented reinforce the claim of the usefulness of this new approach.     

Two- and three-dimensional analysis of bose-einstein correlations inπ +/K+p interactions at 250 GeV/c

The NA22 data onπ ^? π ^? correlations are analyzed in terms of a number of two- and three-dimensional parametrizations (Gaussian space-time, Goldhaber, Bowler string-like, Bertsch hydrodynamical, Kopylov-Podgoretskii, etc.). Contrary to the results obtained for e⁺e^? andµp collisions, the Goldhaber parametrization, as well as string-like models, fail in describing the hadron-hadron data. Better fits are obtained in the framework of surface-emitting fireball-like models, both when including and excluding hydrodynamical expansion of nuclear matter. Our results indicate that pion radiation occurs at earlier stages of matter evolution than in nuclear collisions.     

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.