United States Department of Energy

About: United States Department of Energy is a government organization based out in Washington D.C., District of Columbia, United States. It is known for research contribution in the topics: Catalysis & Coal. The organization has 13656 authors who have published 14177 publications receiving 556962 citations. The organization is also known as: DOE & Department of Energy.

Wind turbine concept market penetration over 10 years (1995–2004)

Abstract: The aim of this article is to investigate the market penetration and share of different wind turbine concepts during the years 1995–2004, a period that represents the maturational era of the modern wind power industry. A detailed overview is given based on suppliers' market data and concept evaluation for each individual wind turbine type sold by the Top Ten suppliers over the selected decade. The investigation is processing information on approximately 160 wind turbine types from 22 different manufacturers that have featured in the Top Ten list of wind turbine suppliers during 1995–2004. The analysis is based on comprehensive data covering approximately 97% of the cumulative wind power installed worldwide at the end of 2004. The article also provides an overall perspective on contemporary wind turbine concepts, classified with respect to both their speed control ability and power control type. Current and future trends for wind turbine concepts are discussed. Copyright © 2006 John Wiley &Sons, Ltd.

A constant-time kinetic Monte Carlo algorithm for simulation of large biochemical reaction networks

Abstract: The time evolution of species concentrations in biochemical reaction networks is often modeled using the stochastic simulation algorithm SSAGillespie, J. Phys. Chem. 81, 2340 1977. The computational cost of the original SSA scaled linearly with the number of reactions in the network. Gibson and Bruck developed a logarithmic scaling version of the SSA which uses a priority queue or binary tree for more efficient reaction selection Gibson and Bruck, J. Phys. Chem. A 104, 1876 2000. More generally, this problem is one of dynamic discrete random variate generation which finds many uses in kinetic Monte Carlo and discrete event simulation. We present here a constant-time algorithm, whose cost is independent of the number of reactions, enabled by a slightly more complex underlying data structure. While applicable to kinetic Monte Carlo simulations in general, we describe the algorithm in the context of biochemical simulations and demonstrate its competitive performance on small- and medium-size networks, as well as its superior constant-time performance on very large networks, which are becoming necessary to represent the increasing complexity of biochemical data for pathways that mediate cell function. © 2008 American Institute of Physics. DOI: 10.1063/1.2919546

Public health and components of particulate matter: The changing assessment of black carbon

Abstract: In 2012, the WHO classified diesel emissions as carcinogenic, and its European branch suggested creating a public health standard for airborne black carbon (BC). In 2011, EU researchers found that ...

Meraculous: de novo genome assembly with short paired-end reads.

Abstract: We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast Pichia stipitis. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer than 269 kilobases. Incorporating fosmid ends recovers entire chromosomes. Meraculous relies on an efficient and conservative traversal of the subgraph of the k-mer (deBruijn) graph of oligonucleotides with unique high quality extensions in the dataset, avoiding an explicit error correction step as used in other short-read assemblers. A novel memory-efficient hashing scheme is introduced. The resulting contigs are ordered and oriented using paired reads separated by ∼280 bp or ∼3.2 kbp, and many gaps between contigs can be closed using paired-end placements. Practical issues with the dataset are described, and prospects for assembling larger genomes are discussed.