Higher resolution total velocity Vt and Va finite-volume formulations on cell-centred structured and unstructured grids

Novel cell-centred finite-volume formulations are presented for incompressible and immiscible two-phase flow with both gravity and capillary pressure effects on structured and unstructured grids. The Darcy-flux is approximated by a control-volume distributed multipoint flux approximation (CVD-MPFA) coupled with a higher resolution approximation for convective transport. The CVD-MPFA method is used for Darcy-flux approximation involving pressure, gravity, and capillary pressure flux operators. Two IMPES formulations for coupling the pressure equation with fluid transport are presented. The first is based on the classical total velocity Vt fractional flow (Buckley Leverett) formulation, and the second is based on a more recent Va formulation. The CVD-MPFA method is employed for both Vt and Va formulations. The advantages of both coupled formulations are contrasted. The methods are tested on a range of structured and unstructured quadrilateral and triangular grids. The tests show that the resulting methods are found to be comparable for a number of classical cases, including channel flow problems. However, when gravity is present, flow regimes are identified where the Va formulation becomes locally unstable, in contrast to the total velocity formulation. The test cases also show the advantages of the higher resolution method compared to standard first-order single-point upstream weighting

Enumeration of distinct mechanically stable disk packings in small systems

We create mechanically stable (MS) packings of bidisperse disks using an algorithm in which we successively grow or shrink soft repulsive disks followed by energy minimization until the overlaps are vanishingly small. We focus on small systems because this enables us to enumerate nearly all distinct MS packings. We measure the probability to obtain a MS packing at packing fraction $\phi$ and find several notable results. First, the probability is highly nonuniform. When averaged over narrow packing fraction intervals, the most probable MS packing occurs at the highest $\phi$ and the probability decays exponentially with decreasing $\phi$. Even more striking, within each packing-fraction interval, the probability can vary by many orders of magnitude. By using two different packing-generation protocols, we show that these results are robust and the packing frequencies do not change qualitatively with different protocols.Comment: 4 pages, 3 figures, Conference Proceedings for X International Workshop on Disordered System

Exact solutions of a restricted ballistic deposition model on a one-dimensional staircase

Surface structure of a restricted ballistic deposition(RBD) model is examined on a one-dimensional staircase with free boundary conditions. In this model, particles can be deposited only at the steps of the staircase. We set up recurrence relations for the surface fluctuation width $W$ using generating function method. Steady-state solutions are obtained exactly given system size $L$. In the infinite-size limit, $W$ diverges as $L^\alpha$ with the scaling exponent $\alpha=\frac{1}{2}$. The dynamic exponent $\beta$ $(W\sim t^\beta)$ is also found to be $\frac{1}{2}$ by solving the recurrence relations numerically. This model can be viewed as a simple variant of the model which belongs to the Kardar-Parisi-Zhang (KPZ) universality class $(\alpha_{KPZ}= \frac{1}{2} , \beta_{KPZ}=\frac{1}{3})$. Comparing its deposition time scale with that of the single-step model, we argue that $\beta$ must be the same as $\beta_{KPZ}/(1-\beta_{KPZ})$, which is consistent with our finding.Comment: 19 pages, REVTEX, 5 figures upon request, INHA-PHYS-94-00

Variational theory for a single polyelectrolyte chain revisited

We reconsider the electrostatic contribution to the persistence length, $\ell_e$, of a single, infinitely long charged polymer in the presence of screening. A Gaussian variational method is employed, taking $\ell_e$ as the only variational parameter. For weakly charged and flexible chains, crumpling occurs at small length scales because conformational fluctuations overcome electrostatic repulsion. The electrostatic persistence length depends on the square of the screening length, $\ell_e\sim\kappa^{-2}$, as first argued by Khokhlov and Khachaturian by applying the Odijk-Skolnick-Fixman (OSF) theory to a string of crumpled blobs. We compare our approach to previous theoretical works (including variational formulations) and show that the result $\ell_e\sim\kappa^{-1}$ found by several authors comes from the improper use of a cutoff at small length scales. For highly charged and stiff chains, crumpling does not occur; here we recover the OSF result and validate the perturbative calculation for slightly bent rods.Comment: 11 pages, 6 figure

Scale invariance and universality of force networks in static granular matter

Force networks form the skeleton of static granular matter. They are the key ingredient to mechanical properties, such as stability, elasticity and sound transmission, which are of utmost importance for civil engineering and industrial processing. Previous studies have focused on the global structure of external forces (the boundary condition), and on the probability distribution of individual contact forces. The disordered spatial structure of the force network, however, has remained elusive so far. Here we report evidence for scale invariance of clusters of particles that interact via relatively strong forces. We analyzed granular packings generated by molecular dynamics simulations mimicking real granular matter; despite the visual variation, force networks for various values of the confining pressure and other parameters have identical scaling exponents and scaling function, and thus determine a universality class. Remarkably, the flat ensemble of force configurations--a simple generalization of equilibrium statistical mechanics--belongs to the same universality class, while some widely studied simplified models do not.Comment: 15 pages, 4 figures; to appear in Natur

On acceleration of Krylov-subspace-based Newton and Arnoldi iterations for incompressible CFD: replacing time steppers and generation of initial guess

We propose two techniques aimed at improving the convergence rate of steady state and eigenvalue solvers preconditioned by the inverse Stokes operator and realized via time-stepping. First, we suggest a generalization of the Stokes operator so that the resulting preconditioner operator depends on several parameters and whose action preserves zero divergence and boundary conditions. The parameters can be tuned for each problem to speed up the convergence of a Krylov-subspace-based linear algebra solver. This operator can be inverted by the Uzawa-like algorithm, and does not need a time-stepping. Second, we propose to generate an initial guess of steady flow, leading eigenvalue and eigenvector using orthogonal projection on a divergence-free basis satisfying all boundary conditions. The approach, including the two proposed techniques, is illustrated on the solution of the linear stability problem for laterally heated square and cubic cavities

FIRE (facilitating implementation of research evidence) : a study protocol

Research evidence underpins best practice, but is not always used in healthcare. The Promoting Action on Research Implementation in Health Services (PARIHS) framework suggests that the nature of evidence, the context in which it is used, and whether those trying to use evidence are helped (or facilitated) affect the use of evidence. Urinary incontinence has a major effect on quality of life of older people, has a high prevalence, and is a key priority within European health and social care policy. Improving continence care has the potential to improve the quality of life for older people and reduce the costs associated with providing incontinence aids

Next generation characterisation of cereal genomes for marker discovery

Cereal crops form the bulk of the world's food sources and thus their importance cannot be understated. Crop breeding programs increasingly rely on high-resolution molecular genetic markers to accelerate the breeding process. The development of these markers is hampered by the complexity of some of the major cereal crop genomes, as well as the time and cost required. In this review, we address current and future methods available for the characterisation of cereal genomes, with an emphasis on faster and more cost effective approaches for genome sequencing and the development of markers for trait association and marker assisted selection (MAS) in crop breeding programs