A rolling inventory count is an ongoing inventory count done throughout the year. Parts are grouped into counting sections by supplier, part number, and/ or bin locations. Each group is frequently counted throughout the year to maintain a more accurate parts inventory. The goal with a rolling inventory count is to slowly rotating through the entire inventory before completing the annual parts i...

In this note we consider a new problem, the so-called bin-batching problem related to variablesized bin covering. A best possible on-line algorithm is presented. ? 2001 Elsevier Science B.V. All rights reserved.

Three-dimensional reconstruction of a dynamic object based on the structured light (SL) technique has attracted intensive research. Since a single projector only covers a limited area of the scene, multiple projectors should be employed simultaneously to extend the imaging area for a 3D object. However, patterns projected by different projectors superpose each other in a light-intersected area,...

The bin packing problem has been extensively studied and numerous variants have been considered. The k-item bin packing problem is one of the variants introduced by Krause et al. in Journal of the ACM 22(4). In addition to the formulation of the classical bin packing problem, this problem imposes a cardinality constraint that the number of items packed into each bin must be at most k. For the o...

It is important to know how the results from a land change model vary based on both the pixel resolution of the maps and the precision of the independent variables because subjective decisions or default values frequently determine these two factors. This paper presents an approach to measure the variation in model accuracy that is triggered by alteration of the pixel resolution and the precisi...

Corynebacteriophages beta and gamma are closely related but heteroimmune; hence, gamma reproduces in C7(beta). A series of gamma mutants, designated gamma-bin (beta-inhibited), has been isolated. They reproduce in only 2 to 14% of infected C7(beta) cells, and, as a result, plaque with an efficiency of 10(-4) to 10(-5) on this strain. The proportion of C7(beta) cells in which gamma-bin phage can...

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...

We present a scheme for linear optical quantum computing using time-bin-encoded qubits in a single spatial mode. We show methods for single-qubit operations and heralded controlled-phase (cphase) gates, providing a sufficient set of operations for universal quantum computing with the Knill-Laflamme-Milburn [Nature (London) 409, 46 (2001)] scheme. Our protocol is suited to currently available ph...

In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0,1], and reveal the conne...

Neurophysiologists often use histograms to explore patterns of activity in neural spike trains. The bin size selected to construct a histogram is crucial: too large bin widths result in coarse histograms, too small bin widths expand unimportant detail. Peri-stimulus time (PST) histograms of simulated nerve fibers were studied in the current article. This class of histograms gives information ab...