English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We apply a recent one-dimensional algorithm for predicting random closepacking fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys.133, 244104 (2009)] to the case of lognormal distributions of sphere sizes andmixtures of such populations. We show that the results compare well to two muchslower algorithms for directly simulating spheres in three dimensions, and showthat the algorithm is fast enough to tackle inverse problems in particlepacking: designing size distributions to meet required criteria. Theone-dimensional method used in this paper is implemented as a computer code inthe C programming language, available athttp://sourceforge.net/projects/spherepack1d/ under the terms of the GNUgeneral public licence (version 2).

Random close packing fractions of lognormal distributions of hard spheres