Results 11 - 20 of 711

2.0 Users Manual

by Ul. R. Maya, Dr. Piotr Wozniak , 1999
"... recommended) 32 MB memory Minimum System Requirements: (For 10 MB free disk space download version) SVGA with resolution 800x600 (higher resolutions recommended) Internet Explorer 6.0 with all recent security updates Author ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
recommended) 32 MB memory Minimum System Requirements: (For 10 MB free disk space download version) SVGA with resolution 800x600 (higher resolutions recommended) Internet Explorer 6.0 with all recent security updates Author

Visualizing Long-Term Memory Formation in Two Neurons

by unknown authors
"... Long-term memory (LTM) depends on the synthesis of new proteins. Using a temperature-sensitive ribosome-inactivating toxin to acutely inhibit protein synthesis, we screened individual neurons making new proteins after olfactory associative conditioning in Drosophila. Surprisingly, LTM was impaired a ..."
Abstract - Add to MetaCart
after inhibiting protein synthesis in two dorsal-anterior-lateral (DAL) neurons but not in the mushroom body (MB), which is considered the adult learning and memory center. Using a photoconvertible fluorescent protein KAEDE to report de novo protein synthesis, we have directly visualized cyclic

Memory Disk

by unknown authors
"... ! Disk is inexpensive, but slow " $0.2-1/GB (100 less expensive) " 5-10ms latency (200K-400K times slower) " 40-80MB/sec per disk (1,000 times less)! Our goals " Run programs as efficiently as possible " Make the system as safe as possible CPU ..."
Abstract - Add to MetaCart
! Disk is inexpensive, but slow " $0.2-1/GB (100 less expensive) " 5-10ms latency (200K-400K times slower) " 40-80MB/sec per disk (1,000 times less)! Our goals " Run programs as efficiently as possible " Make the system as safe as possible CPU

Adaptive insertion policies for high performance caching

by Moinuddin K. Qureshi, Aamer Jaleel, Yale N. Patt, Simon C. Steely, Jr. Joel Emer - In Proceedings of the 35th International Symposium on Computer Architecture , 2007
"... The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applications, the majority of lines traverse from the MRU position to the LRU position without receiving any cache hits, resulti ..."
Abstract - Cited by 114 (5 self) - Add to MetaCart
The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applications, the majority of lines traverse from the MRU position to the LRU position without receiving any cache hits

An Evaluation of Knowledge Base Systems for Large OWL Datasets

by Yuanbo Guo, Zhengxiang Pan, Jeff Heflin - In Proc. of the 3rd International Semantic Web Conference (ISWC2004 , 2004
"... Abstract. In this paper, we present our work on evaluating knowledge base sys-tems with respect to use in large OWL applications. To this end, we have de-veloped the Lehigh University Benchmark (LUBM). The benchmark is in-tended to evaluate knowledge base systems with respect to extensional queries ..."
Abstract - Cited by 101 (4 self) - Add to MetaCart
the largest dataset consists of 999 files totaling 583MB. We evaluated two memory-based systems (OWLJessKB and memory-based Ses-ame) and two systems with persistent storage (database-based Sesame and DLDB-OWL). We show the results of the experiment and discuss the perform-ance of each system. In particular

Software Support for Virtual Memory-Mapped Communication

by Cezary Dubnicki, Liviu Iftode, Edward Felten, Kai Li - In Proceedings of the 1996 International Parallel Processing Symposium , 1996
"... Virtual memory-mapped communication (VMMC) is a communication model providing direct data transfer between the sender's and receiver's virtual address spaces. This model eliminates operating system involvement in communication, provides full protection, supports user-level buffer manageme ..."
Abstract - Cited by 50 (16 self) - Add to MetaCart
Virtual memory-mapped communication (VMMC) is a communication model providing direct data transfer between the sender's and receiver's virtual address spaces. This model eliminates operating system involvement in communication, provides full protection, supports user-level buffer

Longest Prefix Matching using Bloom Filters

by Sarang Dharmapurikar , Praveen Krishnamurthy, David E. Taylor , 2003
"... We introduce the first algorithm that we are aware of to employ Bloom filters for Longest Prefix Matching (LPM). The algorithm performs parallel queries on Bloom filters, an e#cient data structure for membership queries, in order to determine address prefix membership in sets of prefixes sorted by p ..."
Abstract - Cited by 111 (7 self) - Add to MetaCart
by prefix length. We show that use of this algorithm for Internet Protocol (IP) routing lookups results in a search engine providing better performance and scalability than TCAM-based approaches. The key feature of our technique is that the performance, as determined by the number of dependent memory

MRAM Memory

by J. Nahas, T. Andre, C. Subramanian, B. Garni, H. Lin, A. Omair, W. Martino
"... Magnetoresistive random access memory (MRAM) is a promising, maturing non-volatile memory technology that extends beyond the space traditionally covered by Flash and EEPROM by achieving the density of Flash at significantly faster write speeds and with unlimited endurance [1,2]. To date, the develop ..."
Abstract - Add to MetaCart
Magnetoresistive random access memory (MRAM) is a promising, maturing non-volatile memory technology that extends beyond the space traditionally covered by Flash and EEPROM by achieving the density of Flash at significantly faster write speeds and with unlimited endurance [1,2]. To date

Worst-Case Efficient External-Memory Priority Queues

by Gerth Stølting Brodal, Jyrki Katajainen - In Proc. Scandinavian Workshop on Algorithms Theory, LNCS 1432 , 1998
"... . A priority queue Q is a data structure that maintains a collection of elements, each element having an associated priority drawn from a totally ordered universe, under the operations Insert, which inserts an element into Q, and DeleteMin, which deletes an element with the minimum priority from ..."
Abstract - Cited by 35 (3 self) - Add to MetaCart
from Q. In this paper a priority-queue implementation is given which is efficient with respect to the number of block transfers or I/Os performed between the internal and external memories of a computer. Let B and M denote the respective capacity of a block and the internal memory measured

Research Extinction Memory Improvement

by F. Gonzalez-lima, Ra K. Bruchey
"... We investigated whether postextinction administration of methylene blue (MB) could enhance retention of an extinguished conditioned response. MB is a redox compound that at low doses elevates cytochrome oxidase activity, thereby improving brain energy production. Saline or MB (4 mg/kg intraperitonea ..."
Abstract - Add to MetaCart
/kg intraperitoneally) were administered to rats for 5 d following extinction training of tone-footshock conditioning. Postextinction freezing was lower in rats receiving MB compared with saline, suggesting that MB improved retention of the extinction memory. The MB effect was specific to tone-evoked freezing because
Results 11 - 20 of 711