We introduce and study the batched bin packing problem (BBPP), a bin packing problem in which items become available for packing incrementally, one batch at a time. A batched algorithm must pack a batch before the next batch becomes known. A batch may contain several items; the special case when each batch consists of merely one item is the well-studied on-line bin packing problem. We obtain lo...

Monoand bi-disperse rectangular cuboidal granules are assembled from colloid-hydrogel suspensions via stop-flow lithography and fully submerged in hexadecane. Their packing density and structural evolution are studied as a function of agitation time using micro-computed X-ray tomography. When subjected to periodic agitation, the granule packing density increases logarithmically in time; concomi...

In this paper we consider the two-dimensional rectangular packing problem, where a fixed set of items have to be allocated on a single object. Two heuristics, which belong to the class of packing procedures that preserve bottom-left stability, are hybridised with three meta-heuristic algorithms (genetic algorithms, simulated annealing, naïve evolution) and local search heuristic (hill-climbing)...

We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-boundedspace bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we sho...

We study the internal dynamical processes taking place in a granular packing below yield stress. At all packing fractions and down to vanishingly low applied shear, a logarithmic creep is observed. The experiments are analyzed using a viscoelastic model which introduces an internal, time-dependent, fluidity variable. For all experiments, the creep dynamics can be rescaled onto a unique curve wh...

Let F0 be a fixed k-uniform hypergraph. The problem of finding the integer F0-packing number νF0 (H) of a k-uniform hypergraph H is an NP-hard problem. Finding the fractional F0-packing number ν∗ F0 (H) however can be done in polynomial time. In this paper we give a lower bound for the integer F0-packing number νF0 (H) in terms of ν∗ F0 (H) and show that νF0 (H) ≥ ν∗ F0 (H)− o(|V (H)| k).

We study (vertex-disjoint) P2-packings in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use extremal arguments for determining how many vertices of P appear in some P2-packing of size (j+1). We basically can ’reuse’ 2.5j vertices. We also present a kernelization algorithm that gives a kernel of size bounded by 7k. With these two results we build an ...

Many high performance applications spend considerable timepacking data into contiguous communication buffers. Datatypesprovide an alternative by describing the layout of the communi-cated data. This empowers the runtime system to retrieve non-contiguous elements directly from application data structures.However, programmers find complex datatypes hard to use andare reluc...

introduction: controversy remains as to the advantages and disadvantages of pharyngeal packing during septorhinoplasty. our study investigated the effect of pharyngeal packing on postoperative nausea and vomiting and sore throat following this type of surgery or septorhinoplasty.   materials and methods: this clinical trial was performed on 90 american society of anesthesiologists (asa) i or ii...

brass ferrules have been used as packing in a laboratory- scale glass distillation column approaching pilot plant size because of their availability in all sizes and low cost. the available size range is such that these ferrules could also be used in industry and the results of this study could be scaled up. the performance of the new packing has been compared with the performance of glass pack...