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

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...

Secure Service Proxy: A CoAP(s) Intermediary for a Securer and Smarter Web of Things.

Science.gov (United States)

Van den Abeele, Floris; Moerman, Ingrid; Demeester, Piet; Hoebeke, Jeroen

2017-07-11

As the IoT continues to grow over the coming years, resource-constrained devices and networks will see an increase in traffic as everything is connected in an open Web of Things. The performance- and function-enhancing features are difficult to provide in resource-constrained environments, but will gain importance if the WoT is to be scaled up successfully. For example, scalable open standards-based authentication and authorization will be important to manage access to the limited resources of constrained devices and networks. Additionally, features such as caching and virtualization may help further reduce the load on these constrained systems. This work presents the Secure Service Proxy (SSP): a constrained-network edge proxy with the goal of improving the performance and functionality of constrained RESTful environments. Our evaluations show that the proposed design reaches its goal by reducing the load on constrained devices while implementing a wide range of features as different adapters. Specifically, the results show that the SSP leads to significant savings in processing, network traffic, network delay and packet loss rates for constrained devices. As a result, the SSP helps to guarantee the proper operation of constrained networks as these networks form an ever-expanding Web of Things.

Secure Service Proxy: A CoAP(s Intermediary for a Securer and Smarter Web of Things

Directory of Open Access Journals (Sweden)

Floris Van den Abeele

2017-07-01

Full Text Available As the IoT continues to grow over the coming years, resource-constrained devices and networks will see an increase in traffic as everything is connected in an open Web of Things. The performance- and function-enhancing features are difficult to provide in resource-constrained environments, but will gain importance if the WoT is to be scaled up successfully. For example, scalable open standards-based authentication and authorization will be important to manage access to the limited resources of constrained devices and networks. Additionally, features such as caching and virtualization may help further reduce the load on these constrained systems. This work presents the Secure Service Proxy (SSP: a constrained-network edge proxy with the goal of improving the performance and functionality of constrained RESTful environments. Our evaluations show that the proposed design reaches its goal by reducing the load on constrained devices while implementing a wide range of features as different adapters. Specifically, the results show that the SSP leads to significant savings in processing, network traffic, network delay and packet loss rates for constrained devices. As a result, the SSP helps to guarantee the proper operation of constrained networks as these networks form an ever-expanding Web of Things.

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.

CORAL Server and CORAL Server Proxy: Scalable Access to Relational Databases from CORAL Applications

CERN Document Server

Valassi, A; Kalkhof, A; Salnikov, A; Wache, M

2011-01-01

The CORAL software is widely used at CERN for accessing the data stored by the LHC experiments using relational database technologies. CORAL provides a C++ abstraction layer that supports data persistency for several backends and deployment models, including local access to SQLite files, direct client access to Oracle and MySQL servers, and read-only access to Oracle through the FroNTier web server and cache. Two new components have recently been added to CORAL to implement a model involving a middle tier "CORAL server" deployed close to the database and a tree of "CORAL server proxy" instances, with data caching and multiplexing functionalities, deployed close to the client. The new components are meant to provide advantages for read-only and read-write data access, in both offline and online use cases, in the areas of scalability and performance (multiplexing for several incoming connections, optional data caching) and security (authentication via proxy certificates). A first implementation of the two new c...

SIDECACHE: Information access, management and dissemination framework for web services.

Science.gov (United States)

Doderer, Mark S; Burkhardt, Cory; Robbins, Kay A

2011-06-14

Many bioinformatics algorithms and data sets are deployed using web services so that the results can be explored via the Internet and easily integrated into other tools and services. These services often include data from other sites that is accessed either dynamically or through file downloads. Developers of these services face several problems because of the dynamic nature of the information from the upstream services. Many publicly available repositories of bioinformatics data frequently update their information. When such an update occurs, the developers of the downstream service may also need to update. For file downloads, this process is typically performed manually followed by web service restart. Requests for information obtained by dynamic access of upstream sources is sometimes subject to rate restrictions. SideCache provides a framework for deploying web services that integrate information extracted from other databases and from web sources that are periodically updated. This situation occurs frequently in biotechnology where new information is being continuously generated and the latest information is important. SideCache provides several types of services including proxy access and rate control, local caching, and automatic web service updating. We have used the SideCache framework to automate the deployment and updating of a number of bioinformatics web services and tools that extract information from remote primary sources such as NCBI, NCIBI, and Ensembl. The SideCache framework also has been used to share research results through the use of a SideCache derived web service.

Adaptive proxy map server for efficient vector spatial data rendering

Science.gov (United States)

Sayar, Ahmet

2013-01-01

The rapid transmission of vector map data over the Internet is becoming a bottleneck of spatial data delivery and visualization in web-based environment because of increasing data amount and limited network bandwidth. In order to improve both the transmission and rendering performances of vector spatial data over the Internet, we propose a proxy map server enabling parallel vector data fetching as well as caching to improve the performance of web-based map servers in a dynamic environment. Proxy map server is placed seamlessly anywhere between the client and the final services, intercepting users' requests. It employs an efficient parallelization technique based on spatial proximity and data density in case distributed replica exists for the same spatial data. The effectiveness of the proposed technique is proved at the end of the article by the application of creating map images enriched with earthquake seismic data records.

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.

Sincronización de estadísticas entre servidores y proxies

OpenAIRE

Catullo, María José

1999-01-01

Un caching proxy server colecciona todas las páginas que pasan a través de él, así cuando un usuario pregunta por una página, el proxy server, si la tiene, la retoma de su cache, sin necesidad de acceder al servidor real. De ésta manera se ahorra ancho de banda y se agilizan las respuestas. Cada requerimiento que arriba a un proxy ó a un servidor, se almacena en archivos de logs. Existen varios tipos de archivos de logs, que se utilizan para auditoría del rendimiento, monitoreo, control de...

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.

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.

Application and Network-Cognizant Proxies - Final Report

Energy Technology Data Exchange (ETDEWEB)

Antonio Ortega; Daniel C. Lee

2003-03-24

OAK B264 Application and Network-Cognizant Proxies - Final Report. Current networks show increasing heterogeneity both in terms of their bandwidths/delays and the applications they are required to support. This is a trend that is likely to intensify in the future, as real-time services, such as video, become more widely available and networking access over wireless links becomes more widespread. For this reason they propose that application-specific proxies, intermediate network nodes that broker the interactions between server and client, will become an increasingly important network element. These proxies will allow adaptation to changes in network characteristics without requiring a direct intervention of either server or client. Moreover, it will be possible to locate these proxies strategically at those points where a mismatch occurs between subdomains (for example, a proxy could be placed so as to act as a bridge between a reliable network domain and an unreliable one). This design philosophy favors scalability in the sense that the basic network infrastructure can remain unchanged while new functionality can be added to proxies, as required by the applications. While proxies can perform numerous generic functions, such as caching or security, they concentrate here on media-specific, and in particular video-specific, tasks. The goal of this project was to demonstrate that application- and network-specific knowledge at a proxy can improve overall performance especially under changing network conditions. They summarize below the work performed to address these issues. Particular effort was spent in studying caching techniques and on video classification to enable DiffServ delivery. other work included analysis of traffic characteristics, optimized media scheduling, coding techniques based on multiple description coding, and use of proxies to reduce computation costs. This work covered much of what was originally proposed but with a necessarily reduced scope.

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...

Development of Virtual Resource Based IoT Proxy for Bridging Heterogeneous Web Services in IoT Networks

Directory of Open Access Journals (Sweden)

Wenquan Jin

2018-05-01

Full Text Available The Internet of Things is comprised of heterogeneous devices, applications, and platforms using multiple communication technologies to connect the Internet for providing seamless services ubiquitously. With the requirement of developing Internet of Things products, many protocols, program libraries, frameworks, and standard specifications have been proposed. Therefore, providing a consistent interface to access services from those environments is difficult. Moreover, bridging the existing web services to sensor and actuator networks is also important for providing Internet of Things services in various industry domains. In this paper, an Internet of Things proxy is proposed that is based on virtual resources to bridge heterogeneous web services from the Internet to the Internet of Things network. The proxy enables clients to have transparent access to Internet of Things devices and web services in the network. The proxy is comprised of server and client to forward messages for different communication environments using the virtual resources which include the server for the message sender and the client for the message receiver. We design the proxy for the Open Connectivity Foundation network where the virtual resources are discovered by the clients as Open Connectivity Foundation resources. The virtual resources represent the resources which expose services in the Internet by web service providers. Although the services are provided by web service providers from the Internet, the client can access services using the consistent communication protocol in the Open Connectivity Foundation network. For discovering the resources to access services, the client also uses the consistent discovery interface to discover the Open Connectivity Foundation devices and virtual resources.

Development of Virtual Resource Based IoT Proxy for Bridging Heterogeneous Web Services in IoT Networks.

Science.gov (United States)

Jin, Wenquan; Kim, DoHyeun

2018-05-26

The Internet of Things is comprised of heterogeneous devices, applications, and platforms using multiple communication technologies to connect the Internet for providing seamless services ubiquitously. With the requirement of developing Internet of Things products, many protocols, program libraries, frameworks, and standard specifications have been proposed. Therefore, providing a consistent interface to access services from those environments is difficult. Moreover, bridging the existing web services to sensor and actuator networks is also important for providing Internet of Things services in various industry domains. In this paper, an Internet of Things proxy is proposed that is based on virtual resources to bridge heterogeneous web services from the Internet to the Internet of Things network. The proxy enables clients to have transparent access to Internet of Things devices and web services in the network. The proxy is comprised of server and client to forward messages for different communication environments using the virtual resources which include the server for the message sender and the client for the message receiver. We design the proxy for the Open Connectivity Foundation network where the virtual resources are discovered by the clients as Open Connectivity Foundation resources. The virtual resources represent the resources which expose services in the Internet by web service providers. Although the services are provided by web service providers from the Internet, the client can access services using the consistent communication protocol in the Open Connectivity Foundation network. For discovering the resources to access services, the client also uses the consistent discovery interface to discover the Open Connectivity Foundation devices and virtual resources.

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.

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...

A Technique to Speedup Access to Web Contents

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 7; Issue 7. Web Caching - A Technique to Speedup Access to Web Contents. Harsha Srinath Shiva Shankar Ramanna. General Article Volume 7 Issue 7 July 2002 pp 54-62 ... Keywords. World wide web; data caching; internet traffic; web page access.

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.

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.

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.

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.

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)....

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.

Going, going, still there: using the WebCite service to permanently archive cited web pages.

Science.gov (United States)

Eysenbach, Gunther; Trudel, Mathieu

2005-12-30

Scholars are increasingly citing electronic "web references" which are not preserved in libraries or full text archives. WebCite is a new standard for citing web references. To "webcite" a document involves archiving the cited Web page through www.webcitation.org and citing the WebCite permalink instead of (or in addition to) the unstable live Web page. This journal has amended its "instructions for authors" accordingly, asking authors to archive cited Web pages before submitting a manuscript. Almost 200 other journals are already using the system. We discuss the rationale for WebCite, its technology, and how scholars, editors, and publishers can benefit from the service. Citing scholars initiate an archiving process of all cited Web references, ideally before they submit a manuscript. Authors of online documents and websites which are expected to be cited by others can ensure that their work is permanently available by creating an archived copy using WebCite and providing the citation information including the WebCite link on their Web document(s). Editors should ask their authors to cache all cited Web addresses (Uniform Resource Locators, or URLs) "prospectively" before submitting their manuscripts to their journal. Editors and publishers should also instruct their copyeditors to cache cited Web material if the author has not done so already. Finally, WebCite can process publisher submitted "citing articles" (submitted for example as eXtensible Markup Language [XML] documents) to automatically archive all cited Web pages shortly before or on publication. Finally, WebCite can act as a focussed crawler, caching retrospectively references of already published articles. Copyright issues are addressed by honouring respective Internet standards (robot exclusion files, no-cache and no-archive tags). Long-term preservation is ensured by agreements with libraries and digital preservation organizations. The resulting WebCite Index may also have applications for research

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...

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...

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.

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.

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.

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...

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...

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....

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.

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...

Snippet-based relevance predictions for federated web search

NARCIS (Netherlands)

Demeester, Thomas; Nguyen, Dong-Phuong; Trieschnigg, Rudolf Berend; Develder, Chris; Hiemstra, Djoerd

How well can the relevance of a page be predicted, purely based on snippets? This would be highly useful in a Federated Web Search setting where caching large amounts of result snippets is more feasible than caching entire pages. The experiments reported in this paper make use of result snippets and

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...

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...

Perbandingan proxy pada linux dan windows untuk mempercepat browsing website

Directory of Open Access Journals (Sweden)

Dafwen Toresa

2017-05-01

Full Text Available AbstrakPada saat ini sangat banyak organisasi, baik pendidikan, pemerintahan,  maupun perusahaan swasta berusaha membatasi akses para pengguna ke internet dengan alasan bandwidth yang dimiliki mulai terasa lambat ketika para penggunanya mulai banyak yang melakukan browsing ke internet. Mempercepat akses browsing menjadi perhatian utama dengan memanfaatkan teknologi Proxy server. Penggunaan proxy server perlu mempertimbangkan sistem operasi pada server dan tool yang digunakan belum diketahui performansi terbaiknya pada sistem operasi apa.  Untuk itu dirasa perlu untuk menganalisis performan Proxy server pada sistem operasi berbeda yaitu Sistem Operasi Linux dengan tools Squid  dan Sistem Operasi Windows dengan tool Winroute. Kajian ini dilakukan untuk mengetahui perbandingan kecepatan browsing dari komputer pengguna (client. Browser yang digunakan di komputer pengguna adalah Mozilla Firefox. Penelitian ini menggunakan 2 komputer klien dengan pengujian masing-masingnya 5 kali pengujian pengaksesan/browsing web yang dituju melalui proxy server. Dari hasil pengujian yang dilakukan, diperoleh kesimpulan bahwa penerapan proxy server di sistem operasi linux dengan tools squid lebih cepat browsing dari klien menggunakan web browser yang sama dan komputer klien yang berbeda dari pada proxy server sistem operasi windows dengan tools winroute.  Kata kunci: Proxy, Bandwidth, Browsing, Squid, Winroute AbstractAt this time very many organizations, both education, government, and private companies try to limit the access of users to the internet on the grounds that the bandwidth owned began to feel slow when the users began to do a lot of browsing to the internet. Speed up browsing access is a major concern by utilizing Proxy server technology. The use of proxy servers need to consider the operating system on the server and the tool used is not yet known the best performance on what operating system. For that it is necessary to analyze Performance Proxy

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

Analisa Pemanfaatan Proxy Server Sebagai Media Filtering Dan Caching Pada Jaringan Komputer

OpenAIRE

-, Yuisar; Yulianti, Liza; H, Yanolanda Suzantri

2015-01-01

This research aims to Implement control and safe use of the internet at an agency with a utilization fee seminal may use the Linux operating system Ubuntu 14:04. Bandwidth division according to the time of busy servers and Internet client. To quick opening for the second time and so on. Blocking sites - porn site that tends to contain spyware. Accelerate video audio streaming. This study uses experimental research. In this study conducted experiments on the performance of the proxy server tha...

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.

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.

Data Cleaning Methods for Client and Proxy Logs

NARCIS (Netherlands)

Weinreich, H.; Obendorf, H.; Herder, E.; Edmonds, A.; Hawkey, K.; Kellar, M.; Turnbull, D.

2006-01-01

In this paper we present our experiences with the cleaning of Web client and proxy usage logs, based on a long-term browsing study with 25 participants. A detailed clickstream log, recorded using a Web intermediary, was combined with a second log of user interface actions, which was captured by a

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.

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.

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...

Legal Aspects of the Web.

Science.gov (United States)

Borrull, Alexandre Lopez; Oppenheim, Charles

2004-01-01

Presents a literature review that covers the following topics related to legal aspects of the Web: copyright; domain names and trademarks; linking, framing, caching, and spamdexing; patents; pornography and censorship on the Internet; defamation; liability; conflict of laws and jurisdiction; legal deposit; and spam, i.e., unsolicited mails.…

Professional JavaScript for Web Developers

CERN Document Server

Zakas, Nicholas C

2011-01-01

A significant update to a bestselling JavaScript book As the key scripting language for the web, JavaScript is supported by every modern web browser and allows developers to create client-side scripts that take advantage of features such as animating the canvas tag and enabling client-side storage and application caches. After an in-depth introduction to the JavaScript language, this updated edition of a bestseller progresses to break down how JavaScript is applied for web development using the latest web development technologies. Veteran author and JavaScript guru Nicholas Zakas shows how Jav

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...

Private Web Browsing

National Research Council Canada - National Science Library

Syverson, Paul F; Reed, Michael G; Goldschlag, David M

1997-01-01

.... These are both kept confidential from network elements as well as external observers. Private Web browsing is achieved by unmodified Web browsers using anonymous connections by means of HTTP proxies...

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.

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...

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.

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.

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...

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.

Frontier: High Performance Database Access Using Standard Web Components in a Scalable Multi-Tier Architecture

International Nuclear Information System (INIS)

Kosyakov, S.; Kowalkowski, J.; Litvintsev, D.; Lueking, L.; Paterno, M.; White, S.P.; Autio, Lauri; Blumenfeld, B.; Maksimovic, P.; Mathis, M.

2004-01-01

A high performance system has been assembled using standard web components to deliver database information to a large number of broadly distributed clients. The CDF Experiment at Fermilab is establishing processing centers around the world imposing a high demand on their database repository. For delivering read-only data, such as calibrations, trigger information, and run conditions data, we have abstracted the interface that clients use to retrieve data objects. A middle tier is deployed that translates client requests into database specific queries and returns the data to the client as XML datagrams. The database connection management, request translation, and data encoding are accomplished in servlets running under Tomcat. Squid Proxy caching layers are deployed near the Tomcat servers, as well as close to the clients, to significantly reduce the load on the database and provide a scalable deployment model. Details the system's construction and use are presented, including its architecture, design, interfaces, administration, performance measurements, and deployment plan

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...

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....

JWIG: Yet Another Framework for Maintainable and Secure Web Applications

DEFF Research Database (Denmark)

Møller, Anders; Schwarz, Mathias Romme

2009-01-01

Although numerous frameworks for web application programming have been developed in recent years, writing web applications remains a challenging task. Guided by a collection of classical design principles, we propose yet another framework. It is based on a simple but flexible server......-oriented architecture that coherently supports general aspects of modern web applications, including dynamic XML construction, session management, data persistence, caching, and authentication, but it also simplifies programming of server-push communication and integration of XHTML-based applications and XML-based web...... services.The resulting framework provides a novel foundation for developing maintainable and secure web applications....

Enhancing the AliEn Web Service Authentication

International Nuclear Information System (INIS)

Zhu Jianlin; Zhou Daicui; Zhang Guoping; Saiz, Pablo; Carminati, Federico; Betev, Latchezar; Lorenzo, Patricia Mendez; Grigoras, Alina Gabriela; Grigoras, Costin; Furano, Fabrizio; Schreiner, Steffen; Datskova, Olga Vladimirovna; Banerjee, Subho Sankar

2011-01-01

Web Services are an XML based technology that allow applications to communicate with each other across disparate systems. Web Services are becoming the de facto standard that enable inter operability between heterogeneous processes and systems. AliEn2 is a grid environment based on web services. The AliEn2 services can be divided in three categories: Central services, deployed once per organization; Site services, deployed on each of the participating centers; Job Agents running on the worker nodes automatically. A security model to protect these services is essential for the whole system. Current implementations of web server, such as Apache, are not suitable to be used within the grid environment. Apache with the mod s sl and OpenSSL only supports the X.509 certificates. But in the grid environment, the common credential is the proxy certificate for the purpose of providing restricted proxy and delegation. An Authentication framework was taken for AliEn2 web services to add the ability to accept X.509 certificates and proxy certificates from client-side to Apache Web Server. The authentication framework could also allow the generation of access control policies to limit access to the AliEn2 web services.

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.

Architecting Web Sites for High Performance

Directory of Open Access Journals (Sweden)

Arun Iyengar

2002-01-01

Full Text Available Web site applications are some of the most challenging high-performance applications currently being developed and deployed. The challenges emerge from the specific combination of high variability in workload characteristics and of high performance demands regarding the service level, scalability, availability, and costs. In recent years, a large body of research has addressed the Web site application domain, and a host of innovative software and hardware solutions have been proposed and deployed. This paper is an overview of recent solutions concerning the architectures and the software infrastructures used in building Web site applications. The presentation emphasizes three of the main functions in a complex Web site: the processing of client requests, the control of service levels, and the interaction with remote network caches.

Using caching and optimization techniques to improve performance of the Ensembl website

Directory of Open Access Journals (Sweden)

Smith James A

2010-05-01

Full Text Available Abstract Background The Ensembl web site has provided access to genomic information for almost 10 years. During this time the amount of data available through Ensembl has grown dramatically. At the same time, the World Wide Web itself has become a dramatically more important component of the scientific workflow and the way that scientists share and access data and scientific information. Since 2000, the Ensembl web interface has had three major updates and numerous smaller updates. These have largely been in response to expanding data types and valuable representations of existing data types. In 2007 it was realised that a radical new approach would be required in order to serve the project's future requirements, and development therefore focused on identifying suitable web technologies for implementation in the 2008 site redesign. Results By comparing the Ensembl website to well-known "Web 2.0" sites, we were able to identify two main areas in which cutting-edge technologies could be advantageously deployed: server efficiency and interface latency. We then evaluated the performance of the existing site using browser-based tools and Apache benchmarking, and selected appropriate technologies to overcome any issues found. Solutions included optimization of the Apache web server, introduction of caching technologies and widespread implementation of AJAX code. These improvements were successfully deployed on the Ensembl website in late 2008 and early 2009. Conclusions Web 2.0 technologies provide a flexible and efficient way to access the terabytes of data now available from Ensembl, enhancing the user experience through improved website responsiveness and a rich, interactive interface.

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.

gLExec and MyProxy integration in the ATLAS/OSG PanDA workload management system

International Nuclear Information System (INIS)

Caballero, J; Hover, J; Maeno, T; Potekhin, M; Wenaus, T; Zhao, X; Litmaath, M; Nilsson, P

2010-01-01

Worker nodes on the grid exhibit great diversity, making it difficult to offer uniform processing resources. A pilot job architecture, which probes the environment on the remote worker node before pulling down a payload job, can help. Pilot jobs become smart wrappers, preparing an appropriate environment for job execution and providing logging and monitoring capabilities. PanDA (Production and Distributed Analysis), an ATLAS and OSG workload management system, follows this design. However, in the simplest (and most efficient) pilot submission approach of identical pilots carrying the same identifying grid proxy, end-user accounting by the site can only be done with application-level information (PanDA maintains its own end-user accounting), and end-user jobs run with the identity and privileges of the proxy carried by the pilots, which may be seen as a security risk. To address these issues, we have enabled PanDA to use gLExec, a tool provided by EGEE which runs payload jobs under an end-user's identity. End-user proxies are pre-staged in a credential caching service, MyProxy, and the information needed by the pilots to access them is stored in the PanDA DB. gLExec then extracts from the user's proxy the proper identity under which to run. We describe the deployment, installation, and configuration of gLExec, and how PanDA components have been augmented to use it. We describe how difficulties were overcome, and how security risks have been mitigated. Results are presented from OSG and EGEE Grid environments performing ATLAS analysis using PanDA and gLExec.

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.

Delivering Electronic Resources with Web OPACs and Other Web-based Tools: Needs of Reference Librarians.

Science.gov (United States)

Bordeianu, Sever; Carter, Christina E.; Dennis, Nancy K.

2000-01-01

Describes Web-based online public access catalogs (Web OPACs) and other Web-based tools as gateway methods for providing access to library collections. Addresses solutions for overcoming barriers to information, such as through the implementation of proxy servers and other authentication tools for remote users. (Contains 18 references.)…

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...

Operational Use of OGC Web Services at the Met Office

Science.gov (United States)

Wright, Bruce

2010-05-01

The Met Office has adopted the Service-Orientated Architecture paradigm to deliver services to a range of customers through Rich Internet Applications (RIAs). The approach uses standard Open Geospatial Consortium (OGC) web services to provide information to web-based applications through a range of generic data services. "Invent", the Met Office beta site, is used to showcase Met Office future plans for presenting web-based weather forecasts, product and information to the public. This currently hosts a freely accessible Weather Map Viewer, written in JavaScript, which accesses a Web Map Service (WMS), to deliver innovative web-based visualizations of weather and its potential impacts to the public. The intention is to engage the public in the development of new web-based services that more accurately meet their needs. As the service is intended for public use within the UK, it has been designed to support a user base of 5 million, the analysed level of UK web traffic reaching the Met Office's public weather information site. The required scalability has been realised through the use of multi-tier tile caching: - WMS requests are made for 256x256 tiles for fixed areas and zoom levels; - a Tile Cache, developed in house, efficiently serves tiles on demand, managing WMS request for the new tiles; - Edge Servers, externally hosted by Akamai, provide a highly scalable (UK-centric) service for pre-cached tiles, passing new requests to the Tile Cache; - the Invent Weather Map Viewer uses the Google Maps API to request tiles from Edge Servers. (We would expect to make use of the Web Map Tiling Service, when it becomes an OGC standard.) The Met Office delivers specialist commercial products to market sectors such as transport, utilities and defence, which exploit a Web Feature Service (WFS) for data relating forecasts and observations to specific geographic features, and a Web Coverage Service (WCS) for sub-selections of gridded data. These are locally rendered as maps or

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.

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

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.

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

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...

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.

Programming Algorithms of load balancing with HA-Proxy in HTTP services

Directory of Open Access Journals (Sweden)

José Teodoro Mejía Viteri

2018-02-01

Full Text Available The access to the public and private services through the web gains daily protagonism, and sometimes they must support amounts of requests that a team can not process, so there are solutions that use algorithms that allow to distribute the load of requests of a web application in several equipment; the objective of this work is to perform an analysis of load balancing scheduling algorithms through the HA-Proxy tool, and deliver an instrument that identifies the load distribution algorithm to be used and the technological infrastructure, to largely cover implementation. The information used for this work is based on a bibliographic analysis, eld study and implementation of the different load balancing algorithms in equipment, where the distribution and its performance will be analyzed. The incorporation of this technology to the management of services on the web, improves availability, helps business continuity and through the different forms of distribution of the requests of the algorithms that can be implemented in HA-Proxy to provide those responsible for information technology systems with a view of their advantages and disadvantages.

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.

CORAL Server and CORAL Server Proxy: Scalable Access to Relational Databases from CORAL Applications

International Nuclear Information System (INIS)

Valassi, A; Kalkhof, A; Bartoldus, R; Salnikov, A; Wache, M

2011-01-01

The CORAL software is widely used at CERN by the LHC experiments to access the data they store on relational databases, such as Oracle. Two new components have recently been added to implement a model involving a middle tier 'CORAL server' deployed close to the database and a tree of 'CORAL server proxies', providing data caching and multiplexing, deployed close to the client. A first implementation of the two new components, released in the summer 2009, is now deployed in the ATLAS online system to read the data needed by the High Level Trigger, allowing the configuration of a farm of several thousand processes. This paper reviews the architecture of the software, its development status and its usage in ATLAS.

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.

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...

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.

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.

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.

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

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.

AN EFFICIENT WEB PERSONALIZATION APPROACH TO DISCOVER USER INTERESTED DIRECTORIES

Directory of Open Access Journals (Sweden)

M. Robinson Joel

2014-04-01

Full Text Available Web Usage Mining is the application of data mining technique used to retrieve the web usage from web proxy log file. Web Usage Mining consists of three major stages: preprocessing, clustering and pattern analysis. This paper explains each of these stages in detail. In this proposed approach, the web directories are discovered based on the user’s interestingness. The web proxy log file undergoes a preprocessing phase to improve the quality of data. Fuzzy Clustering Algorithm is used to cluster the user and session into disjoint clusters. In this paper, an effective approach is presented for Web personalization based on an Advanced Apriori algorithm. It is used to select the user interested web directories. The proposed method is compared with the existing web personalization methods like Objective Probabilistic Directory Miner (OPDM, Objective Community Directory Miner (OCDM and Objective Clustering and Probabilistic Directory Miner (OCPDM. The result shows that the proposed approach provides better results than the aforementioned existing approaches. At last, an application is developed with the user interested directories and web usage details.

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)

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.

Reusing Implicit Cooperation. A Novel Approach to Knowledge Management

Directory of Open Access Journals (Sweden)

Luigi Lancieri

2008-07-01

Full Text Available The study described in this paper deals with information reuse obtained by implicit co-operation, particularly by recycling the contents of a proxy cache (shared memory. The objective is to automatically feed a Web server with large multimedia objects implicitly centred on community fields of interests. We show that the strategy of reusing previously downloaded information provides interesting advantages at a low cost; in particular, to reduce Web access time, to improve information retrieval, and to reduce Internet bandwidth use. Moreover, we use the conceptual frameworks of forgetting and collective intelligence to develop a model on which the operation of implicit cooperation is based.

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....

The iMars WebGIS - Spatio-Temporal Data Queries and Single Image Map Web Services

Science.gov (United States)

Walter, Sebastian; Steikert, Ralf; Schreiner, Bjoern; Muller, Jan-Peter; van Gasselt, Stephan; Sidiropoulos, Panagiotis; Lanz-Kroechert, Julia

2017-04-01

WMS GetMap requests by setting additional TIME parameter values in the request. The values for the parameter represent an interval defined by its lower and upper bounds. As the WMS time standard only supports one time variable, only the start times of the images are considered. If no time values are submitted with the request, the full time range of all images is assumed as the default. Dynamic single image WMS: To compare images from different acquisition times at sites of multiple coverage, we have to load every image as a single WMS layer. Due to the vast amount of single images we need a way to set up the layers in a dynamic way - the map server does not know the images to be served beforehand. We use the MapScript interface to dynamically access MapServer's objects and configure the file name and path of the requested image in the map configuration. The layers are created on-the-fly each representing only one single image. On the frontend side, the vendor-specific WMS request parameter (PRODUCTID) has to be appended to the regular set of WMS parameters. The request is then passed on to the MapScript instance. Web Map Tile Cache: In order to speed up access of the WMS requests, a MapCache instance has been integrated in the pipeline. As it is not aware of the available PDS product IDs which will be queried, the PRODUCTID parameter is configured as an additional dimension of the cache. The WMS request is received by the Apache webserver configured with the MapCache module. If the tile is available in the tile cache, it is immediately commited to the client. If not available, the tile request is forwarded to Apache and the MapScript module. The Python script intercepts the WMS request and extracts the product ID from the parameter chain. It loads the layer object from the map file and appends the file name and path of the inquired image. After some possible further image processing inside the script (stretching, color matching), the request is submitted to the Map

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...

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.

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.

UrbanWeb: a Platform for Mobile Context-aware Social Computing

DEFF Research Database (Denmark)

Hansen, Frank Allan; Grønbæk, Kaj

2010-01-01

UrbanWeb is a novel Web-based context-aware hypermedia plat- form. It provides essential mechanisms for mobile social comput- ing applications: the framework implements context as an exten- sion to Web 2.0 tagging and provides developers with an easy to use platform for mobile context......-aware applications. Services can be statically or dynamically defined in the user’s context, data can be pre-cached for data intensive mobile applications, and shared state supports synchronization between running applications such as games. The paper discusses how UrbanWeb acquires cues about the user’s context...... from sensors in mobile phones, ranging from GPS data, to 2D barcodes, and manual entry of context in- formation, as well as how to utilize this context in applications. The experiences show that the UrbanWeb platform efficiently supports a rich variety of urban computing applications in differ- ent...

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.

A Hybrid Web Browser Architecture for Mobile Devices

Directory of Open Access Journals (Sweden)

CHO, J.

2014-08-01

Full Text Available Web browsing on mobile networks is slow in comparison to wired or Wi-Fi networks. Particularly, the connection establishment phase including DNS lookups and TCP handshakes takes a long time on mobile networks due to its long round-trip latency. In this paper, we propose a novel web browser architecture that aims to improve mobile web browsing performance. Our approach delegates the connection establishment and HTTP header field delivery tasks to a dedicated proxy server located at the joint point between the WAN and mobile network. Since the traffic for the connection establishment and HTTP header fields delivery passes only through the WAN between the proxy and web servers, our approach significantly reduces both the number and size of packets on the mobile network. Our evaluation showed that the proposed scheme reduces the number of mobile network packets by up to 42% and, consequently, the average page loading time is shortened by up to 52%.

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...

Advanced data extraction infrastructure: Web based system for management of time series data

Energy Technology Data Exchange (ETDEWEB)

Chilingaryan, S; Beglarian, A [Forschungszentrum Karlsruhe, Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen (Germany); Kopmann, A; Voecking, S, E-mail: Suren.Chilingaryan@kit.ed [University of Muenster, Institut fuer Kernphysik, Wilhelm-Klemm-Strasse 9, 48149 Mnster (Germany)

2010-04-01

During operation of high energy physics experiments a big amount of slow control data is recorded. It is necessary to examine all collected data checking the integrity and validity of measurements. With growing maturity of AJAX technologies it becomes possible to construct sophisticated interfaces using web technologies only. Our solution for handling time series, generally slow control data, has a modular architecture: backend system for data analysis and preparation, a web service interface for data access and a fast AJAX web display. In order to provide fast interactive access the time series are aggregated over time slices of few predefined lengths. The aggregated values are stored in the temporary caching database and, then, are used to create generalizing data plots. These plots may include indication of data quality and are generated within few hundreds of milliseconds even if very high data rates are involved. The extensible export subsystem provides data in multiple formats including CSV, Excel, ROOT, and TDMS. The search engine can be used to find periods of time where indications of selected sensors are falling into the specified ranges. Utilization of the caching database allows performing most of such lookups within a second. Based on this functionality a web interface facilitating fast (Google-maps style) navigation through the data has been implemented. The solution is at the moment used by several slow control systems at Test Facility for Fusion Magnets (TOSKA) and Karlsruhe Tritium Neutrino (KATRIN).

Advanced data extraction infrastructure: Web based system for management of time series data

International Nuclear Information System (INIS)

Chilingaryan, S; Beglarian, A; Kopmann, A; Voecking, S

2010-01-01

During operation of high energy physics experiments a big amount of slow control data is recorded. It is necessary to examine all collected data checking the integrity and validity of measurements. With growing maturity of AJAX technologies it becomes possible to construct sophisticated interfaces using web technologies only. Our solution for handling time series, generally slow control data, has a modular architecture: backend system for data analysis and preparation, a web service interface for data access and a fast AJAX web display. In order to provide fast interactive access the time series are aggregated over time slices of few predefined lengths. The aggregated values are stored in the temporary caching database and, then, are used to create generalizing data plots. These plots may include indication of data quality and are generated within few hundreds of milliseconds even if very high data rates are involved. The extensible export subsystem provides data in multiple formats including CSV, Excel, ROOT, and TDMS. The search engine can be used to find periods of time where indications of selected sensors are falling into the specified ranges. Utilization of the caching database allows performing most of such lookups within a second. Based on this functionality a web interface facilitating fast (Google-maps style) navigation through the data has been implemented. The solution is at the moment used by several slow control systems at Test Facility for Fusion Magnets (TOSKA) and Karlsruhe Tritium Neutrino (KATRIN).

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.

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.

A Global User-Driven Model for Tile Prefetching in Web Geographical Information Systems.

Science.gov (United States)

Pan, Shaoming; Chong, Yanwen; Zhang, Hang; Tan, Xicheng

2017-01-01

A web geographical information system is a typical service-intensive application. Tile prefetching and cache replacement can improve cache hit ratios by proactively fetching tiles from storage and replacing the appropriate tiles from the high-speed cache buffer without waiting for a client's requests, which reduces disk latency and improves system access performance. Most popular prefetching strategies consider only the relative tile popularities to predict which tile should be prefetched or consider only a single individual user's access behavior to determine which neighbor tiles need to be prefetched. Some studies show that comprehensively considering all users' access behaviors and all tiles' relationships in the prediction process can achieve more significant improvements. Thus, this work proposes a new global user-driven model for tile prefetching and cache replacement. First, based on all users' access behaviors, a type of expression method for tile correlation is designed and implemented. Then, a conditional prefetching probability can be computed based on the proposed correlation expression mode. Thus, some tiles to be prefetched can be found by computing and comparing the conditional prefetching probability from the uncached tiles set and, similarly, some replacement tiles can be found in the cache buffer according to multi-step prefetching. Finally, some experiments are provided comparing the proposed model with other global user-driven models, other single user-driven models, and other client-side prefetching strategies. The results show that the proposed model can achieve a prefetching hit rate in approximately 10.6% ~ 110.5% higher than the compared methods.

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.

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...

Analisis Perancangan PC (Personal Computer Router Proxy Untuk Menggabungkan Tiga Jalur Koneksi Di Indospeed

Directory of Open Access Journals (Sweden)

Bangun Harizal

2012-05-01

Full Text Available Router very important for computer network. To get the router can buy a router products but can also design your own using personal computers. Mikrotik is one of the router manufacturer that provides products in the form of hardware or software. If you want to pay less to design a router can use operating system Ubuntu. This operating system is open source and provided free of charge by the manufacturer. If you want to design a router with this OS can make use of personal computers are often used in homes or offices. Merging the performance of both types of routers can also be usedto cover the lack of one another. With the proxy on a local network then the use of bandwidth can be saved. Becausethere are several websites cached and stored therein if the same website is accessed by other users, the router transmits only from the proxy to the computerwhich make the request.

Physics development of web-based tools for use in hardware clusters doing lattice physics

International Nuclear Information System (INIS)

Dreher, P.; Akers, W.; Chen, J.; Chen, Y.; Watson, C.

2002-01-01

Jefferson Lab and MIT are developing a set of web-based tools within the Lattice Hadron Physics Collaboration to allow lattice QCD theorists to treat the computational facilities located at the two sites as a single meta-facility. The prototype Lattice Portal provides researchers the ability to submit jobs to the cluster, browse data caches, and transfer files between cache and off-line storage. The user can view the configuration of the PBS servers and to monitor both the status of all batch queues as well as the jobs in each queue. Work is starting on expanding the present system to include job submissions at the meta-facility level (shared queue), as well as multi-site file transfers and enhanced policy-based data management capabilities

Physics development of web-based tools for use in hardware clusters doing lattice physics

International Nuclear Information System (INIS)

Dreher, P.; Akers, Walt; Jian-ping Chen; Chen, Y.; William, A. Watson III

2001-01-01

Jefferson Lab and MIT are developing a set of web-based tools within the Lattice Hadron Physics Collaboration to allow lattice QCD theorists to treat the computational facilities located at the two sites as a single meta-facility. The prototype Lattice Portal provides researchers the ability to submit jobs to the cluster, browse data caches, and transfer files between cache and off-line storage. The user can view the configuration of the PBS servers and to monitor both the status of all batch queues as well as the jobs in each queue. Work is starting on expanding the present system to include job submissions at the meta-facility level (shared queue), as well as multi-site file transfers and enhanced policy-based data management capabilities

Physics development of web-based tools for use in hardware clusters doing lattice physics

Energy Technology Data Exchange (ETDEWEB)

Dreher, P.; Akers, W.; Chen, J.; Chen, Y.; Watson, C

2002-03-01

Jefferson Lab and MIT are developing a set of web-based tools within the Lattice Hadron Physics Collaboration to allow lattice QCD theorists to treat the computational facilities located at the two sites as a single meta-facility. The prototype Lattice Portal provides researchers the ability to submit jobs to the cluster, browse data caches, and transfer files between cache and off-line storage. The user can view the configuration of the PBS servers and to monitor both the status of all batch queues as well as the jobs in each queue. Work is starting on expanding the present system to include job submissions at the meta-facility level (shared queue), as well as multi-site file transfers and enhanced policy-based data management capabilities.

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...

Supporting Safe Content-Inspection of Web Traffic

National Research Council Canada - National Science Library

Pal, Partha; Atighetchi, Michael

2008-01-01

... for various reasons, including security. Software wrappers, firewalls, Web proxies, and a number of middleware constructs all depend on interception to achieve their respective security, fault tolerance, interoperability, or load balancing objectives...

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...

WEB-SERVICE. RESTFUL ARCHITECTURE

Directory of Open Access Journals (Sweden)

M. Melnichuk

2018-04-01

Full Text Available Network technology for interaction between two applications via the HTTP protocol was considered in article.When client works with REST API - it means it works with "resources", and in SOAP work is performed with operations. To build REST web services, you must follow certain principles: explicit use of HTTP methods, access to resources by URI, stateless, HATEAOS, caching, transfer of objects in JSON or XML representation. But sometimes some principles are ignored to ensure a higher speed of work and to reduce development time.The pros and cons of using JSON and XML representations were considered, and it can be said that using the JSON format reduces the amount of data transfer, and with the use of XML, the readability of data increases.Also, two main ways of data transfer in REST web services were considered: converting the file to Base64 and transferring it as an object field or transferring the file using the usual HTTP multipart. The Base64 standard approach gives a higher speed for multiple files in a single request, because only one HTTP connection is created, but these files are stored in RAM during request processing, which increases chance of the application crashing.In the conclusion, the advantages of using web services and their wide use in other architectural approaches were considered, which increases the popularity of web services.

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.

Water Isotope Proxy-Proxy and Proxy-Model Convergence for Late Pleistocene East Asian Monsoon Rainfall Reconstructions

Science.gov (United States)

Clemens, S. C.; Holbourn, A.; Kubota, Y.; Lee, K. E.; Liu, Z.; Chen, G.

2017-12-01

Confidence in reconstruction of East Asian paleomonsoon rainfall using precipitation isotope proxies is a matter of considerable debate, largely due to the lack of correlation between precipitation amount and isotopic composition in the present climate. We present four new, very highly resolved records spanning the past 300,000 years ( 200 year sample spacing) from IODP Site U1429 in the East China Sea. We demonstrate that all the orbital- and millennial-scale variance in the onshore Yangtze River Valley speleothem δ18O record1 is also embedded in the offshore Site U1429 seawater δ18O record (derived from the planktonic foraminifer Globigerinoides ruber and sea surface temperature reconstructions). Signal replication in these two independent terrestrial and marine archives, both controlled by the same monsoon system, uniquely identifies δ18O of precipitation as the primary driver of the precession-band variance in both records. This proxy-proxy convergence also eliminates a wide array of other drivers that have been called upon as potential contaminants to the precipitation δ18O signal recorded by these proxies. We compare East Asian precipitation isotope proxy records to precipitation amount from a CCSM3 transient climate model simulation of the past 300,000 years using realistic insolation, ice volume, greenhouse gasses, and sea level boundary conditions. This model-proxy comparison suggests that both Yangtze River Valley precipitation isotope proxies (seawater and speleothem δ18O) track changes in summer-monsoon rainfall amount at orbital time scales, as do precipitation isotope records from the Pearl River Valley2 (leaf wax δ2H) and Borneo3 (speleothem δ18O). Notably, these proxy records all have significantly different spectral structure indicating strongly regional rainfall patterns that are also consistent with model results. Transient, isotope-enabled model simulations will be necessary to more thoroughly evaluate these promising results, and to

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

The Last Millennium Reanalysis: Improvements to proxies and proxy modeling

Science.gov (United States)

Tardif, R.; Hakim, G. J.; Emile-Geay, J.; Noone, D.; Anderson, D. M.

2017-12-01

The Last Millennium Reanalysis (LMR) employs a paleoclimate data assimilation (PDA) approach to produce climate field reconstructions (CFRs). Here, we focus on two key factors in PDA generated CFRs: the set of assimilated proxy records and forward models (FMs) used to estimate proxies from climate model output. In the initial configuration of the LMR [Hakim et al., 2016], the proxy dataset of [PAGES2k Consortium, 2013] was used, along with univariate linear FMs calibrated against annually-averaged 20th century temperature datasets. In an updated configuration, proxy records from the recent dataset [PAGES2k Consortium, 2017] are used, while a hierarchy of statistical FMs are tested: (1) univariate calibrated on annual temperature as in the initial configuration, (2) univariate against temperature as in (1) but calibration performed using expert-derived seasonality for individual proxy records, (3) as in (2) but expert proxy seasonality replaced by seasonal averaging determined objectively as part of the calibration process, (4) linear objective seasonal FMs as in (3) but objectively selecting relationships calibrated either on temperature or precipitation, and (5) bivariate linear models calibrated on temperature and precipitation with objectively-derived seasonality. (4) and (5) specifically aim at better representing the physical drivers of tree ring width proxies. Reconstructions generated using the CCSM4 Last Millennium simulation as an uninformed prior are evaluated against various 20th century data products. Results show the benefits of using the new proxy collection, particularly on the detrended global mean temperature and spatial patterns. The positive impact of using proper seasonality and temperature/moisture sensitivities for tree ring width records is also notable. This updated configuration will be used for the first generation of LMR-generated CFRs to be publicly released. These also provide a benchmark for future efforts aimed at evaluating the

Multicluster

Science.gov (United States)

1993-03-01

CLUSTER A CLUSTER B .UDP D "Orequeqes ProxyDistribute 0 Figure 4-4: HOSTALL Implementation HOST_ALL is implemented as follows. The kernel looks up the...it includes the HOSTALL request as an argument. The generic CronusHost object is managed by the Cronus Kernel. A kernel that receives a ProxyDistnbute...request uses its cached service information to send the HOSTALL request to each host in its cluster via UDP. If the kernel has no cached information

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.

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

Multi-proxy studies in palaeolimnology

OpenAIRE

Birks, Hilary H.; Birks, Harry John Betteley

2006-01-01

Multi-proxy studies are becoming increasingly common in palaeolimnology. Eight basic requirements and challenges for a multi-proxy study are outlined in this essay – definition of research questions, leadership, site selection and coring, data storage, chronology, presentation of results, numerical tools, and data interpretation. The nature of proxy data is discussed in terms of physical proxies and biotic proxies. Loss-on-ignition changes and the use of transfer functions are reviewed as exa...

Jemen - the Proxy War

Directory of Open Access Journals (Sweden)

Magdalena El Ghamari

2015-12-01

Full Text Available The military operation in Yemen is significant departure from Saudi Arabia's foreign policy tradition and customs. Riyadh has always relied on three strategies to pursue its interests abroad: wealth, establish a global network and muslim education and diplomacy and meadiation. The term "proxy war" has experienced a new popularity in stories on the Middle East. A proxy war is two opposing countries avoiding direct war, and instead supporting combatants that serve their interests. In some occasions, one country is a direct combatant whilst the other supporting its enemy. Various news sources began using the term to describe the conflict in Yemen immediately, as if on cue, after Saudi Arabia launched its bombing campaign against Houthi targets in Yemen on 25 March 2015. This is the reason, why author try to answer for following questions: Is the Yemen Conflict Devolves into Proxy War? and Who's fighting whom in Yemen's proxy war?" Research area includes the problem of proxy war in the Middle East. For sure, the real problem of proxy war must begin with the fact that the United States and its NATO allies opened the floodgates for regional proxy wars by the two major wars for regime change: in Iraq and Libya. Those two destabilising wars provided opportunities and motives for Sunni states across the Middle East to pursue their own sectarian and political power objectives through "proxy war".

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....

Webvise: Browser and Proxy support for open hypermedia structuring mechanisms on the WWW

DEFF Research Database (Denmark)

Grønbæk, Kaj; Sloth, Lennard; Ørbæk, Peter

1999-01-01

Web pages. Support for providing links to/from parts of non-HTML data, such as sound and movie, will be possible via interfaces to plug-ins and Java-based media players. The hypermedia structures are stored in a hypermedia database, developed from the Devise Hypermedia framework, and the service...... be manipulated and used via special Java applets and a pure proxy server solution is provided for users who only need to browse the structures. A user can create and use the external structures as ‘transparency' layers on top of arbitrary Web pages, the user can switch between viewing pages with one or more...

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.

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.

ORGANIZATION AND VISUALIZATION TO OBSERVATIONAL DATA USING WEB MAPPING SERVICES

Directory of Open Access Journals (Sweden)

A. A. Kadochnikov

2014-01-01

Full Text Available Current trends in the field of nature protection are monitoring environmental pollution resulting from human impact on nature, and as a result of natural processes. Monitoring the state of the environment in the area of the various industries can reduce costs to eliminate the impact of industrial accidents, which in turn reduces the possibility of contamination soil, surface water, loss of vegetation and wildlife. Consider the problem of creation of information-analytical systems for environmental monitoring of the natural environment and resources, built on the basis of GIS technologies, Internet, remote sensing data processing and data from monitoring stations. Considerable attention is given to web services, software interfaces and generally accepted standards. The author were directly involved in the development and implementation of projects of ecological orientation. In developing the software many different software libraries and components were used. Web mapping user interface was created using a number of open source libraries. To create a server-side web application author used GIS platforms MapGuide Open Source and Minnesota MapServer. GeoWebCache was another essential component of distributed web mapping environmental monitoring applications.

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...

Analyzing Web Behavior in Indoor Retail Spaces

OpenAIRE

Ren, Yongli; Tomko, Martin; Salim, Flora; Ong, Kevin; Sanderson, Mark

2015-01-01

We analyze 18 million rows of Wi-Fi access logs collected over a one year period from over 120,000 anonymized users at an inner-city shopping mall. The anonymized dataset gathered from an opt-in system provides users' approximate physical location, as well as Web browsing and some search history. Such data provides a unique opportunity to analyze the interaction between people's behavior in physical retail spaces and their Web behavior, serving as a proxy to their information needs. We find: ...

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

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.

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.

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....

Validity of proxies and correction for proxy use when evaluating social determinants of health in stroke patients.

Science.gov (United States)

Skolarus, Lesli E; Sánchez, Brisa N; Morgenstern, Lewis B; Garcia, Nelda M; Smith, Melinda A; Brown, Devin L; Lisabeth, Lynda D

2010-03-01

The purpose of this study was to evaluate stroke patient-proxy agreement with respect to social determinants of health, including depression, optimism, and spirituality, and to explore approaches to minimize proxy-introduced bias. Stroke patient-proxy pairs from the Brain Attack Surveillance in Corpus Christi Project were interviewed (n=34). Evaluation of agreement between patient-proxy pairs included calculation of intraclass correlation coefficients, linear regression models (ProxyResponse=alpha(0)+alpha(1)PatientResponse+delta, where alpha(0)=0 and alpha(1)=1 denotes no bias) and kappa statistics. Bias introduced by proxies was quantified with simulation studies. In the simulated data, we applied 4 approaches to estimate regression coefficients of stroke outcome social determinants of health associations when only proxy data were available for some patients: (1) substituting proxy responses in place of patient responses; (2) including an indicator variable for proxy use; (3) using regression calibration with external validation; and (4) internal validation. Agreement was fair for depression (intraclass correlation coefficient, 0.41) and optimism (intraclass correlation coefficient, 0.48) and moderate for spirituality (kappa, 0.48 to 0.53). Responses of proxies were a biased measure of the patients' responses for depression, with alpha(0)=4.88 (CI, 2.24 to 7.52) and alpha(1)=0.39 (CI, 0.09 to 0.69), and for optimism, with alpha(0)=3.82 (CI, -1.04 to 8.69) and alpha(1)=0.81 (CI, 0.41 to 1.22). Regression calibration with internal validation was the most accurate method to correct for proxy-induced bias. Fair/moderate patient-proxy agreement was observed for social determinants of health. Stroke researchers who plan to study social determinants of health may consider performing validation studies so corrections for proxy use can be made.

Mobile web browsing using the cloud

CERN Document Server

Zhao, Bo; Cao, Guohong

2013-01-01

This brief surveys existing techniques to address the problem of long delays and high power consumption for web browsing on smartphones, which can be due to the local computational limitation at the smartphone (e.g., running java scripts or flash objects) level. To address this issue, an architecture called Virtual-Machine based Proxy (VMP) is introduced, shifting the computing from smartphones to the VMP which may reside in the cloud. Mobile Web Browsing Using the Cloud illustrates the feasibility of deploying the proposed VMP system in 3G networks through a prototype using Xen virtual machin

CMS conditions data access using FroNTier

International Nuclear Information System (INIS)

Blumenfeld, Barry; Johns Hopkins U.; Dykstra, David; Lueking, Lee; Wicklund, Eric; Fermilab

2007-01-01

The CMS experiment at the LHC has established an infrastructure using the FroNTier framework to deliver conditions (i.e. calibration, alignment, etc.) data to processing clients worldwide. FroNTier is a simple web service approach providing client HTTP access to a central database service. The system for CMS has been developed to work with POOL which provides object relational mapping between the C++ clients and various database technologies. Because of the read only nature of the data, Squid proxy caching servers are maintained near clients and these caches provide high performance data access. Several features have been developed to make the system meet the needs of CMS including careful attention to cache coherency with the central database, and low latency loading required for the operation of the online High Level Trigger. The ease of deployment, stability of operation, and high performance make the FroNTier approach well suited to the GRID environment being used for CMS offline, as well as for the online environment used by the CMS High Level Trigger (HLT). The use of standard software, such as Squid and various monitoring tools, make the system reliable, highly configurable and easily maintained. We describe the architecture, software, deployment, performance, monitoring and overall operational experience for the system

CMS conditions data access using FroNTier

International Nuclear Information System (INIS)

Blumenfeld, B; Dykstra, D; Lueking, L; Wicklund, E

2008-01-01

The CMS experiment at the LHC has established an infrastructure using the FroNTier framework to deliver conditions (i.e. calibration, alignment, etc.) data to processing clients worldwide. FroNTier is a simple web service approach providing client HTTP access to a central database service. The system for CMS has been developed to work with POOL which provides object relational mapping between the C++ clients and various database technologies. Because of the read only nature of the data, Squid proxy caching servers are maintained near clients and these caches provide high performance data access. Several features have been developed to make the system meet the needs of CMS including careful attention to cache coherency with the central database, and low latency loading required for the operation of the online High Level Trigger. The ease of deployment, stability of operation, and high performance make the FroNTier approach well suited to the GRID environment being used for CMS offline, as well as for the online environment used by the CMS High Level Trigger. The use of standard software, such as Squid and various monitoring tools, makes the system reliable, highly configurable and easily maintained. We describe the architecture, software, deployment, performance, monitoring and overall operational experience for the system

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

12 CFR 569.4 - Proxy soliciting material.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Proxy soliciting material. 569.4 Section 569.4 Banks and Banking OFFICE OF THRIFT SUPERVISION, DEPARTMENT OF THE TREASURY PROXIES § 569.4 Proxy soliciting material. No solicitation of a proxy shall be made by means of any statement, form of proxy...

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

12 CFR 569.2 - Form of proxies.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Form of proxies. 569.2 Section 569.2 Banks and Banking OFFICE OF THRIFT SUPERVISION, DEPARTMENT OF THE TREASURY PROXIES § 569.2 Form of proxies. Every form of proxy shall conform to the following requirements: (a) The proxy shall be revocable at will by...

Development of grid-like applications for public health using Web 2.0 mashup techniques.

Science.gov (United States)

Scotch, Matthew; Yip, Kevin Y; Cheung, Kei-Hoi

2008-01-01

Development of public health informatics applications often requires the integration of multiple data sources. This process can be challenging due to issues such as different file formats, schemas, naming systems, and having to scrape the content of web pages. A potential solution to these system development challenges is the use of Web 2.0 technologies. In general, Web 2.0 technologies are new internet services that encourage and value information sharing and collaboration among individuals. In this case report, we describe the development and use of Web 2.0 technologies including Yahoo! Pipes within a public health application that integrates animal, human, and temperature data to assess the risk of West Nile Virus (WNV) outbreaks. The results of development and testing suggest that while Web 2.0 applications are reasonable environments for rapid prototyping, they are not mature enough for large-scale public health data applications. The application, in fact a "systems of systems," often failed due to varied timeouts for application response across web sites and services, internal caching errors, and software added to web sites by administrators to manage the load on their servers. In spite of these concerns, the results of this study demonstrate the potential value of grid computing and Web 2.0 approaches in public health informatics.

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,

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.

Shareholder Activism through the Proxy Process

NARCIS (Netherlands)

Renneboog, L.D.R.; Szilagyi, P.G.

2009-01-01

This paper provides evidence on the corporate governance role of shareholderinitiated proxy proposals. Previous studies debate over whether activists use proxy proposals to discipline firms or to simply advance their self-serving agendas, and whether proxy proposals are effective at all in

Shareholder Activism Through the Proxy Process

NARCIS (Netherlands)

Renneboog, L.D.R.; Szilagyi, P.G.

2009-01-01

This paper provides evidence on the corporate governance role of shareholder-initiated proxy proposals. Previous studies debate over whether activists use proxy proposals to discipline firms or to simply advance their self-serving agendas, and whether proxy proposals are effective at all in

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...

12 CFR 569.3 - Holders of proxies.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Holders of proxies. 569.3 Section 569.3 Banks and Banking OFFICE OF THRIFT SUPERVISION, DEPARTMENT OF THE TREASURY PROXIES § 569.3 Holders of proxies. No proxy of a mutual savings association with a term greater than eleven months or solicited at...

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.

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.

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%.

Earth Science Mining Web Services

Science.gov (United States)

Pham, Long; Lynnes, Christopher; Hegde, Mahabaleshwa; Graves, Sara; Ramachandran, Rahul; Maskey, Manil; Keiser, Ken

2008-01-01

To allow scientists further capabilities in the area of data mining and web services, the Goddard Earth Sciences Data and Information Services Center (GES DISC) and researchers at the University of Alabama in Huntsville (UAH) have developed a system to mine data at the source without the need of network transfers. The system has been constructed by linking together several pre-existing technologies: the Simple Scalable Script-based Science Processor for Measurements (S4PM), a processing engine at he GES DISC; the Algorithm Development and Mining (ADaM) system, a data mining toolkit from UAH that can be configured in a variety of ways to create customized mining processes; ActiveBPEL, a workflow execution engine based on BPEL (Business Process Execution Language); XBaya, a graphical workflow composer; and the EOS Clearinghouse (ECHO). XBaya is used to construct an analysis workflow at UAH using ADam components, which are also installed remotely at the GES DISC, wrapped as Web Services. The S4PM processing engine searches ECHO for data using space-time criteria, staging them to cache, allowing the ActiveBPEL engine to remotely orchestras the processing workflow within S4PM. As mining is completed, the output is placed in an FTP holding area for the end user. The goals are to give users control over the data they want to process, while mining data at the data source using the server's resources rather than transferring the full volume over the internet. These diverse technologies have been infused into a functioning, distributed system with only minor changes to the underlying technologies. The key to the infusion is the loosely coupled, Web-Services based architecture: All of the participating components are accessible (one way or another) through (Simple Object Access Protocol) SOAP-based Web Services.

Witnessing entanglement by proxy

International Nuclear Information System (INIS)

Bäuml, Stefan; Bruß, Dagmar; Kampermann, Hermann; Huber, Marcus; Winter, Andreas

2016-01-01

Entanglement is a ubiquitous feature of low temperature systems and believed to be highly relevant for the dynamics of condensed matter properties and quantum computation even at higher temperatures. The experimental certification of this paradigmatic quantum effect in macroscopic high temperature systems is constrained by the limited access to the quantum state of the system. In this paper we show how macroscopic observables beyond the mean energy of the system can be exploited as proxy witnesses for entanglement detection. Using linear and semi-definite relaxations we show that all previous approaches to this problem can be outperformed by our proxies, i.e. entanglement can be certified at higher temperatures without access to any local observable. For an efficient computation of proxy witnesses one can resort to a generalised grand canonical ensemble, enabling entanglement certification even in complex systems with macroscopic particle numbers. (paper)

Inferring climate variability from skewed proxy records

Science.gov (United States)

Emile-Geay, J.; Tingley, M.

2013-12-01

Many paleoclimate analyses assume a linear relationship between the proxy and the target climate variable, and that both the climate quantity and the errors follow normal distributions. An ever-increasing number of proxy records, however, are better modeled using distributions that are heavy-tailed, skewed, or otherwise non-normal, on account of the proxies reflecting non-normally distributed climate variables, or having non-linear relationships with a normally distributed climate variable. The analysis of such proxies requires a different set of tools, and this work serves as a cautionary tale on the danger of making conclusions about the underlying climate from applications of classic statistical procedures to heavily skewed proxy records. Inspired by runoff proxies, we consider an idealized proxy characterized by a nonlinear, thresholded relationship with climate, and describe three approaches to using such a record to infer past climate: (i) applying standard methods commonly used in the paleoclimate literature, without considering the non-linearities inherent to the proxy record; (ii) applying a power transform prior to using these standard methods; (iii) constructing a Bayesian model to invert the mechanistic relationship between the climate and the proxy. We find that neglecting the skewness in the proxy leads to erroneous conclusions and often exaggerates changes in climate variability between different time intervals. In contrast, an explicit treatment of the skewness, using either power transforms or a Bayesian inversion of the mechanistic model for the proxy, yields significantly better estimates of past climate variations. We apply these insights in two paleoclimate settings: (1) a classical sedimentary record from Laguna Pallcacocha, Ecuador (Moy et al., 2002). Our results agree with the qualitative aspects of previous analyses of this record, but quantitative departures are evident and hold implications for how such records are interpreted, and

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.

JavaScript Access to DICOM Network and Objects in Web Browser.

Science.gov (United States)

Drnasin, Ivan; Grgić, Mislav; Gogić, Goran

2017-10-01

Digital imaging and communications in medicine (DICOM) 3.0 standard provides the baseline for the picture archiving and communication systems (PACS). The development of Internet and various communication media initiated demand for non-DICOM access to PACS systems. Ever-increasing utilization of the web browsers, laptops and handheld devices, as opposed to desktop applications and static organizational computers, lead to development of different web technologies. The DICOM standard officials accepted those subsequently as tools of alternative access. This paper provides an overview of the current state of development of the web access technology to the DICOM repositories. It presents a different approach of using HTML5 features of the web browsers through the JavaScript language and the WebSocket protocol by enabling real-time communication with DICOM repositories. JavaScript DICOM network library, DICOM to WebSocket proxy and a proof-of-concept web application that qualifies as a DICOM 3.0 device were developed.

GENIUS/EnginFrame Grid Portal: VOMS Proxy creation, new features and enhancements

International Nuclear Information System (INIS)

Ardizzone, V.; Barbaram, R.; Falzone, A.; Emidio, G.; Neri, L.; Scardaci, D.; Venuti, N.

2007-01-01

Scientific domain knowledge and tools must be presented to the (non-expert) users in terms of applications without needing to know the underlying details of the Grid Middle wares. GENIUS Grid portal, powered by EnginFrame, is an increasingly popular mechanism for creating customisable, Web-based interfaces to Grid services and resources. This work describes new GENIUS portals capabilities such as portal login, access control, display management, new approach to building reusable portal components as plug ins, better performance results as consequence of EnginFrame core functions improvement. Finally will be described two new tools developed for VOMS Proxy creation and simple JDL composer. (Author)

GENIUS/EnginFrame Grid Portal: VOMS Proxy creation, new features and enhancements

Energy Technology Data Exchange (ETDEWEB)

Ardizzone, V.; Barbaram, R.; Falzone, A.; Emidio, G.; Neri, L.; Scardaci, D.; Venuti, N.

2007-07-01

Scientific domain knowledge and tools must be presented to the (non-expert) users in terms of applications without needing to know the underlying details of the Grid Middle wares. GENIUS Grid portal, powered by EnginFrame, is an increasingly popular mechanism for creating customisable, Web-based interfaces to Grid services and resources. This work describes new GENIUS portals capabilities such as portal login, access control, display management, new approach to building reusable portal components as plug ins, better performance results as consequence of EnginFrame core functions improvement. Finally will be described two new tools developed for VOMS Proxy creation and simple JDL composer. (Author)

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.

Multi Service Proxy: Mobile Web Traffic Entitlement Point in 4G Core Network

Directory of Open Access Journals (Sweden)

Dalibor Uhlir

2015-05-01

Full Text Available Core part of state-of-the-art mobile networks is composed of several standard elements like GGSN (Gateway General Packet Radio Service Support Node, SGSN (Serving GPRS Support Node, F5 or MSP (Multi Service Proxy. Each node handles network traffic from a slightly different perspective, and with various goals. In this article we will focus only on the MSP, its key features and especially on related security issues. MSP handles all HTTP traffic in the mobile network and therefore it is a suitable point for the implementation of different optimization functions, e.g. to reduce the volume of data generated by YouTube or similar HTTP-based service. This article will introduce basic features and functions of MSP as well as ways of remote access and security mechanisms of this key element in state-of-the-art mobile networks.

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...

Effect of Temporal Relationships in Associative Rule Mining for Web Log Data

Science.gov (United States)

Mohd Khairudin, Nazli; Mustapha, Aida

2014-01-01

The advent of web-based applications and services has created such diverse and voluminous web log data stored in web servers, proxy servers, client machines, or organizational databases. This paper attempts to investigate the effect of temporal attribute in relational rule mining for web log data. We incorporated the characteristics of time in the rule mining process and analysed the effect of various temporal parameters. The rules generated from temporal relational rule mining are then compared against the rules generated from the classical rule mining approach such as the Apriori and FP-Growth algorithms. The results showed that by incorporating the temporal attribute via time, the number of rules generated is subsequently smaller but is comparable in terms of quality. PMID:24587757

PENGEMBANGAN MEKANISME OTENTIKASI DAN OTORISASI MANAJEMEN CONFIG PADA KASUS SHARED WEB HOSTING BERBASIS LINUX CONTAINER

Directory of Open Access Journals (Sweden)

Saifuddin Saifuddin

2016-08-01

The results show config on web applications that are in the directory in a single server can be read using these methods but can not be decoded to read user, password, and dbname, because it has given authorization can be decoded only from the directory already listed. on testing performance for latency, memory, and CPU system be followed, to get good results the previous system. The test results using the cache, the response time generated when accessed simultaneously by 20 click per user amounted to 941.4 ms for the old system and amounted to 786.6 ms.

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

Development of six PROMIS pediatrics proxy-report item banks.

Science.gov (United States)

Irwin, Debra E; Gross, Heather E; Stucky, Brian D; Thissen, David; DeWitt, Esi Morgan; Lai, Jin Shei; Amtmann, Dagmar; Khastou, Leyla; Varni, James W; DeWalt, Darren A

2012-02-22

Pediatric self-report should be considered the standard for measuring patient reported outcomes (PRO) among children. However, circumstances exist when the child is too young, cognitively impaired, or too ill to complete a PRO instrument and a proxy-report is needed. This paper describes the development process including the proxy cognitive interviews and large-field-test survey methods and sample characteristics employed to produce item parameters for the Patient Reported Outcomes Measurement Information System (PROMIS) pediatric proxy-report item banks. The PROMIS pediatric self-report items were converted into proxy-report items before undergoing cognitive interviews. These items covered six domains (physical function, emotional distress, social peer relationships, fatigue, pain interference, and asthma impact). Caregivers (n = 25) of children ages of 5 and 17 years provided qualitative feedback on proxy-report items to assess any major issues with these items. From May 2008 to March 2009, the large-scale survey enrolled children ages 8-17 years to complete the self-report version and caregivers to complete the proxy-report version of the survey (n = 1548 dyads). Caregivers of children ages 5 to 7 years completed the proxy report survey (n = 432). In addition, caregivers completed other proxy instruments, PedsQL™ 4.0 Generic Core Scales Parent Proxy-Report version, PedsQL™ Asthma Module Parent Proxy-Report version, and KIDSCREEN Parent-Proxy-52. Item content was well understood by proxies and did not require item revisions but some proxies clearly noted that determining an answer on behalf of their child was difficult for some items. Dyads and caregivers of children ages 5-17 years old were enrolled in the large-scale testing. The majority were female (85%), married (70%), Caucasian (64%) and had at least a high school education (94%). Approximately 50% had children with a chronic health condition, primarily asthma, which was diagnosed or treated within 6

Pseudo-proxy evaluation of climate field reconstruction methods of North Atlantic climate based on an annually resolved marine proxy network

Directory of Open Access Journals (Sweden)

M. Pyrina

2017-10-01

Full Text Available Two statistical methods are tested to reconstruct the interannual variations in past sea surface temperatures (SSTs of the North Atlantic (NA Ocean over the past millennium based on annually resolved and absolutely dated marine proxy records of the bivalve mollusk Arctica islandica. The methods are tested in a pseudo-proxy experiment (PPE setup using state-of-the-art climate models (CMIP5 Earth system models and reanalysis data from the COBE2 SST data set. The methods were applied in the virtual reality provided by global climate simulations and reanalysis data to reconstruct the past NA SSTs using pseudo-proxy records that mimic the statistical characteristics and network of Arctica islandica. The multivariate linear regression methods evaluated here are principal component regression and canonical correlation analysis. Differences in the skill of the climate field reconstruction (CFR are assessed according to different calibration periods and different proxy locations within the NA basin. The choice of the climate model used as a surrogate reality in the PPE has a more profound effect on the CFR skill than the calibration period and the statistical reconstruction method. The differences between the two methods are clearer for the MPI-ESM model due to its higher spatial resolution in the NA basin. The pseudo-proxy results of the CCSM4 model are closer to the pseudo-proxy results based on the reanalysis data set COBE2. Conducting PPEs using noise-contaminated pseudo-proxies instead of noise-free pseudo-proxies is important for the evaluation of the methods, as more spatial differences in the reconstruction skill are revealed. Both methods are appropriate for the reconstruction of the temporal evolution of the NA SSTs, even though they lead to a great loss of variance away from the proxy sites. Under reasonable assumptions about the characteristics of the non-climate noise in the proxy records, our results show that the marine network of Arctica

The role of proxy information in missing data analysis.

Science.gov (United States)

Huang, Rong; Liang, Yuanyuan; Carrière, K C

2005-10-01

This article investigates the role of proxy data in dealing with the common problem of missing data in clinical trials using repeated measures designs. In an effort to avoid the missing data situation, some proxy information can be gathered. The question is how to treat proxy information, that is, is it always better to utilize proxy information when there are missing data? A model for repeated measures data with missing values is considered and a strategy for utilizing proxy information is developed. Then, simulations are used to compare the power of a test using proxy to simply utilizing all available data. It is concluded that using proxy information can be a useful alternative when such information is available. The implications for various clinical designs are also considered and a data collection strategy for efficiently estimating parameters is suggested.

Transparent Proxy for Secure E-Mail

Science.gov (United States)

Michalák, Juraj; Hudec, Ladislav

2010-05-01

The paper deals with the security of e-mail messages and e-mail server implementation by means of a transparent SMTP proxy. The security features include encryption and signing of transported messages. The goal is to design and implement a software proxy for secure e-mail including its monitoring, administration, encryption and signing keys administration. In particular, we focus on automatic public key on-the-fly encryption and signing of e-mail messages according to S/MIME standard by means of an embedded computer system whose function can be briefly described as a brouter with transparent SMTP proxy.

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.

Proxy comparisons for Paleogene sea water temperature reconstructions

Science.gov (United States)

de Bar, Marijke; de Nooijer, Lennart; Schouten, Stefan; Ziegler, Martin; Sluijs, Appy; Reichart, Gert-Jan

2017-04-01

Several studies have reconstructed Paleogene seawater temperatures, using single- or multi-proxy approaches (e.g. Hollis et al., 2012 and references therein), particularly comparing TEX86 with foraminiferal δ18O and Mg/Ca. Whereas trends often agree relatively well, absolute temperatures can differ significantly between proxies, possibly because they are often applied to (extreme) climate events/transitions (e.g. Sluijs et al., 2011), where certain assumptions underlying the temperature proxies may not hold true. A more general long-term multi-proxy temperature reconstruction, is therefore necessary to validate the different proxies and underlying presumed boundary conditions. Here we apply a multi-proxy approach using foraminiferal calcite and organic proxies to generate a low-resolution, long term (80 Myr) paleotemperature record for the Bass River core (New Jersey, North Atlantic). Oxygen (δ18O), clumped isotopes (Δ47) and Mg/Ca of benthic foraminifera, as well as the organic proxies MBT'-CBT, TEX86H, U37K' index and the LDI were determined on the same sediments. The youngest samples of Miocene age are characterized by a high BIT index (>0.8) and fractional abundance of the C32 1,15-diol (>0.6; de Bar et al., 2016) and the absence of foraminifera, all suggesting high continental input and shallow depths. The older sediment layers (˜30 to 90 Ma) display BIT values and C32 1,15-diol fractional abundances 28 ˚ C. In contrast, LDI temperatures were considerably lower and varied only between 21 and 19 ˚ C. MBT'-CBT derived mean annual temperatures for the ages of 9 and 20 Ma align well with the TEX86H SSTs. Overall, the agreement of the paleotemperature proxies in terms of main tendencies, and the covariation with the global benthic oxygen isotope compilation suggests that temperatures in this region varied in concert with global climate variability. The fact that offsets between the different proxies used here remain fairly constant down to 90 Ma ago

Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

Science.gov (United States)

Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

2017-06-01

Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

Development of six PROMIS pediatrics proxy-report item banks

Directory of Open Access Journals (Sweden)

Irwin Debra E

2012-02-01

Full Text Available Abstract Background Pediatric self-report should be considered the standard for measuring patient reported outcomes (PRO among children. However, circumstances exist when the child is too young, cognitively impaired, or too ill to complete a PRO instrument and a proxy-report is needed. This paper describes the development process including the proxy cognitive interviews and large-field-test survey methods and sample characteristics employed to produce item parameters for the Patient Reported Outcomes Measurement Information System (PROMIS pediatric proxy-report item banks. Methods The PROMIS pediatric self-report items were converted into proxy-report items before undergoing cognitive interviews. These items covered six domains (physical function, emotional distress, social peer relationships, fatigue, pain interference, and asthma impact. Caregivers (n = 25 of children ages of 5 and 17 years provided qualitative feedback on proxy-report items to assess any major issues with these items. From May 2008 to March 2009, the large-scale survey enrolled children ages 8-17 years to complete the self-report version and caregivers to complete the proxy-report version of the survey (n = 1548 dyads. Caregivers of children ages 5 to 7 years completed the proxy report survey (n = 432. In addition, caregivers completed other proxy instruments, PedsQL™ 4.0 Generic Core Scales Parent Proxy-Report version, PedsQL™ Asthma Module Parent Proxy-Report version, and KIDSCREEN Parent-Proxy-52. Results Item content was well understood by proxies and did not require item revisions but some proxies clearly noted that determining an answer on behalf of their child was difficult for some items. Dyads and caregivers of children ages 5-17 years old were enrolled in the large-scale testing. The majority were female (85%, married (70%, Caucasian (64% and had at least a high school education (94%. Approximately 50% had children with a chronic health condition, primarily

Secure Mobile Agent from Leakage-Resilient Proxy Signatures

Directory of Open Access Journals (Sweden)

Fei Tang

2015-01-01

Full Text Available A mobile agent can sign a message in a remote server on behalf of a customer without exposing its secret key; it can be used not only to search for special products or services, but also to make a contract with a remote server. Hence a mobile agent system can be used for electronic commerce as an important key technology. In order to realize such a system, Lee et al. showed that a secure mobile agent can be constructed using proxy signatures. Intuitively, a proxy signature permits an entity (delegator to delegate its signing right to another entity (proxy to sign some specified messages on behalf of the delegator. However, the proxy signatures are often used in scenarios where the signing is done in an insecure environment, for example, the remote server of a mobile agent system. In such setting, an adversary could launch side-channel attacks to exploit some leakage information about the proxy key or even other secret states. The proxy signatures which are secure in the traditional security models obviously cannot provide such security. Based on this consideration, in this paper, we design a leakage-resilient proxy signature scheme for the secure mobile agent systems.

Scaling HEP to Web size with RESTful protocols: The frontier example

International Nuclear Information System (INIS)

Dykstra, Dave

2011-01-01

The World-Wide-Web has scaled to an enormous size. The largest single contributor to its scalability is the HTTP protocol, particularly when used in conformity to REST (REpresentational State Transfer) principles. High Energy Physics (HEP) computing also has to scale to an enormous size, so it makes sense to base much of it on RESTful protocols. Frontier, which reads databases with an HTTP-based RESTful protocol, has successfully scaled to deliver production detector conditions data from both the CMS and ATLAS LHC detectors to hundreds of thousands of computer cores worldwide. Frontier is also able to re-use a large amount of standard software that runs the Web: on the clients, caches, and servers. I discuss the specific ways in which HTTP and REST enable high scalability for Frontier. I also briefly discuss another protocol used in HEP computing that is HTTP-based and RESTful, and another protocol that could benefit from it. My goal is to encourage HEP protocol designers to consider HTTP and REST whenever the same information is needed in many places.

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.

Time-and-ID-Based Proxy Reencryption Scheme

Directory of Open Access Journals (Sweden)

Kambombo Mtonga

2014-01-01

Full Text Available Time- and ID-based proxy reencryption scheme is proposed in this paper in which a type-based proxy reencryption enables the delegator to implement fine-grained policies with one key pair without any additional trust on the proxy. However, in some applications, the time within which the data was sampled or collected is very critical. In such applications, for example, healthcare and criminal investigations, the delegatee may be interested in only some of the messages with some types sampled within some time bound instead of the entire subset. Hence, in order to carter for such situations, in this paper, we propose a time-and-identity-based proxy reencryption scheme that takes into account the time within which the data was collected as a factor to consider when categorizing data in addition to its type. Our scheme is based on Boneh and Boyen identity-based scheme (BB-IBE and Matsuo’s proxy reencryption scheme for identity-based encryption (IBE to IBE. We prove that our scheme is semantically secure in the standard model.

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...

Time-and-ID-Based Proxy Reencryption Scheme

OpenAIRE

Mtonga, Kambombo; Paul, Anand; Rho, Seungmin

2014-01-01

Time- and ID-based proxy reencryption scheme is proposed in this paper in which a type-based proxy reencryption enables the delegator to implement fine-grained policies with one key pair without any additional trust on the proxy. However, in some applications, the time within which the data was sampled or collected is very critical. In such applications, for example, healthcare and criminal investigations, the delegatee may be interested in only some of the messages with some types sampled wi...

The Proxy Challenge: Why bespoke proxy indicators can help solve the anti-corruption measurement problem

OpenAIRE

Johnsøn, Jesper; Mason, Phil

2013-01-01

Practitioners working in anti-corruption face perennial challenges in measuring changes in corruption levels and evaluating whether anti-corruption efforts are successful. These two challenges are linked but not inseparable. To make progress on the latter front, that is, evaluating whether anti-corruption efforts are having an impact, the U4 Anti-Corruption Resource Centre and the UK Department for International Development are launching an exploration into the use of proxy indicators. Proxy ...

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.

A Web portal for CMS Grid job submission and management

Energy Technology Data Exchange (ETDEWEB)

Braun, David [Department of Physics, Purdue University, W. Lafayette, IN 47907 (United States); Neumeister, Norbert, E-mail: neumeist@purdue.ed [Rosen Center for Advanced Computing, Purdue University, W. Lafayette, IN 47907 (United States)

2010-04-01

We present a Web portal for CMS Grid submission and management. The portal is built using a JBoss application server. It has a three tier architecture; presentation, business logic and data. Bean based business logic interacts with the underlying Grid infrastructure and pre-existing external applications, while the presentation layer uses AJAX to offer an intuitive, functional interface to the back-end. Application data aggregating information from the portal as well as the external applications is persisted to the server memory cache and then to a backend database. We describe how the portal exploits standard, off-the-shelf commodity software together with existing Grid infrastructures in order to facilitate job submission and monitoring for the CMS collaboration. This paper describes the design, development, current functionality and plans for future enhancements of the portal.

A Web portal for CMS Grid job submission and management

International Nuclear Information System (INIS)

Braun, David; Neumeister, Norbert

2010-01-01

We present a Web portal for CMS Grid submission and management. The portal is built using a JBoss application server. It has a three tier architecture; presentation, business logic and data. Bean based business logic interacts with the underlying Grid infrastructure and pre-existing external applications, while the presentation layer uses AJAX to offer an intuitive, functional interface to the back-end. Application data aggregating information from the portal as well as the external applications is persisted to the server memory cache and then to a backend database. We describe how the portal exploits standard, off-the-shelf commodity software together with existing Grid infrastructures in order to facilitate job submission and monitoring for the CMS collaboration. This paper describes the design, development, current functionality and plans for future enhancements of the portal.

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.

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...

Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security

NARCIS (Netherlands)

Weng, Jiang; Yang, Yanjiang; Tang, Qiang; Deng, Robert H.; Bao, Feng

Recently, a variant of proxy re-encryption, named conditional proxy re-encryption (C-PRE), has been introduced. Compared with traditional proxy re-encryption, C-PRE enables the delegator to implement fine-grained delegation of decryption rights, and thus is more useful in many applications. In this

Optimizing TCP Performance over UMTS with Split TCP Proxy

DEFF Research Database (Denmark)

Hu, Liang; Dittmann, Lars

2009-01-01

. To cope with large delay bandwidth product, we propose a novel concept of split TCP proxy which is placed at GGSN between UNITS network and Internet. The split proxy divides the bandwidth delay product into two parts, resulting in two TCP connections with smaller bandwidth delay products which can...... be pipelined and thus operating at higher speeds. Simulation results show, the split TCP proxy can significantly improve the TCP performance in terms of RLC throughput under high bit rate DCH channel scenario (e.g.256 kbps). On the other hand, it only brings small performance improvement under low bit rate DCH...... scenario (e.g.64 kbps). Besides, the split TCP proxy brings more performance gain for downloading large files than downloading small ones. To the end, for the configuration of the split proxy, an aggressive initial TCP congestion window size (e.g. 10 MSS) at proxy is particularly useful for radio links...

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.

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

Family factors in end-of-life decision-making: family conflict and proxy relationship.

Science.gov (United States)

Parks, Susan Mockus; Winter, Laraine; Santana, Abbie J; Parker, Barbara; Diamond, James J; Rose, Molly; Myers, Ronald E

2011-02-01

Few studies have examined proxy decision-making regarding end-of-life treatment decisions. Proxy accuracy is defined as whether proxy treatment choices are consistent with the expressed wishes of their index elder. The purpose of this study was to examine proxy accuracy in relation to two family factors that may influence proxy accuracy: perceived family conflict and type of elder-proxy relationship. Telephone interviews with 202 community-dwelling elders and their proxy decision makers were conducted including the Life-Support Preferences Questionnaire (LSPQ), and a measure of family conflict, and sociodemographic characteristics, including type of relationship. Elder-proxy accuracy was associated with the type of elder-proxy relationship. Adult children demonstrated the lowest elder-proxy accuracy and spousal proxies the highest elder-proxy accuracy. Elder-proxy accuracy was associated with family conflict. Proxies reporting higher family conflict had lower elder-proxy accuracy. No interaction between family conflict and relationship type was revealed. Spousal proxies were more accurate in their substituted judgment than adult children, and proxies who perceive higher degree of family conflict tended to be less accurate than those with lower family conflict. Health care providers should be aware of these family factors when discussing advance care planning.

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.

An illustration of web survey

DEFF Research Database (Denmark)

He, Chen

A former study in the Danish primary schools has shown that there is an association between organic school food policies and indicators (proxies) for healthy eating among children when (school food coordinators) statements on indicators (proxies) for healthy eating are used as variable. This proj...... to be studied in a comparative study design where the Danish case (existing data from WBQ) will be compared with new data from school food service in Germany, Italy and Finland. These data is going to be collected through a web survey........ This project continue to search for the above signs of associations but involving also a “bottom” level (pupils) perspective in addition to the “top” level (school food coordinators) in the previous study. The project is to study the following hypothesis: organic food service praxis/policy (POP) is associated...... with praxis/policies for healthier eating in Danish school food service. In other words if organic procurement policies and the resulting praxis in schools can help build a healthier eating habits among pupils in such school as compared to schools without organic policies/praxis. The last perspective is going...

Potential influence of Web 2.0 usage and security practices of online users on information management

Directory of Open Access Journals (Sweden)

R.J. Rudman

2009-02-01

Full Text Available The proliferation of Web 2.0 applications was the impetus for this survey-based research into practices that online users currently employ when using Web 2.0 sites. As part of the study, the popularity of Web 2.0 technologies and sites among online users at a university was investigated to determine the extent of the potential threat to corporate security, arising from Web 2.0 use and access. The results of this study indicate that the use of Web 2.0 sites is very popular among students, as a proxy for the potential future business users, and that users are not necessarily aware of the risks associated with these sites. The respondents indicated that they regularly visit Web 2.0 sites, and that they post personal information on these sites. This is of concern in protecting arguably the most valuable asset of a business.

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.

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),...

Estimation of sedimentary proxy records together with associated uncertainty

OpenAIRE

Goswami, B.; Heitzig, J.; Rehfeld, K.; Marwan, N.; Anoop, A.; Prasad, S.; Kurths, J.

2014-01-01

Sedimentary proxy records constitute a significant portion of the recorded evidence that allows us to investigate paleoclimatic conditions and variability. However, uncertainties in the dating of proxy archives limit our ability to fix the timing of past events and interpret proxy record intercomparisons. While there are various age-modeling approaches to improve the estimation of the age–depth relations of archives, relatively little focus has been placed on the propagation...

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

Xcache in the ATLAS Distributed Computing Environment

CERN Document Server

Hanushevsky, Andrew; The ATLAS collaboration

2018-01-01

Built upon the Xrootd Proxy Cache (Xcache), we developed additional features to adapt the ATLAS distributed computing and data environment, especially its data management system RUCIO, to help improve the cache hit rate, as well as features that make the Xcache easy to use, similar to the way the Squid cache is used by the HTTP protocol. We are optimizing Xcache for the HPC environments, and adapting the HL-LHC Data Lakes design as its component for data delivery. We packaged the software in CVMFS, in Docker and Singularity containers in order to standardize the deployment and reduce the cost to resolve issues at remote sites. We are also integrating it into RUCIO as a volatile storage systems, and into various ATLAS workflow such as user analysis,

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…

Gradient-based model calibration with proxy-model assistance

Science.gov (United States)

Burrows, Wesley; Doherty, John

2016-02-01

Use of a proxy model in gradient-based calibration and uncertainty analysis of a complex groundwater model with large run times and problematic numerical behaviour is described. The methodology is general, and can be used with models of all types. The proxy model is based on a series of analytical functions that link all model outputs used in the calibration process to all parameters requiring estimation. In enforcing history-matching constraints during the calibration and post-calibration uncertainty analysis processes, the proxy model is run for the purposes of populating the Jacobian matrix, while the original model is run when testing parameter upgrades; the latter process is readily parallelized. Use of a proxy model in this fashion dramatically reduces the computational burden of complex model calibration and uncertainty analysis. At the same time, the effect of model numerical misbehaviour on calculation of local gradients is mitigated, this allowing access to the benefits of gradient-based analysis where lack of integrity in finite-difference derivatives calculation would otherwise have impeded such access. Construction of a proxy model, and its subsequent use in calibration of a complex model, and in analysing the uncertainties of predictions made by that model, is implemented in the PEST suite.

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 ...

Developing a proxy version of the Adult social care outcome toolkit (ASCOT).

Science.gov (United States)

Rand, Stacey; Caiels, James; Collins, Grace; Forder, Julien

2017-05-19

Social care-related quality of life is a key outcome indicator used in the evaluation of social care interventions and policy. It is not, however, always possible to collect quality of life data by self-report even with adaptations for people with cognitive or communication impairments. A new proxy-report version of the Adult Social Care Outcomes Toolkit (ASCOT) measure of social care-related quality of life was developed to address the issues of wider inclusion of people with cognitive or communication difficulties who may otherwise be systematically excluded. The development of the proxy-report ASCOT questionnaire was informed by literature review and earlier work that identified the key issues and challenges associated with proxy-reported outcomes. To evaluate the acceptability and content validity of the ASCOT-Proxy, qualitative cognitive interviews were conducted with unpaid carers or care workers of people with cognitive or communication impairments. The proxy respondents were invited to 'think aloud' while completing the questionnaire. Follow-up probes were asked to elicit further detail of the respondent's comprehension of the format, layout and content of each item and also how they weighed up the options to formulate a response. A total of 25 unpaid carers and care workers participated in three iterative rounds of cognitive interviews. The findings indicate that the items were well-understood and the concepts were consistent with the item definitions for the standard self-completion version of ASCOT with minor modifications to the draft ASCOT-Proxy. The ASCOT-Proxy allows respondents to rate the proxy-proxy and proxy-patient perspectives, which improved the acceptability of proxy report. A new proxy-report version of ASCOT was developed with evidence of its qualitative content validity and acceptability. The ASCOT-Proxy is ready for empirical testing of its suitability for data collection as a self-completion and/or interview questionnaire, and also

Web enabled data management with DPM and LFC

International Nuclear Information System (INIS)

Alvarez Ayllon, Alejandro; Beche, Alexandre; Furano, Fabrizio; Hellmich, Martin; Keeble, Oliver; Brito Da Rocha, Ricardo

2012-01-01

The Disk Pool Manager (DPM) and LCG File Catalog (LFC) are two grid data management components currently used in production with more than 240 endpoints. Together with a set of grid client tools they give the users a unified view of their data, hiding most details concerning data location and access. Recently we've put a lot of effort in developing a reliable and high performance HTTP/WebDAV frontend to both our grid catalog and storage components, exposing the existing functionality to users accessing the services via standard clients - e.g. web browsers, curl - present in all operating systems, giving users a simple and straight-forward way of interaction. In addition, as other relevant grid storage components (like dCache) expose their data using the same protocol, for the first time we had the opportunity of attempting a unified view of all grid storage using HTTP. We describe the HTTP redirection mechanism used to integrate the grid catalog(s) with the multiple storage components, including details on some assumptions made to allow integration with other implementations. We describe the way we hide the details regarding site availability or catalog inconsistencies by switching the standard HTTP client automatically between multiple replicas. We also present measurements of access performance, and the relevant factors regarding replica selection - current throughput and load, geographic proximity, etc. Finally, we report on some additional work done to have this system as a viable alternative to GridFTP, providing multi-stream transfers and exploiting some additional features of WebDAV to enable third party copies - essential for managing data movements between storage systems - with equivalent performance.

Justifying the need for forensically ready protocols: A case study of identifying malicious web servers using client honeypots

Energy Technology Data Exchange (ETDEWEB)

Seifert, Christian; Endicott-Popovsky, Barbara E.; Frincke, Deborah A.; Komisarczuk, Peter; Muschevici, Radu; Welch, Ian D.

2008-01-03

Abstract: Client honeypot technology can find malicious web servers that attack web browsers and push malware, so called drive-by-downloads, to the client machine. Merely recording the network traffic is insufficient to perform an efficient forensic analysis of the attack. Custom tools need to be developed to access and examine the embedded data of the network protocols. Once the information is extracted from the network data, it cannot be used to perform a behavioral analysis on the attack, therefore limiting the ability to answer what exactly happened on the attacked system. Implementation of a record/ replay mechanism is proposed that allows the forensic examiner to easily extract application data from recorded network streams and allows applications to interact with such data for behavioral analysis purposes. A concrete implementation of such a setup for HTTP and DNS protocols using the HTTP proxy Squid and DNS proxy pdnsd is presented and its effect on digital forensic analysis demonstrated.

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.)

Assimilation of a thermal remote sensing-based soil moisture proxy into a root-zone water balance model

Science.gov (United States)

Crow, W. T.; Kustas, W. P.

2006-05-01

Two types of Soil Vegetation Atmosphere Transfer (SVAT) modeling approaches are commonly applied to monitoring root-zone soil water availability. Water and Energy Balance (WEB) SVAT modeling are based forcing a prognostic water balance model with precipitation observations. In constrast, thermal Remote Sensing (RS) observations of canopy radiometric temperatures can be integrated into purely diagnostic SVAT models to predict the onset of vegetation water stress due to low root-zone soil water availability. Unlike WEB-SVAT models, RS-SVAT models do not require observed precipitation. Using four growings seasons (2001 to 2004) of profile soil moisture, micro-meteorology, and surface radiometric temperature observations at the USDA's OPE3 site, root-zone soil moisture predictions made by both WEB- and RS-SVAT modeling approaches are intercompared with each other and availible root- zone soil moisture observations. Results indicate that root-zone soil moisture estimates derived from a WEB- SVAT model have slightly more skill in detecting soil moisture anomalies at the site than comporable predictions from a competing RS-SVAT modeling approach. However, the relative advantage of the WEB-SVAT model disappears when it is forced with lower-quality rainfall information typical of continental and global-scale rainfall data sets. Most critically, root-zone soil moisture errors associated with both modeling approaches are sufficiently independent such that the merger of both information from both proxies - using either simple linear averaging or an Ensemble Kalman filter - creates a merge soil moisture estimate that is more accurate than either of its parent components.

Munchausen by Proxy Syndrome

Science.gov (United States)

... the Child Getting Help for the Parent or Caregiver Print Munchausen by proxy syndrome (MBPS) is a relatively rare form of child abuse that involves the exaggeration or fabrication of illnesses or symptoms by a primary caretaker. Also known as "medical child abuse," MBPS ...

Reliability and validity of a self-administration version of DEMQOL-Proxy.

Science.gov (United States)

Hendriks, A A Jolijn; Smith, Sarah C; Chrysanthaki, Theopisti; Black, Nick

2017-07-01

This study aimed to investigate the reliability and validity of a self-administered version of DEMQOL-Proxy, a disease-specific instrument that measures health-related quality of life in people with dementia. The sample consisted of 173 informal carers of people with dementia, aged 29 to 89 years old. Carers were mostly female, White/White British and closely related to the patient. They completed DEMQOL-Proxy (self-administered), EQ-5D-3L (proxy reported about the person with dementia), EQ-5D-3L (self-reported about their own health) and the Zarit Burden Interview. Using well-established methods from classical test theory, we evaluated scale level acceptability, reliability and convergent, discriminant and known-groups validity of DEMQOL-Proxy. DEMQOL-Proxy (self-administered) showed high acceptability (3.5% missing data and 0% scores at floor or ceiling), high internal consistency reliability (α = 0.93) and good convergent and discriminant validity. Amongst others, we found a moderately high correlation with EQ-5D-3L proxy reported (r = 0.52) and low to essentially zero correlations with EQ-5D-3L self-reported (r = 0.20) and carer and patient background variables (r ≤ 0.20). As predicted, DEMQOL-Proxy (self-administered) showed a modest correlation with DEMQOL (r = 0.32). Known-groups differences on health-related quality of life (comparing people with versus people without cognitive impairment) were of moderate effect size (d = 0.38) and in the expected direction. DEMQOL-Proxy (self-administered) has comparable acceptability, reliability and validity with DEMQOL-Proxy (interviewer administered). DEMQOL-Proxy (self-administered) can be used in a wider variety of contexts than its interviewer-administered version, including routine use in busy clinics. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Validation and application of a death proxy in adult cancer patients.

Science.gov (United States)

Mealing, Nicole M; Dobbins, Timothy A; Pearson, Sallie-Anne

2012-07-01

PURPOSE: Fact of death is not always available on data sets used for pharmacoepidemiological research. Proxies may be an appropriate substitute in the absence of death data. The purposes of this study were to validate a proxy for death in adult cancer patients and to assess its performance when estimating survival in two cohorts of cancer patients. METHODS: We evaluated 30-, 60-, 90- and 180-day proxies overall and by cancer type using data from 12 394 Australian veterans with lung, colorectal, breast or prostate cancer. The proxy indicated death if the difference between the last dispensing record and the end of the observational period exceeded the proxy cutoff. We then compared actual survival to 90-day proxy estimates in a subset of 4090 veterans with 'full entitlements' for pharmaceutical items and in 3704 Australian women receiving trastuzumab for HER2+ metastatic breast cancer. RESULTS: The 90-day proxy was optimal with an overall sensitivity of 99.3% (95%CI: 98.4-99.7) and a specificity of 97.6% (95%CI: 91.8-99.4). These measures remained high when evaluated by cancer type and spread of disease. The application of the proxy using the most conservative date of death estimate (date of last dispensing) generally underestimated survival, with estimates up to 3 months shorter than survival based on fact of death. CONCLUSIONS: A 90-day death proxy is a robust substitute to identify death in a chronic population when fact of death is not available. The proxy is likely to be valid across a range of chronic diseases as it relies on the presence of 'regular' dispensing records for individual patients. Copyright © 2011 John Wiley & Sons, Ltd. Copyright © 2011 John Wiley & Sons, Ltd.

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...

KBWS: an EMBOSS associated package for accessing bioinformatics web services.

Science.gov (United States)

Oshita, Kazuki; Arakawa, Kazuharu; Tomita, Masaru

2011-04-29

The availability of bioinformatics web-based services is rapidly proliferating, for their interoperability and ease of use. The next challenge is in the integration of these services in the form of workflows, and several projects are already underway, standardizing the syntax, semantics, and user interfaces. In order to deploy the advantages of web services with locally installed tools, here we describe a collection of proxy client tools for 42 major bioinformatics web services in the form of European Molecular Biology Open Software Suite (EMBOSS) UNIX command-line tools. EMBOSS provides sophisticated means for discoverability and interoperability for hundreds of tools, and our package, named the Keio Bioinformatics Web Service (KBWS), adds functionalities of local and multiple alignment of sequences, phylogenetic analyses, and prediction of cellular localization of proteins and RNA secondary structures. This software implemented in C is available under GPL from http://www.g-language.org/kbws/ and GitHub repository http://github.com/cory-ko/KBWS. Users can utilize the SOAP services implemented in Perl directly via WSDL file at http://soap.g-language.org/kbws.wsdl (RPC Encoded) and http://soap.g-language.org/kbws_dl.wsdl (Document/literal).

KBWS: an EMBOSS associated package for accessing bioinformatics web services

Directory of Open Access Journals (Sweden)

Tomita Masaru

2011-04-01

Full Text Available Abstract The availability of bioinformatics web-based services is rapidly proliferating, for their interoperability and ease of use. The next challenge is in the integration of these services in the form of workflows, and several projects are already underway, standardizing the syntax, semantics, and user interfaces. In order to deploy the advantages of web services with locally installed tools, here we describe a collection of proxy client tools for 42 major bioinformatics web services in the form of European Molecular Biology Open Software Suite (EMBOSS UNIX command-line tools. EMBOSS provides sophisticated means for discoverability and interoperability for hundreds of tools, and our package, named the Keio Bioinformatics Web Service (KBWS, adds functionalities of local and multiple alignment of sequences, phylogenetic analyses, and prediction of cellular localization of proteins and RNA secondary structures. This software implemented in C is available under GPL from http://www.g-language.org/kbws/ and GitHub repository http://github.com/cory-ko/KBWS. Users can utilize the SOAP services implemented in Perl directly via WSDL file at http://soap.g-language.org/kbws.wsdl (RPC Encoded and http://soap.g-language.org/kbws_dl.wsdl (Document/literal.

Fighting terrorism in Africa by proxy

DEFF Research Database (Denmark)

Olsen, Gorm Rye

2014-01-01

The French intervention in Mali in early 2013 emphasizes that the decision-makers in Paris, Brussels, and Washington considered the establishment of the radical Islamist regime in Northern Mali a threat to their security interests. The widespread instability including the rise of radical Islamist...... groups in Somalia was perceived as a threat to western interests. It is the core argument of the paper if western powers decide to provide security in Africa, they will be inclined to use proxy instead of deploying own troops. Security provision by proxy in African means that African troops are doing...

SISTEM OTENTIKASI UNTUK SQUID BERBASIS WEB

Directory of Open Access Journals (Sweden)

Febriliyan Samopa

2006-07-01

Full Text Available Dalam sebuah jaringan komputer terdapat bermacam-macam tipe user dengan berbagi tingkatan yang berbeda yang juga dibutuhkan perlakuan yang berbeda pada tiap user yang disesuaikan dengan kebutuhan dalam menggunakan akses web, baik berupa http, ftp, gopher, dan lain-lain. Dimana masing-masing user memiliki skala prioritas dalam penggunaan bandwidth, jumlah koneksi maksimum, waktu koneksi, ukuran file maksimum, situs yang tidak boleh diakses dan lain-lain. Tujuan dari penelitian ini adalah membuat sebuah perangkat lunak yang dapat melakukan otentikasi user berdasarkan data konfigurasi yang disimpan dalam basisdata. Selain itu, perangkat lunak yang dibuat dapat memproses request dari client berdasarkan data konfigurasi dengan lebih cepat. Permasalahan yang mucul adalah bagaimana merancang dan membuat suatu perangkat lunak yang dapat melakukan otentikasi user berdasarkan data konfigurasi yang diambil dari basisdata, serta dapat memproses request dari client dengan lebih cepat berdasarkan hak akses yang dimilikinya.Dalam penelitian ini didesain dan diimplementasikan suatu sistem otentikasi user dengan mengambil data user yang tersimpan dalam basisdata MySQL. Disamping itu, dilakukan rekayasa pada beberapa rutin proses yang terdapat dalam squid proxy, supaya proses-proses dapat melakukan pengambilan data konfigurasi yang dialihkan dan disimpan dalam basisdata MySQL. Data konfigurasi ini didasarkan pada pembagian hak akses yang dimiliki oleh masing-masing grup user. Antarmuka berbasis web digunakan sebagai salah satu layanan bagi admin untuk mempermudah pengelolaan dan pengolahan data konfigurasi yang dibuat.Berdasarkan uji coba yang telah dilakukan, terbukti sistem yang dibuat dapat bekerja dengan baik dan tidak melenceng dari fungsi asli sebelum dilakukan perubahan. Bahkan pada penanganan request client yang berukuran besar, kinerja squid mengalami peningkatan dalam hal kecepatan proses yang dibutuhkan. Sebagai contoh, request client pada  file

Applicability of a cognitive questionnaire in the elderly and proxy

Directory of Open Access Journals (Sweden)

Renata Areza Fegyveres

Full Text Available Abstract The Informant Questionnaire on Cognitive Decline in the Elderly with the Proxy (IQCODE was developed as a screening tool for cognition alterations. Objectives: 1 To verify the applicability of IQCODE in the elderly with limited schooling, 2 To verify the reliability of the responses supplied by the aged and their proxies. Methods: Individuals of a Community Group were evaluated using the Mini-Mental State Examination (MMSE, IQCODE and Geriatric Depression Scale (GDS. The IQCODE was applied to informants and proxies. Results: We analyzed 44 individuals, aged between 58-82 years (M=66.8, SD=5.97 with mean elderly-schooling level of 3.75, SD=2.82 and 44 proxies aged 44.5 (SD=13.3, with mean schooling level of 8.25 (SD=4.3. The mean GDS was 8.22, SD=4.90 and 13 participants presented a score suggestive of depressive symptoms. The mean elderly IQCODE score was 3.26, SD=0.69 and 3.21, SD=0.65, for proxy responses. There was no statistical difference between these means. On the MMSE, the mean score was 24.20, SD=4.14 and 18 participants presented scores below the cut-off. The IQCODE answers by the elderly in this latter group were more congruent with MMSE than the answers of proxies. Conclusions: The applicability of the IQCODE in a population with little schooling was verified in that the proxy-report was similar to the elderly report. We can affirm that the elderly answers were more accurate than the proxies, as they were closer to MMSE score. The inclusion of a greater number of participants from community-dwelling settings is necessary to confirm the results obtained in this study.

Munchausen syndrome by proxy

Directory of Open Access Journals (Sweden)

Jovanović Aleksandar A.

2005-01-01

Full Text Available This review deals with bibliography on Munchausen syndrome by proxy (MSbP. The name of this disorder was introduced by English psychiatrist Roy Meadow who pointed to diagnostic difficulties as well as to serious medical and legal connotations of MSbP. MSbP was classified in DSM-IV among criteria sets provided for further study as "factitious disorder by proxy", while in ICD-10, though not explicitly cited, MSbP might be classified as "factitious disorders" F68.1. MSbP is a special form of abuse where the perpetrator induces somatic or mental symptoms of illness in the victim under his/her care and then persistently presents the victims for medical examinations and care. The victim is usually a preschool child and the perpetrator is the child's mother. Motivation for such pathological behavior of perpetrator is considered to be unconscious need to assume sick role by proxy while external incentives such as economic gain are absent. Conceptualization of MSbP development is still in the domain of psychodynamic speculation, its course is chronic and the prognosis is poor considering lack of consistent, efficient and specific treatment. The authors also present the case report of thirty-three year-old mother who had been abusing her nine year-old son both emotionally and physically over the last several years forcing him to, together with her, report to the police, medical and educational institutions that he had been the victim of rape, poisoning and beating by various individuals, especially teaching and medical staff. Mother manifested psychosis and her child presented with impaired cognitive development, emotional problems and conduct disorder.

Evaluation of patient and proxy responses on the activity measure for postacute care.

Science.gov (United States)

Jette, Alan M; Ni, Pengsheng; Rasch, Elizabeth K; Appelman, Jed; Sandel, M Elizabeth; Terdiman, Joseph; Chan, Leighton

2012-03-01

Our objective was to examine the agreement between adult patients with stroke and family member or clinician proxies in activity measure for postacute care (AM-PAC) summary scores for daily activity, basic mobility, and applied cognitive function. This study involved 67 patients with stroke admitted to a hospital within the Kaiser Permanente of Northern California system and were participants in a parent study on stroke outcomes. Each participant and proxy respondent completed the AM-PAC by personal or telephone interview at the point of hospital discharge or during ≥1 transitions to different postacute care settings. The results suggest that for patients with a stroke proxy, AM-PAC data are robust for family or clinician proxy assessment of basic mobility function and clinician proxy assessment of daily activity function, but less robust for family proxy assessment of daily activity function and for all proxy groups' assessments of applied cognitive function. The pattern of disagreement between patient and proxy was, on average, relatively small and random. There was little evidence of systematic bias between proxy and patient reports of their functional status. The degree of concordance between patient and proxy was similar for those with moderate to severe strokes compared with mild strokes. Patient and proxy ratings on the AM-PAC achieved adequate agreement for use in stroke research when using proxy respondents could reduce sample selection bias. The AM-PAC data can be implemented across institutional as well as community care settings while achieving precision and reducing respondent burden.

Proxy-rated quality of life in Alzheimer's disease

DEFF Research Database (Denmark)

Vogel, Asmus; Bhattacharya, Suvosree; Waldorff, Frans Boch

2012-01-01

The study investigated the change in proxy rated quality of life (QoL) of a large cohort of home living patients with Alzheimer's disease (AD) over a period of 36 months.......The study investigated the change in proxy rated quality of life (QoL) of a large cohort of home living patients with Alzheimer's disease (AD) over a period of 36 months....

Longitudinal proxy measurements in multiple sclerosis: patient-proxy agreement on the impact of MS on daily life over a period of two years

Directory of Open Access Journals (Sweden)

Thompson Alan J

2008-02-01

Full Text Available Abstract Background The use of self-report measurements in clinical settings is increasing. However, in patients with limitations that interfere with reliable self-assessment such as cognitive impairment or mood disturbances, as may be the case in multiple sclerosis (MS, data collection might be problematic. In these situations, information obtained from proxy respondents (e.g. partners may replace self-ratings. The aim of this study was to examine the value of proxy ratings at separate points in time and to assess patient-proxy agreement on possible changes in disease impact of MS. Methods Fifty-six MS patients and their partners completed the Multiple Sclerosis Impact Scale (MSIS-29 at baseline and follow-up, two years later. Patient-proxy agreement was assessed at both time points by calculating intraclass correlation coefficients (ICCs, exact and global agreement and the mean directional differences between groups. Agreement of change over time was assessed by calculating ICCs between change scores. In parallel, global ratings of both patients and proxy respondents of the extent to which the patient had improved or deteriorated over the past two years were collected to validate possible changes on the MSIS-29. Results At both time points, agreement on the physical scale was higher than agreement on the psychological scale (ICCs at baseline were 0.81 for the physical scale and 0.72 for the psychological scale; at follow-up, the ICC values were 0.86 and 0.65 respectively. At follow-up, statistically significant mean differences between patients and proxies were noted for the physical scale (-4.8 ± 12.7, p = 0.006 and the psychological scale (-8.9 ± 18.8, p = 0.001. Agreement between change scores on the MSIS-29 was fair (ICC Conclusion Proxy respondents could act as a reliable source of information in cross-sectional studies. Moreover, results suggested that agreement on change over time might be better for proxy respondents compared to

The design and implementation about the project of optimizing proxy servers

International Nuclear Information System (INIS)

Wu Ling; Liu Baoxu

2006-01-01

Proxy server is an important facility in the network of an organization, which play an important role in security and access control and accelerating access of Internet. This article introduces the action of proxy servers, and expounds the resolutions to optimize proxy servers at IHEP: integration, dynamic domain name resolves and data synchronization. (authors)

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

Pattern-mixture models for analyzing normal outcome data with proxy respondents.

Science.gov (United States)

Shardell, Michelle; Hicks, Gregory E; Miller, Ram R; Langenberg, Patricia; Magaziner, Jay

2010-06-30

Studies of older adults often involve interview questions regarding subjective constructs such as perceived disability. In some studies, when subjects are unable (e.g. due to cognitive impairment) or unwilling to respond to these questions, proxies (e.g. relatives or other care givers) are recruited to provide responses in place of the subject. Proxies are usually not approached to respond on behalf of subjects who respond for themselves; thus, for each subject, data from only one of the subject or proxy are available. Typically, proxy responses are simply substituted for missing subject responses, and standard complete-data analyses are performed. However, this approach may introduce measurement error and produce biased parameter estimates. In this paper, we propose using pattern-mixture models that relate non-identifiable parameters to identifiable parameters to analyze data with proxy respondents. We posit three interpretable pattern-mixture restrictions to be used with proxy data, and we propose estimation procedures using maximum likelihood and multiple imputation. The methods are applied to a cohort of elderly hip-fracture patients. (c) 2010 John Wiley & Sons, Ltd.

Some Proxy Signature and Designated verifier Signature Schemes over Braid Groups

OpenAIRE

Lal, Sunder; Verma, Vandani

2009-01-01

Braids groups provide an alternative to number theoretic public cryptography and can be implemented quite efficiently. The paper proposes five signature schemes: Proxy Signature, Designated Verifier, Bi-Designated Verifier, Designated Verifier Proxy Signature And Bi-Designated Verifier Proxy Signature scheme based on braid groups. We also discuss the security aspects of each of the proposed schemes.

Reliability of proxy respondents for patients with stroke: a systematic review.

Science.gov (United States)

Oczkowski, Colin; O'Donnell, Martin

2010-01-01

Proxy respondents are an important aspect of stroke medicine and research. We performed a systematic review of studies evaluating the reliability of proxy respondents for stroke patients. Studies were identified by searches of MEDLINE, Google, and the Cochrane Library between January 1969 and June 2008. All were prospective or cross-sectional studies reporting the reliability of proxy respondents for patients with a history of previous stroke or transient ischemic attack. One author abstracted data. For each study, intraclass correlation (ICC) or the k-statistic was categorized as poor (0.80). Thirteen studies, with a total of 2618 participants, met our inclusion criteria. Most studies recruited patients >3 months after their stroke. Of these studies, 5 (360 participants; 5 scales) evaluated reliability of proxy respondents for activities of daily living (ADL), and 9 (2334 participants; 9 scales) evaluated reliability of proxy respondents for quality of life (QoL). One study evaluated both. In studies, the ICC/k for scales ranged from 0.61 to 0.91 for ADL and from 0.41 to 0.8 for QoL. Most studies reported that proxy respondents overestimated impairments compared with patient self-reports. Stroke severity and objective nature of questions were the most consistent determinants of disagreement between stroke patient and proxy respondent. Our data indicate that beyond the acute stroke period, the reliability of proxy respondents for validated scales of ADL was substantial to excellent, while that of scales for QoL was moderate to substantial. Copyright (c) 2010 National Stroke Association. Published by Elsevier Inc. All rights reserved.

Proxy-produced ethnographic work: what are the problems, issues, and dilemmas arising from proxy ethnography?

DEFF Research Database (Denmark)

Martinussen, Marie Louise; Højbjerg, Karin; Tamborg, Andreas Lindenskov

2018-01-01

This article addresses the implications of research-student cooperation in the production of empirical material. For the student to replace the experienced researcher and work under the researcher’s supervision, we call such work proxy-produced ethnographic work. The specific relations...... and positions arising from such a setup between the teacher/researcher and the proxy ethnographer/student are found to have implications for the ethnographies produced. This article’s main focus is to show how these relations and positions have not distorted the ethnographic work and the ethnographies but......, rather, have oriented it in certain ways. It is shown how the participating researchers – both senior and junior - have distinctive, incorporated dispositions with which they pre-consciously participate in an implicit and subtle relation that can make it very easy to overlook distortions during...

Analyzing differences between patient and proxy on Patient Reported Outcomes in multiple sclerosis.

Science.gov (United States)

Sonder, Judith M; Holman, Rebecca; Knol, Dirk L; Bosma, Libertje V A E; Polman, Chris H; Uitdehaag, Bernard M J

2013-11-15

Proxy respondents, partners of multiple sclerosis (MS) patients, can provide valuable information on the MS patients' disease. In an earlier publication we found relatively good agreement on patient reported outcomes (PROs) measuring physical impact and functioning, but we found large differences on (neuro)psychological scales. We aim to identify patient and proxy related variables explaining differences between patients' and proxies' ratings on five PROs. We report on data from 175 MS patients and proxy respondents. Regression analyses were performed, using as dependent variable the mean differences on five scales: Physical and Psychological scale of the Multiple Sclerosis Impact Scale (MSIS-29), the Multiple Sclerosis Walking Scale (MSWS), Guy's Neurological Disability Scale (GNDS) and the Multiple Sclerosis Neuropsychological Screening Questionnaire (MSNQ). The independent variables were patient, proxy and disease related variables. Caregiver strain was significantly related to differences between patient and proxy scores for all five PROs. A higher level of patient anxiety on the HADS was linked to larger differences on all PROs except the GNDS. In addition, cognitive functioning, proxy depression, walking ability, proxy gender and MS related disability were contributing to the discrepancies. We found several patient and proxy factors that may contribute to discrepancies between patient and proxy scores on MS PROs. The most important factor is caregiver burden. © 2013 Elsevier B.V. All rights reserved.

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...

The Difference Between Using Proxy Server and VPN

Directory of Open Access Journals (Sweden)

David Dwiputra Kurniadi

2015-11-01

For example, looking for software, game through internet. But sometimes, there are some websites that cannot be opened as they have Internet Positive notificatio. To solve that problem, hacker found the solution by creating Proxy Server or VPN. In this time internet is very modern and very easy to access and there are a lot of Proxy Server and VPN that can be easly used.

The Intra-Industry Effects of Proxy Contests

OpenAIRE

Fang Chen; Jian Huang; Han Yu

2018-01-01

This paper is the first study on the intra-industry effects of proxy contests. Using a sample of proxy contests from January 1988 through December 2008, we identify a striking cross-sectional difference in market reaction to the target companies. As much as 61% of the target firms have a significant positive cumulative abnormal return (CARs) in the period (‒10, +10) around the announcement day, while 39% of the target firms have the negative CARs in the same event window. Moreover, we find th...

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.

Architecture of a bi-directional Bluetooth-UPnP proxy

NARCIS (Netherlands)

Delphinanto, A.; Lukkien, J.J.; Koonen, A.M.J.; Hartog, F.T.H. den; Madureira, A.J.P.S.; Niemegeers, I.G.M.M.; Selgert, F.

2007-01-01

The current service- and device discovery protocols are not platform- and network independent Therefore, proxy servers will be needed to extend the range of IP-based discovery protocols to non-IP domains. We developed an architecture of a proxy that enables UPnP devices and services to be discovered

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.

Slices: A shape-proxy based on planar sections

KAUST Repository

McCrae, James

2011-12-01

Minimalist object representations or shape-proxies that spark and inspire human perception of shape remain an incompletely understood, yet powerful aspect of visual communication. We explore the use of planar sections, i.e., the contours of intersection of planes with a 3D object, for creating shape abstractions, motivated by their popularity in art and engineering. We first perform a user study to show that humans do define consistent and similar planar section proxies for common objects. Interestingly, we observe a strong correlation between user-defined planes and geometric features of objects. Further we show that the problem of finding the minimum set of planes that capture a set of 3D geometric shape features is both NP-hard and not always the proxy a user would pick. Guided by the principles inferred from our user study, we present an algorithm that progressively selects planes to maximize feature coverage, which in turn influence the selection of subsequent planes. The algorithmic framework easily incorporates various shape features, while their relative importance values are computed and validated from the user study data. We use our algorithm to compute planar slices for various objects, validate their utility towards object abstraction using a second user study, and conclude showing the potential applications of the extracted planar slice shape proxies.

Differences between Proxy and Patient Assessments of Cancer Care Experiences and Quality Ratings.

Science.gov (United States)

Roydhouse, Jessica K; Gutman, Roee; Keating, Nancy L; Mor, Vincent; Wilson, Ira B

2018-04-01

To assess the impact of proxy survey responses on cancer care experience reports and quality ratings. Secondary analysis of data from Cancer Care Outcomes Research and Surveillance (CanCORS). Recruitment occurred from 2003 to 2005. The study was a cross-sectional observational study. The respondents were patients with incident colorectal or lung cancer or their proxies. Analyses used linear regression models with an independent variable for proxy versus patient responses as well as study site and clinical covariates. The outcomes were experiences with medical care, nursing care, care coordination, and care quality rating. Multiple imputation was used for missing data. Among 6,471 respondents, 1,011 (16 percent) were proxies. The proportion of proxy respondents varied from 6 percent to 28 percent across study sites. Adjusted proxy scores were modestly higher for medical care experiences (+1.28 points [95 percent CI:+ 0.05 to +2.51]), but lower for nursing care (-2.81 [95 percent CI: -4.11 to -1.50]) and care coordination experiences (-2.98 [95 percent CI: -4.15 to -1.81]). There were no significant differences between adjusted patient and proxy ratings of quality. Proxy responses have small but statistically significant differences from patient responses. However, if ratings of care are used for financial incentives, such differences could be exaggerated across practices or areas if proxy use varies. © Health Research and Educational Trust.

Consistent data recording across a health system and web-enablement allow service quality comparisons: online data for commissioning dermatology services.

Science.gov (United States)

Dmitrieva, Olga; Michalakidis, Georgios; Mason, Aaron; Jones, Simon; Chan, Tom; de Lusignan, Simon

2012-01-01

A new distributed model of health care management is being introduced in England. Family practitioners have new responsibilities for the management of health care budgets and commissioning of services. There are national datasets available about health care providers and the geographical areas they serve. These data could be better used to assist the family practitioner turned health service commissioners. Unfortunately these data are not in a form that is readily usable by these fledgling family commissioning groups. We therefore Web enabled all the national hospital dermatology treatment data in England combining it with locality data to provide a smart commissioning tool for local communities. We used open-source software including the Ruby on Rails Web framework and MySQL. The system has a Web front-end, which uses hypertext markup language cascading style sheets (HTML/CSS) and JavaScript to deliver and present data provided by the database. A combination of advanced caching and schema structures allows for faster data retrieval on every execution. The system provides an intuitive environment for data analysis and processing across a large health system dataset. Web-enablement has enabled data about in patients, day cases and outpatients to be readily grouped, viewed, and linked to other data. The combination of web-enablement, consistent data collection from all providers; readily available locality data; and a registration based primary system enables the creation of data, which can be used to commission dermatology services in small areas. Standardized datasets collected across large health enterprises when web enabled can readily benchmark local services and inform commissioning decisions.

Qualitative and Quantitative Sentiment Proxies

DEFF Research Database (Denmark)

Zhao, Zeyan; Ahmad, Khurshid

2015-01-01

Sentiment analysis is a content-analytic investigative framework for researchers, traders and the general public involved in financial markets. This analysis is based on carefully sourced and elaborately constructed proxies for market sentiment and has emerged as a basis for analysing movements...

Host, family and community proxies for infections potentially associated with leukaemia

International Nuclear Information System (INIS)

Law, G. R.

2008-01-01

Three hypotheses have proposed the involvement of infections in the aetiology of childhood leukaemia, suggesting either a specific leukemogenic infection or a series of common infections that lead to a dys-regulation of the immune system. Much of the evidence for the link with infections has been based on epidemiological observations, often using proxy measures of infection. Proxy measures include population mixing, parental occupation, age distribution of incidence, spatial and space-time clustering of cases, birth order and day care during infancy. This paper discusses the proxies used and examines to what extent a commonly used proxy measure, birth order, is a fair representation of either specific infections or general infectious load. It is clear that although leukaemia, and other diseases, may be linked with infections, one needs to (1) measure specific and general infections with more accuracy and (2) understand how proxy measures relate to real infections in the population. (authors)

Forecasting Lightning Threat Using WRF Proxy Fields

Science.gov (United States)

McCaul, E. W., Jr.

2010-01-01

Objectives: Given that high-resolution WRF forecasts can capture the character of convective outbreaks, we seek to: 1. Create WRF forecasts of LTG threat (1-24 h), based on 2 proxy fields from explicitly simulated convection: - graupel flux near -15 C (captures LTG time variability) - vertically integrated ice (captures LTG threat area). 2. Calibrate each threat to yield accurate quantitative peak flash rate densities. 3. Also evaluate threats for areal coverage, time variability. 4. Blend threats to optimize results. 5. Examine sensitivity to model mesh, microphysics. Methods: 1. Use high-resolution 2-km WRF simulations to prognose convection for a diverse series of selected case studies. 2. Evaluate graupel fluxes; vertically integrated ice (VII). 3. Calibrate WRF LTG proxies using peak total LTG flash rate densities from NALMA; relationships look linear, with regression line passing through origin. 4. Truncate low threat values to make threat areal coverage match NALMA flash extent density obs. 5. Blend proxies to achieve optimal performance 6. Study CAPS 4-km ensembles to evaluate sensitivities.

Analysis of Quality of Proxy Questions in Health Surveys by Behavior Coding

NARCIS (Netherlands)

Benitez, I.; Padilla, J.L.; Ongena, Yfke

2012-01-01

The aim of this study is to show how to analyze the quality of questions for proxy informants by means of behavior coding. Proxy questions can undermine survey data quality because of the fact that proxies respond to questions on behalf of other people. Behavior coding can improve questions by

Enhancing Accessibility of Web Content for the Print-Impaired and Blind People

Science.gov (United States)

Chalamandaris, Aimilios; Raptis, Spyros; Tsiakoulis, Pirros; Karabetsos, Sotiris

Blind people and in general print-impaired people are often restricted to use their own computers, enhanced most often with expensive, screen reading programs, in order to access the web, and in a form that every screen reading program allows to. In this paper we present SpellCast Navi, a tool that is intended for people with visual impairments, which attempts to combine advantages from both customized and generic web enhancement tools. It consists of a generically designed engine and a set of case-specific filters. It can run on a typical web browser and computer, without the need of installing any additional application locally. It acquires and parses the content of web pages, converts bi-lingual text into synthetic speech using high quality speech synthesizer, and supports a set of common functionalities such as navigation through hotkeys, audible navigation lists and more. By using a post-hoc approach based on a-priori information of the website's layout, the audible presentation and navigation through the website is more intuitive a more efficient than with a typical screen reading application. SpellCast Navi poses no requirements on web pages and introduces no overhead to the design and development of a website, as it functions as a hosted proxy service.

Statistical framework for evaluation of climate model simulations by use of climate proxy data from the last millennium – Part 2: A pseudo-proxy study addressing the amplitude of solar forcing

Directory of Open Access Journals (Sweden)

A. Hind

2012-08-01

Full Text Available The statistical framework of Part 1 (Sundberg et al., 2012, for comparing ensemble simulation surface temperature output with temperature proxy and instrumental records, is implemented in a pseudo-proxy experiment. A set of previously published millennial forced simulations (Max Planck Institute – COSMOS, including both "low" and "high" solar radiative forcing histories together with other important forcings, was used to define "true" target temperatures as well as pseudo-proxy and pseudo-instrumental series. In a global land-only experiment, using annual mean temperatures at a 30-yr time resolution with realistic proxy noise levels, it was found that the low and high solar full-forcing simulations could be distinguished. In an additional experiment, where pseudo-proxies were created to reflect a current set of proxy locations and noise levels, the low and high solar forcing simulations could only be distinguished when the latter served as targets. To improve detectability of the low solar simulations, increasing the signal-to-noise ratio in local temperature proxies was more efficient than increasing the spatial coverage of the proxy network. The experiences gained here will be of guidance when these methods are applied to real proxy and instrumental data, for example when the aim is to distinguish which of the alternative solar forcing histories is most compatible with the observed/reconstructed climate.

Robotic Vehicle Proxy Simulation, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — Energid Technologies proposes the development of a digital simulation that can replace robotic vehicles in field studies. This proxy simulation will model the...

System Identification Based Proxy Model of a Reservoir under Water Injection

Directory of Open Access Journals (Sweden)

Berihun M. Negash

2017-01-01

Full Text Available Simulation of numerical reservoir models with thousands and millions of grid blocks may consume a significant amount of time and effort, even when high performance processors are used. In cases where the simulation runs are required for sensitivity analysis, dynamic control, and optimization, the act needs to be repeated several times by continuously changing parameters. This makes it even more time-consuming. Currently, proxy models that are based on response surface are being used to lessen the time required for running simulations during sensitivity analysis and optimization. Proxy models are lighter mathematical models that run faster and perform in place of heavier models that require large computations. Nevertheless, to acquire data for modeling and validation and develop the proxy model itself, hundreds of simulation runs are required. In this paper, a system identification based proxy model that requires only a single simulation run and a properly designed excitation signal was proposed and evaluated using a benchmark case study. The results show that, with proper design of excitation signal and proper selection of model structure, system identification based proxy models are found to be practical and efficient alternatives for mimicking the performance of numerical reservoir models. The resulting proxy models have potential applications for dynamic well control and optimization.

Limiting exercise options: depending on a proxy may inhibit exercise self-management.

Science.gov (United States)

Shields, Christopher A; Brawley, Lawrence R

2007-07-01

We examined the influence of proxy-assistance on exercisers' social cognitions and behavior. Fifty-six fitness class participants reported preference for proxy-assistance and reacted to exercising in different contexts. A 2 (proxy-led vs self-managed exercise context) by 2 (preferred assistance) MANOVA revealed significant assistance by context interactions for self-regulatory efficacy (SRE) and difficulty. Regarding self-managed exercise, high-assistance individuals expressed lower SRE and higher difficulty. Chi-square analysis revealed that significantly fewer high-assistance participants chose self-managed exercise. A one-way MANOVA on preferred assistance indicated that high-assistance participants were less confident, satisfied and perceived their self-managed exercise as more difficult. Results support Bandura's theorizing that use of a proxy can limit SRE of those preferring the proxy's control of their behavior.

[Validity and reliability of the spanish EQ-5D-Y proxy version].

Science.gov (United States)

Gusi, N; Perez-Sousa, M A; Gozalo-Delgado, M; Olivares, P R

2014-10-01

A proxy version of the EQ-5D-Y, a questionnaire to evaluate the Health Related Quality of Life (HRQoL) in children and adolescents, has recently been developed. There are currently no data on the validity and reliability of this tool. The objective of this study was to analyze the validity and reliability of the EQ-5D-Y proxy version. A core set of self-report tools, including the Spanish version of the EQ-5D-Y were administered to a group of Spanish children and adolescents drawn from the general population. A similar core set of internationally standardized proxy tools, including the EQ-5D-Y proxy version were administered to their parents. Test-retest reliability was determined, and correlations with other generic measurements of HRQoL were calculated. Additionally, known group validity was examined by comparing groups with a priori expected differences in HRQoL. The agreement between the self-report and proxy version responses was also calculated. A total of 477 children and adolescents and their parents participated in the study. One week later, 158 participants completed the EQ-5D-Y/EQ-5D-Y proxy to facilitate reliability analysis. Agreement between the test-retest scores was higher than 88% for EQ-5D-Y self-report, and proxy version. Correlations with other health measurements showed similar convergent validity to that observed in the international EQ-5D-Y. Agreement between the self-report and proxy versions ranged from 72.9% to 97.1%. The results provide preliminary evidence of the reliability and validity of the EQ-5D-Y proxy version. Copyright © 2013 Asociación Española de Pediatría. Published by Elsevier Espana. All rights reserved.

Testing the timing of radiocarbon-dated events between proxy archives

NARCIS (Netherlands)

Christen, J. A.; Mauquoy, D.; van der Plicht, J.; Bennett, K. D.; Blaauw, Maarten

For interpreting past changes on a regional or global scale, the timings of proxy-inferred events are usually aligned with data from other locations. However, too often chronological uncertainties are ignored in proxy diagrams and multisite comparisons, making it possible for researchers to fall

Cryptanalytic Performance Appraisal of Improved CCH2 Proxy Multisignature Scheme

Directory of Open Access Journals (Sweden)

Raman Kumar

2014-01-01

Full Text Available Many of the signature schemes are proposed in which the t out of n threshold schemes are deployed, but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multisignature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity, and computational overhead of improved CCH1 and CCH2 proxy multisignature schemes. We have presented cryptanalysis of improved CCH2 proxy multisignature scheme and showed that improved CCH2 scheme suffered from various attacks, that is, forgery attack and framing attack.

Proxy and patient reports of health-related quality of life in a national cancer survey.

Science.gov (United States)

Roydhouse, Jessica K; Gutman, Roee; Keating, Nancy L; Mor, Vincent; Wilson, Ira B

2018-01-05

Proxy respondents are frequently used in surveys, including those assessing health-related quality of life (HRQOL). In cancer, most research involving proxies has been undertaken with paired proxy-patient populations, where proxy responses are compared to patient responses for the same individual. In these populations, proxy-patient differences are small and suggest proxy underestimation of patient HRQOL. In practice, however, proxy responses will only be used when patient responses are not available. The difference between proxy and patient reports of patient HRQOL where patients are not able to report for themselves in cancer is not known. The objective of this study was to evaluate the difference between patient and proxy reports of patient HRQOL in a large national cancer survey, and determine if this difference could be mitigated by adjusting for clinical and sociodemographic information about patients. Data were from the Cancer Care Outcomes Research and Surveillance (CanCORS) study. Patients or their proxies were recruited within 3-6 months of diagnosis with lung or colorectal cancer. HRQOL was measured using the SF-12 mental and physical composite scales. Differences of ½ SD (=5 points) were considered clinically significant. The primary independent variable was proxy status. Linear regression models were used to adjust for patient sociodemographic and clinical covariates, including cancer stage, patient age and education, and patient co-morbidities. Of 6471 respondents, 1011 (16%) were proxies. Before adjustment, average proxy-reported scores were lower for both physical (-6.7 points, 95% CI -7.4 to -5.9) and mental (-6 points, 95% CI -6.7 to -5.2) health. Proxy-reported scores remained lower after adjustment (physical: -5.8 points, -6.6 to -5; mental: -5.8 points, -6.6 to 5). Proxy-patient score differences remained clinically and statistically significant, even after adjustment for sociodemographic and clinical variables. Proxy-reported outcome scores

An Efficient Identity-Based Proxy Blind Signature for Semioffline Services

Directory of Open Access Journals (Sweden)

Hongfei Zhu

2018-01-01

Full Text Available Fog computing extends the cloud computing to the network edge and allows deploying a new type of semioffline services, which can provide real-time transactions between two entities, while the central cloud server is offline and network edge devices are online. For an e-payment system and e-voting with such feature, proxy blind signature is a cornerstone to protect users’ privacy. However, the signature based on number theorem, such as hard mathematical problems on factoring problem, discrete logarithm problem, and bilinear pairings, cannot defeat quantum computers attack. Meanwhile, these schemes need to depend on complex public key infrastructure. Thus, we construct an identity-based proxy blind signature scheme based on number theorem research unit lattice, which can defeat quantum computers attack and does not need to depend on public key infrastructure. The security of the proposed scheme is dependent on Ring-Small Integer Solution problem over number theorem research unit lattice. The proposed scheme meets the properties of blind signature and proxy signature. Then we compare the proposed scheme with other existing proxy blind signature schemes; the result shows that the proposed scheme outperforms ZM scheme except in proxy signer’s signature size and can be more secure than TA scheme and MMHP scheme.

47 CFR 51.513 - Proxies for forward-looking economic cost.

Science.gov (United States)

2010-10-01

... 47 Telecommunication 3 2010-10-01 2010-10-01 false Proxies for forward-looking economic cost. 51... SERVICES (CONTINUED) INTERCONNECTION Pricing of Elements § 51.513 Proxies for forward-looking economic cost... a cost study that complies with the forward-looking economic cost based pricing methodology...

Error characterization for asynchronous computations: Proxy equation approach

Science.gov (United States)

Sallai, Gabriella; Mittal, Ankita; Girimaji, Sharath

2017-11-01

Numerical techniques for asynchronous fluid flow simulations are currently under development to enable efficient utilization of massively parallel computers. These numerical approaches attempt to accurately solve time evolution of transport equations using spatial information at different time levels. The truncation error of asynchronous methods can be divided into two parts: delay dependent (EA) or asynchronous error and delay independent (ES) or synchronous error. The focus of this study is a specific asynchronous error mitigation technique called proxy-equation approach. The aim of this study is to examine these errors as a function of the characteristic wavelength of the solution. Mitigation of asynchronous effects requires that the asynchronous error be smaller than synchronous truncation error. For a simple convection-diffusion equation, proxy-equation error analysis identifies critical initial wave-number, λc. At smaller wave numbers, synchronous error are larger than asynchronous errors. We examine various approaches to increase the value of λc in order to improve the range of applicability of proxy-equation approach.

Satellite Altimeters and Gravimeters as Proxy of the Indonesian Throughflow

Science.gov (United States)

Susanto, R. D.; Song, Y. T.

2014-12-01

The Indonesian Throughflow (ITF), the only pathway for interocean exchange between the Pacific to the Indian Ocean, plays an important role in global ocean circulation and climate. Yet, continuous ITF measurement is difficult and expensive. We demonstrate a plausible approach to derive the ITF transport proxy using satellite altimetry sea surface height (SSH), gravimetry ocean bottom pressure (OBP) data, in situ measurements from the Makassar Strait from 1996-1998 and 2004-2009, and a theoretical formulation. We first identified the optimal locations in the Pacific and Indian Ocean based on the optimal correlation between the ITF transport through the Makassar Strait and the pressure gradients, represented by the SSH and OBP differences between the Pacific and Indian Oceans at a 1° x 1° horizontal resolution. These geographical locations (centred at off-equatorial in the western Pacific Ocean and centred at along the equator in the eastern Indian Ocean) that control the strength and variability of the ITF transport in the Makassar Strait differ from early studies. The proxy time series follow the observation time series quite well, resolving the intraseasonal, monsoonal, and interannual signals with the 1993-2011 annual mean proxy transport of 11.6 ± 3.2 Sv. Our formulation provides a continuous approach to derive the ITF proxy as long as the satellite data are available. Such a continuous record would be difficult to achieve by in situ measurements alone due to logistical and financial challenges. Ideally, the proxy can be used to complement or fill in the gaps of the observations for a continuous ITF proxy for better understanding the ocean climate and validating ocean circulation models.

Proxy-Produced Ethnographic Work: What Are the Problems, Issues, and Dilemmas Arising from Proxy-Ethnography?

Science.gov (United States)

Martinussen, Marie; Højbjerg, Karin; Tamborg, Andreas Lindenskov

2018-01-01

This article addresses the implications of researcher-student cooperation in the production of empirical material. For the student to replace the experienced researcher and work under the researcher's supervision, we call such work proxy-produced ethnographic work. Although there are clear advantages, the specific relations and positions arising…

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.

PENGEMBANGAN SISTEM PENGENDALIAN TRAFFIC DAN WEB FILTERING PADA JARINGAN INTERNET BERBASIS HOTSPOT

Directory of Open Access Journals (Sweden)

Riska Robianto

2016-12-01

Full Text Available Utilization of Internet services to the hotspot network raises particular problems in traffic control and web filtering. Linux as an operating system that is open (open source, offers a variety of internet firewall systems to assist in the management of traffic, bandwidth, web filtering and one using Smoothwall Express to Linux which can convert a personal computer (PC to the Internet firewall reliable and stable. Smoothwall allows to integrated with the add-ons extends like AdvProxy and URL Filter to improve the performance of Smoohtwall and simplify configuration of the traffic control and web filtering. The research was conducted by collecting data from various sources related, then experiment with implementing Smoohtwall by adding add-ons extends to help administrators manage and regulate the bandwidth allocation of each client, block websites (URLs that are not needed. Based on these results bandwidth management can be divided equally and can block websites (URLs that are not needed like porn sites, warez, bad word, and also the quality of the network connection updatesites more stable.

Foraminifera Models to Interrogate Ostensible Proxy-Model Discrepancies During Late Pliocene

Science.gov (United States)

Jacobs, P.; Dowsett, H. J.; de Mutsert, K.

2017-12-01

Planktic foraminifera faunal assemblages have been used in the reconstruction of past oceanic states (e.g. the Last Glacial Maximum, the mid-Piacenzian Warm Period). However these reconstruction efforts have typically relied on inverse modeling using transfer functions or the modern analog technique, which by design seek to translate foraminifera into one or two target oceanic variables, primarily sea surface temperature (SST). These reconstructed SST data have then been used to test the performance of climate models, and discrepancies have been attributed to shortcomings in climate model processes and/or boundary conditions. More recently forward proxy models or proxy system models have been used to leverage the multivariate nature of proxy relationships to their environment, and to "bring models into proxy space". Here we construct ecological models of key planktic foraminifera taxa, calibrated and validated with World Ocean Atlas (WO13) oceanographic data. Multiple modeling methods (e.g. multilayer perceptron neural networks, Mahalanobis distance, logistic regression, and maximum entropy) are investigated to ensure robust results. The resulting models are then driven by a Late Pliocene climate model simulation with biogeochemical as well as temperature variables. Similarities and differences with previous model-proxy comparisons (e.g. PlioMIP) are discussed.

A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model

Directory of Open Access Journals (Sweden)

Lili Zhang

2014-01-01

Full Text Available A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of original signers without knowing the content of the message. It combines the advantages of proxy signature and blind signature. Up to date, most proxy blind signature schemes rely on hard number theory problems, discrete logarithm, and bilinear pairings. Unfortunately, the above underlying number theory problems will be solvable in the postquantum era. Lattice-based cryptography is enjoying great interest these days, due to implementation simplicity and provable security reductions. Moreover, lattice-based cryptography is believed to be hard even for quantum computers. In this paper, we present a new identity-based proxy blind signature scheme from lattices without random oracles. The new scheme is proven to be strongly unforgeable under the standard hardness assumption of the short integer solution problem (SIS and the inhomogeneous small integer solution problem (ISIS. Furthermore, the secret key size and the signature length of our scheme are invariant and much shorter than those of the previous lattice-based proxy blind signature schemes. To the best of our knowledge, our construction is the first short lattice-based identity-based proxy blind signature scheme in the standard model.

Proxy indicators as measure of local economic dispositions in South ...

African Journals Online (AJOL)

in international markets. The proxy is a coincidental and pro-cyclic indicator, with a correlation of 0.86. Key similarities exist between the economy and the profitability of hardware stores, although the proxy is not as accurate as the volume of sales in hardware stores. The correlation is measured at 0.85. The profitability of the ...

Proxy-Reports in the Ascertainment of Disability Prevalence with American Community Survey Data.

Science.gov (United States)

Siordia, C

2014-01-01

Population estimates on disability prevalence inform policy makers and public health professionals. Understanding how factors capable of affecting measurement (e.g., proxy-report) vary in the population is important for establishing level of confidence in sample-derived population estimates. To establish how use of proxy-reports varies by six disability types stratified by sex, race-ethnicity, and age group. Specific aim is achieved by investigating the number of proxy-reports used amongst the disable population. Cross-sectional study using American Community Survey (ACS) Public Use Microdata Sample (PUMS) 3-year file collected during 2009-2011 survey period. Community-dwelling population in continental United States (US). The unweighted count of 6,003,183 individuals in the microdata are said to represent about 193,277,485 individuals in the continental US population. Stratified disability period estimates are computed. Amongst the disable: the number of proxy-reports; allocations; and Person Inflation Ratios (PRIs) are presented by disability type. Half of all the reported disabilities are derived through the use of proxy-report. In addition, high rates of item-allocation and PRIs are generally found in race-ethnic minorities. Proxy-report use and PRIs are lower for those aged > 65-but not allocation rates. Although use of proxy report in the ascertainment of disability varies in complex ways, data suggest prevalence of proxy reports is lowest amongst Non-Latino-Black females ages 21 to 64. Efforts toward providing clinicians with high quality descriptive epidemiology should continue as a reliable thermometer for measuring disability in the population is needed.

Evaluating and Optimizing Online Advertising: Forget the Click, but There Are Good Proxies.

Science.gov (United States)

Dalessandro, Brian; Hook, Rod; Perlich, Claudia; Provost, Foster

2015-06-01

Online systems promise to improve advertisement targeting via the massive and detailed data available. However, there often is too few data on exactly the outcome of interest, such as purchases, for accurate campaign evaluation and optimization (due to low conversion rates, cold start periods, lack of instrumentation of offline purchases, and long purchase cycles). This paper presents a detailed treatment of proxy modeling, which is based on the identification of a suitable alternative (proxy) target variable when data on the true objective is in short supply (or even completely nonexistent). The paper has a two-fold contribution. First, the potential of proxy modeling is demonstrated clearly, based on a massive-scale experiment across 58 real online advertising campaigns. Second, we assess the value of different specific proxies for evaluating and optimizing online display advertising, showing striking results. The results include bad news and good news. The most commonly cited and used proxy is a click on an ad. The bad news is that across a large number of campaigns, clicks are not good proxies for evaluation or for optimization: clickers do not resemble buyers. The good news is that an alternative sort of proxy performs remarkably well: observed visits to the brand's website. Specifically, predictive models built based on brand site visits-which are much more common than purchases-do a remarkably good job of predicting which browsers will make a purchase. The practical bottom line: evaluating and optimizing campaigns using clicks seems wrongheaded; however, there is an easy and attractive alternative-use a well-chosen site-visit proxy instead.

Surfing the web during pandemic flu: availability of World Health Organization recommendations on prevention

OpenAIRE

Gesualdo, Francesco; Romano, Mariateresa; Pandolfi, Elisabetta; Rizzo, Caterina; Rav?, Lucilla; Lucente, Daniela; Tozzi, Alberto E

2010-01-01

Abstract Background People often search for information on influenza A(H1N1)v prevention on the web. The extent to which information found on the Internet is consistent with recommendations issued by the World Health Organization is unknown. Methods We conducted a search for "swine flu" accessing 3 of the most popular search engines through different proxy servers located in 4 English-speaking countries (Australia, Canada, UK, USA). We explored each site resulting from the searches, up to 4 c...

Getting to the Source: a Survey of Quantitative Data Sources Available to the Everyday Librarian: Part 1: Web Server Log Analysis

Directory of Open Access Journals (Sweden)

Lisa Goddard

2007-03-01

Full Text Available This is the first part of a two‐part article that provides a survey of data sources which are likely to be immediately available to the typical practitioner who wishes to engage instatistical analysis of collections and services within his or her own library. Part I outlines the data elements which can be extracted from web server logs, and discusses web log analysis tools. Part II looks at logs, reports, and data sources from proxy servers, resource vendors, link resolvers, federated search engines, institutional repositories, electronic reference services, and the integrated library system.

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.

Operational Experience with the Frontier System in CMS

International Nuclear Information System (INIS)

Blumenfeld, Barry; Dykstra, Dave; Kreuzer, Peter; Du Ran; Wang Weizhen

2012-01-01

The Frontier framework is used in the CMS experiment at the LHC to deliver conditions data to processing clients worldwide, including calibration, alignment, and configuration information. Each central server at CERN, called a Frontier Launchpad, uses tomcat as a servlet container to establish the communication between clients and the central Oracle database. HTTP-proxy Squid servers, located close to clients, cache the responses to queries in order to provide high performance data access and to reduce the load on the central Oracle database. Each Frontier Launchpad also has its own reverse-proxy Squid for caching. The three central servers have been delivering about 5 million responses every day since the LHC startup, containing about 40 GB data in total, to more than one hundred Squid servers located worldwide, with an average response time on the order of 10 milliseconds. The Squid caches deployed worldwide process many more requests per day, over 700 million, and deliver over 40 TB of data. Several monitoring tools of the tomcat log files, the accesses of the Squids on the central Launchpad servers, and the availability of remote Squids have been developed to guarantee the performance of the service and make the system easily maintainable. Following a brief introduction of the Frontier framework, we describe the performance of this highly reliable and stable system, detail monitoring concerns and their deployment, and discuss the overall operational experience from the first two years of LHC data-taking.

Operational Experience with the Frontier System in CMS

Science.gov (United States)

Blumenfeld, Barry; Dykstra, Dave; Kreuzer, Peter; Du, Ran; Wang, Weizhen

2012-12-01

The Frontier framework is used in the CMS experiment at the LHC to deliver conditions data to processing clients worldwide, including calibration, alignment, and configuration information. Each central server at CERN, called a Frontier Launchpad, uses tomcat as a servlet container to establish the communication between clients and the central Oracle database. HTTP-proxy Squid servers, located close to clients, cache the responses to queries in order to provide high performance data access and to reduce the load on the central Oracle database. Each Frontier Launchpad also has its own reverse-proxy Squid for caching. The three central servers have been delivering about 5 million responses every day since the LHC startup, containing about 40 GB data in total, to more than one hundred Squid servers located worldwide, with an average response time on the order of 10 milliseconds. The Squid caches deployed worldwide process many more requests per day, over 700 million, and deliver over 40 TB of data. Several monitoring tools of the tomcat log files, the accesses of the Squids on the central Launchpad servers, and the availability of remote Squids have been developed to guarantee the performance of the service and make the system easily maintainable. Following a brief introduction of the Frontier framework, we describe the performance of this highly reliable and stable system, detail monitoring concerns and their deployment, and discuss the overall operational experience from the first two years of LHC data-taking.

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.

Global Tsunami Database: Adding Geologic Deposits, Proxies, and Tools

Science.gov (United States)

Brocko, V. R.; Varner, J.

2007-12-01

A result of collaboration between NOAA's National Geophysical Data Center (NGDC) and the Cooperative Institute for Research in the Environmental Sciences (CIRES), the Global Tsunami Database includes instrumental records, human observations, and now, information inferred from the geologic record. Deep Ocean Assessment and Reporting of Tsunamis (DART) data, historical reports, and information gleaned from published tsunami deposit research build a multi-faceted view of tsunami hazards and their history around the world. Tsunami history provides clues to what might happen in the future, including frequency of occurrence and maximum wave heights. However, instrumental and written records commonly span too little time to reveal the full range of a region's tsunami hazard. The sedimentary deposits of tsunamis, identified with the aid of modern analogs, increasingly complement instrumental and human observations. By adding the component of tsunamis inferred from the geologic record, the Global Tsunami Database extends the record of tsunamis backward in time. Deposit locations, their estimated age and descriptions of the deposits themselves fill in the tsunami record. Tsunamis inferred from proxies, such as evidence for coseismic subsidence, are included to estimate recurrence intervals, but are flagged to highlight the absence of a physical deposit. Authors may submit their own descriptions and upload digital versions of publications. Users may sort by any populated field, including event, location, region, age of deposit, author, publication type (extract information from peer reviewed publications only, if you wish), grain size, composition, presence/absence of plant material. Users may find tsunami deposit references for a given location, event or author; search for particular properties of tsunami deposits; and even identify potential collaborators. Users may also download public-domain documents. Data and information may be viewed using tools designed to extract and

Development of Virtual Resource Based IoT Proxy for Bridging Heterogeneous Web Services in IoT Networks

OpenAIRE

Wenquan Jin; DoHyeun Kim

2018-01-01

The Internet of Things is comprised of heterogeneous devices, applications, and platforms using multiple communication technologies to connect the Internet for providing seamless services ubiquitously. With the requirement of developing Internet of Things products, many protocols, program libraries, frameworks, and standard specifications have been proposed. Therefore, providing a consistent interface to access services from those environments is difficult. Moreover, bridging the existing web...

Legal requirements governing proxy voting in Denmark

DEFF Research Database (Denmark)

Werlauff, Erik

2008-01-01

The requirements in Danish company law concerning proxy voting in companies whose shares have been accepted for listing on a regulated market have been successively tightened in recent years, and corporate governance principles have also led to the introduction of several requirements concerning...... proxy holders. A thorough knowledge of these requirements is important not only for the listed companies but also for their advisers and investors in Denmark and abroad. This article considers these requirements as well as the additional requirements which will derive from Directive 2007....../36 on the exercise of shareholders' rights in listed companies, which must be implemented by 3 August 2009. It is pointed out that companies may provide with advantage in their articles of association for both the existing and the forthcoming requirements at this early stage....

Fulltext PDF

Indian Academy of Sciences (India)

Intelligent Assistants on the Internet. Parineeth M Reddy. 44 Photoresists. for Microlithography. Role of Organic Chemistry in Microelectronics. R D. Oebmalya Roy, P K Basu and S V Eswaran. 44. Compass. 56 Web Caching. A Technique to Speedup Access to Web Contents. Harsha Srinath and Shiva Shankar Ramanna.

Middleware Proxy: A Request-Driven Messaging Broker For High Volume Data Distribution

CERN Document Server

Sliwinski, W; Dworak, A

2014-01-01

Nowadays, all major infrastructures and data centres (commercial and scientific) make an extensive use of the publish-subscribe messaging paradigm, which helps to decouple the message sender (publisher) from the message receiver (consumer). This paradigm is also heavily used in the CERN Accelerator Control system, in Proxy broker - critical part of the Controls Middleware (CMW) project. Proxy provides the aforementioned publish-subscribe facility and also supports execution of synchronous read and write operations. Moreover, it enables service scalability and dramatically reduces the network resources and overhead (CPU and memory) on publisher machine, required to serve all subscriptions. Proxy was developed in modern C++, using state of the art programming techniques (e.g. Boost) and following recommended software patterns for achieving low-latency and high concurrency. The outstanding performance of the Proxy infrastructure was confirmed during the last 3 years by delivering the high volume of LHC equipment...

Photospheric activity of the Sun with VIRGO and GOLF. Comparison with standard activity proxies

Science.gov (United States)

Salabert, D.; García, R. A.; Jiménez, A.; Bertello, L.; Corsaro, E.; Pallé, P. L.

2017-12-01

We study the variability of solar activity using new photospheric proxies originally developed for the analysis of stellar magnetism with the CoRoT and Kepler photometric observations. These proxies were obtained by tracking the temporal modulations in the observations associated with the spots and magnetic features as the Sun rotates. We analyzed 21 yr of observations, spanning solar cycles 23 and 24, collected by the space-based photometric VIRGO and radial velocity GOLF instruments on board the SoHO satellite. We then calculated the photospheric activity proxy Sph is for each of the three VIRGO photometers and the associated Svel proxy from the radial velocity GOLF observations. Comparisons with several standard solar activity proxies sensitive to different layers of the Sun demonstrate that these new activity proxies, Sph and Svel, provide a new manner to monitor solar activity. We show that both the long- and short-term magnetic variabilities respectively associated with the 11-yr cycle and the quasi-biennial oscillation are well monitored, and that the magnetic field interaction between the subsurface, photosphere, and chromosphere of the Sun was modified between Cycle 24 and Cycle 23. Furthermore, the photometric proxies show a wavelength dependence of the response function of the solar photosphere among the three channels of the VIRGO photometers, providing inputs for the study of the stellar magnetism of Sun-like stars.

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.

Mixtures of Gaussians for uncertainty description in bivariate latent heat flux proxies

NARCIS (Netherlands)

Wójcik, R.; Troch, P.A.A.; Stricker, J.N.M.; Torfs, P.J.J.F.

2006-01-01

This paper proposes a new probabilistic approach for describing uncertainty in the ensembles of latent heat flux proxies. The proxies are obtained from hourly Bowen ratio and satellite-derived measurements, respectively, at several locations in the southern Great Plains region in the United States.

Detecting instabilities in tree-ring proxy calibration

Directory of Open Access Journals (Sweden)

H. Visser

2010-06-01

Full Text Available Evidence has been found for reduced sensitivity of tree growth to temperature in a number of forests at high northern latitudes and alpine locations. Furthermore, at some of these sites, emergent subpopulations of trees show negative growth trends with rising temperature. These findings are typically referred to as the "Divergence Problem" (DP. Given the high relevance of paleoclimatic reconstructions for policy-related studies, it is important for dendrochronologists to address this issue of potential model uncertainties associated with the DP. Here we address this issue by proposing a calibration technique, termed "stochastic response function" (SRF, which allows the presence or absence of any instabilities in growth response of trees (or any other climate proxy to their calibration target to be visualized and detected. Since this framework estimates confidence limits and subsequently provides statistical significance tests, the approach is also very well suited for proxy screening prior to the generation of a climate-reconstruction network.

Two examples of tree growth/climate relationships are provided, one from the North American Arctic treeline and the other from the upper treeline in the European Alps. Instabilities were found to be present where stabilities were reported in the literature, and vice versa, stabilities were found where instabilities were reported. We advise to apply SRFs in future proxy-screening schemes, next to the use of correlations and RE/CE statistics. It will improve the strength of reconstruction hindcasts.

Mobile Multicast in Hierarchical Proxy Mobile IPV6

Science.gov (United States)

Hafizah Mohd Aman, Azana; Hashim, Aisha Hassan A.; Mustafa, Amin; Abdullah, Khaizuran

2013-12-01

Mobile Internet Protocol Version 6 (MIPv6) environments have been developing very rapidly. Many challenges arise with the fast progress of MIPv6 technologies and its environment. Therefore the importance of improving the existing architecture and operations increases. One of the many challenges which need to be addressed is the need for performance improvement to support mobile multicast. Numerous approaches have been proposed to improve mobile multicast performance. This includes Context Transfer Protocol (CXTP), Hierarchical Mobile IPv6 (HMIPv6), Fast Mobile IPv6 (FMIPv6) and Proxy Mobile IPv6 (PMIPv6). This document describes multicast context transfer in hierarchical proxy mobile IPv6 (H-PMIPv6) to provide better multicasting performance in PMIPv6 domain.

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...

Human rights of children with intellectual disabilities: comparing self-ratings and proxy ratings.

Science.gov (United States)

Huus, K; Granlund, M; Bornman, J; Lygnegård, F

2015-11-01

A child rights-based approach to research articulates well with Article 12 of the United Nations Convention on the Rights of the Child (CRC) and highlights the importance and value of including children's own views about aspects that concern them. The aim of this study is to compare children with intellectual disability's own ratings (as self-raters) to those of their primary caregivers (as proxy raters) regarding human rights of children. The study also aims to establish whether there is an inter-rater agreement between the self-raters and proxy raters concerning Maslow's hierarchy of needs. This study is nested in a larger study examining the human rights of children with intellectual disability in South Africa. In total, 162 children with intellectual disability from 11 schools across three provinces and their primary caregivers participated by answering parts of a Children's Rights Questionnaire (CRQ) developed by the researchers based on the United Nation's CRC. We compared the answers for six questions in the questionnaire that were addressed to self-raters (children) and proxy raters (primary caregivers) in the same way. Questions regarding basic needs, such as access to clean water or whether the child had food to eat at home, were answered similarly by self-raters and proxy raters. Larger differences were found when self-raters and proxy raters were asked about whether the child had things or friends to play with at home. Socio-economic variables seemed to affect whether self-raters and proxy raters answered similarly. The results underscore the importance of promoting children's rights to express themselves by considering the opinions of both the children as self-raters and their primary caregivers as proxy raters - not only the latter. The results indicate that it is especially important to include children's own voices when more complex needs are surveyed. Agreement between self- and proxy ratings could be affected by socio-economic circumstances. �

The relationship between proxy reported health-related quality of life and parental distress: gender differences.

Science.gov (United States)

Davis, E; Davies, B; Waters, E; Priest, N

2008-11-01

Although primary caregiver proxy reports of health-related quality of life (HRQOL) are often used for healthcare decision making when child self-reports are unable to be collected (because of a variety of reasons such as child illness, disability or age), we have little understanding of the correlates of parent-proxy reports. The aim of this study was to examine the relationship between parental depression and parent-proxy reported QOL for primary caregivers (mothers and fathers), using a multidimensional HRQOL instrument. It was hypothesized that maternal depression would be negatively correlated with maternal reported HRQOL, but that paternal depression would not be correlated with paternal reported HRQOL. Data were from parents of children aged 4-5 years (n = 4983) involved in the Longitudinal Study of Australian Children. A questionnaire assessing parental depression (Kessler-6) and proxy reported HRQOL (Pediatric Quality of Life Inventory) was completed by the primary caregiver. For maternal primary caregivers, maternal depression was negatively correlated with all domains of maternal proxy reports of HRQOL (r = -0.24 to r = -0.36). For paternal primary caregivers, there was no relationship between paternal depression and paternal proxy reports of HRQOL. Multiple regression analyses demonstrated that maternal depression was a significant predictor of total HRQOL, accounting for 12% of the variance. For paternal mental health, depression did not predict parent-proxy reported total HRQOL. These results highlight the importance of assessing maternal mental health when measuring proxy reported QOL. Further research is needed in this area to examine the relationship between parental depression and proxy reported HRQOL (including both mothers and fathers, where possible), as well as child self-reported HRQOL.

Comparing children's GPS tracks with geospatial proxies for exposure to junk food.

Science.gov (United States)

Sadler, Richard C; Gilliland, Jason A

2015-01-01

Various geospatial techniques have been employed to estimate children's exposure to environmental cardiometabolic risk factors, including junk food. But many studies uncritically rely on exposure proxies which differ greatly from actual exposure. Misrepresentation of exposure by researchers could lead to poor decisions and ineffective policymaking. This study conducts a GIS-based analysis of GPS tracks--'activity spaces'--and 21 proxies for activity spaces (e.g. buffers, container approaches) for a sample of 526 children (ages 9-14) in London, Ontario, Canada. These measures are combined with a validated food environment database (including fast food and convenience stores) to create a series of junk food exposure estimates and quantify the errors resulting from use of different proxy methods. Results indicate that exposure proxies consistently underestimate exposure to junk foods by as much as 68%. This underestimation is important to policy development because children are exposed to more junk food than estimated using typical methods. Copyright © 2015 Elsevier Ltd. All rights reserved.

A Policy Based Approach for the Management of Web Browser Resources to Prevent Anonymity Attacks in Tor

Science.gov (United States)

Navarro-Arribas, Guillermo; Garcia-Alfaro, Joaquin

Web browsers are becoming the universal interface to reach applications and services related with these systems. Different browsing contexts may be required in order to reach them, e.g., use of VPN tunnels, corporate proxies, anonymisers, etc. By browsing context we mean how the user browsers the Web, including mainly the concrete configuration of its browser. When the context of the browser changes, its security requirements also change. In this work, we present the use of authorisation policies to automatise the process of controlling the resources of a Web browser when its context changes. The objective of our proposal is oriented towards easing the adaptation to the security requirements of the new context and enforce them in the browser without the need for user intervention. We present a concrete application of our work as a plug-in for the adaption of security requirements in Mozilla/Firefox browser when a context of anonymous navigation through the Tor network is enabled.

On the Use of Human Mobility Proxies for Modeling Epidemics

Science.gov (United States)

Tizzoni, Michele; Bajardi, Paolo; Decuyper, Adeline; Kon Kam King, Guillaume; Schneider, Christian M.; Blondel, Vincent; Smoreda, Zbigniew; González, Marta C.; Colizza, Vittoria

2014-01-01

Human mobility is a key component of large-scale spatial-transmission models of infectious diseases. Correctly modeling and quantifying human mobility is critical for improving epidemic control, but may be hindered by data incompleteness or unavailability. Here we explore the opportunity of using proxies for individual mobility to describe commuting flows and predict the diffusion of an influenza-like-illness epidemic. We consider three European countries and the corresponding commuting networks at different resolution scales, obtained from (i) official census surveys, (ii) proxy mobility data extracted from mobile phone call records, and (iii) the radiation model calibrated with census data. Metapopulation models defined on these countries and integrating the different mobility layers are compared in terms of epidemic observables. We show that commuting networks from mobile phone data capture the empirical commuting patterns well, accounting for more than 87% of the total fluxes. The distributions of commuting fluxes per link from mobile phones and census sources are similar and highly correlated, however a systematic overestimation of commuting traffic in the mobile phone data is observed. This leads to epidemics that spread faster than on census commuting networks, once the mobile phone commuting network is considered in the epidemic model, however preserving to a high degree the order of infection of newly affected locations. Proxies' calibration affects the arrival times' agreement across different models, and the observed topological and traffic discrepancies among mobility sources alter the resulting epidemic invasion patterns. Results also suggest that proxies perform differently in approximating commuting patterns for disease spread at different resolution scales, with the radiation model showing higher accuracy than mobile phone data when the seed is central in the network, the opposite being observed for peripheral locations. Proxies should therefore be

Calcium isotopic composition of high-latitude proxy carrier Neogloboquadrina pachyderma (sin.

Directory of Open Access Journals (Sweden)

A. Eisenhauer

2009-01-01

Full Text Available The accurate reconstruction of sea surface temperature (SST history in climate-sensitive regions (e.g. tropical and polar oceans became a challenging task in palaeoceanographic research. Biogenic shell carbonate SST proxies successfully developed for tropical regions often fail in cool water environments. Their major regional shortcomings and the cryptic diversity now found within the major high latitude proxy carrier Neogloboquadrina pachyderma (sin. highlight an urgent need to explore complementary SST proxies for these cool-water regions. Here we incorporate the genetic component into a calibration study of a new SST proxy for the high latitudes. We found that the calcium isotopic composition (δ44/40Ca of calcite from genotyped net catches and core-top samples of the planktonic foraminifera Neogloboquadrina pachyderma (sin. is related to temperature and unaffected by genetic variations. The temperature sensitivity has been found to be 0.17 (±0.02‰ per 1°C, highlighting its potential for downcore applications in open marine cool-water environments. Our results further indicate that in extreme polar environments, below a critical threshold temperature of 2.0 (±0.5°C associated with salinities below 33.0 (±0.5‰, a prominent shift in biomineralization affects the δ44/40Ca of genotyped and core-top N. pachyderma (sin., becoming insensitive to temperature. These findings highlight the need of more systematic calibration studies on single planktonic foraminiferal species in order to unravel species-specific factors influencing the temperature sensitivity of Ca isotope fractionation and to validate the proxies' applicability.

78 FR 70987 - Proxy Advisory Firm Roundtable

Science.gov (United States)

2013-11-27

... Firm Roundtable AGENCY: Securities and Exchange Commission. ACTION: Notice of roundtable discussion... advisory firms. The panel will be asked to discuss topics including the current state of proxy advisory firm use by investment advisers and institutional investors and potential changes that have been...

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...

Evaluation of the sea ice proxy IP against observational and diatom proxy data in the SW Labrador Sea

DEFF Research Database (Denmark)

Weckström, K.; Andersen, M.L.; Kuijpers, A.

2013-01-01

The recent rapid decline in Arctic sea ice cover has increased the need to improve the accuracy of the sea ice component in climate models and to provide detailed long-term sea ice concentration records, which are only available via proxy data. Recently, the highly branched isoprenoid IP25...

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.

Comparing Apples to Apples: Paleoclimate Model-Data comparison via Proxy System Modeling

Science.gov (United States)

Dee, Sylvia; Emile-Geay, Julien; Evans, Michael; Noone, David

2014-05-01

The wealth of paleodata spanning the last millennium (hereinafter LM) provides an invaluable testbed for CMIP5-class GCMs. However, comparing GCM output to paleodata is non-trivial. High-resolution paleoclimate proxies generally contain a multivariate and non-linear response to regional climate forcing. Disentangling the multivariate environmental influences on proxies like corals, speleothems, and trees can be complex due to spatiotemporal climate variability, non-stationarity, and threshold dependence. Given these and other complications, many paleodata-GCM comparisons take a leap of faith, relating climate fields (e.g. precipitation, temperature) to geochemical signals in proxy data (e.g. δ18O in coral aragonite or ice cores) (e.g. Braconnot et al., 2012). Isotope-enabled GCMs are a step in the right direction, with water isotopes providing a connector point between GCMs and paleodata. However, such studies are still rare, and isotope fields are not archived as part of LM PMIP3 simulations. More importantly, much of the complexity in how proxy systems record and transduce environmental signals remains unaccounted for. In this study we use proxy system models (PSMs, Evans et al., 2013) to bridge this conceptual gap. A PSM mathematically encodes the mechanistic understanding of the physical, geochemical and, sometimes biological influences on each proxy. To translate GCM output to proxy space, we have synthesized a comprehensive, consistently formatted package of published PSMs, including δ18O in corals, tree ring cellulose, speleothems, and ice cores. Each PSM is comprised of three sub-models: sensor, archive, and observation. For the first time, these different components are coupled together for four major proxy types, allowing uncertainties due to both dating and signal interpretation to be treated within a self-consistent framework. The output of this process is an ensemble of many (say N = 1,000) realizations of the proxy network, all equally plausible

A Quantum Multi-Proxy Weak Blind Signature Scheme Based on Entanglement Swapping

Science.gov (United States)

Yan, LiLi; Chang, Yan; Zhang, ShiBin; Han, GuiHua; Sheng, ZhiWei

2017-02-01

In this paper, we present a multi-proxy weak blind signature scheme based on quantum entanglement swapping of Bell states. In the scheme, proxy signers can finish the signature instead of original singer with his/her authority. It can be applied to the electronic voting system, electronic paying system, etc. The scheme uses the physical characteristics of quantum mechanics to implement delegation, signature and verification. It could guarantee not only the unconditionally security but also the anonymity of the message owner. The security analysis shows the scheme satisfies the security features of multi-proxy weak signature, singers cannot disavowal his/her signature while the signature cannot be forged by others, and the message owner can be traced.

Web Page Recommendation Using Web Mining

OpenAIRE

Modraj Bhavsar; Mrs. P. M. Chavan

2014-01-01

On World Wide Web various kind of content are generated in huge amount, so to give relevant result to user web recommendation become important part of web application. On web different kind of web recommendation are made available to user every day that includes Image, Video, Audio, query suggestion and web page. In this paper we are aiming at providing framework for web page recommendation. 1) First we describe the basics of web mining, types of web mining. 2) Details of each...

Climate proxy data as groundwater tracers in regional flow systems

Science.gov (United States)

Clark, J. F.; Morrissey, S. K.; Stute, M.

2008-05-01

The isotopic and chemical signatures of groundwater reflect local climate conditions. By systematically analyzing groundwater and determining their hydrologic setting, records of past climates can be constructed. Because of their chemistries and relatively uncomplicated source functions, dissolved noble gases have yielded reliable records of continental temperatures for the last 30,000 to 50,000 years. Variations in the stable isotope compositions of groundwater due to long term climate changes have also been documented over these time scales. Because glacial - interglacial climate changes are relatively well known, these climate proxies can be used as "stratigraphic" markers within flow systems and used to distinguish groundwaters that have recharged during the Holocene from those recharged during the last glacial period, important time scales for distinguishing regional and local flow systems in many aquifers. In southern Georgia, the climate proxy tracers were able to identify leakage from surface aquifers into the Upper Floridan aquifer in areas previously thought to be confined. In south Florida, the transition between Holocene and glacial signatures in the Upper Floridan aquifer occurs mid-way between the recharge area and Lake Okeechobee. Down gradient of the lake, the proxies are uniform, indicating recharge during the last glacial period. Furthermore, there is no evidence for leakage from the shallow aquifers into the Upper Floridan. In the Lower Floridan, the climate proxies indicate that the saline water entered the aquifer after sea level rose to its present level.

Expert versus proxy rating of verbal communicative ability of people with aphasia after stroke.

Science.gov (United States)

de Jong-Hagelstein, Marjolein; Kros, Lieke; Lingsma, Hester F; Dippel, Diederik W J; Koudstaal, Peter J; Visch-Brink, Evy G

2012-11-01

In randomized clinical trials of aphasia treatment, a functional outcome measure like the Amsterdam-Nijmegen Everyday Language Test (ANELT), administered by speech-language therapists, is often used. However, the agreement between this expert rating and the judgment of the proxy about the quality of the daily life communication of the person with aphasia is largely unknown. We examined the association between ANELT scores by speech-language therapists and proxy judgments on the Partner Communication Questionnaire both at 3 and 6 months in 39 people with aphasia after stroke. We also determined which factors affected the level of agreement between expert and proxy judgment of the communicative ability at 6 months in 53 people with aphasia. We found moderate agreement (at 3 months r = .662; p = aphasia, measured with the Aphasia Severity Rating Scale, was associated with better agreement. In conclusion, although proxies were slightly more positive than experts, we found moderate agreement between expert and proxy rating of verbal communicative ability of people with aphasia after stroke, especially in milder cases.

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.

Evaluation of proxy-based millennial reconstruction methods

Energy Technology Data Exchange (ETDEWEB)

Lee, Terry C.K.; Tsao, Min [University of Victoria, Department of Mathematics and Statistics, Victoria, BC (Canada); Zwiers, Francis W. [Environment Canada, Climate Research Division, Toronto, ON (Canada)

2008-08-15

A range of existing statistical approaches for reconstructing historical temperature variations from proxy data are compared using both climate model data and real-world paleoclimate proxy data. We also propose a new method for reconstruction that is based on a state-space time series model and Kalman filter algorithm. The state-space modelling approach and the recently developed RegEM method generally perform better than their competitors when reconstructing interannual variations in Northern Hemispheric mean surface air temperature. On the other hand, a variety of methods are seen to perform well when reconstructing surface air temperature variability on decadal time scales. An advantage of the new method is that it can incorporate additional, non-temperature, information into the reconstruction, such as the estimated response to external forcing, thereby permitting a simultaneous reconstruction and detection analysis as well as future projection. An application of these extensions is also demonstrated in the paper. (orig.)

An ethical analysis of proxy and waiver of consent in critical care research

DEFF Research Database (Denmark)

Berg, Ronan M G; Møller, Kirsten; Rossel, Peter J. Hancke

2013-01-01

It is a central principle in medical ethics that vulnerable patients are entitled to a degree of protection that reflects their vulnerability. In critical care research, this protection is often established by means of so-called proxy consent. Proxy consent for research participation constitutes...

Characteristics of file sharing and peer to peer networking | Opara ...

African Journals Online (AJOL)

Characteristics of file sharing and peer to peer networking. ... distributing or providing access to digitally stored information, such as computer programs, ... including in multicast systems, anonymous communications systems, and web caches.

Harsha Srinath

Indian Academy of Sciences (India)

Volume 7 Issue 7 July 2002 pp 54-62 General Article. Web Caching - A Technique to Speedup Access to Web Contents · Harsha Srinath Shiva Shankar Ramanna · More Details Fulltext PDF. Volume 8 Issue 3 March 2003 pp 33-41 General Article. IPv6: The Next Generation Internet Protocol - IPv4 and its Shortcomings.

Resonance – Journal of Science Education | News

Indian Academy of Sciences (India)

... on the Internet · Parineeth M Reddy · More Details Fulltext PDF. pp 44-53 General Article. Photoresists for Microlithography - Role of Organic Chemistry in Microelectronics · Debmalya Roy P K Basu S V Eswaran · More Details Fulltext PDF. pp 54-62 General Article. Web Caching - A Technique to Speedup Access to Web ...

Usable Authentication with an Offline Trusted Device Proxy Architecture (long version)

OpenAIRE

Johansen, Christian; Jøsang, Audun; Migdal, Denis

2016-01-01

Client platform infection poses a significant threat to secure user authentication. Com- bining vulnerable client platforms with special security devices, as often the case in e- banking, can increase significantly the security. This paper describes a new architecture where a security proxy on the client platform communicates with both a trusted security device and the server application. The proxy switches between two TLS channels, one from the client and another from the trusted device. The...

Comparing proxy and model estimates of hydroclimate variability and change over the Common Era

Science.gov (United States)

Hydro2k Consortium, Pages

2017-12-01

Water availability is fundamental to societies and ecosystems, but our understanding of variations in hydroclimate (including extreme events, flooding, and decadal periods of drought) is limited because of a paucity of modern instrumental observations that are distributed unevenly across the globe and only span parts of the 20th and 21st centuries. Such data coverage is insufficient for characterizing hydroclimate and its associated dynamics because of its multidecadal to centennial variability and highly regionalized spatial signature. High-resolution (seasonal to decadal) hydroclimatic proxies that span all or parts of the Common Era (CE) and paleoclimate simulations from climate models are therefore important tools for augmenting our understanding of hydroclimate variability. In particular, the comparison of the two sources of information is critical for addressing the uncertainties and limitations of both while enriching each of their interpretations. We review the principal proxy data available for hydroclimatic reconstructions over the CE and highlight the contemporary understanding of how these proxies are interpreted as hydroclimate indicators. We also review the available last-millennium simulations from fully coupled climate models and discuss several outstanding challenges associated with simulating hydroclimate variability and change over the CE. A specific review of simulated hydroclimatic changes forced by volcanic events is provided, as is a discussion of expected improvements in estimated radiative forcings, models, and their implementation in the future. Our review of hydroclimatic proxies and last-millennium model simulations is used as the basis for articulating a variety of considerations and best practices for how to perform proxy-model comparisons of CE hydroclimate. This discussion provides a framework for how best to evaluate hydroclimate variability and its associated dynamics using these comparisons and how they can better inform

Validating a proxy for disease progression in metastatic cancer patients using prescribing and dispensing data.

Science.gov (United States)

Joshi, Vikram; Adelstein, Barbara-Ann; Schaffer, Andrea; Srasuebkul, Preeyaporn; Dobbins, Timothy; Pearson, Sallie-Anne

2017-10-01

Routine data collections are used increasingly to examine outcomes of real-world cancer drug use. These datasets lack clinical details about important endpoints such as disease progression. To validate a proxy for disease progression in metastatic cancer patients using prescribing and dispensing claims. We used data from a cohort study of patients undergoing chemotherapy who provided informed consent to the collection of cancer-treatment data from medical records and linkage to pharmaceutical claims. We derived proxy decision rules based on changes to drug treatment in prescription histories (n = 36 patients) and validated the proxy in prescribing data (n = 62 patients). We adapted the decision rules and validated the proxy in dispensing data (n = 109). Our gold standard was disease progression ascertained in patient medical records. Individual progression episodes were the unit of analysis for sensitivity and Positive Predictive Value (PPV) calculations and specificity and Negative Predictive Value (NPV) were calculated at the patient level. The sensitivity of our proxy in prescribing data was 74.3% (95% Confidence Interval (CI), 55.6-86.6%) and PPV 61.2% (95% CI, 45.0-75.3%); specificity and NPV were 87.8% (95% CI, 73.8-95.9%) and 100% (95% CI, 90.3-100%), respectively. In dispensing data, the sensitivity of our proxy was 64% (95% CI, 55.0-77.0%) and PPV 56.0% (95% CI, 43.0-69.0%); specificity and NPV were 81% (95% CI, 70.05-89.0%) and 91.0% (95% CI, 82.0-97.0%), respectively. Our proxy overestimated episodes of disease progression. The proxy's performance is likely to improve if the date of prescribing is used instead of date of dispensing in claims data and by incorporating medical service claims (such as imaging prior to drug changes) in the algorithm. Our proxy is not sufficiently robust for use in real world comparative effectiveness research for cancer medicines. © 2016 John Wiley & Sons Australia, Ltd.

Munchausen Syndrome by Proxy: A Family Affair.

Science.gov (United States)

Mehl, Albert L.; And Others

1990-01-01

The article reports on a case of Munchausen syndrome by proxy in which chronic illicit insulin was administered to a one-year-old child by her mother. Factitious illnesses continued despite psychiatric intervention. Retrospective review of medical records suggested 30 previous episodes of factitious illness within the family. (DB)

Evaluation of Organic Proxies for Quantifying Past Primary Productivity

Science.gov (United States)

Raja, M.; Rosell-Melé, A.; Galbraith, E.

2017-12-01

Ocean primary productivity is a key element of the marine carbon cycle. However, its quantitative reconstruction in the past relies on the use of biogeochemical models as the available proxy approaches are qualitative at best. Here, we present an approach that evaluates the use of phytoplanktonic biomarkers (i.e. chlorins and alkenones) as quantitative proxies to reconstruct past changes in marine productivity. We compare biomarkers contents in a global suite of core-top sediments to sea-surface chlorophyll-a abundance estimated by satellites over the last 20 years, and the results are compared to total organic carbon (TOC). We also assess satellite data and detect satellite limitations and biases due to the complexity of optical properties and the actual defined algorithms. Our findings show that sedimentary chlorins can be used to track total sea-surface chlorophyll-a abundance as an indicator for past primary productivity. However, degradation processes restrict the application of this proxy to concentrations below a threshold value (1µg/g). Below this threshold, chlorins are a useful tool to identify reducing conditions when used as part of a multiproxy approach to assess redox sedimentary conditions (e.g. using Re, U). This is based on the link between anoxic/disoxic conditions and the flux of organic matter from the sea-surface to the sediments. We also show that TOC is less accurate than chlorins for estimating sea-surface chlorophyll-a due to the contribution of terrigenous organic matter, and the different degradation pathways of all organic compounds that TOC includes. Alkenones concentration also relates to primary productivity, but they are constrained by different processes in different regions. In conclusion, as lons as specific constraints are taken into account, our study evaluates the use of chlorins and alkenones as quantitative proxies of past primary productivity, with more accuracy than by using TOC.

Contracts, covenants and advance care planning: an empirical study of the moral obligations of patient and proxy.

Science.gov (United States)

Fins, Joseph J; Maltby, Barbara S; Friedmann, Erika; Greene, Michele G; Norris, Kaye; Adelman, Ronald; Byock, Ira

2005-01-01

Previously we had speculated that the patient-proxy relationship existed on a contractual to covenantal continuum. In order to assess this hypothesis, and to better understand the moral obligations of the patient-proxy relationship, we surveyed 50 patient-proxy pairs as well as 52 individuals who had acted as proxies for someone who had died. Using structured vignettes representative of three distinct disease trajectories (cancer, acute stroke, and congestive heart failure), we assessed whether respondents believed that proxies should follow explicit instructions regarding life-sustaining therapy and act contractually or whether more discretionary or covenantal judgments were ethically permissible. Additional variables included the valence of initial patient instructions--for example, "to do nothing" or "to do everything"--as well as the quality of information available to the proxy. Responses were graded on a contractual to covenantal continuum using a modified Likert scale employing a prospectively scored survey instrument. Our data indicate that the patient-proxy relationship exists on a contractual to covenantal continuum and that variables such as disease trajectory, the clarity of prognosis, instructional valence, and the quality of patient instructions result in statistically significant differences in response. The use of interpretative or covenantal judgment was desired by patients and proxies when the prognosis was grim, even if initial instructions were to pursue more aggressive care. Nonetheless, there was a valence effect: patients and proxies intended that negative instructions to be left alone be heeded. These data suggest that the delegation of patient self-determination is morally complex. Advance care planning should take into account both the exercise of autonomy and the interpretative burdens assumed by the proxy. Patients and proxies think inductively and contextually. Neither group viewed deviation from patient instructions as a violation of

Validity of proxy data obtained by different psychological autopsy information reconstruction techniques.

Science.gov (United States)

Fang, L; Zhang, J

2010-01-01

Two informants were interviewed for each of 416 living controls (individuals sampled from the normal population) interviewed in a Chinese case-control psychological autopsy study. The validity of proxy data, obtained using seven psychological autopsy information reconstruction techniques (types 1, 2 and A - E), was evaluated, with living controls' self reports used as the gold-standard. Proxy data for reconstruction technique types 1, 2 and D on the Impulsivity Inventory Scale (total impulsivity score) were no different from the living controls' self report gold standard, whereas data for types A and E were smaller than data from living controls. On the 'acceptance or resignation' sub-scale of the avoidance coping dimension of the Moos Coping Response Inventory, information obtained by reconstruction technique types 1 and D was not significantly different from the living controls' self reports, whereas proxy data from types 2, A and E were smaller than those from the living controls. No statistically significant differences were identified for other proxy data obtained by reconstruction technique types 1, 2, A, D and E. These results indicate that using a second informant does not significantly enhance information reconstruction for the target.

Deuterium values from volcanic glass: A paleoelevation proxy for Oregon's Cascade Range

Science.gov (United States)

Carlson, T. B.; Bershaw, J. T.

2016-12-01

Hydrated volcanic glass has been used as a proxy to constrain Cenozoic paleoclimate across many of the world's mountain ranges. However, there are concerns that volcanic glass may not preserve the isotopic composition of syndepositional meteoric water. The Cascades are an excellent location to study the validity of hydrated volcanic glass as a paleoenvironmental proxy for several reasons. Moisture is derived from a single oceanic source and falls as orographic precipitation in the Cascades, leading to a characteristic altitude effect, or inverse relationship between elevation and the isotopic composition of meteoric water (δD). In addition, past studies have inferred uplift of the Cascades and an increase in the rain shadow effect since the Eocene through independent methods such as changing fossil assemblages, and other isotopic proxies including carbonates and fossil teeth. In this study, δD values of two hydrated tuff samples are compared: one prior to ( 29 Ma) and one following ( 5 Ma) the onset of High Cascade volcanism. The isotopic composition of these samples are interpreted in the context of modern water across the range to understand the potential of volcanic glass as a proxy for paleoelevation in the Pacific Northwest.

World-trade web: Topological properties, dynamics, and evolution

Science.gov (United States)

Fagiolo, Giorgio; Reyes, Javier; Schiavo, Stefano

2009-03-01

This paper studies the statistical properties of the web of import-export relationships among world countries using a weighted-network approach. We analyze how the distributions of the most important network statistics measuring connectivity, assortativity, clustering, and centrality have coevolved over time. We show that all node-statistic distributions and their correlation structure have remained surprisingly stable in the last 20years —and are likely to do so in the future. Conversely, the distribution of (positive) link weights is slowly moving from a log-normal density towards a power law. We also characterize the autoregressive properties of network-statistics dynamics. We find that network-statistics growth rates are well-proxied by fat-tailed densities like the Laplace or the asymmetric exponential power. Finally, we find that all our results are reasonably robust to a few alternative, economically meaningful, weighting schemes.

How to integrate proxy data from two informants in life event assessment in psychological autopsy.

Science.gov (United States)

Zhang, Jie; Wang, Youqing; Fang, Le

2018-04-27

Life event assessment is an important part in psychological autopsy, and how to integrate its proxy data from two informants is a major methodological issue which needs solving. Totally 416 living subjects and their two informants were interviewed by psychological autopsy, and life events were assessed with Paykel's Interview for Recent Life Events. Validities of integrated proxy data using six psychological autopsy information reconstruction methods were evaluated, with living subjects' self-reports used as gold-standard criteria. For all the life events, average value of Youden Indexes for proxy data by type C information reconstruction method (choosing positive value from two informants) was larger than other five methods'. For family life related events, proxy data by type 1st information reconstruction method were not significantly different from living subjects' self-reports (P = 0.828). For all other life events, proxy data by type C information reconstruction method were not significantly different from the gold-standard. Choosing positive value is a relatively better method for integrating dichotomous (positive vs. negative) proxy data from two informants in life event assessment in psychological autopsy, except for family life related events. In that case, using information provided by 1st informants (mainly family member) is recommended.

Quick, “Imputation-free” meta-analysis with proxy-SNPs

Directory of Open Access Journals (Sweden)

Meesters Christian

2012-09-01

Full Text Available Abstract Background Meta-analysis (MA is widely used to pool genome-wide association studies (GWASes in order to a increase the power to detect strong or weak genotype effects or b as a result verification method. As a consequence of differing SNP panels among genotyping chips, imputation is the method of choice within GWAS consortia to avoid losing too many SNPs in a MA. YAMAS (Yet Another Meta Analysis Software, however, enables cross-GWAS conclusions prior to finished and polished imputation runs, which eventually are time-consuming. Results Here we present a fast method to avoid forfeiting SNPs present in only a subset of studies, without relying on imputation. This is accomplished by using reference linkage disequilibrium data from 1,000 Genomes/HapMap projects to find proxy-SNPs together with in-phase alleles for SNPs missing in at least one study. MA is conducted by combining association effect estimates of a SNP and those of its proxy-SNPs. Our algorithm is implemented in the MA software YAMAS. Association results from GWAS analysis applications can be used as input files for MA, tremendously speeding up MA compared to the conventional imputation approach. We show that our proxy algorithm is well-powered and yields valuable ad hoc results, possibly providing an incentive for follow-up studies. We propose our method as a quick screening step prior to imputation-based MA, as well as an additional main approach for studies without available reference data matching the ethnicities of study participants. As a proof of principle, we analyzed six dbGaP Type II Diabetes GWAS and found that the proxy algorithm clearly outperforms naïve MA on the p-value level: for 17 out of 23 we observe an improvement on the p-value level by a factor of more than two, and a maximum improvement by a factor of 2127. Conclusions YAMAS is an efficient and fast meta-analysis program which offers various methods, including conventional MA as well as inserting proxy

USGS Topo Base Map from The National Map

Data.gov (United States)

U.S. Geological Survey, Department of the Interior — The USGS Topographic Base Map from The National Map. This tile cached web map service combines the most current data services (Boundaries, Names, Transportation,...

Multiscale combination of climate model simulations and proxy records over the last millennium

Science.gov (United States)

Chen, Xin; Xing, Pei; Luo, Yong; Nie, Suping; Zhao, Zongci; Huang, Jianbin; Tian, Qinhua

2018-05-01

To highlight the compatibility of climate model simulation and proxy reconstruction at different timescales, a timescale separation merging method combining proxy records and climate model simulations is presented. Annual mean surface temperature anomalies for the last millennium (851-2005 AD) at various scales over the land of the Northern Hemisphere were reconstructed with 2° × 2° spatial resolution, using an optimal interpolation (OI) algorithm. All target series were decomposed using an ensemble empirical mode decomposition method followed by power spectral analysis. Four typical components were obtained at inter-annual, decadal, multidecadal, and centennial timescales. A total of 323 temperature-sensitive proxy chronologies were incorporated after screening for each component. By scaling the proxy components using variance matching and applying a localized OI algorithm to all four components point by point, we obtained merged surface temperatures. Independent validation indicates that the most significant improvement was for components at the inter-annual scale, but this became less evident with increasing timescales. In mid-latitude land areas, 10-30% of grids were significantly corrected at the inter-annual scale. By assimilating the proxy records, the merged results reduced the gap in response to volcanic forcing between a pure reconstruction and simulation. Difficulty remained in verifying the centennial information and quantifying corresponding uncertainties, so additional effort should be devoted to this aspect in future research.

Health anxiety by proxy in women with severe health anxiety

DEFF Research Database (Denmark)

Thorgaard, Mette Viller; Frostholm, Lisbeth; Walker, Lynn

2017-01-01

Health anxiety (HA) refers to excessive worries and anxiety about harbouring serious illness based on misinterpretation of bodily sensations or changes as signs of serious illness. Severe HA is associated with disability and high health care costs. However, the impact of parental HA on excessive...... concern with their children's health (health anxiety by proxy) is scantly investigated. The aim of this study is to investigate HA by proxy in mothers with severe HA. Fifty mothers with severe HA and two control groups were included, i.e. mothers with rheumatoid arthritis (N = 49) and healthy mothers (N...

Performance of Solar Proxy Options of IRI-Plas Model for Equinox Seasons

Science.gov (United States)

Sezen, Umut; Gulyaeva, Tamara L.; Arikan, Feza

2018-02-01

International Reference Ionosphere (IRI) is the most acclaimed climatic model of the ionosphere. Since 2009, the range of the IRI model has been extended to the Global Positioning System (GPS) orbital height of 20,000 km in the plasmasphere. The new model, which is called IRI extended to Plasmasphere (IRI-Plas), can input not only the ionosonde foF2 and hmF2 but also the GPS-total electron content (TEC). IRI-Plas has been provided at www.ionolab.org, where online computation of ionospheric parameters is accomplished through a user-friendly interface. The solar proxies that are available in IRI-Plas can be listed as sunspot number (SSN1), SSN2, F10.7, global electron content (GEC), TEC, IG, Mg II, Lyman-α, and GEC_RZ. In this study, ionosonde foF2 data are compared with IRI-Plas foF2 values with the Consultative Committee International Radio (CCIR) and International Union of Radio Science (URSI) model choices for each solar proxy, with or without the GPS-TEC input for the equinox months of October 2011 and March 2015. It has been observed that the best fitting model choices in Root Mean Square (RMS) and Normalized RMS (NRMS) sense are the Jet Propulsion Laboratory global ionospheric maps-TEC input with Lyman-α solar proxy option for both months. The input of TEC definitely lowers the difference between the model and ionosonde foF2 values. The IG and Mg II solar proxies produce similar model foF2 values, and they usually are the second and third best fits to the ionosonde foF2 for the midlatitude ionosphere. In high-latitude regions, Jet Propulsion Laboratory global ionospheric map-TEC inputs to IRI-Plas with Lyman-α, GEC_RZ, and TEC solar proxies are the best choices. In equatorial region, the best fitting solar proxies are IG, Lyman-α, and Mg II.

Multiple imputation using linked proxy outcome data resulted in important bias reduction and efficiency gains: a simulation study.

Science.gov (United States)

Cornish, R P; Macleod, J; Carpenter, J R; Tilling, K

2017-01-01

When an outcome variable is missing not at random (MNAR: probability of missingness depends on outcome values), estimates of the effect of an exposure on this outcome are often biased. We investigated the extent of this bias and examined whether the bias can be reduced through incorporating proxy outcomes obtained through linkage to administrative data as auxiliary variables in multiple imputation (MI). Using data from the Avon Longitudinal Study of Parents and Children (ALSPAC) we estimated the association between breastfeeding and IQ (continuous outcome), incorporating linked attainment data (proxies for IQ) as auxiliary variables in MI models. Simulation studies explored the impact of varying the proportion of missing data (from 20 to 80%), the correlation between the outcome and its proxy (0.1-0.9), the strength of the missing data mechanism, and having a proxy variable that was incomplete. Incorporating a linked proxy for the missing outcome as an auxiliary variable reduced bias and increased efficiency in all scenarios, even when 80% of the outcome was missing. Using an incomplete proxy was similarly beneficial. High correlations (> 0.5) between the outcome and its proxy substantially reduced the missing information. Consistent with this, ALSPAC analysis showed inclusion of a proxy reduced bias and improved efficiency. Gains with additional proxies were modest. In longitudinal studies with loss to follow-up, incorporating proxies for this study outcome obtained via linkage to external sources of data as auxiliary variables in MI models can give practically important bias reduction and efficiency gains when the study outcome is MNAR.

Role of Advance Care Planning in Proxy Decision Making Among Individuals With Dementia and Their Family Caregivers.

Science.gov (United States)

Kwak, Jung; De Larwelle, Jessica A; Valuch, Katharine O'Connell; Kesler, Toni

2016-01-01

Health care proxies make important end-of-life decisions for individuals with dementia. A cross-sectional survey was conducted to examine the role of advance care planning in proxy decision making for 141 individuals with cognitive impairment, Alzheimer's disease, or other types of dementia. Proxies who did not know the preferences of individuals with dementia for life support treatments reported greater understanding of their values. Proxies of individuals with dementia who did not want life support treatments anticipated receiving less support and were more uncertain in decision making. The greater knowledge proxies had about dementia trajectory, family support, and trust of physicians, the more informed, clearer, and less uncertain they were in decision making. In addition to advance care planning, multiple factors influence proxy decision making, which should be considered in developing interventions and future research to support informed decision making for individuals with dementia and their families. Copyright 2016, SLACK Incorporated.

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.

Penguin tissue as a proxy for relative krill abundance in East Antarctica during the Holocene.

Science.gov (United States)

Huang, Tao; Sun, Liguang; Long, Nanye; Wang, Yuhong; Huang, Wen

2013-09-30

Antarctic krill (Euphausia superba) is a key component of the Southern Ocean food web. It supports a large number of upper trophic-level predators, and is also a major fishery resource. Understanding changes in krill abundance has long been a priority for research and conservation in the Southern Ocean. In this study, we performed stable isotope analyses on ancient Adélie penguin tissues and inferred relative krill abundance during the Holocene epoch from paleodiets of Adélie penguin (Pygoscelis adeliae), using inverse of δ¹⁵N (ratio of ¹⁵N/¹⁴N) value as a proxy. We find that variations in krill abundance during the Holocene are in accord with episodes of regional climate changes, showing greater krill abundance in cold periods. Moreover, the low δ¹⁵N values found in modern Adélie penguins indicate relatively high krill availability, which supports the hypothesis of krill surplus in modern ages due to recent hunt for krill-eating seals and whales by humans.

Measuring SIP proxy server performance

CERN Document Server

Subramanian, Sureshkumar V

2013-01-01

Internet Protocol (IP) telephony is an alternative to the traditional Public Switched Telephone Networks (PSTN), and the Session Initiation Protocol (SIP) is quickly becoming a popular signaling protocol for VoIP-based applications. SIP is a peer-to-peer multimedia signaling protocol standardized by the Internet Engineering Task Force (IETF), and it plays a vital role in providing IP telephony services through its use of the SIP Proxy Server (SPS), a software application that provides call routing services by parsing and forwarding all the incoming SIP packets in an IP telephony network.SIP Pr

Graphite-(Mo,W)S2 intergrowth as a palaeoenvironmental proxy in metasedimentary rocks

Science.gov (United States)

Cabral, Alexandre Raphael; Zeh, Armin; da Silva Viana, Nívea Cristina; Schirmer, Thomas; Lehmann, Bernd

2017-12-01

Molybdenum enrichment in pristine organic-C-rich sedimentary rocks forms the basis for inferring the presence of dissolved oxygen in seawater. Organic matter removes dissolved hexavalent Mo from seawater where anoxic and euxinic conditions are attained. However, it is unknown whether this Mo-based proxy is retained under metamorphic conditions where organic C is no longer preserved. Here, we describe aggregates of graphite and molybdenite (MoS2) containing up to 21 mass per cent of W as tungstenite (WS2) in solid solution. These aggregates are disseminated in a sulfide-rich Mn-silicate-carbonate rock (queluzite), metamorphosed under amphibolite-facies conditions within the Archaean Barbacena greenstone belt in Minas Gerais, Brazil. Our finding indicates that: (i) W is, like Mo, a palaeoenvironmental proxy; (ii) the W proxy is sensitive to high fS2/fO2 environments; (iii) both Mo and W proxies survive amphibolite-facies overprint as (Mo,W)S2 intergrown with graphite. Archaean greenstones are potential candidates for storing palaeoenvironmental information as (Mo,W)S2-graphite intergrowths.

Web components and the semantic web

OpenAIRE

Casey, Maire; Pahl, Claus

2003-01-01

Component-based software engineering on the Web differs from traditional component and software engineering. We investigate Web component engineering activites that are crucial for the development,com position, and deployment of components on the Web. The current Web Services and Semantic Web initiatives strongly influence our work. Focussing on Web component composition we develop description and reasoning techniques that support a component developer in the composition activities,fo cussing...

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.

Slices: A shape-proxy based on planar sections

KAUST Repository

McCrae, James; Singh, Karan S.; Mitra, Niloy J.

2011-01-01

of intersection of planes with a 3D object, for creating shape abstractions, motivated by their popularity in art and engineering. We first perform a user study to show that humans do define consistent and similar planar section proxies for common objects

Technical Note: Probabilistically constraining proxy age–depth models within a Bayesian hierarchical reconstruction model

Directory of Open Access Journals (Sweden)

J. P. Werner

2015-03-01

Full Text Available Reconstructions of the late-Holocene climate rely heavily upon proxies that are assumed to be accurately dated by layer counting, such as measurements of tree rings, ice cores, and varved lake sediments. Considerable advances could be achieved if time-uncertain proxies were able to be included within these multiproxy reconstructions, and if time uncertainties were recognized and correctly modeled for proxies commonly treated as free of age model errors. Current approaches for accounting for time uncertainty are generally limited to repeating the reconstruction using each one of an ensemble of age models, thereby inflating the final estimated uncertainty – in effect, each possible age model is given equal weighting. Uncertainties can be reduced by exploiting the inferred space–time covariance structure of the climate to re-weight the possible age models. Here, we demonstrate how Bayesian hierarchical climate reconstruction models can be augmented to account for time-uncertain proxies. Critically, although a priori all age models are given equal probability of being correct, the probabilities associated with the age models are formally updated within the Bayesian framework, thereby reducing uncertainties. Numerical experiments show that updating the age model probabilities decreases uncertainty in the resulting reconstructions, as compared with the current de facto standard of sampling over all age models, provided there is sufficient information from other data sources in the spatial region of the time-uncertain proxy. This approach can readily be generalized to non-layer-counted proxies, such as those derived from marine sediments.

Assessing the quality of life of children with sickle cell anaemia using self-, parent-proxy, and health care professional-proxy reports.

Science.gov (United States)

Constantinou, Christina; Payne, Nicola; Inusa, Baba

2015-05-01

The quality of life (QoL) of children with sickle cell anaemia (SCA) in the United Kingdom has not been examined, and a discrepancy measure based on Gap theory has rarely been used. This study investigated whether (1) child self-reports of QoL using a discrepancy measure (the Generic Children's QoL Measure; GCQ) are lower than those from healthy children, (2) proxy reports from parents and health care professionals are lower than child self-reports, and (3) demographic and disease severity indicators are related to QoL. An interdependent groups, cross-sectional design was implemented. Seventy-four children with SCA, their parent, and members of their health care team completed the GCQ. Demographic and disease severity indicators were recorded. GCQ data from healthy children were obtained from the UK Data Archive. Contrary to past research, when examining generic discrepancy QoL, children with SCA did not report a lower QoL than healthy children, and parent- and health care professional-proxy reports were not lower than child self-reports. Few of the demographic and disease severity indicators were related to QoL. Proxy reports may be used to gain a more complete picture of QoL, but should not be a substitute for self-reports. The explanation for the relatively high levels of QoL reported is not clear, but children with SCA may have realistic expectations about their ideal-self, place greater emphasis on aspects other than health in shaping their QoL, and define achievements within the limits of their illness. Future research should focus on psychological factors in explaining QoL. Statement of contribution What is already known on this subject? Children with sickle cell disease (SCD) generally have a reduced QoL compared with healthy children, but there appears to be no research measuring QoL in paediatric SCD in the United Kingdom. Proxy QoL reports from parents are often lower than child self-reports, but there is less research examining proxy reports from health

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...

Revocable identity-based proxy re-signature against signing key exposure.

Science.gov (United States)

Yang, Xiaodong; Chen, Chunlin; Ma, Tingchun; Wang, Jinli; Wang, Caifen

2018-01-01

Identity-based proxy re-signature (IDPRS) is a novel cryptographic primitive that allows a semi-trusted proxy to convert a signature under one identity into another signature under another identity on the same message by using a re-signature key. Due to this transformation function, IDPRS is very useful in constructing privacy-preserving schemes for various information systems. Key revocation functionality is important in practical IDPRS for managing users dynamically; however, the existing IDPRS schemes do not provide revocation mechanisms that allow the removal of misbehaving or compromised users from the system. In this paper, we first introduce a notion called revocable identity-based proxy re-signature (RIDPRS) to achieve the revocation functionality. We provide a formal definition of RIDPRS as well as its security model. Then, we present a concrete RIDPRS scheme that can resist signing key exposure and prove that the proposed scheme is existentially unforgeable against adaptive chosen identity and message attacks in the standard model. To further improve the performance of signature verification in RIDPRS, we introduce a notion called server-aided revocable identity-based proxy re-signature (SA-RIDPRS). Moreover, we extend the proposed RIDPRS scheme to the SA-RIDPRS scheme and prove that this extended scheme is secure against adaptive chosen message and collusion attacks. The analysis results show that our two schemes remain efficient in terms of computational complexity when implementing user revocation procedures. In particular, in the SA-RIDPRS scheme, the verifier needs to perform only a bilinear pairing and four exponentiation operations to verify the validity of the signature. Compared with other IDPRS schemes in the standard model, our SA-RIDPRS scheme greatly reduces the computation overhead of verification.

Munchausen syndrome by proxy: a family anthology.

Science.gov (United States)

Pickford, E; Buchanan, N; McLaughlan, S

1988-06-20

While the Munchausen-by-proxy syndrome is well recognized, the story of one family has been related to describe some remarkable features. These include the psychopathology of the mother, the involvement of both children in the family, the great difficulty in obtaining proof of child abuse and, finally, the prosecution of the mother in the criminal court.

Understanding the Cognitive and Affective Mechanisms that Underlie Proxy Risk Perceptions among Caregivers of Asthmatic Children.

Science.gov (United States)

Shepperd, James A; Lipsey, Nikolette P; Pachur, Thorsten; Waters, Erika A

2018-07-01

Medical decisions made on behalf of another person-particularly those made by adult caregivers for their minor children-are often informed by the decision maker's beliefs about the treatment's risks and benefits. However, we know little about the cognitive and affective mechanisms influencing such "proxy" risk perceptions and about how proxy risk perceptions are related to prominent judgment phenomena. Adult caregivers of minor children with asthma ( N = 132) completed an online, cross-sectional survey assessing 1) cognitions and affects that form the basis of the availability, representativeness, and affect heuristics; 2) endorsement of the absent-exempt and the better-than-average effect; and 3) proxy perceived risk and unrealistic comparative optimism of an asthma exacerbation. We used the Pediatric Asthma Control and Communication Instrument (PACCI) to assess asthma severity. Respondents with higher scores on availability, representativeness, and negative affect indicated higher proxy risk perceptions and (for representativeness only) lower unrealistic optimism, irrespective of asthma severity. Conversely, respondents who showed a stronger display of the better-than-average effect indicated lower proxy risk perceptions but did not differ in unrealistic optimism. The absent-exempt effect was unrelated to proxy risk perceptions and unrealistic optimism. Heuristic judgment processes appear to contribute to caregivers' proxy risk perceptions of their child's asthma exacerbation risk. Moreover, the display of other, possibly erroneous, judgment phenomena is associated with lower caregiver risk perceptions. Designing interventions that target these mechanisms may help caregivers work with their children to reduce exacerbation risk.