نتایج جستجو برای: layering

تعداد نتایج: 3192  

Journal: :American Journal of Roentgenology 1980

Journal: :Journal of Statistical Physics 2011

Journal: :Journal de Physique IV (Proceedings) 2006

1994
C. Micheletti J. M. Yeomans

We study the ground state of a classical X-Y model with p ≥ 3-fold spin anisotropy D in a uniform external field, H. An interface is introduced into the system by a suitable choice of boundary conditions. For large D, as H → 0, we prove using an expansion in D−1 that the interface unbinds from the surface through an infinite series of layering transitions. Numerical work shows that the transiti...

2008
O. Venäläinen K. Kaski

We have studied the dynamics of spreading of viscous non–volatile fluids on surfaces by Monte Carlo simulations of solid–on–solid (SOS) models. We have concentrated on the complete wetting regime, with surface diffusion barriers neglected for simplicity. First, we have performed simulations for the standard SOS model. Formation of a single precursor layer, and a density profile with a spherical...

2001
D. Beaglehole

We have measured the adsorption isotherms of n-pentane, cyclohexane, tetrachloromethane, octamethylcyclotetrasiloxane (OMCTS), and water on muscovite mica and silicon. An angle-averaging, refractive-index-matching ellipsometric technique has been used to avoid problems due to anisotropy and back-reflection in the case of mica. With OMCTS on mica layering effects like those found with simple gas...

2005
Sumitha Bhandarkar Saurabh Jain Narasimha Reddy

In this paper, we propose Layered TCP (LTCP for short), a simple layering technique for the congestion window response of TCP to make it more scalable in highspeed, high RTT networks. LTCP is a two dimensional congestion control framework the macroscopic control uses the concept of layering to quickly and efficiently make use of the available bandwidth whereas microscopic control extends the ex...

2016
Adalat Jabrayilov Sven Mallach Petra Mutzel Ulf Rüegg Reinhard von Hanxleden

We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number of reversed arcs, the arc lengths, and the width of the drawing. We call this the Compact Generalized Layering Problem (CGLP). Here, the width of a drawing i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید