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.     

Construction of best Bregman approximations in reflexive Banach spaces

An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.

     

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.     

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.     

Biosynthetic Studies on Antibiotics

The intricacies of the synthetic chemistry executed by living cells in the assembly of complex organic natural products can be probed in great detail by stable-isotope labeling in conjunction with sophisticated 2D and multiple-quantum NMR methods of analysis. Mechanistic details are revealed by unraveling the “cryptic” stereochemistry of biosynthetic reactions with the aid of stereospecific isotope labeling. Analysis of blocked mutants and cloning of biosynthetic genes provides new tools for the study of biosynthetic pathways and for the exploitation of the chemical capabilities of living organisms.     

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.