Random Packing Performance in Continuous Foam Fractionation

Author(s):  
Qianfeng Gu ◽  
Xiaochen Xue ◽  
Osama M. Darwesh ◽  
Pascal Habimana ◽  
Wei Liu ◽  
...  
LWT ◽  
2021 ◽  
Vol 142 ◽  
pp. 111093
Author(s):  
Wei Liu ◽  
Jingping Zhou ◽  
Fangdai Tan ◽  
Hao Yin ◽  
Chunyan Yang ◽  
...  

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1063
Author(s):  
Vladimir Mityushev ◽  
Zhanat Zhunussova

A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conductivity) of composites with ideally conducting spherical inclusions is established. The location of inclusions of the optimal-design problem yields the optimal packing of inclusions. The geometrical-packing and physical-conductivity problems are stated in a periodic toroidal d-dimensional space with an arbitrarily fixed number n of nonoverlapping spheres per periodicity cell. Energy E depends on Voronoi tessellation (Delaunay graph) associated with the centers of spheres ak (k=1,2,…,n). All Delaunay graphs are divided into classes of isomorphic periodic graphs. For any fixed n, the number of such classes is finite. Energy E is estimated in the framework of structural approximations and reduced to the study of an elementary function of n variables. The minimum of E over locations of spheres is attained at the optimal packing within a fixed class of graphs. The optimal-packing location is unique within a fixed class up to translations and can be found from linear algebraic equations. Such an approach is useful for random optimal packing where an initial location of balls is randomly chosen; hence, a class of graphs is fixed and can dynamically change following prescribed packing rules. A finite algorithm for any fixed n is constructed to determine the optimal random packing of spheres in Rd.


Solar Energy ◽  
2009 ◽  
Vol 83 (4) ◽  
pp. 511-521 ◽  
Author(s):  
Giovanni A. Longo ◽  
Andrea Gasparella

2021 ◽  
pp. 100135
Author(s):  
Shohre Tabibi ◽  
Mohsen Moussavi ◽  
Hadi Adlo

1989 ◽  
Vol 26 (03) ◽  
pp. 512-523
Author(s):  
Clifton Sutton

Codes having all pairs of words separated by a Hamming distance of at least d are stochastically constructed by sequentially packing randomly generated q-ary n-tuples. Estimates of the random packing densities are obtained by repeated simulation. Using non-linear regression to fit the estimated densities, an asymptotic approximation formula is obtained for the packing densities which depends only on q, n, d, and an empirical constant.


2000 ◽  
Vol 84-86 (1-9) ◽  
pp. 1087-1100 ◽  
Author(s):  
Liping Du ◽  
Veara Loha ◽  
Robert D. Tanner

2012 ◽  
Vol 27 (19) ◽  
pp. 2503-2510 ◽  
Author(s):  
Shashi Bairagi Atla ◽  
Chien-Yen Chen ◽  
Chien-Cheng Chen ◽  
Shao-Ju Shih ◽  
Pin-Yun Lin ◽  
...  

Abstract


Sign in / Sign up

Export Citation Format

Share Document