نتایج جستجو برای: bloom end phase

تعداد نتایج: 983265  

2014
Stefanie Hartman Chen Jody L. Plank Smaranda Willcox Jack D. Griffith Tao-shih Hsieh

Although Blm and Top3α are known to form a minimal dissolvasome that can uniquely undo a double Holliday junction structure, the details of the mechanism remain unknown. It was originally suggested that Blm acts first to create a hemicatenane structure from branch migration of the junctions, followed by Top3α performing strand passage to decatenate the interlocking single strands. Recent eviden...

2002
Paul D. Mitchell Tim C. Tozer David Grace

This paper introduces the Burst Targeted Demand Assignment Multiple Access scheme with Pure Demand assigned slots (BTDAMA-PD), which employs a different approach to implementing DAMA, suited to handling long bursts from ON-OFF type data traffic sources. Its delay/throughput performance is compared with a variant of the Combined Free/Demand Assignment Multiple Access (CFDAMA) schemes. Simulation...

2009
Julinda Taylor

Data caching provides efficient data access by maintaining replicas of data in strategic parts of the network. However, current research in this area does not manage memory space of each node efficiently. We propose an improvement by considering Bloom filters, a fast, spaceefficient probabilistic method for looking up data. We compare the system the system performance with and without Bloom fil...

2005
Christopher C. Parrish Raymond J. Thompson Don Deibel

Lipid concentration and composition were measured in net-tow and sediment trap samples during the spring diatom bloom in Conception Bay, Newfoundland, to determine the quantity and quality of material settling from the upper mixed layer into the benthic food web. An experiment was also conducted to estimate trap accuracy and precision, in which trap poisoning was found to reduce bacterially med...

2004
Stuart Faulk John Gustafson Philip Johnson Adam Porter Walter Tichy Lawrence Votta

One key to improving high-performance computing (HPC) productivity is finding better ways to measure it. We define productivity in terms of mission goals, i.e., greater productivity means that more science is accomplished with less cost and effort. Traditional software productivity metrics and computing benchmarks have proven inadequate for assessing or predicting such end-to-end productivity. ...

2004
Stuart Faulk John Gustafson Philip Johnson Adam Porter Walter Tichy Lawrence Votta

One key to improving high-performance computing (HPC) productivity is finding better ways to measure it. We define productivity in terms of mission goals, i.e., greater productivity means that more science is accomplished with less cost and effort. Traditional software productivity metrics and computing benchmarks have proven inadequate for assessing or predicting such end-to-end productivity. ...

Journal: :IJHPCA 2004
Stuart R. Faulk John Gustafson Philip Johnson Adam A. Porter Walter F. Tichy Lawrence G. Votta

One key to improving high performance computing (HPC) productivity is to find better ways to measure it. We define productivity in terms of mission goals, i.e. greater productivity means that more science is accomplished with less cost and effort. Traditional software productivity metrics and computing benchmarks have proven inadequate for assessing or predicting such end-to-end productivity. I...

2004
Satoshi Kawamura Huirong Fu Meegeum Choi Shanhong Wu

In this paper, we focus on mobility management and its deployment issues. There are many proposed mobility management mechanisms. However, the deployment of such mobility management has been facing difficulties and it is slower than it is initially expected. Therefore, we argue the issues to boost the deployment process. We especially focus on the end-toend approach, which can be mainly achieve...

1997
Saurav Chatterjee

An increasing number of applications execute over a set of computing and communication resources and have end-to-end quality of service (QoS) requirements. Given a system and an application with specific flow structure and QoS requirements, this paper describes an integrated QoS-based allocation and routing algorithm that determines which computing and communication resources to utilize for thi...

2003
Georgia Koloniari

In this paper, we present two novel hash-based indexing structures, based on Bloom filters, called Breadth and Depth Bloom filters, which in contrast to traditional hash-based indexes, are able to summarize hierarchical data and support regular path expression queries. We describe how these structures can be used for resource discovery in peer-to-peer networks. We have implemented both structur...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید