منابع مشابه
Crystal Nucleation without Supersaturation.
Classical nucleation theory (CNT) has been extensively employed to interpret crystal nucleation phenomena and postulates the formation of an ordered crystalline nucleus directly from vapor or solution. Here, we provide the first experimental demonstration of a two-step mechanism that facilitates deposition of crystals on solid surfaces from vapor. Crucially, this occurs from saturated vapor wit...
متن کاملThe effect of diffusion kinetics on the supersaturation in clouds
To describe the nucleation–growth interaction at and above the cloud base, a cloud model has been formulated including the haze process below the cloud base and before nucleation of cloud droplets, and a proper diffusion-kinetic droplet growth equation. Analytical equations for the w maximum supersaturation by Twomey Twomey, S., 1959. The nuclei of natural cloud formation: Part II. The supersat...
متن کاملNitric Acid Trihydrate (NAT) formation at low NAT supersaturation in Polar Stratospheric Clouds (PSCs)
A PSC was detected on 6 February 2003 in the Arctic stratosphere by in-situ measurements onboard the high-altitude research aircraft Geophysica. Low number densities (∼10−4 cm−3) of small nitric acid (HNO3) containing particles (d<6μm) were observed at altitudes between 18 and 20 km. Provided the temperatures remain below the NAT equilibrium temperature TNAT, these NAT particles have the potent...
متن کاملSupersaturation for hereditary properties
Let F be a collection of r-uniform hypergraphs, and let 0 < p < 1. It is known that there exists c = c(p,F) such that the probability of a random r-graph in G(n, p) not containing an induced subgraph from F is 2(−c+o(1))( n r). Let each r-graph in F have at least t vertices. We show that in fact for every > 0, there exists δ = δ( , p,F) > 0 such that the probability of a random r-graph in G(n, ...
متن کاملSupersaturation in the Boolean lattice
We prove a “supersaturation-type” extension of both Sperner’s Theorem (1928) and its generalization by Erdős (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking themiddle (k−1) rows of the Boolean lattice and x elements from the kthmiddle r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1997
ISSN: 0028-0836,1476-4687
DOI: 10.1038/41000