Steady-state analytical solutions for the lattice boltzmann equation

A general class of analytical solutions of the lattice Boltzmann equation is derived for two-dimensional, steady-state unidirectional flows. A subset of the solutions that verifies the corresponding Navier-Stokes equations is given. It is pointed out that this class includes, e.g., the Couette and the Poiseuille flow but not, e.g., the basic Kolmogorov flow. For steady-state non-unidirectional flows, first and second order solutions of the lattice Boltzmann equation are derived. Practical consequences of the analysis are mentioned. Differences between the technique applied here and those used in some earlier works are emphasized.     

Groups in which every non-abelian subgroup is permutable

A subgroupH of a groupG is said to bepermutable ifHX=XH for every subgroupX ofG. In this paper the structure of groups in which every subgroup either is abelian or permutable is investigated. This work was done while the last author was visiting the University of Napoli Federico II. He thanks the “Dipartimento di Matematica e Applicazioni” for its financial support.     

The elastic theory of a single DNA molecule

We study the elastic responses of double-(ds) and single-stranded (ss) DNA at external force fields. A double-strand-polymer elastic model is constructed and solved by path integral methods and Monte Carlo simulations to understand the entropic elasticity, cooperative extensibility, and supercoiling property of dsDNA. The good agreement with experiments indicates that short-ranged base-pair stacking interaction is crucial for the stability and the high deformability of dsDNA. Hairpin-coil transition in ssDNA is studied with generating function method. A threshold force is needed to pull the ssDNA hairpin patterns, stabilized by base pairing and base-pair stacking, into random coils. This phase transition is predicted to be of first order for stacking potential higher than some critical level, in accordance with experimental observations.     

Improved search for $B_{s}^{0} - \overline{B}_{s}^{0}$ oscillations

An improved search for B _s ⁰ oscillations is performed in the ALEPH data sample collected during the first phase of LEP, and reprocessed in 1998. Three analyses based on complementary event selections are presented. First, decays of B _s ⁰ mesons into hadronic flavour eigenstates are fully reconstructed. This selection yields a small sample of candidates with excellent decay length and momentum resolution and hi gh average B _s ⁰ purity. Semileptonic decays with a reconstructed D _s ^- meson provide a second sample with larger statistics, high average B _s ⁰ purity, but a poorer momentum and decay length resolution due to the partial decay reconstruction. Finally, semileptonic b-hadron decays are inclusively selected and yield the data sample with the highest sensitivity to B _s ⁰ oscillations, as the much higher statistics compensate for the low average B _s ⁰ purity and poorer time resolution. A lower limit is set atps^-1 at 95% C.L., significantly lower than the expected limit of 15.2 ps^-1. Received: 21 February 2003 / Published online: 11 June 2003     

Rhythmic pattern formations in gels and Matalon—Packter law: A fresh perspective

The periodic precipitation pattern formation in gelatinous media is interpreted as a moving boundary problem. The time law, spacing law and width law are revisited on the basis of the new scenario. The explicit dependence of the geometric structure on the initial concentrations of the reactants is derived. Matalon—Packter law, which relates the spacing coefficient with the initial concentrations is reformulated removing many ambiguities and impractical parameters. Experimental results are discussed to establish the significance of moving boundary concept in the diffusion controlled pattern forming systems     

直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…