Adult insects entering 34 bins (36-238 t capacity) storing newly harvested hard red winter wheat on 12 farms in Kansas were sampled from July through December 1998 using ventilation traps. Insects moving through the grain stored in these bins were sampled using probe traps. During the fourth week of storage, probe traps captured Cryptolestes ferrugineus in all bins, Ahasverus advena in 32 bins,...

A decision support system, Stored Grain Advisor Pro (SGA Pro) was developed to provide insect pest management information for wheat stored at commercial elevators. The program uses a model to predict future risk based on current insect density, grain temperature and moisture. A rule-based system was used to provide advice and recommendations to grain managers. The software was tested in a resea...

BACKGROUND Biodiversity patterns are inherently complex and difficult to comprehensively assess. Yet, deciphering shifts in species composition through time and space are crucial for efficient and successful management of ecosystem services, as well as for predicting change. To better understand species diversity patterns, Germany participated in the Global Malaise Trap Program, a world-wide co...

In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bo...

Histograms are convenient non-parametric density estimators, which continue to be used ubiquitously. Summary quantities estimated from histogram-based probability density models depend on the choice of the number of bins. In this paper we introduce a straightforward data-based method of determining the optimal number of bins in a uniform bin-width histogram. Using the Bayesian framework, we der...

We consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fixed number of bins, the objective is to put all the items into the bins by splitting them in a minimum number of fragments. This problem is useful for modeling splittable resource allocation. In this paper we introduce the problem and its complexity then we present a 6 5 -approximation algorithm for a sp...