942 resultados para Collection
Resumo:
A new type of macro-micro-macro triple electrode has been fabricated, the steady-state currents of solution redox species have been observed at an ultramicroband electrode by linear potential scan voltammetry, and generation/collection experiments have al
Resumo:
Prompted by claims that garbage collection can outperform stack allocation when sufficient physical memory is available, we present a careful analysis and set of cross-architecture measurements comparing these two approaches for the implementation of continuation (procedure call) frames. When the frames are allocated on a heap they require additional space, increase the amount of data transferred between memory and registers, and, on current architectures, require more instructions. We find that stack allocation of continuation frames outperforms heap allocation in some cases by almost a factor of three. Thus, stacks remain an important implementation technique for procedure calls, even in the presence of an efficient, compacting garbage collector and large amounts of memory.
Resumo:
Conventional parallel computer architectures do not provide support for non-uniformly distributed objects. In this thesis, I introduce sparsely faceted arrays (SFAs), a new low-level mechanism for naming regions of memory, or facets, on different processors in a distributed, shared memory parallel processing system. Sparsely faceted arrays address the disconnect between the global distributed arrays provided by conventional architectures (e.g. the Cray T3 series), and the requirements of high-level parallel programming methods that wish to use objects that are distributed over only a subset of processing elements. A sparsely faceted array names a virtual globally-distributed array, but actual facets are lazily allocated. By providing simple semantics and making efficient use of memory, SFAs enable efficient implementation of a variety of non-uniformly distributed data structures and related algorithms. I present example applications which use SFAs, and describe and evaluate simple hardware mechanisms for implementing SFAs. Keeping track of which nodes have allocated facets for a particular SFA is an important task that suggests the need for automatic memory management, including garbage collection. To address this need, I first argue that conventional tracing techniques such as mark/sweep and copying GC are inherently unscalable in parallel systems. I then present a parallel memory-management strategy, based on reference-counting, that is capable of garbage collecting sparsely faceted arrays. I also discuss opportunities for hardware support of this garbage collection strategy. I have implemented a high-level hardware/OS simulator featuring hardware support for sparsely faceted arrays and automatic garbage collection. I describe the simulator and outline a few of the numerous details associated with a "real" implementation of SFAs and SFA-aware garbage collection. Simulation results are used throughout this thesis in the evaluation of hardware support mechanisms.
Resumo:
J. Keppens, Q. Shen and B. Schafer. Probabilistic abductive computation of evidence collection strategies in crime investigation. Proceedings of the 10th International Conference on Artificial Intelligence and Law, pages 215-225.
Resumo:
Printed pamphlet of sermons presented by ministers and pastors after the death of President James A. Garfield.
Resumo:
http://www.archive.org/details/lecturesmissions00unknuoft
Resumo:
This file contains a finding aid for the American Palestine Exploration Society Photograph Collection. To access the collection, please contact the archivist (asorarch@bu.edu) at the American Schools of Oriental Research, located at Boston University.
Resumo:
This file contains a finding aid for the Bulletin of the American Schools of Oriental Research (BASOR) Collection. To access the collection, please contact the archivist (asorarch@bu.edu) at the American Schools of Oriental Research, located at Boston University.
Resumo:
This is a draft 2 of a discussion paper written for Boston University Libraries
Resumo:
National Institute of Child Health and Human Development (HD051804)
Resumo:
Édition d'une étiquette de momie portant un texte en copte.
Resumo:
Paris
Resumo:
High-efficiency collection of photons emitted by a point source over a wide field of view (FoV) is crucial for many applications. Multiscale optics offer improved light collection by utilizing small optical components placed close to the optical source, while maintaining a wide FoV provided by conventional imaging optics. In this work, we demonstrate collection efficiency of 26% of photons emitted by a pointlike source using a micromirror fabricated in silicon with no significant decrease in collection efficiency over a 10 mm object space.
Resumo:
Traces the history of Duke's East Asian Studies program and associated library collections from the beginning of the twentieth century to the present. Describes the strengths of the Japanese, Chinese and Korean collections, materials in special collections and cooperation with the University of North Carolina.
Resumo:
We recently developed an approach for testing the accuracy of network inference algorithms by applying them to biologically realistic simulations with known network topology. Here, we seek to determine the degree to which the network topology and data sampling regime influence the ability of our Bayesian network inference algorithm, NETWORKINFERENCE, to recover gene regulatory networks. NETWORKINFERENCE performed well at recovering feedback loops and multiple targets of a regulator with small amounts of data, but required more data to recover multiple regulators of a gene. When collecting the same number of data samples at different intervals from the system, the best recovery was produced by sampling intervals long enough such that sampling covered propagation of regulation through the network but not so long such that intervals missed internal dynamics. These results further elucidate the possibilities and limitations of network inference based on biological data.