The proportion of plastic bottles that consumers placed in appropriate recycling receptacles rather than trash bins was examined across 3 buildings on a university campus. We extended previous research on interventions to increase recycling by controlling the number of recycling receptacles across conditions and by examining receptacle location without the use of posted signs. Manipulating the ...

Gray leaf spot [GLS, causal agent Cercospora zeae-maydis (Tehon and E. Y. Daniels)] is an important fungal disease of maize in the U.S. and worldwide. The IBM population, an advanced intercross recombinant inbred line population derived from a cross between the maize lines Mo17 (resistant) and B73 (susceptible), was evaluated in three environments (Andrews, NC in 2005, 2006, and 2007) for resis...

4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Total number of low-diversity bins . . . . . Total number of bins . . . . . . . . . . . . . . . . . 0 0 5 or fewer 187 or mor...

We study on-line bounded space bin-packing in the resource augmentation model of competitive analysis. In this model, the on-line bounded space packing algorithm has to pack a list L of items with sizes in (0, 1], into a minimum number of bins of size b, b ≥ 1. A bounded space algorithm has the property that it only has a constant number of active bins available to accept items at any point dur...

We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum number of such bins. In contrast, in the bin-stretching problem we x the number of bins and try to pack the items while stretching the size of the bins as least as possible. We present two on-line algorithms for the bi...

We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an allowed size for this item, together with a nonnegative penalty, and an item can be packed using any configuration in its list. The goal is to select a configuration for each item so that the number of unit bins needed...

This paper proposes a computationally efficient method for computing the constant-Q transform (CQT) of a timedomain signal. CQT refers to a time-frequency representation where the frequency bins are geometrically spaced and the Q-factors (ratios of the center frequencies to bandwidths) of all bins are equal. An inverse transform is proposed which enables a reasonable-quality (around 55dB signal...

The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on Guided Local Search (GLS). Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching ...

The correct models for quantitative trait locus mapping are the ones that simultaneously include all significant genetic effects. Such models are difficult to handle for high marker density. Improving statistical methods for high-dimensional data appears to have reached a plateau. Alternative approaches must be explored to break the bottleneck of genomic data analysis. The fact that all markers...