This research is on the survey of waste-bins and collection methodology in households of the Federal Capital City (FCC), Abuja, Nigeria. Solid waste management is a continually growing problem at global and local levels. Thousands of lives are lost every year to environmental-related diseases and cities have lost their aesthetic values to solid waste mismanagement; therefore, solid waste manage...

In this paper we consider the three-dimensional bin packing problem (3D-BPP), when the bins are identical with the aim of minimizing the number of the used bins. We introduce a mixed-integer linear programming formulation (MILP1). Some special valid inequalities will be presented in order to improve the relaxed lower bound of MILP1. A large set of experimental tests has been carried out. The ob...

In the bin packing problem, we get a sequence of packets of size r 1 ; r 2 ; r 3 ; : : :, each r i 1, and we must place the packets into bins of size 1 using as few bins as possible. The size of a bin is the accumulated size of all packets in the bin, and the free capacity of a bin is 1 minus its size.

ETHODS A 12-lead ECG was continuously recorded during 24 ours in 20 patients with BS (ages 49 12) and 10 healthy ubjects (ages 32 7). Using two-dimensional binning we obained average QRS-T complexes every 30 minutes (time bins) and t different RR intervals (rate bins) for each subject. ST level was easured at five different points located 90, 100, 110, 120, and 40 ms after Q onset (Qo). In BS p...

In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2,...,7. 200...

A conventional color histogram (CCH) considers neither the color similarity across different bins nor the color dissimilarity in the same bin. Therefore, it is sensitive to noisy interference such as illumination changes and quantization errors. Furthermore, CCHs large dimension or histogram bins requires large computation on histogram comparison. To address these concerns, this paper presents ...

The late blight pathogen Phytophthora infestans can attack both potato foliage and tubers. When inoculated with P. infestans, foliage of nontransformed 'Russet Burbank' (WT) develops late blight disease while that of transgenic 'Russet Burbank' line SP2211 (+RB) does not. We compared the foliar transcriptome responses of these two lines to P. infestans inoculation using an RNA-seq approach. A t...

We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is of n balls and n bins. The algorithms begin by each ball choosing d bins independently and uniformly at random. The balls and bins communicate to determine the assignment of each ball to a bin. The goal is to minimize...

In this paper we give an algorithm to generate all distributions of distinguishable objects to bins without repetition. Our algorithm generates each distribution in constant time. To the best of our knowledge, our algorithm is the first algorithm which generates each solution in O(1) time in ordinary sense. As a byproduct of our algorithm, we get a new algorithm to enumerate all multiset partit...

In this paper we propose a two-step mutual informationbased algorithm for medical image segmentation. In the first step, the image is structured into homogeneous regions, by maximizing the mutual information gain of the channel going from the histogram bins to the regions of the partitioned image. In the second step, the intensity bins of the histogram are clustered by minimizing the mutual inf...