A new microphysical scheme that uses lognormal basis functions to represent cloud and drizzle Ž . drop spectra is presented. The scheme is incorporated in a two-dimensional 2-D eddy-resolving model and applied to the simulation of a stratocumulus cloud deck based on a sounding from the Atlantic Stratocumulus Transition Experiment. Firstly, the philosophy behind the design of the scheme is discu...

There are errors in the Funding section. The correct funding information is as follows: This study was supported by the Mohamed bin Zayed Species Conservation Fund (IK, MS, AKH, AG, http://www.speciesconservation.org/, project No. 12255025) and Erasmus Mundus/ ALRAKIS (IK, http://www.alrakis.eu/, projects No. 2011-2577 and No. 2012-2733). Currently, IK and MW receive funding from Alexander von ...

This report describes the rationale, approaches, organization, and resource development leading to a large-scale deletion bin map of the hexaploid (2n = 6x = 42) wheat genome (Triticum aestivum L.). Accompanying reports in this issue detail results from chromosome bin-mapping of expressed sequence tags (ESTs) representing genes onto the seven homoeologous chromosome groups and a global analysis...

The bin packing game is a cooperative N -person game, where the set of players consists of k bins, each has capacity 1 and n items of sizes a1, a2, ⋅ ⋅ ⋅ , an, w.l.o.g, we assume 0 ≤ ai ≤ 1 for all 1 ≤ i ≤ n. The value function of a coalition of bins and items is the maximum total size of items in the coalition that can be packed into the bins of the coalition. A typical question of the bin pac...

The bin-packing problem is to partition a multiset of n numbers into as few bins of capacity C as possible, such that the sum of the numbers in each bin does not exceed C. We compare two existing algorithms for solving this problem: bin completion (BC) and branch-and-cut-and-price (BCP). We show experimentally that the problem difficulty and dominant algorithm are a function of n, the precision...

We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied...