New data on the ternary fission of 252Cf from the Gammasphere facility

Ternary fission of ²⁵²Cf was studied at Gammasphere using eight ΔE×E particle telescopes. Helium, beryllium, boron, and carbon light charged particles (LCPs) emitted with kinetic energy more than 9, 21, 26, and 32 MeV, respectively, were identified. The 3368-keV γ transition from the first 2⁺ excited state in ¹⁰Be was found and the population probability ratio N(2⁺)/N(0⁺) = 0.160 ± 0.025 was estimated. No evidence was found for 3368-keV γ rays emitted from a triple molecular state. For the first time, charge distributions are obtained for ternary fission fragments emitted with helium, beryllium, and carbon LCPs.     

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.     

Stable Subnorms II

In this paper we continue our study of stability properties of subnorms on subsets of finite-dimensional, power-associative algebras over the real or the complex numbers.     

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.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

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.     

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.