Type 2 diabetes (2DM), obesity, and coronary artery disease (CAD) are frequently coexisted being as key components of metabolic syndrome. Whether there is shared genetic background underlying these diseases remained unclear. We performed a meta-analysis of 35 genome screens for 2DM, 36 for obesity or body mass index (BMI)-defined obesity, and 21 for CAD using genome search meta-analysis (GSMA),...

The computer program WPACKING was validated using bin data for three different bin conditions: 1) a smooth-walled bin filled with wheat, 2) a corrugated-walled bin filled with wheat, and 3) a corrugated-walled bin filled with corn. WPACKING is a computer program which utilizes the differential form of Janssen’s equation to predict the pressures and amount of material stored in a bin. The differ...

We study a variety of NP-hard bin packing problems under a divisibility constraint that generalizes the often encountered situation in which all item sizes are powers of 2. For ordinary one-dimensional bin packing, we show that First Fit Decreasing produces optimal packings under this restriction, and that if in addition the largest item size divides the bin capacity, then even the less powerfu...

Page-coloring and bin-hopping are two well-known page mapping schemes for reducing cache connicts. Previous work found bin-hopping to have 4% less cache miss rate than page-coloring on uniprocessor machines. Using execution-driven simulations, we nd that bin-hopping signiicantly outperforms simplistic page-coloring on CC-NUMA multipro-cessors. In certain cases, bin-hopping has 32% to 58% less e...

Bacillus thuringiensis (Bt) is a Gram positive, spore-forming bacterium that synthesizes parasporal crystalline inclusions containing Cry and Cyt proteins, some of which are toxic against a wide range of insect orders, nematodes and human-cancer cells. These toxins have been successfully used as bioinsecticides against caterpillars, beetles, and flies, including mosquitoes and blackflies. Bt al...

We introduce a constraint for one-dimensional bin packing. This constraint uses propagation rules incorporating knapsack-based reasoning, as well as a lower bound on the number of bins needed. We show that this constraint can significantly reduce search on bin packing problems. We also demonstrate that when coupled with a standard bin packing search strategy, our constraint can be a competitive...

3 Running ASpli 2 3.1 To BIN or not to BIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.2 Read Counting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2.1 Mapping file and bam loading . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.2.2 Overlap features and read ali...