D. E. Shaw & Co.

About: D. E. Shaw & Co. is a based out in . It is known for research contribution in the topics: Galaxy & Redshift. The organization has 37 authors who have published 63 publications receiving 3850 citations.

PHASE: a new engine for pharmacophore perception, 3D QSAR model development, and 3D database screening: 1. Methodology and preliminary results

Abstract: We introduce PHASE, a highly flexible system for common pharmacophore identification and assessment, 3D QSAR model development, and 3D database creation and searching. The primary workflows and tasks supported by PHASE are described, and details of the underlying scientific methodologies are provided. Using results from previously published investigations, PHASE is compared directly to other ligand-based software for its ability to identify target pharmacophores, rationalize structure-activity data, and predict activities of external compounds.

The multiflow trace scheduling compiler

Abstract: The Multiflow compiler uses the trace scheduling algorithm to find and exploit instruction-level parallelism beyond basic blocks. The compiler generates code for VLIW computers that issue up to 28 operations each cycle and maintain more than 50 operations in flight. At Multiflow the compiler generated code for eight different target machine architectures and compiled over 50 million lines of Fortran and C applications and systems code. The requirement of finding large amounts of parallelism in ordinary programs, the trace scheduling algorithm, and the many unique features of the Multiflow hardware placed novel demands on the compiler. New techniques in instruction scheduling, register allocation, memory-bank management, and intermediate-code optimizations were developed, as were refinements to reduce the overhead of trace scheduling. This article describes the Multiflow compiler and reports on the Multiflow practice and experience with compiling for instruction-level parallelism beyond basic blocks.

The PRIsm MUlti-object Survey (PRIMUS). I. Survey Overview and Characteristics

Abstract: We present the PRIsm MUlti-object Survey (PRIMUS), a spectroscopic faint galaxy redshift survey to z ~ 1. PRIMUS uses a low-dispersion prism and slitmasks to observe ~2500 objects at once in a 0.18 deg2 field of view, using the Inamori Magellan Areal Camera and Spectrograph camera on the Magellan I Baade 6.5 m telescope at Las Campanas Observatory. PRIMUS covers a total of 9.1 deg2 of sky to a depth of i AB ~ 23.5 in seven different deep, multi-wavelength fields that have coverage from the Galaxy Evolution Explorer, Spitzer, and either XMM or Chandra, as well as multiple-band optical and near-IR coverage. PRIMUS includes ~130,000 robust redshifts of unique objects with a redshift precision of σ z /(1 + z) ~ 0.005. The redshift distribution peaks at z ~ 0.6 and extends to z = 1.2 for galaxies and z = 5 for broad-line active galactic nuclei. The motivation, observational techniques, fields, target selection, slitmask design, and observations are presented here, with a brief summary of the redshift precision; a forthcoming paper presents the data reduction, redshift fitting, redshift confidence, and survey completeness. PRIMUS is the largest faint galaxy survey undertaken to date. The high targeting fraction (~80%) and large survey size will allow for precise measures of galaxy properties and large-scale structure to z ~ 1.

Primus: the dependence of agn accretion on host stellar mass and color

Abstract: We present evidence that the incidence of active galactic nuclei (AGNs) and the distribution of their accretion rates do not depend on the stellar masses of their host galaxies, contrary to previous studies. We use hard (2-10 keV) X-ray data from three extragalactic fields (XMM-LSS, COSMOS, and ELAIS-S1) with redshifts from the Prism Multi-object Survey to identify 242 AGNs with L{sub 2-10keV} = 10{sup 42-44} erg s{sup -1} within a parent sample of {approx}25,000 galaxies at 0.2 < z < 1.0 over {approx}3.4 deg{sup 2} and to i {approx} 23. We find that although the fraction of galaxies hosting an AGN at fixed X-ray luminosity rises strongly with stellar mass, the distribution of X-ray luminosities is independent of mass. Furthermore, we show that the probability that a galaxy will host an AGN can be defined by a universal Eddington ratio distribution that is independent of the host galaxy stellar mass and has a power-law shape with slope -0.65. These results demonstrate that AGNs are prevalent at all stellar masses in the range 9.5< log M{sub *}/M{sub sun}<12 and that the same physical processes regulate AGN activity in all galaxies in this stellar mass range. While a higher AGN fraction maymore » be observed in massive galaxies, this is a selection effect related to the underlying Eddington ratio distribution. We also find that the AGN fraction drops rapidly between z {approx} 1 and the present day and is moderately enhanced (factor {approx}2) in galaxies with blue or green optical colors. Consequently, while AGN activity and star formation appear to be globally correlated, we do not find evidence that the presence of an AGN is related to the quenching of star formation or the color transformation of galaxies.« less

On the complexity of scheduling in wireless networks

Abstract: We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference models, under which no two links within a K-hop distance can successfully transmit at the same time. For a given K, we can obtain a throughput-optimal scheduling policy by solving the well-known maximum weighted matching problem. We show that for K > 1, the resulting problems are NP-Hard that cannot be approximated within a factor that grows polynomially with the number of nodes. Interestingly, for geometric unit-disk graphs that can be used to describe a wide range of wireless networks, the problems admit polynomial time approximation schemes within a factor arbitrarily close to 1. In these network settings, we also show that a simple greedy algorithm can provide a 49-approximation, and the maximal matching scheduling policy, which can be easily implemented in a distributed fashion, achieves a guaranteed fraction of the capacity region for "all K." The geometric constraints are crucial to obtain these throughput guarantees. These results are encouraging as they suggest that one can develop low-complexity distributed algorithms to achieve near-optimal throughput for a wide range of wireless networks.