A comparison of the flow fields generated for spark and controlled auto-ignition

Valve timing strategies aimed at producing internal exhaust gas re-circulation in a conventional spark ignition, SI, engine have recently demonstrated the ability to initiate controlled auto-ignition, CAI. Essentially the exhaust valves close early, to trap a quantity of hot exhaust gases in-cylinder, and the fresh air-fuel charge is induced late into the cylinder and then mixing takes place. As a logical first step to understanding the fluid mechanics, the effects of the standard and modified valve timings on the in-cylinder flow fields under motored conditions were investigated. Laser Doppler anemometry has been applied to an optical engine that replicates the engine geometry and different valve cam timings. The cycle averaged time history mean and RMS velocity profiles for the axial and radial velocity components in three axial planes were measured throughout the inlet and compression stroke. The turbulent mixing for the two cases are described in terms of the flow field maps of the velocity vectors, vorticity and turbulence kinetic energy and the integrated tumble ratio as a function of crankangle

Dielectronic Recombination in Li+ Ions

This research was sponsored by the National Science Foundation Grant NSF PHY-931478

Dielectronic Recombination in Li+ Ions

This research was sponsored by the National Science Foundation Grant NSF PHY-931478

Measurements of Dielectronic Recombination in He+ Ions

This research was sponsored by the National Science Foundation Grant NSF PHY-931478

Dielectronic Recombination in He+ Ions

This research was sponsored by the National Science Foundation Grant NSF PHY-931478

Dielectronic Recombination in He+ Ions

This research was sponsored by the National Science Foundation Grant NSF PHY-931478

The early evolution of the H-free process

The H-free process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal H-free graph obtained at the end of the process. When H is strictly 2-balanced, we show that for some c>0, with high probability as $n \to \infty$, the minimum degree in G is at least $cn^{1-(v_H-2)/(e_H-1)}(\log n)^{1/(e_H-1)}$. This gives new lower bounds for the Tur\'an numbers of certain bipartite graphs, such as the complete bipartite graphs $K_{r,r}$ with $r \ge 5$. When H is a complete graph $K_s$ with $s \ge 5$ we show that for some C>0, with high probability the independence number of G is at most $Cn^{2/(s+1)}(\log n)^{1-1/(e_H-1)}$. This gives new lower bounds for Ramsey numbers R(s,t) for fixed $s \ge 5$ and t large. We also obtain new bounds for the independence number of G for other graphs H, including the case when H is a cycle. Our proofs use the differential equations method for random graph processes to analyse the evolution of the process, and give further information about the structure of the graphs obtained, including asymptotic formulae for a broad class of subgraph extension variables.Comment: 36 page

Atomic hydrogen densities in expanding thermal plasmas

Abstract only

Control of Dynamical Localization

Control over the quantum dynamics of chaotic kicked rotor systems is demonstrated. Specifically, control over a number of quantum coherent phenomena is achieved by a simple modification of the kicking field. These include the enhancement of the dynamical localization length, the introduction of classical anomalous diffusion assisted control for systems far from the semiclassical regime, and the observation of a variety of strongly nonexponential lineshapes for dynamical localization. The results provide excellent examples of controlled quantum dynamics in a system that is classically chaotic and offer new opportunities to explore quantum fluctuations and correlations in quantum chaos.Comment: 9 pages, 7 figures, to appear in Physical Review

On morphological hierarchical representations for image processing and spatial data clustering

Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing