In the bin packing problem we are given an instance consisting of a sequence of items with sizes between 0 and 1. The objective is to pack these items into the smallest possible number of bins of unit size. FirstFit and BestFit algorithms are simple online algorithms introduced in early seventies, when it was also shown that their asymptotic approximation ratio is equal to 1.7. We present a sim...

BACKGROUND The geometrid moths of Europe are one of the best investigated insect groups in traditional taxonomy making them an ideal model group to test the accuracy of the Barcode Index Number (BIN) system of BOLD (Barcode of Life Datasystems), a method that supports automated, rapid species delineation and identification. METHODOLOGY/PRINCIPAL FINDINGS This study provides a DNA barcode libr...

Field studies were conducted from July 2002 to January 2003 for evaluating the effects of controlled aeration and a commercial biological insecticide, spinosad, in suppressing insect populations in stored wheat. Six cylindrical steel bins were filled with newly harvested (2002 crop year) hard red winter wheat on 9 and 10 July 2002. Each bin contained 30.7 metric tons (1,100 bu) of wheat. Wheat ...

We study a particular aspect of the balanced allocation paradigm (also known as the “twochoices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be fixed, and assume there are m bins of capacity d each. To each of n ≤ dm balls two possible bins are assigned at random. How close can dm/n = 1+ε be to 1 so that with high probability each ball can be put into one of the two...

Aeration using automatic controllers was compared with manually‐activated aeration (manual aeration) in bins of farm‐stored rice in Nome, Texas, from 17 September 2002 through the end of the year. Manual aeration was defined as the farm owner manually activating the fans in mid‐October, while automatic aeration employed activation temperatures of 23.9 C, 15.6 C, and 7.2 C for three discreet coo...

(www.aaai.org). All rights reserved. Creating strategies for different games forces us to grapple with different types of decision-making challenges. Poker is a stochastic game of imperfect information; unlike games of complete information, game-theoretic optimal strategies for poker can be randomized. Koller and Pfeffer [1] argue that two-player poker can be solved efficiently in the size of t...