77 FR 18997 - Rim Lakes Forest Restoration Project; Apache-Sitgreavese National Forest, Black Mesa Ranger...

Science.gov (United States)

2012-03-29

... DEPARTMENT OF AGRICULTURE Forest Service Rim Lakes Forest Restoration Project; Apache-Sitgreavese National Forest, Black Mesa Ranger District, Coconino County, AZ AGENCY: Forest Service, USDA. ACTION: Notice of intent to prepare an environmental impact statement. SUMMARY: The U.S. Forest Service (FS) will...

ERA`s Ranger uranium mine

Energy Technology Data Exchange (ETDEWEB)

Davies, W. [Energy Resources of Australia Ltd., Sydney, NSW (Australia)

1997-12-31

Energy Resource of Australia (ERA) is a public company with 68% of its shares owned by the Australian company North Limited. It is currently operating one major production centre - Ranger Mine which is 260 kilometres east of Darwin, extracting and selling uranium from the Ranger Mine in the Northern Territory to nuclear electricity utilities in Japan, South Korea, Europe and North America. The first drum of uranium oxide from Ranger was drummed in August 1981 and operations have continued since that time. ERA is also in the process of working towards obtaining approvals for the development of a second mine - Jabiluka which is located 20 kilometres north of Ranger. The leases of Ranger and Jabiluka adjoin. The Minister for the Environment has advised the Minister for Resources and Energy that there does not appear to be any environmental issue which would prevent the preferred Jabiluka proposal from proceeding. Consent for the development of ERA`s preferred option for the development of Jabiluka is being sought from the Aboriginal Traditional Owners. Ranger is currently the third largest producing uranium mine in the world producing 4,237 tonnes of U{sub 3}O{sub 8} in the year to June 1997.

75 FR 16728 - Beaver Creek Landscape Management Project, Ashland Ranger District, Custer National Forest...

Science.gov (United States)

2010-04-02

... DEPARTMENT OF AGRICULTURE Forest Service Beaver Creek Landscape Management Project, Ashland Ranger... manner that increases resiliency of the Beaver Creek Landscape Management Project area ecosystem to... requirements to require. The Beaver Creek Landscape Management Project includes treatments previously proposed...

CryptoCache: A Secure Sharable File Cache for Roaming Users

DEFF Research Database (Denmark)

Jensen, Christian D.

2000-01-01

. Conventional distributed file systems cache everything locally or not at all; there is no possibility to cache files on nearby nodes.In this paper we present the design of a secure cache system called CryptoCache that allows roaming users to cache files on untrusted file hosting servers. The system allows...... flexible sharing of cached files among unauthenticated users, i.e. unlike most distributed file systems CryptoCache does not require a global authentication framework.Files are encrypted when they are transferred over the network and while stored on untrusted servers. The system uses public key......Small mobile computers are now sufficiently powerful to run many applications, but storage capacity remains limited so working files cannot be cached or stored locally. Even if files can be stored locally, the mobile device is not powerful enough to act as server in collaborations with other users...

76 FR 13344 - Beaver Creek Landscape Management Project, Ashland Ranger District, Custer National Forest...

Science.gov (United States)

2011-03-11

... DEPARTMENT OF AGRICULTURE Forest Service Beaver Creek Landscape Management Project, Ashland Ranger... Impact Statement for the Beaver Creek Landscape Management Project was published in the Federal Register... Responsible Official for the Beaver Creek Landscape Management Project. DATES: The Final Environmental Impact...

Allegheny County Park Rangers Outreach

Data.gov (United States)

Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Launched in June 2015, the Allegheny County Park Rangers program reached over 48,000 people in its first year. Park Rangers interact with residents of all ages and...

Caching Patterns and Implementation

Directory of Open Access Journals (Sweden)

Octavian Paul ROTARU

2006-01-01

Full Text Available Repetitious access to remote resources, usually data, constitutes a bottleneck for many software systems. Caching is a technique that can drastically improve the performance of any database application, by avoiding multiple read operations for the same data. This paper addresses the caching problems from a pattern perspective. Both Caching and caching strategies, like primed and on demand, are presented as patterns and a pattern-based flexible caching implementation is proposed.The Caching pattern provides method of expensive resources reacquisition circumvention. Primed Cache pattern is applied in situations in which the set of required resources, or at least a part of it, can be predicted, while Demand Cache pattern is applied whenever the resources set required cannot be predicted or is unfeasible to be buffered.The advantages and disadvantages of all the caching patterns presented are also discussed, and the lessons learned are applied in the implementation of the pattern-based flexible caching solution proposed.

78 FR 69147 - Ranger Alternative Management, L.P. and Ranger Funds Investment Trust; Notice of Application

Science.gov (United States)

2013-11-18

...] Ranger Alternative Management, L.P. and Ranger Funds Investment Trust; Notice of Application November 12... Application: Applicants request an order that would permit (a) certain open-end management investment... Units; and (e) certain registered management investment companies and unit investment trusts outside of...

CacheCard : Caching static and dynamic content on the NIC

NARCIS (Netherlands)

Bos, Herbert; Huang, Kaiming

2009-01-01

CacheCard is a NIC-based cache for static and dynamic web content in a way that allows for implementation on simple devices like NICs. It requires neither understanding of the way dynamic data is generated, nor execution of scripts on the cache. By monitoring file system activity and potential

A method cache for Patmos

DEFF Research Database (Denmark)

Degasperi, Philipp; Hepp, Stefan; Puffitsch, Wolfgang

2014-01-01

For real-time systems we need time-predictable processors. This paper presents a method cache as a time-predictable solution for instruction caching. The method cache caches whole methods (or functions) and simplifies worst-case execution time analysis. We have integrated the method cache...... in the time-predictable processor Patmos. We evaluate the method cache with a large set of embedded benchmarks. Most benchmarks show a good hit rate for a method cache size in the range between 4 and 16 KB....

A Time-predictable Stack Cache

DEFF Research Database (Denmark)

Abbaspour, Sahar; Brandner, Florian; Schoeberl, Martin

2013-01-01

Real-time systems need time-predictable architectures to support static worst-case execution time (WCET) analysis. One architectural feature, the data cache, is hard to analyze when different data areas (e.g., heap allocated and stack allocated data) share the same cache. This sharing leads to le...... of a cache for stack allocated data. Our port of the LLVM C++ compiler supports the management of the stack cache. The combination of stack cache instructions and the hardware implementation of the stack cache is a further step towards timepredictable architectures.......Real-time systems need time-predictable architectures to support static worst-case execution time (WCET) analysis. One architectural feature, the data cache, is hard to analyze when different data areas (e.g., heap allocated and stack allocated data) share the same cache. This sharing leads to less...... precise results of the cache analysis part of the WCET analysis. Splitting the data cache for different data areas enables composable data cache analysis. The WCET analysis tool can analyze the accesses to these different data areas independently. In this paper we present the design and implementation...

An integrated GIS/remote sensing data base in North Cache soil conservation district, Utah: A pilot project for the Utah Department of Agriculture's RIMS (Resource Inventory and Monitoring System)

Science.gov (United States)

Wheeler, D. J.; Ridd, M. K.; Merola, J. A.

1984-01-01

A basic geographic information system (GIS) for the North Cache Soil Conservation District (SCD) was sought for selected resource problems. Since the resource management issues in the North Cache SCD are very complex, it is not feasible in the initial phase to generate all the physical, socioeconomic, and political baseline data needed for resolving all management issues. A selection of critical varables becomes essential. Thus, there are foud specific objectives: (1) assess resource management needs and determine which resource factors ae most fundamental for building a beginning data base; (2) evaluate the variety of data gathering and analysis techniques for the resource factors selected; (3) incorporate the resulting data into a useful and efficient digital data base; and (4) demonstrate the application of the data base to selected real world resoource management issues.

Don't make cache too complex: A simple probability-based cache management scheme for SSDs.

Directory of Open Access Journals (Sweden)

Seungjae Baek

Full Text Available Solid-state drives (SSDs have recently become a common storage component in computer systems, and they are fueled by continued bit cost reductions achieved with smaller feature sizes and multiple-level cell technologies. However, as the flash memory stores more bits per cell, the performance and reliability of the flash memory degrade substantially. To solve this problem, a fast non-volatile memory (NVM-based cache has been employed within SSDs to reduce the long latency required to write data. Absorbing small writes in a fast NVM cache can also reduce the number of flash memory erase operations. To maximize the benefits of an NVM cache, it is important to increase the NVM cache utilization. In this paper, we propose and study ProCache, a simple NVM cache management scheme, that makes cache-entrance decisions based on random probability testing. Our scheme is motivated by the observation that frequently written hot data will eventually enter the cache with a high probability, and that infrequently accessed cold data will not enter the cache easily. Owing to its simplicity, ProCache is easy to implement at a substantially smaller cost than similar previously studied techniques. We evaluate ProCache and conclude that it achieves comparable performance compared to a more complex reference counter-based cache-management scheme.

The History of the 2nd Ranger Company

National Research Council Canada - National Science Library

Bond, Victor

2003-01-01

The purpose of this research project is to uncover the history of the 2nd Ranger Company and to determine the impact segregation had on the selection, training, and combat operations of the 2nd Ranger Company...

Opportunities for Ranger and Jabiluka

International Nuclear Information System (INIS)

Oxnam, K.M.

1999-01-01

The processing of ore from ERA's Ranger mine will be completed before 2009, so the development of the Company's Jabiluka project is vital to its future. In order to achieve the Company's aim of utilising the Ranger mill to process the Jabiluka ore ERA is looking at innovative ways of furthering community relationships and responding to the needs of its major stakeholders, particularly the local Aboriginal landowners. The Jabiluka development has been a trigger for ERA to reconsider the way it does business in order to meet expectations of the community while maintaining financial viability

Maintaining Web Cache Coherency

Directory of Open Access Journals (Sweden)

2000-01-01

Full Text Available Document coherency is a challenging problem for Web caching. Once the documents are cached throughout the Internet, it is often difficult to keep them coherent with the origin document without generating a new traffic that could increase the traffic on the international backbone and overload the popular servers. Several solutions have been proposed to solve this problem, among them two categories have been widely discussed: the strong document coherency and the weak document coherency. The cost and the efficiency of the two categories are still a controversial issue, while in some studies the strong coherency is far too expensive to be used in the Web context, in other studies it could be maintained at a low cost. The accuracy of these analysis is depending very much on how the document updating process is approximated. In this study, we compare some of the coherence methods proposed for Web caching. Among other points, we study the side effects of these methods on the Internet traffic. The ultimate goal is to study the cache behavior under several conditions, which will cover some of the factors that play an important role in the Web cache performance evaluation and quantify their impact on the simulation accuracy. The results presented in this study show indeed some differences in the outcome of the simulation of a Web cache depending on the workload being used, and the probability distribution used to approximate updates on the cached documents. Each experiment shows two case studies that outline the impact of the considered parameter on the performance of the cache.

Time-predictable Stack Caching

DEFF Research Database (Denmark)

Abbaspourseyedi, Sahar

completely. Thus, in systems with hard deadlines the worst-case execution time (WCET) of the real-time software running on them needs to be bounded. Modern architectures use features such as pipelining and caches for improving the average performance. These features, however, make the WCET analysis more...... addresses, provides an opportunity to predict and tighten the WCET of accesses to data in caches. In this thesis, we introduce the time-predictable stack cache design and implementation within a time-predictable processor. We introduce several optimizations to our design for tightening the WCET while...... keeping the timepredictability of the design intact. Moreover, we provide a solution for reducing the cost of context switching in a system using the stack cache. In design of these caches, we use custom hardware and compiler support for delivering time-predictable stack data accesses. Furthermore...

Cache-Aware and Cache-Oblivious Adaptive Sorting

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Moruz, Gabriel

2005-01-01

Two new adaptive sorting algorithms are introduced which perform an optimal number of comparisons with respect to the number of inversions in the input. The first algorithm is based on a new linear time reduction to (non-adaptive) sorting. The second algorithm is based on a new division protocol...... for the GenericSort algorithm by Estivill-Castro and Wood. From both algorithms we derive I/O-optimal cache-aware and cache-oblivious adaptive sorting algorithms. These are the first I/O-optimal adaptive sorting algorithms....

Data cache organization for accurate timing analysis

DEFF Research Database (Denmark)

Schoeberl, Martin; Huber, Benedikt; Puffitsch, Wolfgang

2013-01-01

it is important to classify memory accesses as either cache hit or cache miss. The addresses of instruction fetches are known statically and static cache hit/miss classification is possible for the instruction cache. The access to data that is cached in the data cache is harder to predict statically. Several...

Ranger uranium project

International Nuclear Information System (INIS)

1979-01-01

This agreement between the Commonwealth of Australia, Peko-Wallsend Operations Ltd., Electrolytic Zinc Company of Australasia Limited, and the Australian Atomic Energy Commission sets out articles under which the Ranger uranium project in the Northern Territory of Australia is to be operated

Research on Cache Placement in ICN

Directory of Open Access Journals (Sweden)

Yu Zhang

2017-08-01

Full Text Available Ubiquitous in-network caching is one of key features of Information Centric Network, together with receiver-drive content retrieval paradigm, Information Centric Network is better support for content distribution, multicast, mobility, etc. Cache placement strategy is crucial to improving utilization of cache space and reducing the occupation of link bandwidth. Most of the literature about caching policies considers the overall cost and bandwidth, but ignores the limits of node cache capacity. This paper proposes a G-FMPH algorithm which takes into ac-count both constrains on the link bandwidth and the cache capacity of nodes. Our algorithm aims at minimizing the overall cost of contents caching afterwards. The simulation results have proved that our proposed algorithm has a better performance.

Cache-Oblivious Mesh Layouts

International Nuclear Information System (INIS)

Yoon, S; Lindstrom, P; Pascucci, V; Manocha, D

2005-01-01

We present a novel method for computing cache-oblivious layouts of large meshes that improve the performance of interactive visualization and geometric processing algorithms. Given that the mesh is accessed in a reasonably coherent manner, we assume no particular data access patterns or cache parameters of the memory hierarchy involved in the computation. Furthermore, our formulation extends directly to computing layouts of multi-resolution and bounding volume hierarchies of large meshes. We develop a simple and practical cache-oblivious metric for estimating cache misses. Computing a coherent mesh layout is reduced to a combinatorial optimization problem. We designed and implemented an out-of-core multilevel minimization algorithm and tested its performance on unstructured meshes composed of tens to hundreds of millions of triangles. Our layouts can significantly reduce the number of cache misses. We have observed 2-20 times speedups in view-dependent rendering, collision detection, and isocontour extraction without any modification of the algorithms or runtime applications

On the Limits of Cache-Obliviousness

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

2003-01-01

In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possible without a tall cache assumption, and (2) there does not exist an I/O optimal cache-oblivious algorithm for permutin...

Optimizing Maintenance of Constraint-Based Database Caches

Science.gov (United States)

Klein, Joachim; Braun, Susanne

Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarative queries in a DBMS-managed cache close to the application. Query evaluation must produce the same results as if done at the remote database backend, which implies that all data records needed to process such a query must be present and controlled by the cache, i. e., to achieve “predicate-specific” loading and unloading of such record sets. Hence, cache maintenance must be based on cache constraints such that “predicate completeness” of the caching units currently present can be guaranteed at any point in time. We explore how cache groups can be maintained to provide the data currently needed. Moreover, we design and optimize loading and unloading algorithms for sets of records keeping the caching units complete, before we empirically identify the costs involved in cache maintenance.

Cache-Oblivious Algorithms and Data Structures

DEFF Research Database (Denmark)

Brodal, Gerth Stølting

2004-01-01

Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments with multiple levels of caching, and coined the terminology of cache-oblivious algorithms. Cache-oblivious algorithms are described...... as standard RAM algorithms with only one memory level, i.e. without any knowledge about memory hierarchies, but are analyzed in the two-level I/O model of Aggarwal and Vitter for an arbitrary memory and block size and an optimal off-line cache replacement strategy. The result are algorithms that automatically...... apply to multi-level memory hierarchies. This paper gives an overview of the results achieved on cache-oblivious algorithms and data structures since the seminal paper by Frigo et al....

Web cache location

Directory of Open Access Journals (Sweden)

Boffey Brian

2004-01-01

Full Text Available Stress placed on network infrastructure by the popularity of the World Wide Web may be partially relieved by keeping multiple copies of Web documents at geographically dispersed locations. In particular, use of proxy caches and replication provide a means of storing information 'nearer to end users'. This paper concentrates on the locational aspects of Web caching giving both an overview, from an operational research point of view, of existing research and putting forward avenues for possible further research. This area of research is in its infancy and the emphasis will be on themes and trends rather than on algorithm construction. Finally, Web caching problems are briefly related to referral systems more generally.

Caching web service for TICF project

International Nuclear Information System (INIS)

Pais, V.F.; Stancalie, V.

2008-01-01

A caching web service was developed to allow caching of any object to a network cache, presented in the form of a web service. This application was used to increase the speed of previously implemented web services and for new ones. Various tests were conducted to determine the impact of using this caching web service in the existing network environment and where it should be placed in order to achieve the greatest increase in performance. Since the cache is presented to applications as a web service, it can also be used for remote access to stored data and data sharing between applications

dCache, agile adoption of storage technology

Energy Technology Data Exchange (ETDEWEB)

Millar, A. P. [Hamburg U.; Baranova, T. [Hamburg U.; Behrmann, G. [Unlisted, DK; Bernardt, C. [Hamburg U.; Fuhrmann, P. [Hamburg U.; Litvintsev, D. O. [Fermilab; Mkrtchyan, T. [Hamburg U.; Petersen, A. [Hamburg U.; Rossi, A. [Fermilab; Schwank, K. [Hamburg U.

2012-01-01

For over a decade, dCache has been synonymous with large-capacity, fault-tolerant storage using commodity hardware that supports seamless data migration to and from tape. In this paper we provide some recent news of changes within dCache and the community surrounding it. We describe the flexible nature of dCache that allows both externally developed enhancements to dCache facilities and the adoption of new technologies. Finally, we present information about avenues the dCache team is exploring for possible future improvements in dCache.

Test data generation for LRU cache-memory testing

OpenAIRE

Evgeni, Kornikhin

2009-01-01

System functional testing of microprocessors deals with many assembly programs of given behavior. The paper proposes new constraint-based algorithm of initial cache-memory contents generation for given behavior of assembly program (with cache misses and hits). Although algorithm works for any types of cache-memory, the paper describes algorithm in detail for basis types of cache-memory only: fully associative cache and direct mapped cache.

Are ranger patrols effective in reducing poaching-related threats within protected areas?

Science.gov (United States)

Moore, Jennnifer F.; Mulindahabi, Felix; Masozera, Michel K.; Nichols, James; Hines, James; Turikunkiko, Ezechiel; Oli, Madan K.

2018-01-01

Poaching is one of the greatest threats to wildlife conservation world-wide. However, the spatial and temporal patterns of poaching activities within protected areas, and the effectiveness of ranger patrols and ranger posts in mitigating these threats, are relatively unknown.We used 10 years (2006–2015) of ranger-based monitoring data and dynamic multi-season occupancy models to quantify poaching-related threats, to examine factors influencing the spatio-temporal dynamics of these threats and to test the efficiency of management actions to combat poaching in Nyungwe National Park (NNP), Rwanda.The probability of occurrence of poaching-related threats was highest at lower elevations (1,801–2,200 m), especially in areas that were close to roads and tourist trails; conversely, occurrence probability was lowest at high elevation sites (2,601–3,000 m), and near the park boundary and ranger posts. The number of ranger patrols substantially increased the probability that poaching-related threats disappear at a site if threats were originally present (i.e. probability of extinction of threats). Without ranger visits, the annual probability of extinction of poaching-related threats was an estimated 7%; this probability would increase to 20% and 57% with 20 and 50 ranger visits per year, respectively.Our results suggest that poaching-related threats can be effectively reduced in NNP by adding ranger posts in areas where they do not currently exist, and by increasing the number of patrols to sites where the probability of poaching activities is high.Synthesis and applications. Our application of dynamic occupancy models to predict the probability of presence of poaching-related threats is novel, and explicitly considers imperfect detection of illegal activities. Based on the modelled relationships, we identify areas that are most vulnerable to poaching, and offer insights regarding how ranger patrols can be optimally deployed to reduce poaching-related threats and

MESI Cache Coherence Simulator for Teaching Purposes

OpenAIRE

Gómez Luna, Juan; Herruzo Gómez, Ezequiel; Benavides Benítez, José Ignacio

2009-01-01

Nowadays, the computational systems (multi and uniprocessors) need to avoid the cache coherence problem. There are some techniques to solve this problem. The MESI cache coherence protocol is one of them. This paper presents a simulator of the MESI protocol which is used for teaching the cache memory coherence on the computer systems with hierarchical memory system and for explaining the process of the cache memory location in multilevel cache memory systems. The paper shows a d...

Efficient sorting using registers and caches

DEFF Research Database (Denmark)

Wickremesinghe, Rajiv; Arge, Lars Allan; Chase, Jeffrey S.

2002-01-01

. Inadequate models lead to poor algorithmic choices and an incomplete understanding of algorithm behavior on real machines.A key step toward developing better models is to quantify the performance effects of features not reflected in the models. This paper explores the effect of memory system features...... on sorting performance. We introduce a new cache-conscious sorting algorithm, R-MERGE, which achieves better performance in practice over algorithms that are superior in the theoretical models. R-MERGE is designed to minimize memory stall cycles rather than cache misses by considering features common to many......Modern computer systems have increasingly complex memory systems. Common machine models for algorithm analysis do not reflect many of the features of these systems, e.g., large register sets, lockup-free caches, cache hierarchies, associativity, cache line fetching, and streaming behavior...

Cache-aware network-on-chip for chip multiprocessors

Science.gov (United States)

Tatas, Konstantinos; Kyriacou, Costas; Dekoulis, George; Demetriou, Demetris; Avraam, Costas; Christou, Anastasia

2009-05-01

This paper presents the hardware prototype of a Network-on-Chip (NoC) for a chip multiprocessor that provides support for cache coherence, cache prefetching and cache-aware thread scheduling. A NoC with support to these cache related mechanisms can assist in improving systems performance by reducing the cache miss ratio. The presented multi-core system employs the Data-Driven Multithreading (DDM) model of execution. In DDM thread scheduling is done according to data availability, thus the system is aware of the threads to be executed in the near future. This characteristic of the DDM model allows for cache aware thread scheduling and cache prefetching. The NoC prototype is a crossbar switch with output buffering that can support a cache-aware 4-node chip multiprocessor. The prototype is built on the Xilinx ML506 board equipped with a Xilinx Virtex-5 FPGA.

Store operations to maintain cache coherence

Energy Technology Data Exchange (ETDEWEB)

Evangelinos, Constantinos; Nair, Ravi; Ohmacht, Martin

2017-08-01

In one embodiment, a computer-implemented method includes encountering a store operation during a compile-time of a program, where the store operation is applicable to a memory line. It is determined, by a computer processor, that no cache coherence action is necessary for the store operation. A store-without-coherence-action instruction is generated for the store operation, responsive to determining that no cache coherence action is necessary. The store-without-coherence-action instruction specifies that the store operation is to be performed without a cache coherence action, and cache coherence is maintained upon execution of the store-without-coherence-action instruction.

Store operations to maintain cache coherence

Energy Technology Data Exchange (ETDEWEB)

Evangelinos, Constantinos; Nair, Ravi; Ohmacht, Martin

2017-09-12

In one embodiment, a computer-implemented method includes encountering a store operation during a compile-time of a program, where the store operation is applicable to a memory line. It is determined, by a computer processor, that no cache coherence action is necessary for the store operation. A store-without-coherence-action instruction is generated for the store operation, responsive to determining that no cache coherence action is necessary. The store-without-coherence-action instruction specifies that the store operation is to be performed without a cache coherence action, and cache coherence is maintained upon execution of the store-without-coherence-action instruction.

Cache management of tape files in mass storage system

International Nuclear Information System (INIS)

Cheng Yaodong; Ma Nan; Yu Chuansong; Chen Gang

2006-01-01

This paper proposes the group-cooperative caching policy according to the characteristics of tapes and requirements of high energy physics domain. This policy integrates the advantages of traditional local caching and cooperative caching on basis of cache model. It divides cache into independent groups; the same group of cache is made of cooperating disks on network. This paper also analyzes the directory management, update algorithm and cache consistency of the policy. The experiment shows the policy can meet the requirements of data processing and mass storage in high energy physics domain very well. (authors)

Reducing Competitive Cache Misses in Modern Processor Architectures

OpenAIRE

Prisagjanec, Milcho; Mitrevski, Pece

2017-01-01

The increasing number of threads inside the cores of a multicore processor, and competitive access to the shared cache memory, become the main reasons for an increased number of competitive cache misses and performance decline. Inevitably, the development of modern processor architectures leads to an increased number of cache misses. In this paper, we make an attempt to implement a technique for decreasing the number of competitive cache misses in the first level of cache memory. This tec...

Rangers Lead the Way: The Vision of General Creighton W. Abrams

National Research Council Canada - National Science Library

Woods, Kent

2003-01-01

.... A restoration which was key to the Army emerging from its post Viet Nam period of decline. The values and standards incorporated in the Ranger Battalions were promulgated throughout the rest of the Army by Rangers returning...

Software trace cache

OpenAIRE

Ramírez Bellido, Alejandro; Larriba Pey, Josep; Valero Cortés, Mateo

2005-01-01

We explore the use of compiler optimizations, which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying hardware resources regardless of the specific details of the processor/architecture in order to increase fetch performance. The Software Trace Cache (STC) is a code layout algorithm with a broader target than previous layout optimizations. We target not only an improvement in the instruction cache hit rate, but also an increas...

The dCache scientific storage cloud

CERN Multimedia

CERN. Geneva

2014-01-01

For over a decade, the dCache team has provided software for handling big data for a diverse community of scientists. The team has also amassed a wealth of operational experience from using this software in production. With this experience, the team have refined dCache with the goal of providing a "scientific cloud": a storage solution that satisfies all requirements of a user community by exposing different facets of dCache with which users interact. Recent development, as part of this "scientific cloud" vision, has introduced a new facet: a sync-and-share service, often referred to as "dropbox-like storage". This work has been strongly focused on local requirements, but will be made available in future releases of dCache allowing others to adopt dCache solutions. In this presentation we will outline the current status of the work: both the successes and limitations, and the direction and time-scale of future work.

A Distributed Cache Update Deployment Strategy in CDN

Science.gov (United States)

E, Xinhua; Zhu, Binjie

2018-04-01

The CDN management system distributes content objects to the edge of the internet to achieve the user's near access. Cache strategy is an important problem in network content distribution. A cache strategy was designed in which the content effective diffusion in the cache group, so more content was storage in the cache, and it improved the group hit rate.

Search-Order Independent State Caching

DEFF Research Database (Denmark)

Evangelista, Sami; Kristensen, Lars Michael

2010-01-01

State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search to ensure termination.We propose and experimentally evaluate an extension of the state caching method for general state...

Cache Management of Big Data in Equipment Condition Assessment

Directory of Open Access Journals (Sweden)

Ma Yan

2016-01-01

Full Text Available Big data platform for equipment condition assessment is built for comprehensive analysis. The platform has various application demands. According to its response time, its application can be divided into offline, interactive and real-time types. For real-time application, its data processing efficiency is important. In general, data cache is one of the most efficient ways to improve query time. However, big data caching is different from the traditional data caching. In the paper we propose a distributed cache management framework of big data for equipment condition assessment. It consists of three parts: cache structure, cache replacement algorithm and cache placement algorithm. Cache structure is the basis of the latter two algorithms. Based on the framework and algorithms, we make full use of the characteristics of just accessing some valuable data during a period of time, and put relevant data on the neighborhood nodes, which largely reduce network transmission cost. We also validate the performance of our proposed approaches through extensive experiments. It demonstrates that the proposed cache replacement algorithm and cache management framework has higher hit rate or lower query time than LRU algorithm and round-robin algorithm.

WATCHMAN: A Data Warehouse Intelligent Cache Manager

Science.gov (United States)

Scheuermann, Peter; Shim, Junho; Vingralek, Radek

1996-01-01

Data warehouses store large volumes of data which are used frequently by decision support applications. Such applications involve complex queries. Query performance in such an environment is critical because decision support applications often require interactive query response time. Because data warehouses are updated infrequently, it becomes possible to improve query performance by caching sets retrieved by queries in addition to query execution plans. In this paper we report on the design of an intelligent cache manager for sets retrieved by queries called WATCHMAN, which is particularly well suited for data warehousing environment. Our cache manager employs two novel, complementary algorithms for cache replacement and for cache admission. WATCHMAN aims at minimizing query response time and its cache replacement policy swaps out entire retrieved sets of queries instead of individual pages. The cache replacement and admission algorithms make use of a profit metric, which considers for each retrieved set its average rate of reference, its size, and execution cost of the associated query. We report on a performance evaluation based on the TPC-D and Set Query benchmarks. These experiments show that WATCHMAN achieves a substantial performance improvement in a decision support environment when compared to a traditional LRU replacement algorithm.

Static analysis of worst-case stack cache behavior

DEFF Research Database (Denmark)

Jordan, Alexander; Brandner, Florian; Schoeberl, Martin

2013-01-01

Utilizing a stack cache in a real-time system can aid predictability by avoiding interference that heap memory traffic causes on the data cache. While loads and stores are guaranteed cache hits, explicit operations are responsible for managing the stack cache. The behavior of these operations can......-graph, the worst-case bounds can be efficiently yet precisely determined. Our evaluation using the MiBench benchmark suite shows that only 37% and 21% of potential stack cache operations actually store to and load from memory, respectively. Analysis times are modest, on average running between 0.46s and 1.30s per...

Truth Space Method for Caching Database Queries

Directory of Open Access Journals (Sweden)

S. V. Mosin

2015-01-01

Full Text Available We propose a new method of client-side data caching for relational databases with a central server and distant clients. Data are loaded into the client cache based on queries executed on the server. Every query has the corresponding DB table – the result of the query execution. These queries have a special form called "universal relational query" based on three fundamental Relational Algebra operations: selection, projection and natural join. We have to mention that such a form is the closest one to the natural language and the majority of database search queries can be expressed in this way. Besides, this form allows us to analyze query correctness by checking lossless join property. A subsequent query may be executed in a client’s local cache if we can determine that the query result is entirely contained in the cache. For this we compare truth spaces of the logical restrictions in a new user’s query and the results of the queries execution in the cache. Such a comparison can be performed analytically , without need in additional Database queries. This method may be used to define lacking data in the cache and execute the query on the server only for these data. To do this the analytical approach is also used, what distinguishes our paper from the existing technologies. We propose four theorems for testing the required conditions. The first and the third theorems conditions allow us to define the existence of required data in cache. The second and the fourth theorems state conditions to execute queries with cache only. The problem of cache data actualizations is not discussed in this paper. However, it can be solved by cataloging queries on the server and their serving by triggers in background mode. The article is published in the author’s wording.

Cache memory modelling method and system

OpenAIRE

Posadas Cobo, Héctor; Villar Bonet, Eugenio; Díaz Suárez, Luis

2011-01-01

The invention relates to a method for modelling a data cache memory of a destination processor, in order to simulate the behaviour of said data cache memory during the execution of a software code on a platform comprising said destination processor. According to the invention, the simulation is performed on a native platform having a processor different from the destination processor comprising the aforementioned data cache memory to be modelled, said modelling being performed by means of the...

The economic impact on Aboriginal communities of the Ranger Project: 1979-1985

International Nuclear Information System (INIS)

O'Faircheallaigh, C.

1986-01-01

What are the benefits generated for Aboriginal people by mining projects like the Ranger Project? Are these projects likely to fulfill the expectations of Aborigines who support the controlled exploitation of mineral resources on their land? This article examines the economic impact of the Ranger uranium project on Aboriginal people. Its principal aim is to provide detailed information on the use of royalty-related payments made to traditional owners as a result of Ranger's operations, and the consequent employment, training and social service opportunities for Aborigines

Efficient Mobile Client Caching Supporting Transaction Semantics

Directory of Open Access Journals (Sweden)

IlYoung Chung

2000-05-01

Full Text Available In mobile client-server database systems, caching of frequently accessed data is an important technique that will reduce the contention on the narrow bandwidth wireless channel. As the server in mobile environments may not have any information about the state of its clients' cache(stateless server, using broadcasting approach to transmit the updated data lists to numerous concurrent mobile clients is an attractive approach. In this paper, a caching policy is proposed to maintain cache consistency for mobile computers. The proposed protocol adopts asynchronous(non-periodic broadcasting as the cache invalidation scheme, and supports transaction semantics in mobile environments. With the asynchronous broadcasting approach, the proposed protocol can improve the throughput by reducing the abortion of transactions with low communication costs. We study the performance of the protocol by means of simulation experiments.

Efficacy of Code Optimization on Cache-based Processors

Science.gov (United States)

VanderWijngaart, Rob F.; Chancellor, Marisa K. (Technical Monitor)

1997-01-01

The current common wisdom in the U.S. is that the powerful, cost-effective supercomputers of tomorrow will be based on commodity (RISC) micro-processors with cache memories. Already, most distributed systems in the world use such hardware as building blocks. This shift away from vector supercomputers and towards cache-based systems has brought about a change in programming paradigm, even when ignoring issues of parallelism. Vector machines require inner-loop independence and regular, non-pathological memory strides (usually this means: non-power-of-two strides) to allow efficient vectorization of array operations. Cache-based systems require spatial and temporal locality of data, so that data once read from main memory and stored in high-speed cache memory is used optimally before being written back to main memory. This means that the most cache-friendly array operations are those that feature zero or unit stride, so that each unit of data read from main memory (a cache line) contains information for the next iteration in the loop. Moreover, loops ought to be 'fat', meaning that as many operations as possible are performed on cache data-provided instruction caches do not overflow and enough registers are available. If unit stride is not possible, for example because of some data dependency, then care must be taken to avoid pathological strides, just ads on vector computers. For cache-based systems the issues are more complex, due to the effects of associativity and of non-unit block (cache line) size. But there is more to the story. Most modern micro-processors are superscalar, which means that they can issue several (arithmetic) instructions per clock cycle, provided that there are enough independent instructions in the loop body. This is another argument for providing fat loop bodies. With these restrictions, it appears fairly straightforward to produce code that will run efficiently on any cache-based system. It can be argued that although some of the important

Design Space Exploration of Object Caches with Cross-Profiling

DEFF Research Database (Denmark)

Schoeberl, Martin; Binder, Walter; Villazon, Alex

2011-01-01

. However, before implementing such an object cache, an empirical analysis of different organization forms is needed. We use a cross-profiling technique based on aspect-oriented programming in order to evaluate different object cache organizations with standard Java benchmarks. From the evaluation we......To avoid data cache trashing between heap-allocated data and other data areas, a distinct object cache has been proposed for embedded real-time Java processors. This object cache uses high associativity in order to statically track different object pointers for worst-case execution-time analysis...... conclude that field access exhibits some temporal locality, but almost no spatial locality. Therefore, filling long cache lines on a miss just introduces a high miss penalty without increasing the hit rate enough to make up for the increased miss penalty. For an object cache, it is more efficient to fill...

Archeological Excavations at the Wanapum Cache Site

International Nuclear Information System (INIS)

T. E. Marceau

2000-01-01

This report was prepared to document the actions taken to locate and excavate an abandoned Wanapum cache located east of the 100-H Reactor area. Evidence (i.e., glass, ceramics, metal, and wood) obtained from shovel and backhoe excavations at the Wanapum cache site indicate that the storage caches were found. The highly fragmented condition of these materials argues that the contents of the caches were collected or destroyed prior to the caches being burned and buried by mechanical equipment. While the fiber nets would have been destroyed by fire, the specialized stone weights would have remained behind. The fact that the site might have been gleaned of desirable artifacts prior to its demolition is consistent with the account by Riddell (1948) for a contemporary village site. Unfortunately, fishing equipment, owned by and used on behalf of the village, that might have returned to productive use has been irretrievably lost

Engineering a Cache-Oblivious Sorting Algorithm

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Vinther, Kristoffer

2007-01-01

This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by empirical methods a number of implementation issues and parameter choices for the cache-oblivious sorting algorithm Lazy Funnelsort, and compare the final algorithm with Quicksort, the established standard...

Corvid re-caching without 'theory of mind': a model.

Science.gov (United States)

van der Vaart, Elske; Verbrugge, Rineke; Hemelrijk, Charlotte K

2012-01-01

Scrub jays are thought to use many tactics to protect their caches. For instance, they predominantly bury food far away from conspecifics, and if they must cache while being watched, they often re-cache their worms later, once they are in private. Two explanations have been offered for such observations, and they are intensely debated. First, the birds may reason about their competitors' mental states, with a 'theory of mind'; alternatively, they may apply behavioral rules learned in daily life. Although this second hypothesis is cognitively simpler, it does seem to require a different, ad-hoc behavioral rule for every caching and re-caching pattern exhibited by the birds. Our new theory avoids this drawback by explaining a large variety of patterns as side-effects of stress and the resulting memory errors. Inspired by experimental data, we assume that re-caching is not motivated by a deliberate effort to safeguard specific caches from theft, but by a general desire to cache more. This desire is brought on by stress, which is determined by the presence and dominance of onlookers, and by unsuccessful recovery attempts. We study this theory in two experiments similar to those done with real birds with a kind of 'virtual bird', whose behavior depends on a set of basic assumptions about corvid cognition, and a well-established model of human memory. Our results show that the 'virtual bird' acts as the real birds did; its re-caching reflects whether it has been watched, how dominant its onlooker was, and how close to that onlooker it has cached. This happens even though it cannot attribute mental states, and it has only a single behavioral rule assumed to be previously learned. Thus, our simulations indicate that corvid re-caching can be explained without sophisticated social cognition. Given our specific predictions, our theory can easily be tested empirically.

Corvid re-caching without 'theory of mind': a model.

Directory of Open Access Journals (Sweden)

Elske van der Vaart

Full Text Available Scrub jays are thought to use many tactics to protect their caches. For instance, they predominantly bury food far away from conspecifics, and if they must cache while being watched, they often re-cache their worms later, once they are in private. Two explanations have been offered for such observations, and they are intensely debated. First, the birds may reason about their competitors' mental states, with a 'theory of mind'; alternatively, they may apply behavioral rules learned in daily life. Although this second hypothesis is cognitively simpler, it does seem to require a different, ad-hoc behavioral rule for every caching and re-caching pattern exhibited by the birds. Our new theory avoids this drawback by explaining a large variety of patterns as side-effects of stress and the resulting memory errors. Inspired by experimental data, we assume that re-caching is not motivated by a deliberate effort to safeguard specific caches from theft, but by a general desire to cache more. This desire is brought on by stress, which is determined by the presence and dominance of onlookers, and by unsuccessful recovery attempts. We study this theory in two experiments similar to those done with real birds with a kind of 'virtual bird', whose behavior depends on a set of basic assumptions about corvid cognition, and a well-established model of human memory. Our results show that the 'virtual bird' acts as the real birds did; its re-caching reflects whether it has been watched, how dominant its onlooker was, and how close to that onlooker it has cached. This happens even though it cannot attribute mental states, and it has only a single behavioral rule assumed to be previously learned. Thus, our simulations indicate that corvid re-caching can be explained without sophisticated social cognition. Given our specific predictions, our theory can easily be tested empirically.

Analysis of preemption costs for the stack cache

DEFF Research Database (Denmark)

Naji, Amine; Abbaspour, Sahar; Brandner, Florian

2018-01-01

, the analysis of the stack cache was limited to individual tasks, ignoring aspects related to multitasking. A major drawback of the original stack cache design is that, due to its simplicity, it cannot hold the data of multiple tasks at the same time. Consequently, the entire cache content needs to be saved...

OPTIMAL DATA REPLACEMENT TECHNIQUE FOR COOPERATIVE CACHING IN MANET

Directory of Open Access Journals (Sweden)

P. Kuppusamy

2014-09-01

Full Text Available A cooperative caching approach improves data accessibility and reduces query latency in Mobile Ad hoc Network (MANET. Maintaining the cache is challenging issue in large MANET due to mobility, cache size and power. The previous research works on caching primarily have dealt with LRU, LFU and LRU-MIN cache replacement algorithms that offered low query latency and greater data accessibility in sparse MANET. This paper proposes Memetic Algorithm (MA to locate the better replaceable data based on neighbours interest and fitness value of cached data to store the newly arrived data. This work also elects ideal CH using Meta heuristic search Ant Colony Optimization algorithm. The simulation results shown that proposed algorithm reduces the latency, control overhead and increases the packet delivery rate than existing approach by increasing nodes and speed respectively.

RELATIONSHIPS IN THE WORKPLACE AND OCCUPATIONAL ATTRACTIVENESS AMONG STUDENTS, TEACHERS AND RANGERS-SPORTSMEN

Directory of Open Access Journals (Sweden)

Nikolay Ivantchev

2016-06-01

Full Text Available Perceived occupational attractiveness could be due to many factors and relationships in the workplace are among them. The questionnaire “Attractiveness of the profession” created by Ivanov (1999 was used to study how relationships in the workplace were related to perceptions of occupational attractiveness among students, teachers and rangers-sportsmen participating in special missions abroad. In 2012 and 2013, 46 secondary school teachers, 40 students in pedagogical specialties, and 27 sportsmen-rangers participating in special missions abroad were studied in Bulgaria. The results indicated that the students and the rangers were more satisfied with their work than the teachers were. The interpersonal relationships influenced mainly the students’ and rangers’ perceptions of occupational attractiveness. The rangers were more influenced by the relationships with the colleagues. The psycho-climate in the workplace was considered as more important by the rangers. The students were more influenced by the interpersonal communication at the workplace and their heads’ expertise. Some moderators of interpersonal relationships in the workplace were found – such as the tasks in the work, the prestige of occupation, the interaction between occupation and rewards, and the psycho-climate in the workplace.

The Cost of Cache-Oblivious Searching

DEFF Research Database (Denmark)

Bender, Michael A.; Brodal, Gert Stølting; Fagerberg, Rolf

2003-01-01

, multilevel memory hierarchies can be modelled. It is shown that as k grows, the search costs of the optimal k-level DAM search structure and of the optimal cache-oblivious search structure rapidly converge. This demonstrates that for a multilevel memory hierarchy, a simple cache-oblivious structure almost......Tight bounds on the cost of cache-oblivious searching are proved. It is shown that no cache-oblivious search structure can guarantee that a search performs fewer than lg e log B N block transfers between any two levels of the memory hierarchy. This lower bound holds even if all of the block sizes...... the random placement of the rst element of the structure in memory. As searching in the Disk Access Model (DAM) can be performed in log B N + 1 block transfers, this result shows a separation between the 2-level DAM and cacheoblivious memory-hierarchy models. By extending the DAM model to k levels...

A Two-Level Cache for Distributed Information Retrieval in Search Engines

Directory of Open Access Journals (Sweden)

Weizhe Zhang

2013-01-01

Full Text Available To improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users’ logs. We extract the highest rank queries of users from the static cache, in which the queries are the most popular. We adopt the dynamic cache as an auxiliary to optimize the distribution of the cache data. We propose a distribution strategy of the cache data. The experiments prove that the hit rate, the efficiency, and the time consumption of the two-level cache have advantages compared with other structures of cache.

A two-level cache for distributed information retrieval in search engines.

Science.gov (United States)

Zhang, Weizhe; He, Hui; Ye, Jianwei

2013-01-01

To improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users' logs. We extract the highest rank queries of users from the static cache, in which the queries are the most popular. We adopt the dynamic cache as an auxiliary to optimize the distribution of the cache data. We propose a distribution strategy of the cache data. The experiments prove that the hit rate, the efficiency, and the time consumption of the two-level cache have advantages compared with other structures of cache.

Optimal Caching in Multicast 5G Networks with Opportunistic Spectrum Access

KAUST Repository

Emara, Mostafa

2018-01-15

Cache-enabled small base station (SBS) densification is foreseen as a key component of 5G cellular networks. This architecture enables storing popular files at the network edge (i.e., SBS caches), which empowers local communication and alleviates traffic congestions at the core/backhaul network. This paper develops a mathematical framework, based on stochastic geometry, to characterize the hit probability of a cache-enabled multicast 5G network with SBS multi-channel capabilities and opportunistic spectrum access. To this end, we first derive the hit probability by characterizing opportunistic spectrum access success probabilities, service distance distributions, and coverage probabilities. The optimal caching distribution to maximize the hit probability is then computed. The performance and trade-offs of the derived optimal caching distributions are then assessed and compared with two widely employed caching distribution schemes, namely uniform and Zipf caching, through numerical results and extensive simulations. It is shown that the Zipf caching almost optimal only in scenarios with large number of available channels and large cache sizes.

Compiler-Enforced Cache Coherence Using a Functional Language

Directory of Open Access Journals (Sweden)

Rich Wolski

1996-01-01

Full Text Available The cost of hardware cache coherence, both in terms of execution delay and operational cost, is substantial for scalable systems. Fortunately, compiler-generated cache management can reduce program serialization due to cache contention; increase execution performance; and reduce the cost of parallel systems by eliminating the need for more expensive hardware support. In this article, we use the Sisal functional language system as a vehicle to implement and investigate automatic, compiler-based cache management. We describe our implementation of Sisal for the IBM Power/4. The Power/4, briefly available as a product, represents an early attempt to build a shared memory machine that relies strictly on the language system for cache coherence. We discuss the issues associated with deterministic execution and program correctness on a system without hardware coherence, and demonstrate how Sisal (as a functional language is able to address those issues.

Version pressure feedback mechanisms for speculative versioning caches

Science.gov (United States)

Eichenberger, Alexandre E.; Gara, Alan; O& #x27; Brien, Kathryn M.; Ohmacht, Martin; Zhuang, Xiaotong

2013-03-12

Mechanisms are provided for controlling version pressure on a speculative versioning cache. Raw version pressure data is collected based on one or more threads accessing cache lines of the speculative versioning cache. One or more statistical measures of version pressure are generated based on the collected raw version pressure data. A determination is made as to whether one or more modifications to an operation of a data processing system are to be performed based on the one or more statistical measures of version pressure, the one or more modifications affecting version pressure exerted on the speculative versioning cache. An operation of the data processing system is modified based on the one or more determined modifications, in response to a determination that one or more modifications to the operation of the data processing system are to be performed, to affect the version pressure exerted on the speculative versioning cache.

Dynamic web cache publishing for IaaS clouds using Shoal

International Nuclear Information System (INIS)

Gable, Ian; Chester, Michael; Berghaus, Frank; Leavett-Brown, Colin; Paterson, Michael; Prior, Robert; Sobie, Randall; Taylor, Ryan; Armstrong, Patrick; Charbonneau, Andre

2014-01-01

We have developed a highly scalable application, called Shoal, for tracking and utilizing a distributed set of HTTP web caches. Our application uses the Squid HTTP cache. Squid servers advertise their existence to the Shoal server via AMQP messaging by running Shoal Agent. The Shoal server provides a simple REST interface that allows clients to determine their closest Squid cache. Our goal is to dynamically instantiate Squid caches on IaaS clouds in response to client demand. Shoal provides the VMs on IaaS clouds with the location of the nearest dynamically instantiated Squid Cache

Search-Order Independent State Caching

DEFF Research Database (Denmark)

Evangelista, Sami; Kristensen, Lars Michael

2009-01-01

State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search to ensure termination.We propose and experimentally evaluate an extension of the state caching method for general state...... exploring algorithms that are independent of the search order (i.e., search algorithms that partition the state space into closed (visited) states, open (to visit) states and unmet states)....

dCache on Steroids - Delegated Storage Solutions

Science.gov (United States)

Mkrtchyan, T.; Adeyemi, F.; Ashish, A.; Behrmann, G.; Fuhrmann, P.; Litvintsev, D.; Millar, P.; Rossi, A.; Sahakyan, M.; Starek, J.

2017-10-01

For over a decade, dCache.org has delivered a robust software used at more than 80 Universities and research institutes around the world, allowing these sites to provide reliable storage services for the WLCG experiments as well as many other scientific communities. The flexible architecture of dCache allows running it in a wide variety of configurations and platforms - from a SoC based all-in-one Raspberry-Pi up to hundreds of nodes in a multipetabyte installation. Due to lack of managed storage at the time, dCache implemented data placement, replication and data integrity directly. Today, many alternatives are available: S3, GlusterFS, CEPH and others. While such solutions position themselves as scalable storage systems, they cannot be used by many scientific communities out of the box. The absence of community-accepted authentication and authorization mechanisms, the use of product specific protocols and the lack of namespace are some of the reasons that prevent wide-scale adoption of these alternatives. Most of these limitations are already solved by dCache. By delegating low-level storage management functionality to the above-mentioned new systems and providing the missing layer through dCache, we provide a solution which combines the benefits of both worlds - industry standard storage building blocks with the access protocols and authentication required by scientific communities. In this paper, we focus on CEPH, a popular software for clustered storage that supports file, block and object interfaces. CEPH is often used in modern computing centers, for example as a backend to OpenStack services. We will show prototypes of dCache running with a CEPH backend and discuss the benefits and limitations of such an approach. We will also outline the roadmap for supporting ‘delegated storage’ within the dCache releases.

Ranger uranium environmental enquiry

International Nuclear Information System (INIS)

1976-07-01

The submission is divided into three sections. Section A considers the international implications of the development of uranium resources including economic and resource aspects and environmental and social aspects. Section B outlines the government's position on export controls over uranium and its effect on the introduction of nuclear power in Australia. Section C describes the licensing and regulatory functions that would be needed to monitor the environmental and health aspects of the Ranger project. (R.L.)

Cooperative Caching in Mobile Ad Hoc Networks Based on Data Utility

Directory of Open Access Journals (Sweden)

Narottam Chand

2007-01-01

Full Text Available Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV, to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC, is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.

An Adaptive Insertion and Promotion Policy for Partitioned Shared Caches

Science.gov (United States)

Mahrom, Norfadila; Liebelt, Michael; Raof, Rafikha Aliana A.; Daud, Shuhaizar; Hafizah Ghazali, Nur

2018-03-01

Cache replacement policies in chip multiprocessors (CMP) have been investigated extensively and proven able to enhance shared cache management. However, competition among multiple processors executing different threads that require simultaneous access to a shared memory may cause cache contention and memory coherence problems on the chip. These issues also exist due to some drawbacks of the commonly used Least Recently Used (LRU) policy employed in multiprocessor systems, which are because of the cache lines residing in the cache longer than required. In image processing analysis of for example extra pulmonary tuberculosis (TB), an accurate diagnosis for tissue specimen is required. Therefore, a fast and reliable shared memory management system to execute algorithms for processing vast amount of specimen image is needed. In this paper, the effects of the cache replacement policy in a partitioned shared cache are investigated. The goal is to quantify whether better performance can be achieved by using less complex replacement strategies. This paper proposes a Middle Insertion 2 Positions Promotion (MI2PP) policy to eliminate cache misses that could adversely affect the access patterns and the throughput of the processors in the system. The policy employs a static predefined insertion point, near distance promotion, and the concept of ownership in the eviction policy to effectively improve cache thrashing and to avoid resource stealing among the processors.

76 FR 30937 - Environmental Impacts Statements; Notice of Availability

Science.gov (United States)

2011-05-27

... and to Areas within and Adjacent to Wildland Urban Interface near Tennant, Goosenest Ranger District... land Use Development in the Specific Plan Area, City of Folsom, Sacramento County, CA, Review Period... 2004 FEIS, Ashland Ranger District, Rogue River National Forest and Scott River Ranger District...

RANGER-DTL 2.0: Rigorous Reconstruction of Gene-Family Evolution by Duplication, Transfer, and Loss.

Science.gov (United States)

Bansal, Mukul S; Kellis, Manolis; Kordi, Misagh; Kundu, Soumya

2018-04-24

RANGER-DTL 2.0 is a software program for inferring gene family evolution using Duplication-Transfer-Loss reconciliation. This new software is highly scalable and easy to use, and offers many new features not currently available in any other reconciliation program. RANGER-DTL 2.0 has a particular focus on reconciliation accuracy and can account for many sources of reconciliation uncertainty including uncertain gene tree rooting, gene tree topological uncertainty, multiple optimal reconciliations, and alternative event cost assignments. RANGER-DTL 2.0 is open-source and written in C ++ and Python. Pre-compiled executables, source code (open-source under GNU GPL), and a detailed manual are freely available from http://compbio.engr.uconn.edu/software/RANGER-DTL/. mukul.bansal@uconn.edu.

A Stack Cache for Real-Time Systems

DEFF Research Database (Denmark)

Schoeberl, Martin; Nielsen, Carsten

2016-01-01

Real-time systems need time-predictable computing platforms to allowfor static analysis of the worst-case execution time. Caches are important for good performance, but data caches arehard to analyze for the worst-case execution time. Stack allocated data has different properties related...

A distributed storage system with dCache

DEFF Research Database (Denmark)

Behrmann, Gerd; Fuhrmann, Patrick; Grønager, Michael

2008-01-01

The LCG collaboration is encompassed by a number of Tier 1 centers. The Nordic LCG Tier 1, operated by NDGF, is in contrast to many other Tier 1 centers distributed over the Nordic countries. A distributed setup was chosen for both political and technical reasons, but also provides a number...... of unique challenges. dCache is well known and respected as a powerful distributed storage resource manager, and was chosen for implementing the storage aspects of the Nordic Tier 1. In contrast to classic dCache deployments, we deploy dCache over a WAN with limited bandwidth, high latency, frequent network...

Smart caching based on mobile agent of power WebGIS platform.

Science.gov (United States)

Wang, Xiaohui; Wu, Kehe; Chen, Fei

2013-01-01

Power information construction is developing towards intensive, platform, distributed direction with the expansion of power grid and improvement of information technology. In order to meet the trend, power WebGIS was designed and developed. In this paper, we first discuss the architecture and functionality of power WebGIS, and then we study caching technology in detail, which contains dynamic display cache model, caching structure based on mobile agent, and cache data model. We have designed experiments of different data capacity to contrast performance between WebGIS with the proposed caching model and traditional WebGIS. The experimental results showed that, with the same hardware environment, the response time of WebGIS with and without caching model increased as data capacity growing, while the larger the data was, the higher the performance of WebGIS with proposed caching model improved.

Behavior-aware cache hierarchy optimization for low-power multi-core embedded systems

Science.gov (United States)

Zhao, Huatao; Luo, Xiao; Zhu, Chen; Watanabe, Takahiro; Zhu, Tianbo

2017-07-01

In modern embedded systems, the increasing number of cores requires efficient cache hierarchies to ensure data throughput, but such cache hierarchies are restricted by their tumid size and interference accesses which leads to both performance degradation and wasted energy. In this paper, we firstly propose a behavior-aware cache hierarchy (BACH) which can optimally allocate the multi-level cache resources to many cores and highly improved the efficiency of cache hierarchy, resulting in low energy consumption. The BACH takes full advantage of the explored application behaviors and runtime cache resource demands as the cache allocation bases, so that we can optimally configure the cache hierarchy to meet the runtime demand. The BACH was implemented on the GEM5 simulator. The experimental results show that energy consumption of a three-level cache hierarchy can be saved from 5.29% up to 27.94% compared with other key approaches while the performance of the multi-core system even has a slight improvement counting in hardware overhead.

dCache, agile adoption of storage technology

CERN Multimedia

CERN. Geneva

2012-01-01

For over a decade, dCache has been synonymous with large-capacity, fault-tolerant storage using commodity hardware that supports seamless data migration to and from tape. Over that time, it has satisfied the requirements of various demanding scientific user communities to store their data, transfer it between sites and fast, site-local access. When the dCache project started, the focus was on managing a relatively small disk cache in front of large tape archives. Over the project's lifetime storage technology has changed. During this period, technology changes have driven down the cost-per-GiB of harddisks. This resulted in a shift towards systems where the majority of data is stored on disk. More recently, the availability of Solid State Disks, while not yet a replacement for magnetic disks, offers an intriguing opportunity for significant performance improvement if they can be used intelligently within an existing system. New technologies provide new opportunities and dCache user communities' computi...

Study of cache performance in distributed environment for data processing

International Nuclear Information System (INIS)

Makatun, Dzmitry; Lauret, Jérôme; Šumbera, Michal

2014-01-01

Processing data in distributed environment has found its application in many fields of science (Nuclear and Particle Physics (NPP), astronomy, biology to name only those). Efficiently transferring data between sites is an essential part of such processing. The implementation of caching strategies in data transfer software and tools, such as the Reasoner for Intelligent File Transfer (RIFT) being developed in the STAR collaboration, can significantly decrease network load and waiting time by reusing the knowledge of data provenance as well as data placed in transfer cache to further expand on the availability of sources for files and data-sets. Though, a great variety of caching algorithms is known, a study is needed to evaluate which one can deliver the best performance in data access considering the realistic demand patterns. Records of access to the complete data-sets of NPP experiments were analyzed and used as input for computer simulations. Series of simulations were done in order to estimate the possible cache hits and cache hits per byte for known caching algorithms. The simulations were done for cache of different sizes within interval 0.001 – 90% of complete data-set and low-watermark within 0-90%. Records of data access were taken from several experiments and within different time intervals in order to validate the results. In this paper, we will discuss the different data caching strategies from canonical algorithms to hybrid cache strategies, present the results of our simulations for the diverse algorithms, debate and identify the choice for the best algorithm in the context of Physics Data analysis in NPP. While the results of those studies have been implemented in RIFT, they can also be used when setting up cache in any other computational work-flow (Cloud processing for example) or managing data storages with partial replicas of the entire data-set

A Cache System Design for CMPs with Built-In Coherence Verification

Directory of Open Access Journals (Sweden)

Mamata Dalui

2016-01-01

Full Text Available This work reports an effective design of cache system for Chip Multiprocessors (CMPs. It introduces built-in logic for verification of cache coherence in CMPs realizing directory based protocol. It is developed around the cellular automata (CA machine, invented by John von Neumann in the 1950s. A special class of CA referred to as single length cycle 2-attractor cellular automata (TACA has been planted to detect the inconsistencies in cache line states of processors’ private caches. The TACA module captures coherence status of the CMPs’ cache system and memorizes any inconsistent recording of the cache line states during the processors’ reference to a memory block. Theory has been developed to empower a TACA to analyse the cache state updates and then to settle to an attractor state indicating quick decision on a faulty recording of cache line status. The introduction of segmentation of the CMPs’ processor pool ensures a better efficiency, in determining the inconsistencies, by reducing the number of computation steps in the verification logic. The hardware requirement for the verification logic points to the fact that the overhead of proposed coherence verification module is much lesser than that of the conventional verification units and is insignificant with respect to the cost involved in CMPs’ cache system.

Scope-Based Method Cache Analysis

DEFF Research Database (Denmark)

Huber, Benedikt; Hepp, Stefan; Schoeberl, Martin

2014-01-01

The quest for time-predictable systems has led to the exploration of new hardware architectures that simplify analysis and reasoning in the temporal domain, while still providing competitive performance. For the instruction memory, the method cache is a conceptually attractive solution, as it req......The quest for time-predictable systems has led to the exploration of new hardware architectures that simplify analysis and reasoning in the temporal domain, while still providing competitive performance. For the instruction memory, the method cache is a conceptually attractive solution...

Funnel Heap - A Cache Oblivious Priority Queue

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

2002-01-01

The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are unknown to the algorithms. A consequence of this assumption is that an algorithm efficient in the cache oblivious model is automatically efficient in a multi-level memory...

Value-Based Caching in Information-Centric Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Fadi M. Al-Turjman

2017-01-01

Full Text Available We propose a resilient cache replacement approach based on a Value of sensed Information (VoI policy. To resolve and fetch content when the origin is not available due to isolated in-network nodes (fragmentation and harsh operational conditions, we exploit a content caching approach. Our approach depends on four functional parameters in sensory Wireless Body Area Networks (WBANs. These four parameters are: age of data based on periodic request, popularity of on-demand requests, communication interference cost, and the duration for which the sensor node is required to operate in active mode to capture the sensed readings. These parameters are considered together to assign a value to the cached data to retain the most valuable information in the cache for prolonged time periods. The higher the value, the longer the duration for which the data will be retained in the cache. This caching strategy provides significant availability for most valuable and difficult to retrieve data in the WBANs. Extensive simulations are performed to compare the proposed scheme against other significant caching schemes in the literature while varying critical aspects in WBANs (e.g., data popularity, cache size, publisher load, connectivity-degree, and severe probabilities of node failures. These simulation results indicate that the proposed VoI-based approach is a valid tool for the retrieval of cached content in disruptive and challenging scenarios, such as the one experienced in WBANs, since it allows the retrieval of content for a long period even while experiencing severe in-network node failures.

A detailed GPU cache model based on reuse distance theory

NARCIS (Netherlands)

Nugteren, C.; Braak, van den G.J.W.; Corporaal, H.; Bal, H.E.

2014-01-01

As modern GPUs rely partly on their on-chip memories to counter the imminent off-chip memory wall, the efficient use of their caches has become important for performance and energy. However, optimising cache locality systematically requires insight into and prediction of cache behaviour. On

Adjustable Two-Tier Cache for IPTV Based on Segmented Streaming

Directory of Open Access Journals (Sweden)

Kai-Chun Liang

2012-01-01

Full Text Available Internet protocol TV (IPTV is a promising Internet killer application, which integrates video, voice, and data onto a single IP network, and offers viewers an innovative set of choices and control over their TV content. To provide high-quality IPTV services, an effective strategy is based on caching. This work proposes a segment-based two-tier caching approach, which divides each video into multiple segments to be cached. This approach also partitions the cache space into two layers, where the first layer mainly caches to-be-played segments and the second layer saves possibly played segments. As the segment access becomes frequent, the proposed approach enlarges the first layer and reduces the second layer, and vice versa. Because requested segments may not be accessed frequently, this work further designs an admission control mechanism to determine whether an incoming segment should be cached or not. The cache architecture takes forward/stop playback into account and may replace the unused segments under the interrupted playback. Finally, we conduct comprehensive simulation experiments to evaluate the performance of the proposed approach. The results show that our approach can yield higher hit ratio than previous work under various environmental parameters.

Novel dynamic caching for hierarchically distributed video-on-demand systems

Science.gov (United States)

Ogo, Kenta; Matsuda, Chikashi; Nishimura, Kazutoshi

1998-02-01

It is difficult to simultaneously serve the millions of video streams that will be needed in the age of 'Mega-Media' networks by using only one high-performance server. To distribute the service load, caching servers should be location near users. However, in previously proposed caching mechanisms, the grade of service depends on whether the data is already cached at a caching server. To make the caching servers transparent to the users, the ability to randomly access the large volume of data stored in the central server should be supported, and the operational functions of the provided service should not be narrowly restricted. We propose a mechanism for constructing a video-stream-caching server that is transparent to the users and that will always support all special playback functions for all available programs to all the contents with a latency of only 1 or 2 seconds. This mechanism uses Variable-sized-quantum-segment- caching technique derived from an analysis of the historical usage log data generated by a line-on-demand-type service experiment and based on the basic techniques used by a time- slot-based multiple-stream video-on-demand server.

RangerMaster trademark: Real-time pattern recognition software for in-field analysis of radiation sources

International Nuclear Information System (INIS)

Murray, W.S.; Ziemba, F.; Szluk, N.

1998-01-01

RangerMaster trademark is the embedded firmware for Quantrad Sensor's integrated nuclear instrument package, the Ranger trademark. The Ranger trademark, which is both a gamma-ray and neutron detection system, was originally developed at Los Alamos National Laboratory for in situ surveys at the Plutonium Facility to confirm the presence of nuclear materials. The new RangerMaster trademark software expands the library of isotopes and simplifies the operation of the instrument by providing an easy mode suitable for untrained operators. The expanded library of the Ranger trademark now includes medical isotopes 99 Tc, 201 Tl, 111 In, 67 Ga, 133 Xe, 103 Pa, and 131 I; industrial isotopes 241 Am, 57 Co, 133 Ba, 137 Cs, 40 K, 60 Co, 232 Th, 226 Ra, and 207 Bi; and nuclear materials 235 U, 238 U, 233 U, and 239 Pu. To accomplish isotopic identification, a simulated spectrum for each of the isotopes was generated using SYNTH. The SYNTH spectra formed the basis for the knowledge-based expert system and selection of the regions of interest that are used in the pattern recognition system. The knowledge-based pattern recognition system was tested against actual spectra under field conditions

RangerMasterTM: real-time pattern recognition software for in-field analysis of radiation sources

International Nuclear Information System (INIS)

Murray, W.S.; Ziemba, F.; Szluk, N.

1998-01-01

RangerMaster TM is the embedded firmware for Quantrad Sensor's integrated nuclear instrument package, the Ranger TM . The Ranger TM , which is both a gamma-ray and neutron detection system, was originally developed at Los Alamos National Laboratory for in situ surveys at the Plutonium Facility to confirm the presence of nuclear materials. The new RangerMaster TM software expands the library of isotopes and simplifies the operation of the instrument by providing an 'easy' mode suitable for untrained operators. The expanded library of the Ranger TM now includes medical isotopes 99 Tc, 201 Tl, 111 In, 67 Ga, 133 Xe, 103 Pa, and 131 I; industrial isotopes 241 Am, 57 Co, 133 Ba, 137 Cs, 40 K, 60 Co, 232 Th, 226 Ra, and 207 Bi; and nuclear materials 235 U, 238 U, 233 U, and 239 Pu. To accomplish isotopic identification, a simulated spectrum for each of the isotopes was generated using SYNTH 2 . The SYNTH spectra formed the basis for the knowledge-based expert system and selection of the regions of interest that are used in the pattern recognition system. The knowledge-based pattern recognition system was tested against actual spectra under field conditions. (author)

Alignment of Memory Transfers of a Time-Predictable Stack Cache

DEFF Research Database (Denmark)

Abbaspourseyedi, Sahar; Brandner, Florian

2014-01-01

of complex cache states. Instead, only the occupancy level of the cache has to be determined. The memory transfers generated by the standard stack cache are not generally aligned. These unaligned accesses risk to introduce complexity to the otherwise simple WCET analysis. In this work, we investigate three...

Environmental auditing at Ranger

International Nuclear Information System (INIS)

Armstrong, A.; Reid, A.

1989-01-01

A preliminary external audit was carried out on three aspects of the Ranger Environmental Impact Statement (EIS), namely meteorological data, water release and water quality of releases. It assessed the accuracy of forecasts and predictive data statements against the actual environmental data obtained during operations, and concluded that impacts of the project were adequately described but inadequately quantified. The second state of the auditing is concerned with the assessment of the effectiveness of practices and procedures which are integrated into the ongoing environmental management program. 7 tabs. 2 figs

Age of uranium ores at Ranger and Jabiluka unconformity vein deposits, Northern Territory, Australia

International Nuclear Information System (INIS)

Ludwig, K.R.; Grauch, R.I.; Nutt, C.J.; Frishman, D.; Nash, J.T.; Simmons, K.R.

1985-01-01

The Ranger and Jabiluka uranium deposits are the largest in the Alligator Rivers Uranium Field (ARUF), which contains at least 20% of the world's low-cost uranium reserves. Ore occurs in early Proterozoic metasediments, below an unconformity with sandstones of the 1.65 Ga Kombolgie Formation. This study uses U-Pb isotope data from over 60 whole-rock drill core samples that contained a variety of mineral assemblages and textures. Data for Ranger samples indicate a well-defined age of 1.74 +/-.02 Ga. This 1.74 Ga age is distinctly pre-Kombolgie, so the Ranger deposit cannot have been formed by processes requiring its presence. This Ranger age is consistent, however, with mineralization related to heating associated with either the emplacement of early post-metamorphic granites, or possibly with intrusion of the nearby Oenpelli Dolerite. In contrast, data for the least-altered Jabiluka ores yield a concordia-intercept age of 1.44 +/-.02 Ga--significantly younger than the Ranger age, and also younger than the Komobolgie. This age may correspond to a regional thermal event, as indicated both by mafic dikes of roughly this age and a zircon lower-intercept age from a nearby granite-gneiss. Thus, together with the well-defined ∼900 Ma age of ores at the Nabarlek deposit, there are at least 3 distinct periods of major U-mineralization in the ARUF. Data for both Ranger and Jabiluka indicate the same, profound isotopic disturbance at some time in the interval of 0.4-0.6 Ga. Possibly this time corresponds to the development of basins and associated basalt flows to the W and SW, a suggested by Crick et. al. (1980)

A trace-driven analysis of name and attribute caching in a distributed system

Science.gov (United States)

Shirriff, Ken W.; Ousterhout, John K.

1992-01-01

This paper presents the results of simulating file name and attribute caching on client machines in a distributed file system. The simulation used trace data gathered on a network of about 40 workstations. Caching was found to be advantageous: a cache on each client containing just 10 directories had a 91 percent hit rate on name look ups. Entry-based name caches (holding individual directory entries) had poorer performance for several reasons, resulting in a maximum hit rate of about 83 percent. File attribute caching obtained a 90 percent hit rate with a cache on each machine of the attributes for 30 files. The simulations show that maintaining cache consistency between machines is not a significant problem; only 1 in 400 name component look ups required invalidation of a remotely cached entry. Process migration to remote machines had little effect on caching. Caching was less successful in heavily shared and modified directories such as /tmp, but there weren't enough references to /tmp overall to affect the results significantly. We estimate that adding name and attribute caching to the Sprite operating system could reduce server load by 36 percent and the number of network packets by 30 percent.

Development of the Ranger uranium milling operations

International Nuclear Information System (INIS)

Baily, P.A.

1982-01-01

The development and operation of the Ranger uranium project is described. In 1969 Ranger discovered a uranium-bearing ore deposit in the Alligator Rivers Region of the Northern Territory of Australia. Extensive testwork on drill core samples proved the viability of the extraction of the uranium and a process flowsheet and plant design criteria were developed based on a conventional crushing, grinding, acid leach, C.C.D., solvent extraction circuit. Detailed design concentrated on plant layout, materials of construction, equipment vendor selection and process control. These factors required special attention because of the remote location of the mine and the high cost and difficulty in obtaining trained labour for such sites. Environmental considerations were key factors in design. The mine is located adjacent to a national park and has an average rainfall of 1,600 mm. No water or liquid effluents are to be released from the project area and thus water management is a key factor. Tailings are ponded in an impervious earth-rockfill dam

A Novel Cache Invalidation Scheme for Mobile Networks

Institute of Scientific and Technical Information of China (English)

无

2006-01-01

In this paper, we propose a strategy of maintaining cache consistency in wireless mobile environments, which adds a validation server (VS) into the GPRS network, utilizes the location information of mobile terminal in SGSN located at GPRS backbone, just sends invalidation information to mobile terminal which is online in accordance with the cached data, and reduces the information amount in asynchronous transmission. This strategy enables mobile terminal to access cached data with very little computing amount, little delay and arbitrary disconnection intervals, and excels the synchronous IR and asynchronous state (AS) in the total performances.

A distributed storage system with dCache

Science.gov (United States)

Behrmann, G.; Fuhrmann, P.; Grønager, M.; Kleist, J.

2008-07-01

The LCG collaboration is encompassed by a number of Tier 1 centers. The Nordic LCG Tier 1, operated by NDGF, is in contrast to many other Tier 1 centers distributed over the Nordic countries. A distributed setup was chosen for both political and technical reasons, but also provides a number of unique challenges. dCache is well known and respected as a powerful distributed storage resource manager, and was chosen for implementing the storage aspects of the Nordic Tier 1. In contrast to classic dCache deployments, we deploy dCache over a WAN with limited bandwidth, high latency, frequent network failures, and spanning many administrative domains. These properties provide unique challenges, covering topics such as security, administration, maintenance, upgradability, reliability, and performance. Our initial focus has been on implementing the GFD.47 OGF recommendation (which introduced the GridFTP 2 protocol) in dCache and the Globus Toolkit. Compared to GridFTP 1, GridFTP 2 allows for more intelligent data flow between clients and storage pools, thus enabling more efficient use of our limited bandwidth.

A distributed storage system with dCache

International Nuclear Information System (INIS)

Behrmann, G; Groenager, M; Fuhrmann, P; Kleist, J

2008-01-01

The LCG collaboration is encompassed by a number of Tier 1 centers. The Nordic LCG Tier 1, operated by NDGF, is in contrast to many other Tier 1 centers distributed over the Nordic countries. A distributed setup was chosen for both political and technical reasons, but also provides a number of unique challenges. dCache is well known and respected as a powerful distributed storage resource manager, and was chosen for implementing the storage aspects of the Nordic Tier 1. In contrast to classic dCache deployments, we deploy dCache over a WAN with limited bandwidth, high latency, frequent network failures, and spanning many administrative domains. These properties provide unique challenges, covering topics such as security, administration, maintenance, upgradability, reliability, and performance. Our initial focus has been on implementing the GFD.47 OGF recommendation (which introduced the GridFTP 2 protocol) in dCache and the Globus Toolkit. Compared to GridFTP 1, GridFTP 2 allows for more intelligent data flow between clients and storage pools, thus enabling more efficient use of our limited bandwidth

Efficient Context Switching for the Stack Cache: Implementation and Analysis

DEFF Research Database (Denmark)

Abbaspourseyedi, Sahar; Brandner, Florian; Naji, Amine

2015-01-01

, the analysis of the stack cache was limited to individual tasks, ignoring aspects related to multitasking. A major drawback of the original stack cache design is that, due to its simplicity, it cannot hold the data of multiple tasks at the same time. Consequently, the entire cache content needs to be saved...

Energy Efficient Caching in Backhaul-Aware Cellular Networks with Dynamic Content Popularity

Directory of Open Access Journals (Sweden)

Jiequ Ji

2018-01-01

Full Text Available Caching popular contents at base stations (BSs has been regarded as an effective approach to alleviate the backhaul load and to improve the quality of service. To meet the explosive data traffic demand and to save energy consumption, energy efficiency (EE has become an extremely important performance index for the 5th generation (5G cellular networks. In general, there are two ways for improving the EE for caching, that is, improving the cache-hit rate and optimizing the cache size. In this work, we investigate the energy efficient caching problem in backhaul-aware cellular networks jointly considering these two approaches. Note that most existing works are based on the assumption that the content catalog and popularity are static. However, in practice, content popularity is dynamic. To timely estimate the dynamic content popularity, we propose a method based on shot noise model (SNM. Then we propose a distributed caching policy to improve the cache-hit rate in such a dynamic environment. Furthermore, we analyze the tradeoff between energy efficiency and cache capacity for which an optimization is formulated. We prove its convexity and derive a closed-form optimal cache capacity for maximizing the EE. Simulation results validate the proposed scheme and show that EE can be improved with appropriate choice of cache capacity.

Land application at Ranger uranium mine, northern Australia: six years'review

International Nuclear Information System (INIS)

Noller, B.N.; Zhou, J.X.

1992-01-01

This report reviews the six years' practice of land application of waste water at the Ranger Uranium Mine, northern Australia. Elements of significance to the chemical impact on the environment by mining and milling at Ranger are analysed taking into consideration ore petrology and mineralogy, chemical compositions of rocks and ore, relative enrichment of different rock- and ore-forming elements, and the chemicals involved in the milling and extraction processes. Biogeochemistry of land application of waste water as an efficient environmental managing technique is discussed by analysing its biogeochemical cycles, variables which affect the biogeochemical processes, and aqueous chemistry. Data from monitoring of the soils, groundwater, biota, and seepage in the land application area at Ranger are collected and re-organised. A new approach to data presentation and interpretation is made based on the analysis of the most important variables which may affect the extent of the chemical impact of land application of waste water. The environmental impact of land application of waste water on soils, ground water, biota, and surface water (through seepage) is assessed accordingly. Uranium is retained in the near-surface soil layer while sulfate is present at lower depths. Manganese shows some mobility, appearing in depressions. Radium 226 shows no clear-cut relationship between location of soil sample and level. It is concluded that land application of waste water at Ranger has resulted in minimal environmental impact. 4 refs

Conservation′s Ambiguities: Rangers on the Periphery of the W Park, Burkina Faso

Directory of Open Access Journals (Sweden)

Julie Poppe

2012-01-01

Full Text Available This article demonstrates the central role of ambiguity in the (reproduction process of conservation practice. It argues that some current political economy as well as environmentality approaches to research conservation practice fail to capture the complexity of the lived experience of local conservationists. The article focuses on the multiple identities of rangers in interaction with other residents at the periphery of the W Park in Burkina Faso, as rangers are local conservationists who simultaneously submit to and produce conservation practices. Park rangers are village men who are recruited under the banner of community participation in conservation projects and state forestry. On a day-to-day basis, these rangers help the foresters with the management of the natural resources on the one hand, and guide tourists, especially in the hunting concessions, on the other. They occupy ambiguous positions at the crossroads of conservationist, state, political, economic, spiritual, social, and cultural practices, inherent to their conservation occupations at the lowest echelon, where residents have to transform conservation policies into practices. It is precisely this ambiguity that turns out to ensure the conservation implementation.

Ranger© - An Affordable, Advanced, Next-Generation, Dual-Pol, X-Band Weather Radar

Science.gov (United States)

Stedronsky, Richard

2014-05-01

The Enterprise Electronics Corporation (EEC) Ranger© system is a new generation, X-band (3 cm), Adaptive Polarization Doppler Weather Surveillance Radar that fills the gap between high-cost, high-power traditional radar systems and the passive ground station weather sensors. Developed in partnership with the University of Oklahoma Advanced Radar Research Center (ARRC), the system uses relatively low power solid-state transmitters and pulse compression technology to attain nearly the same performance capabilities of much more expensive traditional radar systems. The Ranger© also employs Adaptive Dual Polarization (ADP) techniques to allow Alternating or Simultaneous Dual Polarization capability with total control over the transmission polarization state using dual independent coherent transmitters. Ranger© has been designed using the very latest technology available in the industry and the technical and manufacturing experience gained through over four decades of successful radar system design and production at EEC. The entire Ranger© design concept emphasizes precision, stability, reliability, and value using proven solid state technology combined with the most advanced motion control system ever conceived for weather radar. Key applications include meteorology, hydrology, aviation, offshore oil/gas drilling, wind energy, and outdoor event situational awareness.

On Optimal Geographical Caching in Heterogeneous Cellular Networks

NARCIS (Netherlands)

Serbetci, Berksan; Goseling, Jasper

2017-01-01

In this work we investigate optimal geographical caching in heterogeneous cellular networks where different types of base stations (BSs) have different cache capacities. Users request files from a content library according to a known probability distribution. The performance metric is the total hit

Distributed caching mechanism for various MPE software services

CERN Document Server

Svec, Andrej

2017-01-01

The MPE Software Section provides multiple software services to facilitate the testing and the operation of the CERN Accelerator complex. Continuous growth in the number of users and the amount of processed data result in the requirement of high scalability. Our current priority is to move towards a distributed and properly load balanced set of services based on containers. The aim of this project is to implement the generic caching mechanism applicable to our services and chosen architecture. The project will at first require research about the different aspects of distributed caching (persistence, no gc-caching, cache consistency etc.) and the available technologies followed by the implementation of the chosen solution. In order to validate the correctness and performance of the implementation in the last phase of the project it will be required to implement a monitoring layer and integrate it with the current ELK stack.

Caching Efficiency Enhancement at Wireless Edges with Concerns on User’s Quality of Experience

Directory of Open Access Journals (Sweden)

Feng Li

2018-01-01

Full Text Available Content caching is a promising approach to enhancing bandwidth utilization and minimizing delivery delay for new-generation Internet applications. The design of content caching is based on the principles that popular contents are cached at appropriate network edges in order to reduce transmission delay and avoid backhaul bottleneck. In this paper, we propose a cooperative caching replacement and efficiency optimization scheme for IP-based wireless networks. Wireless edges are designed to establish a one-hop scope of caching information table for caching replacement in cases when there is not enough cache resource available within its own space. During the course, after receiving the caching request, every caching node should determine the weight of the required contents and provide a response according to the availability of its own caching space. Furthermore, to increase the caching efficiency from a practical perspective, we introduce the concept of quality of user experience (QoE and try to properly allocate the cache resource of the whole networks to better satisfy user demands. Different caching allocation strategies are devised to be adopted to enhance user QoE in various circumstances. Numerical results are further provided to justify the performance improvement of our proposal from various aspects.

Cache timing attacks on recent microarchitectures

DEFF Research Database (Denmark)

Andreou, Alexandres; Bogdanov, Andrey; Tischhauser, Elmar Wolfgang

2017-01-01

Cache timing attacks have been known for a long time, however since the rise of cloud computing and shared hardware resources, such attacks found new potentially devastating applications. One prominent example is S$A (presented by Irazoqui et al at S&P 2015) which is a cache timing attack against...... AES or similar algorithms in virtualized environments. This paper applies variants of this cache timing attack to Intel's latest generation of microprocessors. It enables a spy-process to recover cryptographic keys, interacting with the victim processes only over TCP. The threat model is a logically...... separated but CPU co-located attacker with root privileges. We report successful and practically verified applications of this attack against a wide range of microarchitectures, from a two-core Nehalem processor (i5-650) to two-core Haswell (i7-4600M) and four-core Skylake processors (i7-6700). The attack...

Canadian Ranger Rifle: Human Factors Requirements Validation

Science.gov (United States)

2010-08-01

index-eng.asp retrieved 9 February 2010 2 http://www.armee.forces.gc.ca/land-terre/cr-rc/history- histoire -eng.asp retrieved 9 February 2010 3 http... histoire -eng.asp Department of National Defence. (2010). Canadian Ranger Patrol (CRPG). Retrieved June 3, 2010, from http://www.army.forces.gc.ca

Unfavorable Strides in Cache Memory Systems (RNR Technical Report RNR-92-015

Directory of Open Access Journals (Sweden)

David H. Bailey

1995-01-01

Full Text Available An important issue in obtaining high performance on a scientific application running on a cache-based computer system is the behavior of the cache when data are accessed at a constant stride. Others who have discussed this issue have noted an odd phenomenon in such situations: A few particular innocent-looking strides result in sharply reduced cache efficiency. In this article, this problem is analyzed, and a simple formula is presented that accurately gives the cache efficiency for various cache parameters and data strides.

Enhancing Leakage Power in CPU Cache Using Inverted Architecture

OpenAIRE

Bilal A. Shehada; Ahmed M. Serdah; Aiman Abu Samra

2013-01-01

Power consumption is an increasingly pressing problem in modern processor design. Since the on-chip caches usually consume a significant amount of power so power and energy consumption parameters have become one of the most important design constraint. It is one of the most attractive targets for power reduction. This paper presents an approach to enhance the dynamic power consumption of CPU cache using inverted cache architecture. Our assumption tries to reduce dynamic write power dissipatio...

Combining instruction prefetching with partial cache locking to improve WCET in real-time systems.

Directory of Open Access Journals (Sweden)

Fan Ni

Full Text Available Caches play an important role in embedded systems to bridge the performance gap between fast processor and slow memory. And prefetching mechanisms are proposed to further improve the cache performance. While in real-time systems, the application of caches complicates the Worst-Case Execution Time (WCET analysis due to its unpredictable behavior. Modern embedded processors often equip locking mechanism to improve timing predictability of the instruction cache. However, locking the whole cache may degrade the cache performance and increase the WCET of the real-time application. In this paper, we proposed an instruction-prefetching combined partial cache locking mechanism, which combines an instruction prefetching mechanism (termed as BBIP with partial cache locking to improve the WCET estimates of real-time applications. BBIP is an instruction prefetching mechanism we have already proposed to improve the worst-case cache performance and in turn the worst-case execution time. The estimations on typical real-time applications show that the partial cache locking mechanism shows remarkable WCET improvement over static analysis and full cache locking.

Combining instruction prefetching with partial cache locking to improve WCET in real-time systems.

Science.gov (United States)

Ni, Fan; Long, Xiang; Wan, Han; Gao, Xiaopeng

2013-01-01

Caches play an important role in embedded systems to bridge the performance gap between fast processor and slow memory. And prefetching mechanisms are proposed to further improve the cache performance. While in real-time systems, the application of caches complicates the Worst-Case Execution Time (WCET) analysis due to its unpredictable behavior. Modern embedded processors often equip locking mechanism to improve timing predictability of the instruction cache. However, locking the whole cache may degrade the cache performance and increase the WCET of the real-time application. In this paper, we proposed an instruction-prefetching combined partial cache locking mechanism, which combines an instruction prefetching mechanism (termed as BBIP) with partial cache locking to improve the WCET estimates of real-time applications. BBIP is an instruction prefetching mechanism we have already proposed to improve the worst-case cache performance and in turn the worst-case execution time. The estimations on typical real-time applications show that the partial cache locking mechanism shows remarkable WCET improvement over static analysis and full cache locking.

Effects of simulated mountain lion caching on decomposition of ungulate carcasses

Science.gov (United States)

Bischoff-Mattson, Z.; Mattson, D.

2009-01-01

Caching of animal remains is common among carnivorous species of all sizes, yet the effects of caching on larger prey are unstudied. We conducted a summer field experiment designed to test the effects of simulated mountain lion (Puma concolor) caching on mass loss, relative temperature, and odor dissemination of 9 prey-like carcasses. We deployed all but one of the carcasses in pairs, with one of each pair exposed and the other shaded and shallowly buried (cached). Caching substantially reduced wastage during dry and hot (drought) but not wet and cool (monsoon) periods, and it also reduced temperature and discernable odor to some degree during both seasons. These results are consistent with the hypotheses that caching serves to both reduce competition from arthropods and microbes and reduce odds of detection by larger vertebrates such as bears (Ursus spp.), wolves (Canis lupus), or other lions.

Explicit Content Caching at Mobile Edge Networks with Cross-Layer Sensing

Science.gov (United States)

Chen, Lingyu; Su, Youxing; Luo, Wenbin; Hong, Xuemin; Shi, Jianghong

2018-01-01

The deployment density and computational power of small base stations (BSs) are expected to increase significantly in the next generation mobile communication networks. These BSs form the mobile edge network, which is a pervasive and distributed infrastructure that can empower a variety of edge/fog computing applications. This paper proposes a novel edge-computing application called explicit caching, which stores selective contents at BSs and exposes such contents to local users for interactive browsing and download. We formulate the explicit caching problem as a joint content recommendation, caching, and delivery problem, which aims to maximize the expected user quality-of-experience (QoE) with varying degrees of cross-layer sensing capability. Optimal and effective heuristic algorithms are presented to solve the problem. The theoretical performance bounds of the explicit caching system are derived in simplified scenarios. The impacts of cache storage space, BS backhaul capacity, cross-layer information, and user mobility on the system performance are simulated and discussed in realistic scenarios. Results suggest that, compared with conventional implicit caching schemes, explicit caching can better exploit the mobile edge network infrastructure for personalized content dissemination. PMID:29565313

A Scalable and Highly Configurable Cache-Aware Hybrid Flash Translation Layer

Directory of Open Access Journals (Sweden)

Jalil Boukhobza

2014-03-01

Full Text Available This paper presents a cache-aware configurable hybrid flash translation layer (FTL, named CACH-FTL. It was designed based on the observation that most state-of­­-the-art flash-specific cache systems above FTLs flush groups of pages belonging to the same data block. CACH-FTL relies on this characteristic to optimize flash write operations placement, as large groups of pages are flushed to a block-mapped region, named BMR, whereas small groups are buffered into a page-mapped region, named PMR. Page group placement is based on a configurable threshold defining the limit under which it is more cost-effective to use page mapping (PMR and wait for grouping more pages before flushing to the BMR. CACH-FTL is scalable in terms of mapping table size and flexible in terms of Input/Output (I/O workload support. CACH-FTL performs very well, as the performance difference with the ideal page-mapped FTL is less than 15% in most cases and has a mean of 4% for the best CACH-FTL configurations, while using at least 78% less memory for table mapping storage on RAM.

Explicit Content Caching at Mobile Edge Networks with Cross-Layer Sensing.

Science.gov (United States)

Chen, Lingyu; Su, Youxing; Luo, Wenbin; Hong, Xuemin; Shi, Jianghong

2018-03-22

The deployment density and computational power of small base stations (BSs) are expected to increase significantly in the next generation mobile communication networks. These BSs form the mobile edge network, which is a pervasive and distributed infrastructure that can empower a variety of edge/fog computing applications. This paper proposes a novel edge-computing application called explicit caching, which stores selective contents at BSs and exposes such contents to local users for interactive browsing and download. We formulate the explicit caching problem as a joint content recommendation, caching, and delivery problem, which aims to maximize the expected user quality-of-experience (QoE) with varying degrees of cross-layer sensing capability. Optimal and effective heuristic algorithms are presented to solve the problem. The theoretical performance bounds of the explicit caching system are derived in simplified scenarios. The impacts of cache storage space, BS backhaul capacity, cross-layer information, and user mobility on the system performance are simulated and discussed in realistic scenarios. Results suggest that, compared with conventional implicit caching schemes, explicit caching can better exploit the mobile edge network infrastructure for personalized content dissemination.

Randomized Caches Considered Harmful in Hard Real-Time Systems

Directory of Open Access Journals (Sweden)

Jan Reineke

2014-06-01

Full Text Available We investigate the suitability of caches with randomized placement and replacement in the context of hard real-time systems. Such caches have been claimed to drastically reduce the amount of information required by static worst-case execution time (WCET analysis, and to be an enabler for measurement-based probabilistic timing analysis. We refute these claims and conclude that with prevailing static and measurement-based analysis techniques caches with deterministic placement and least-recently-used replacement are preferable over randomized ones.

Natural resources youth training program (NRYTP), resource rangers 2010

Energy Technology Data Exchange (ETDEWEB)

NONE

2010-09-15

In 2010, for a second year, the natural resources youth training program (NRYTP) was developed in northern Manitoba thanks to Manitoba Keewatinowi Okimakanak Inc. (MKO) and the collaboration of 42 sponsors. 16 aboriginal youth representing six northern communities took part in the five-week program located at the Egg Lake camp. The objective was to provide these resources rangers with knowledge and training in the most widespread resource sectors in northern Manitoba, including mining, forestry and hydropower. Trainers and experts provided by industry partners offered training sessions, hands-on work experience and other activities to help resource rangers to acquire a better understanding of the employability in this field in the northern region and the knowledge and skills the resource-based careers require. Life and professional skills training was given by the camp staff and local professionals. On-site elders and cultural events also allowed the integration of a northern Cree cultural component. Three staff members, a cook and elders assisted daily the resource rangers. Many improvements and refinements have been made since the success of the 2009 program, including the involvement of a larger number of communities, program contributors and program graduates. The program length has doubled and the number of jobs created has increased, important cultural aspects were introduced and the overall expenses were reduced.

Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks

Directory of Open Access Journals (Sweden)

Zhenjie Ma

2018-01-01

Full Text Available Effective data access is one of the major challenges in Delay Tolerant Networks (DTNs that are characterized by intermittent network connectivity and unpredictable node mobility. Currently, different data caching schemes have been proposed to improve the performance of data access in DTNs. However, most existing data caching schemes perform poorly due to the lack of global network state information and the changing network topology in DTNs. In this paper, we propose a novel data caching scheme based on cooperative caching in DTNs, aiming at improving the successful rate of data access and reducing the data access delay. In the proposed scheme, learning automata are utilized to select a set of caching nodes as Caching Node Set (CNS in DTNs. Unlike the existing caching schemes failing to address the challenging characteristics of DTNs, our scheme is designed to automatically self-adjust to the changing network topology through the well-designed voting and updating processes. The proposed scheme improves the overall performance of data access in DTNs compared with the former caching schemes. The simulations verify the feasibility of our scheme and the improvements in performance.

Re-caching by Western scrub-jays (Aphelocoma californica cannot be attributed to stress.

Directory of Open Access Journals (Sweden)

James M Thom

Full Text Available Western scrub-jays (Aphelocoma californica live double lives, storing food for the future while raiding the stores of other birds. One tactic scrub-jays employ to protect stores is "re-caching"-relocating caches out of sight of would-be thieves. Recent computational modelling work suggests that re-caching might be mediated not by complex cognition, but by a combination of memory failure and stress. The "Stress Model" asserts that re-caching is a manifestation of a general drive to cache, rather than a desire to protect existing stores. Here, we present evidence strongly contradicting the central assumption of these models: that stress drives caching, irrespective of social context. In Experiment (i, we replicate the finding that scrub-jays preferentially relocate food they were watched hiding. In Experiment (ii we find no evidence that stress increases caching. In light of our results, we argue that the Stress Model cannot account for scrub-jay re-caching.

Cache and memory hierarchy design a performance directed approach

CERN Document Server

Przybylski, Steven A

1991-01-01

An authoritative book for hardware and software designers. Caches are by far the simplest and most effective mechanism for improving computer performance. This innovative book exposes the characteristics of performance-optimal single and multi-level cache hierarchies by approaching the cache design process through the novel perspective of minimizing execution times. It presents useful data on the relative performance of a wide spectrum of machines and offers empirical and analytical evaluations of the underlying phenomena. This book will help computer professionals appreciate the impact of ca

High Performance Analytics with the R3-Cache

Science.gov (United States)

Eavis, Todd; Sayeed, Ruhan

Contemporary data warehouses now represent some of the world’s largest databases. As these systems grow in size and complexity, however, it becomes increasingly difficult for brute force query processing approaches to meet the performance demands of end users. Certainly, improved indexing and more selective view materialization are helpful in this regard. Nevertheless, with warehouses moving into the multi-terabyte range, it is clear that the minimization of external memory accesses must be a primary performance objective. In this paper, we describe the R 3-cache, a natively multi-dimensional caching framework designed specifically to support sophisticated warehouse/OLAP environments. R 3-cache is based upon an in-memory version of the R-tree that has been extended to support buffer pages rather than disk blocks. A key strength of the R 3-cache is that it is able to utilize multi-dimensional fragments of previous query results so as to significantly minimize the frequency and scale of disk accesses. Moreover, the new caching model directly accommodates the standard relational storage model and provides mechanisms for pro-active updates that exploit the existence of query “hot spots”. The current prototype has been evaluated as a component of the Sidera DBMS, a “shared nothing” parallel OLAP server designed for multi-terabyte analytics. Experimental results demonstrate significant performance improvements relative to simpler alternatives.

Adaptive Neuro-fuzzy Inference System as Cache Memory Replacement Policy

Directory of Open Access Journals (Sweden)

CHUNG, Y. M.

2014-02-01

Full Text Available To date, no cache memory replacement policy that can perform efficiently for all types of workloads is yet available. Replacement policies used in level 1 cache memory may not be suitable in level 2. In this study, we focused on developing an adaptive neuro-fuzzy inference system (ANFIS as a replacement policy for improving level 2 cache performance in terms of miss ratio. The recency and frequency of referenced blocks were used as input data for ANFIS to make decisions on replacement. MATLAB was employed as a training tool to obtain the trained ANFIS model. The trained ANFIS model was implemented on SimpleScalar. Simulations on SimpleScalar showed that the miss ratio improved by as high as 99.95419% and 99.95419% for instruction level 2 cache, and up to 98.04699% and 98.03467% for data level 2 cache compared with least recently used and least frequently used, respectively.

Probabilistic Caching Placement in the Presence of Multiple Eavesdroppers

Directory of Open Access Journals (Sweden)

Fang Shi

2018-01-01

Full Text Available The wireless caching has attracted a lot of attention in recent years, since it can reduce the backhaul cost significantly and improve the user-perceived experience. The existing works on the wireless caching and transmission mainly focus on the communication scenarios without eavesdroppers. When the eavesdroppers appear, it is of vital importance to investigate the physical-layer security for the wireless caching aided networks. In this paper, a caching network is studied in the presence of multiple eavesdroppers, which can overhear the secure information transmission. We model the locations of eavesdroppers by a homogeneous Poisson Point Process (PPP, and the eavesdroppers jointly receive and decode contents through the maximum ratio combining (MRC reception which yields the worst case of wiretap. Moreover, the main performance metric is measured by the average probability of successful transmission, which is the probability of finding and successfully transmitting all the requested files within a radius R. We study the system secure transmission performance by deriving a single integral result, which is significantly affected by the probability of caching each file. Therefore, we extend to build the optimization problem of the probability of caching each file, in order to optimize the system secure transmission performance. This optimization problem is nonconvex, and we turn to use the genetic algorithm (GA to solve the problem. Finally, simulation and numerical results are provided to validate the proposed studies.

Horizontally scaling dCache SRM with the Terracotta platform

International Nuclear Information System (INIS)

Perelmutov, T; Crawford, M; Moibenko, A; Oleynik, G

2011-01-01

The dCache disk caching file system has been chosen by a majority of LHC experiments' Tier 1 centers for their data storage needs. It is also deployed at many Tier 2 centers. The Storage Resource Manager (SRM) is a standardized grid storage interface and a single point of remote entry into dCache, and hence is a critical component. SRM must scale to increasing transaction rates and remain resilient against changing usage patterns. The initial implementation of the SRM service in dCache suffered from an inability to support clustered deployment, and its performance was limited by the hardware of a single node. Using the Terracotta platform[l], we added the ability to horizontally scale the dCache SRM service to run on multiple nodes in a cluster configuration, coupled with network load balancing. This gives site administrators the ability to increase the performance and reliability of SRM service to face the ever-increasing requirements of LHC data handling. In this paper we will describe the previous limitations of the architecture SRM server and how the Terracotta platform allowed us to readily convert single node service into a highly scalable clustered application.

Método y sistema de modelado de memoria cache

OpenAIRE

Posadas Cobo, Héctor; Villar Bonet, Eugenio; Díaz Suárez, Luis

2010-01-01

Un método de modelado de una memoria cache de datos de un procesador destino, para simular el comportamiento de dicha memoria cache de datos en la ejecución de un código software en una plataforma que comprenda dicho procesador destino, donde dicha simulación se realiza en una plataforma nativa que tiene un procesador diferente del procesador destino que comprende dicha memoria cache de datos que se va a modelar, donde dicho modelado se realiza mediante la ejecución en dicha plataforma nativa...

The contribution of the Ranger Uranium Mine to the Northern Territory and Australian economy

International Nuclear Information System (INIS)

1993-09-01

This is the report of a study by ACIL Economics and Policy Pty Ltd (ACIL) which estimates the contribution of the fist eleven years of the Ranger uranium project to the Northern Territory and Australian economies. It looks at the purchases and sales by the Company and the contributions of the project to tourism, the town of Jabiru, scientific work and royalty and taxation revenues. In the process it also assembles the available data on monies that have flowed from Ranger operations to the Aboriginal people of the Northern Territory. The analyses in intended to enable Ranger's contribution to be compared with that of other activities in the economy. Thus care has been taken to employ accepted national accounting definitions and to apply a degree of rigor which ensures that the figures generated are meaningful in relation to the official statistics covering the economy which are produced by the Australian Bureau of Statistics. Besides analysing the net economic contribution of Ranger, the report looks at certain distributional aspects, in particular the impact on Aboriginal people. The vast majority of Ranger's value-added contribution has been in a form that appears in ERA's accounts. Side-benefits estimated to have been generated through supplying infrastructure used by Kakadu tourist, excess-payments for town-building and its contribution through the existence of the Office of the Supervising Scientist have been significant in absolute terms, but over the mine's life so far these side-benefits have not added more than five per cent to the mine's GDP contribution. 20 tabs., 3 figs

Mighty Morphin Power Ranger Play: Research and Reality.

Science.gov (United States)

Crosser, Sandra

1995-01-01

Explores the question of whether or not Mighty Morphin Power Rangers-type aggressive play is developmentally appropriate for the early childhood classroom. Compares results from research in child development to the reality of television programming, highlighting the relationship between television violence and children's aggressive behavior. (AA)

Exposure to hepatitis E virus, hepatitis A virus and Borrelia spp. infections in forest rangers from a single forest district in western Poland.

Science.gov (United States)

Bura, Maciej; Bukowska, Alicja; Michalak, Michał; Bura, Aleksandra; Nawrocki, Mariusz J; Karczewski, Marek; Mozer-Lisewska, Iwona

2018-03-13

Hepatitis E virus (HEV) infection is an emerging problem in developed countries. At least 2 zoonotic genotypes of the virus (HEV-3 and HEV-4) infect human beings. There are some data suggesting that forest rangers (FRs) can be at a higher risk of contact with HEV. The aim of this study was to assess the prevalence of HEV exposure markers in FRs from a single forest district in Greater Poland in relation to anti-HAV (hepatitis A virus) IgG, and anti-Borrelia spp. IgM and IgG antibodies. In total, 138 participants (48 FRs and 90 blood donors - BDs) were tested for anti-HEV IgM and IgG (EUROIMMUN Medizinische Labordiagnostika AG, Luebeck, Germany) and 96 individuals (48 FRs and 48 BDs) were tested for anti-HAV IgG (ARCHITECT immunoassays, Abbott Laboratories, Wiesbaden, Germany); anti-Borrelia IgM and IgG (EUROIMMUN kits) were assessed in FRs only. Anti-HEV markers were detected in 3 participants (2.2%; IgM in 1 FR, IgG in 2 BDs), less frequently than anti-HAV (16 out of 96 individuals, about 17%; FRs 19% vs BDs 15%) or anti-Borrelia antibodies (18 out of 48 individuals, 37.5%) (p < 0.0001 for both). Older study participants (≥45 years of age) were more frequently HAV-seropositive (29% vs 4% of the younger individuals; p = 0.0012). We failed to unequivocally prove HEV exposure in FRs. The HAV seroprevalence in this study paralleled the situation in the general population. Exposure to Borrelia spp. in FRs was common.

Fundamental Parallel Algorithms for Private-Cache Chip Multiprocessors

DEFF Research Database (Denmark)

Arge, Lars Allan; Goodrich, Michael T.; Nelson, Michael

2008-01-01

about the way cores are interconnected, for we assume that all inter-processor communication occurs through the memory hierarchy. We study several fundamental problems, including prefix sums, selection, and sorting, which often form the building blocks of other parallel algorithms. Indeed, we present...... two sorting algorithms, a distribution sort and a mergesort. Our algorithms are asymptotically optimal in terms of parallel cache accesses and space complexity under reasonable assumptions about the relationships between the number of processors, the size of memory, and the size of cache blocks....... In addition, we study sorting lower bounds in a computational model, which we call the parallel external-memory (PEM) model, that formalizes the essential properties of our algorithms for private-cache CMPs....

The Ranger and Nabarlek mining agreements

International Nuclear Information System (INIS)

Gray, W.J.

1980-01-01

This article contains information about the content of the agreements which have been entered into between the Australian Government and the Northern Land Council in relation to the Ranger deposits in the Northern Territory and between the Government and Queensland Mines Limited and the N.L.C. in relation to the Nabarlek deposit. A statement by the Minister for Aboriginal Affairs on the impact of uranium mining on Northern Territory Aboriginals is included

The Ranger project - a case study

International Nuclear Information System (INIS)

Young, R.I.

1983-01-01

Ranger Uranium Mines Pty. Ltd. operates an open pit mine and ore treatment plant in the Northern Territory designed to produce 3000 tonne/yr of U 3 O 8 from 3500 tonne/day of mill feed. The construction of the project was completed in 1981. Wright-Davy were the project managers and designers of the $270 million ore treatment plant and associated infrastructure. Details of project cost, staffing, project design and project systems are given

A Scalable proxy cache for Grid Data Access

International Nuclear Information System (INIS)

Cristian Cirstea, Traian; Just Keijser, Jan; Arthur Koeroo, Oscar; Starink, Ronald; Alan Templon, Jeffrey

2012-01-01

We describe a prototype grid proxy cache system developed at Nikhef, motivated by a desire to construct the first building block of a future https-based Content Delivery Network for grid infrastructures. Two goals drove the project: firstly to provide a “native view” of the grid for desktop-type users, and secondly to improve performance for physics-analysis type use cases, where multiple passes are made over the same set of data (residing on the grid). We further constrained the design by requiring that the system should be made of standard components wherever possible. The prototype that emerged from this exercise is a horizontally-scalable, cooperating system of web server / cache nodes, fronted by a customized webDAV server. The webDAV server is custom only in the sense that it supports http redirects (providing horizontal scaling) and that the authentication module has, as back end, a proxy delegation chain that can be used by the cache nodes to retrieve files from the grid. The prototype was deployed at Nikhef and tested at a scale of several terabytes of data and approximately one hundred fast cores of computing. Both small and large files were tested, in a number of scenarios, and with various numbers of cache nodes, in order to understand the scaling properties of the system. For properly-dimensioned cache-node hardware, the system showed speedup of several integer factors for the analysis-type use cases. These results and others are presented and discussed.

Evidence for cache surveillance by a scatter-hoarding rodent

NARCIS (Netherlands)

Hirsch, B.T.; Kays, R.; Jansen, P.A.

2013-01-01

The mechanisms by which food-hoarding animals are capable of remembering the locations of numerous cached food items over long time spans has been the focus of intensive research. The ‘memory enhancement hypothesis’ states that hoarders reinforce spatial memory of their caches by repeatedly

A high level implementation and performance evaluation of level-I asynchronous cache on FPGA

Directory of Open Access Journals (Sweden)

Mansi Jhamb

2017-07-01

Full Text Available To bridge the ever-increasing performance gap between the processor and the main memory in a cost-effective manner, novel cache designs and implementations are indispensable. Cache is responsible for a major part of energy consumption (approx. 50% of processors. This paper presents a high level implementation of a micropipelined asynchronous architecture of L1 cache. Due to the fact that each cache memory implementation is time consuming and error-prone process, a synthesizable and a configurable model proves out to be of immense help as it aids in generating a range of caches in a reproducible and quick fashion. The micropipelined cache, implemented using C-Elements acts as a distributed message-passing system. The RTL cache model implemented in this paper, comprising of data and instruction caches has a wide array of configurable parameters. In addition to timing robustness our implementation has high average cache throughput and low latency. The implemented architecture comprises of two direct-mapped, write-through caches for data and instruction. The architecture is implemented in a Field Programmable Gate Array (FPGA chip using Very High Speed Integrated Circuit Hardware Description Language (VHSIC HDL along with advanced synthesis and place-and-route tools.

Analisis Algoritma Pergantian Cache Pada Proxy Web Server Internet Dengan Simulasi

OpenAIRE

Nurwarsito, Heru

2007-01-01

Pertumbuhan jumlah client internet dari waktu ke waktu terus bertambah, maka respon akses internet menjadi semakin lambat. Untuk membantu kecepatan akses tersebut maka diperlukan cache pada Proxy Server. Penelitian ini bertujuan untuk menganalisis performansi Proxy Server pada Jaringan Internet terhadap penggunaan algoritma pergantian cache-nya.Analisis Algoritma Pergantian Cache Pada Proxy Server didesain dengan metoda pemodelan simulasi jaringan internet yang terdiri dari Web server, Proxy ...

Nature as a treasure map! Teaching geoscience with the help of earth caches?!

Science.gov (United States)

Zecha, Stefanie; Schiller, Thomas

2015-04-01

This presentation looks at how earth caches are influence the learning process in the field of geo science in non-formal education. The development of mobile technologies using Global Positioning System (GPS) data to point geographical location together with the evolving Web 2.0 supporting the creation and consumption of content, suggest a potential for collaborative informal learning linked to location. With the help of the GIS in smartphones you can go directly in nature, search for information by your smartphone, and learn something about nature. Earth caches are a very good opportunity, which are organized and supervised geocaches with special information about physical geography high lights. Interested people can inform themselves about aspects in geoscience area by earth caches. The main question of this presentation is how these caches are created in relation to learning processes. As is not possible, to analyze all existing earth caches, there was focus on Bavaria and a certain feature of earth caches. At the end the authors show limits and potentials for the use of earth caches and give some remark for the future.

76 FR 17105 - Sitka Resource Advisory Committee

Science.gov (United States)

2011-03-28

... to Lisa Hirsch, Sitka Ranger District, 204 Siginaka Way, Sitka, Alaska 99835. Comments may also be... FURTHER INFORMATION CONTACT: Lisa Hirsch, RAC coordinator, USDA, Tongass NF, Sitka Ranger District, 204...

A Novel Architecture of Metadata Management System Based on Intelligent Cache

Institute of Scientific and Technical Information of China (English)

SONG Baoyan; ZHAO Hongwei; WANG Yan; GAO Nan; XU Jin

2006-01-01

This paper introduces a novel architecture of metadata management system based on intelligent cache called Metadata Intelligent Cache Controller (MICC). By using an intelligent cache to control the metadata system, MICC can deal with different scenarios such as splitting and merging of queries into sub-queries for available metadata sets in local, in order to reduce access time of remote queries. Application can find results patially from local cache and the remaining portion of the metadata that can be fetched from remote locations. Using the existing metadata, it can not only enhance the fault tolerance and load balancing of system effectively, but also improve the efficiency of access while ensuring the access quality.

Organizing the pantry: cache management improves quality of overwinter food stores in a montane mammal

Science.gov (United States)

Jakopak, Rhiannon P.; Hall, L. Embere; Chalfoun, Anna D.

2017-01-01

Many mammals create food stores to enhance overwinter survival in seasonal environments. Strategic arrangement of food within caches may facilitate the physical integrity of the cache or improve access to high-quality food to ensure that cached resources meet future nutritional demands. We used the American pika (Ochotona princeps), a food-caching lagomorph, to evaluate variation in haypile (cache) structure (i.e., horizontal layering by plant functional group) in Wyoming, United States. Fifty-five percent of 62 haypiles contained at least 2 discrete layers of vegetation. Adults and juveniles layered haypiles in similar proportions. The probability of layering increased with haypile volume, but not haypile number per individual or nearby forage diversity. Vegetation cached in layered haypiles was also higher in nitrogen compared to vegetation in unlayered piles. We found that American pikas frequently structured their food caches, structured caches were larger, and the cached vegetation in structured piles was of higher nutritional quality. Improving access to stable, high-quality vegetation in haypiles, a critical overwinter food resource, may allow individuals to better persist amidst harsh conditions.

Tier 3 batch system data locality via managed caches

Science.gov (United States)

Fischer, Max; Giffels, Manuel; Jung, Christopher; Kühn, Eileen; Quast, Günter

2015-05-01

Modern data processing increasingly relies on data locality for performance and scalability, whereas the common HEP approaches aim for uniform resource pools with minimal locality, recently even across site boundaries. To combine advantages of both, the High- Performance Data Analysis (HPDA) Tier 3 concept opportunistically establishes data locality via coordinated caches. In accordance with HEP Tier 3 activities, the design incorporates two major assumptions: First, only a fraction of data is accessed regularly and thus the deciding factor for overall throughput. Second, data access may fallback to non-local, making permanent local data availability an inefficient resource usage strategy. Based on this, the HPDA design generically extends available storage hierarchies into the batch system. Using the batch system itself for scheduling file locality, an array of independent caches on the worker nodes is dynamically populated with high-profile data. Cache state information is exposed to the batch system both for managing caches and scheduling jobs. As a result, users directly work with a regular, adequately sized storage system. However, their automated batch processes are presented with local replications of data whenever possible.

Cache Oblivious Distribution Sweeping

DEFF Research Database (Denmark)

Brodal, G.S.; Fagerberg, R.

2002-01-01

We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorith...

The radiological impact of the Ranger Uranium Mine on the general public in Jabiru

International Nuclear Information System (INIS)

Kavasnicka, Jiri

1992-01-01

Potential alpha energy concentrations (PAEC) of radon daughters were monitored by a Kodak LR 115 nuclear track detector both outdoors and indoors in Jabiru (a township 9 km west of the Ranger Uranium Mine) at five locations between Ranger and Jabiru during the 1989 Dry Season. The average outdoor PAEC and the indoor PAEC in private dwellings in Jabiru were 2.4 ± 0.2 mWL and 2.4 ± 0.7 mWL respectively. Though the total radon emission from the Ranger Uranium Mine (RUM) project is relatively high (about 7 MBq s -1 ) the mining and milling of uranium contributes only marginally to the PAEC in Jabiru as can be seen from results of the air dispersion modelling and environmental radon daughter monitoring carried out in parallel with the indoor monitoring in Jabiru. The description of the radon daughter monitor and the major characteristics of the RUM project are given in the Appendixes. The average annual PAEC in Jabiru attributable t the mining and milling operations at Ranger was calculated to be about 0.16 mWL, which corresponds to an effective dose equivalent of 0.07 mSv y -1 (7% of the 1 mSv y -1 public limit) for members of the public in Jabiru. 17 refs., 3 tab., 7 figs

77 FR 26733 - Uinta-Wasatch-Cache National Forest; Evanston-Mountain View Ranger District; Utah; Smiths Fork...

Science.gov (United States)

2012-05-07

... process or judicial review. Comments received in response to this solicitation, including names and... respondent with standing to participate in the objection process associated with this project under the HFRA or judicial review. FOR FURTHER INFORMATION CONTACT: Pete Gomben, Environmental Coordinator, at 801...

Do Clark's nutcrackers demonstrate what-where-when memory on a cache-recovery task?

Science.gov (United States)

Gould, Kristy L; Ort, Amy J; Kamil, Alan C

2012-01-01

What-where-when (WWW) memory during cache recovery was investigated in six Clark's nutcrackers. During caching, both red- and blue-colored pine seeds were cached by the birds in holes filled with sand. Either a short (3 day) retention interval (RI) or a long (9 day) RI was followed by a recovery session during which caches were replaced with either a single seed or wooden bead depending upon the color of the cache and length of the retention interval. Knowledge of what was in the cache (seed or bead), where it was located, and when the cache had been made (3 or 9 days ago) were the three WWW memory components under investigation. Birds recovered items (bead or seed) at above chance levels, demonstrating accurate spatial memory. They also recovered seeds more than beads after the long RI, but not after the short RI, when they recovered seeds and beads equally often. The differential recovery after the long RI demonstrates that nutcrackers may have the capacity for WWW memory during this task, but it is not clear why it was influenced by RI duration.

Efficacy of Code Optimization on Cache-Based Processors

Science.gov (United States)

VanderWijngaart, Rob F.; Saphir, William C.; Chancellor, Marisa K. (Technical Monitor)

1997-01-01

In this paper a number of techniques for improving the cache performance of a representative piece of numerical software is presented. Target machines are popular processors from several vendors: MIPS R5000 (SGI Indy), MIPS R8000 (SGI PowerChallenge), MIPS R10000 (SGI Origin), DEC Alpha EV4 + EV5 (Cray T3D & T3E), IBM RS6000 (SP Wide-node), Intel PentiumPro (Ames' Whitney), Sun UltraSparc (NERSC's NOW). The optimizations all attempt to increase the locality of memory accesses. But they meet with rather varied and often counterintuitive success on the different computing platforms. We conclude that it may be genuinely impossible to obtain portable performance on the current generation of cache-based machines. At the least, it appears that the performance of modern commodity processors cannot be described with parameters defining the cache alone.

Cache Aided Decode-and-Forward Relaying Networks: From the Spatial View

Directory of Open Access Journals (Sweden)

Junjuan Xia

2018-01-01

Full Text Available We investigate cache technique from the spatial view and study its impact on the relaying networks. In particular, we consider a dual-hop relaying network, where decode-and-forward (DF relays can assist the data transmission from the source to the destination. In addition to the traditional dual-hop relaying, we also consider the cache from the spatial view, where the source can prestore the data among the memories of the nodes around the destination. For the DF relaying networks without and with cache, we study the system performance by deriving the analytical expressions of outage probability and symbol error rate (SER. We also derive the asymptotic outage probability and SER in the high regime of transmit power, from which we find the system diversity order can be rapidly increased by using cache and the system performance can be significantly improved. Simulation and numerical results are demonstrated to verify the proposed studies and find that the system power resources can be efficiently saved by using cache technique.

A Cache Considering Role-Based Access Control and Trust in Privilege Management Infrastructure

Institute of Scientific and Technical Information of China (English)

ZHANG Shaomin; WANG Baoyi; ZHOU Lihua

2006-01-01

PMI(privilege management infrastructure) is used to perform access control to resource in an E-commerce or E-government system. With the ever-increasing need for secure transaction, the need for systems that offer a wide variety of QoS (quality-of-service) features is also growing. In order to improve the QoS of PMI system, a cache based on RBAC(Role-based Access Control) and trust is proposed. Our system is realized based on Web service. How to design the cache based on RBAC and trust in the access control model is described in detail. The algorithm to query role permission in cache and to add records in cache is dealt with. The policy to update cache is introduced also.

Magpies can use local cues to retrieve their food caches.

Science.gov (United States)

Feenders, Gesa; Smulders, Tom V

2011-03-01

Much importance has been placed on the use of spatial cues by food-hoarding birds in the retrieval of their caches. In this study, we investigate whether food-hoarding birds can be trained to use local cues ("beacons") in their cache retrieval. We test magpies (Pica pica) in an active hoarding-retrieval paradigm, where local cues are always reliable, while spatial cues are not. Our results show that the birds use the local cues to retrieve their caches, even when occasionally contradicting spatial information is available. The design of our study does not allow us to test rigorously whether the birds prefer using local over spatial cues, nor to investigate the process through which they learn to use local cues. We furthermore provide evidence that magpies develop landmark preferences, which improve their retrieval accuracy. Our findings support the hypothesis that birds are flexible in their use of memory information, using a combination of the most reliable or salient information to retrieve their caches. © Springer-Verlag 2010

Constancy and cover of plants in the Petersburg and Wrangell Districts, Tongass National Forest and associated private and other public lands, southeast Alaska.

Science.gov (United States)

Bert R. Mead

2002-01-01

This study provides a comprehensive and inclusive description and inventory of the vegetation within the Stikine area of southeast Alaska. Private and other public lands were included as well as Tongass National Forest lands contained in the Petersburg and Wrangell Ranger Districts. Previous inventories have concentrated almost exclusively on tree species within forest...

Analyzing data distribution on disk pools for dCache

Energy Technology Data Exchange (ETDEWEB)

Halstenberg, S; Jung, C; Ressmann, D [Forschungszentrum Karlsruhe, Steinbuch Centre for Computing, Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen (Germany)

2010-04-01

Most Tier-1 centers of LHC Computing Grid are using dCache as their storage system. dCache uses a cost model incorporating CPU and space costs for the distribution of data on its disk pools. Storage resources at Tier-1 centers are usually upgraded once or twice a year according to given milestones. One of the effects of this procedure is the accumulation of heterogeneous hardware resources. For a dCache system, a heterogeneous set of disk pools complicates the process of weighting CPU and space costs for an efficient distribution of data. In order to evaluate the data distribution on the disk pools, the distribution is simulated in Java. The results are discussed and suggestions for improving the weight scheme are given.

Massively parallel algorithms for trace-driven cache simulations

Science.gov (United States)

Nicol, David M.; Greenberg, Albert G.; Lubachevsky, Boris D.

1991-01-01

Trace driven cache simulation is central to computer design. A trace is a very long sequence of reference lines from main memory. At the t(exp th) instant, reference x sub t is hashed into a set of cache locations, the contents of which are then compared with x sub t. If at the t sup th instant x sub t is not present in the cache, then it is said to be a miss, and is loaded into the cache set, possibly forcing the replacement of some other memory line, and making x sub t present for the (t+1) sup st instant. The problem of parallel simulation of a subtrace of N references directed to a C line cache set is considered, with the aim of determining which references are misses and related statistics. A simulation method is presented for the Least Recently Used (LRU) policy, which regradless of the set size C runs in time O(log N) using N processors on the exclusive read, exclusive write (EREW) parallel model. A simpler LRU simulation algorithm is given that runs in O(C log N) time using N/log N processors. Timings are presented of the second algorithm's implementation on the MasPar MP-1, a machine with 16384 processors. A broad class of reference based line replacement policies are considered, which includes LRU as well as the Least Frequently Used and Random replacement policies. A simulation method is presented for any such policy that on any trace of length N directed to a C line set runs in the O(C log N) time with high probability using N processors on the EREW model. The algorithms are simple, have very little space overhead, and are well suited for SIMD implementation.

Rehabilitation of the Ranger Mine Site

International Nuclear Information System (INIS)

East, J.; Uren, C.; Cull, R.; Curley, P.; Unger, C.

1989-01-01

Designs for long-lived waste rock piles in tropical Australia need to consider the climatic factors affecting erosion. Erosion trials on four plots at the Ranger waste rock dump demonstrate that some features of natural stable landforms such as slope morphogenetic variables and the size characteristics of aerial cover of resistive rock particles on the surface, can be sucessfully used in the design of the waste rock piles. Preliminary results indicate that the erosional stability of slopes can be enhanced by the use of concave surfaces. ills., diagrams

California scrub-jays reduce visual cues available to potential pilferers by matching food colour to caching substrate.

Science.gov (United States)

Kelley, Laura A; Clayton, Nicola S

2017-07-01

Some animals hide food to consume later; however, these caches are susceptible to theft by conspecifics and heterospecifics. Caching animals can use protective strategies to minimize sensory cues available to potential pilferers, such as caching in shaded areas and in quiet substrate. Background matching (where object patterning matches the visual background) is commonly seen in prey animals to reduce conspicuousness, and caching animals may also use this tactic to hide caches, for example, by hiding coloured food in a similar coloured substrate. We tested whether California scrub-jays ( Aphelocoma californica ) camouflage their food in this way by offering them caching substrates that either matched or did not match the colour of food available for caching. We also determined whether this caching behaviour was sensitive to social context by allowing the birds to cache when a conspecific potential pilferer could be both heard and seen (acoustic and visual cues present), or unseen (acoustic cues only). When caching events could be both heard and seen by a potential pilferer, birds cached randomly in matching and non-matching substrates. However, they preferentially hid food in the substrate that matched the food colour when only acoustic cues were present. This is a novel cache protection strategy that also appears to be sensitive to social context. We conclude that studies of cache protection strategies should consider the perceptual capabilities of the cacher and potential pilferers. © 2017 The Author(s).

Replication Strategy for Spatiotemporal Data Based on Distributed Caching System.

Science.gov (United States)

Xiong, Lian; Yang, Liu; Tao, Yang; Xu, Juan; Zhao, Lun

2018-01-14

The replica strategy in distributed cache can effectively reduce user access delay and improve system performance. However, developing a replica strategy suitable for varied application scenarios is still quite challenging, owing to differences in user access behavior and preferences. In this paper, a replication strategy for spatiotemporal data (RSSD) based on a distributed caching system is proposed. By taking advantage of the spatiotemporal locality and correlation of user access, RSSD mines high popularity and associated files from historical user access information, and then generates replicas and selects appropriate cache node for placement. Experimental results show that the RSSD algorithm is simple and efficient, and succeeds in significantly reducing user access delay.

Optimal Caching in Multicast 5G Networks with Opportunistic Spectrum Access

KAUST Repository

Emara, Mostafa; Elsawy, Hesham; Sorour, Sameh; Al-Ghadhban, Samir; Alouini, Mohamed-Slim; Al-Naffouri, Tareq Y.

2018-01-01

Cache-enabled small base station (SBS) densification is foreseen as a key component of 5G cellular networks. This architecture enables storing popular files at the network edge (i.e., SBS caches), which empowers local communication and alleviates

LPPS: A Distributed Cache Pushing Based K-Anonymity Location Privacy Preserving Scheme

Directory of Open Access Journals (Sweden)

Ming Chen

2016-01-01

Full Text Available Recent years have witnessed the rapid growth of location-based services (LBSs for mobile social network applications. To enable location-based services, mobile users are required to report their location information to the LBS servers and receive answers of location-based queries. Location privacy leak happens when such servers are compromised, which has been a primary concern for information security. To address this issue, we propose the Location Privacy Preservation Scheme (LPPS based on distributed cache pushing. Unlike existing solutions, LPPS deploys distributed cache proxies to cover users mostly visited locations and proactively push cache content to mobile users, which can reduce the risk of leaking users’ location information. The proposed LPPS includes three major process. First, we propose an algorithm to find the optimal deployment of proxies to cover popular locations. Second, we present cache strategies for location-based queries based on the Markov chain model and propose update and replacement strategies for cache content maintenance. Third, we introduce a privacy protection scheme which is proved to achieve k-anonymity guarantee for location-based services. Extensive experiments illustrate that the proposed LPPS achieves decent service coverage ratio and cache hit ratio with lower communication overhead compared to existing solutions.

Enabling MPEG-2 video playback in embedded systems through improved data cache efficiency

Science.gov (United States)

Soderquist, Peter; Leeser, Miriam E.

1999-01-01

Digital video decoding, enabled by the MPEG-2 Video standard, is an important future application for embedded systems, particularly PDAs and other information appliances. Many such system require portability and wireless communication capabilities, and thus face severe limitations in size and power consumption. This places a premium on integration and efficiency, and favors software solutions for video functionality over specialized hardware. The processors in most embedded system currently lack the computational power needed to perform video decoding, but a related and equally important problem is the required data bandwidth, and the need to cost-effectively insure adequate data supply. MPEG data sets are very large, and generate significant amounts of excess memory traffic for standard data caches, up to 100 times the amount required for decoding. Meanwhile, cost and power limitations restrict cache sizes in embedded systems. Some systems, including many media processors, eliminate caches in favor of memories under direct, painstaking software control in the manner of digital signal processors. Yet MPEG data has locality which caches can exploit if properly optimized, providing fast, flexible, and automatic data supply. We propose a set of enhancements which target the specific needs of the heterogeneous types within the MPEG decoder working set. These optimizations significantly improve the efficiency of small caches, reducing cache-memory traffic by almost 70 percent, and can make an enhanced 4 KB cache perform better than a standard 1 MB cache. This performance improvement can enable high-resolution, full frame rate video playback in cheaper, smaller system than woudl otherwise be possible.

The Optimization of In-Memory Space Partitioning Trees for Cache Utilization

Science.gov (United States)

Yeo, Myung Ho; Min, Young Soo; Bok, Kyoung Soo; Yoo, Jae Soo

In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.

Proposal and development of a reconfigurable associativity algorithm in cache memories.

OpenAIRE

Roberto Borges Kerr Junior

2008-01-01

A evolução constante dos processadores está aumentando cada vez o overhead dos acessos à memória. Tentando evitar este problema, os desenvolvedores de processadores utilizam diversas técnicas, entre elas, o emprego de memórias cache na hierarquia de memórias dos computadores. As memórias cache, por outro lado, não conseguem suprir totalmente as suas necessidades, sendo interessante alguma técnica que tornasse possível aproveitar melhor a memória cache. Para resolver este problema, autores pro...

Worst-case execution time analysis-driven object cache design

DEFF Research Database (Denmark)

Huber, Benedikt; Puffitsch, Wolfgang; Schoeberl, Martin

2012-01-01

result in a WCET analysis‐friendly design. Aiming for a time‐predictable design, we therefore propose to employ WCET analysis techniques for the design space exploration of processor architectures. We evaluated different object cache configurations using static analysis techniques. The number of field......Hard real‐time systems need a time‐predictable computing platform to enable static worst‐case execution time (WCET) analysis. All performance‐enhancing features need to be WCET analyzable. However, standard data caches containing heap‐allocated data are very hard to analyze statically....... In this paper we explore a new object cache design, which is driven by the capabilities of static WCET analysis. Simulations of standard benchmarks estimating the expected average case performance usually drive computer architecture design. The design decisions derived from this methodology do not necessarily...

Caching at the Mobile Edge: a Practical Implementation

DEFF Research Database (Denmark)

Poderys, Justas; Artuso, Matteo; Lensbøl, Claus Michael Oest

2018-01-01

Thanks to recent advances in mobile networks, it is becoming increasingly popular to access heterogeneous content from mobile terminals. There are, however, unique challenges in mobile networks that affect the perceived quality of experience (QoE) at the user end. One such challenge is the higher...... latency that users typically experience in mobile networks compared to wired ones. Cloud-based radio access networks with content caches at the base stations are seen as a key contributor in reducing the latency required to access content and thus improve the QoE at the mobile user terminal. In this paper...... for the mobile user obtained by caching content at the base stations. This is quantified with a comparison to non-cached content by means of ping tests (10–11% shorter times), a higher response rate for web traffic (1.73–3.6 times higher), and an improvement in the jitter (6% reduction)....

Ranger project starts-up amid doubts and optimism

International Nuclear Information System (INIS)

Gomez, B.

1982-01-01

After two and a half years construction and commissioning, the Ranger uranium project was officially opened on November 20, 1981. It was later closed for four days in connection with possible breaches of environmental regulations owing to the appearance of islands in the tailings dam. Contracts currently held represent a production commitment slightly in excess of the design capacity of the plant for the next decade

EqualChance: Addressing Intra-set Write Variation to Increase Lifetime of Non-volatile Caches

Energy Technology Data Exchange (ETDEWEB)

Mittal, Sparsh [ORNL; Vetter, Jeffrey S [ORNL

2014-01-01

To address the limitations of SRAM such as high-leakage and low-density, researchers have explored use of non-volatile memory (NVM) devices, such as ReRAM (resistive RAM) and STT-RAM (spin transfer torque RAM) for designing on-chip caches. A crucial limitation of NVMs, however, is that their write endurance is low and the large intra-set write variation introduced by existing cache management policies may further exacerbate this problem, thereby reducing the cache lifetime significantly. We present EqualChance, a technique to increase cache lifetime by reducing intra-set write variation. EqualChance works by periodically changing the physical cache-block location of a write-intensive data item within a set to achieve wear-leveling. Simulations using workloads from SPEC CPU2006 suite and HPC (high-performance computing) field show that EqualChance improves the cache lifetime by 4.29X. Also, its implementation overhead is small, and it incurs very small performance and energy loss.

High Precision Ranging and Range-Rate Measurements over Free-Space-Laser Communication Link

Science.gov (United States)

Yang, Guangning; Lu, Wei; Krainak, Michael; Sun, Xiaoli

2016-01-01

We present a high-precision ranging and range-rate measurement system via an optical-ranging or combined ranging-communication link. A complete bench-top optical communication system was built. It included a ground terminal and a space terminal. Ranging and range rate tests were conducted in two configurations. In the communication configuration with 622 data rate, we achieved a two-way range-rate error of 2 microns/s, or a modified Allan deviation of 9 x 10 (exp -15) with 10 second averaging time. Ranging and range-rate as a function of Bit Error Rate of the communication link is reported. They are not sensitive to the link error rate. In the single-frequency amplitude modulation mode, we report a two-way range rate error of 0.8 microns/s, or a modified Allan deviation of 2.6 x 10 (exp -15) with 10 second averaging time. We identified the major noise sources in the current system as the transmitter modulation injected noise and receiver electronics generated noise. A new improved system will be constructed to further improve the system performance for both operating modes.

ARC Cache: A solution for lightweight Grid sites in ATLAS

CERN Document Server

Garonne, Vincent; The ATLAS collaboration

2016-01-01

Many Grid sites have the need to reduce operational manpower, and running a storage element consumes a large amount of effort. In addition, setting up a new Grid site including a storage element involves a steep learning curve and large investment of time. For these reasons so-called storage-less sites are becoming more popular as a way to provide Grid computing resources with less operational overhead. ARC CE is a widely-used and mature Grid middleware which was designed from the start to be used on sites with no persistent storage element. Instead, it maintains a local self-managing cache of data which retains popular data for future jobs. As the cache is simply an area on a local posix shared filesystem with no external-facing service, it requires no extra maintenance. The cache can be scaled up as required by increasing the size of the filesystem or adding new filesystems. This paper describes how ARC CE and its cache are an ideal solution for lightweight Grid sites in the ATLAS experiment, and the integr...

Cache-Conscious Radix-Decluster Projections

NARCIS (Netherlands)

S. Manegold (Stefan); P.A. Boncz (Peter); N.J. Nes (Niels); M.L. Kersten (Martin)

2004-01-01

textabstractAs CPUs become more powerful with Moore's law and memory latencies stay constant, the impact of the memory access performance bottleneck continues to grow on relational operators like join, which can exhibit random access on a memory region larger than the hardware caches. While

Cooperative Coding and Caching for Streaming Data in Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Liu Jiangchuan

2010-01-01

Full Text Available This paper studies the distributed caching managements for the current flourish of the streaming applications in multihop wireless networks. Many caching managements to date use randomized network coding approach, which provides an elegant solution for ubiquitous data accesses in such systems. However, the encoding, essentially a combination operation, makes the coded data difficult to be changed. In particular, to accommodate new data, the system may have to first decode all the combined data segments, remove some unimportant ones, and then reencode the data segments again. This procedure is clearly expensive for continuously evolving data storage. As such, we introduce a novel Cooperative Coding and Caching ( scheme, which allows decoding-free data removal through a triangle-like codeword organization. Its decoding performance is very close to the conventional network coding with only a sublinear overhead. Our scheme offers a promising solution to the caching management for streaming data.

dCache data storage system implementations at a Tier-2 centre

Energy Technology Data Exchange (ETDEWEB)

Tsigenov, Oleg; Nowack, Andreas; Kress, Thomas [III. Physikalisches Institut B, RWTH Aachen (Germany)

2009-07-01

The experimental high energy physics groups of the RWTH Aachen University operate one of the largest Grid Tier-2 sites in the world and offer more than 2000 modern CPU cores and about 550 TB of disk space mainly to the CMS experiment and to a lesser extent to the Auger and Icecube collaborations.Running such a large data cluster requires a flexible storage system with high performance. We use dCache for this purpose and are integrated into the dCache support team to the benefit of the German Grid sites. Recently, a storage pre-production cluster has been built to study the setup and the behavior of novel dCache features within Chimera without interfering with the production system. This talk gives an overview about the practical experience gained with dCache on both the production and the testbed cluster and discusses future plans.

Replication Strategy for Spatiotemporal Data Based on Distributed Caching System

Science.gov (United States)

Xiong, Lian; Tao, Yang; Xu, Juan; Zhao, Lun

2018-01-01

The replica strategy in distributed cache can effectively reduce user access delay and improve system performance. However, developing a replica strategy suitable for varied application scenarios is still quite challenging, owing to differences in user access behavior and preferences. In this paper, a replication strategy for spatiotemporal data (RSSD) based on a distributed caching system is proposed. By taking advantage of the spatiotemporal locality and correlation of user access, RSSD mines high popularity and associated files from historical user access information, and then generates replicas and selects appropriate cache node for placement. Experimental results show that the RSSD algorithm is simple and efficient, and succeeds in significantly reducing user access delay. PMID:29342897

Energy-Efficient Caching for Mobile Edge Computing in 5G Networks

Directory of Open Access Journals (Sweden)

Zhaohui Luo

2017-05-01

Full Text Available Mobile Edge Computing (MEC, which is considered a promising and emerging paradigm to provide caching capabilities in proximity to mobile devices in 5G networks, enables fast, popular content delivery of delay-sensitive applications at the backhaul capacity of limited mobile networks. Most existing studies focus on cache allocation, mechanism design and coding design for caching. However, grid power supply with fixed power uninterruptedly in support of a MEC server (MECS is costly and even infeasible, especially when the load changes dynamically over time. In this paper, we investigate the energy consumption of the MECS problem in cellular networks. Given the average download latency constraints, we take the MECS’s energy consumption, backhaul capacities and content popularity distributions into account and formulate a joint optimization framework to minimize the energy consumption of the system. As a complicated joint optimization problem, we apply a genetic algorithm to solve it. Simulation results show that the proposed solution can effectively determine the near-optimal caching placement to obtain better performance in terms of energy efficiency gains compared with conventional caching placement strategies. In particular, it is shown that the proposed scheme can significantly reduce the joint cost when backhaul capacity is low.

Cooperative Coding and Caching for Streaming Data in Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Dan Wang

2010-01-01

Full Text Available This paper studies the distributed caching managements for the current flourish of the streaming applications in multihop wireless networks. Many caching managements to date use randomized network coding approach, which provides an elegant solution for ubiquitous data accesses in such systems. However, the encoding, essentially a combination operation, makes the coded data difficult to be changed. In particular, to accommodate new data, the system may have to first decode all the combined data segments, remove some unimportant ones, and then reencode the data segments again. This procedure is clearly expensive for continuously evolving data storage. As such, we introduce a novel Cooperative Coding and Caching (C3 scheme, which allows decoding-free data removal through a triangle-like codeword organization. Its decoding performance is very close to the conventional network coding with only a sublinear overhead. Our scheme offers a promising solution to the caching management for streaming data.

76 FR 39068 - Wrangell-Petersburg Resource Advisory Committee

Science.gov (United States)

2011-07-05

... Nolan Center in Wrangell, Alaska. Written comments may be submitted as described under Supplementary... CONTACT: Christopher Savage, Petersburg District Ranger, P.O. Box 1328, Petersburg, Alaska 99833, phone... Christopher Savage, Petersburg District Ranger, P.O. Box 1328, Petersburg, Alaska 99833, or Robert Dalrymple...

Range Riders and Game Wardens: A Brief History of Fort Bragg’s Forest Ranger Program

Science.gov (United States)

2006-07-01

Estelle Rowland and Evelyn Ellington. Infor- mal interviews were conducted with family members of former rangers, Myra Mort Hanni , Elizabeth McPherson, Dun...worked under the command of the sergeant whose family resided in the main house. As Myra Mott Hanni , daughter of 1920s ranger Sergeant John Sidney Mott...above as well as by Myra Mott Hanni who retains a photograph of her father standing next to a confiscated still. Wilson recalls finding stills on the

CACHING DATA STORED IN SQL SERVER FOR OPTIMIZING THE PERFORMANCE

Directory of Open Access Journals (Sweden)

Demian Horia

2016-12-01

Full Text Available This paper present the architecture of web site with different techniques used for optimize the performance of loading the web content. The architecture presented here is for e-commerce site developed on windows with MVC, IIS and Micosoft SQL Server. Caching the data is one technique used by the browsers, by the web servers itself or by proxy servers. Caching the data is made without the knowledge of users and need to provide to user the more recent information from the server. This means that caching mechanism has to be aware of any modification of data on the server. There are different information’s presented in e-commerce site related to products like images, code of product, description, properties or stock

Dynamic Video Streaming in Caching-enabled Wireless Mobile Networks

OpenAIRE

Liang, C.; Hu, S.

2017-01-01

Recent advances in software-defined mobile networks (SDMNs), in-network caching, and mobile edge computing (MEC) can have great effects on video services in next generation mobile networks. In this paper, we jointly consider SDMNs, in-network caching, and MEC to enhance the video service in next generation mobile networks. With the objective of maximizing the mean measurement of video quality, an optimization problem is formulated. Due to the coupling of video data rate, computing resource, a...

On the Feasibility of Prefetching and Caching for Online TV Services: A Measurement Study on Hulu

Science.gov (United States)

Krishnappa, Dilip Kumar; Khemmarat, Samamon; Gao, Lixin; Zink, Michael

Lately researchers are looking at ways to reduce the delay on video playback through mechanisms like prefetching and caching for Video-on-Demand (VoD) services. The usage of prefetching and caching also has the potential to reduce the amount of network bandwidth usage, as most popular requests are served from a local cache rather than the server containing the original content. In this paper, we investigate the advantages of having such a prefetching and caching scheme for a free hosting service of professionally created video (movies and TV shows) named "hulu". We look into the advantages of using a prefetching scheme where the most popular videos of the week, as provided by the hulu website, are prefetched and compare this approach with a conventional LRU caching scheme with limited storage space and a combined scheme of prefetching and caching. Results from our measurement and analysis shows that employing a basic caching scheme at the proxy yields a hit ratio of up to 77.69%, but requires storage of about 236GB. Further analysis shows that a prefetching scheme where the top-100 popular videos of the week are downloaded to the proxy yields a hit ratio of 44% with a storage requirement of 10GB. A LRU caching scheme with a storage limitation of 20GB can achieve a hit ratio of 55% but downloads 4713 videos to achieve such high hit ratio compared to 100 videos in prefetching scheme, whereas a scheme with both prefetching and caching with the same storage yields a hit ratio of 59% with download requirement of 4439 videos. We find that employing a scheme of prefetching along with caching with trade-off on the storage will yield a better hit ratio and bandwidth saving than individual caching or prefetching schemes.

Performance Evaluation of Moving Small-Cell Network with Proactive Cache

Directory of Open Access Journals (Sweden)

Young Min Kwon

2016-01-01

Full Text Available Due to rapid growth in mobile traffic, mobile network operators (MNOs are considering the deployment of moving small-cells (mSCs. mSC is a user-centric network which provides voice and data services during mobility. mSC can receive and forward data traffic via wireless backhaul and sidehaul links. In addition, due to the predictive nature of users demand, mSCs can proactively cache the predicted contents in off-peak-traffic periods. Due to these characteristics, MNOs consider mSCs as a cost-efficient solution to not only enhance the system capacity but also provide guaranteed quality of service (QoS requirements to moving user equipment (UE in peak-traffic periods. In this paper, we conduct extensive system level simulations to analyze the performance of mSCs with varying cache size and content popularity and their effect on wireless backhaul load. The performance evaluation confirms that the QoS of moving small-cell UE (mSUE notably improves by using mSCs together with proactive caching. We also show that the effective use of proactive cache significantly reduces the wireless backhaul load and increases the overall network capacity.

I-Structure software cache for distributed applications

Directory of Open Access Journals (Sweden)

Alfredo Cristóbal Salas

2004-01-01

Full Text Available En este artículo, describimos el caché de software I-Structure para entornos de memoria distribuida (D-ISSC, lo cual toma ventaja de la localidad de los datos mientras mantiene la capacidad de tolerancia a la latencia de sistemas de memoria I-Structure. Las facilidades de programación de los programas MPI, le ocultan los problemas de sincronización al programador. Nuestra evaluación experimental usando un conjunto de pruebas de rendimiento indica que clusters de PC con I-Structure y su mecanismo de cache D-ISSC son más robustos. El sistema puede acelerar aplicaciones de comunicación intensiva regulares e irregulares.

Content Delivery in Fog-Aided Small-Cell Systems with Offline and Online Caching: An Information—Theoretic Analysis

Directory of Open Access Journals (Sweden)

Seyyed Mohammadreza Azimi

2017-07-01

Full Text Available The storage of frequently requested multimedia content at small-cell base stations (BSs can reduce the load of macro-BSs without relying on high-speed backhaul links. In this work, the optimal operation of a system consisting of a cache-aided small-cell BS and a macro-BS is investigated for both offline and online caching settings. In particular, a binary fading one-sided interference channel is considered in which the small-cell BS, whose transmission is interfered by the macro-BS, has a limited-capacity cache. The delivery time per bit (DTB is adopted as a measure of the coding latency, that is, the duration of the transmission block, required for reliable delivery. For offline caching, assuming a static set of popular contents, the minimum achievable DTB is characterized through information-theoretic achievability and converse arguments as a function of the cache capacity and of the capacity of the backhaul link connecting cloud and small-cell BS. For online caching, under a time-varying set of popular contents, the long-term (average DTB is evaluated for both proactive and reactive caching policies. Furthermore, a converse argument is developed to characterize the minimum achievable long-term DTB for online caching in terms of the minimum achievable DTB for offline caching. The performance of both online and offline caching is finally compared using numerical results.

Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities

Science.gov (United States)

Sadeghi, Alireza; Sheikholeslami, Fatemeh; Giannakis, Georgios B.

2018-02-01

Small basestations (SBs) equipped with caching units have potential to handle the unprecedented demand growth in heterogeneous networks. Through low-rate, backhaul connections with the backbone, SBs can prefetch popular files during off-peak traffic hours, and service them to the edge at peak periods. To intelligently prefetch, each SB must learn what and when to cache, while taking into account SB memory limitations, the massive number of available contents, the unknown popularity profiles, as well as the space-time popularity dynamics of user file requests. In this work, local and global Markov processes model user requests, and a reinforcement learning (RL) framework is put forth for finding the optimal caching policy when the transition probabilities involved are unknown. Joint consideration of global and local popularity demands along with cache-refreshing costs allow for a simple, yet practical asynchronous caching approach. The novel RL-based caching relies on a Q-learning algorithm to implement the optimal policy in an online fashion, thus enabling the cache control unit at the SB to learn, track, and possibly adapt to the underlying dynamics. To endow the algorithm with scalability, a linear function approximation of the proposed Q-learning scheme is introduced, offering faster convergence as well as reduced complexity and memory requirements. Numerical tests corroborate the merits of the proposed approach in various realistic settings.

A general approach for cache-oblivious range reporting and approximate range counting

DEFF Research Database (Denmark)

Afshani, Peyman; Hamilton, Chris; Zeh, Norbert

2010-01-01

We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for constructing cache-oblivious data structures that provide relative (1+ε)-approximations for a general class of range c...

TaPT: Temperature-Aware Dynamic Cache Optimization for Embedded Systems

Directory of Open Access Journals (Sweden)

Tosiron Adegbija

2017-12-01

Full Text Available Embedded systems have stringent design constraints, which has necessitated much prior research focus on optimizing energy consumption and/or performance. Since embedded systems typically have fewer cooling options, rising temperature, and thus temperature optimization, is an emergent concern. Most embedded systems only dissipate heat by passive convection, due to the absence of dedicated thermal management hardware mechanisms. The embedded system’s temperature not only affects the system’s reliability, but can also affect the performance, power, and cost. Thus, embedded systems require efficient thermal management techniques. However, thermal management can conflict with other optimization objectives, such as execution time and energy consumption. In this paper, we focus on managing the temperature using a synergy of cache optimization and dynamic frequency scaling, while also optimizing the execution time and energy consumption. This paper provides new insights on the impact of cache parameters on efficient temperature-aware cache tuning heuristics. In addition, we present temperature-aware phase-based tuning, TaPT, which determines Pareto optimal clock frequency and cache configurations for fine-grained execution time, energy, and temperature tradeoffs. TaPT enables autonomous system optimization and also allows designers to specify temperature constraints and optimization priorities. Experiments show that TaPT can effectively reduce execution time, energy, and temperature, while imposing minimal hardware overhead.

Web Cache Prefetching as an Aspect: Towards a Dynamic-Weaving Based Solution

DEFF Research Database (Denmark)

Segura-Devillechaise, Marc; Menaud, Jean-Marc; Muller, Gilles

2003-01-01

Given the high proportion of HTTP traffic in the Internet, Web caches are crucial to reduce user access time, network latency, and bandwidth consumption. Prefetching in a Web cache can further enhance these benefits. For the best performance, however, the prefetching policy must match user and Web...

Cache aware mapping of streaming apllications on a multiprocessor system-on-chip

NARCIS (Netherlands)

Moonen, A.J.M.; Bekooij, M.J.G.; Berg, van den R.M.J.; Meerbergen, van J.; Sciuto, D.; Peng, Z.

2008-01-01

Efficient use of the memory hierarchy is critical for achieving high performance in a multiprocessor system- on-chip. An external memory that is shared between processors is a bottleneck in current and future systems. Cache misses and a large cache miss penalty contribute to a low processor

Expansion of the ore treatment plant at Ranger Uranium Mines at Jabiru, NT Australia

International Nuclear Information System (INIS)

Nice, R.W.; Banaczkowski, M.

2000-01-01

The Ranger Uranium Mine commenced processing ore in 1980. The original plant designed by the joint venture between Davy and Wright Engineers had been designed to treat 1.3 Mtpa of ore to produce 3500 tpa of U 3 O 8 concentrates. The plant operated successfully through good and bad years until the 1995 when the owners of Energy Resources of Australia, North Ltd. (70%) decided that there was a market opening to allow expansion of the treatment plant such that it would produce 6000 tpa of concentrate.The desire to produce more concentrates was market driven but the change from the mine Ranger 1 to a new pit Ranger 3 also necessitated the inclusion of the ability to treat more ore. This involved the installation of more grinding and CCD washing capacity. There were some other changes that were to be included into the expansion to overcome operating deficiencies, reduce operating costs and to generally make the operation easier.The Australian engineering company, Kvaerner Davy, was commissioned to provide the EPCM services to the clients, North and the Ranger Operation Group. North Technical Services managed the Project with considerable input from the site operating and maintenance personnel. The site operating personnel commissioned the plant and are successfully operating it at the time of the preparation of this paper. The first part of this paper presents the basic process related activities required to provide the expanded facilities. This includes the flowsheet modifications, equipment changes and new equipment procured. Additionally, a discussion is given regarding the P and ID changes, the piping modifications and the means to install the expanded facilities with a minimum of interruption to the continuing plant operation. A second part of the paper details some of the experiences gained while constructing the expansion and commissioning and operating the expanded plant. (author)

Fast and Cache-Oblivious Dynamic Programming with Local Dependencies

DEFF Research Database (Denmark)

Bille, Philip; Stöckel, Morten

2012-01-01

are widely used in bioinformatics to compare DNA and protein sequences. These problems can all be solved using essentially the same dynamic programming scheme over a two-dimensional matrix, where each entry depends locally on at most 3 neighboring entries. We present a simple, fast, and cache......-oblivious algorithm for this type of local dynamic programming suitable for comparing large-scale strings. Our algorithm outperforms the previous state-of-the-art solutions. Surprisingly, our new simple algorithm is competitive with a complicated, optimized, and tuned implementation of the best cache-aware algorithm...

Cache and energy efficient algorithms for Nussinov's RNA Folding.

Science.gov (United States)

Zhao, Chunchun; Sahni, Sartaj

2017-12-06

An RNA folding/RNA secondary structure prediction algorithm determines the non-nested/pseudoknot-free structure by maximizing the number of complementary base pairs and minimizing the energy. Several implementations of Nussinov's classical RNA folding algorithm have been proposed. Our focus is to obtain run time and energy efficiency by reducing the number of cache misses. Three cache-efficient algorithms, ByRow, ByRowSegment and ByBox, for Nussinov's RNA folding are developed. Using a simple LRU cache model, we show that the Classical algorithm of Nussinov has the highest number of cache misses followed by the algorithms Transpose (Li et al.), ByRow, ByRowSegment, and ByBox (in this order). Extensive experiments conducted on four computational platforms-Xeon E5, AMD Athlon 64 X2, Intel I7 and PowerPC A2-using two programming languages-C and Java-show that our cache efficient algorithms are also efficient in terms of run time and energy. Our benchmarking shows that, depending on the computational platform and programming language, either ByRow or ByBox give best run time and energy performance. The C version of these algorithms reduce run time by as much as 97.2% and energy consumption by as much as 88.8% relative to Classical and by as much as 56.3% and 57.8% relative to Transpose. The Java versions reduce run time by as much as 98.3% relative to Classical and by as much as 75.2% relative to Transpose. Transpose achieves run time and energy efficiency at the expense of memory as it takes twice the memory required by Classical. The memory required by ByRow, ByRowSegment, and ByBox is the same as that of Classical. As a result, using the same amount of memory, the algorithms proposed by us can solve problems up to 40% larger than those solvable by Transpose.

75 FR 21583 - Wrangell-Petersburg Resource Advisory Committee

Science.gov (United States)

2010-04-26

... from 9 a.m. to 2 p.m. ADDRESSES: The meeting will be held at the James and Elsie Nolan Center in Wrangell, Alaska. Written comments should be sent to Christopher Savage, Petersburg District Ranger, P.O... CONTACT: Christopher Savage, Petersburg District Ranger, P.O. Box 1328, Petersburg, Alaska 99833, phone...

Chemical data and statistical interpretations for rocks and ores from the Ranger uranium mine, Northern Territory, Australia

Science.gov (United States)

Nash, J. Thomas; Frishman, David

1983-01-01

Analytical results for 61 elements in 370 samples from the Ranger Mine area are reported. Most of the rocks come from drill core in the Ranger No. 1 and Ranger No. 3 deposits, but 20 samples are from unmineralized drill core more than 1 km from ore. Statistical tests show that the elements Mg, Fe, F, Be, Co, Li, Ni, Pb, Sc, Th, Ti, V, CI, As, Br, Au, Ce, Dy, La Sc, Eu, Tb, Yb, and Tb have positive association with uranium, and Si, Ca, Na, K, Sr, Ba, Ce, and Cs have negative association. For most lithologic subsets Mg, Fe, Li, Cr, Ni, Pb, V, Y, Sm, Sc, Eu, and Yb are significantly enriched in ore-bearing rocks, whereas Ca, Na, K, Sr, Ba, Mn, Ce, and Cs are significantly depleted. These results are consistent with petrographic observations on altered rocks. Lithogeochemistry can aid exploration, but for these rocks requires methods that are expensive and not amenable to routine use.

dCache: Big Data storage for HEP communities and beyond

International Nuclear Information System (INIS)

Millar, A P; Bernardt, C; Fuhrmann, P; Mkrtchyan, T; Petersen, A; Schwank, K; Behrmann, G; Litvintsev, D; Rossi, A

2014-01-01

With over ten years in production use dCache data storage system has evolved to match ever changing lansdcape of continually evolving storage technologies with new solutions to both existing problems and new challenges. In this paper, we present three areas of innovation in dCache: providing efficient access to data with NFS v4.1 pNFS, adoption of CDMI and WebDAV as an alternative to SRM for managing data, and integration with alternative authentication mechanisms.

An assessment of the water management program proposed in the Ranger EIS and its environmental implications

International Nuclear Information System (INIS)

Davy, D.R.

1976-01-01

An assessment of the water management program proposed in the Ranger EIS has three components: a) a statement of water quality criteria and standards that the program must meet, b) a set of calculations based on the best available estimates, that compares the expected levels of waste with the standards set for the release, c) the plan of the surveillance program aimed at demonstrating compliance with these standards and at revealing deficiencies in the choice of criteria, the derivation of standards from them and unforseen departures from expectation. Standards are suggested for the operation of the Ranger mines based on the most restrictive criterion out of: (i) acute toxicity tests carried out on organisms and water from the Magela Creek combined with application factors recommended by AWRC, (ii) the results on indicator species and biological diversity indices for the Finniss river, (iii) requirements for agricultural and pastoral use, (iv) the requirements for portable water. It is expected that the program proposed by Ranger will meet these standards and it is concluded that planning for a comprehensive environmental program is adequate. (author)

Using shadow page cache to improve isolated drivers performance.

Science.gov (United States)

Zheng, Hao; Dong, Xiaoshe; Wang, Endong; Chen, Baoke; Zhu, Zhengdong; Liu, Chengzhe

2015-01-01

With the advantage of the reusability property of the virtualization technology, users can reuse various types and versions of existing operating systems and drivers in a virtual machine, so as to customize their application environment. In order to prevent users' virtualization environments being impacted by driver faults in virtual machine, Chariot examines the correctness of driver's write operations by the method of combining a driver's write operation capture and a driver's private access control table. However, this method needs to keep the write permission of shadow page table as read-only, so as to capture isolated driver's write operations through page faults, which adversely affect the performance of the driver. Based on delaying setting frequently used shadow pages' write permissions to read-only, this paper proposes an algorithm using shadow page cache to improve the performance of isolated drivers and carefully study the relationship between the performance of drivers and the size of shadow page cache. Experimental results show that, through the shadow page cache, the performance of isolated drivers can be greatly improved without impacting Chariot's reliability too much.

Lack of caching of direct-seeded Douglas fir seeds by deer mice

International Nuclear Information System (INIS)

Sullivan, T.P.

1978-01-01

Seed caching by deer mice was investigated by radiotagging seeds in forest and clear-cut areas in coastal British Columbia. Deer mice tend to cache very few Douglas fir seeds in the fall when the seed is uniformly distributed and is at densities comparable with those used in direct-seeding programs. (author)

The application of image processing in the measurement for three-light-axis parallelity of laser ranger

Science.gov (United States)

Wang, Yang; Wang, Qianqian

2008-12-01

When laser ranger is transported or used in field operations, the transmitting axis, receiving axis and aiming axis may be not parallel. The nonparallelism of the three-light-axis will affect the range-measuring ability or make laser ranger not be operated exactly. So testing and adjusting the three-light-axis parallelity in the production and maintenance of laser ranger is important to ensure using laser ranger reliably. The paper proposes a new measurement method using digital image processing based on the comparison of some common measurement methods for the three-light-axis parallelity. It uses large aperture off-axis paraboloid reflector to get the images of laser spot and white light cross line, and then process the images on LabVIEW platform. The center of white light cross line can be achieved by the matching arithmetic in LABVIEW DLL. And the center of laser spot can be achieved by gradation transformation, binarization and area filter in turn. The software system can set CCD, detect the off-axis paraboloid reflector, measure the parallelity of transmitting axis and aiming axis and control the attenuation device. The hardware system selects SAA7111A, a programmable vedio decoding chip, to perform A/D conversion. FIFO (first-in first-out) is selected as buffer.USB bus is used to transmit data to PC. The three-light-axis parallelity can be achieved according to the position bias between them. The device based on this method has been already used. The application proves this method has high precision, speediness and automatization.

Decision-cache based XACML authorisation and anonymisation for XML documents

OpenAIRE

Ulltveit-Moe, Nils; Oleshchuk, Vladimir A

2012-01-01

Author's version of an article in the journal: Computer Standards and Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.10.007 This paper describes a decision cache for the eXtensible Access Control Markup Language (XACML) that supports fine-grained authorisation and anonymisation of XML based messages and documents down to XML attribute and element level. The decision cache is implemented as an XACML obligation service, where a specification of the XML...

Turbidity and Total Suspended Solids on the Lower Cache River Watershed, AR.

Science.gov (United States)

Rosado-Berrios, Carlos A; Bouldin, Jennifer L

2016-06-01

The Cache River Watershed (CRW) in Arkansas is part of one of the largest remaining bottomland hardwood forests in the US. Although wetlands are known to improve water quality, the Cache River is listed as impaired due to sedimentation and turbidity. This study measured turbidity and total suspended solids (TSS) in seven sites of the lower CRW; six sites were located on the Bayou DeView tributary of the Cache River. Turbidity and TSS levels ranged from 1.21 to 896 NTU, and 0.17 to 386.33 mg/L respectively and had an increasing trend over the 3-year study. However, a decreasing trend from upstream to downstream in the Bayou DeView tributary was noted. Sediment loading calculated from high precipitation events and mean TSS values indicate that contributions from the Cache River main channel was approximately 6.6 times greater than contributions from Bayou DeView. Land use surrounding this river channel affects water quality as wetlands provide a filter for sediments in the Bayou DeView channel.

On the Performance of the Cache Coding Protocol

Directory of Open Access Journals (Sweden)

Behnaz Maboudi

2018-03-01

Full Text Available Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the cache coding protocol was proposed. This protocol only allows recoding at the relays when the relay has received enough coded packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key, allowing the system to detect and minimize the effect of pollution attacks and making the relays accountable for changes on the data. This paper analyzes the delay performance of cache coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an absorbing Markov chain and an approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that cache coding can overcome the security issues of unrestricted recoding with only a moderate decrease in system performance.

Cache-Oblivious Search Trees via Binary Trees of Small Height

DEFF Research Database (Denmark)

Brodal, G.S.; Fagerberg, R.; Jacob, R.

2002-01-01

We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds. In particular, our data structure avoids the use of weight balanced B-trees, and can be implemented as just a single array......, and range queries in worst case O(logB n + k/B) memory transfers, where k is the size of the output.The basic idea of our data structure is to maintain a dynamic binary tree of height log n+O(1) using existing methods, embed this tree in a static binary tree, which in turn is embedded in an array in a cache...... oblivious fashion, using the van Emde Boas layout of Prokop.We also investigate the practicality of cache obliviousness in the area of search trees, by providing an empirical comparison of different methods for laying out a search tree in memory....

Financing the Ranger uranium project

International Nuclear Information System (INIS)

Hodge, S.J.; Miskelly, N.

1983-01-01

Construction of the Ranger uranium project located 230 km east of Darwin in the Northern Territory commenced in January 1979. Energy Resources of Australia Ltd was incorporated in February 1980 to acquire all the rights in the project. The total cost to ERA of these rights was $407 million. In October 1980 ERA'S cash requirements were estimated to be $553 million. Overseas participants (power utilities who had agreed to purchase uranium yellowcake under contract) arranged to take up 25% of the equity capital, Peko-Wallsend Ltd and EZ Industries Ltd were allotted 30.5% each and 14% was issued to Australian residents. The loan and equity financing arrangements required the successful resolution of many complex and interlocking factors, including technical and economic feasibility, agreement with aboriginal interests, compliance with Government policies and securing of sales contracts

Consistencia de ejecución: una propuesta no cache coherente

OpenAIRE

García, Rafael B.; Ardenghi, Jorge Raúl

2005-01-01

La presencia de uno o varios niveles de memoria cache en los procesadores modernos, cuyo objetivo es reducir el tiempo efectivo de acceso a memoria, adquiere especial relevancia en un ambiente multiprocesador del tipo DSM dado el mucho mayor costo de las referencias a memoria en módulos remotos. Claramente, el protocolo de coherencia de cache debe responder al modelo de consistencia de memoria adoptado. El modelo secuencial SC, aceptado generalmente como el más natural, junto a una serie de m...

Environmental impact of the Ranger uranium mine, Alligator Rivers Region, Northern Territory, Australia

International Nuclear Information System (INIS)

Johnston, A.; Needham, S.

2002-01-01

Stringent environmental controls have been applied to the Ranger mine, in the Northern Territory of Australia, because of its location in an area of outstanding natural and cultural values. The adjacent Kakadu National Park contains a wild and extensive biodiversity, striking landscapes, ancient Aboriginal rock art and a living Aboriginal culture. A special regime of biological, radiological and chemical monitoring has been applied to protect the environment and detect even very low intensity impacts. The results from this regime demonstrate to the government and general public that the high conservation values of the national park around the mine are being properly protected. This paper describes the techniques used to measure environmental impact at Ranger, and summarizes the results of over 20 years of monitoring. The overwhelming conclusion is that a very high standard of environmental protection has been achieved. (author)

Randomized Caches Can Be Pretty Useful to Hard Real-Time Systems

Directory of Open Access Journals (Sweden)

Enrico Mezzetti

2015-03-01

Full Text Available Cache randomization per se, and its viability for probabilistic timing analysis (PTA of critical real-time systems, are receiving increasingly close attention from the scientific community and the industrial practitioners. In fact, the very notion of introducing randomness and probabilities in time-critical systems has caused strenuous debates owing to the apparent clash that this idea has with the strictly deterministic view traditionally held for those systems. A paper recently appeared in LITES (Reineke, J. (2014. Randomized Caches Considered Harmful in Hard Real-Time Systems. LITES, 1(1, 03:1-03:13. provides a critical analysis of the weaknesses and risks entailed in using randomized caches in hard real-time systems. In order to provide the interested reader with a fuller, balanced appreciation of the subject matter, a critical analysis of the benefits brought about by that innovation should be provided also. This short paper addresses that need by revisiting the array of issues addressed in the cited work, in the light of the latest advances to the relevant state of the art. Accordingly, we show that the potential benefits of randomized caches do offset their limitations, causing them to be - when used in conjunction with PTA - a serious competitor to conventional designs.

Greatly improved cache update times for conditions data with Frontier/Squid

International Nuclear Information System (INIS)

Dykstra, Dave; Lueking, Lee

2009-01-01

The CMS detector project loads copies of conditions data to over 100,000 computer cores worldwide by using a software subsystem called Frontier. This subsystem translates database queries into HTTP, looks up the results in a central database at CERN, and caches the results in an industry-standard HTTP proxy/caching server called Squid. One of the most challenging aspects of any cache system is coherency, that is, ensuring that changes made to the underlying data get propagated out to all clients in a timely manner. Recently, the Frontier system was enhanced to drastically reduce the time for changes to be propagated everywhere without heavily loading servers. The propagation time is now as low as 15 minutes for some kinds of data and no more than 60 minutes for the rest of the data. This was accomplished by taking advantage of an HTTP and Squid feature called If-Modified-Since. In order to use this feature, the Frontier server sends a Last-Modified timestamp, but since modification times are not normally tracked by Oracle databases, a PL/SQL program was developed to track the modification times of database tables. We discuss the details of this caching scheme and the obstacles overcome including database and Squid bugs.

Greatly improved cache update times for conditions data with Frontier/Squid

Energy Technology Data Exchange (ETDEWEB)

Dykstra, Dave; Lueking, Lee, E-mail: dwd@fnal.go [Computing Division, Fermilab, Batavia, IL (United States)

2010-04-01

The CMS detector project loads copies of conditions data to over 100,000 computer cores worldwide by using a software subsystem called Frontier. This subsystem translates database queries into HTTP, looks up the results in a central database at CERN, and caches the results in an industry-standard HTTP proxy/caching server called Squid. One of the most challenging aspects of any cache system is coherency, that is, ensuring that changes made to the underlying data get propagated out to all clients in a timely manner. Recently, the Frontier system was enhanced to drastically reduce the time for changes to be propagated everywhere without heavily loading servers. The propagation time is now as low as 15 minutes for some kinds of data and no more than 60 minutes for the rest of the data. This was accomplished by taking advantage of an HTTP and Squid feature called If-Modified-Since. In order to use this feature, the Frontier server sends a Last-Modified timestamp, but since modification times are not normally tracked by Oracle databases, a PL/SQL program was developed to track the modification times of database tables. We discuss the details of this caching scheme and the obstacles overcome including database and Squid bugs.

Sex, estradiol, and spatial memory in a food-caching corvid.

Science.gov (United States)

Rensel, Michelle A; Ellis, Jesse M S; Harvey, Brigit; Schlinger, Barney A

2015-09-01

Estrogens significantly impact spatial memory function in mammalian species. Songbirds express the estrogen synthetic enzyme aromatase at relatively high levels in the hippocampus and there is evidence from zebra finches that estrogens facilitate performance on spatial learning and/or memory tasks. It is unknown, however, whether estrogens influence hippocampal function in songbirds that naturally exhibit memory-intensive behaviors, such as cache recovery observed in many corvid species. To address this question, we examined the impact of estradiol on spatial memory in non-breeding Western scrub-jays, a species that routinely participates in food caching and retrieval in nature and in captivity. We also asked if there were sex differences in performance or responses to estradiol. Utilizing a combination of an aromatase inhibitor, fadrozole, with estradiol implants, we found that while overall cache recovery rates were unaffected by estradiol, several other indices of spatial memory, including searching efficiency and efficiency to retrieve the first item, were impaired in the presence of estradiol. In addition, males and females differed in some performance measures, although these differences appeared to be a consequence of the nature of the task as neither sex consistently out-performed the other. Overall, our data suggest that a sustained estradiol elevation in a food-caching bird impairs some, but not all, aspects of spatial memory on an innate behavioral task, at times in a sex-specific manner. Copyright © 2015 Elsevier Inc. All rights reserved.

Using Shadow Page Cache to Improve Isolated Drivers Performance

Directory of Open Access Journals (Sweden)

Hao Zheng

2015-01-01

Full Text Available With the advantage of the reusability property of the virtualization technology, users can reuse various types and versions of existing operating systems and drivers in a virtual machine, so as to customize their application environment. In order to prevent users’ virtualization environments being impacted by driver faults in virtual machine, Chariot examines the correctness of driver’s write operations by the method of combining a driver’s write operation capture and a driver’s private access control table. However, this method needs to keep the write permission of shadow page table as read-only, so as to capture isolated driver’s write operations through page faults, which adversely affect the performance of the driver. Based on delaying setting frequently used shadow pages’ write permissions to read-only, this paper proposes an algorithm using shadow page cache to improve the performance of isolated drivers and carefully study the relationship between the performance of drivers and the size of shadow page cache. Experimental results show that, through the shadow page cache, the performance of isolated drivers can be greatly improved without impacting Chariot’s reliability too much.

The development of caching and object permanence in Western scrub-jays (Aphelocoma californica): which emerges first?

Science.gov (United States)

Salwiczek, Lucie H; Emery, Nathan J; Schlinger, Barney; Clayton, Nicola S

2009-08-01

Recent studies on the food-caching behavior of corvids have revealed complex physical and social skills, yet little is known about the ontogeny of food caching in relation to the development of cognitive capacities. Piagetian object permanence is the understanding that objects continue to exist even when they are no longer visible. Here, the authors focus on Piagetian Stages 3 and 4, because they are hallmarks in the cognitive development of both young children and animals. Our aim is to determine in a food-caching corvid, the Western scrub-jay, whether (1) Piagetian Stage 4 competence and tentative caching (i.e., hiding an item invisibly and retrieving it without delay), emerge concomitantly or consecutively; (2) whether experiencing the reappearance of hidden objects enhances the timing of the appearance of object permanence; and (3) discuss how the development of object permanence is related to behavioral development and sensorimotor intelligence. Our findings suggest that object permanence Stage 4 emerges before tentative caching, and independent of environmental influences, but that once the birds have developed simple object-permanence, then social learning might advance the interval after which tentative caching commences. Copyright 2009 APA, all rights reserved.

Managing the Ranger uranium mine in the Alligator Rivers Region -there is much more to this business enterprise than just production

International Nuclear Information System (INIS)

Leggate, J.

1984-01-01

Environmental protection is very closely and continuously regulated at the Ranger uranium mine. Since the commencement of operations at Ranger the company has operated within these regulations and demonstrated clearly that yellowcake can be produced efficiently, economically and safely. The company also recognises that in order to ensure continuity of production, it will have to continue to operate within these strictly supervised regulations

Web proxy cache replacement strategies simulation, implementation, and performance evaluation

CERN Document Server

ElAarag, Hala; Cobb, Jake

2013-01-01

This work presents a study of cache replacement strategies designed for static web content. Proxy servers can improve performance by caching static web content such as cascading style sheets, java script source files, and large files such as images. This topic is particularly important in wireless ad hoc networks, in which mobile devices act as proxy servers for a group of other mobile devices. Opening chapters present an introduction to web requests and the characteristics of web objects, web proxy servers and Squid, and artificial neural networks. This is followed by a comprehensive review o

Language-Based Caching of Dynamically Generated HTML

DEFF Research Database (Denmark)

Brabrand, Claus; Møller, Anders; Olesen, Steffan

2002-01-01

Increasingly, HTML documents are dynamically generated by interactive Web services. To ensure that the client is presented with the newest versions of such documents it is customary to disable client caching causing a seemingly inevitable performance penalty. In the system, dynamic HTML documents...

dCache: implementing a high-end NFSv4.1 service using a Java NIO framework

CERN Multimedia

CERN. Geneva

2012-01-01

dCache is a high performance scalable storage system widely used by HEP community. In addition to set of home grown protocols we also provide industry standard access mechanisms like WebDAV and NFSv4.1. This support places dCache as a direct competitor to commercial solutions. Nevertheless conforming to a protocol is not enough; our implementations must perform comparably or even better than commercial systems. To achieve this, dCache uses two high-end IO frameworks from well know application servers: GlassFish and JBoss. This presentation describes how we implemented an rfc1831 and rfc2203 compliant ONC RPC (Sun RPC) service based on the Grizzly NIO framework, part of the GlassFish application server. This ONC RPC service is the key component of dCache’s NFSv4.1 implementation, but is independent of dCache and available for other projects. We will also show some details of dCache NFS v4.1 implementations, describe some of the Java NIO techniques used and, finally, present details of our performance e...

Planetary Sample Caching System Design Options

Science.gov (United States)

Collins, Curtis; Younse, Paulo; Backes, Paul

2009-01-01

Potential Mars Sample Return missions would aspire to collect small core and regolith samples using a rover with a sample acquisition tool and sample caching system. Samples would need to be stored in individual sealed tubes in a canister that could be transfered to a Mars ascent vehicle and returned to Earth. A sample handling, encapsulation and containerization system (SHEC) has been developed as part of an integrated system for acquiring and storing core samples for application to future potential MSR and other potential sample return missions. Requirements and design options for the SHEC system were studied and a recommended design concept developed. Two families of solutions were explored: 1)transfer of a raw sample from the tool to the SHEC subsystem and 2)transfer of a tube containing the sample to the SHEC subsystem. The recommended design utilizes sample tool bit change out as the mechanism for transferring tubes to and samples in tubes from the tool. The SHEC subsystem design, called the Bit Changeout Caching(BiCC) design, is intended for operations on a MER class rover.

New distributive web-caching technique for VOD services

Science.gov (United States)

Kim, Iksoo; Woo, Yoseop; Hwang, Taejune; Choi, Jintak; Kim, Youngjune

2002-12-01

At present, one of the most popular services through internet is on-demand services including VOD, EOD and NOD. But the main problems for on-demand service are excessive load of server and insufficiency of network resources. Therefore the service providers require a powerful expensive server and clients are faced with long end-to-end delay and network congestion problem. This paper presents a new distributive web-caching technique for fluent VOD services using distributed proxies in Head-end-Network (HNET). The HNET consists of a Switching-Agent (SA) as a control node, some Head-end Nodes (HEN) as proxies and clients connected to HEN. And each HEN is composing a LAN. Clients request VOD services to server through a HEN and SA. The SA operates the heart of HNET, all the operations using proposed distributive caching technique perform under the control of SA. This technique stores some parts of a requested video on the corresponding HENs when clients connected to each HEN request an identical video. Thus, clients access those HENs (proxies) alternatively for acquiring video streams. Eventually, this fact leads to equi-loaded proxy (HEN). We adopt the cache replacement strategy using the combination of LRU, LFU, remove streams from other HEN prior to server streams and the method of replacing the first block of video last to reduce end-to end delay.

Servidor proxy caché: comprensión y asimilación tecnológica

Directory of Open Access Journals (Sweden)

Carlos E. Gómez

2012-01-01

Full Text Available Los proveedores de acceso a Internet usualmente incluyen el concepto de aceleradores de Internet para reducir el tiempo promedio que tarda un navegador en obtener los archivos solicitados. Para los administradores del sistema es difícil elegir la configuración del servidor proxy caché, ya que es necesario decidir los valores que se deben usar en diferentes variables. En este artículo se presenta la forma como se abordó el proceso de comprensión y asimilación tecnológica del servicio de proxy caché, un servicio de alto impacto organizacional. Además, este artículo es producto del proyecto de investigación “Análisis de configuraciones de servidores proxy caché”, en el cual se estudiaron aspectos relevantes del rendimiento de Squid como servidor proxy caché.

Secure File Allocation and Caching in Large-scale Distributed Systems

DEFF Research Database (Denmark)

Di Mauro, Alessio; Mei, Alessandro; Jajodia, Sushil

2012-01-01

In this paper, we present a file allocation and caching scheme that guarantees high assurance, availability, and load balancing in a large-scale distributed file system that can support dynamic updates of authorization policies. The scheme uses fragmentation and replication to store files with hi......-balancing, and reducing delay of read operations. The system offers a trade-off-between performance and security that is dynamically tunable according to the current level of threat. We validate our mechanisms with extensive simulations in an Internet-like network.......In this paper, we present a file allocation and caching scheme that guarantees high assurance, availability, and load balancing in a large-scale distributed file system that can support dynamic updates of authorization policies. The scheme uses fragmentation and replication to store files with high...... security requirements in a system composed of a majority of low-security servers. We develop mechanisms to fragment files, to allocate them into multiple servers, and to cache them as close as possible to their readers while preserving the security requirement of the files, providing load...

Optical RAM-enabled cache memory and optical routing for chip multiprocessors: technologies and architectures

Science.gov (United States)

Pleros, Nikos; Maniotis, Pavlos; Alexoudi, Theonitsa; Fitsios, Dimitris; Vagionas, Christos; Papaioannou, Sotiris; Vyrsokinos, K.; Kanellos, George T.

2014-03-01

The processor-memory performance gap, commonly referred to as "Memory Wall" problem, owes to the speed mismatch between processor and electronic RAM clock frequencies, forcing current Chip Multiprocessor (CMP) configurations to consume more than 50% of the chip real-estate for caching purposes. In this article, we present our recent work spanning from Si-based integrated optical RAM cell architectures up to complete optical cache memory architectures for Chip Multiprocessor configurations. Moreover, we discuss on e/o router subsystems with up to Tb/s routing capacity for cache interconnection purposes within CMP configurations, currently pursued within the FP7 PhoxTrot project.

Minimizing cache misses in an event-driven network server: A case study of TUX

DEFF Research Database (Denmark)

Bhatia, Sapan; Consel, Charles; Lawall, Julia Laetitia

2006-01-01

We analyze the performance of CPU-bound network servers and demonstrate experimentally that the degradation in the performance of these servers under high-concurrency workloads is largely due to inefficient use of the hardware caches. We then describe an approach to speeding up event-driven network...... servers by optimizing their use of the L2 CPU cache in the context of the TUX Web server, known for its robustness to heavy load. Our approach is based on a novel cache-aware memory allocator and a specific scheduling strategy that together ensure that the total working data set of the server stays...

Applying Data Mining Techniques to Improve Information Security in the Cloud: A Single Cache System Approach

Directory of Open Access Journals (Sweden)

Amany AlShawi

2016-01-01

Full Text Available Presently, the popularity of cloud computing is gradually increasing day by day. The purpose of this research was to enhance the security of the cloud using techniques such as data mining with specific reference to the single cache system. From the findings of the research, it was observed that the security in the cloud could be enhanced with the single cache system. For future purposes, an Apriori algorithm can be applied to the single cache system. This can be applied by all cloud providers, vendors, data distributors, and others. Further, data objects entered into the single cache system can be extended into 12 components. Database and SPSS modelers can be used to implement the same.

Management of Ranger uranium mine waters, Kakadu Region, Northern Territory, Australia

International Nuclear Information System (INIS)

Hallenstein, C.; Bastias, J.

1988-01-01

The objectives, development and operation of the Ranger Uranium Mine's water management system are discussed. The discharge standards for release of excess mine water to Magela Creek are described and mine water quality data presented. It can be confidently concluded that controlled release will not cause detriment to the aquatic ecosystems of the Kakadu region. 4 refs., 1 fig., 3 tabs

Delivery Time Minimization in Edge Caching: Synergistic Benefits of Subspace Alignment and Zero Forcing

KAUST Repository

Kakar, Jaber

2017-10-29

An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as additional storage resources in the form of caches to reduce file delivery latency. To investigate this aspect, we study the fundamental limits of a cache-aided wireless network consisting of one central base station, $M$ transceivers and $K$ receivers from a latency-centric perspective. We use the normalized delivery time (NDT) to capture the per-bit latency for the worst-case file request pattern at high signal-to-noise ratios (SNR), normalized with respect to a reference interference-free system with unlimited transceiver cache capabilities. For various special cases with $M=\\\\{1,2\\\\}$ and $K=\\\\{1,2,3\\\\}$ that satisfy $M+K\\\\leq 4$, we establish the optimal tradeoff between cache storage and latency. This is facilitated through establishing a novel converse (for arbitrary $M$ and $K$) and an achievability scheme on the NDT. Our achievability scheme is a synergistic combination of multicasting, zero-forcing beamforming and interference alignment.

Evict on write, a management strategy for a prefetch unit and/or first level cache in a multiprocessor system with speculative execution

Science.gov (United States)

Gara, Alan; Ohmacht, Martin

2014-09-16

In a multiprocessor system with at least two levels of cache, a speculative thread may run on a core processor in parallel with other threads. When the thread seeks to do a write to main memory, this access is to be written through the first level cache to the second level cache. After the write though, the corresponding line is deleted from the first level cache and/or prefetch unit, so that any further accesses to the same location in main memory have to be retrieved from the second level cache. The second level cache keeps track of multiple versions of data, where more than one speculative thread is running in parallel, while the first level cache does not have any of the versions during speculation. A switch allows choosing between modes of operation of a speculation blind first level cache.

Using XRootD to provide caches for CernVM-FS

CERN Document Server

Domenighini, Matteo

2017-01-01

CernVM-FS recently added the possibility of using plugin for cache management. In order to investigate the capabilities and limits of such possibility, an XRootD plugin was written and benchmarked; as a byproduct, a POSIX plugin was also generated. The tests revealed that the plugin interface introduces no signicant performance over- head; moreover, the XRootD plugin performance was discovered to be worse than the ones of the built-in cache manager and the POSIX plugin. Further test of the XRootD component revealed that its per- formance is dependent on the server disk speed.

Application of best practicable technology to water management at Ranger Uranium mine: report of the technical working group

International Nuclear Information System (INIS)

1986-12-01

An assessment is made of best practicable technology (BPT) as applied to the water management system of Ranger Uranium Mines for the period 1986-91. A specification of BPT cannot be made for the indefinite future because major changes in operation of the mine may occur which could have an impact on future water management. It is for these reasons that the period of detailed assessment has been limited to the next 5 years. For the purposes of the report, BPT is considered to be that technology relevant to the Ranger project which produced the minimum environmental pollution and degradation that can reasonably be achieved, having regard to a number of technical factors, including practice in uranium mining elsewhere in the world, cost, evidence of detriment or lack of it, project location and the age and effectiveness of equipment and facilities at Ranger. Three options are presented, in order of preference: no prohibition on release to Magela Creek, limitation on frequency of release to Magela Creek and prohibition on release to Magela Creek

Cache Timing Analysis of eStream Finalists

DEFF Research Database (Denmark)

Zenner, Erik

2009-01-01

Cache Timing Attacks have attracted a lot of cryptographic attention due to their relevance for the AES. However, their applicability to other cryptographic primitives is less well researched. In this talk, we give an overview over our analysis of the stream ciphers that were selected for phase 3...

A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications

OpenAIRE

Wang, Shuo; Zhang, Xing; Zhang, Yan; Wang, Lin; Yang, Juwo; Wang, Wenbo

2017-01-01

As the explosive growth of smart devices and the advent of many new applications, traffic volume has been growing exponentially. The traditional centralized network architecture cannot accommodate such user demands due to heavy burden on the backhaul links and long latency. Therefore, new architectures which bring network functions and contents to the network edge are proposed, i.e., mobile edge computing and caching. Mobile edge networks provide cloud computing and caching capabilities at th...

Cache Timing Analysis of LFSR-based Stream Ciphers

DEFF Research Database (Denmark)

Zenner, Erik; Leander, Gregor; Hawkes, Philip

2009-01-01

Cache timing attacks are a class of side-channel attacks that is applicable against certain software implementations. They have generated significant interest when demonstrated against the Advanced Encryption Standard (AES), but have more recently also been applied against other cryptographic...

Applying Data Mining Techniques to Improve Information Security in the Cloud: A Single Cache System Approach

OpenAIRE

Amany AlShawi

2016-01-01

Presently, the popularity of cloud computing is gradually increasing day by day. The purpose of this research was to enhance the security of the cloud using techniques such as data mining with specific reference to the single cache system. From the findings of the research, it was observed that the security in the cloud could be enhanced with the single cache system. For future purposes, an Apriori algorithm can be applied to the single cache system. This can be applied by all cloud providers...

Architectural Development and Performance Analysis of a Primary Data Cache with Read Miss Address Prediction Capability

National Research Council Canada - National Science Library

Christensen, Kathryn

1998-01-01

.... The Predictive Read Cache (PRC) further improves the overall memory hierarchy performance by tracking the data read miss patterns of memory accesses, developing a prediction for the next access and prefetching the data into the faster cache memory...

Dynamic Allocation of SPM Based on Time-Slotted Cache Conflict Graph for System Optimization

Science.gov (United States)

Wu, Jianping; Ling, Ming; Zhang, Yang; Mei, Chen; Wang, Huan

This paper proposes a novel dynamic Scratch-pad Memory allocation strategy to optimize the energy consumption of the memory sub-system. Firstly, the whole program execution process is sliced into several time slots according to the temporal dimension; thereafter, a Time-Slotted Cache Conflict Graph (TSCCG) is introduced to model the behavior of Data Cache (D-Cache) conflicts within each time slot. Then, Integer Nonlinear Programming (INP) is implemented, which can avoid time-consuming linearization process, to select the most profitable data pages. Virtual Memory System (VMS) is adopted to remap those data pages, which will cause severe Cache conflicts within a time slot, to SPM. In order to minimize the swapping overhead of dynamic SPM allocation, a novel SPM controller with a tightly coupled DMA is introduced to issue the swapping operations without CPU's intervention. Last but not the least, this paper discusses the fluctuation of system energy profit based on different MMU page size as well as the Time Slot duration quantitatively. According to our design space exploration, the proposed method can optimize all of the data segments, including global data, heap and stack data in general, and reduce the total energy consumption by 27.28% on average, up to 55.22% with a marginal performance promotion. And comparing to the conventional static CCG (Cache Conflicts Graph), our approach can obtain 24.7% energy profit on average, up to 30.5% with a sight boost in performance.

Exploitation of pocket gophers and their food caches by grizzly bears

Science.gov (United States)

Mattson, D.J.

2004-01-01

I investigated the exploitation of pocket gophers (Thomomys talpoides) by grizzly bears (Ursus arctos horribilis) in the Yellowstone region of the United States with the use of data collected during a study of radiomarked bears in 1977-1992. My analysis focused on the importance of pocket gophers as a source of energy and nutrients, effects of weather and site features, and importance of pocket gophers to grizzly bears in the western contiguous United States prior to historical extirpations. Pocket gophers and their food caches were infrequent in grizzly bear feces, although foraging for pocket gophers accounted for about 20-25% of all grizzly bear feeding activity during April and May. Compared with roots individually excavated by bears, pocket gopher food caches were less digestible but more easily dug out. Exploitation of gopher food caches by grizzly bears was highly sensitive to site and weather conditions and peaked during and shortly after snowmelt. This peak coincided with maximum success by bears in finding pocket gopher food caches. Exploitation was most frequent and extensive on gently sloping nonforested sites with abundant spring beauty (Claytonia lanceolata) and yampah (Perdieridia gairdneri). Pocket gophers are rare in forests, and spring beauty and yampah roots are known to be important foods of both grizzly bears and burrowing rodents. Although grizzly bears commonly exploit pocket gophers only in the Yellowstone region, this behavior was probably widespread in mountainous areas of the western contiguous United States prior to extirpations of grizzly bears within the last 150 years.

Hybrid caches: design and data management

OpenAIRE

Valero Bresó, Alejandro

2013-01-01

Cache memories have been usually implemented with Static Random-Access Memory (SRAM) technology since it is the fastest electronic memory technology. However, this technology consumes a high amount of leakage currents, which is a major design concern because leakage energy consumption increases as the transistor size shrinks. Alternative technologies are being considered to reduce this consumption. Among them, embedded Dynamic RAM (eDRAM) technology provides minimal area and le...

A rainfall-based mechanism to regulate the release of water from Ranger uranium mine

International Nuclear Information System (INIS)

Carter, M.W.

1989-01-01

The far north of Australia (the Top End) has a monsoon-like climate. This wet-dry climate presents problems in water management for mining operations. These problems are exacerbated for the Ranger uranium mine at Jabiru due to the need to protect the environment of the surrounding Kakadu National Park, particularly the major wetland system downstream of the Ranger mine. An analysis of rainfall records for the wet-dry tropics of the far north of Australia is presented. A probability curve of the ratio between rainfall at a given date and rainfall at the year end, has been produced from actual data and can be used with a normalized curve to set levels of confidence of predicted rainfall being exceeded. The results of this analysis are used to develop a regulatory mechanism to limit release of waste water from a uranium mine to particularly wet years in accordance with the Australian Government's environmental protection policy. 19 refs., 11 tabs., 17 figs

Efficient Resource Scheduling by Exploiting Relay Cache for Cellular Networks

Directory of Open Access Journals (Sweden)

Chun He

2015-01-01

Full Text Available In relay-enhanced cellular systems, throughput of User Equipment (UE is constrained by the bottleneck of the two-hop link, backhaul link (or the first hop link, and access link (the second hop link. To maximize the throughput, resource allocation should be coordinated between these two hops. A common resource scheduling algorithm, Adaptive Distributed Proportional Fair, only ensures that the throughput of the first hop is greater than or equal to that of the second hop. But it cannot guarantee a good balance of the throughput and fairness between the two hops. In this paper, we propose a Two-Hop Balanced Distributed Scheduling (TBS algorithm by exploiting relay cache for non-real-time data traffic. The evolved Node Basestation (eNB adaptively adjusts the number of Resource Blocks (RBs allocated to the backhaul link and direct links based on the cache information of relays. Each relay allocates RBs for relay UEs based on the size of the relay UE’s Transport Block. We also design a relay UE’s ACK feedback mechanism to update the data at relay cache. Simulation results show that the proposed TBS can effectively improve resource utilization and achieve a good trade-off between system throughput and fairness by balancing the throughput of backhaul and access link.

Caching Over-The-Top Services, the Netflix Case

DEFF Research Database (Denmark)

Jensen, Stefan; Jensen, Michael; Gutierrez Lopez, Jose Manuel

2015-01-01

Problem (LLB-CFL). The solution search processes are implemented based on Genetic Algorithms (GA), designing genetic operators highly targeted towards this specific problem. The proposed methods are applied to a case study focusing on the demand and cache specifications of Netflix, and framed into a real...

Cache-Oblivious Planar Orthogonal Range Searching and Counting

DEFF Research Database (Denmark)

Arge, Lars; Brodal, Gerth Stølting; Fagerberg, Rolf

2005-01-01

present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for cache-oblivious planar orthogonal range searching. Our range counting structure uses O(Nlog2 N) space and answers queries using O(logB N) memory transfers, where B is the block...... size of any memory level in a multilevel memory hierarchy. Using bit manipulation techniques, the space can be further reduced to O(N). The structure can also be modified to support more general semigroup range sum queries in O(logB N) memory transfers, using O(Nlog2 N) space for three-sided queries...... and O(Nlog22 N/log2log2 N) space for four-sided queries. Based on the O(Nlog N) space range counting structure, we develop a data structure that uses O(Nlog2 N) space and answers three-sided range queries in O(logB N+T/B) memory transfers, where T is the number of reported points. Based...

An ESL Approach for Energy Consumption Analysis of Cache Memories in SoC Platforms

Directory of Open Access Journals (Sweden)

Abel G. Silva-Filho

2011-01-01

Full Text Available The design of complex circuits as SoCs presents two great challenges to designers. One is the speeding up of system functionality modeling and the second is the implementation of the system in an architecture that meets performance and power consumption requirements. Thus, developing new high-level specification mechanisms for the reduction of the design effort with automatic architecture exploration is a necessity. This paper proposes an Electronic-System-Level (ESL approach for system modeling and cache energy consumption analysis of SoCs called PCacheEnergyAnalyzer. It uses as entry a high-level UML-2.0 profile model of the system and it generates a simulation model of a multicore platform that can be analyzed for cache tuning. PCacheEnergyAnalyzer performs static/dynamic energy consumption analysis of caches on platforms that may have different processors. Architecture exploration is achieved by letting designers choose different processors for platform generation and different mechanisms for cache optimization. PCacheEnergyAnalyzer has been validated with several applications of Mibench, Mediabench, and PowerStone benchmarks, and results show that it provides analysis with reduced simulation effort.

Automated Cache Performance Analysis And Optimization

Energy Technology Data Exchange (ETDEWEB)

Mohror, Kathryn [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2013-12-23

While there is no lack of performance counter tools for coarse-grained measurement of cache activity, there is a critical lack of tools for relating data layout to cache behavior to application performance. Generally, any nontrivial optimizations are either not done at all, or are done ”by hand” requiring significant time and expertise. To the best of our knowledge no tool available to users measures the latency of memory reference instructions for partic- ular addresses and makes this information available to users in an easy-to-use and intuitive way. In this project, we worked to enable the Open|SpeedShop performance analysis tool to gather memory reference latency information for specific instructions and memory ad- dresses, and to gather and display this information in an easy-to-use and intuitive way to aid performance analysts in identifying problematic data structures in their codes. This tool was primarily designed for use in the supercomputer domain as well as grid, cluster, cloud-based parallel e-commerce, and engineering systems and middleware. Ultimately, we envision a tool to automate optimization of application cache layout and utilization in the Open|SpeedShop performance analysis tool. To commercialize this soft- ware, we worked to develop core capabilities for gathering enhanced memory usage per- formance data from applications and create and apply novel methods for automatic data structure layout optimizations, tailoring the overall approach to support existing supercom- puter and cluster programming models and constraints. In this Phase I project, we focused on infrastructure necessary to gather performance data and present it in an intuitive way to users. With the advent of enhanced Precise Event-Based Sampling (PEBS) counters on recent Intel processor architectures and equivalent technology on AMD processors, we are now in a position to access memory reference information for particular addresses. Prior to the introduction of PEBS counters

Spatiotemporal trends of illegal activities from ranger-collected data in a Ugandan national park.

Science.gov (United States)

Critchlow, R; Plumptre, A J; Driciru, M; Rwetsiba, A; Stokes, E J; Tumwesigye, C; Wanyama, F; Beale, C M

2015-10-01

Within protected areas, biodiversity loss is often a consequence of illegal resource use. Understanding the patterns and extent of illegal activities is therefore essential for effective law enforcement and prevention of biodiversity declines. We used extensive data, commonly collected by ranger patrols in many protected areas, and Bayesian hierarchical models to identify drivers, trends, and distribution of multiple illegal activities within the Queen Elizabeth Conservation Area (QECA), Uganda. Encroachment (e.g., by pastoralists with cattle) and poaching of noncommercial animals (e.g., snaring bushmeat) were the most prevalent illegal activities within the QECA. Illegal activities occurred in different areas of the QECA. Poaching of noncommercial animals was most widely distributed within the national park. Overall, ecological covariates, although significant, were not useful predictors for occurrence of illegal activities. Instead, the location of illegal activities in previous years was more important. There were significant increases in encroachment and noncommercial plant harvesting (nontimber products) during the study period (1999-2012). We also found significant spatiotemporal variation in the occurrence of all activities. Our results show the need to explicitly model ranger patrol effort to reduce biases from existing uncorrected or capture per unit effort analyses. Prioritization of ranger patrol strategies is needed to target illegal activities; these strategies are determined by protected area managers, and therefore changes at a site-level can be implemented quickly. These strategies should also be informed by the location of past occurrences of illegal activity: the most useful predictor of future events. However, because spatial and temporal changes in illegal activities occurred, regular patrols throughout the protected area, even in areas of low occurrence, are also required. © 2015 Society for Conservation Biology.

75 FR 63434 - Kootenai National Forest, Lincoln County, Montana; Grizzly Vegetation and Transportation...

Science.gov (United States)

2010-10-15

... Troy, Montana. The Notice of Availability of the Draft EIS for this project was published in the... analysis is Cami Winslow, Acting District Ranger, Three Rivers Ranger District, 12385 U.S. Hwy 2, Troy, MT... northeast of Troy, Montana, within all or portions of T34N, R32W-R33W, T35N, R32W-R33W, and T36N, R32W-R33W...

77 FR 21722 - Gore Creek Restoration Project; Intent To Prepare an Environmental Impact Statement

Science.gov (United States)

2012-04-11

... District Ranger, P.O. Box 7, Yampa, Colorado 80483 or email comments to comments-rocky-mountain-medicine... causing adverse impacts to stream networks within the project boundary. Proposed Action The Yampa Ranger..., road decommissioning, new road construction, and dispersed campsite decommissioning along streams...

Occupational health and safety inspection of the Ranger Uranium Mine

International Nuclear Information System (INIS)

Rosen, R.

1987-04-01

The principal purpose of the inspection was to assess all aspects of occupational health and safety at the Ranger Uranium Mine. A major objective was to identify actual and potential hazards under normal and abnormal conditions, particularly in relation to those topics about which the unions had expressed some concern. An assessment was made of current safety policies, procedures and practices at the site; and, as far as practicable, those tasks which involved risks to workers were identified. The results and recommendations of the inspection are contained in this report

Hydrology of Ranger land application area

International Nuclear Information System (INIS)

McQuade, C.V.

1992-01-01

In 1984 Ranger Uranium Mines (RUM) began assessing the technique of water treatment by land application as a means of reducing the volume of stored water within the Restricted Release Zone. Knowledge of the hydrological characteristics of the treatment site is necessary for optimal day to day and season to season operation of the system and as an input into the assessment of the long-term viability of the site. This paper provides background information on the hydrological requirements for a water treatment site, describes the RUM's water treatment by land application system and summarises the operational statistics and current hydrological knowledge of the site. The general groundwater hydrology of the area comprises a surface soil aquifer overlying a semi-confined aquifer. Drainage of the surface aquifer follows the surface topography along the sandy clays. Vertical permeability ranges between 3 and 12 times greater than horizontal permeability. 7 refs., 2 tabs., 4 figs

Memory for multiple cache locations and prey quantities in a food-hoarding songbird

Directory of Open Access Journals (Sweden)

Nicola eArmstrong

2012-12-01

Full Text Available Most animals can discriminate between pairs of numbers that are each less than four without training. However, North Island robins (Petroica longipes, a food hoarding songbird endemic to New Zealand, can discriminate between quantities of items as high as eight without training. Here we investigate whether robins are capable of other complex quantity discrimination tasks. We test whether their ability to discriminate between small quantities declines with 1. the number of cache sites containing prey rewards and 2. the length of time separating cache creation and retrieval (retention interval. Results showed that subjects generally performed above chance expectations. They were equally able to discriminate between different combinations of prey quantities that were hidden from view in 2, 3 and 4 cache sites from between 1, 10 and 60 seconds. Overall results indicate that North Island robins can process complex quantity information involving more than two discrete quantities of items for up to one minute long retention intervals without training.

Instant Varnish Cache how-to

CERN Document Server

Moutinho, Roberto

2013-01-01

Filled with practical, step-by-step instructions and clear explanations for the most important and useful tasks. Get the job done and learn as you go. Easy-to-follow, step-by-step recipes which will get you started with Varnish Cache. Practical examples will help you to get set up quickly and easily.This book is aimed at system administrators and web developers who need to scale websites without tossing money on a large and costly infrastructure. It's assumed that you have some knowledge of the HTTP protocol, how browsers and server communicate with each other, and basic Linux systems.

Tannin concentration enhances seed caching by scatter-hoarding rodents: An experiment using artificial ‘seeds’

Science.gov (United States)

Wang, Bo; Chen, Jin

2008-11-01

Tannins are very common among plant seeds but their effects on the fate of seeds, for example, via mediation of the feeding preferences of scatter-hoarding rodents, are poorly understood. In this study, we created a series of artificial 'seeds' that only differed in tannin concentration and the type of tannin, and placed them in a pine forest in the Shangri-La Alpine Botanical Garden, Yunnan Province of China. Two rodent species ( Apodemus latronum and A. chevrieri) showed significant preferences for 'seeds' with different tannin concentrations. A significantly higher proportion of seeds with low tannin concentration were consumed in situ compared with seeds with a higher tannin concentration. Meanwhile, the tannin concentration was significantly positively correlated with the proportion of seeds cached. The different types of tannin (hydrolysable tannin vs condensed tannin) did not differ significantly in their effect on the proportion of seeds eaten in situ vs seeds cached. Tannin concentrations had no significant effect on the distance that cached seeds were carried, which suggests that rodents may respond to different seed traits in deciding whether or not to cache seeds and how far they will transport seeds.

CACHE: an extended BASIC program which computes the performance of shell and tube heat exchangers

International Nuclear Information System (INIS)

Tallackson, J.R.

1976-03-01

An extended BASIC program, CACHE, has been written to calculate steady state heat exchange rates in the core auxiliary heat exchangers, (CAHE), designed to remove afterheat from High-Temperature Gas-Cooled Reactors (HTGR). Computationally, these are unbaffled counterflow shell and tube heat exchangers. The computational method is straightforward. The exchanger is subdivided into a user-selected number of lengthwise segments; heat exchange in each segment is calculated in sequence and summed. The program takes the temperature dependencies of all thermal conductivities, viscosities and heat capacities into account providing these are expressed algebraically. CACHE is easily adapted to compute steady state heat exchange rates in any unbaffled counterflow exchanger. As now used, CACHE calculates heat removal by liquid weight from high-temperature helium and helium mixed with nitrogen, oxygen and carbon monoxide. A second program, FULTN, is described. FULTN computes the geometrical parameters required as input to CACHE. As reported herein, FULTN computes the internal dimensions of the Fulton Station CAHE. The two programs are chained to operate as one. Complete user information is supplied. The basic equations, variable lists, annotated program lists, and sample outputs with explanatory notes are included

The Potential Role of Cache Mechanism for Complicated Design Optimization

International Nuclear Information System (INIS)

Noriyasu, Hirokawa; Fujita, Kikuo

2002-01-01

This paper discusses the potential role of cache mechanism for complicated design optimization While design optimization is an application of mathematical programming techniques to engineering design problems over numerical computation, its progress has been coevolutionary. The trend in such progress indicates that more complicated applications become the next target of design optimization beyond growth of computational resources. As the progress in the past two decades had required response surface techniques, decomposition techniques, etc., any new framework must be introduced for the future of design optimization methods. This paper proposes a possibility of what we call cache mechanism for mediating the coming challenge and briefly demonstrates some promises in the idea of Voronoi diagram based cumulative approximation as an example of its implementation, development of strict robust design, extension of design optimization for product variety

76 FR 52930 - Availability of Decisions

Science.gov (United States)

2011-08-24

... Forest Supervisor Decisions Laramie Daily Boomerang, published daily in Laramie, Albany County, Wyoming. District Ranger Decisions Laramie District: Laramie Daily Boomerang, published daily in Laramie, Albany...

5G Network Communication, Caching, and Computing Algorithms Based on the Two‐Tier Game Model

Directory of Open Access Journals (Sweden)

Sungwook Kim

2018-02-01

Full Text Available In this study, we developed hybrid control algorithms in smart base stations (SBSs along with devised communication, caching, and computing techniques. In the proposed scheme, SBSs are equipped with computing power and data storage to collectively offload the computation from mobile user equipment and to cache the data from clouds. To combine in a refined manner the communication, caching, and computing algorithms, game theory is adopted to characterize competitive and cooperative interactions. The main contribution of our proposed scheme is to illuminate the ultimate synergy behind a fully integrated approach, while providing excellent adaptability and flexibility to satisfy the different performance requirements. Simulation results demonstrate that the proposed approach can outperform existing schemes by approximately 5% to 15% in terms of bandwidth utilization, access delay, and system throughput.

Implementació d'una Cache per a un processador MIPS d'una FPGA

OpenAIRE

Riera Villanueva, Marc

2013-01-01

[CATALÀ] Primer s'explicarà breument l'arquitectura d'un MIPS, la jerarquia de memòria i el funcionament de la cache. Posteriorment s'explicarà com s'ha dissenyat i implementat una jerarquia de memòria per a un MIPS implementat en VHDL en una FPGA. [ANGLÈS] First, the MIPS architecture, memory hierarchy and the functioning of the cache will be explained briefly. Then, the design and implementation of a memory hierarchy for a MIPS processor implemented in VHDL on an FPGA will be explained....

A Software Managed Stack Cache for Real-Time Systems

DEFF Research Database (Denmark)

Jordan, Alexander; Abbaspourseyedi, Sahar; Schoeberl, Martin

2016-01-01

In a real-time system, the use of a scratchpad memory can mitigate the difficulties related to analyzing data caches, whose behavior is inherently hard to predict. We propose to use a scratchpad memory for stack allocated data. While statically allocating stack frames for individual functions...

Achieving cost/performance balance ratio using tiered storage caching techniques: A case study with CephFS

Science.gov (United States)

Poat, M. D.; Lauret, J.

2017-10-01

As demand for widely accessible storage capacity increases and usage is on the rise, steady IO performance is desired but tends to suffer within multi-user environments. Typical deployments use standard hard drives as the cost per/GB is quite low. On the other hand, HDD based solutions for storage is not known to scale well with process concurrency and soon enough, high rate of IOPs create a “random access” pattern killing performance. Though not all SSDs are alike, SSDs are an established technology often used to address this exact “random access” problem. In this contribution, we will first discuss the IO performance of many different SSD drives (tested in a comparable and standalone manner). We will then be discussing the performance and integrity of at least three low-level disk caching techniques (Flashcache, dm-cache, and bcache) including individual policies, procedures, and IO performance. Furthermore, the STAR online computing infrastructure currently hosts a POSIX-compliant Ceph distributed storage cluster - while caching is not a native feature of CephFS (only exists in the Ceph Object store), we will show how one can implement a caching mechanism profiting from an implementation at a lower level. As our illustration, we will present our CephFS setup, IO performance tests, and overall experience from such configuration. We hope this work will service the community’s interest for using disk-caching mechanisms with applicable uses such as distributed storage systems and seeking an overall IO performance gain.

Robust Pose Estimation using the SwissRanger SR-3000 Camera

DEFF Research Database (Denmark)

Gudmundsson, Sigurjon Arni; Larsen, Rasmus; Ersbøll, Bjarne Kjær

2007-01-01

In this paper a robust method is presented to classify and estimate an objects pose from a real time range image and a low dimensional model. The model is made from a range image training set which is reduced dimensionally by a nonlinear manifold learning method named Local Linear Embedding (LLE)......). New range images are then projected to this model giving the low dimensional coordinates of the object pose in an efficient manner. The range images are acquired by a state of the art SwissRanger SR-3000 camera making the projection process work in real-time....

Storageless and caching Tier-2 models in the UK context

Science.gov (United States)

Cadellin Skipsey, Samuel; Dewhurst, Alastair; Crooks, David; MacMahon, Ewan; Roy, Gareth; Smith, Oliver; Mohammed, Kashif; Brew, Chris; Britton, David

2017-10-01

Operational and other pressures have lead to WLCG experiments moving increasingly to a stratified model for Tier-2 resources, where “fat” Tier-2s (“T2Ds”) and “thin” Tier-2s (“T2Cs”) provide different levels of service. In the UK, this distinction is also encouraged by the terms of the current GridPP5 funding model. In anticipation of this, testing has been performed on the implications, and potential implementation, of such a distinction in our resources. In particular, this presentation presents the results of testing of storage T2Cs, where the “thin” nature is expressed by the site having either no local data storage, or only a thin caching layer; data is streamed or copied from a “nearby” T2D when needed by jobs. In OSG, this model has been adopted successfully for CMS AAA sites; but the network topology and capacity in the USA is significantly different to that in the UK (and much of Europe). We present the result of several operational tests: the in-production University College London (UCL) site, which runs ATLAS workloads using storage at the Queen Mary University of London (QMUL) site; the Oxford site, which has had scaling tests performed against T2Ds in various locations in the UK (to test network effects); and the Durham site, which has been testing the specific ATLAS caching solution of “Rucio Cache” integration with ARC’s caching layer.

Optimal Replacement Policies for Non-Uniform Cache Objects with Optional Eviction

National Research Council Canada - National Science Library

Bahat, Omri; Makowski, Armand M

2002-01-01

.... However, since the introduction of optimal replacement policies for conventional caching, the problem of finding optimal replacement policies under the factors indicated has not been studied in any systematic manner...

Effective caching of shortest paths for location-based services

DEFF Research Database (Denmark)

Jensen, Christian S.; Thomsen, Jeppe Rishede; Yiu, Man Lung

2012-01-01

Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo...

75 FR 21577 - Rogue River-Siskiyou National Forest, Powers Ranger District, Coos County, OR; Eden Ridge Timber...

Science.gov (United States)

2010-04-26

... Plan, page C-39). Specifically for the Eden Ridge Timber Sales project, Needs include: Improvement of... District, Coos County, OR; Eden Ridge Timber Sales AGENCY: Forest Service, USDA. ACTION: Notice of intent... Forest's Probable Sale Quantity. The planning area is located approximately four (4) air miles southeast...

77 FR 2508 - Rogue River-Siskiyou National Forest, Powers Ranger District, Coos County, OR; Eden Ridge Timber...

Science.gov (United States)

2012-01-18

... Plan, page C-39). Specifically for the Eden Ridge Timber Sales project, Needs include: Improvement of... District, Coos County, OR; Eden Ridge Timber Sales AGENCY: Forest Service, USDA. ACTION: Corrected Notice of Intent to prepare an environmental impact statement for the Eden Ridge Timber Sales. The original...

Electron-Muon Ranger: performance in the MICE Muon Beam

CERN Document Server

Adams, D.; Vankova-Kirilova, G.; Bertoni, R.; Bonesini, M.; Chignoli, F.; Mazza, R.; Palladino, V.; de Bari, A.; Cecchet, G.; Capponi, M.; Iaciofano, A.; Orestano, D.; Pastore, F.; Tortora, L.; Kuno, Y.; Sakamoto, H.; Ishimoto, S.; Filthaut, F.; Hansen, O.M.; Ramberger, S.; Vretenar, M.; Asfandiyarov, R.; Bene, P.; Blondel, A.; Cadoux, F.; Debieux, S.; Drielsma, F.; Graulich, J.S.; Husi, C.; Karadzhov, Y.; Masciocchi, F.; Nicola, L.; Messomo, E.Noah; Rothenfusser, K.; Sandstrom, R.; Wisting, H.; Charnley, G.; Collomb, N.; Gallagher, A.; Grant, A.; Griffiths, S.; Hartnett, T.; Martlew, B.; Moss, A.; Muir, A.; Mullacrane, I.; Oates, A.; Owens, P.; Stokes, G.; Warburton, P.; White, C.; Adams, D.; Barclay, P.; Bayliss, V.; Bradshaw, T.W.; Courthold, M.; Francis, V.; Fry, L.; Hayler, T.; Hills, M.; Lintern, A.; Macwaters, C.; Nichols, A.; Preece, R.; Ricciardi, S.; Rogers, C.; Stanley, T.; Tarrant, J.; Watson, S.; Wilson, A.; Bayes, R.; Nugent, J.C.; Soler, F.J.P.; Cooke, P.; Gamet, R.; Alekou, A.; Apollonio, M.; Barber, G.; Colling, D.; Dobbs, A.; Dornan, P.; Hunt, C.; Lagrange, J-B.; Long, K.; Martyniak, J.; Middleton, S.; Pasternak, J.; Santos, E.; Savidge, T.; Uchida, M.A.; Blackmore, V.J.; Carlisle, T.; Cobb, J.H.; Lau, W.; Rayner, M.A.; Tunnell, C.D.; Booth, C.N.; Hodgson, P.; Langlands, J.; Nicholson, R.; Overton, E.; Robinson, M.; Smith, P.J.; Dick, A.; Ronald, K.; Speirs, D.; Whyte, C.G.; Young, A.; Boyd, S.; Franchini, P.; Greis, J.; Pidcott, C.; Taylor, I.; Gardener, R.; Kyberd, P.; Littlefield, M.; Nebrensky, J.J.; Bross, A.D.; Fitzpatrick, T.; Leonova, M.; Moretti, A.; Neuffer, D.; Popovic, M.; Rubinov, P.; Rucinski, R.; Roberts, T.J.; Bowring, D.; DeMello, A.; Gourlay, S.; Li, D.; Prestemon, S.; Virostek, S.; Zisman, M.; Hanlet, P.; Kafka, G.; Kaplan, D.M.; Rajaram, D.; Snopok, P.; Torun, Y.; Blot, S.; Kim, Y.K.; Bravar, U.; Onel, Y.; Cremaldi, L.M.; Hart, T.L.; Luo, T.; Sanders, D.A.; Summers, D.J.; Cline, D.; Yang, X.; Coney, L.; Hanson, G.G.; Heidt, C.

2015-12-16

The Muon Ionization Cooling Experiment (MICE) will perform a detailed study of ionization cooling to evaluate the feasibility of the technique. To carry out this program, MICE requires an efficient particle-identification (PID) system to identify muons. The Electron-Muon Ranger (EMR) is a fully-active tracking-calorimeter that forms part of the PID system and tags muons that traverse the cooling channel without decaying. The detector is capable of identifying electrons with an efficiency of 98.6%, providing a purity for the MICE beam that exceeds 99.8%. The EMR also proved to be a powerful tool for the reconstruction of muon momenta in the range 100-280 MeV/$c$.

Electron-muon ranger: performance in the MICE muon beam

International Nuclear Information System (INIS)

Adams, D.; Barclay, P.; Bayliss, V.; Bradshaw, T.W.; Alekou, A.; Apollonio, M.; Barber, G.; Asfandiyarov, R.; Bene, P.; Blondel, A.; De Bari, A.; Bayes, R.; Bertoni, R.; Bonesini, M.; Blackmore, V.J.; Blot, S.; Bogomilov, M.; Booth, C.N.; Bowring, D.; Boyd, S.

2015-01-01

The Muon Ionization Cooling Experiment (MICE) will perform a detailed study of ionization cooling to evaluate the feasibility of the technique. To carry out this program, MICE requires an efficient particle-identification (PID) system to identify muons. The Electron-Muon Ranger (EMR) is a fully-active tracking-calorimeter that forms part of the PID system and tags muons that traverse the cooling channel without decaying. The detector is capable of identifying electrons with an efficiency of 98.6%, providing a purity for the MICE beam that exceeds 99.8%. The EMR also proved to be a powerful tool for the reconstruction of muon momenta in the range 100–280 MeV/c

Water management at Ranger Uranium Mine

International Nuclear Information System (INIS)

Carron, K.J.

1989-01-01

The water management system at the Ranger Uranium Mine is described. Any water that may have come into contact with material containing more than 0.02% uranium must be retained within the Restricted Release zone (RRZ) from which no water may be released except under specified conditions and with the written approval of the Northern Territory supervising authority. The RRS contains the tailings dam, the mine pit and retention ponds 2 and 3. Outside the RR2, retention ponds 1 and 4 act as silt traps, allowing sediment to settle out prior to water discharge. The Office of Supervising Scientist has developed receiving waters quality standards for Magela Creek which are given in a table. There have now been established sufficient regulatory criteria to allow the release of waste water directly to Magela Creek without compromising the environment. Consideration of releases has been confined to the comparatively good quality run-off waters in the RRZ and no release of the more contaminated process and tailings water stream is contemplated

Study on data acquisition system based on reconfigurable cache technology

Science.gov (United States)

Zhang, Qinchuan; Li, Min; Jiang, Jun

2018-03-01

Waveform capture rate is one of the key features of digital acquisition systems, which represents the waveform processing capability of the system in a unit time. The higher the waveform capture rate is, the larger the chance to capture elusive events is and the more reliable the test result is. First, this paper analyzes the impact of several factors on the waveform capture rate of the system, then the novel technology based on reconfigurable cache is further proposed to optimize system architecture, and the simulation results show that the signal-to-noise ratio of signal, capacity, and structure of cache have significant effects on the waveform capture rate. Finally, the technology is demonstrated by the engineering practice, and the results show that the waveform capture rate of the system is improved substantially without significant increase of system's cost, and the technology proposed has a broad application prospect.

Cache-aware data structure model for parallelism and dynamic load balancing

International Nuclear Information System (INIS)

Sridi, Marwa

2016-01-01

This PhD thesis is dedicated to the implementation of innovative parallel methods in the framework of fast transient fluid-structure dynamics. It improves existing methods within EUROPLEXUS software, in order to optimize the shared memory parallel strategy, complementary to the original distributed memory approach, brought together into a global hybrid strategy for clusters of multi-core nodes. Starting from a sound analysis of the state of the art concerning data structuring techniques correlated to the hierarchic memory organization of current multi-processor architectures, the proposed work introduces an approach suitable for an explicit time integration (i.e. with no linear system to solve at each step). A data structure of type 'Structure of arrays' is conserved for the global data storage, providing flexibility and efficiency for current operations on kinematics fields (displacement, velocity and acceleration). On the contrary, in the particular case of elementary operations (for internal forces generic computations, as well as fluxes computations between cell faces for fluid models), particularly time consuming but localized in the program, a temporary data structure of type 'Array of structures' is used instead, to force an efficient filling of the cache memory and increase the performance of the resolution, for both serial and shared memory parallel processing. Switching from the global structure to the temporary one is based on a cell grouping strategy, following classing cache-blocking principles but handling specifically for this work neighboring data necessary to the efficient treatment of ALE fluxes for cells on the group boundaries. The proposed approach is extensively tested, from the point of views of both the computation time and the access failures into cache memory, confronting the gains obtained within the elementary operations to the potential overhead generated by the data structure switch. Obtained results are very satisfactory, especially

Enhancement web proxy cache performance using Wrapper Feature Selection methods with NB and J48

Science.gov (United States)

Mahmoud Al-Qudah, Dua'a.; Funke Olanrewaju, Rashidah; Wong Azman, Amelia

2017-11-01

Web proxy cache technique reduces response time by storing a copy of pages between client and server sides. If requested pages are cached in the proxy, there is no need to access the server. Due to the limited size and excessive cost of cache compared to the other storages, cache replacement algorithm is used to determine evict page when the cache is full. On the other hand, the conventional algorithms for replacement such as Least Recently Use (LRU), First in First Out (FIFO), Least Frequently Use (LFU), Randomized Policy etc. may discard important pages just before use. Furthermore, using conventional algorithm cannot be well optimized since it requires some decision to intelligently evict a page before replacement. Hence, most researchers propose an integration among intelligent classifiers and replacement algorithm to improves replacement algorithms performance. This research proposes using automated wrapper feature selection methods to choose the best subset of features that are relevant and influence classifiers prediction accuracy. The result present that using wrapper feature selection methods namely: Best First (BFS), Incremental Wrapper subset selection(IWSS)embedded NB and particle swarm optimization(PSO)reduce number of features and have a good impact on reducing computation time. Using PSO enhance NB classifier accuracy by 1.1%, 0.43% and 0.22% over using NB with all features, using BFS and using IWSS embedded NB respectively. PSO rises J48 accuracy by 0.03%, 1.91 and 0.04% over using J48 classifier with all features, using IWSS-embedded NB and using BFS respectively. While using IWSS embedded NB fastest NB and J48 classifiers much more than BFS and PSO. However, it reduces computation time of NB by 0.1383 and reduce computation time of J48 by 2.998.

Fox squirrels match food assessment and cache effort to value and scarcity.

Directory of Open Access Journals (Sweden)

Mikel M Delgado

Full Text Available Scatter hoarders must allocate time to assess items for caching, and to carry and bury each cache. Such decisions should be driven by economic variables, such as the value of the individual food items, the scarcity of these items, competition for food items and risk of pilferage by conspecifics. The fox squirrel, an obligate scatter-hoarder, assesses cacheable food items using two overt movements, head flicks and paw manipulations. These behaviors allow an examination of squirrel decision processes when storing food for winter survival. We measured wild squirrels' time allocations and frequencies of assessment and investment behaviors during periods of food scarcity (summer and abundance (fall, giving the squirrels a series of 15 items (alternating five hazelnuts and five peanuts. Assessment and investment per cache increased when resource value was higher (hazelnuts or resources were scarcer (summer, but decreased as scarcity declined (end of sessions. This is the first study to show that assessment behaviors change in response to factors that indicate daily and seasonal resource abundance, and that these factors may interact in complex ways to affect food storing decisions. Food-storing tree squirrels may be a useful and important model species to understand the complex economic decisions made under natural conditions.

A quantum inspired model of radar range and range-rate measurements with applications to weak value measurements

Science.gov (United States)

Escalante, George

2017-05-01

Weak Value Measurements (WVMs) with pre- and post-selected quantum mechanical ensembles were proposed by Aharonov, Albert, and Vaidman in 1988 and have found numerous applications in both theoretical and applied physics. In the field of precision metrology, WVM techniques have been demonstrated and proven valuable as a means to shift, amplify, and detect signals and to make precise measurements of small effects in both quantum and classical systems, including: particle spin, the Spin-Hall effect of light, optical beam deflections, frequency shifts, field gradients, and many others. In principal, WVM amplification techniques are also possible in radar and could be a valuable tool for precision measurements. However, relatively limited research has been done in this area. This article presents a quantum-inspired model of radar range and range-rate measurements of arbitrary strength, including standard and pre- and post-selected measurements. The model is used to extend WVM amplification theory to radar, with the receive filter performing the post-selection role. It is shown that the description of range and range-rate measurements based on the quantum-mechanical measurement model and formalism produces the same results as the conventional approach used in radar based on signal processing and filtering of the reflected signal at the radar receiver. Numerical simulation results using simple point scatterrer configurations are presented, applying the quantum-inspired model of radar range and range-rate measurements that occur in the weak measurement regime. Potential applications and benefits of the quantum inspired approach to radar measurements are presented, including improved range and Doppler measurement resolution.

Killing and caching of an adult White-tailed deer, Odocoileus virginianus, by a single Gray Wolf, Canis lupus

Science.gov (United States)

Nelson, Michael E.

2011-01-01

A single Gray Wolf (Canis lupus) killed an adult male White-tailed Deer (Odocoileus virginianus) and cached the intact carcass in 76 cm of snow. The carcass was revisited and entirely consumed between four and seven days later. This is the first recorded observation of a Gray Wolf caching an entire adult deer.

Investigation of tailings water leak at the Ranger uranium mine. Supervising Scientist report 153

International Nuclear Information System (INIS)

2000-01-01

The purpose of this report has been to investigate and report on the leak of water from the Tailings Water Return Pipe at the Ranger uranium mine during the 1999/2000 Wet season with specific reference to: the origin of the leak and the adequacy of remediation measures taken to prevent similar occurrences in the future; the extent to which the people and the environment of Kakadu National Park have been adversely affected by the leak and the extent to which Energy Resources of Australia has complied with the reporting requirements specified in the Environmental Requirements. It describes the outcomes of the investigation and makes recommendations to address deficiencies identified in the environmental management systems at Ranger and in the supervisory and regulatory regimes applied to Ranger by the Supervising Scientist and NTDME. It has been established that the volume of water that leaked from the tailings water return pipeline was about 2000 cubic metres during the 1999/2000 Wet season. Of this, only a small fraction, about 85 cubic metres, entered the culvert which flows to thc Corridor Creek Wetlands. The remainder was collected in the tailings corridor sump and returned to the water management system. The failure of the pipeline to contain tailings water would not on itself normally have resulted in the discharge of this water to the external environment. That the leaked water did reach the external environment is due to a failure of the bunded corridor system to fully contain any spilled water. The cause of this failure was that the engineered structure between the roadway and a culvert that drains water from the nearby waste rock dump was not impermeable.The statutory monitoring program has been found to be deficient in two ways. First, other than visual inspection, it has not been designed to include monitoring locations within secondary containment systems that would indicate the failure of primary containment systems. In the present case, no statutory

Radioactive dust concentration around the Ranger uranium mine

International Nuclear Information System (INIS)

Kavasnicka, Jiri.

1988-07-01

Environmental dust sampling and wind direction/velocity monitory were carried out between July and November 1987 at five points around the Ranger Uranium Mines project near Jabiru, Northern Territory. The measured radioactive dust alpha activities in the air were used to calculate the radioactive dust source-term and develop a site-specific air dispersion model which takes the depletion of the dust plume into account. The above model was used to estimate the effective committed dose equivalent as 15 μSv/year to children in Jabiru East. This corresponds to an increase of 2.6 x 10 -4 Bq. m -3 in the annual average dust alpha activity above the natural background. The dose to the children in Jabiru is about 5 μSv/year, so that the critical group of the public is in Jabiru East. 12 refs., 11 tabs., 2 maps

A Novel Two-Tier Cooperative Caching Mechanism for the Optimization of Multi-Attribute Periodic Queries in Wireless Sensor Networks

Science.gov (United States)

Zhou, ZhangBing; Zhao, Deng; Shu, Lei; Tsang, Kim-Fung

2015-01-01

Wireless sensor networks, serving as an important interface between physical environments and computational systems, have been used extensively for supporting domain applications, where multiple-attribute sensory data are queried from the network continuously and periodically. Usually, certain sensory data may not vary significantly within a certain time duration for certain applications. In this setting, sensory data gathered at a certain time slot can be used for answering concurrent queries and may be reused for answering the forthcoming queries when the variation of these data is within a certain threshold. To address this challenge, a popularity-based cooperative caching mechanism is proposed in this article, where the popularity of sensory data is calculated according to the queries issued in recent time slots. This popularity reflects the possibility that sensory data are interested in the forthcoming queries. Generally, sensory data with the highest popularity are cached at the sink node, while sensory data that may not be interested in the forthcoming queries are cached in the head nodes of divided grid cells. Leveraging these cooperatively cached sensory data, queries are answered through composing these two-tier cached data. Experimental evaluation shows that this approach can reduce the network communication cost significantly and increase the network capability. PMID:26131665

Cache-Oblivious Red-Blue Line Segment Intersection

DEFF Research Database (Denmark)

Arge, Lars; Mølhave, Thomas; Zeh, Norbert

2008-01-01

We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plane. Our algorithm uses $O(\\frac{N}{B}\\log_{M/B}\\frac{N}{B}+T/B)$ memory transfers, where N is the total number...... of segments, M and B are the memory and block transfer sizes of any two consecutive levels of any multilevel memory hierarchy, and T is the number of intersections....

Application of a catchment evolution model to the prediction of long-term erosion on the spoil heap at Ranger uranium mine. Supervising Scientist report 132

International Nuclear Information System (INIS)

Willgoose, G.

1998-01-01

There is a need to assess the long-term stability of engineered landforms associated with the rehabilitation of Ranger Uranium Mine, Northern Territory, Australia, as it is a requirement that mill tailings must be contained for periods in excess of 1000 years. The geomorphic model, SIBERIA, is calibrated on hydrology and erosion data collected by a combination of monitoring and rainfall simulation experiments on the waste rock dumps of Ranger. Preliminary analysis of Ranger's preferred above-grade and below-grade rehabilitation options suggests that erosion of the order of 7-8 m will occur on the structure in a period of 1000 years. This depth of erosion may be sufficient to compromise the integrity of the containment. It is shown that SIBERIA has significant advantages over steady-state erosion models. Suggestions are made for the design that will enhance the stability of the structure and extend the structural life of the containment

Ordering sparse matrices for cache-based systems

International Nuclear Information System (INIS)

Biswas, Rupak; Oliker, Leonid

2001-01-01

The Conjugate Gradient (CG) algorithm is the oldest and best-known Krylov subspace method used to solve sparse linear systems. Most of the coating-point operations within each CG iteration is spent performing sparse matrix-vector multiplication (SPMV). We examine how various ordering and partitioning strategies affect the performance of CG and SPMV when different programming paradigms are used on current commercial cache-based computers. However, a multithreaded implementation on the cacheless Cray MTA demonstrates high efficiency and scalability without any special ordering or partitioning

A cache-friendly sampling strategy for texture-based volume rendering on GPU

Directory of Open Access Journals (Sweden)

Junpeng Wang

2017-06-01

Full Text Available The texture-based volume rendering is a memory-intensive algorithm. Its performance relies heavily on the performance of the texture cache. However, most existing texture-based volume rendering methods blindly map computational resources to texture memory and result in incoherent memory access patterns, causing low cache hit rates in certain cases. The distance between samples taken by threads of an atomic scheduling unit (e.g. a warp of 32 threads in CUDA of the GPU is a crucial factor that affects the texture cache performance. Based on this fact, we present a new sampling strategy, called Warp Marching, for the ray-casting algorithm of texture-based volume rendering. The effects of different sample organizations and different thread-pixel mappings in the ray-casting algorithm are thoroughly analyzed. Also, a pipeline manner color blending approach is introduced and the power of warp-level GPU operations is leveraged to improve the efficiency of parallel executions on the GPU. In addition, the rendering performance of the Warp Marching is view-independent, and it outperforms existing empty space skipping techniques in scenarios that need to render large dynamic volumes in a low resolution image. Through a series of micro-benchmarking and real-life data experiments, we rigorously analyze our sampling strategies and demonstrate significant performance enhancements over existing sampling methods.

MonetDB/X100 - A DBMS in the CPU cache

NARCIS (Netherlands)

M. Zukowski (Marcin); P.A. Boncz (Peter); N.J. Nes (Niels); S. Héman (Sándor)

2005-01-01

textabstractX100 is a new execution engine for the MonetDB system, that improves execution speed and overcomes its main memory limitation. It introduces the concept of in-cache vectorized processing that strikes a balance between the existing column-at-a-time MIL execution primitives of MonetDB and

Non-radiological contaminants from uranium mining and milling at Ranger, Jabiru, Northern Territory, Australia.

Science.gov (United States)

Noller, B N

1991-10-01

Protection from the hazards from radioactivity is of prime importance in the management of uranium mine and mill wastes. Such wastes also contain non-radiological contaminants (heavy metals, acids and neutralising agents) which give rise to potential long-term health and environmental hazards and short-term hazards to the aquatic ecosystem, e.g. as a result of release of waste water. This study seeks to identify non-radiological contaminants (elements) transferred to waste water at the Ranger uranium mine/mill complex at Jabiru, which are likely to hazardous to the aquatic environment.The two principal sources of contaminants are: (i) ore and waste rock mobilised from mining; and (ii) process reagents used in the milling and mineral extraction process. These substances may or may not already be present in the natural environment but may lead to deleterious effects on the aquatic environment if increased above threshold levels.Rhenium, derived from the ore body, was found to be significantly enriched in waste water from Ranger, indicating its suitability as an indicator element for water originating from the mining and milling process, but only uranium, likewise derived from the ore, and magnesium, manganese and sulfur (as sulfate) from the milling process were found to be significant environmental contaminants.

On-chip COMA cache-coherence protocol for microgrids of microthreaded cores

NARCIS (Netherlands)

Zhang, L.; Jesshope, C.

2008-01-01

This paper describes an on-chip COMA cache coherency protocol to support the microthread model of concurrent program composition. The model gives a sound basis for building multi-core computers as it captures concurrency, abstracts communication and identifies resources, such as processor groups

OneService - Generic Cache Aggregator Framework for Service Depended Cloud Applications

NARCIS (Netherlands)

Tekinerdogan, B.; Oral, O.A.

2017-01-01

Current big data cloud systems often use different data migration strategies from providers to customers. This often results in increased bandwidth usage and herewith a decrease of the performance. To enhance the performance often caching mechanisms are adopted. However, the implementations of these

Model checking a cache coherence protocol for a Java DSM implementation

NARCIS (Netherlands)

J. Pang; W.J. Fokkink (Wan); R. Hofman (Rutger); R. Veldema

2007-01-01

textabstractJackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java's memory model and allows multithreaded Java programs to run unmodified on a distributed memory system. It employs a multiple-writer cache coherence

Application of computer graphics to generate coal resources of the Cache coal bed, Recluse geologic model area, Campbell County, Wyoming

Science.gov (United States)

Schneider, G.B.; Crowley, S.S.; Carey, M.A.

1982-01-01

Low-sulfur subbituminous coal resources have been calculated, using both manual and computer methods, for the Cache coal bed in the Recluse Model Area, which covers the White Tail Butte, Pitch Draw, Recluse, and Homestead Draw SW 7 1/2 minute quadrangles, Campbell County, Wyoming. Approximately 275 coal thickness measurements obtained from drill hole data are evenly distributed throughout the area. The Cache coal and associated beds are in the Paleocene Tongue River Member of the Fort Union Formation. The depth from the surface to the Cache bed ranges from 269 to 1,257 feet. The thickness of the coal is as much as 31 feet, but in places the Cache coal bed is absent. Comparisons between hand-drawn and computer-generated isopach maps show minimal differences. Total coal resources calculated by computer show the bed to contain 2,316 million short tons or about 6.7 percent more than the hand-calculated figure of 2,160 million short tons.

Model checking a cache coherence protocol of a Java DSM implementation

NARCIS (Netherlands)

Pang, J.; Fokkink, W.J.; Hofman, R.; Veldema, R.S.

2007-01-01

Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java's memory model and allows multithreaded Java programs to run unmodified on a distributed memory system. It employs a multiple-writer cache coherence protocol. In this paper,

Security in the CernVM File System and the Frontier Distributed Database Caching System

International Nuclear Information System (INIS)

Dykstra, D; Blomer, J

2014-01-01

Both the CernVM File System (CVMFS) and the Frontier Distributed Database Caching System (Frontier) distribute centrally updated data worldwide for LHC experiments using http proxy caches. Neither system provides privacy or access control on reading the data, but both control access to updates of the data and can guarantee the authenticity and integrity of the data transferred to clients over the internet. CVMFS has since its early days required digital signatures and secure hashes on all distributed data, and recently Frontier has added X.509-based authenticity and integrity checking. In this paper we detail and compare the security models of CVMFS and Frontier.

Security in the CernVM File System and the Frontier Distributed Database Caching System

Science.gov (United States)

Dykstra, D.; Blomer, J.

2014-06-01

Both the CernVM File System (CVMFS) and the Frontier Distributed Database Caching System (Frontier) distribute centrally updated data worldwide for LHC experiments using http proxy caches. Neither system provides privacy or access control on reading the data, but both control access to updates of the data and can guarantee the authenticity and integrity of the data transferred to clients over the internet. CVMFS has since its early days required digital signatures and secure hashes on all distributed data, and recently Frontier has added X.509-based authenticity and integrity checking. In this paper we detail and compare the security models of CVMFS and Frontier.

An Economic Model for Self-tuned Cloud Caching

OpenAIRE

Dash, Debabrata; Kantere, Verena; Ailamaki, Anastasia

2009-01-01

Cloud computing, the new trend for service infrastructures requires user multi-tenancy as well as minimal capital expenditure. In a cloud that services large amounts of data that are massively collected and queried, such as scientific data, users typically pay for query services. The cloud supports caching of data in order to provide quality query services. User payments cover query execution costs and maintenance of cloud infrastructure, and incur cloud profit. The challenge resides in provi...

Cache Performance Optimization for SoC Vedio Applications

OpenAIRE

Lei Li; Wei Zhang; HuiYao An; Xing Zhang; HuaiQi Zhu

2014-01-01

Chip Multiprocessors (CMPs) are adopted by industry to deal with the speed limit of the single-processor. But memory access has become the bottleneck of the performance, especially in multimedia applications. In this paper, a set of management policies is proposed to improve the cache performance for a SoC platform of video application. By analyzing the behavior of Vedio Engine, the memory-friendly writeback and efficient prefetch policies are adopted. The experiment platform is simulated by ...

Transient Variable Caching in Java’s Stack-Based Intermediate Representation

Directory of Open Access Journals (Sweden)

Paul Týma

1999-01-01

Full Text Available Java’s stack‐based intermediate representation (IR is typically coerced to execute on register‐based architectures. Unoptimized compiled code dutifully replicates transient variable usage designated by the programmer and common optimization practices tend to introduce further usage (i.e., CSE, Loop‐invariant Code Motion, etc.. On register based machines, often transient variables are cached within registers (when available saving the expense of actually accessing memory. Unfortunately, in stack‐based environments because of the need to push and pop the transient values, further performance improvement is possible. This paper presents Transient Variable Caching (TVC, a technique for eliminating transient variable overhead whenever possible. This optimization would find a likely home in optimizers attached to the back of popular Java compilers. Side effects of the algorithm include significant instruction reordering and introduction of many stack‐manipulation operations. This combination has proven to greatly impede the ability to decompile stack‐based IR code sequences. The code that results from the transform is faster, smaller, and greatly impedes decompilation.

Contingency planning and risk analysis for water and tailings management at Ranger Uranium Mines

International Nuclear Information System (INIS)

McNally, P.E.

1986-01-01

This paper describes some of the more likely risks and contingency procedures associated with the extremely variable monsoonal climate of the Alligator Rivers region in the Northern Territory in relation to the Ranger Uranium Mine. The tailings management system is basically a large storage impoundment and a reticulation system that delivers tailings sludge and recycles supernatant water. It is a closed circuit within the water management system and is dealt with as an integral part of that system

Broadcasted Location-Aware Data Cache for Vehicular Application

Directory of Open Access Journals (Sweden)

Fukuda Akira

2007-01-01

Full Text Available There has been increasing interest in the exploitation of advances in information technology, for example, mobile computing and wireless communications in ITS (intelligent transport systems. Classes of applications that can benefit from such an infrastructure include traffic information, roadside businesses, weather reports, entertainment, and so on. There are several wireless communication methods currently available that can be utilized for vehicular applications, such as cellular phone networks, DSRC (dedicated short-range communication, and digital broadcasting. While a cellular phone network is relatively slow and a DSRC has a very small communication area, one-segment digital terrestrial broadcasting service was launched in Japan in 2006, high-performance digital broadcasting for mobile hosts has been available recently. However, broadcast delivery methods have the drawback that clients need to wait for the required data items to appear on the broadcast channel. In this paper, we propose a new cache system to effectively prefetch and replace broadcast data using "scope" (an available area of location-dependent data and "mobility specification" (a schedule according to the direction in which a mobile host moves. We numerically evaluate the cache system on the model close to the traffic road environment, and implement the emulation system to evaluate this location-aware data delivery method for a concrete vehicular application that delivers geographic road map data to a car navigation system.

Wolves, Canis lupus, carry and cache the collars of radio-collared White-tailed Deer, Odocoileus virginianus, they killed

Science.gov (United States)

Nelson, Michael E.; Mech, L. David

2011-01-01

Wolves (Canis lupus) in northeastern Minnesota cached six radio-collars (four in winter, two in spring-summer) of 202 radio-collared White-tailed Deer (Odocoileus virginianus) they killed or consumed from 1975 to 2010. A Wolf bedded on top of one collar cached in snow. We found one collar each at a Wolf den and Wolf rendezvous site, 2.5 km and 0.5 km respectively, from each deer's previous locations.

Analytical derivation of traffic patterns in cache-coherent shared-memory systems

DEFF Research Database (Denmark)

Stuart, Matthias Bo; Sparsø, Jens

2011-01-01

This paper presents an analytical method to derive the worst-case traffic pattern caused by a task graph mapped to a cache-coherent shared-memory system. Our analysis allows designers to rapidly evaluate the impact of different mappings of tasks to IP cores on the traffic pattern. The accuracy...

The Cost of Cache-Oblivious Searching

DEFF Research Database (Denmark)

Bender, Michael A.; Brodal, Gerth Stølting; Fagerberg, Rolf

2011-01-01

of the block sizes are limited to be powers of 2. The paper gives modified versions of the van Emde Boas layout, where the expected number of memory transfers between any two levels of the memory hierarchy is arbitrarily close to [lg e+O(lg lg B/lg B)]log  B N+O(1). This factor approaches lg e≈1.443 as B...... increases. The expectation is taken over the random placement in memory of the first element of the structure. Because searching in the disk-access machine (DAM) model can be performed in log  B N+O(1) block transfers, this result establishes a separation between the (2-level) DAM model and cache...

78 FR 11138 - Annual List of Newspapers Used for Publication of Legal Notice of Decisions for the Rocky...

Science.gov (United States)

2013-02-15

... Daily Boomerang, published daily in Laramie, Albany County, Wyoming. Notice by District Rangers of... Wyoming Notice by Forest Supervisor of Availability for Comment and Decisions Laramie Daily Boomerang... and Decisions Laramie District: Laramie Daily Boomerang, published daily in Laramie, Albany County...

Researching of Covert Timing Channels Based on HTTP Cache Headers in Web API

Directory of Open Access Journals (Sweden)

Denis Nikolaevich Kolegov

2015-12-01

Full Text Available In this paper, it is shown how covert timing channels based on HTTP cache headers can be implemented using different Web API of Google Drive, Dropbox and Facebook  Internet services.

A Cross-Layer Framework for Designing and Optimizing Deeply-Scaled FinFET-Based Cache Memories

Directory of Open Access Journals (Sweden)

Alireza Shafaei

2015-08-01

Full Text Available This paper presents a cross-layer framework in order to design and optimize energy-efficient cache memories made of deeply-scaled FinFET devices. The proposed design framework spans device, circuit and architecture levels and considers both super- and near-threshold modes of operation. Initially, at the device-level, seven FinFET devices on a 7-nm process technology are designed in which only one geometry-related parameter (e.g., fin width, gate length, gate underlap is changed per device. Next, at the circuit-level, standard 6T and 8T SRAM cells made of these 7-nm FinFET devices are characterized and compared in terms of static noise margin, access latency, leakage power consumption, etc. Finally, cache memories with all different combinations of devices and SRAM cells are evaluated at the architecture-level using a modified version of the CACTI tool with FinFET support and other considerations for deeply-scaled technologies. Using this design framework, it is observed that L1 cache memory made of longer channel FinFET devices operating at the near-threshold regime achieves the minimum energy operation point.

Federated or cached searches: providing expected performance from multiple invasive species databases

Science.gov (United States)

Graham, Jim; Jarnevich, Catherine S.; Simpson, Annie; Newman, Gregory J.; Stohlgren, Thomas J.

2011-01-01

Invasive species are a universal global problem, but the information to identify them, manage them, and prevent invasions is stored around the globe in a variety of formats. The Global Invasive Species Information Network is a consortium of organizations working toward providing seamless access to these disparate databases via the Internet. A distributed network of databases can be created using the Internet and a standard web service protocol. There are two options to provide this integration. First, federated searches are being proposed to allow users to search “deep” web documents such as databases for invasive species. A second method is to create a cache of data from the databases for searching. We compare these two methods, and show that federated searches will not provide the performance and flexibility required from users and a central cache of the datum are required to improve performance.

CSU Final Report on the Math/CS Institute CACHE: Communication-Avoiding and Communication-Hiding at the Extreme Scale

Energy Technology Data Exchange (ETDEWEB)

Strout, Michelle [Colorado State University

2014-06-10

The CACHE project entails researching and developing new versions of numerical algorithms that result in data reuse that can be scheduled in a communication avoiding way. Since memory accesses take more time than any computation and require the most power, the focus on turning data reuse into data locality is critical to improving performance and reducing power usage in scientific simulations. This final report summarizes the accomplishments at Colorado State University as part of the CACHE project.

Radiation exposure of the public as a result of the present operations of Ranger Uranium Mines Pty Ltd

Energy Technology Data Exchange (ETDEWEB)

Koperski, J

1986-04-01

Ranger Uranium Mines monitors ambient levels of ionising radiation in accordance with the Code of Practice on Radiation Protection in the Mining and Milling of Radioactive Ores 1980. The radionuclides of interest are: U-238, Th-230, Ra-226, Pb-210, Po-210 and Rn-222 daughters (RnD). The aerial pathway appears to be the critical pathway for transfer of radioactive contaminants to the local population. The average annual effective dose equivalent rate to a member of the critical group from inhalation of long-lived radioactive dust is 0.22 +- 0.10 mSv/y, about 22 times below the limit of 5 mSv/y. No experimental evidence was found for any overall increase of exposure of the public due to consumption of bush food items collected in the vicinity of the Ranger site. The average exposure of the critical group member to RnD is likely to be 2.1 +- 3.1 mWLM/y, or 200 times below the annual limit of 0.4 WLM.

The Use of Proxy Caches for File Access in a Multi-Tier Grid Environment

International Nuclear Information System (INIS)

Brun, R; Duellmann, D; Ganis, G; Janyst, L; Peters, A J; Rademakers, F; Sindrilaru, E; Hanushevsky, A

2011-01-01

The use of proxy caches has been extensively studied in the HEP environment for efficient access of database data and showed significant performance with only very moderate operational effort at higher grid tiers (T2, T3). In this contribution we propose to apply the same concept to the area of file access and analyse the possible performance gains, operational impact on site services and applicability to different HEP use cases. Base on a proof-of-concept studies with a modified XROOT proxy server we review the cache efficiency and overheads for access patterns of typical ROOT based analysis programs. We conclude with a discussion of the potential role of this new component at the different tiers of a distributed computing grid.

A Unified Buffering Management with Set Divisible Cache for PCM Main Memory

Institute of Scientific and Technical Information of China (English)

Mei-Ying Bian; Su-Kyung Yoon; Jeong-Geun Kim; Sangjae Nam; Shin-Dug Kim

2016-01-01

This research proposes a phase-change memory (PCM) based main memory system with an effective combi-nation of a superblock-based adaptive buffering structure and its associated set divisible last-level cache (LLC). To achieve high performance similar to that of dynamic random-access memory (DRAM) based main memory, the superblock-based adaptive buffer (SABU) is comprised of dual DRAM buffers, i.e., an aggressive superblock-based pre-fetching buffer (SBPB) and an adaptive sub-block reusing buffer (SBRB), and a set divisible LLC based on a cache space optimization scheme. According to our experiment, the longer PCM access latency can typically be hidden using our proposed SABU, which can significantly reduce the number of writes over the PCM main memory by 26.44%. The SABU approach can reduce PCM access latency up to 0.43 times, compared with conventional DRAM main memory. Meanwhile, the average memory energy consumption can be reduced by 19.7%.

76 FR 57739 - Environmental Impacts Statements; Notice of Availability

Science.gov (United States)

2011-09-16

... Severity Wildfire, Happy Camp and Oak Knoll Ranger District, Klamath National Forest, Siskiyou County, CA... Authorize Livestock Grazing, Tongue, Medicine Wheel/Paintrock, and Power River Districts of the Bighorn National Forest, Johnson, Sheridan, Big Horn and Washakie Counties, WY, Review Period Ends: 10/17/2011...

Temporal trends in erosion and hydrology for a post-mining landform at Ranger mine, Northern Territory. Supervising Scientist report 165

International Nuclear Information System (INIS)

Moliere, D.R.; Evans, K.G.; Saynor, M.J.; Willgoose, G.R.

2002-01-01

An important part of rehabilitation planning for mines is the design of a stable landform for waste rock dumps or spoil piles, at the completion of mining, which minimise erosion and environmental impact offsite. To successfully incorporate landform designs in planning, there is a need to be able to predict the surface stability of the final landform using erosion and landform evolution modelling techniques. In the long term, weathering, soil forming processes, ecosystem development and even climate change may affect the surface characteristics, and hence the stability, of the rehabilitated landform. In this study, changes to the surface characteristics of a landform in time can be quantified in terms of erosion parameters. Since a prediction of the stability of the rehabilitated landform is required over the long term, temporal changes in these erosion parameters are incorporated into landform evolution modelling of a post-mining landform. The landform evolution model SIBERIA was used to predict the stability of the proposed rehabilitated landform at Ranger Mine, Northern Territory. The data collection sites were considered to be representative of the hydrology and erosion characteristics that would exist on the WRD at Ranger at various stages after rehabilitation. This study uses measured site data from landforms with hydrology and erosion properties similar to those likely to develop on Ranger at various times after rehabilitation to assess the effect of temporal change on landform evolution model input parameters. Section 2 documents the process of SIBERIA input parameter derivation and landform evolution modelling using collected site rainfall, runoff and sediment loss data. This section is based on the detailed descriptions of the process given in Willgoose and Riley (1998) and Evans et al( 1998). In section 3, monitoring data, collected from sites with properties similar to those likely to develop on the proposed above-grade landform at Ranger at various

Broadcasted Location-Aware Data Cache for Vehicular Application

Directory of Open Access Journals (Sweden)

Kenya Sato

2007-05-01

Full Text Available There has been increasing interest in the exploitation of advances in information technology, for example, mobile computing and wireless communications in ITS (intelligent transport systems. Classes of applications that can benefit from such an infrastructure include traffic information, roadside businesses, weather reports, entertainment, and so on. There are several wireless communication methods currently available that can be utilized for vehicular applications, such as cellular phone networks, DSRC (dedicated short-range communication, and digital broadcasting. While a cellular phone network is relatively slow and a DSRC has a very small communication area, one-segment digital terrestrial broadcasting service was launched in Japan in 2006, high-performance digital broadcasting for mobile hosts has been available recently. However, broadcast delivery methods have the drawback that clients need to wait for the required data items to appear on the broadcast channel. In this paper, we propose a new cache system to effectively prefetch and replace broadcast data using “scope” (an available area of location-dependent data and “mobility specification” (a schedule according to the direction in which a mobile host moves. We numerically evaluate the cache system on the model close to the traffic road environment, and implement the emulation system to evaluate this location-aware data delivery method for a concrete vehicular application that delivers geographic road map data to a car navigation system.

XRootd, disk-based, caching proxy for optimization of data access, data placement and data replication

International Nuclear Information System (INIS)

Bauerdick, L A T; Bloom, K; Bockelman, B; Bradley, D C; Dasu, S; Dost, J M; Sfiligoi, I; Tadel, A; Tadel, M; Wuerthwein, F; Yagil, A

2014-01-01

Following the success of the XRootd-based US CMS data federation, the AAA project investigated extensions of the federation architecture by developing two sample implementations of an XRootd, disk-based, caching proxy. The first one simply starts fetching a whole file as soon as a file open request is received and is suitable when completely random file access is expected or it is already known that a whole file be read. The second implementation supports on-demand downloading of partial files. Extensions to the Hadoop Distributed File System have been developed to allow for an immediate fallback to network access when local HDFS storage fails to provide the requested block. Both cache implementations are in pre-production testing at UCSD.

A New Caching Technique to Support Conjunctive Queries in P2P DHT

Science.gov (United States)

Kobatake, Koji; Tagashira, Shigeaki; Fujita, Satoshi

P2P DHT (Peer-to-Peer Distributed Hash Table) is one of typical techniques for realizing an efficient management of shared resources distributed over a network and a keyword search over such networks in a fully distributed manner. In this paper, we propose a new method for supporting conjunctive queries in P2P DHT. The basic idea of the proposed technique is to share a global information on past trials by conducting a local caching of search results for conjunctive queries and by registering the fact to the global DHT. Such a result caching is expected to significantly reduce the amount of transmitted data compared with conventional schemes. The effect of the proposed method is experimentally evaluated by simulation. The result of experiments indicates that by using the proposed method, the amount of returned data is reduced by 60% compared with conventional P2P DHT which does not support conjunctive queries.

Aspen Characteristics - Plumas National Forest [ds373

Data.gov (United States)

California Natural Resource Agency — The database represents point locations and associated stand assessment data collected within aspen stands in the Plumas National Forest, Beckwourth Ranger District...

Aspen Characteristics - Sequoia National Forest [ds377

Data.gov (United States)

California Natural Resource Agency — The database represents point locations and associated stand assessment data collected within aspen stands in the Cannell Meadows Ranger District, Sequoia National...

Big Data Caching for Networking: Moving from Cloud to Edge

OpenAIRE

Zeydan, Engin; Baştuğ, Ejder; Bennis, Mehdi; Kader, Manhal Abdel; Karatepe, Alper; Er, Ahmet Salih; Debbah, Mérouane

2016-01-01

In order to cope with the relentless data tsunami in $5G$ wireless networks, current approaches such as acquiring new spectrum, deploying more base stations (BSs) and increasing nodes in mobile packet core networks are becoming ineffective in terms of scalability, cost and flexibility. In this regard, context-aware $5$G networks with edge/cloud computing and exploitation of \\emph{big data} analytics can yield significant gains to mobile operators. In this article, proactive content caching in...

Some design and operating aspects of the Ranger uranium mine treatment plant

International Nuclear Information System (INIS)

Baily, P.A.

1984-01-01

Environmental considerations were key factors in the design of the Ranger Uranium Mines treatment plant. The mine is located adjacent to the Kakadu National Park and has an average rainfall of 1.6m per annum. No contaminated water or liquid effluents are to be released from the project area and thus water management is a key design and operating fact. Particulate and gas emission criteria influenced design as did occupational hygiene factors (dust, radon, housekeeping, maintenance access). Equipment selection and engineering standards were conservative and resulted in the plant attaining design performance in less than three months from the date of commissioning. A number of mechanical and operational problems were experienced. However, none of these problems have had a significant effect on production

Delivery Time Minimization in Edge Caching: Synergistic Benefits of Subspace Alignment and Zero Forcing

KAUST Repository

Kakar, Jaber; Alameer, Alaa; Chaaban, Anas; Sezgin, Aydin; Paulraj, Arogyaswami

2017-01-01

the fundamental limits of a cache-aided wireless network consisting of one central base station, $M$ transceivers and $K$ receivers from a latency-centric perspective. We use the normalized delivery time (NDT) to capture the per-bit latency for the worst-case file

Aspen Characteristics - Lassen National Forest [ds371

Data.gov (United States)

California Natural Resource Agency — The database represents point locations and associated stand assessment data collected in aspen stands in the in the Eagle Lake Ranger District, Lassen National...

75 FR 65295 - Sitka Resource Advisory Committee

Science.gov (United States)

2010-10-22

... District Ranger, USDA Forest Service, 204 Siginaka Way, Sitka, AK 99835, or electronically to Lisa Hirsch, RAC Coordinator at [email protected] . FOR FURTHER INFORMATION CONTACT: Lisa Hirsch, RAC...

75 FR 60748 - Environmental Impacts Statements; Notice of Availability

Science.gov (United States)

2010-10-01

...-433-3200. EIS No. 20100388, Final EIS, BLM, OR, West Butte Wind Power Project, Construction and...-Highway Vehicle Project, Designated Off-Highway Vehicle (OHV) Trail System, Crescent Ranger District...

75 FR 22736 - Wrangell-Petersburg Resource Advisory Committee

Science.gov (United States)

2010-04-30

... James and Elsie Nolan Center in Wrangell, Alaska. Written comments should be sent to Christopher Savage... FURTHER INFORMATION CONTACT: Christopher Savage, Petersburg District Ranger, P.O. Box 1328, Petersburg...

75 FR 64244 - Wrangell-Petersburg Resource Advisory Committee

Science.gov (United States)

2010-10-19

..., October 30th from 7:30 a.m. to 9 a.m. ADDRESSES: The meeting will be held at the James and Elsie Nolan Center in Wrangell, Alaska. Written comments should be sent to Christopher Savage, Petersburg District... INFORMATION CONTACT: Christopher Savage, Petersburg District Ranger, P.O. Box 1328, Petersburg, Alaska 99833...

Impacto de la memoria cache en la aceleración de la ejecución de algoritmo de detección de rostros en sistemas empotrados

Directory of Open Access Journals (Sweden)

Alejandro Cabrera Aldaya

2012-06-01

Full Text Available En este trabajo se analiza el impacto de la memoria cache sobre la aceleración de la ejecución del algoritmo de detección de rostros de Viola-Jones en un sistema de procesamiento basado en el procesador Microblaze empotrado en un FPGA. Se expone el algoritmo, se describe una implementación software del mismo y se analizan sus funciones más relevantes y las características de localidad de las instrucciones y los datos. Se analiza el impacto de las memorias cache de instrucciones y de datos, tanto de sus capacidades (entre 2 y 16 kB como de tamaño de línea (de 4 y 8 palabras. Los resultados obtenidos utilizando una placa de desarrollo Spartan3A Starter Kit basada en un FPGA Spartan3A XC3S700A, con el procesador Microblaze a 62,5 MHz y 64 MB de memoria externa DDR2 a 125 MHz,  muestran un mayor impacto de la cache de instrucciones que la de datos, con valores óptimos de 8kB para la cache de instrucciones y entre 4 y 16kB para la cache de datos. Con estas memorias se alcanza una aceleración de 17 veces con relación a la ejecución del algoritmo en memoria externa. El tamaño de la línea de cache tiene poca influencia sobre la aceleración del algoritmo.

76 FR 3081 - Sitka Resource Advisory Committee

Science.gov (United States)

2011-01-19

... Forest Service, 204 Siginaka Way, Sitka, AK 99835, or electronically to Lisa Hirsch, RAC Coordinator at [email protected] . FOR FURTHER INFORMATION CONTACT: Lisa Hirsch, RAC Coordinator Sitka Ranger District...

Effectiveness of caching in a distributed digital library system

DEFF Research Database (Denmark)

Hollmann, J.; Ardø, Anders; Stenstrom, P.

2007-01-01

as manifested by gateways that implement the interfaces to the many fulltext archives. A central research question in this approach is: What is the nature of locality in the user access stream to such a digital library? Based on access logs that drive the simulations, it is shown that client-side caching can......Today independent publishers are offering digital libraries with fulltext archives. In an attempt to provide a single user-interface to a large set of archives, the studied Article-Database-Service offers a consolidated interface to a geographically distributed set of archives. While this approach...

Replicas Strategy and Cache Optimization of Video Surveillance Systems Based on Cloud Storage

Directory of Open Access Journals (Sweden)

Rongheng Li

2018-04-01

Full Text Available With the rapid development of video surveillance technology, especially the popularity of cloud-based video surveillance applications, video data begins to grow explosively. However, in the cloud-based video surveillance system, replicas occupy an amount of storage space. Also, the slow response to video playback constrains the performance of the system. In this paper, considering the characteristics of video data comprehensively, we propose a dynamic redundant replicas mechanism based on security levels that can dynamically adjust the number of replicas. Based on the location correlation between cameras, this paper also proposes a data cache strategy to improve the response speed of data reading. Experiments illustrate that: (1 our dynamic redundant replicas mechanism can save storage space while ensuring data security; (2 the cache mechanism can predict the playback behaviors of the users in advance and improve the response speed of data reading according to the location and time correlation of the front-end cameras; and (3 in terms of cloud-based video surveillance, our proposed approaches significantly outperform existing methods.

dCache, towards Federated Identities & Anonymized Delegation

Science.gov (United States)

Ashish, A.; Millar, AP; Mkrtchyan, T.; Fuhrmann, P.; Behrmann, G.; Sahakyan, M.; Adeyemi, O. S.; Starek, J.; Litvintsev, D.; Rossi, A.

2017-10-01

For over a decade, dCache has relied on the authentication and authorization infrastructure (AAI) offered by VOMS, Kerberos, Xrootd etc. Although the established infrastructure has worked well and provided sufficient security, the implementation of procedures and the underlying software is often seen as a burden, especially by smaller communities trying to adopt existing HEP software stacks [1]. Moreover, scientists are increasingly dependent on service portals for data access [2]. In this paper, we describe how federated identity management systems can facilitate the transition from traditional AAI infrastructure to novel solutions like OpenID Connect. We investigate the advantages offered by OpenID Connect in regards to ‘delegation of authentication’ and ‘credential delegation for offline access’. Additionally, we demonstrate how macaroons can provide a more fine-granular authorization mechanism that supports anonymized delegation.

Something different - caching applied to calculation of impedance matrix elements

CSIR Research Space (South Africa)

Lysko, AA

2012-09-01

Full Text Available of the multipliers, the approximating functions are used any required parameters, such as input impedance or gain pattern etc. The method is relatively straightforward but, especially for small to medium matrices, requires spending time on filling... of the computing the impedance matrix for the method of moments, or a similar method, such as boundary element method (BEM) [22], with the help of the flowchart shown in Figure 1. Input Parameters (a) Search the cached data for a match (b) A match found...

75 FR 62386 - Environmental Impacts Statements; Notice of Availability

Science.gov (United States)

2010-10-08

... With the On-Going Outbreak of Mountain Pine Beetles, Diamond Lake Ranger District, Umpqua National... Maintain a Reliable System for Collecting Adult Fish to Allow Reclamation, Rancho Cordova, Gold River, CA...

75 FR 55539 - Shoshone Resource Advisory Committee

Science.gov (United States)

2010-09-13

...-5112. All comments, including names and addresses when provided, are placed in the record and are..., USDA, Shoshone National Forest, Wind River Ranger District, 1403 W Ramshorn, Dubois, WY 82513; (307...

76 FR 31297 - Sitka Resource Advisory Committee

Science.gov (United States)

2011-05-31

..., Katlian Conference Room, 204 Siginaka Way, Sitka, Alaska. Written comments should be sent to Lisa Hirsch... CONTACT: Lisa Hirsch, RAC coordinator, USDA, Tongass NF, Sitka Ranger District, 204 Siginaka Way, Sitka...

77 FR 47813 - Sitka Resource Advisory Committee

Science.gov (United States)

2012-08-10

.... Written comments should be sent to Lisa Hirsch, Sitka Ranger District, 204 Siginaka Way, Sitka, Alaska... entry into the building. FOR FURTHER INFORMATION CONTACT: Lisa Hirsch, RAC coordinator, USDA, Tongass NF...

77 FR 67330 - Sitka Resource Advisory Committee

Science.gov (United States)

2012-11-09

.... Written comments should be sent to Lisa Hirsch, Sitka Ranger District, 204 Siginaka Way, Sitka, Alaska... entry into the building. FOR FURTHER INFORMATION CONTACT: Lisa Hirsch, RAC coordinator, USDA, Tongass NF...

75 FR 54846 - Sitka Resource Advisory Committee

Science.gov (United States)

2010-09-09

... Forest Service, 204 Siginaka Way, Sitka, AK 99835, or electronically to Lisa Hirsch, RAC Coordinator at lisahirs[email protected] . FOR FURTHER INFORMATION CONTACT: Lisa Hirsch, RAC Coordinator Sitka Ranger District...

Pattern recognition for cache management in distributed medical imaging environments.

Science.gov (United States)

Viana-Ferreira, Carlos; Ribeiro, Luís; Matos, Sérgio; Costa, Carlos

2016-02-01

Traditionally, medical imaging repositories have been supported by indoor infrastructures with huge operational costs. This paradigm is changing thanks to cloud outsourcing which not only brings technological advantages but also facilitates inter-institutional workflows. However, communication latency is one main problem in this kind of approaches, since we are dealing with tremendous volumes of data. To minimize the impact of this issue, cache and prefetching are commonly used. The effectiveness of these mechanisms is highly dependent on their capability of accurately selecting the objects that will be needed soon. This paper describes a pattern recognition system based on artificial neural networks with incremental learning to evaluate, from a set of usage pattern, which one fits the user behavior at a given time. The accuracy of the pattern recognition model in distinct training conditions was also evaluated. The solution was tested with a real-world dataset and a synthesized dataset, showing that incremental learning is advantageous. Even with very immature initial models, trained with just 1 week of data samples, the overall accuracy was very similar to the value obtained when using 75% of the long-term data for training the models. Preliminary results demonstrate an effective reduction in communication latency when using the proposed solution to feed a prefetching mechanism. The proposed approach is very interesting for cache replacement and prefetching policies due to the good results obtained since the first deployment moments.

Autonomous Navigation with Constrained Consistency for C-Ranger

Directory of Open Access Journals (Sweden)

Shujing Zhang

2014-06-01

Full Text Available Autonomous underwater vehicles (AUVs have become the most widely used tools for undertaking complex exploration tasks in marine environments. Their synthetic ability to carry out localization autonomously and build an environmental map concurrently, in other words, simultaneous localization and mapping (SLAM, are considered to be pivotal requirements for AUVs to have truly autonomous navigation. However, the consistency problem of the SLAM system has been greatly ignored during the past decades. In this paper, a consistency constrained extended Kalman filter (EKF SLAM algorithm, applying the idea of local consistency, is proposed and applied to the autonomous navigation of the C-Ranger AUV, which is developed as our experimental platform. The concept of local consistency (LC is introduced after an explicit theoretical derivation of the EKF-SLAM system. Then, we present a locally consistency-constrained EKF-SLAM design, LC-EKF, in which the landmark estimates used for linearization are fixed at the beginning of each local time period, rather than evaluated at the latest landmark estimates. Finally, our proposed LC-EKF algorithm is experimentally verified, both in simulations and sea trials. The experimental results show that the LC-EKF performs well with regard to consistency, accuracy and computational efficiency.

A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays

Directory of Open Access Journals (Sweden)

Will Lunniss

2014-04-01

Full Text Available In multitasking real-time systems, the choice of scheduling algorithm is an important factor to ensure that response time requirements are met while maximising limited system resources. Two popular scheduling algorithms include fixed priority (FP and earliest deadline first (EDF. While they have been studied in great detail before, they have not been compared when taking into account cache related pre-emption delays (CRPD. Memory and cache are split into a number of blocks containing instructions and data. During a pre-emption, cache blocks from the pre-empting task can evict those of the pre-empted task. When the pre-empted task is resumed, if it then has to re-load the evicted blocks, CRPD are introduced which then affect the schedulability of the task. In this paper we compare FP and EDF scheduling algorithms in the presence of CRPD using the state-of-the-art CRPD analysis. We find that when CRPD is accounted for, the performance gains offered by EDF over FP, while still notable, are diminished. Furthermore, we find that under scenarios that cause relatively high CRPD, task layout optimisation techniques can be applied to allow FP to schedule tasksets at a similar processor utilisation to EDF. Thus making the choice of the task layout in memory as important as the choice of scheduling algorithm. This is very relevant for industry, as it is much cheaper and simpler to adjust the task layout through the linker than it is to switch the scheduling algorithm.

Spatial allocation of market and nonmarket values in wildland fire management: A case study

Science.gov (United States)

John W. Benoit; Armando González-Cabán; Francis M. Fujioka; Shyh-Chin Chen; José J. Sanchez

2013-01-01

We developed a methodology to evaluate the efficacy of fuel treatments by estimating their costs and potential costs/losses with and without treatments in the San Jacinto Ranger District of the San Bernardino National Forest, California. This district is a typical southern California forest complex containing a large amount of high-valued real estate. We chose four...

Geometric Algorithms for Private-Cache Chip Multiprocessors

DEFF Research Database (Denmark)

Ajwani, Deepak; Sitchinava, Nodari; Zeh, Norbert

2010-01-01

-D convex hulls. These results are obtained by analyzing adaptations of either the PEM merge sort algorithm or PRAM algorithms. For the second group of problems—orthogonal line segment intersection reporting, batched range reporting, and related problems—more effort is required. What distinguishes......We study techniques for obtaining efficient algorithms for geometric problems on private-cache chip multiprocessors. We show how to obtain optimal algorithms for interval stabbing counting, 1-D range counting, weighted 2-D dominance counting, and for computing 3-D maxima, 2-D lower envelopes, and 2...... these problems from the ones in the previous group is the variable output size, which requires I/O-efficient load balancing strategies based on the contribution of the individual input elements to the output size. To obtain nearly optimal algorithms for these problems, we introduce a parallel distribution...

Observations of territorial breeding common ravens caching eggs of greater sage-grouse

Science.gov (United States)

Howe, Kristy B.; Coates, Peter S.

2015-01-01

Previous investigations using continuous video monitoring of greater sage-grouse Centrocercus urophasianus nests have unambiguously identified common ravens Corvus corax as an important egg predator within the western United States. The quantity of greater sage-grouse eggs an individual common raven consumes during the nesting period and the extent to which common ravens actively hunt greater sage-grouse nests are largely unknown. However, some evidence suggests that territorial breeding common ravens, rather than nonbreeding transients, are most likely responsible for nest depredations. We describe greater sage-grouse egg depredation observations obtained opportunistically from three common raven nests located in Idaho and Nevada where depredated greater sage-grouse eggs were found at or in the immediate vicinity of the nest site, including the caching of eggs in nearby rock crevices. We opportunistically monitored these nests by counting and removing depredated eggs and shell fragments from the nest sites during each visit to determine the extent to which the common raven pairs preyed on greater sage-grouse eggs. To our knowledge, our observations represent the first evidence that breeding, territorial pairs of common ravens cache greater sage-grouse eggs and are capable of depredating multiple greater sage-grouse nests.

XRootd, disk-based, caching-proxy for optimization of data-access, data-placement and data-replication

CERN Document Server

Tadel, Matevz

2013-01-01

Following the smashing success of XRootd-based USCMS data-federation, AAA project investigated extensions of the federation architecture by developing two sample implementations of an XRootd, disk-based, caching-proxy. The first one simply starts fetching a whole file as soon as a file-open request is received and is suitable when completely random file access is expected or it is already known that a whole file be read. The second implementation supports on-demand downloading of partial files. Extensions to the Hadoop file-system have been developed to allow foran immediate fallback to network access when local HDFS storage fails to provide the requested block. Tools needed to analyze and to tweak block replication factors and to inject downloaded blocks into a running HDFS installation have also been developed. Both cache implementations are in operation at UCSD and several tests were also performed at UNL and UW-M. Operational experience and applications to automatic storage healing and opportunistic compu...

Groundwater regimes and isotopic studies, Ranger mine area, Northern Territory

Energy Technology Data Exchange (ETDEWEB)

Ahmad, M; Green, D C

1986-12-01

Three types of groundwater occur in the area of the Ranger mine. Type A groundwater occurs in the loose sands and gravels occupying the present day stream channels, Type B in the weathering profile and Type C occurs in relatively fresh fractured bedrock occupying open fractures and other cavities. The three types of groundwater can be distinguished both chemically and isotopically. Light stable isotope data suggest that most early rains are lost by evapotranspiration and have no imprint on the groundwater. Later in the wet season, the ground is saturated and groundwater recharge occurs on a regional scale. This younger groundwater sits on the older waters. Mixing is probably minimal as before any large scale mixing could occur, most younger waters are lost by evapotranspiration. Stable isotope data suggest that Type B groundwater in certain areas has some connection with evaporated surface water bodies. Stable isotope measurements for the pollution monitoring bores around the tailings dam do not indicate any connection with the polluted pond waters at the time of sample collection.

Geochemistry of mercury and other constituents in subsurface sediment—Analyses from 2011 and 2012 coring campaigns, Cache Creek Settling Basin, Yolo County, California

Science.gov (United States)

Arias, Michelle R.; Alpers, Charles N.; Marvin-DiPasquale, Mark C.; Fuller, Christopher C.; Agee, Jennifer L.; Sneed, Michelle; Morita, Andrew Y.; Salas, Antonia

2017-10-31

Cache Creek Settling Basin was constructed in 1937 to trap sediment from Cache Creek before delivery to the Yolo Bypass, a flood conveyance for the Sacramento River system that is tributary to the Sacramento–San Joaquin Delta. Sediment management options being considered by stakeholders in the Cache Creek Settling Basin include sediment excavation; however, that could expose sediments containing elevated mercury concentrations from historical mercury mining in the watershed. In cooperation with the California Department of Water Resources, the U.S. Geological Survey undertook sediment coring campaigns in 2011–12 (1) to describe lateral and vertical distributions of mercury concentrations in deposits of sediment in the Cache Creek Settling Basin and (2) to improve constraint of estimates of the rate of sediment deposition in the basin.Sediment cores were collected in the Cache Creek Settling Basin, Yolo County, California, during October 2011 at 10 locations and during August 2012 at 5 other locations. Total core depths ranged from approximately 4.6 to 13.7 meters (15 to 45 feet), with penetration to about 9.1 meters (30 feet) at most locations. Unsplit cores were logged for two geophysical parameters (gamma bulk density and magnetic susceptibility); then, selected cores were split lengthwise. One half of each core was then photographed and archived, and the other half was subsampled. Initial subsamples from the cores (20-centimeter composite samples from five predetermined depths in each profile) were analyzed for total mercury, methylmercury, total reduced sulfur, iron speciation, organic content (as the percentage of weight loss on ignition), and grain-size distribution. Detailed follow-up subsampling (3-centimeter intervals) was done at six locations along an east-west transect in the southern part of the Cache Creek Settling Basin and at one location in the northern part of the basin for analyses of total mercury; organic content; and cesium-137, which was

Population genetic structure and its implications for adaptive variation in memory and the hippocampus on a continental scale in food-caching black-capped chickadees.

Science.gov (United States)

Pravosudov, V V; Roth, T C; Forister, M L; Ladage, L D; Burg, T M; Braun, M J; Davidson, B S

2012-09-01

Food-caching birds rely on stored food to survive the winter, and spatial memory has been shown to be critical in successful cache recovery. Both spatial memory and the hippocampus, an area of the brain involved in spatial memory, exhibit significant geographic variation linked to climate-based environmental harshness and the potential reliance on food caches for survival. Such geographic variation has been suggested to have a heritable basis associated with differential selection. Here, we ask whether population genetic differentiation and potential isolation among multiple populations of food-caching black-capped chickadees is associated with differences in memory and hippocampal morphology by exploring population genetic structure within and among groups of populations that are divergent to different degrees in hippocampal morphology. Using mitochondrial DNA and 583 AFLP loci, we found that population divergence in hippocampal morphology is not significantly associated with neutral genetic divergence or geographic distance, but instead is significantly associated with differences in winter climate. These results are consistent with variation in a history of natural selection on memory and hippocampal morphology that creates and maintains differences in these traits regardless of population genetic structure and likely associated gene flow. Published 2012. This article is a US Government work and is in the public domain in the USA.

The Caregiver Contribution to Heart Failure Self-Care (CACHS): Further Psychometric Testing of a Novel Instrument.

Science.gov (United States)

Buck, Harleah G; Harkness, Karen; Ali, Muhammad Usman; Carroll, Sandra L; Kryworuchko, Jennifer; McGillion, Michael

2017-04-01

Caregivers (CGs) contribute important assistance with heart failure (HF) self-care, including daily maintenance, symptom monitoring, and management. Until CGs' contributions to self-care can be quantified, it is impossible to characterize it, account for its impact on patient outcomes, or perform meaningful cost analyses. The purpose of this study was to conduct psychometric testing and item reduction on the recently developed 34-item Caregiver Contribution to Heart Failure Self-care (CACHS) instrument using classical and item response theory methods. Fifty CGs (mean age 63 years ±12.84; 70% female) recruited from a HF clinic completed the CACHS in 2014 and results evaluated using classical test theory and item response theory. Items would be deleted for low (.95) endorsement, low (.7) corrected item-total correlations, significant pairwise correlation coefficients, floor or ceiling effects, relatively low latent trait and item information function levels ( .5), and differential item functioning. After analysis, 14 items were excluded, resulting in a 20-item instrument (self-care maintenance eight items; monitoring seven items; and management five items). Most items demonstrated moderate to high discrimination (median 2.13, minimum .77, maximum 5.05), and appropriate item difficulty (-2.7 to 1.4). Internal consistency reliability was excellent (Cronbach α = .94, average inter-item correlation = .41) with no ceiling effects. The newly developed 20-item version of the CACHS is supported by rigorous instrument development and represents a novel instrument to measure CGs' contribution to HF self-care. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Flood Frequency Analysis of Future Climate Projections in the Cache Creek Watershed

Science.gov (United States)

Fischer, I.; Trihn, T.; Ishida, K.; Jang, S.; Kavvas, E.; Kavvas, M. L.

2014-12-01

Effects of climate change on hydrologic flow regimes, particularly extreme events, necessitate modeling of future flows to best inform water resources management. Future flow projections may be modeled through the joint use of carbon emission scenarios, general circulation models and watershed models. This research effort ran 13 simulations for carbon emission scenarios (taken from the A1, A2 and B1 families) over the 21st century (2001-2100) for the Cache Creek watershed in Northern California. Atmospheric data from general circulation models, CCSM3 and ECHAM5, were dynamically downscaled to a 9 km resolution using MM5, a regional mesoscale model, before being input into the physically based watershed environmental hydrology (WEHY) model. Ensemble mean and standard deviation of simulated flows describe the expected hydrologic system response. Frequency histograms and cumulative distribution functions characterize the range of hydrologic responses that may occur. The modeled flow results comprise a dataset suitable for time series and frequency analysis allowing for more robust system characterization, including indices such as the 100 year flood return period. These results are significant for water quality management as the Cache Creek watershed is severely impacted by mercury pollution from historic mining activities. Extreme flow events control mercury fate and transport affecting the downstream water bodies of the Sacramento River and Sacramento- San Joaquin Delta which provide drinking water to over 25 million people.

Analytically calculated post-Keplerian range and range-rate perturbations: the solar Lense-Thirring effect and BepiColombo

Science.gov (United States)

Iorio, Lorenzo

2018-05-01

We analytically calculate the time series for the perturbations Δ ρ \\left(t\\right), Δ \\dot{ρ }\\left(t\\right) induced by a general disturbing acceleration A on the mutual range ρ and range-rate \\dot{ρ } of two test particles A, B orbiting the same spinning body. We apply it to the general relativistic Lense-Thirring effect, due to the primary's spin S, and the classical perturbation arising from its quadrupole mass moment J2 for arbitrary orbital geometries and orientation of the source's symmetry axis {\\hat{S}}. The Earth-Mercury range and range-rate are nominally affected by the Sun's gravitomagnetic field to the 10 m, 10-3 cm s-1 level, respectively, during the extended phase (2026-2028) of the forthcoming BepiColombo mission to Mercury whose expected tracking accuracy is of the order of ≃0.1 m, 2 × 10-4 cm s-1. The competing signatures due to the solar quadrupole J_2^{\\odot }, if modelled at the σ _{J_2^{\\odot }}˜eq 10^{-9} level of the latest planetary ephemerides INPOP17a, are nearly 10 times smaller than the relativistic gravitomagnetic effects. The position and velocity vectors \\boldsymbol {r}, \\boldsymbol {v} of Mercury and Earth are changed by the solar Lense-Thirring effect by about 10 m, 1.5 m and 10-3 cm s-1, 10-5 cm s-1, respectively, over 2 yr; neglecting such shifts may have an impact on long-term integrations of the inner Solar system dynamics over ˜Gyr time-scales.

High-speed mapping of water isotopes and residence time in Cache Slough Complex, San Francisco Bay Delta, CA

Data.gov (United States)

Department of the Interior — Real-time, high frequency (1-second sample interval) GPS location, water quality, and water isotope (δ2H, δ18O) data was collected in the Cache Slough Complex (CSC),...

Towards Cache-Enabled, Order-Aware, Ontology-Based Stream Reasoning Framework

Energy Technology Data Exchange (ETDEWEB)

Yan, Rui; Praggastis, Brenda L.; Smith, William P.; McGuinness, Deborah L.

2016-08-16

While streaming data have become increasingly more popular in business and research communities, semantic models and processing software for streaming data have not kept pace. Traditional semantic solutions have not addressed transient data streams. Semantic web languages (e.g., RDF, OWL) have typically addressed static data settings and linked data approaches have predominantly addressed static or growing data repositories. Streaming data settings have some fundamental differences; in particular, data are consumed on the fly and data may expire. Stream reasoning, a combination of stream processing and semantic reasoning, has emerged with the vision of providing "smart" processing of streaming data. C-SPARQL is a prominent stream reasoning system that handles semantic (RDF) data streams. Many stream reasoning systems including C-SPARQL use a sliding window and use data arrival time to evict data. For data streams that include expiration times, a simple arrival time scheme is inadequate if the window size does not match the expiration period. In this paper, we propose a cache-enabled, order-aware, ontology-based stream reasoning framework. This framework consumes RDF streams with expiration timestamps assigned by the streaming source. Our framework utilizes both arrival and expiration timestamps in its cache eviction policies. In addition, we introduce the notion of "semantic importance" which aims to address the relevance of data to the expected reasoning, thus enabling the eviction algorithms to be more context- and reasoning-aware when choosing what data to maintain for question answering. We evaluate this framework by implementing three different prototypes and utilizing five metrics. The trade-offs of deploying the proposed framework are also discussed.

An analysis of the preliminary water management proposal for the Ranger Uranium Mine

International Nuclear Information System (INIS)

Gibson, D.K.

1980-07-01

Some of the problems expected to arise as a result of contamination of rainfall run-off by the ore and waste rock heaps of the Ranger Uranium Mine, at Jabiru in the Northern Territory of Australia, have been re-examined. A computer program has been written to estimate the quantity of run-off water resulting from any given rainfall pattern. The program was calibrated against measured stream flows in Gulungul Creek; it was then applied to the two major catchment areas surrounding the mine site, and estimates of the quantity and quality of discharge water were made. The effects of the discharge are discussed in relation to the levels tolerable to fish and, in the case of radium, permitted as uptake by humans. A possible modification to the water management plan, which would increase the time for sedimentation before discharge, is suggested

I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors

DEFF Research Database (Denmark)

Ajwani, Deepak; Sitchinava, Nodar; Zeh, Norbert

2011-01-01

/PB) for a number of problems on axis aligned objects; P denotes the number of cores/processors, B denotes the number of elements that fit in a cache line, N and K denote the sizes of the input and output, respectively, and sortp(N) denotes the I/O complexity of sorting N items using P processors in the PEM model...... framework was introduced recently, and a number of algorithms for problems on axis-aligned objects were obtained using this framework. The obtained algorithms were efficient but not optimal. In this paper, we improve the framework to obtain algorithms with the optimal I/O complexity of O(sortp(N) + K...

A Cache-Oblivious Implicit Dictionary with the Working Set Property

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Kejlberg-Rasmussen, Casper; Truelsen, Jakob

2010-01-01

In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting \\op{insert}($e$), \\op{delete}($x$) and \\op{predecessor}($x$) in~$\\O(\\log n)$ time and \\op{search}($x$) in $\\O(\\log\\ell)$ time, where $n$ is the number of elements stored in the dictionary...... and $\\ell$ is the number of distinct elements searched for since the element with key~$x$ was last searched for. The dictionary stores the elements in an array of size~$n$ using \\emph{no} additional space. In the cache-oblivious model the operations \\op{insert}($e$), \\op{delete}($x$) and \\op...

Feasibility Report and Environmental Statement for Water Resources Development, Cache Creek Basin, California

Science.gov (United States)

1979-02-01

classified as Porno , Lake Miwok, and Patwin. Recent surveys within the Clear Lake-Cache Creek Basin have located 28 archeological sites, some of which...additional 8,400 acre-feet annually to the Lakeport area. Porno Reservoir on Kelsey Creek, being studied by Lake County, also would supplement M&l water...project on Scotts Creek could provide 9,100 acre- feet annually of irrigation water. Also, as previously discussed, Porno Reservoir would furnish

Minimizing End-to-End Interference in I/O Stacks Spanning Shared Multi-Level Buffer Caches

Science.gov (United States)

Patrick, Christina M.

2011-01-01

This thesis presents an end-to-end interference minimizing uniquely designed high performance I/O stack that spans multi-level shared buffer cache hierarchies accessing shared I/O servers to deliver a seamless high performance I/O stack. In this thesis, I show that I can build a superior I/O stack which minimizes the inter-application interference…

78 FR 33799 - Newspapers Used for Publication of Legal Notices by the Intermountain Region; Utah, Idaho, Nevada...

Science.gov (United States)

2013-06-05

... Forest Supervisor decisions for the Toiyabe portion: Reno Gazette-Journal Austin District Ranger... affecting National Forests in Nevada: Reno Gazette-Journal Regional Forester decisions affecting National... portion: Idaho State Journal Caribou-Targhee Forest Supervisor decisions for the Targhee portion: Post...

Temperature and Discharge on a Highly Altered Stream in Utah's Cache Valley

OpenAIRE

Pappas, Andy

2013-01-01

To study the River Continuum Concept (RCC) and the Serial Discontinuity Hypothesis (SDH), I looked at temperature and discharge changes along 52 km of the Little Bear River in Cache Valley, Utah. The Little Bear River is a fourth order stream with one major reservoir, a number of irrigation diversions, and one major tributary, the East Fork of the Little Bear River. Discharge data was collected at six sites on 29 September 2012 and temperature data was collected hourly at eleven sites from 1 ...

Using dCache in Archiving Systems oriented to Earth Observation

Science.gov (United States)

Garcia Gil, I.; Perez Moreno, R.; Perez Navarro, O.; Platania, V.; Ozerov, D.; Leone, R.

2012-04-01

The object of LAST activity (Long term data Archive Study on new Technologies) is to perform an independent study on best practices and assessment of different archiving technologies mature for operation in the short and mid-term time frame, or available in the long-term with emphasis on technologies better suited to satisfy the requirements of ESA, LTDP and other European and Canadian EO partners in terms of digital information preservation and data accessibility and exploitation. During the last phase of the project, a testing of several archiving solutions has been performed in order to evaluate their suitability. In particular, dCache, aimed to provide a file system tree view of the data repository exchanging this data with backend (tertiary) Storage Systems as well as space management, pool attraction, dataset replication, hot spot determination and recovery from disk or node failures. Connected to a tertiary storage system, dCache simulates unlimited direct access storage space. Data exchanges to and from the underlying HSM are performed automatically and invisibly to the user Dcache was created to solve the requirements of big computer centers and universities with big amounts of data, putting their efforts together and founding EMI (European Middleware Initiative). At the moment being, Dcache is mature enough to be implemented, being used by several research centers of relevance (e.g. LHC storing up to 50TB/day). This solution has been not used so far in Earth Observation and the results of the study are summarized in this article, focusing on the capacities over a simulated environment to get in line with the ESA requirements for a geographically distributed storage. The challenge of a geographically distributed storage system can be summarized as the way to provide a maximum quality for storage and dissemination services with the minimum cost.

Efficiently GPU-accelerating long kernel convolutions in 3-D DIRECT TOF PET reconstruction via memory cache optimization

Energy Technology Data Exchange (ETDEWEB)

Ha, Sungsoo; Mueller, Klaus [Stony Brook Univ., NY (United States). Center for Visual Computing; Matej, Samuel [Pennsylvania Univ., Philadelphia, PA (United States). Dept. of Radiology

2011-07-01

The DIRECT represents a novel approach for 3-D Time-of-Flight (TOF) PET reconstruction. Its novelty stems from the fact that it performs all iterative predictor-corrector operations directly in image space. The projection operations now amount to convolutions in image space, using long TOF (resolution) kernels. While for spatially invariant kernels the computational complexity can be algorithmically overcome by replacing spatial convolution with multiplication in Fourier space, spatially variant kernels cannot use this shortcut. Therefore in this paper, we describe a GPU-accelerated approach for this task. However, the intricate parallel architecture of GPUs poses its own challenges, and careful memory and thread management is the key to obtaining optimal results. As convolution is mainly memory-bound we focus on the former, proposing two types of memory caching schemes that warrant best cache memory re-use by the parallel threads. In contrast to our previous two-stage algorithm, the schemes presented here are both single-stage which is more accurate. (orig.)

Behavior characterization of the shared last-level cache in a chip multiprocessor

OpenAIRE

Benedicte Illescas, Pedro

2014-01-01

[CATALÀ] Aquest projecte consisteix a analitzar diferents aspectes de la jerarquia de memòria i entendre la seva influència al rendiment del sistema. Els aspectes que s'analitzaran són els algorismes de reemplaçament, els esquemes de mapeig de memòria i les polítiques de pàgina de memòria. [ANGLÈS] This project consists in analyzing different aspects of the memory hierarchy and understanding its influence in the overall system performance. The aspects that will be analyzed are cache replac...

76 FR 2646 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2011-01-14

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... Ranger District, 504 9th Street, Craig, Alaska. Send written comments to Prince of Wales Resource...

75 FR 37753 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2010-06-30

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... Ranger District, 504 9th Street, Craig, Alaska. Send written comments to Prince of Wales Resource...

75 FR 28779 - Prince of Whales Resource Advisory Committee

Science.gov (United States)

2010-05-24

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Whales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Whales Resource Advisory... Ranger District, 504 9th Street, Craig Alaska. Send written comments to Prince of Whales Resource...

76 FR 12933 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2011-03-09

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... Bay Ranger District 1312 Federal Way Thorne Bay, Alaska. Send written comments to Prince of Wales...

77 FR 14360 - Environmental Impacts Statements; Notice of Availability

Science.gov (United States)

2012-03-09

..., WA, Mid-Columbia Coho Restoration Program, Proposal to Fund the Construction, Operation, and.... Davis, 301-415- 3835. EIS No. 20120059, Final EIS, USFS, SD, Section 30 Limestone Mining Project, Proposal to Implement Mining Actions, Mystic Ranger District, Black Hills National Forest, Rapid City...

The uranium ore deposits of the pine creek geosyncline in North Territory, Australia

International Nuclear Information System (INIS)

Kneuper, G.K.; Clasen, D.

1980-01-01

The geological history of the Pine Creek geosyncline is reviewed, and recent research findings and model assumption on the formation of uranium ore deposits are presented. The geological similarities between the Alligator River uranium ore district and the Athabasca Lake district in Saskatchewan, Canada, are pointed out. Present geographic and climatic differences between these two uranium districts and the consequences of these differences for uranium exploration are discussed. The uranium mining activities planned in Australia are illustrated by the example of the Ranger uranium deposit. (orig.) [de

75 FR 65447 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2010-10-25

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... Ranger District 504 9th Street, Craig, Alaska. Send written comments to Prince of Wales Resource Advisory...

75 FR 27286 - McKelvie Geographic Area Range Allotment Management Planning on the Samuel R. McKelvie National...

Science.gov (United States)

2010-05-14

... range allotment management planning on the McKelvie Geographic Area, Samuel R. McKelvie National Forest... DEPARTMENT OF AGRICULTURE Forest Service McKelvie Geographic Area Range Allotment Management Planning on the Samuel R. McKelvie National Forest, Bessey Ranger District in Nebraska AGENCY: Forest...

78 FR 7427 - Environmental Impacts Statements; Notice of Availability

Science.gov (United States)

2013-02-01

... Waters Canoe Area Wilderness (BWCAW) Non-native Plant Management Project, Cook, Lake and St. Louis... EIS, AFS, OR, Rim Paunina Project and Forest Plan Amendments, Crescent Ranger District, Deschutes... Development Project, Approval of Gaming Development and Management, Spokane County, WA, Review Period Ends: 03...

77 FR 45332 - Wrangell-Petersburg Resource Advisory Committee

Science.gov (United States)

2012-07-31

... North Nordic Drive in Petersburg, Alaska. Interested persons may attend in person at either location, or... 12 North Nordic Drive or the Wrangell Ranger District office at 525 Bennett Street during regular... language interpreting, assistive listening devices or other reasonable accommodation for access to the...

78 FR 54445 - Wrangell-Petersburg Resource Advisory Committee; Meeting

Science.gov (United States)

2013-09-04

... Nordic Drive in Petersburg, Alaska. Interested persons may attend in person at either location, or by... Nordic Drive or the Wrangell Ranger District office at 525 Bennett Street during regular office hours... advance for sign language interpreting, assistive listening devices or other reasonable accomodation for...

Mercury and methylmercury concentrations and loads in the Cache Creek watershed, California

Energy Technology Data Exchange (ETDEWEB)

Domagalski, Joseph L.; Alpers, Charles N.; Slotton, Darell G.; Suchanek, Thomas H.; Ayers, Shaun M

2004-07-05

Concentrations and loads of total mercury and methylmercury were measured in streams draining abandoned mercury mines and in the proximity of geothermal discharge in the Cache Creek watershed of California during a 17-month period from January 2000 through May 2001. Rainfall and runoff were lower than long-term averages during the study period. The greatest loading of mercury and methylmercury from upstream sources to downstream receiving waters, such as San Francisco Bay, generally occurred during or after winter rainfall events. During the study period, loads of mercury and methylmercury from geothermal sources tended to be greater than those from abandoned mining areas, a pattern attributable to the lack of large precipitation events capable of mobilizing significant amounts of either mercury-laden sediment or dissolved mercury and methylmercury from mine waste. Streambed sediments of Cache Creek are a significant source of mercury and methylmercury to downstream receiving bodies of water. Much of the mercury in these sediments is the result of deposition over the last 100-150 years by either storm-water runoff, from abandoned mines, or continuous discharges from geothermal areas. Several geochemical constituents were useful as natural tracers for mining and geothermal areas, including the aqueous concentrations of boron, chloride, lithium and sulfate, and the stable isotopes of hydrogen and oxygen in water. Stable isotopes of water in areas draining geothermal discharges showed a distinct trend toward enrichment of {sup 18}O compared with meteoric waters, whereas much of the runoff from abandoned mines indicated a stable isotopic pattern more consistent with local meteoric water.

Mercury and methylmercury concentrations and loads in the Cache Creek watershed, California

International Nuclear Information System (INIS)

Domagalski, Joseph L.; Alpers, Charles N.; Slotton, Darell G.; Suchanek, Thomas H.; Ayers, Shaun M.

2004-01-01

Concentrations and loads of total mercury and methylmercury were measured in streams draining abandoned mercury mines and in the proximity of geothermal discharge in the Cache Creek watershed of California during a 17-month period from January 2000 through May 2001. Rainfall and runoff were lower than long-term averages during the study period. The greatest loading of mercury and methylmercury from upstream sources to downstream receiving waters, such as San Francisco Bay, generally occurred during or after winter rainfall events. During the study period, loads of mercury and methylmercury from geothermal sources tended to be greater than those from abandoned mining areas, a pattern attributable to the lack of large precipitation events capable of mobilizing significant amounts of either mercury-laden sediment or dissolved mercury and methylmercury from mine waste. Streambed sediments of Cache Creek are a significant source of mercury and methylmercury to downstream receiving bodies of water. Much of the mercury in these sediments is the result of deposition over the last 100-150 years by either storm-water runoff, from abandoned mines, or continuous discharges from geothermal areas. Several geochemical constituents were useful as natural tracers for mining and geothermal areas, including the aqueous concentrations of boron, chloride, lithium and sulfate, and the stable isotopes of hydrogen and oxygen in water. Stable isotopes of water in areas draining geothermal discharges showed a distinct trend toward enrichment of 18 O compared with meteoric waters, whereas much of the runoff from abandoned mines indicated a stable isotopic pattern more consistent with local meteoric water

Novel Tools in Determining the Physiological Demands and Nutritional Practices of Ontario FireRangers during Fire Deployments.

Directory of Open Access Journals (Sweden)

A H Robertson

Full Text Available The seasonal profession of wildland fire fighting in Canada requires individuals to work in harsh environmental conditions that are physically demanding. The purpose of this study was to use novel technologies to evaluate the physiological demands and nutritional practices of Canadian FireRangers during fire deployments.Participants (n = 21 from a northern Ontario Fire Base volunteered for this study and data collection occurred during the 2014 fire season and included Initial Attack (IA, Project Fire (P, and Fire Base (B deployments. Deployment-specific energy demands and physiological responses were measured using heart-rate variability (HRV monitoring devices (Zephyr BioHarness3 units. Food consumption behaviour and nutrient quantity and quality were captured using audio-video food logs on iPod Touches and analyzed by NutriBase Pro 11 software.Insufficient kilocalories were consumed relative to expenditure for all deployment types. Average daily kilocalories consumed: IA: 3758 (80% consumption rate; P: 2945±888.8; B: 2433±570.8. Average daily kilocalorie expenditure: IA: 4538±106.3; P: 4012±1164.8; B: 2842±649.9. The Average Macronutrient Distribution Range (AMDR for protein was acceptable: 22-25% (across deployment types. Whereas the AMDR for fat and carbohydrates were high: 40-50%; and low: 27-37% respectively, across deployment types.This study is the first to use the described methodology to simultaneously evaluate energy expenditures and nutritional practices in an occupational setting. The results support the use of HRV monitoring and video-food capture, in occupational field settings, to assess job demands. FireRangers expended the most energy during IA, and the least during B deployments. These results indicate the need to develop strategies centered on maintaining physical fitness and improving food practices.

Comparison of the Frontier Distributed Database Caching System with NoSQL Databases

CERN Multimedia

CERN. Geneva

2012-01-01

Non-relational "NoSQL" databases such as Cassandra and CouchDB are best known for their ability to scale to large numbers of clients spread over a wide area. The Frontier distributed database caching system, used in production by the Large Hadron Collider CMS and ATLAS detector projects, is based on traditional SQL databases but also has the same high scalability and wide-area distributability for an important subset of applications. This paper compares the architectures, behavior, performance, and maintainability of the two different approaches and identifies the criteria for choosing which approach to prefer over the other.

Caching-Aided Collaborative D2D Operation for Predictive Data Dissemination in Industrial IoT

OpenAIRE

Orsino, Antonino; Kovalchukov, Roman; Samuylov, Andrey; Moltchanov, Dmitri; Andreev, Sergey; Koucheryavy, Yevgeni; Valkama, Mikko

2018-01-01

Industrial automation deployments constitute challenging environments where moving IoT machines may produce high-definition video and other heavy sensor data during surveying and inspection operations. Transporting massive contents to the edge network infrastructure and then eventually to the remote human operator requires reliable and high-rate radio links supported by intelligent data caching and delivery mechanisms. In this work, we address the challenges of contents dissemination in chara...

Agricultural Influences on Cache Valley, Utah Air Quality During a Wintertime Inversion Episode

Science.gov (United States)

Silva, P. J.

2017-12-01

Several of northern Utah's intermountain valleys are classified as non-attainment for fine particulate matter. Past data indicate that ammonium nitrate is the major contributor to fine particles and that the gas phase ammonia concentrations are among the highest in the United States. During the 2017 Utah Winter Fine Particulate Study, USDA brought a suite of online and real-time measurement methods to sample particulate matter and potential gaseous precursors from agricultural emissions in the Cache Valley. Instruments were co-located at the State of Utah monitoring site in Smithfield, Utah from January 21st through February 12th, 2017. A Scanning mobility particle sizer (SMPS) and aerodynamic particle sizer (APS) acquired size distributions of particles from 10 nm - 10 μm in 5-min intervals. A URG ambient ion monitor (AIM) gave hourly concentrations for gas and particulate ions and a Chromatotec Trsmedor gas chromatograph obtained 10 minute measurements of gaseous sulfur species. High ammonia concentrations were detected at the Smithfield site with concentrations above 100 ppb at times, indicating a significant influence from agriculture at the sampling site. Ammonia is not the only agricultural emission elevated in Cache Valley during winter, as reduced sulfur gas concentrations of up to 20 ppb were also detected. Dimethylsulfide was the major sulfur-containing gaseous species. Analysis indicates that particle growth and particle nucleation events were both observed by the SMPS. Relationships between gas and particulate concentrations and correlations between the two will be discussed.

75 FR 38768 - Ashley National Forest, UT, High Uintas Wilderness-Colorado River Cutthroat Trout Habitat...

Science.gov (United States)

2010-07-06

... remove competing and hybridizing nonnative fish species from selected streams and lakes within the High... selected lakes and associated stream segments in the Garfield Basin and Swasey Hole in the Yellowstone... comments to Ron Brunson, Roosevelt/Duchesne Ranger District, P.O. Box 981, Duchesne, Utah 84021. Comments...

Design issues and caching strategies for CD-ROM-based multimedia storage

Science.gov (United States)

Shastri, Vijnan; Rajaraman, V.; Jamadagni, H. S.; Venkat-Rangan, P.; Sampath-Kumar, Srihari

1996-03-01

CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities up to 3 GB being available in the near future, they will form an integral part of Video on Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single- user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We also propose an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. In the second section we look at the use of CD-ROM in a VoD server and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt the C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose an admission control algorithm which admits new request streams without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. Finally, we discuss the problem of optimal placement of MPEG streams on CD-ROMs in the third section.

77 FR 50081 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2012-08-20

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... be sent to Prince of Wales RAC c/o District Ranger P.O. Box 500 Craig, AK 99921, or by email to...

76 FR 24852 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2011-05-03

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... for oral comments must be sent to Prince of Wales RAC c/o District Ranger P.O. Box 500 Craig, AK 99921...

Cognitive styles of Forest Service scientists and managers in the Pacific Northwest.

Science.gov (United States)

Andrew B. Carey

1997-01-01

Preferences of executives, foresters, and biologists of the Pacific Northwest Research Station and executives, District Rangers, foresters, engineers, and biologists of the Pacific Northwest Region, National Forest System (USDA Forest Service), were compared for various thinking styles. Herrmann brain dominance profiles from 230 scientists and managers were drawn from...

76 FR 44000 - Environmental Impact Statements; Notice of Availability

Science.gov (United States)

2011-07-22

..., Review Period Ends: 08/15/2011, Contact: Charles J. O'Neill 615-781-5772. EIS No. 20110226, Draft EIS, USFS, ID, Little Slate Project, Proposes Watershed Improvement, Timber Harvest, Fuel Treatments, Soil Restoration and Access Changes in the Little Slate Creek, Salmon River Ranger District, Nez Perce National...

ERA Ranger tailings corridor review. Supervising Scientist report 154

International Nuclear Information System (INIS)

Merz, S.K.

2000-01-01

Sinclair Knight Merz (SKM) were commissioned by the Office of the Supervising Scientist on 25 May 2000 to undertake a review and complete a report on the tailings corridor at the ERA Ranger Mine. The objective of the study was to undertake an 'as is' and to some extent historic and look ahead, review of the corridor system sufficient to: assess the current suitability of key aspects of the design; assess the suitability of current operating, maintenance and system development regimes and responsibilities; and record any recommended actions or further investigations arising out of the review; in order to ensure the adequacy of the design, operation and maintenance. The scope of the study report was limited to the corridor itself, its associated sump and sump contents discharge and the branch corridors carrying pipelines to Pit 1. A representative report contents was discussed and agreed with the Office of the Supervising Scientist prior to commencement of the study and this is included as appendix A to this report. The originally agreed content is, with only minor amendment, reflected in this report. The study methodology comprised a review and assessment by SKM of the design of the existing system and current operations documentation and information obtained from investigations on site and discussions with ERA site personnel. Whilst, a number of modifications affecting the corridor are recommended for further consideration, the main findings of the report relate to operating and maintenance practices which should be adopted for the remainder of the mine/mill life

76 FR 28416 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2011-05-17

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... Prince of Wales RAC c/o District Ranger P.O. Box 500 Craig, AK 99921, or by e-mail to [email protected

77 FR 58095 - Prince of Wales Resource Advisory Committee

Science.gov (United States)

2012-09-19

... DEPARTMENT OF AGRICULTURE Forest Service Prince of Wales Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The Prince of Wales Resource Advisory Committee... must be sent to Prince of Wales RAC c/o District Ranger P.O. Box 500 Craig, AK 99921, or by email to...

78 FR 76100 - Black Hills National Forest Advisory Board

Science.gov (United States)

2013-12-16

...: The Black Hills National Forest Advisory Board (Board) will meet in Rapid City, South Dakota. The... Ranger District, 8221 South Highway 16, Rapid City, South Dakota. Written comments may be submitted as... the public. The agenda will include time for people to make oral statements of three minutes or less...

78 FR 8102 - Kootenai National Forest; Buckhorn Planning Subunit; Lincoln County, Montana; Environmental...

Science.gov (United States)

2013-02-05

... National Forest, Lincoln County, Montana, and north of Troy, Montana. DATES: Comments concerning the scope... Hwy 2, Troy, MT 59935. Comments may also be sent via email to comments-northern-kootenai-three-rivers..., Project Team Leader, Three Rivers Ranger District, 12858 US Hwy 2, Troy, MT 59935. Phone: (406) 295-4693...

Landscape Scale Management in the Ouachita Mountains - Where Operational Practices Meet Research

Science.gov (United States)

Hunter Speed; Ronald J. Perisho; Samuel Larry; James M. Guldin

1999-01-01

Implementation of ecosystem management on National Forest System lands in the Southern Region requires that the best available science be applied to support forest management practices. On the Ouachita National Forest in Arkansas, personnel from the Jessieville and Winona Ranger Districts and the Southern Research Station have developed working relationships that...

Inventory of forest and rangeland resources, including forest stress. [Black Hills, Manitou, Colorado, and Atlanta, Georgia

Science.gov (United States)

Aldrich, R. C.; Weber, F. P.; Driscoll, R. S. (Principal Investigator)

1974-01-01

The author has identified the following significant results. Road systems being developed within the Manitou, Colorado area for human habitation are readily discernible on the S192 normal-color photographs. These are dirt roads, some of which are about 20 feet wide. These data should provide the District Ranger of the Pike National Forest required information on the size and extent of these developing areas, information which he does not now have but is required for total management of the District.

Landowner and visitor response to forest landscape restoration: the Chequamegon-Nicolet National Forest Northeast Sands Project

Science.gov (United States)

Kristin Floress; Anna Haines; Emily Usher; Paul Gobster; Mike. Dockry

2018-01-01

This report is intended to support the ongoing pine barrens restoration on work in the Lakewood-Laona Ranger District on the Chequamegon-Nicolet National Forest (CNNF). The report provides the results from 2016 surveys and focus groups examining landowner and visitor attitudes toward forest management treatments, communication, and restoration project outcomes; their...

Effects of site preparation subsoiling and prescribed burning on survival and growth of shortleaf pine in the Mark Twain National Forest: results after 20 growing seasons

Science.gov (United States)

David Gwaze; Ross Melick; Lynn McClure; Charly Studyvin; David Massengele

2007-01-01

The objective of this study was to evaluate the effect of subsoiling (ripping) and prescribed burning on height, survival, diameter, volume, and competition of planted shortleaf pine (Pinus echinata Mill.). The study was established at the Salem Ranger District, Mark Twain National Forest. The treatments were subsoil/burn, burn, and control with no...

Comparison of the Frontier Distributed Database Caching System with NoSQL Databases

CERN Document Server

Dykstra, David

2012-01-01

One of the main attractions of non-relational "NoSQL" databases is their ability to scale to large numbers of readers, including readers spread over a wide area. The Frontier distributed database caching system, used in production by the Large Hadron Collider CMS and ATLAS detector projects for Conditions data, is based on traditional SQL databases but also has high scalability and wide-area distributability for an important subset of applications. This paper compares the major characteristics of the two different approaches and identifies the criteria for choosing which approach to prefer over the other. It also compares in some detail the NoSQL databases used by CMS and ATLAS: MongoDB, CouchDB, HBase, and Cassandra.

Environmental significance of copper, lead, manganese, uranium and zinc speciation in the event of contaminated waters release from the Ranger Uranium Mining Complex

International Nuclear Information System (INIS)

Noller, B.N.; Currey, N.A.

1983-01-01

The likely impact of the accidental release of tailings dam water during the dry season at the Ranger Uranium Mining Complex was examined. A speciation scheme utilising sizing by filtration and ion-exchange with Chelex 100 has given an insight into the likely partitioning of zinc, copper, lead, manganese and uranium following the addition of tailings dam water to samples from waterbodies in the vicinity of the uranium mining/milling complex. The speciation findings are discussed in terms of likely toxic effects on fish

Fisher research and the Kings River Sustainable Forest Ecosystem Project: current results and future efforts

Science.gov (United States)

Brian B. Boroski; Richard T. Golightly; Amie K. Mazzoni; Kimberly A. Sager

2002-01-01

The Kings River Sustainable Forest Ecosystems Project was initiated on the Kings River Ranger District of the Sierra National Forest, California, in 1993, with fieldwork beginning in 1994. Knowledge of the ecology of the fisher (Martes pennanti) in the Project area, and in the Sierra Nevada of California in general, is insufficient to develop...

Are federal sustained yield units equitable? A case study of the Grays Harbor unit.

Science.gov (United States)

Con H Schallau; Wilbur R. Maki

1986-01-01

The Grays Harbor Federal Sustained Yield Unit (U.S. Department of Agriculture, Forest Service) was established in 1949 to enhance the economic stability of the forest products industry and dependent communities in Grays Harbor County, Washington. Provisions of the unit's charter require that all logs harvested from the Quinault Ranger District of the Olympic...

Comparison of the Frontier Distributed Database Caching System to NoSQL Databases

Science.gov (United States)

Dykstra, Dave

2012-12-01

One of the main attractions of non-relational “NoSQL” databases is their ability to scale to large numbers of readers, including readers spread over a wide area. The Frontier distributed database caching system, used in production by the Large Hadron Collider CMS and ATLAS detector projects for Conditions data, is based on traditional SQL databases but also adds high scalability and the ability to be distributed over a wide-area for an important subset of applications. This paper compares the major characteristics of the two different approaches and identifies the criteria for choosing which approach to prefer over the other. It also compares in some detail the NoSQL databases used by CMS and ATLAS: MongoDB, CouchDB, HBase, and Cassandra.

Comparison of the Frontier Distributed Database Caching System to NoSQL Databases

International Nuclear Information System (INIS)

Dykstra, Dave

2012-01-01

One of the main attractions of non-relational “NoSQL” databases is their ability to scale to large numbers of readers, including readers spread over a wide area. The Frontier distributed database caching system, used in production by the Large Hadron Collider CMS and ATLAS detector projects for Conditions data, is based on traditional SQL databases but also adds high scalability and the ability to be distributed over a wide-area for an important subset of applications. This paper compares the major characteristics of the two different approaches and identifies the criteria for choosing which approach to prefer over the other. It also compares in some detail the NoSQL databases used by CMS and ATLAS: MongoDB, CouchDB, HBase, and Cassandra.

Comparison of the Frontier Distributed Database Caching System to NoSQL Databases

Energy Technology Data Exchange (ETDEWEB)

Dykstra, Dave [Fermilab

2012-07-20

One of the main attractions of non-relational NoSQL databases is their ability to scale to large numbers of readers, including readers spread over a wide area. The Frontier distributed database caching system, used in production by the Large Hadron Collider CMS and ATLAS detector projects for Conditions data, is based on traditional SQL databases but also adds high scalability and the ability to be distributed over a wide-area for an important subset of applications. This paper compares the major characteristics of the two different approaches and identifies the criteria for choosing which approach to prefer over the other. It also compares in some detail the NoSQL databases used by CMS and ATLAS: MongoDB, CouchDB, HBase, and Cassandra.

Council Districts

Data.gov (United States)

Town of Cary, North Carolina — View the location of the Town of Cary’s four Town Council districts.Please note that one district, District A, is split into two geo-spatial areas. One area is in...

H.J. Andrews Experimental Forest.

Science.gov (United States)

Art McKee; Pamela. Druliner

1998-01-01

The H.J. Andrews Experimental Forest is a world renowned center for research and education about the ecology and management of forests and streams. Located about 50 miles (80 km) east of Eugene, Oregon, the Andrews Experimental Forest lies in the Blue River Ranger District of the Willamette National Forest. Established in 1948, the Experimental Forest is administered...

Fens and their rare plants in the Beartooth Mountains, Shoshone National Forest, Wyoming

Science.gov (United States)

Bonnie Heidel; Walter Fertig; Sabine Mellmann-Brown; Kent E. Houston; Kathleen A. Dwire

2017-01-01

Fens are common wetlands in the Beartooth Mountains on the Shoshone National Forest, Clarks Fork Ranger District, in Park County, Wyoming. Fens harbor plant species found in no other habitats, and some rare plants occurring in Beartooth fens are found nowhere else in Wyoming. This report summarizes the studies on Beartooth fens from 1962 to 2009, which have contributed...

Managers’ perspectives: practical experience and challenges associated with variable-density operations and uneven-aged management

Science.gov (United States)

Kurtis E. Steele

2013-01-01

Variable-density thinning has received a lot of public attention in recent years and has subsequently become standard language in most of the Willamette National Forest’s timber management projects. Many techniques have been tried, with varying on-the-ground successes. To accomplish variable-density thinning, the McKenzie River Ranger District currently uses...

Economics of forest fire management: Spatial accounting of costs and benefits

Science.gov (United States)

José J. Sánchez; Ken Baerenklau; Armando González-Cabán; Kurt Schwabe

2013-01-01

To better evaluate the potential impacts of wildland fire in the San Bernardino National Forest, we developed a geographic information system (GIS) data layer containing nonmarket economic values for the San Jacinto Ranger District. Each pixel in the data layer contains an estimate of the most prominent nonmarket values at that location. This information can be used by...

Relationships among red-cockaded woodpecker group density, nestling provisioning rates, and habitat

Science.gov (United States)

Richard N. Conner; D. Craig Rudolph; Richard R. Schaefer; Daniel Saenz; Clifford E. Shackelford

1999-01-01

We examined Red-cockaded Woodpecker (Picoides borealis) food provisioning rates of nestlings during the 1992 and 1993 breeding seasons on the Vernon Ranger District of the Kisatchie National Forest in Louisiana. Provisioning rates were monitored at nest trees in moderate (9.8 groups/2 km radius, n=10) and low (5.9 groups/2 km radius, n=10) density...

Improved cache performance in Monte Carlo transport calculations using energy banding

Science.gov (United States)

Siegel, A.; Smith, K.; Felker, K.; Romano, P.; Forget, B.; Beckman, P.

2014-04-01

We present an energy banding algorithm for Monte Carlo (MC) neutral particle transport simulations which depend on large cross section lookup tables. In MC codes, read-only cross section data tables are accessed frequently, exhibit poor locality, and are typically too much large to fit in fast memory. Thus, performance is often limited by long latencies to RAM, or by off-node communication latencies when the data footprint is very large and must be decomposed on a distributed memory machine. The proposed energy banding algorithm allows maximal temporal reuse of data in band sizes that can flexibly accommodate different architectural features. The energy banding algorithm is general and has a number of benefits compared to the traditional approach. In the present analysis we explore its potential to achieve improvements in time-to-solution on modern cache-based architectures.

A summary of Alaska's unique cruise ship program : wastewater, air emissions, and ocean rangers

Energy Technology Data Exchange (ETDEWEB)

Koch, D. [Alaska Dept. of Environmental Conservation, Juneau, AK (United States)

2009-07-01

Increased environmental awareness has led to concerns over the impacts of cruise ships on Alaska's marine environment. Federal legislation has been passed to ensure that large cruise ships no longer dump bilge water in areas within 3 nautical miles from the state's shoreline. The state has also been legislation to regulate sewage releases from both small and large vessels. The state requires registration, fees, and plans for emissions, and hazardous and solid wastes. As a result of the regulations, all large cruise ships discharging wastewater in Alaska had advanced wastewater treatment systems by 2003. The systems consist of solids separation, enhanced aerobic digestion, ultrafiltration, reverse osmosis, and ultraviolet disinfection systems. The quality of sewage dramatically improved in the region. Ocean rangers are now inspecting approximately 88 per cent of cruise ships visiting the Alaska region. Details of recent wastewater compliance actions were presented, as well as data on wastewater and waste emission limits. tabs., figs.

Security in the Cache and Forward Architecture for the Next Generation Internet

Science.gov (United States)

Hadjichristofi, G. C.; Hadjicostis, C. N.; Raychaudhuri, D.

The future Internet architecture will be comprised predominately of wireless devices. It is evident at this stage that the TCP/IP protocol that was developed decades ago will not properly support the required network functionalities since contemporary communication profiles tend to be data-driven rather than host-based. To address this paradigm shift in data propagation, a next generation architecture has been proposed, the Cache and Forward (CNF) architecture. This research investigates security aspects of this new Internet architecture. More specifically, we discuss content privacy, secure routing, key management and trust management. We identify security weaknesses of this architecture that need to be addressed and we derive security requirements that should guide future research directions. Aspects of the research can be adopted as a step-stone as we build the future Internet.

A study on the effectiveness of lockup-free caches for a Reduced Instruction Set Computer (RISC) processor

OpenAIRE

Tharpe, Leonard.

1992-01-01

Approved for public release; distribution is unlimited This thesis presents a simulation and analysis of the Reduced Instruction Set Computer (RISC) architecture and the effects on RISC performance of a lockup-free cache interface. RISC architectures achieve high performance by having a small, but sufficient, instruction set with most instructions executing in one clock cycle. Current RISC performance range from 1.5 to 2.0 CPI. The goal of RISC is to attain a CPI of 1.0. The major hind...

Mine planning and scheduling at Ranger Uranium Mine - environmental requirements and economics

International Nuclear Information System (INIS)

Bath, L.J.

1984-01-01

Ranger Uranium Mines operates an open cut located in the Northern Territory. Strict environmental controls govern all operations and the water management requirements have the greatest impact on mine planning. The two main goals of planning are to provide mill feed and to mine sufficient suitable quality waste rock for ongoing construction of the tailings dam. Early planning concentrated on staged development of the pit to provide access to as much ore as possible for a given amount of development. All waste was considered to be suitable construction material. Grade control of crusher feed was the main problem in planning, as wide variations occur in ore grade over relatively short distances. Water management for the site operates a 'no release' system for contaminated waters. Design storage has proven inadequate, and the open cut has been used as the extra storage. As construction of future stages of the tailings dam requires non-mineralised rock materials which meet specific quality criteria, the mine has had to re-examine long term planning and pit development strategies. This has entailed the collection of much data not required under normal mining conditions, such as the assaying of waste drill core. The overall impact on mine planning of the environmental regulations has been to alter the philosophy of earlier planning, making it necessary to create a new strategy for pit development with the accent on exposing waste

Mountain Biking at Tsali: An Assessment of Users, Preferences, Conflicts, and Management Alternatives

Science.gov (United States)

J. Michael Bowker; Donald B.K. English

2002-01-01

Tsali Recreation Area is part of the Cheoah Ranger District of the Nantahala National Forest. Overlooking the Great Smoky Mountains, it is one of the premier mountain biking sites in the Eastern United States. The results of a 13-month on-site survey of 1,359 Tsali visitors examine the demographics, behavior, current trip profile, and attitudes toward user fees,...

The People of Bear Hunter Speak: Oral Histories of the Cache Valley Shoshones Regarding the Bear River Massacre

OpenAIRE

Crawford, Aaron L.

2007-01-01

The Cache Valley Shoshone are the survivors of the Bear River Massacre, where a battle between a group of US. volunteer troops from California and a Shoshone village degenerated into the worst Indian massacre in US. history, resulting in the deaths of over 200 Shoshones. The massacre occurred due to increasing tensions over land use between the Shoshones and the Mormon settlers. Following the massacre, the Shoshones attempted settling in several different locations in Box Elder County, eventu...

Summary and Synthesis of Mercury Studies in the Cache Creek Watershed, California, 2000-01

Science.gov (United States)

Domagalski, Joseph L.; Slotton, Darell G.; Alpers, Charles N.; Suchanek, Thomas H.; Churchill, Ronald; Bloom, Nicolas; Ayers, Shaun M.; Clinkenbeard, John

2004-01-01

This report summarizes the principal findings of the Cache Creek, California, components of a project funded by the CALFED Bay?Delta Program entitled 'An Assessment of Ecological and Human Health Impacts of Mercury in the Bay?Delta Watershed.' A companion report summarizes the key findings of other components of the project based in the San Francisco Bay and the Delta of the Sacramento and San Joaquin Rivers. These summary documents present the more important findings of the various studies in a format intended for a wide audience. For more in-depth, scientific presentation and discussion of the research, a series of detailed technical reports of the integrated mercury studies is available at the following website: .

From the Island of the Blue Dolphins: A unique 19th century cache feature from San Nicolas Island, California

Science.gov (United States)

Erlandson, Jon M.; Thomas-Barnett, Lisa; Vellanoweth, René L.; Schwartz, Steven J.; Muhs, Daniel R.

2013-01-01

A cache feature salvaged from an eroding sea cliff on San Nicolas Island produced two redwood boxes containing more than 200 artifacts of Nicoleño, Native Alaskan, and Euro-American origin. Outside the boxes were four asphaltum-coated baskets, abalone shells, a sandstone dish, and a hafted stone knife. The boxes, made from split redwood planks, contained a variety of artifacts and numerous unmodified bones and teeth from marine mammals, fish, birds, and large land mammals. Nicoleño-style artifacts include 11 knives with redwood handles and stone blades, stone projectile points, steatite ornaments and effigies, a carved stone pipe, abraders and burnishing stones, bird bone whistles, bone and shell pendants, abalone shell dishes, and two unusual barbed shell fishhooks. Artifacts of Native Alaskan style include four bone toggling harpoons, two unilaterally barbed bone harpoon heads, bone harpoon fore-shafts, a ground slate blade, and an adze blade. Objects of Euro-American origin or materials include a brass button, metal harpoon blades, and ten flaked glass bifaces. The contents of the cache feature, dating to the early-to-mid nineteenth century, provide an extraordinary window on a time of European expansion and global economic development that created unique cultural interactions and social transformations.

Forest Management and the Evolution of Project Design in Dynamic Wildland Urban Interface Fire Environments

Science.gov (United States)

Conway, S.

2014-12-01

The Truckee Ranger District on the Tahoe National Forest, in the heart of the Sierra Nevada Mountains, has a rich history of human activities. Native American influences, comstock-era logging, fire suppression, development, and recreation have all shaped the natural environment into what it is today. Like much of our national forests in California, forest conditions that have developed are generally much more homogenous and less resistant to disturbance from fire, insect, and disease than they might have been without the myriad of human influences. However, in order to improve the resiliency of our forests to stand replacing disturbances like high severity fire, while managing for integrated anthropomorphic values, it is imperative that management evolve to meet those dynamic needs. Recent advances in remote sensing and GIS allow land managers more access to forest information and can inform site specific prescriptions to change site specific undesirable conditions. It is ecologically and politically complex, yet our forests deserve that microscope. This particular presentation will focus on how the Truckee Ranger District began this process of incorporating several values, generated from stakeholder collaboration, into one project's goals and how those lessons learned informed their most recent project.

District heating in Switzerland

International Nuclear Information System (INIS)

Herzog, F.

1991-01-01

District heating has been used in Switzerland for more than 50 years. Its share of the heat market is less than 3% today. An analysis of the use of district heating in various European countries shows that a high share of district heating in the heat market is always dependent on ideal conditions for its use. Market prospects and possible future developments in the use of district heating in Switzerland are described in this paper. The main Swiss producers and distributors of district heating are members of the Association of District Heating Producers and Distributors. This association supports the installation of district heating facilities where ecological, energetical and economic aspects indicate that district heating would be a good solution. (author) 2 tabs., 6 refs

Data Locality via Coordinated Caching for Distributed Processing

Science.gov (United States)

Fischer, M.; Kuehn, E.; Giffels, M.; Jung, C.

2016-10-01

To enable data locality, we have developed an approach of adding coordinated caches to existing compute clusters. Since the data stored locally is volatile and selected dynamically, only a fraction of local storage space is required. Our approach allows to freely select the degree at which data locality is provided. It may be used to work in conjunction with large network bandwidths, providing only highly used data to reduce peak loads. Alternatively, local storage may be scaled up to perform data analysis even with low network bandwidth. To prove the applicability of our approach, we have developed a prototype implementing all required functionality. It integrates seamlessly into batch systems, requiring practically no adjustments by users. We have now been actively using this prototype on a test cluster for HEP analyses. Specifically, it has been integral to our jet energy calibration analyses for CMS during run 2. The system has proven to be easily usable, while providing substantial performance improvements. Since confirming the applicability for our use case, we have investigated the design in a more general way. Simulations show that many infrastructure setups can benefit from our approach. For example, it may enable us to dynamically provide data locality in opportunistic cloud resources. The experience we have gained from our prototype enables us to realistically assess the feasibility for general production use.

Empowerment Zones and Enterprise Districts - MDC_CommunityDevelopmentDistrict

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — Community Development Districts (CDDs) are special taxing districts or local units of special-purpose government. A CDD may charge separate non-ad valorem special...

District nurse training

OpenAIRE

Elliott, Arnold; Freeling, Paul; Owen, John

1980-01-01

Training for district nursing is being reviewed. By 1981 district nurses will have a new administrative structure, a new curriculum, and a new examination. Training for nursing, like that for general practice, is to become mandatory. The history of the development of district nurse training is briefly described.

Optimizing transformations of stencil operations for parallel object-oriented scientific frameworks on cache-based architectures

Energy Technology Data Exchange (ETDEWEB)

Bassetti, F.; Davis, K.; Quinlan, D.

1998-12-31

High-performance scientific computing relies increasingly on high-level large-scale object-oriented software frameworks to manage both algorithmic complexity and the complexities of parallelism: distributed data management, process management, inter-process communication, and load balancing. This encapsulation of data management, together with the prescribed semantics of a typical fundamental component of such object-oriented frameworks--a parallel or serial array-class library--provides an opportunity for increasingly sophisticated compile-time optimization techniques. This paper describes two optimizing transformations suitable for certain classes of numerical algorithms, one for reducing the cost of inter-processor communication, and one for improving cache utilization; demonstrates and analyzes the resulting performance gains; and indicates how these transformations are being automated.

Temporal locality optimizations for stencil operations for parallel object-oriented scientific frameworks on cache-based architectures

Energy Technology Data Exchange (ETDEWEB)

Bassetti, F.; Davis, K.; Quinlan, D.

1998-12-01

High-performance scientific computing relies increasingly on high-level large-scale object-oriented software frameworks to manage both algorithmic complexity and the complexities of parallelism: distributed data management, process management, inter-process communication, and load balancing. This encapsulation of data management, together with the prescribed semantics of a typical fundamental component of such object-oriented frameworks--a parallel or serial array-class library--provides an opportunity for increasingly sophisticated compile-time optimization techniques. This paper describes a technique for introducing cache blocking suitable for certain classes of numerical algorithms, demonstrates and analyzes the resulting performance gains, and indicates how this optimization transformation is being automated.

Avaliação do compartilhamento das memórias cache no desempenho de arquiteturas multi-core

OpenAIRE

Marco Antonio Zanata Alves

2009-01-01

No atual contexto de inovações em multi-core, em que as novas tecnologias de integração estão fornecendo um número crescente de transistores por chip, o estudo de técnicas de aumento de vazão de dados é de suma importância para os atuais e futuros processadores multi-core e many-core. Com a contínua demanda por desempenho computacional, as memórias cache vêm sendo largamente adotadas nos diversos tipos de projetos arquiteturais de computadores. Os atuais processadores disponíveis no mercado a...

Clock generation and distribution for the 130-nm Itanium$^{R}$ 2 processor with 6-MB on-die L3 cache

CERN Document Server

Tam, S; Limaye, R D

2004-01-01

The clock generation and distribution system for the 130-nm Itanium 2 processor operates at 1.5 GHz with a skew of 24 ps. The Itanium 2 processor features 6 MB of on-die L3 cache and has a die size of 374 mm/sup 2/. Fuse-based clock de-skew enables post-silicon clock optimization to gain higher frequency. This paper describes the clock generation, global clock distribution, local clocking, and the clock skew optimization feature.

7 CFR 917.14 - District.

Science.gov (United States)

2010-01-01

... District. (g) Contra Costa District includes and consists of Contra Costa County. (h) Santa Clara District... Ventura County. (l) Stockton District includes and consists of San Joaquin County, Amador County...

Legislative Districts, Four layers - One State Assembly district, one State Senate district, one US House of Rep district, and one US Senate district showing the locations in the County of Polk, WI., Published in 2007, 1:24000 (1in=2000ft) scale, Polk County Government.

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — Legislative Districts dataset current as of 2007. Four layers - One State Assembly district, one State Senate district, one US House of Rep district, and one US...

State and district policy influences on district-wide elementary and middle school physical education practices.

Science.gov (United States)

Chriqui, Jamie F; Eyler, Amy; Carnoske, Cheryl; Slater, Sandy

2013-01-01

To examine the influence of state laws and district policies on district-wide elementary school and middle school practices related to physical education (PE) time and the percentage of moderate-to-vigorous physical activity (MVPA) time during PE. Multivariate, cross-sectional analysis of state laws, district wellness and PE policies, and district PE practices for school year 2010-2011 controlling for district-level urbanicity, region, size, race/ethnicity of students, and socioeconomic status and clustered on state. One hundred ninety-five public school districts located in 42 states. District-level PE coordinators for the included districts who responded to an online survey. Minutes and days of PE per week and percent time spent in MVPA during PE time. District PE coordinators reported significantly less PE time than national standards-82.9 and 189.6 minutes at the elementary school and middle school levels, respectively. Physical education was provided an average of 2.5 and 3.7 days per week, respectively; and the percentage of MVPA time in PE was 64.4% and 65.7%, respectively. At the elementary school level, districts in either states with laws governing PE time or in a state and district with a law/policy reported significantly more days of PE (0.63 and 0.67 additional days, respectively), and districts in states with PE time laws reported 18 more minutes of PE per week. At the middle school level, state laws were associated with 0.73 more days of PE per week. Neither state laws nor district policies were positively associated with percent MVPA time in PE. State laws and district policies can influence district-level PE practices-particularly those governing the frequency and duration of PE-although opportunities exist to strengthen PE-related laws, policies, and practices.

Modified stretched exponential model of computer system resources management limitations-The case of cache memory

Science.gov (United States)

Strzałka, Dominik; Dymora, Paweł; Mazurek, Mirosław

2018-02-01

In this paper we present some preliminary results in the field of computer systems management with relation to Tsallis thermostatistics and the ubiquitous problem of hardware limited resources. In the case of systems with non-deterministic behaviour, management of their resources is a key point that guarantees theirs acceptable performance and proper working. This is very wide problem that stands for many challenges in financial, transport, water and food, health, etc. areas. We focus on computer systems with attention paid to cache memory and propose to use an analytical model that is able to connect non-extensive entropy formalism, long-range dependencies, management of system resources and queuing theory. Obtained analytical results are related to the practical experiment showing interesting and valuable results.

An ecological response model for the Cache la Poudre River through Fort Collins

Science.gov (United States)

Shanahan, Jennifer; Baker, Daniel; Bledsoe, Brian P.; Poff, LeRoy; Merritt, David M.; Bestgen, Kevin R.; Auble, Gregor T.; Kondratieff, Boris C.; Stokes, John; Lorie, Mark; Sanderson, John

2014-01-01

The Poudre River Ecological Response Model (ERM) is a collaborative effort initiated by the City of Fort Collins and a team of nine river scientists to provide the City with a tool to improve its understanding of the past, present, and likely future conditions of the Cache la Poudre River ecosystem. The overall ecosystem condition is described through the measurement of key ecological indicators such as shape and character of the stream channel and banks, streamside plant communities and floodplain wetlands, aquatic vegetation and insects, and fishes, both coolwater trout and warmwater native species. The 13- mile-long study area of the Poudre River flows through Fort Collins, Colorado, and is located in an ecological transition zone between the upstream, cold-water, steep-gradient system in the Front Range of the Southern Rocky Mountains and the downstream, warm-water, low-gradient reach in the Colorado high plains.

FPGA Implementation of an Amplitude-Modulated Continuous-Wave Ultrasonic Ranger Using Restructured Phase-Locking Scheme

Directory of Open Access Journals (Sweden)

P. Sumathi

2010-01-01

Full Text Available An accurate ultrasonic range finder employing Sliding Discrete Fourier Transform (SDFT based restructured phase-locked loop (RPLL, which is an improved version of the recently proposed integrated phase-locking scheme (IPLL, has been expounded. This range finder principally utilizes amplitude-modulated ultrasonic waves assisted by an infrared (IR pilot signal. The phase shift between the envelope of the reference IR pilot signal and that of the received ultrasonic signal is proportional to the range. The extracted envelopes are filtered by SDFT without introducing any additional phase shift. A new RPLL is described in which the phase error is driven to zero using the quadrature signal derived from the SDFT. Further, the quadrature signal is reinforced by another cosine signal derived from a lookup table (LUT. The pulse frequency of the numerically controlled oscillator (NCO is extremely accurate, enabling fine tuning of the SDFT and RPLL also improves the lock time for the 50 Hz input signal to 0.04 s. The percentage phase error for the range 0.6 m to 6 m is about 0.2%. The VHDL codes generated for the various signal processing steps were downloaded into a Cyclone FPGA chip around which the ultrasonic ranger had been built.

Soils and hydrology of the Ranger uranium mine land application site

International Nuclear Information System (INIS)

Willett, I.R.; Charters, C.J.; Bond, W.J.

1992-01-01

This paper describes the soils and hydrology of an area between Ranger Uranium Mine and Magela Creek, Northern Territory, which is being used for the disposal of retention pond water by irrigation. The soils of an alternative site are also described in less detail. The soil survey of the irrigated area indicated three mapping units differentiated on the basis of texture, colour depth, drainage and the presence of absence of ferricrete. The predominant soils in each unit were yellow earths, red earths and siliceous sands. All the soils had high (20-50%) gravel contents consisting of quartz and ferruginous materials. The gavel is expected to have little ability to retain solutes and therefore reduces the effectiveness of the bulk soil to retain solutes. The soils are generally low in clay (<20%) and organic matter <1%) and are acidic. The clay minerals were of the low activity types, predominantly kaolinite. Consequently the cation exchange capacities of the soils were very low indicating a limited capacity to retain cations. Preliminary calculations showed that the soils would be unable to retain all the cations in the applied water. In order to assess whether redox reactions are likely to be involved in the retention of radionuclides, the responses of the soils to saturation were tested in a laboratory experiment. The implications of these results for the retention of metals and radionuclides were discussed. All soils were found to have high permeabilities. Preliminary calculations showed that transmission of irrigation water to the water table would be rapid (less than 6 weeks). The soils of the alternative site were generally heavier and contained less gravel than those of the current irrigation site. They are likely to retain more solutes than the soils of the current irrigated area and may be better suited to land disposal of retention pond water. 20 refs., 6 tabs., 5 figs

Contrasting patterns of survival and dispersal in multiple habitats reveal an ecological trap in a food-caching bird.

Science.gov (United States)

Norris, D Ryan; Flockhart, D T Tyler; Strickland, Dan

2013-11-01

A comprehensive understanding of how natural and anthropogenic variation in habitat influences populations requires long-term information on how such variation affects survival and dispersal throughout the annual cycle. Gray jays Perisoreus canadensis are widespread boreal resident passerines that use cached food to survive over the winter and to begin breeding during the late winter. Using multistate capture-recapture analysis, we examined apparent survival and dispersal in relation to habitat quality in a gray jay population over 34 years (1977-2010). Prior evidence suggests that natural variation in habitat quality is driven by the proportion of conifers on territories because of their superior ability to preserve cached food. Although neither adults (>1 year) nor juveniles (conifer territories, both age classes were less likely to leave high-conifer territories and, when they did move, were more likely to disperse to high-conifer territories. In contrast, survival rates were lower on territories that were adjacent to a major highway compared to territories that did not border the highway but there was no evidence for directional dispersal towards or away from highway territories. Our results support the notion that natural variation in habitat quality is driven by the proportion of coniferous trees on territories and provide the first evidence that high-mortality highway habitats can act as an equal-preference ecological trap for birds. Reproductive success, as shown in a previous study, but not survival, is sensitive to natural variation in habitat quality, suggesting that gray jays, despite living in harsh winter conditions, likely favor the allocation of limited resources towards self-maintenance over reproduction.

75 FR 33239 - Rangeland Allotment Management Planning on the Fall River West and Oglala Geographic Areas, Fall...

Science.gov (United States)

2010-06-11

...The USDA, Forest Service, will prepare an environmental impact statement (EIS) analyzing the management of rangeland vegetation resources, which includes livestock grazing, on the National Forest System (NFS) lands within the Oglala Geographic Area (OGA) of the Oglala National Grassland on the Pine Ridge Ranger District and the West Geographic Area (WGA) of the Buffalo Gap National Grassland on the Fall River Ranger District of the Nebraska National Forest (Analysis Area) areas as mapped by the 2001 Nebraska National Forest Revised Land and Resource Management Plan (Forest Plan). A Notice of Intent (NOI) for this project was published February 22, 2008 (73 No. 36 FR 9760- 9762). More than six months have elapsed since the projected draft environmental impact statement (DEIS) date in that original NOI. This revised NOI is being issued to update the project schedule. There will be a record of decision (ROD) for each geographic area. Proposed management actions would be implemented beginning in the year 2012. The agency gives notice of the full environmental analysis and decision-making process that will occur on the proposal so interested and affected people may become aware of how they may participate in the process and contribute to the final decision.

California Political Districts

Data.gov (United States)

California Natural Resource Agency — This is a series of district layers pertaining to California'spolitical districts, that are derived from the California State Senateand State Assembly information....

District nursing in Dominica

NARCIS (Netherlands)

Kolkman, PME; Luteijn, AJ; Nasiiro, RS; Bruney, [No Value; Smith, RJA; Meyboom-de Jong, B

1998-01-01

District nurses constitute the basis of the primary health care services in Dominica. All encounters of three district nurses were registered using the international classification of primary care. Information on other aspects of district nursing was collected by participating observation and the

Private Water Districts

Data.gov (United States)

California Natural Resource Agency — Private Water District boundaries are areas where private contracts provide water to the district in California. This database is designed as a regions polygon...

State Water Districts

Data.gov (United States)

California Natural Resource Agency — State Water Project District boundaries are areas where state contracts provide water to the district in California. This database is designed as a regions polygon...

AirCache: A Crowd-Based Solution for Geoanchored Floating Data

Directory of Open Access Journals (Sweden)

Armir Bujari

2016-01-01

Full Text Available The Internet edge has evolved from a simple consumer of information and data to eager producer feeding sensed data at a societal scale. The crowdsensing paradigm is a representative example which has the potential to revolutionize the way we acquire and consume data. Indeed, especially in the era of smartphones, the geographical and temporal scopus of data is often local. For instance, users’ queries are more and more frequently about a nearby object, event, person, location, and so forth. These queries could certainly be processed and answered locally, without the need for contacting a remote server through the Internet. In this scenario, the data is alimented (sensed by the users and, as a consequence, data lifetime is limited by human organizational factors (e.g., mobility. From this basis, data survivability in the Area of Interest (AoI is crucial and, if not guaranteed, could undermine system deployment. Addressing this scenario, we discuss and contribute with a novel protocol named AirCache, whose aim is to guarantee data availability in the AoI while at the same time reducing the data access costs at the network edges. We assess our proposal through a simulation analysis showing that our approach effectively fulfills its design objectives.

Marine Search, Rescue and Emergency Preparedness Study.

Science.gov (United States)

1975-09-01

most points made by these men is that from the Manager of J. Percy Priest Reservoir, William Redmon, who is also a member of the Board of Directors of...Alamo Lake: COE - Lowell C. Flannery Curacanti: National Park Svc. - J. C. Riggs, Chief Park RangerI Jackson : Mancos Water Conservance District...Safety ! J. Percy Priest Reservoir: COE - William G. Redmon, Reservoir Mgr. John Sevier Steam Plant: TA - Walter C. Vance, Lt. Public Safety Kentucky Lake

Potential Mechanisms Driving Population Variation in Spatial Memory and the Hippocampus in Food-caching Chickadees.

Science.gov (United States)

Croston, Rebecca; Branch, Carrie L; Kozlovsky, Dovid Y; Roth, Timothy C; LaDage, Lara D; Freas, Cody A; Pravosudov, Vladimir V

2015-09-01

Harsh environments and severe winters have been hypothesized to favor improvement of the cognitive abilities necessary for successful foraging. Geographic variation in winter climate, then, is likely associated with differences in selection pressures on cognitive ability, which could lead to evolutionary changes in cognition and its neural mechanisms, assuming that variation in these traits is heritable. Here, we focus on two species of food-caching chickadees (genus Poecile), which rely on stored food for survival over winter and require the use of spatial memory to recover their stores. These species also exhibit extensive climate-related population level variation in spatial memory and the hippocampus, including volume, the total number and size of neurons, and adults' rates of neurogenesis. Such variation could be driven by several mechanisms within the context of natural selection, including independent, population-specific selection (local adaptation), environment experience-based plasticity, developmental differences, and/or epigenetic differences. Extensive data on cognition, brain morphology, and behavior in multiple populations of these two species of chickadees along longitudinal, latitudinal, and elevational gradients in winter climate are most consistent with the hypothesis that natural selection drives the evolution of local adaptations associated with spatial memory differences among populations. Conversely, there is little support for the hypotheses that environment-induced plasticity or developmental differences are the main causes of population differences across climatic gradients. Available data on epigenetic modifications of memory ability are also inconsistent with the observed patterns of population variation, with birds living in more stressful and harsher environments having better spatial memory associated with a larger hippocampus and a larger number of hippocampal neurons. Overall, the existing data are most consistent with the

Traversal Caches: A Framework for FPGA Acceleration of Pointer Data Structures

Directory of Open Access Journals (Sweden)

James Coole

2010-01-01

Full Text Available Field-programmable gate arrays (FPGAs and other reconfigurable computing (RC devices have been widely shown to have numerous advantages including order of magnitude performance and power improvements compared to microprocessors for some applications. Unfortunately, FPGA usage has largely been limited to applications exhibiting sequential memory access patterns, thereby prohibiting acceleration of important applications with irregular patterns (e.g., pointer-based data structures. In this paper, we present a design pattern for RC application development that serializes irregular data structure traversals online into a traversal cache, which allows the corresponding data to be efficiently streamed to the FPGA. The paper presents a generalized framework that benefits applications with repeated traversals, which we show can achieve between 7x and 29x speedup over pointer-based software. For applications without strictly repeated traversals, we present application-specialized extensions that benefit applications with highly similar traversals by exploiting similarity to improve memory bandwidth and execute multiple traversals in parallel. We show that these extensions can achieve a speedup between 11x and 70x on a Virtex4 LX100 for Barnes-Hut n-body simulation.

Caching behaviour by red squirrels may contribute to food conditioning of grizzly bears

Directory of Open Access Journals (Sweden)

Julia Elizabeth Put

2017-08-01

Full Text Available We describe an interspecific relationship wherein grizzly bears (Ursus arctos horribilis appear to seek out and consume agricultural seeds concentrated in the middens of red squirrels (Tamiasciurus hudsonicus, which had collected and cached spilled grain from a railway. We studied this interaction by estimating squirrel density, midden density and contents, and bear activity along paired transects that were near (within 50 m or far (200 m from the railway. Relative to far ones, near transects had 2.4 times more squirrel sightings, but similar numbers of squirrel middens. Among 15 middens in which agricultural products were found, 14 were near the rail and 4 subsequently exhibited evidence of bear digging. Remote cameras confirmed the presence of squirrels on the rail and bears excavating middens. We speculate that obtaining grain from squirrel middens encourages bears to seek grain on the railway, potentially contributing to their rising risk of collisions with trains.

Zero Energy Districts

Energy Technology Data Exchange (ETDEWEB)

Polly, Benjamin J [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2018-05-04

This presentation shows how NREL is approaching Zero Energy Districts, including key opportunities, design strategies, and master planning concepts. The presentation also covers URBANopt, an advanced analytical platform for district that is being developed by NREL.

A Yeast Purification System for Human Translation Initiation Factors eIF2 and eIF2B epsilon and Their Use in the Diagnosis of CACH/VWM Disease

NARCIS (Netherlands)

de Almeida, R.A.; Fogli, A.; Gaillard, M.; Scheper, G.C.; Boesflug-Tanguy, O.; Pavitt, G.D.

2013-01-01

Recessive inherited mutations in any of five subunits of the general protein synthesis factor eIF2B are responsible for a white mater neurodegenerative disease with a large clinical spectrum. The classical form is called Childhood Ataxia with CNS hypomyelination (CACH) or Vanishing White Matter

Future Services for District Heating Solutions in Residential Districts

Directory of Open Access Journals (Sweden)

Hannele Ahvenniemi

2014-06-01

Full Text Available The underlying assumption of this study is that in order to retain the competitiveness while reaching for the EU targets regarding low-energy construction, district heating companies need to develop new business and service models. How district heating companies could broaden their perspective and switch to a more service-oriented way of thinking is a key interest of our research. The used methods in our study are house builder interviews and a questionnaire. With the help of these methods we discussed the potential interest in heating related services acquiring a comprehensive understanding of the customer needs. The results indicate the importance of certain criteria when choosing the heating system in households: easiness, comfort and affordability seem to dominate the house builders’ preferences. Also environmental awareness seems to be for many an important factor when making a decision about the heating of the house. Altogether, based on the results of this study, we suggest that the prospects of district heating could benefit from highlighting certain aspects and strengths in the future. District heating companies need to increase flexibility, readiness to adopt new services, to invest in new marketing strategies and improving the communication skills.

Nankana West District of Ghana

African Journals Online (AJOL)

Agribotix GCS 077

Local governments in Ghana play very important roles with actors in the ... Metropolitan, Municipal and District Chief Executives (MMDCEs), the .... District Budget Officer, District Finance Officer, Presiding Member, members of the Works Sub-.

Teaching Russian Via Distance Learning, the EdNet Experience.

Science.gov (United States)

Zsiray, Stephen W., Jr.; And Others

In Utah, the statewide distance education network (EdNet) enables students from five rural and suburban high schools to learn Russian and earn college credits. Courses in Russian are offered through a partnership involving the Cache County School District, Utah State University, and the Utah State Office of Education. Classes are taught on one…

District Energy Windsor

Energy Technology Data Exchange (ETDEWEB)

NONE

2002-07-01

This paper presents a summary of how District Energy Windsor operates. It includes a system site map and reasons why it is advantageous to get connected to a district heating system. District Energy Windsor is a division of the Windsor Utilities Commission. It was developed in 1996 and was the first in North America to supply both heating and cooling requirements. It supplies nearly 2 million square feet of heating and cooling for Windsor's city centre. The district energy system produces hot water or chilled water at a central plant. Energy is then piped out to buildings in the area, including the Art Gallery of Windsor, the Royal Bank Business Centre, the Windsor Justice Facility, the Windsor Casino, and Northwind Windsor. The energy, which is transferred through heat exchangers, is used for space heating, domestic hot water heating, and air conditioning. The 8 reasons for getting connected are: (1) less management costs, (2) lower energy costs, (3) lower level of risk management, (4) stable energy rates, (5) better use of building space, (6) reliable service, (7) reduced expansion costs, and (8) a cleaner environment. District heating improves air quality through reduced carbon dioxide and nitrogen oxide emissions. In addition, fuel delivery and storage are eliminated. figs.

Revisiting "Rodriguez v. Los Angeles Unified School District": A Case of Intra-District Inequities

Science.gov (United States)

Espinosa, Ruben W.

2010-01-01

The educational community and the courts continue to struggle with the challenges of intra-district resource inequality revealed by the California Supreme Court landmark case "Rodriguez v. Los Angeles Unified School District" (1992). Intra-district school resource inequality is one of the remaining bastions of major inequalities in the…

VII international district heating conference

International Nuclear Information System (INIS)

1988-01-01

The proceedings of the 7th International District Heating Conference contain the full texts of the 89 presented papers of which 11 fall under the INIS Subject Scope. The conference met in seven sessions and dealt with the following problem areas: design and optimization of systems of district heating, integration of the power system and the district heating systems, cooperation of nuclear and fossil burning sources in district heating systems, the use of specific nuclear power plants for heating purposes, questions of the control of systems of district heating, the development of components of heating networks, the reliability and design of heat supply pipes. (Z.M.)

District heating in Italy

International Nuclear Information System (INIS)

Sacchi, E.

1998-01-01

The legislative act establishing the electric monopoly virtually shut out the district heating associated with electricity cogeneration, while other laws, issued to counteract the effects of oil shocks, allowed municipal utilities to do so. Thus, district heating has experienced some development, though well below its possibilities. The article analyses the reasons for this lagging, reports district heating data and projects its forecasts against the Kyoto Protocol objectives [it

Smart Collaborative Caching for Information-Centric IoT in Fog Computing

Directory of Open Access Journals (Sweden)

Fei Song

2017-11-01

Full Text Available The significant changes enabled by the fog computing had demonstrated that Internet of Things (IoT urgently needs more evolutional reforms. Limited by the inflexible design philosophy; the traditional structure of a network is hard to meet the latest demands. However, Information-Centric Networking (ICN is a promising option to bridge and cover these enormous gaps. In this paper, a Smart Collaborative Caching (SCC scheme is established by leveraging high-level ICN principles for IoT within fog computing paradigm. The proposed solution is supposed to be utilized in resource pooling, content storing, node locating and other related situations. By investigating the available characteristics of ICN, some challenges of such combination are reviewed in depth. The details of building SCC, including basic model and advanced algorithms, are presented based on theoretical analysis and simplified examples. The validation focuses on two typical scenarios: simple status inquiry and complex content sharing. The number of clusters, packet loss probability and other parameters are also considered. The analytical results demonstrate that the performance of our scheme, regarding total packet number and average transmission latency, can outperform that of the original ones. We expect that the SCC will contribute an efficient solution to the related studies.

Smart Collaborative Caching for Information-Centric IoT in Fog Computing.

Science.gov (United States)

Song, Fei; Ai, Zheng-Yang; Li, Jun-Jie; Pau, Giovanni; Collotta, Mario; You, Ilsun; Zhang, Hong-Ke

2017-11-01

The significant changes enabled by the fog computing had demonstrated that Internet of Things (IoT) urgently needs more evolutional reforms. Limited by the inflexible design philosophy; the traditional structure of a network is hard to meet the latest demands. However, Information-Centric Networking (ICN) is a promising option to bridge and cover these enormous gaps. In this paper, a Smart Collaborative Caching (SCC) scheme is established by leveraging high-level ICN principles for IoT within fog computing paradigm. The proposed solution is supposed to be utilized in resource pooling, content storing, node locating and other related situations. By investigating the available characteristics of ICN, some challenges of such combination are reviewed in depth. The details of building SCC, including basic model and advanced algorithms, are presented based on theoretical analysis and simplified examples. The validation focuses on two typical scenarios: simple status inquiry and complex content sharing. The number of clusters, packet loss probability and other parameters are also considered. The analytical results demonstrate that the performance of our scheme, regarding total packet number and average transmission latency, can outperform that of the original ones. We expect that the SCC will contribute an efficient solution to the related studies.

A Query Cache Tool for Optimizing Repeatable and Parallel OLAP Queries

Science.gov (United States)

Santos, Ricardo Jorge; Bernardino, Jorge

On-line analytical processing against data warehouse databases is a common form of getting decision making information for almost every business field. Decision support information oftenly concerns periodic values based on regular attributes, such as sales amounts, percentages, most transactioned items, etc. This means that many similar OLAP instructions are periodically repeated, and simultaneously, between the several decision makers. Our Query Cache Tool takes advantage of previously executed queries, storing their results and the current state of the data which was accessed. Future queries only need to execute against the new data, inserted since the queries were last executed, and join these results with the previous ones. This makes query execution much faster, because we only need to process the most recent data. Our tool also minimizes the execution time and resource consumption for similar queries simultaneously executed by different users, putting the most recent ones on hold until the first finish and returns the results for all of them. The stored query results are held until they are considered outdated, then automatically erased. We present an experimental evaluation of our tool using a data warehouse based on a real-world business dataset and use a set of typical decision support queries to discuss the results, showing a very high gain in query execution time.

Smart Collaborative Caching for Information-Centric IoT in Fog Computing

Science.gov (United States)

Song, Fei; Ai, Zheng-Yang; Li, Jun-Jie; Zhang, Hong-Ke

2017-01-01

The significant changes enabled by the fog computing had demonstrated that Internet of Things (IoT) urgently needs more evolutional reforms. Limited by the inflexible design philosophy; the traditional structure of a network is hard to meet the latest demands. However, Information-Centric Networking (ICN) is a promising option to bridge and cover these enormous gaps. In this paper, a Smart Collaborative Caching (SCC) scheme is established by leveraging high-level ICN principles for IoT within fog computing paradigm. The proposed solution is supposed to be utilized in resource pooling, content storing, node locating and other related situations. By investigating the available characteristics of ICN, some challenges of such combination are reviewed in depth. The details of building SCC, including basic model and advanced algorithms, are presented based on theoretical analysis and simplified examples. The validation focuses on two typical scenarios: simple status inquiry and complex content sharing. The number of clusters, packet loss probability and other parameters are also considered. The analytical results demonstrate that the performance of our scheme, regarding total packet number and average transmission latency, can outperform that of the original ones. We expect that the SCC will contribute an efficient solution to the related studies. PMID:29104219

7 CFR 958.27 - Districts.

Science.gov (United States)

2010-01-01

...; (2) changes in the relative position of existing districts with respect to onion production; (3) the... and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE ONIONS GROWN IN CERTAIN DESIGNATED... Districts. (a) For the purpose of selecting committee members, the following districts of the production...

Intra-District Disparities in Primary Education: A Case Study of Bankura District, West Bengal

Directory of Open Access Journals (Sweden)

Krishnendu Maji

2017-03-01

Full Text Available The level of education and its response to different educational opportunities vary from one spatial unit to another depending on various factors like social, economic, cultural, and institutional. It is understood that certain regions acquire relative advancements over others in terms of human resource development and human capital formation. The key purpose of this research is to examine the intra-district disparities in primary education in Bankura District one of the districts of West Bengal. It ranks 11thamong the 19 districts of West Bengal (Human Development Report, 2007.  Overall literacy rate of the district stands at 70.26% but the district scores low in terms of female literacy rates, which is 60.05%,whereas the male literacy rate is 80.05%, which is a huge gender literacy gap of 20%. There are also regional inequalities existing at block level. Kotulpur ranks first with a literacy rate of 78.01% while Saltora occupies the bottom position with literacy rate of just 61.45% (Census of India, 2011. The level of educational development is dependent on several factors—enrolment ratio, dropout and repetition rates, pupil-teacher ratio, habitations covered by educational institutions, space-student ratio, drinking water and sanitation facilities in school, etc. In this context, the present study aims at examining the issues of intra-district disparities in educational attainment with regard to various educational amenities of Bankura district, West Bengal. Ten attributes have been selected to examine the level of development in primary education. It is clear from the study that the level of development in eastern part of the district is relatively better in comparison to other regions. Economic backwardness and physical bottlenecks continue to be major issues in western blocks.

Lieutenant Chief Warden Districts

Data.gov (United States)

Vermont Center for Geographic Information — This dataset is a representation overlay of Lieutenant Chief Warden Districts (areas of responsibility). The Vermont Lieutenant Chief Warden Districts layer is part...

State-Level Guidance and District-Level Policies and Practices for Food Marketing in US School Districts.

Science.gov (United States)

Merlo, Caitlin L; Michael, Shannon; Brener, Nancy D; Blanck, Heidi

2018-06-07

State agencies play a critical role in providing school districts with guidance and technical assistance on school nutrition issues, including food and beverage marketing practices. We examined associations between state-level guidance and the policies and practices in school districts regarding food and beverage marketing and promotion. State policy guidance was positively associated with districts prohibiting advertisements for junk food or fast food restaurants on school property. Technical assistance from states was negatively associated with 2 district practices to restrict marketing of unhealthy foods and beverages, but positively associated with 1 practice to promote healthy options. These findings may help inform the guidance that states provide to school districts and help identify which districts may need additional assistance to address marketing and promotion practices.

77 FR 63326 - Huron Wetland Management District, Madison Wetland Management District, and Sand Lake Wetland...

Science.gov (United States)

2012-10-16

..., consistent with sound principles of fish and wildlife management, conservation, legal mandates, and our... FXRS1265066CCP0] Huron Wetland Management District, Madison Wetland Management District, and Sand Lake Wetland Management District, SD; Final Comprehensive Conservation Plan and Finding of No Significant Impact for...

Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks.

Science.gov (United States)

Yuan, Peiyan; Wu, Honghai; Zhao, Xiaoyan; Dong, Zhengnan

2017-07-18

The node buffer size has a large influence on the performance of Mobile Opportunistic Networks (MONs). This is mainly because each node should temporarily cache packets to deal with the intermittently connected links. In this paper, we study fundamental bounds on node buffer size below which the network system can not achieve the expected performance such as the transmission delay and packet delivery ratio. Given the condition that each link has the same probability p to be active in the next time slot when the link is inactive and q to be inactive when the link is active, there exists a critical value p c from a percolation perspective. If p > p c , the network is in the supercritical case, where we found that there is an achievable upper bound on the buffer size of nodes, independent of the inactive probability q. When p network is in the subcritical case, and there exists a closed-form solution for buffer occupation, which is independent of the size of the network.

Assessment of the meteorological data and atmospheric dispersion estimates in the Ranger 1 Uranium Mining Environmental Impact Statement

International Nuclear Information System (INIS)

Clark, G.H.

1977-03-01

Wind records from Jabiru, Northern Territory, Australia have been re-analysed to give atmospheric dispersion estimates of sulphur dioxide and radioactive contaminants associated with a proposed uranium mining and milling operation. Revisions in the plume rise equations have led to lower annual average sulphur dioxide air concentrations than those presented in the Ranger 1 Uranium Mining Environmental Impact Statement. Likewise, the short term peak air concentrations of sulphur dioxide were all within the United States Environment Protection Agency air quality standards. Even though the radon gas inventory was revised upwards, predicted concentrations were only slightly higher than those in the RUMEIS. An attempt was made at a first estimate of the uranium dust source term caused by wind suspension from stockpiled ore and waste rock. In a preliminary analysis using a 'surface depletion' model, it was estimated that uranium dust air concentrations would be decreased by about an order of magnitude when dry deposition was included in the atmospheric dispersion model. Integrating over all sources, radionuclides and meteorological conditions, the annual radiation dose to members of the public in the Regional Centre is estimated to be a maximum of 5 per cent of the recommended annual limits. (author)

VT Data - Overlay District 20170419, Colchester

Data.gov (United States)

Vermont Center for Geographic Information — The following Overlay Districts are included in the data:General Development Four Commercial DistrictGeneral Development Four Openspace DistrictShoreland...

Reinstating district nursing: A UK perspective.

Science.gov (United States)

Morris, Hannah

2017-09-01

As policy directives gather pace for service provision to be delivered in primary care, district nursing has not been recognised as a valuable asset to facilitate this agenda. Investment in district nursing and specialist district nursing education has fallen. This is concurrent with an ageing district nursing workforce, a lack of recruitment and growing caseloads, as district nursing adapts to meet the challenges of the complexities of contemporary healthcare in the community. The district nurse role is complex and multifaceted and includes working collaboratively and creatively to coordinate care. Redressing the shortages of specialist district nurse practitioners with increased numbers of health care support workers will not replace the skill, knowledge, experience required to meet the complex care needs of today's society. District nursing needs to be reinstated as the valuable asset it is, through renewed investment in the service, research development and in specialist practice education. To prevent extinction district nurses need to be able to demonstrate and articulate the complexities and dynamisms of the role to reinstate themselves to their commissioners as a valuable asset for contemporary practice that can meet current health and social care needs effectively. Crown Copyright © 2017. Published by Elsevier Ltd. All rights reserved.

District Consolidation: Rivals Coming Together

Science.gov (United States)

Mart, Dan

2011-01-01

District consolidation is a highly emotional process. One key to success is sticking to the facts. In Iowa, school districts facing financial difficulties or enrollment concerns do not have to move directly to consolidation. In many cases, districts begin by developing sharing agreements. These sharing agreements may start with simple sharing of…

33 CFR 3.25-1 - Fifth district.

Science.gov (United States)

2010-07-01

... District § 3.25-1 Fifth district. (a) The District Office is in Portsmouth, Va. (b) The Fifth Coast Guard District is comprised of: North Carolina; Virginia; District of Columbia; Maryland; Delaware; that part of... boundary at the shoreline at the North Carolina-South Carolina border, point located at approximately 30°55...

National Register Historic Districts

Data.gov (United States)

Iowa State University GIS Support and Research Facility — The National Register Historic District layer is a shape file showing the boundaries of Historic Districts that are listed on the National Register of Historic Places.

The Partnership Pact: Fulfilling School Districts' Research Needs with University-District Partnerships

Science.gov (United States)

Ralston, Nicole; Weitzel, Bruce; Waggoner, Jacqueline; Naegele, Zulema; Smith, Rebecca

2016-01-01

There has been a recent shift in university-district partnership models from traditional transactional partnerships, which lack a shared purpose, to transformational partnerships that are mutually beneficial to both universities and school districts. These transformational research-practice partnerships have gained popularity in the United States…

District Fiscal Policy and Student Achievement

Directory of Open Access Journals (Sweden)

Gary G. Huang

2002-09-01

Full Text Available School restructuring raises questions about the role of school districts in improving student learning. Centralization by state governments and decentralization to individual schools as proposed in systemic reform leave districts' role unsettled. Empirical research on the district role in the context of ongoing reform is inadequate. This analysis of combined data from the NAEP and the Common Core of Data (CCD was intended to address the issue. We analyzed 1990, 1992, and 1996 NAEP 8th grade mathematics national assessment data in combination with CCD data of corresponding years to examine the extent to which student achievement was related to districts' control over instructional expenditure, adjusting for relevant key factors at both district and student levels. Upon sample modification, we used hierarchical linear modeling (HLM to estimate the relationships of student achievement to two district fiscal policy indictors, current expenditure per pupil (CEPP and districts' discretionary rates for instructional expenditure (DDR. Net of relevant district factors, DDR was found unrelated to districts' average 8th grade math performance. The null effect was consistent in the analysis of the combined NAEP-CCD data for 1990, 1992, and 1996. In contrast, CEPP was found related to higher math performance in a modest yet fairly consistent way. Future research may be productive to separately study individual states and integrate the findings onto the national level.

District Governance and Student Learning in Indonesia

OpenAIRE

Pradhan, Menno; de Ree, Joppe

2014-01-01

We document the likely importance of district governance and teacher management policies in relation to student learning in Indonesian primary schools. As the responsibility to deliver primary education has been decentralized to district governments, we expect district specific variations in teacher management policies. Consequently, we also expect variations in learning trajectories across districts. We document substantial heterogeneity in learning gains across districts. Furthermore, we sh...

Procedures for selecting and buying district heating equipment. Sofia district heating. Final report

Energy Technology Data Exchange (ETDEWEB)

NONE

1997-11-01

The aim of this Final Report, prepared for the project `Procedures for Selecting and Buying DistRict Heating Equipment - Sofia District Heating Company`, is to establish an overview of the activities accomplished, the outputs delivered and the general experience gained as a result of the project. The main objective of the project is to enable Sofia District Heating Company to prepare specifications and tender documents, identify possible suppliers, evaluate offers, etc. in connection with purchase of district heating equipment. This objective has been reached by using rehabilitation of sub-stations as an example requested by Sofia DH. The project was originally planned to be finalized end of 1995, but due to the extensions of the scope of work, the project has been prolonged until end 1997. The following main activities were accomplished: Preparation of a detailed work plan; Collection of background information; Discussion and advice about technical specifications and tender documents for sub-station rehabilitation; Input to terms of reference for a master plan study; Input to technical specification for heat meters; Collection of ideas for topics and examples related to dissemination of information to consumers about matters related to district heating consumption. (EG)

Políticas de reemplazo en la caché de web

Directory of Open Access Journals (Sweden)

Carlos Quesada Sánchez

2006-05-01

Full Text Available La web es el mecanismo de comunicación más utilizado en la actualidad debido a su flexibilidad y a la oferta casi interminable de herramientas para navegarla. Esto hace que día con día se agreguen alrededor de un millón de páginas en ella. De esta manera, es entonces la biblioteca más grande, con recursos textuales y de multimedia, que jamás se haya visto antes. Eso sí, es una biblioteca distribuida alrededor de todos los servidores que contienen esa información. Como fuente de consulta, es importante que la recuperación de los datos sea eficiente. Para ello existe el Web Caching, técnica mediante la cual se almacenan temporalmente algunos datos de la web en los servidores locales, de manera que no haya que pedirlos al servidor remoto cada vez que un usuario los solicita. Empero, la cantidad de memoria disponible en los servidores locales para almacenar esa información es limitada: hay que decidir cuáles objetos de la web se almacenan y cuáles no. Esto da pie a varias políticas de reemplazo que se explorarán en este artículo. Mediante un experimento de peticiones reales de la Web, compararemos el desempeño de estas técnicas.

76 FR 54730 - Rubicon Trail Easement, Eldorado National Forest, Pacific Ranger District

Science.gov (United States)

2011-09-02

... waters of the state, and address human waste management on the Rubicon Trail. Proposed Action The... through these low spots thereby accelerating trail erosion and sedimentation. In July 2004, the El Dorado... fecal waste littered around the Spider Lake area. The amount of fecal waste was determined to pose a...

Characteristics of uranium districts of the Russian Federation

International Nuclear Information System (INIS)

Boitsov, A.V.; Nikolsky, A.L.

2001-01-01

Uranium deposits are discovered in 15 ore districts of the Russian Federation. They are subdivided into four groups: Streltsovsky district with existing production centre, Stavropolsky district with depleted deposits, three prospective districts and ten reserve districts. The overview of new data on these districts is presented. Streltsovsky district with Priargunsky Production Centre include 19 molybdenum-uranium deposits of structure-bound volcanic type in caldera. The main activities in Stavropolsky district with two depleted uranium deposits are connected with restoration works and wastes rehabilitation. Except Streltsovsky district there are no more deposits in the Russian Federation prepared for uranium production. At the same time some uranium deposits of Vitimsky, Zauralsky, and West-Siberian districts are prospective for new development of production centres. They belong to the sandstone type, related to paleovalley or basal channel, and are suitable for ISL operation. The deposits of the other districts are considered to be reserve and considered unprofitable for uranium production at present and in the nearest future. The biggest of them is Aldansky district with gold-uranium deposits in potassium metasomatites in areas of Mesozoic activation of Archean cratons. Central Transbaikalsky, Yeniseisky, Yergeninsky, Onezhsky, Ladozhsky, Bureinsky, Khankaisky, Volgo-Uralsky reserve districts include mainly small-size deposits of vein, volcanic, surficial and metasomatite types with low uranium grades. (author)

Budget Stability, Revenue Volatility, and District Relations: Determinants of Georgia ELOST Distribution to Municipal School Districts

Science.gov (United States)

Reinagel, Tyler P.

2014-01-01

School districts across the United States are often forced into situations where limited public funds must be distributed among multiple districts. These are often reliant on distribution rates negotiated by district leadership and elected officials. An example of this is Georgia's 1% Education Local Option Sales Tax (ELOST). The tax is collected…

Data Rate Estimation for Wireless Core-to-Cache Communication in Multicore CPUs

Directory of Open Access Journals (Sweden)

M. Komar

2015-01-01

Full Text Available In this paper, a principal architecture of common purpose CPU and its main components are discussed, CPUs evolution is considered and drawbacks that prevent future CPU development are mentioned. Further, solutions proposed so far are addressed and a new CPU architecture is introduced. The proposed architecture is based on wireless cache access that enables a reliable interaction between cores in multicore CPUs using terahertz band, 0.1-10THz. The presented architecture addresses the scalability problem of existing processors and may potentially allow to scale them to tens of cores. As in-depth analysis of the applicability of the suggested architecture requires accurate prediction of traffic in current and next generations of processors, we consider a set of approaches for traffic estimation in modern CPUs discussing their benefits and drawbacks. The authors identify traffic measurements by using existing software tools as the most promising approach for traffic estimation, and they use Intel Performance Counter Monitor for this purpose. Three types of CPU loads are considered including two artificial tests and background system load. For each load type the amount of data transmitted through the L2-L3 interface is reported for various input parameters including the number of active cores and their dependences on the number of cores and operational frequency.

Utilization of Yard for Vegetable Hydroponics in Serut Village, Panti Sub-District, Jember District

OpenAIRE

dewanti, parawita

2018-01-01

Vegetables as a horticultural product is a food source that is always consumed by humans daily, including in urban areas. Assorted Vegetables can be eaten raw or processed and it takes as a decoration on the food. Needs vegetables including lettuce, green pakcoy and other vegetables from day to day continues to increase. Therefore, it needs supply of vegetables from the area around the town of Jember including Serut Village, District Panti Sub-District, Jember District. Serut village has the ...

Bottleneck analysis at district level to illustrate gaps within the district health system in Uganda

Science.gov (United States)

Kiwanuka Henriksson, Dorcus; Fredriksson, Mio; Waiswa, Peter; Selling, Katarina; Swartling Peterson, Stefan

2017-01-01

ABSTRACT Background: Poor quality of care and access to effective and affordable interventions have been attributed to constraints and bottlenecks within and outside the health system. However, there is limited understanding of health system barriers to utilization and delivery of appropriate, high-impact, and cost-effective interventions at the point of service delivery in districts and sub-districts in low-income countries. In this study we illustrate the use of the bottleneck analysis approach, which could be used to identify bottlenecks in service delivery within the district health system. Methods: A modified Tanahashi model with six determinants for effective coverage was used to determine bottlenecks in service provision for maternal and newborn care. The following interventions provided during antenatal care were used as tracer interventions: use of iron and folic acid, intermittent presumptive treatment for malaria, HIV counseling and testing, and syphilis testing. Data from cross-sectional household and health facility surveys in Mayuge and Namayingo districts in Uganda were used in this study. Results: Effective coverage and human resource gaps were identified as the biggest bottlenecks in both districts, with coverage ranging from 0% to 66% for effective coverage and from 46% to 58% for availability of health facility staff. Our findings revealed a similar pattern in bottlenecks in both districts for particular interventions although the districts are functionally independent. Conclusion: The modified Tanahashi model is an analysis tool that can be used to identify bottlenecks to effective coverage within the district health system, for instance, the effective coverage for maternal and newborn care interventions. However, the analysis is highly dependent on the availability of data to populate all six determinants and could benefit from further validation analysis for the causes of bottlenecks identified. PMID:28581379

7 CFR 982.31 - Grower districts.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Grower districts. 982.31 Section 982.31 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements... importance of production in each district and the number of growers in each district; (2) the geographic...

Conflict Management in Declining School Districts.

Science.gov (United States)

Boyd, William Lowe; Wheaton, Dennis R.

1983-01-01

Professional literature about managing conflicts associated with declining enrollments indicates the existing tension in this area. A research study shows that, while upper-middle class districts may succeed using a rational approach to decision making, lower class districts, for various reasons, may not. Special problems of urban districts are…

Adsorption properties of the soils of the Ranger uranium mine land application area for solutes in water from Retention Pond 2

International Nuclear Information System (INIS)

Willett, I.R.; Bond, W.J.

1992-01-01

The research reported here aimed to describe the adsorption properties of the soils of Ranger's irrigation area for important constituents of RP2 water. Three kinds of experiments were conducted. For the major ions (Na + , Mg 2+ , Ca 2+ , K + , SO 4 2-, and Cl - ) measurements were made of cation and anion exchange capacities. For the minor solutes (MN 2+ , U 238 , and Ra 226 ) which undergo more specific, inner-sphere reactions with soil surfaces, the retention capacities were determined by batch adsorption isotherm methods. Lastly, column experiments were conducted to determine whether the soils could retain U 238 , Ra 226 and Pb 210 when the quantities of each radionuclide were applied in much greater quantities than was possible in the batch adsorption studies, or during the field experiment described earlier at this Workshop (Bond and Willett 1992). It was aimed to obtain information on the retention capacity of the three main soil types of the irrigation area; Unit I, II and III, respectively red earths, yellow earths and siliceous sands, in relation to soil pH. 7 refs., 4 tabs., 13 figs

Differences in Food and Beverage Marketing Policies and Practices in US School Districts, by Demographic Characteristics of School Districts, 2012.

Science.gov (United States)

Merlo, Caitlin L; Michael, Shannon; Brener, Nancy D; Coffield, Edward; Kingsley, Beverly S; Zytnick, Deena; Blanck, Heidi

2016-12-15

Foods and beverages marketed in schools are typically of poor nutritional value. School districts may adopt policies and practices to restrict marketing of unhealthful foods and to promote healthful choices. Students' exposure to marketing practices differ by school demographics, but these differences have not yet been examined by district characteristics. We analyzed data from the 2012 School Health Policies and Practices Study to examine how food and beverage marketing and promotion policies and practices varied by district characteristics such as metropolitan status, size, and percentage of non-Hispanic white students. Most practices varied significantly by district size: a higher percentage of large districts than small or medium-sized districts restricted marketing of unhealthful foods and promoted healthful options. Compared with districts whose student populations were majority (>50%) non-Hispanic white, a higher percentage of districts whose student populations were minority non-Hispanic white (≤50% non-Hispanic white) prohibited advertising of soft drinks in school buildings and on school grounds, made school meal menus available to students, and provided families with information on school nutrition programs. Compared with suburban and rural districts, a higher percentage of urban districts prohibited the sale of soft drinks on school grounds and used several practices to promote healthful options. Preliminary findings showing significant associations between district demographics and marketing policies and practices can be used to help states direct resources, training, and technical assistance to address food and beverage marketing and promotion to districts most in need of improvement.

Jordan Lake Watershed Protection District

Data.gov (United States)

Town of Chapel Hill, North Carolina — Polygon representing the area of the Jordan Lake Watershed Protection District. The Watershed Protection District (PDF) is a sensitive area of land that drains to...

VT Data - Overlay District 20170710, South Burlington

Data.gov (United States)

Vermont Center for Geographic Information — Overlay data for the City of South Burlington included in this data:Flood Plain Overlay DistrictTraffic Overlay DistrictInterstate Highway Overlay DistrictScenic...

Differences in Food and Beverage Marketing Policies and Practices in US School Districts, by Demographic Characteristics of School Districts, 2012

Science.gov (United States)

Michael, Shannon; Brener, Nancy D.; Coffield, Edward; Kingsley, Beverly S.; Zytnick, Deena; Blanck, Heidi

2016-01-01

Introduction Foods and beverages marketed in schools are typically of poor nutritional value. School districts may adopt policies and practices to restrict marketing of unhealthful foods and to promote healthful choices. Students’ exposure to marketing practices differ by school demographics, but these differences have not yet been examined by district characteristics. Methods We analyzed data from the 2012 School Health Policies and Practices Study to examine how food and beverage marketing and promotion policies and practices varied by district characteristics such as metropolitan status, size, and percentage of non-Hispanic white students. Results Most practices varied significantly by district size: a higher percentage of large districts than small or medium-sized districts restricted marketing of unhealthful foods and promoted healthful options. Compared with districts whose student populations were majority (>50%) non-Hispanic white, a higher percentage of districts whose student populations were minority non-Hispanic white (≤50% non-Hispanic white) prohibited advertising of soft drinks in school buildings and on school grounds, made school meal menus available to students, and provided families with information on school nutrition programs. Compared with suburban and rural districts, a higher percentage of urban districts prohibited the sale of soft drinks on school grounds and used several practices to promote healthful options. Conclusion Preliminary findings showing significant associations between district demographics and marketing policies and practices can be used to help states direct resources, training, and technical assistance to address food and beverage marketing and promotion to districts most in need of improvement. PMID:27978408

Accountability in district nursing practice: key concepts.

Science.gov (United States)

Griffith, Richard

2015-03-01

Public trust and confidence in district nurses is essential to the nurse-patient relationship that underpins effective care and treatment. That trust and confidence has even greater focus for district nurses who care for patients in their own homes. Those patients need to be able to count on the professionalism and probity of their district nurses. The professionalism and probity of district nurses is based on their accountability, which protects the public by imposing standards on district nurses and holds them answerable for their acts and omissions. This is the first of a series of articles on accountability in district nursing practice to mark the introduction of the revised Nursing and Midwifery Code on the 31 March 2015. This month's article considers the key concepts of accountability.

75 FR 43958 - Turlock Irrigation District and Modesto Irrigation District; Notice of Application for Amendment...

Science.gov (United States)

2010-07-27

... to the Turlock Irrigation District's Tuolumne Substation; (2) 23-mile-long, 69-kV Don Pedro-Hawkins Line extending from the Don Pedro switchyard to the Turlock Irrigation District's Hawkins Substation...

School District Cash Management. Program Audit.

Science.gov (United States)

New York State Legislative Commission on Expenditure Review, Albany.

New York State law permits school districts to invest cash not immediately needed for district operation and also specifies the kinds of investments that may be made in order to ensure the safety and liquidity of public funds. This audit examines cash management and investment practices in New York state's financially independent school districts.…

Reading a District Budget: Reporter Guide

Science.gov (United States)

McNeil, Michele

2013-01-01

Every school budget tells a story--about a district's spending plan, its priorities, goals, and financial health. The challenge is to wade through the jargon and numbers to unlock that story. Although budgets can vary significantly from district to district, and state to state, this primer seeks to introduce reporters to the fundamental components…

Interim district energy implementation

Energy Technology Data Exchange (ETDEWEB)

Fearnley, R.; Susak, W. [City of Vancouver, BC (Canada); Johnstone, I. [BCG Services Inc., Vancouver, BC (Canada)

2001-07-01

The concept of district energy was introduced in the City of North Vancouver, a city of 45,000, in 1997. A preliminary study was completed in 1997, followed by a tour of some district energy facilities in Finland in the same year. In 1999 a large district energy study was completed by a consultant. The study indicated the need for an investment of $15 million to implement district heating in the City. Lack of sufficient financial resources and immediately connectable heat load, the project was considered a non-starter. Some of the other factors leading to shelving the project included no current significant pricing advantages over competing energy sources and no current opportunity for cogeneration, given the low price that BC Hydro is willing to pay for independently produced power. The project, although shelved for the moment, has not been discarded. Planning and exploration are continuing, aided by the City's commitment to energy efficiency and conservation, its long term planning horizon and its significant influence over the development of some prime real estate.

Regional District Attorney's Offices - Alaska Department of Law

Science.gov (United States)

District Stephen B. Wallace, District Attorney Physical Address: 204 Chief Eddie Hoffman Hwy. Bethel, AK Hours M-TH 8-4:30, F 8-12 Kenai - 3rd Judicial District Scot H. Leaders, District Attorney Trading Bay

Energy supply and urban planning projects: Analysing tensions around district heating provision in a French eco-district

International Nuclear Information System (INIS)

Gabillet, Pauline

2015-01-01

Through the analysis of energy supply choices, this article explores the way in which energy priorities and their climate-related features are incorporated into urban public policy. These choices must take account of different factors, as is the case with district heating, which is justified as a vehicle of renewable energy while subject to pressure in eco-districts because its techno-economic balances are destabilised by falls in demand. Our study focuses particularly on the city of Metz (France), which has chosen district heating as the primary source for provision for the municipal area and for its first eco-district. We analyse the tensions within these choices, with particular attention to the way in which they are negotiated inside municipal departments and with the local energy operator. This enables us to explore the tensions in defining the scale that governs decisions and the linkages between energy-related and urban priorities. - Highlights: • Analyses of tensions in the choice of energy supplies for eco-districts. •District heating networks can be vehicles of renewable energy. • District heating networks are threatened by drops in energy consumption. • Energy supply issues oppose urban planning and energy policy in municipal departments. • Technical and financial adjustments can be made by the municipality to justify its energy choices