The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. We provide a series of tail bounds on the distribution of the number of empty bins. These tail bounds should find application in randomized algorithms and probabilistic analysis. Our motivating application is the following well-known conjecture on threshol...

This paper presents the use of genetic algorithms (GA) for solving the dual bin packing problem using fuzzy objectives. In bin packing problems, a list, L of items is to be packed into a minimum number of bins. In dual bin packing the items are packed into a maximum number of bins, assuring a minimum weight for each bin. We consider a class which we call dynamic dual bin packingg. Similar to th...

We consider the two-dimensional bin packing problem (BPP): given a set of rectangular items, find the minimal number of rectangular bins needed to pack all items. Rotation of the items is not permitted. We show for any integer k ≥ 3 that at most k − 1 bins are needed to pack all items if every item fits into a bin and if the total area of items does not exceed k/4-times the bin area. Moreover, ...

The author presents a sequence of linear-time, bounded-space, on-line, bin-packing algorithms that are based on the "HARMONIC" algorithms Hk introduced by Lee and Lee [J. Assoc. Comput. Mach., 32 (1985), pp. 562-572 ]. The algorithms in this paper guarantee the worst case performance of Hk, whereas they only use O(log log k) instead ofk active bins. For k >_6, the algorithms in this paper outpe...

Based on the invariant features and data distribution in time domain before and after attacking on the audio, it is clearly that the standard variance shows good invariant statistical feature. The relation of four consecutive bins in a histogram maintains change less than 5%. Then, a general data selection approach, which meets the demands of normal distribution and other distributions, is crea...

These integrations can sometimes be performed analytically, or using some numerical integration techniques. However, we will focus instead on a simple heuristic method which is related to the χ statistics discussed above. Note that David MacKay [3] explicitly assumes the parameters have an ’intrinsic’ arity to them (multinomials with an intrinsic number of bins). This assumption may not be alwa...

In the frequency-domain, a convolutive mixture can be interpreted as several instantaneous mixtures which may be separated using many existing algorithms. The main limitation of this approach is the large number of frequencies that must be considered. In addition, a permutation/amplitude correction must be performed when the sources are recovered in a different order or with different amplitude...

A collision model, modified from the Smoluchowski model, is developed for simulating coagulation and growth of a large number of aerosol particles with significantly different sizes. In this collision model, the particle-size distribution is discretized in volume bins, and the total mass among all the bins is conserved. In situations with significantly different particle sizes, the present mode...

We consider the asymptotic behavior of the following model: balls are sequentially thrown into bins so that the probability that a bin with n balls obtains the next ball is proportional to f(n) for some function f . A commonly studied case where there are two bins and f(n) = np for p > 1. In this case, one of the two bins eventually obtains a monopoly, in the sense that it obtains all balls thr...