In this paper we study a game problem, called bin packing game with an interest matrix, which is a generalization of all the currently known bin packing games. In this game, there are some items with positive sizes and identical bins with unit capacity as in the classical bin packing problem; additionally we are given an interest matrix with rational entries, whose element aij stands for how mu...

We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for unif...

In the Bin Packing Problem with Conflicts (BPPC), we are given a set V = {1, 2, . . . , n} of items, each item i having a non-negative weight wi, and an infinite number of identical bins of weight capacity W . We are also given a conflict graph G = (V,E), where E is a set of edges such that (i, j) ∈ E when i and j are in conflict. Items in conflict cannot be assigned to the same bin. The aim of...

India is the second largest population country, so collecting and disposal of waste plays a vital role in day today life. This work proposes a clean city concept using Smart bin and its application though a proper interaction and networking with one to many devices. The paper presents a novel waste collection technique and interaction through a Smart bin which is developed using ARM LPC 2148 wi...

this article is concerned with a comparative review of jahân-nâme   by mohammad bin najib bakran and manuscripts of masâlek va mamâlek by abu al-hasan sâʽid bin ali jurjâni written by during the middle of ninth century ah. from this review it becomes clear that jorjâniʼs main source in writing his book was jahân-nâme and therefore jahân-nâme is also a good source for editing the masâlek.  howev...

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