نتایج جستجو برای: structured packing

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

Journal: :Discrete & Computational Geometry 2010
Yoav Kallus Veit Elser Simon Gravel

We present a one-parameter family of periodic packings of regular tetrahedra, with the packing fraction 100/117 ≈ 0.8547, that are simple in the sense that they are transitive and their repeating units involve only four tetrahedra. The construction of the packings was inspired from results of a numerical search that yielded a similar packing. We present an analytic construction of the packings ...

Journal: :Int. J. Math. Mathematical Sciences 2005
David Dennis G. Brock Williams

Given a bounded sequence of integers {d0,d1,d2, . . .}, 6 ≤ dn ≤M, there is an associated abstract triangulation created by building up layers of vertices so that vertices on the nth layer have degree dn. This triangulation can be realized via a circle packing which fills either the Euclidean or the hyperbolic plane. We give necessary and sufficient conditions to determine the type of the packi...

2006
Xin Han Deshi Ye Yong Zhou

In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing problem and obtain new upper bounds of asymptotic competitive ratios. For square packing, we get an upper bound of 2.1439, which is better than 2.24437. For c...

Journal: :Discrete Applied Mathematics 1997
Gyula Y. Katona

A graph is called a p{polyp if it consists of p simple paths of the same length and one endvertex of all these paths is a common vertex. The Polyp Packing problem is a generalization of the well known Bin Packing problem: How to pack a set of paths with diierent lengths to a set of polyps edge disjointly? It is proved that the Polyp Packing problem is NP-complete and that a modiication of the F...

Journal: :Annals OR 2013
Eunice López-Camacho Gabriela Ochoa Hugo Terashima-Marín Edmund K. Burke

This paper proposes an adaptation, to the two-dimensional irregular bin packing problem of the Djang and Finch heuristic (DJD), originally designed for the one-dimensional bin packing problem. In the two-dimensional case, not only is it the case that the piece’s size is important but its shape also has a significant influence. Therefore, DJD as a selection heuristic has to be paired with a plac...

Journal: :middle east journal of rehabilitation and health studies 0
seyed mahmoud mehdinia department of environmental health, damghan faculty of health, semnan university of medical sciences, damghan, ir iran; department of environmental health, damghan faculty of health, semnan university of medical sciences, damghan, ir iran. tel: +98-9123325372 puziah binti abdul latif department of environmental sciences, environmental studies faculty, university putra malaysia, serdang, malaysia

conclusions the mssrhs could be considered as a more suitable packing material for long-term biofilter operation to remove h2s pollution. results in this study, after 53 days of operating time and 54 g/m3h mass loading, the ph values in the ss and mssrhs packed filters were reduced from 6.8 to 1.8 and from 6.9 to 3.4, respectively. the mssrhs packed filter showed more buffering capacity to resi...

Journal: :SIAM J. Discrete Math. 1991
Donald K. Friesen Michael A. Langston

while w(d) = 4=15 and we conclude that, in any event, w(B 3) 1. Case 3. Suppose jB 3 j = 4. B 3 cannot contain an X 1 item, since 1=2 + 3(1=5) > 1. Neither can it contain two X 2 items, since 2(1=3) + 2(1=5) > 1. Similarly, it cannot contain four X 3 items, since each has size greater than 1/4. However, if it contains three items of type X 3 and one of type X 4 , then w(B 3) 3(4=15) + 1=5 = 1. ...

Journal: :JOURNAL OF THE MARINE ENGINEERING SOCIETY IN JAPAN 1968

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

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