Modélisation du champ des vitesses de l'urine dans un bolus urétéralModelling of urine flow in an ureteral bolus

Urine transport is made from the kidney to the bladder through the ureter by isolated pockets called bolus. To determine the urine flow in a bolus, we use an adherence condition on the interface urine/wall. It gives us an infinite linear system verified by a set of parameters. An iterative and convergent algorithm allows us to solve this system and to determine analytically the components of the velocity vector in the bolus. To cite this article: A. Vogel et al., C. R. Mecanique 332 (2004).     

Effect of nanotube functionalization on the properties of single‐walled carbon nanotube/polyurethane composites

A commercially available aliphatic thermoplastic polyurethane formulated with a methylene bis(cyclohexyl) diisocyanate hard segment and a poly(tetramethylene oxide) soft segment and chain‐extended with 1,4‐butanediol was dissolved in dimethylformamide and mixed with dispersed single‐walled carbon nanotubes. The properties of composites made with unfunctionalized nanotubes were compared with the properties of composites made with nanotubes functionalized to contain hydroxyl groups. Functionalization almost eliminated the conductivity of the tubes according to the conductivity of the composites above the percolation threshold. In most cases, functionalized and unfunctionalized tubes yielded composites with statistically identical mechanical properties. However, composites made with functionalized tubes did have a slightly higher modulus in the rubbery plateau region at higher nanotube fractions. Small‐angle X‐ray scattering patterns indicated that the dispersion reached a plateau in the unfunctionalized composites that was consistent with the plateau in the rubbery plateau region. The room‐temperature modulus and tensile strength increase was proportionally higher than almost all increases seen previously in thermoplastic polyurethanes; however, the increase was still an order of magnitude below what has been reported for the best nanotube–polymer systems. Nanotube addition increased the hard‐segment glass transition temperature slightly, whereas the soft‐segment glass transition was so diffuse that no conclusions could be drawn. Unfunctionalized tubes suppressed the crystallization of the hard segment; whereas functionalized tubes had no effect. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 490–501, 2007     

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.     

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.     

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