We consider ensembles of channel codes that are partitioned into bins, and focus on analysis of exact random coding error exponents associated with optimum decoding of the index of the bin to which the transmitted codeword belongs. Two main conclusions arise from this analysis: (i) for independent random selection of codewords within a given type class, the random coding exponent of optimal bin...

This whitepaper offers a brief introduction to the BIN system of the Social, Political and Economic Event Database (SPEED) project. BIN provides automatic document categorization of highly nuanced topics across massive-scale document archives. The BIN system allows a group of trained human editors to present the computer with a relatively small collection of hand-categorized documents represent...

Bin packing is a well studied problem involved in many applications. The classical bin packing problem is about minimising the number of bins and ignores how the bins are utilised. We focus in this paper, on a variant of bin packing that is at the heart of efficient management of data centres. In this context, servers can be viewed as bins and virtual machines as items. The efficient management...

The three-dimensional bin packing problem is a practical problem faced in modern industrial processes such as container ship loading, pallet loading, plane cargo management, and warehouse management. This article considers a three-dimensional bin packing problem in which objects of various volumes are packed into a single bin to maximize the number of objects packed. The bin packing problem ini...

Imagine that there are two bins to which balls are added sequentially, and each incoming ball joins a bin with probability proportional to the pth power of the number of balls already there. A general result says that if p > 1/2, there almost surely is some bin that will have more balls than the other at all large enough times, a property that we call eventual leadership. In this paper, we comp...

The lower bound on First-Fit's accommodating ratio, for the Unit Price Bin Packing problem, is improved to 5=8.

In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some xed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present the rst unbounded space algorithms for this problem. We also show the rst lower bounds on the asymptotic performance ratio. The case where bins of two sizes, 1 and 2 (0; 1), are ...

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build o...

This paper deals to solve the one dimensional bin-packing problem with conflicts. The conflicts are represented by a graph whose nodes are the items, and adjacent items cannot be packed into the same bin. We propose an adaptation of Minimum Bin Slack heuristic also with a combination of heuristics based on the uses of the classical bin-packing methods to packing items of maximal-stable-subsets ...

This paper describes the application of an unscented Kalman filter to a coal runof-mine bin. A dynamic model of the bin is derived using the principle of mass conservation. The dynamic model is nonlinear with unknown parameters that are identified using actual plant production data. The identified dynamic model is used by an unscented Kalman filter to update the states of the system to improve ...