When a data point, measured over a bin of finite width, is to be compared to theoretical or model frequency distributions, neither the central value of the bin nor the weighted mean value (the barycentre) of the abscissa within the bin is the appropriate place to plot the data point. It is shown that such data points ought to appear where the value of the predicted function is equal to its mean...

2D fingerprint based similarity searching using a single bioactive reference is the most popular and effective virtual screening tool. In our last paper, we have introduced a novel method for similarity searching using Bayesian inference network (BIN). In this study, we have compared BIN with other similarity searching methods when multiple bioactive reference molecules are available. Three dif...

In this paper, we present an O(n1ogn) algorithm to compute a tighter lower bound for the one-dimensional bin packing problem. We have simulated the algorithm on randomly generated bin packing problems with item sizes drawn uniformly from (a, b], where 0 5 a < b 5 B and B is bin size. Using our lower bound, the average error of BFD is less than 2%. For a + b > B, the error is less than 0.003%. K...

We discuss architecture, subsystems, and applications of a multichannel digital correlator we constructed by using a combination of optical and electrical delays. Our system is capable of a 1-ns bin width in normal operation, when a derandomizer is used at the input stage and a 0.25-ns bin width when the derandomizer is bypassed. When switchable delay lines are used, the 16 real-time channels c...

The bin packing optimization problem packs a set of objects into a set of bins so that the amount of wasted space is minimized The bin packing problem has many important applications These include multiprocessor scheduling resource allocation and real world planning packing routing and scheduling optimization problems The bin packing problem is NP complete Since there is therefore little hope i...

An open question in cloud physics is how rain forms in warm cumulus as rapidly as it is sometimes observed. In particular, the growth of cloud droplets across the size gap from 10 to 50 m in radius has not been fully explained. In this paper, the authors investigate the growth of cloud droplets by collision– coalescence, taking into account both the gravitational mechanism and several enhanceme...

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

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