OBJECTIVE To examine the utility of the Bayley Infant Neurodevelopmental Screener (BINS) as a screening technique for premature, low birth weight infants. METHODS One hundred thirty-three preterm infants <1,500 grams received a BINS assessment at mean adjusted age 6.8 months and a Bayley Scales of Infant Development, Second Edition (BSID-II) assessment at mean adjusted age 12.9 months. Infant...

In this version of Colored Bin-Packing, we have n items of unit weight, where each item is one of x colors, where x ≥ 3. Again, we have an unlimited supply of bins, each with weight limit L, in which to pack the items and our goal is to minimize the total number of bins. 2 Algorithm The unit-weight case introduces weight constraints. Furthermore, we know that color constraints, specifically the...

[1] Evaluating the impacts of atmospheric dust on marine ecosystems and climate requires the use of three-dimensional transport models including a size-resolved bins scheme to describe the evolution of the particle size distribution. Recently, Forêt et al. (2006) proposed an alternative size bins scheme to better account for the physical size-dependent processes such as dry deposition. This pap...

The standard approach of learning decision trees from histogram data is to treat the bins as independent variables. However, as the underlying dependencies among the bins might not be completely exploited by this approach, an algorithm has been proposed for learning decision trees from histogram data by considering all bins simultaneously while partitioning examples at each node of the tree. Al...

In this paper we consider a more complicated real-world problem originating in the steel industry. The bins are inhomogeneous sheets with impurities. We assume that each impure area is rectangle. For each bin we are given a set of impurities, size, and location of each impurity into the bin. As a consequence now the bins are not identical anymore and the number of bins is finite. Moreover, we i...

The balls-and-bins exercise that we did in Homework 1 is also useful for modeling Hashing. A hash function h from a universe U = [0, 1, .., m− 1] into a range [0, ..., n− 1] can be thought of as a way of placing items from the universe into n bins. The collection of bins is called a hash table. We can model the distribution of items in bins with the same distribution as m balls placed randomly ...

The 2-dimensional Bin Packing problem is a generalization of the classical Bin Packing problems and is defined as follows: Given a collection of rectangles specified by their width and height, the goal is to pack these into minimum number of square bins of unit size. Recently, the problem was proved to be APX-hard even in the asymptotic case, i.e. when the optimum solutions requires a large num...