Log-Normal and Mono-Sized Particles’ Packing into a Bounded Region

نویسندگان

  • M.R. Vaezi Nanotechnology and Advanced Materials Department, Material and Energy Research Center(MERC)
چکیده مقاله:

Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Distribution of packing densities and reproducibility of particles packing factor, with log-normal size distribution and also mono-sized particles have been compared. In addition, the effects of container size on regional particle packing density, the effect of wall on packing density and symmetry of packed structure have been investigated. The results confirm that particles in log-normal size distribution have higher packing densities, but the obtained results have less reproducibility than mono-sized particles. Also, in comparison, particles in log-normal size distribution have uniform density and regions with higher local density.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Particles Size Distribution Effect on 3d Packing of Nanoparticles Into a Bounded Region

In this paper, the effects of two different Particle Size Distributions (PSD) on packingbehavior of ideal rigid spherical nanoparticles using a novel packing model based on parallelalgorithms have been reported. A mersenne twister algorithm was used to generate pseudorandomnumbers for the particles initial coordinates. Also, for this purpose a nanosized tetragonal confinedcontainer with a squar...

متن کامل

Wall Effect in 3D Simulation Of Same Sized Particles Packing

In this paper, the effects of container size on the porosity of random loose packing of mono size particles have been investigated using an Event Dynamics (ED) based model. Simultaneous effects of square container walls on particles packing and their order are also investigated. Our simulation results indicate higher container size will increase the total packing factor and high density regions...

متن کامل

Packing fraction of geometric random packings of discretely sized particles.

The packing fraction of geometric random packings of discretely sized particles is addressed in the present paper. In an earlier paper [Brouwers, Phys. Rev. E 74, 031309 (2006); Brouwers, Phys. Rev. E 74, 069901(E) (2006)], analytical solutions were presented for the packing fraction of polydisperse geometric packings for discretely sized particles with infinitely large size ratio and the packi...

متن کامل

Packing trees of bounded diameter into the complete graph

Let d be a positive integer. We prove that there exists a constant c = c(d) such that if T1, . . . , Tn is a sequence of trees such that |V (Ti)| = i, diam(Ti) ≤ d + 2, and there exists xi ∈ V (Ti) such that Ti−xi has at least (1− c)(i− 1) isolated vertices, then T1, . . . , Tn can be packed into Kn. This verifies a special case of the Tree Packing Conjecture. We then prove that if T is a tree ...

متن کامل

On Variable-Sized Multidimensional Packing

The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimensional bins of various sizes, and the goal is to minimize the total volume of the used bins. We show that the method used can also be extended to deal with the problem of resource augmented multidimensional packing, whe...

متن کامل

On Variable-Sized Bin Packing

In variable sized bin packing, a number of bin types are given and the goal is to pack a list of items by choosing appropriate bins such that the total size of bins used is minimized. In this paper, we present absolute worst-case analysis for on-line algorithms. Then we consider an related problem: how to design k different bin sizes such that for any item list the waste space of bins used is m...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 22  شماره 1

صفحات  57- 62

تاریخ انتشار 2009-04-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023