Powered by Deep Web Technologies
Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

Quantum random access memory  

E-Print Network (OSTI)

A random access memory (RAM) uses n bits to randomly address N=2^n distinct memory cells. A quantum random access memory (qRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that exponentially reduces the requirements for a memory call: O(log N) switches need be thrown instead of the N used in conventional (classical or quantum) RAM designs. This yields a more robust qRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing. A quantum optical implementation is presented.

Vittorio Giovannetti; Seth Lloyd; Lorenzo Maccone

2007-08-14T23:59:59.000Z

2

Design for an optical random access memory  

Science Journals Connector (OSTI)

Cascadable optically nonlinear arrays of logic devices interconnected with space invariant optical components are proposed for the core memory of a digital computer. Access time to any...

Murdocca, Miles J; Sugla, Binay

1989-01-01T23:59:59.000Z

3

A Robust Quantum Random Access Memory  

E-Print Network (OSTI)

A "bucket brigade" architecture for a quantum random memory of $N=2^n$ memory cells needs $n(n+5)/2$ times of quantum manipulation on control circuit nodes per memory call. Here we propose a scheme, in which only average $n/2$ times manipulation is required to accomplish a memory call. This scheme may significantly decrease the time spent on a memory call and the average overall error rate per memory call. A physical implementation scheme for storing an arbitrary state in a selected memory cell followed by reading it out is discussed.

Fang-Yu Hong; Yang Xiang; Zhi-Yan Zhu; Li-zhen Jiang; Liang-neng Wu

2012-01-11T23:59:59.000Z

4

Materials Selection for Oxide-based Resistive Random Access Memories  

E-Print Network (OSTI)

The energies of atomic processes in resistive random access memories (RRAMs) are calculated for four typical oxides, HfO2, TiO2, Ta 2O5, and Al2O3, to define a materials selection process. O vacancies have the lowest defect formation energy in the O...

Guo, Yuzheng; Robertson, John

2014-12-05T23:59:59.000Z

5

Paging memory from random access memory to backing storage in a parallel computer  

DOE Patents (OSTI)

Paging memory from random access memory (`RAM`) to backing storage in a parallel computer that includes a plurality of compute nodes, including: executing a data processing application on a virtual machine operating system in a virtual machine on a first compute node; providing, by a second compute node, backing storage for the contents of RAM on the first compute node; and swapping, by the virtual machine operating system in the virtual machine on the first compute node, a page of memory from RAM on the first compute node to the backing storage on the second compute node.

Archer, Charles J; Blocksome, Michael A; Inglett, Todd A; Ratterman, Joseph D; Smith, Brian E

2013-05-21T23:59:59.000Z

6

Random access memory immune to single event upset using a T-resistor  

DOE Patents (OSTI)

In a random access memory cell, a resistance "T" decoupling network in each leg of the cell reduces random errors caused by the interaction of energetic ions with the semiconductor material forming the cell. The cell comprises two parallel legs each containing a series pair of complementary MOS transistors having a common gate connected to the node between the transistors of the opposite leg. The decoupling network in each leg is formed by a series pair of resistors between the transistors together with a third resistor interconnecting the junction between the pair of resistors and the gate of the transistor pair forming the opposite leg of the cell.

Ochoa, Jr., Agustin (Vista, CA)

1989-01-01T23:59:59.000Z

7

Content-aware Encoding for Improving Energy Efficiency in Multi-Level Cell Resistive Random Access Memory  

E-Print Network (OSTI)

Content-aware Encoding for Improving Energy Efficiency in Multi-Level Cell Resistive Random Access general-purpose and embedded systems. It is widely acknowl- edged that energy of the memory structure is a major contributor in overall system energy. Recent advances with emerging non-volatile memory (NVM

Mishra, Prabhat

8

Dual operation characteristics of resistance random access memory in indium-gallium-zinc-oxide thin film transistors  

SciTech Connect

In this study, indium-gallium-zinc-oxide thin film transistors can be operated either as transistors or resistance random access memory devices. Before the forming process, current-voltage curve transfer characteristics are observed, and resistance switching characteristics are measured after a forming process. These resistance switching characteristics exhibit two behaviors, and are dominated by different mechanisms. The mode 1 resistance switching behavior is due to oxygen vacancies, while mode 2 is dominated by the formation of an oxygen-rich layer. Furthermore, an easy approach is proposed to reduce power consumption when using these resistance random access memory devices with the amorphous indium-gallium-zinc-oxide thin film transistor.

Yang, Jyun-Bao; Chen, Yu-Ting; Chu, Ann-Kuo [Department of Photonics, National Sun Yat-Sen University, Kaohsiung, Taiwan (China); Chang, Ting-Chang, E-mail: tcchang@mail.phys.nsysu.edu.tw [Department of Photonics, National Sun Yat-Sen University, Kaohsiung, Taiwan (China); Department of Physics, National Sun Yat-Sen University, Kaohsiung, Taiwan (China); Advanced Optoelectronics Technology Center, National Cheng Kung University, Taiwan (China); Huang, Jheng-Jie; Chen, Yu-Chun; Tseng, Hsueh-Chih [Department of Physics, National Sun Yat-Sen University, Kaohsiung, Taiwan (China); Sze, Simon M. [Department of Physics, National Sun Yat-Sen University, Kaohsiung, Taiwan (China); Department of Electronics Engineering, National Chiao Tung University, Hsinchu, Taiwan (China)

2014-04-14T23:59:59.000Z

9

Scanning transmission X-ray microscopy probe for in situ mechanism study of graphene-oxide-based resistive random access memory  

Science Journals Connector (OSTI)

An in situ probe for scanning transmission X-ray microscopy has been developed and applied to the study of the bipolar resistive switching mechanism in an Al/graphene oxide/Al resistive random access memory device.

Nho, H.W.

2013-11-28T23:59:59.000Z

10

Carbon Resistive Random Access Memory Materials -CareRAMM An FP7 NMP Project led by the University of Exeter and in collaboration with IBM Research  

E-Print Network (OSTI)

Carbon Resistive Random Access Memory Materials - CareRAMM An FP7 NMP Project led by the University physical mechanism responsible for this resistive switching in carbon materials is not clear, with sp2 research and development of alternative data storage materials and concepts. The increasingly important

Mumby, Peter J.

11

Total ionizing dose effect of ?-ray radiation on the switching characteristics and filament stability of HfOx resistive random access memory  

SciTech Connect

The total ionizing dose (TID) effect of gamma-ray (?-ray) irradiation on HfOx based resistive random access memory was investigated by electrical and material characterizations. The memory states can sustain TID level ?5.2 Mrad (HfO{sub 2}) without significant change in the functionality or the switching characteristics under pulse cycling. However, the stability of the filament is weakened after irradiation as memory states are more vulnerable to flipping under the electrical stress. X-ray photoelectron spectroscopy was performed to ascertain the physical mechanism of the stability degradation, which is attributed to the Hf-O bond breaking by the high-energy ?-ray exposure.

Fang, Runchen; Yu, Shimeng, E-mail: shimengy@asu.edu [School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, Arizona 85281 (United States); School of Electrical, Computer, and Energy Engineering, Arizona State University, Tempe, Arizona 85287 (United States); Gonzalez Velo, Yago; Chen, Wenhao; Holbert, Keith E.; Kozicki, Michael N.; Barnaby, Hugh [School of Electrical, Computer, and Energy Engineering, Arizona State University, Tempe, Arizona 85287 (United States)

2014-05-05T23:59:59.000Z

12

Distribution of nanoscale nuclei in the amorphous dome of a phase change random access memory  

SciTech Connect

The nanoscale crystal nuclei in an amorphous Ge{sub 2}Sb{sub 2}Te{sub 5} bit in a phase change memory device were evaluated by fluctuation transmission electron microscopy. The quench time in the device (?10 ns) afforded more and larger nuclei in the melt-quenched state than in the as-deposited state. However, nuclei were even more numerous and larger in a test structure with a longer quench time (?100 ns), verifying the prediction of nucleation theory that slower cooling produces more nuclei. It also demonstrates that the thermal design of devices will strongly influence the population of nuclei, and thus the speed and data retention characteristics.

Lee, Bong-Sub, E-mail: bongsub@gmail.com; Darmawikarta, Kristof; Abelson, John R. [Department of Materials Science and Engineering and the Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801 (United States); Raoux, Simone; Shih, Yen-Hao; Zhu, Yu [IBM/Macronix PCRAM Joint Project, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598 (United States); Bishop, Stephen G. [Department of Materials Science and Engineering and the Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801 (United States); Department of Electrical and Computer Engineering and the Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801 (United States)

2014-02-17T23:59:59.000Z

13

Memory Coalescing Techniques 1 Accessing Global and Shared Memory  

E-Print Network (OSTI)

Memory Coalescing Techniques 1 Accessing Global and Shared Memory memory coalescing to global memory avoiding bank conflicts in shared memory 2 Memory Coalescing Techniques accessing global memory for a matrix using shared memory for coalescing 3 Avoiding Bank Conflicts computing consecutive powers MCS 572

Verschelde, Jan

14

Mechanism of power consumption inhibitive multi-layer Zn:SiO{sub 2}/SiO{sub 2} structure resistance random access memory  

SciTech Connect

In this paper, multi-layer Zn:SiO{sub 2}/SiO{sub 2} structure is introduced to reduce the operation power consumption of resistive random access memory (RRAM) device by modifying the filament formation process. And the configuration of multi-layer Zn:SiO{sub 2}/SiO{sub 2} structure is confirmed and demonstrated by auger electron spectrum. Material analysis together with conduction current fitting is applied to qualitatively evaluate the carrier conduction mechanism on both low resistance state and high resistance state. Finally, single layer and multilayer conduction models are proposed, respectively, to clarify the corresponding conduction characteristics of two types of RRAM devices.

Zhang, Rui; Lou, Jen-Chung [School of Software and Microelectronics, Peking University, Beijing 100871 (China); Tsai, Tsung-Ming, E-mail: tmtsai@faculty.nsysu.edu.tw, E-mail: tcchang@mail.phys.nsysu.edu.tw; Chang, Kuan-Chang; Huang, Syuan-Yong; Shih, Chih-Cheng; Pan, Jhih-Hong; Tung, Cheng-Wei [Department of Materials and Optoelectronic Science, National Sun Yat-Sen University, Kaohsiung 804, Taiwan (China); Chang, Ting-Chang, E-mail: tmtsai@faculty.nsysu.edu.tw, E-mail: tcchang@mail.phys.nsysu.edu.tw [Department of Physics, National Sun Yat-Sen University, Kaohsiung 804, Taiwan (China); Advanced Optoelectronics Technology Center, National Cheng Kung University, Tainan 700, Taiwan (China); Chen, Kai-Huang [Department of Electronics Engineering and Computer Science, Tung-Fang Design Institute, Kaohsiung, Taiwan (China); Young, Tai-Fa; Chen, Hsin-Lu [Department of Mechanical and Electro-Mechanical Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan (China); Chen, Jung-Hui [Department of Chemistry, National Kaohsiung Normal University, Kaohsiung, Taiwan (China); Chen, Min-Chen; Syu, Yong-En [Department of Physics, National Sun Yat-Sen University, Kaohsiung 804, Taiwan (China); Sze, Simon M. [Department of Electronics Engineering, National Chiao Tung University, Hsinchu 300, Taiwan (China)

2013-12-21T23:59:59.000Z

15

Evaluation of the colossal electroresistance (CER) effect and its application in the non-volatile Resistive Random Access Memory (RRAM)  

E-Print Network (OSTI)

Flash memory, the current leading technology for non-volatile memory (NVM), is projected by many to run obsolete in the face of future miniaturization trend in the semiconductor devices due to some of its technical ...

Wicaksono, Aulia Tegar

2009-01-01T23:59:59.000Z

16

Low leakage Ru-strontium titanate-Ru metal-insulator-metal capacitors for sub-20?nm technology node in dynamic random access memory  

SciTech Connect

Improved metal-insulator-metal capacitor (MIMCAP) stacks with strontium titanate (STO) as dielectric sandwiched between Ru as top and bottom electrode are shown. The Ru/STO/Ru stack demonstrates clearly its potential to reach sub-20?nm technology nodes for dynamic random access memory. Downscaling of the equivalent oxide thickness, leakage current density (J{sub g}) of the MIMCAPs, and physical thickness of the STO have been realized by control of the Sr/Ti ratio and grain size using a heterogeneous TiO{sub 2}/STO based nanolaminate stack deposition and a two-step crystallization anneal. Replacement of TiN with Ru as both top and bottom electrodes reduces the amount of electrically active defects and is essential to achieve a low leakage current in the MIM capacitor.

Popovici, M., E-mail: Mihaela.Ioana.Popovici@imec.be; Swerts, J.; Redolfi, A.; Kaczer, B.; Aoulaiche, M.; Radu, I.; Clima, S.; Everaert, J.-L.; Van Elshocht, S.; Jurczak, M. [Imec, Leuven 3001 (Belgium)

2014-02-24T23:59:59.000Z

17

Effect of memory access and caching on high performance computing.  

E-Print Network (OSTI)

??High-performance computing is often limited by memory access. As speeds increase, processors are often waiting on data transfers to and from memory. Classic memory controllers… (more)

Groening, James

2012-01-01T23:59:59.000Z

18

Low latency memory access and synchronization  

DOE Patents (OSTI)

A low latency memory system access is provided in association with a weakly-ordered multiprocessor system. Bach processor in the multiprocessor shares resources, and each shared resource has an associated lock within a locking device that provides support for synchronization between the multiple processors in the multiprocessor and the orderly sharing of the resources. A processor only has permission to access a resource when it owns the lock associated with that resource, and an attempt by a processor to own a lock requires only a single load operation, rather than a traditional atomic load followed by store, such that the processor only performs a read operation and the hardware locking device performs a subsequent write operation rather than the processor. A simple prefetching for non-contiguous data structures is also disclosed. A memory line is redefined so that in addition to the normal physical memory data, every line includes a pointer that is large enough to point to any other line in the memory, wherein the pointers to determine which memory line to prefetch rather than some other predictive algorithm. This enables hardware to effectively prefetch memory access patterns that are non-contiguous, but repetitive.

Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton On Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Hoenicke, Dirk (Ossining, NY); Ohmacht, Martin (Brewster, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY), Vranas; Pavlos M. (Bedford Hills, NY)

2010-10-19T23:59:59.000Z

19

Low latency memory access and synchronization  

DOE Patents (OSTI)

A low latency memory system access is provided in association with a weakly-ordered multiprocessor system. Each processor in the multiprocessor shares resources, and each shared resource has an associated lock within a locking device that provides support for synchronization between the multiple processors in the multiprocessor and the orderly sharing of the resources. A processor only has permission to access a resource when it owns the lock associated with that resource, and an attempt by a processor to own a lock requires only a single load operation, rather than a traditional atomic load followed by store, such that the processor only performs a read operation and the hardware locking device performs a subsequent write operation rather than the processor. A simple prefetching for non-contiguous data structures is also disclosed. A memory line is redefined so that in addition to the normal physical memory data, every line includes a pointer that is large enough to point to any other line in the memory, wherein the pointers to determine which memory line to prefetch rather than some other predictive algorithm. This enables hardware to effectively prefetch memory access patterns that are non-contiguous, but repetitive.

Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton On Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Hoenicke, Dirk (Ossining, NY); Ohmacht, Martin (Brewster, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

2007-02-06T23:59:59.000Z

20

Influence of carbon content on the copper-telluride phase formation and on the resistive switching behavior of carbon alloyed Cu-Te conductive bridge random access memory cells  

SciTech Connect

In this paper, we investigate the influence of the carbon content on the Cu-Te phase formation and on the resistive switching behavior in carbon alloyed Cu{sub 0.6}Te{sub 0.4} based conductive bridge random access memory (CBRAM) cells. Carbon alloying of copper-tellurium inhibits the crystallization, while attractive switching behavior is preserved when using the material as Cu-supply layer in CBRAM cells. The phase formation is first investigated in a combinatorial way. With increasing carbon content, an enlargement of the temperature window in which the material stays amorphous was observed. Moreover, if crystalline phases are formed, subsequent phase transformations are inhibited. The electrical switching behavior of memory cells with different carbon contents is then investigated by implementing them in 580??m diameter dot TiN/Cu{sub 0.6}Te{sub 0.4}-C/Al{sub 2}O{sub 3}/Si memory cells. Reliable switching behavior is observed for carbon contents up to 40 at. %, with a resistive window of more than 2 orders of magnitude, whereas for 50 at. % carbon, a higher current in the off state and only a small resistive window are present after repeated cycling. This degradation can be ascribed to the higher thermal and lower drift contribution to the reset operation due to a lower Cu affinity towards the supply layer, leading cycle-after-cycle to an increasing amount of Cu in the switching layer, which contributes to the current. The thermal diffusion of Cu into Al{sub 2}O{sub 3} under annealing also gives an indication of the Cu affinity of the source layer. Time of flight secondary ion mass spectroscopy was used to investigate this migration depth in Al{sub 2}O{sub 3} before and after annealing, showing a higher Cu, Te, and C migration for high carbon contents.

Devulder, Wouter, E-mail: Wouter.Devulder@UGent.be; De Schutter, Bob; Detavernier, Christophe [Department of Solid State Sciences, Universiteit Gent, Krijgslaan 281 (S1), 9000 Gent (Belgium); Opsomer, Karl; Franquet, Alexis; Meersschaut, Johan; Muller, Robert; Van Elshocht, Sven; Jurczak, Malgorzata; Goux, Ludovic [IMEC, Kapeldreef 75, 3001 Leuven (Belgium); Belmonte, Attilio [IMEC, Kapeldreef 75, 3001 Leuven (Belgium); KU Leuven, Department of Physics and Astronomy, Celestijnenlaan 200D, 3001 Leuven (Belgium)

2014-02-07T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Hydrodynamical random walker with chemotactic memory  

E-Print Network (OSTI)

A three-dimensional hydrodynamical model for a micro random walker is combined with the idea of chemotactic signaling network of E. coli. Diffusion exponents, orientational correlation functions and their dependence on the geometrical and dynamical parameters of the system are analyzed numerically. Because of the chemotactic memory, the walker shows superdiffusing displacements in all directions with the largest diffusion exponent for a direction along the food gradient. Mean square displacements and orientational correlation functions show that the chemotactic memory washes out all the signatures due to the geometrical asymmetry of the walker and statistical properties are asymmetric only with respect to the direction of food gradient. For different values of the memory time, the Chemotactic index (CI) is also calculated.

H. Mohammady; B. Esckandariun; A. Najafi

2014-10-01T23:59:59.000Z

22

Hydrodynamical random walker with chemotactic memory  

E-Print Network (OSTI)

A three-dimensional hydrodynamical model for a micro random walker is combined with the idea of chemotactic signaling network of E. coli. Diffusion exponents, orientational correlation functions and their dependence on the geometrical and dynamical parameters of the system are analyzed numerically. Because of the chemotactic memory, the walker shows superdiffusing displacements in all directions with the largest diffusion exponent for a direction along the food gradient. Mean square displacements and orientational correlation functions show that the chemotactic memory washes out all the signatures due to the geometrical asymmetry of the walker and statistical properties are asymmetric only with respect to the direction of food gradient. For different values of the memory time, the Chemotactic index (CI) is also calculated.

Mohammady, H; Najafi, A

2014-01-01T23:59:59.000Z

23

Pipelined Memory Controllers for DSP Applications Handling Unpredictable Data Accesses  

E-Print Network (OSTI)

Pipelined Memory Controllers for DSP Applications Handling Unpredictable Data Accesses Bertrand Le pipelined memory access controllers can be generated improving the pipeline access mode to RAM. We focus as unpredictable ones (dynamic address computations) in a pipeline way. 1 Introduction Actual researches

Paris-Sud XI, Université de

24

Direct memory access transfer completion notification  

DOE Patents (OSTI)

Methods, compute nodes, and computer program products are provided for direct memory access (`DMA`) transfer completion notification. Embodiments include determining, by an origin DMA engine on an origin compute node, whether a data descriptor for an application message to be sent to a target compute node is currently in an injection first-in-first-out (`FIFO`) buffer in dependence upon a sequence number previously associated with the data descriptor, the total number of descriptors currently in the injection FIFO buffer, and the current sequence number for the newest data descriptor stored in the injection FIFO buffer; and notifying a processor core on the origin DMA engine that the message has been sent if the data descriptor for the message is not currently in the injection FIFO buffer.

Chen, Dong (Croton on Hudson, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Kumar, Sameer (White Plains, NY); Parker, Jeffrey J. (Rochester, MN); Steinmacher-Burow, Burkhard D. (Esslingen, DE); Vranas, Pavlos (Danville, CA)

2010-07-27T23:59:59.000Z

25

Remote direct memory access over datagrams  

DOE Patents (OSTI)

A communication stack for providing remote direct memory access (RDMA) over a datagram network is disclosed. The communication stack has a user level interface configured to accept datagram related input and communicate with an RDMA enabled network interface card (NIC) via an NIC driver. The communication stack also has an RDMA protocol layer configured to supply one or more data transfer primitives for the datagram related input of the user level. The communication stack further has a direct data placement (DDP) layer configured to transfer the datagram related input from a user storage to a transport layer based on the one or more data transfer primitives by way of a lower layer protocol (LLP) over the datagram network.

Grant, Ryan Eric; Rashti, Mohammad Javad; Balaji, Pavan; Afsahi, Ahmad

2014-12-02T23:59:59.000Z

26

Generation-based memory synchronization in a multiprocessor system with weakly consistent memory accesses  

DOE Patents (OSTI)

In a multiprocessor system, a central memory synchronization module coordinates memory synchronization requests responsive to memory access requests in flight, a generation counter, and a reclaim pointer. The central module communicates via point-to-point communication. The module includes a global OR reduce tree for each memory access requesting device, for detecting memory access requests in flight. An interface unit is implemented associated with each processor requesting synchronization. The interface unit includes multiple generation completion detectors. The generation count and reclaim pointer do not pass one another.

Ohmacht, Martin

2014-09-09T23:59:59.000Z

27

High Density Concurrent Access Opto-Electronic VLSI Memory  

Science Journals Connector (OSTI)

In this paper we show how opto-electronic VLSI smart pixels (OE-VLSI) and free space interconnections can be used to implement a parallel access optical memory device that combines...

Lukowicz, Paul

28

Conjugate memory effect of random scattered waves  

Science Journals Connector (OSTI)

The correlation function between two speckle patterns produced by different incident waves is studied by means of stochastic approaches. The angular-frequency memory effect, which...

Kawanishi, Tetsuya; Wang, Zhi Liang; Izutsu, Masayuki; Ogura, Hisanao

1999-01-01T23:59:59.000Z

29

Quantifying and Resolving Remote Memory Access Contention on Hardware DSM Multiprocessors  

E-Print Network (OSTI)

Quantifying and Resolving Remote Memory Access Contention on Hardware DSM Multiprocessors Dimitrios contributions: It pro- poses a new methodology for quantifying remote memory access contention on hardware DSM each DSM node to each page in memory. A trace of the memory accesses of the pro- gram obtained

Nikolopoulos, Dimitris

30

Fencing direct memory access data transfers in a parallel active messaging interface of a parallel computer  

DOE Patents (OSTI)

Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to segments of shared random access memory through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and a segment of shared memory; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

Blocksome, Michael A.; Mamidala, Amith R.

2013-09-03T23:59:59.000Z

31

Fencing direct memory access data transfers in a parallel active messaging interface of a parallel computer  

DOE Patents (OSTI)

Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to segments of shared random access memory through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and a segment of shared memory; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

Blocksome, Michael A; Mamidala, Amith R

2014-02-11T23:59:59.000Z

32

Al-Ckpt: Leveraging Memory Access Patterns for Adaptive Asynchronous  

NLE Websites -- All DOE Office Websites (Extended Search)

Al-Ckpt: Leveraging Memory Access Patterns for Adaptive Asynchronous Al-Ckpt: Leveraging Memory Access Patterns for Adaptive Asynchronous Incremental Checkpointing Title Al-Ckpt: Leveraging Memory Access Patterns for Adaptive Asynchronous Incremental Checkpointing Publication Type Conference Proceedings Year of Publication 2013 Authors Nicolae, B, Cappello, F Conference Name HPDC'13 Conference Location New York City Abstract With increasing scale and complexity of supercomputing and cloud computing architectures, faults are becoming a frequent occurrence, which makes reliability a difficult challenge. Although for some applications it is enough to restart failed tasks, there is a large class of applications where tasks run for a long time or are tightly coupled, thus making a restart from scratch unfeasible. Checkpoint-Restart (CR), the main method to survive failures for such applications faces additional challenges in this context: not only does it need to minimize the performance overhead on the application due to checkpointing, but it also needs to operate with scarce resources. Given the iterative nature of the targeted applications, we launch the assumption that first-time writes to memory during asynchronous checkpointing generate the same kind of interference as they did in past iterations. Based on this assumption, we propose novel asynchronous checkpointing approach that leverages both current and past access pattern trends in order to optimize the order in which memory pages are flushed to stable storage. Large scale experiments show up to 60% improvement when compared to state-of-art checkpointing approaches, all this achievable with an extra memory requirement of less than 5% of the total application memory.

33

U-243: libvirt virTypedParameterArrayClear() Memory Access Error...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: libvirt virTypedParameterArrayClear() Memory Access Error Lets Remote Users Deny Service U-243: libvirt virTypedParameterArrayClear() Memory Access Error Lets Remote Users Deny...

34

Memory Accesses Management During High Level Gwenole Corre, Eric Senn, Pierre Bomel, Nathalie Julien, Eric Martin  

E-Print Network (OSTI)

Memory Accesses Management During High Level Synthesis Gwenol´e Corre, Eric Senn, Pierre Bomel architecture and the memory mapping in behavioral synthesis. We formalize the memory mapping as a set of constraints for the synthesis, and defined a Memory Con- straint Graph and an accessibility criterion

Paris-Sud XI, Université de

35

Random Access Compressed Sensing over Fading and Noisy Communication Channels  

E-Print Network (OSTI)

of the climate change. Such applications require the least control and intervention as well as minimum energy1 Random Access Compressed Sensing over Fading and Noisy Communication Channels Fatemeh Fazel on integrating random sensing with the communication architecture, and achieves overall efficiency in terms

Stojanovic, Milica

36

Administering an epoch initiated for remote memory access  

DOE Patents (OSTI)

Methods, systems, and products are disclosed for administering an epoch initiated for remote memory access that include: initiating, by an origin application messaging module on an origin compute node, one or more data transfers to a target compute node for the epoch; initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch, including rejecting any new data transfers after initiating the closing stage for the epoch; determining, by the origin application messaging module, whether the data transfers have completed; and closing, by the origin application messaging module, the epoch if the data transfers have completed.

Blocksome, Michael A; Miller, Douglas R

2014-03-18T23:59:59.000Z

37

U-243: libvirt virTypedParameterArrayClear() Memory Access Error Lets  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: libvirt virTypedParameterArrayClear() Memory Access Error 3: libvirt virTypedParameterArrayClear() Memory Access Error Lets Remote Users Deny Service U-243: libvirt virTypedParameterArrayClear() Memory Access Error Lets Remote Users Deny Service August 24, 2012 - 7:00am Addthis PROBLEM: libvirt virTypedParameterArrayClear() Memory Access Error Lets Remote Users Deny Service PLATFORM: Version(s): 0.9.13 and prior ABSTRACT: A vulnerability was reported in libvirt. reference LINKS: libvirt SecurityTracker Alert ID: 1027437 Secunia Advisory SA50118 Bugtraq ID: 54748 CVE-2012-3445 IMPACT ASSESSMENT: Medium Discussion A remote user can send a specially crafted RPC call with the number of parameters set to zero to libvirtd to trigger a memory access error in virTypedParameterArrayClear() and cause the target service to crash. Impact:

38

Memory Access Scheduling Scott Rixner1, William J. Dally, Ujval J. Kapasi, Peter Mattson, and John D. Owens  

E-Print Network (OSTI)

1 Memory Access Scheduling Scott Rixner1, William J. Dally, Ujval J. Kapasi, Peter Mattson, pmattson, jowens}@cva.stanford.edu Abstract The bandwidth and latency of a memory system are strongly. This paper introduces memory access scheduling, a technique that improves the performance of a memory system

39

Mapping virtual addresses to different physical addresses for value disambiguation for thread memory access requests  

DOE Patents (OSTI)

A multiprocessor system includes nodes. Each node includes a data path that includes a core, a TLB, and a first level cache implementing disambiguation. The system also includes at least one second level cache and a main memory. For thread memory access requests, the core uses an address associated with an instruction format of the core. The first level cache uses an address format related to the size of the main memory plus an offset corresponding to hardware thread meta data. The second level cache uses a physical main memory address plus software thread meta data to store the memory access request. The second level cache accesses the main memory using the physical address with neither the offset nor the thread meta data after resolving speculation. In short, this system includes mapping of a virtual address to a different physical addresses for value disambiguation for different threads.

Gala, Alan; Ohmacht, Martin

2014-09-02T23:59:59.000Z

40

Clique-Based Randomized Multiple Access for Energy-Efficient Wireless Ad Hoc Networks  

E-Print Network (OSTI)

Clique-Based Randomized Multiple Access for Energy-Efficient Wireless Ad Hoc Networks Paul G protocol design for wireless ad hoc networks is between proactive and reactive coor- dination, where describe Clique-Based Randomized Multiple Access (CRMA), a distributed MAC protocol for wireless ad hoc

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

Energy-Performance Trade-offs for Spatial Access Methods on Memory-Resident Data  

E-Print Network (OSTI)

Energy-Performance Trade-offs for Spatial Access Methods on Memory-Resident Data Ning An Sudhanva-force approach that does not use an index. The results show that there are both performance and energy trade also play an important role in determining the energy-performance trade-offs. Further, technological

Gurumurthi, Sudhanva

42

Global Memory Access Modelling for Efficient Implementation of the Lattice Boltzmann  

E-Print Network (OSTI)

Global Memory Access Modelling for Efficient Implementation of the Lattice Boltzmann Method, lattice Boltzmann method, CFD Introduction State-of-the-art graphics processing units (GPU) have proven performance. 2 Lattice Boltzmann Method The Lattice Boltzmann Method is a rather innovative approach

Boyer, Edmond

43

Memory access protocol for the HOLMS low latency opto-electronic memory system  

Science Journals Connector (OSTI)

High fanin and fanout is among the chief advantages of optics allowing low latency, direct interconnects. Unfortunately high fanin system often have problems with access conflicts. We...

Carrera, Roberto Barbieri; Benabés, Philippe; Lukowicz, Paul; Wirz, Marco; Tröster, Gerhard; Gauthier, A; Oksman, J

44

A Stackelberg Game for Cooperative Transmission and Random Access in Cognitive Radio Networks  

E-Print Network (OSTI)

their strategies of random access when the licensed spectrum of the PU is available. In this paper, we first) scheme. I. INTRODUCTION Spectrum resources are scarce and the demand for the radio spectrum has been], fixed spectrum allocation may not always be efficient and the licensed spectrum may remain unoccupied

Wong, Vincent

45

Development and comparison of algorithms for generating a scan sequence for a random access scanner. [ZAP (and flow charts for ZIP and SCAN), in FORTRAN for DEC-10  

SciTech Connect

Many data acquisition systems incorporate high-speed scanners to convert analog signals into digital format for further processing. Some systems multiplex many channels into a single scanner. A random access scanner whose scan sequence is specified by a table in random access memory will permit different scan rates on different channels. Generation of this scan table can be a tedious manual task when there are many channels (e.g. 50), when there are more than a few scan rates (e.g. 5), and/or when the ratio of the highest scan rate to the lowest scan rate becomes large (e.g. 100:1). An algorithm is developed which will generate these scan sequences for the random access scanner and implements the algorithm on a digital computer. Application of number theory to the mathematical statement of the problem led to development of several algorithms which were implemented in FORTRAN. The most efficient of these algorithms operates by partitioning the problem into a set of subproblems. Through recursion they solve each subproblem by partitioning it repeatedly into even smaller parts, continuing until a set of simple problems is created. From this process, a pictorial representation or wheel diagram of the problem can be constructed. From the wheel diagram and a description of the original problem, a scan table can be constructed. In addition, the wheel diagram can be used as a method of storing the scan sequence in a smaller amount of memory. The most efficient partitioning algorithm solved most scan table problems in less than a second of CPU time. Some types of problems, however, required as much as a few minutes of CPU time. 26 figures, 2 tables.

Eason, R. O.

1980-09-01T23:59:59.000Z

46

E-Print Network 3.0 - access memory cell Sample Search Results  

NLE Websites -- All DOE Office Websites (Extended Search)

and 2) that the difference between naive and memory... of naive and memory T ... Source: Utrecht, Universiteit - Departement Biologie, Theoretical BiologyBioinformatics Group...

47

Secure Memories Resistant to Both Random Errors and Fault Injection Attacks Using Nonlinear Error Correction Codes  

E-Print Network (OSTI)

University, Boston , USA shizunge@bu.edu, wang.zhen.mtk@gmail.com, luopei@bu.edu, markkar@bu.edu Abstract and internal memories in em- bedded systems. Non-volatile memories like EEPROM and Flashes are often used author now works for Mediatek Wireless, Inc. The work of the fourth author is sponsored by the NSF grant

48

818 MRS BULLETIN/NOVEMBER 2004 Magnetoresistive random-access memory  

E-Print Network (OSTI)

by sensing the resistance of the bit, MRAM is fundamentally different from commonly available commercial mem through it. The relative orientation of the magnetization in these two layers deter- mines the resistance- spond to high- and low-resistance states. Low resistance occurs when the two layers have the same

Gleixner, Stacy

49

Multi-scale quantum point contact model for filamentary conduction in resistive random access memories devices  

SciTech Connect

We depart from first-principle simulations of electron transport along paths of oxygen vacancies in HfO{sub 2} to reformulate the Quantum Point Contact (QPC) model in terms of a bundle of such vacancy paths. By doing this, the number of model parameters is reduced and a much clearer link between the microscopic structure of the conductive filament (CF) and its electrical properties can be provided. The new multi-scale QPC model is applied to two different HfO{sub 2}-based devices operated in the unipolar and bipolar resistive switching (RS) modes. Extraction of the QPC model parameters from a statistically significant number of CFs allows revealing significant structural differences in the CF of these two types of devices and RS modes.

Lian, Xiaojuan, E-mail: xjlian2005@gmail.com; Cartoixà, Xavier; Miranda, Enrique; Suñé, Jordi [Departament d'Enginyeria Electrònica, Universitat Autònoma de Barcelona, 08193 Bellaterra (Spain); Perniola, Luca [CEA-LETI, MINATEC, Grenoble (France); Rurali, Riccardo [Institut de Ciència de Materials de Barcelona (ICMAB-CSIC), Campus de Bellaterra, 08193 Bellaterra (Spain); Long, Shibing; Liu, Ming [Laboratory of Nanofabrication and Novel Device Integration, Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029 (China)

2014-06-28T23:59:59.000Z

50

Memory abstractions for parallel programming  

E-Print Network (OSTI)

A memory abstraction is an abstraction layer between the program execution and the memory that provides a different "view" of a memory location depending on the execution context in which the memory access is made. Properly ...

Lee, I-Ting Angelina

2012-01-01T23:59:59.000Z

51

Enabling access-privacy for random walk based data analysis applications q  

E-Print Network (OSTI)

of the future states depend only on the present. A Markov chain is a discrete-time stochastic process which. In this paper, we focus on access-privacy enabled outsourced Markov chain based data analysis applications This submission is an extended version of Ping Lin, K. Selc¸uk Candan: Access-private outsourcing of Markov chain

Candan, Selçuk

52

A model of the spread of randomly scanning Internet worms that saturate access links  

Science Journals Connector (OSTI)

We present a simple, deterministic mathematical model for the spread of randomly scanning and bandwidth-saturating Internet worms. Such worms include Slammer and Witty, both of which spread extremely rapidly. Our model, consisting of coupled Kermack-McKendrick ... Keywords: Internet worms, communications/computer networking, epidemiology, modeling

George Kesidis; Ihab Hamadeh; Youngmi Jin; Soranun Jiwasurat; Milan Vojnovi?

2008-04-01T23:59:59.000Z

53

Process estimation in presence of time-invariant memory effects  

E-Print Network (OSTI)

Any repeated use of a fixed experimental instrument is subject to memory effects. We design an estimation method uncovering the details of the underlying interaction between the system and the internal memory without having any experimental access to memory degrees of freedom. In such case, by definition, any memoryless quantum process tomography (QPT) fails, because the observed data sequences do not satisfy the elementary condition of statistical independence. However, we show that the randomness implemented in certain QPT schemes is sufficient to guarantee the emergence of observable "statistical" patterns containing complete information on the memory channels. We demonstrate the algorithm in details for case of qubit memory channels with two-dimensional memory. Interestingly, we found that for arbitrary estimation method the memory channels generated by controlled unitary interactions are indistinguishable from memoryless unitary channels.

Tomas Rybar; Mario Ziman

2014-09-15T23:59:59.000Z

54

telecommunications access  

Science Journals Connector (OSTI)

In a system, such as a computer or data processing system, access for data transmission between (a) main storage or internal memory and (b) channel-attached terminals or link-attached terminals via telecommunications

2001-01-01T23:59:59.000Z

55

Recoverable distributed shared memory  

E-Print Network (OSTI)

Distributed Shared Memory (DSM) is a model for interprocess communication, implemented on top of message passing systems. In this model, processes running on separate hosts can access a shared, coherent memory address space, provided...

Kanthadai, Sundarrajan S

2012-06-07T23:59:59.000Z

56

Memory-mapped transactions  

E-Print Network (OSTI)

Memory-mapped transactions combine the advantages of both memory mapping and transactions to provide a programming interface for concurrently accessing data on disk without explicit I/O or locking operations. This interface ...

Sukha, Jim

2005-01-01T23:59:59.000Z

57

Algorithms and Data Representations for Emerging Non-Volatile Memories  

E-Print Network (OSTI)

-volatile memory (NVM). NVMs provide excellent performance such as random access, high I/O speed, low power consumption, and so on. The storage density of NVMs keeps increasing following Moore’s law. However, higher storage density also brings significant data...

Li, Yue

2014-04-29T23:59:59.000Z

58

Software Coherence in Multiprocessor Memory Systems.  

E-Print Network (OSTI)

??Processors are becoming faster and multiprocessor memory interconnection systems are not keeping up. Therefore, it is necessary to have threads and the memory they access… (more)

Bolosky, William J.

2009-01-01T23:59:59.000Z

59

Building Data Centers With Optically Connected Memory  

Science Journals Connector (OSTI)

Future data centers will require novel, scalable memory architectures capable of sustaining high bandwidths while still achieving low memory access latencies. Electronic...

Brunina, Daniel; Lai, Caroline P; Garg, Ajay S; Bergman, Keren

2011-01-01T23:59:59.000Z

60

System for loading executable code into volatile memory in a downhole tool  

DOE Patents (OSTI)

A system for loading an executable code into volatile memory in a downhole tool string component comprises a surface control unit comprising executable code. An integrated downhole network comprises data transmission elements in communication with the surface control unit and the volatile memory. The executable code, stored in the surface control unit, is not permanently stored in the downhole tool string component. In a preferred embodiment of the present invention, the downhole tool string component comprises boot memory. In another embodiment, the executable code is an operating system executable code. Preferably, the volatile memory comprises random access memory (RAM). A method for loading executable code to volatile memory in a downhole tool string component comprises sending the code from the surface control unit to a processor in the downhole tool string component over the network. A central processing unit writes the executable code in the volatile memory.

Hall, David R. (Provo, UT); Bartholomew, David B. (Springville, UT); Johnson, Monte L. (Orem, UT)

2007-09-25T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Memory-induced anomalous dynamics: emergence of diffusion, subdiffusion, and superdiffusion from a single random walk model  

E-Print Network (OSTI)

We present a random walk model that exhibits asymptotic subdiffusive, diffusive, and superdiffusive behavior in different parameter regimes. This appears to be the first instance of a single random walk model leading to all three forms of behavior by simply changing parameter values. Furthermore, the model offers the great advantage of analytic tractability. Our model is non-Markovian in that the next jump of the walker is (probabilistically) determined by the history of past jumps. It also has elements of intermittency in that one possibility at each step is that the walker does not move at all. This rich encompassing scenario arising from a single model provides useful insights into the source of different types of asymptotic behavior.

Niraj Kumar; Upendra Harbola; Katja Lindenberg

2010-05-16T23:59:59.000Z

62

Ferroelectric tunneling element and memory applications which utilize the tunneling element  

DOE Patents (OSTI)

A tunneling element includes a thin film layer of ferroelectric material and a pair of dissimilar electrically-conductive layers disposed on opposite sides of the ferroelectric layer. Because of the dissimilarity in composition or construction between the electrically-conductive layers, the electron transport behavior of the electrically-conductive layers is polarization dependent when the tunneling element is below the Curie temperature of the layer of ferroelectric material. The element can be used as a basis of compact 1R type non-volatile random access memory (RAM). The advantages include extremely simple architecture, ultimate scalability and fast access times generic for all ferroelectric memories.

Kalinin, Sergei V. (Knoxville, TN) [Knoxville, TN; Christen, Hans M. (Knoxville, TN) [Knoxville, TN; Baddorf, Arthur P. (Knoxville, TN) [Knoxville, TN; Meunier, Vincent (Knoxville, TN) [Knoxville, TN; Lee, Ho Nyung (Oak Ridge, TN) [Oak Ridge, TN

2010-07-20T23:59:59.000Z

63

Mechanical memory  

DOE Patents (OSTI)

A first-in-first-out (FIFO) microelectromechanical memory apparatus (also termed a mechanical memory) is disclosed. The mechanical memory utilizes a plurality of memory cells, with each memory cell having a beam which can be bowed in either of two directions of curvature to indicate two different logic states for that memory cell. The memory cells can be arranged around a wheel which operates as a clocking actuator to serially shift data from one memory cell to the next. The mechanical memory can be formed using conventional surface micromachining, and can be formed as either a nonvolatile memory or as a volatile memory.

Gilkey, Jeffrey C. (Albuquerque, NM); Duesterhaus, Michelle A. (Albuquerque, NM); Peter, Frank J. (Albuquerque, NM); Renn, Rosemarie A. (Albuquerque, NM); Baker, Michael S. (Albuquerque, NM)

2006-05-16T23:59:59.000Z

64

Mechanical memory  

DOE Patents (OSTI)

A first-in-first-out (FIFO) microelectromechanical memory apparatus (also termed a mechanical memory) is disclosed. The mechanical memory utilizes a plurality of memory cells, with each memory cell having a beam which can be bowed in either of two directions of curvature to indicate two different logic states for that memory cell. The memory cells can be arranged around a wheel which operates as a clocking actuator to serially shift data from one memory cell to the next. The mechanical memory can be formed using conventional surface micromachining, and can be formed as either a nonvolatile memory or as a volatile memory.

Gilkey, Jeffrey C. (Albuquerque, NM); Duesterhaus, Michelle A. (Albuquerque, NM); Peter, Frank J. (Albuquerque, NM); Renn, Rosemarie A. (Alburquerque, NM); Baker, Michael S. (Albuquerque, NM)

2006-08-15T23:59:59.000Z

65

The Memory Hierarchy l Storage technologies and trends  

E-Print Network (OSTI)

1 1 The Memory Hierarchy l Topics l Storage technologies and trends l Locality of reference l Caching in the memory hierarchy CS211 Computer Architecture 2 Memory until now... l We've relied on a very simple model of memory for most this class l Main Memory is a linear array of bytes that can be accessed

Badrinath, B. R.

66

Quantifying Contention and Balancing Memory Load on Hardware DSM Multiprocessors1  

E-Print Network (OSTI)

Quantifying Contention and Balancing Memory Load on Hardware DSM Multiprocessors1 Dimitrios S a new methodology for quantifying remote memory access contention on hardware DSM multiprocessors node of the DSM to each page in memory. A trace of the memory accesses of the program obtained

Nikolopoulos, Dimitris

67

E-Print Network 3.0 - access control scheme Sample Search Results  

NLE Websites -- All DOE Office Websites (Extended Search)

Access Scheduling Schemes Zhibin Fang Xian-He Sun Yong Chen Surendra Byna... access scheduling is performed by a shared memory controller that is integrated onto the same...

68

Data Access  

Science Journals Connector (OSTI)

Data access is access to collected and compiled data for the purposes of analysis and reporting. Data access can be allowed to different persons, ... depending on their nature: access to fundamental data for sta...

2008-01-01T23:59:59.000Z

69

Flexible and Transparent Memory  

E-Print Network (OSTI)

K. L. Wang. , “Robust Bi-Stable Memory Operation in Single-Graphene Ferroelectric Memory,” Appl. Phy. Lett. , 99 (4),Flexible and Transparent Memory” IEEE International Memory

KIM, SUNG MIN

2012-01-01T23:59:59.000Z

70

Memory-bit selection and recording by rotating fields in vortex-core cross-point architecture  

SciTech Connect

In one of our earlier studies [Appl. Phys. Lett. 92, 022509 (2008)], we proposed a concept of robust information storage, recording and readout, which can be implementaed in nonvolatile magnetic random-access memories and is based on the energetically degenerated twofold ground states of vortex-core magnetizations. In the present study, we experimentally demonstrate reliable memory-bit selection and information recording in vortex-core cross-point architecture, specifically using a two-by-two vortex-state disk array. In order to efficiently switch a vortex core positioned at the intersection of crossed electrodes, two orthogonal addressing electrodes are selected, and then two Gaussian pulse currents of optimal pulse width and time delay are applied. Such tailored pulse-type rotating magnetic fields which occurs only at the selected intersection is prerequisite for a reliable memory-bit selection and low-power-consumption recording of information in the existing cross-point architecture.

Yu, Y. -S.; Jung, H.; Lee, K. -S.; Fischer, P.; Kim, S. -K.

2010-10-21T23:59:59.000Z

71

Direct memory access transfer completion notification  

DOE Patents (OSTI)

Methods, systems, and products are disclosed for DMA transfer completion notification that include: inserting, by an origin DMA on an origin node in an origin injection FIFO, a data descriptor for an application message; inserting, by the origin DMA, a reflection descriptor in the origin injection FIFO, the reflection descriptor specifying a remote get operation for injecting a completion notification descriptor in a reflection injection FIFO on a reflection node; transferring, by the origin DMA to a target node, the message in dependence upon the data descriptor; in response to completing the message transfer, transferring, by the origin DMA to the reflection node, the completion notification descriptor in dependence upon the reflection descriptor; receiving, by the origin DMA from the reflection node, a completion packet; and notifying, by the origin DMA in response to receiving the completion packet, the origin node's processing core that the message transfer is complete.

Archer, Charles J. (Rochester, MN), Blocksome; Michael A. (Rochester, MN), Parker; Jeffrey J. (Rochester, MN)

2011-02-15T23:59:59.000Z

72

Direct memory access transfer completion notification  

DOE Patents (OSTI)

Methods, apparatus, and products are disclosed for DMA transfer completion notification that include: inserting, by an origin DMA engine on an origin compute node in an injection FIFO buffer, a data descriptor for an application message to be transferred to a target compute node on behalf of an application on the origin compute node; inserting, by the origin DMA engine, a completion notification descriptor in the injection FIFO buffer after the data descriptor for the message, the completion notification descriptor specifying an address of a completion notification field in application storage for the application; transferring, by the origin DMA engine to the target compute node, the message in dependence upon the data descriptor; and notifying, by the origin DMA engine, the application that the transfer of the message is complete, including performing a local direct put operation to store predesignated notification data at the address of the completion notification field.

Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Parker, Jeffrey J. (Rochester, MN)

2010-08-17T23:59:59.000Z

73

Memory Usage Considerations on Franklin  

NLE Websites -- All DOE Office Websites (Extended Search)

Memory Considerations Memory Considerations Memory Usage Considerations on Franklin Each Franklin compute node has 8 GB (8192 MB) of physical memory, but, not all that memory is...

74

Learning, Memory, & Attention Instructor  

E-Print Network (OSTI)

1 COGS 101B: Learning, Memory, & Attention · Welcome! · Instructor ­ Dr. Coulson ­ Email: coulson Attention ­ Divided Attention ­ Automaticity ­ Attentional Capture · Immediate Memory ­ Sensory Memory ­ Short-Term Memory ­ Working Memory · Long-Term Memory ­ Levels of Processing ­ Memory Systems

Coulson, Seana

75

Open Access  

NLE Websites -- All DOE Office Websites (Extended Search)

Communication » Communication » Open Access Open Access Open access (OA) is the practice of providing unrestricted access via the Internet to peer-reviewed scholarly journal articles. Learn more below... Questions? Open Access Email Open access publishing and publications have experienced substantial growth, expansion and uptake in recent years. What exactly is an open access publication? There are many definitions, but in a nutshell an open access publication is a publication that provides immediately free online access to all users worldwide. This may sound like a tall order, and yet there are to date over 4000 journal publications that fit this definition. The need for this type of access has been driven by the out-of-control costs for scholarly publications. Statistics kept by the Association for Research Libraries

76

Random walks in glasslike environments  

Science Journals Connector (OSTI)

We have considered in the framework of a renormalization-group approach the asymptotic behavior of a diffusive particle in an environment with quenched disorder and an additional dynamical feedback. The disorder is described by a spatially random drift force field; the feedback is controlled by a memory of strength ?. Both disorder and memory have proved to be relevant in d0) can be related to a superdiffusion (divergence-free drift forces), subdiffusion (random drift forces) or a localization of the particle (curl-free drift forces). The last regime shows an important agreement with the results of the well-known mode-coupling approach.

M. Schulz and S. Stepanow

1999-06-01T23:59:59.000Z

77

Current Concepts: Memory Dysfunction  

Science Journals Connector (OSTI)

...dysfunction of the episodic memory system (Figure 1). Memory loss attributable to dysfunction of the episodic memory system follows a predictable pattern known as Ribot's law, which states that events just before an ictus are most vulnerable to dissolution, whereas remote memories are most resistant. Thus... This practical review for clinicians explains that memory dysfunction is now understood in terms of four systems: episodic memory, semantic memory, procedural memory, and working memory. Separate anatomical areas of the brain are responsible for each memory system. This overview of memory should help nonspecialists in the evaluation and diagnosis of patients with various types of memory dysfunction.

Budson A.E.; Price B.H.

2005-02-17T23:59:59.000Z

78

V-194: Citrix XenServer Memory Management Error Lets Local Administrat...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: Citrix XenServer Memory Management Error Lets Local Administrative Users on the Guest Gain Access on the Host V-194: Citrix XenServer Memory Management Error Lets Local...

79

Reactivating personal memory 1 RUNNING HEAD: Reactivating personal memory  

E-Print Network (OSTI)

Reactivating personal memory 1 RUNNING HEAD: Reactivating personal memory Modifying memory: Selectively enhancing and updating personal memories for a museum; Reactivating personal memory 2 Abstract Memory can be modified when reactivated

Schacter, Daniel

80

Spatial memory, recognition memory, and the hippocampus  

E-Print Network (OSTI)

Spatial memory, recognition memory, and the hippocampus Nicola J. Broadbent*, Larry R. Squire. Squire, August 27, 2004 There is wide agreement that spatial memory is dependent on the integrity recognition memory is not as clear. We examined the relationship between hippocampal lesion size and both

Squire, Larry R.

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

Memory Technologies Vivek Asthana  

E-Print Network (OSTI)

Memory Technologies Vivek Asthana 13th Mar 2013 #12;13-Mar-13 2 Memory Usage (2025) #12;13-Mar-13 3 Outline What is a Memory Current Memory technologies · SRAM · DRAM · Flash Upcoming Memory technologies · MRAM · PCRAM · FeRAM · ... #12;13-Mar-13 4 What is a Memory Memory cell: Binary data storage element

Kumar, M. Jagadesh

82

Data Accessibility  

Science Journals Connector (OSTI)

Data accessibility is a criterion of data quality ..., and is met when authorized health professionals are provided with the means to find, obtain, or make use of ...

2008-01-01T23:59:59.000Z

83

Memory Systems Doug Burger  

E-Print Network (OSTI)

Memory Systems Doug Burger University of Wisconsin-Madison A computer's memory system and produces. A perfect memory system is one that can supply immediately any datum that the CPU requests. This ideal memory is not practically implementable, however, as the three factors of memory capacity, speed

Burger, Doug

84

ACCESS CONTROL  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

TERMS/DEFINITIONS FROM DOE M 470.4-7 TERMS/DEFINITIONS FROM DOE M 470.4-7 ACCESS CONTROL. The process of permitting access or denying access to information, facilities, nuclear materials, resources, or designated security areas. ACCESS CONTROL MEASURES. Hardware and software features, physical controls, operating procedures, administrative procedures, and various combinations of these designed to detect or prevent unauthorized access to classified information; special nuclear materials; Government property; automated information systems, facilities, or materials; or areas containing the above and to enforce use of these measures to protect Departmental security and property interests. CRITICAL PATH SCENARIO. An adversary-based scenario that is generated during the conduct of a vulnerability assessment and accounts for adversary tactics that

85

Randomized selection on the GPU  

SciTech Connect

We implement here a fast and memory-sparing probabilistic top N selection algorithm on the GPU. To our knowledge, this is the first direct selection in the literature for the GPU. The algorithm proceeds via a probabilistic-guess-and-chcck process searching for the Nth element. It always gives a correct result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces the average time required for the algorithm. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be well suited to more general parallel processors with limited amounts of fast memory.

Monroe, Laura Marie [Los Alamos National Laboratory; Wendelberger, Joanne R [Los Alamos National Laboratory; Michalak, Sarah E [Los Alamos National Laboratory

2011-01-13T23:59:59.000Z

86

Genepool Memory Heatmaps  

NLE Websites -- All DOE Office Websites (Extended Search)

Genepool Memory Heatmaps Heatmap of Memory and Slots Requested vs Time Waited (in hours) | Queue: All | Last 7 Days Memory Requested Slots <5GB 5-10GB 10-20GB 20-30GB 30-40GB...

87

Shared memory optimizations for distributed memory programming models  

Science Journals Connector (OSTI)

In the world of parallel programming, there are two major classes of programming models: shared memory and distributed memory. Shared memory models share all memory by default, and are most effective on multi-processor systems. Distributed memory models ...

Andrew Friedley / Andrew Lumsdaine

2013-01-01T23:59:59.000Z

88

Memory Usage Considerations on Hopper  

NLE Websites -- All DOE Office Websites (Extended Search)

Memory Considerations Memory Considerations Memory Usage Considerations on Edison Edison compute nodes have 64 GB of physical memory (2.67GB per core), but, not all that memory is...

89

Nanopatterned ferroelectrics for ultrahigh density rad-hard nonvolatile memories.  

SciTech Connect

Radiation hard nonvolatile random access memory (NVRAM) is a crucial component for DOE and DOD surveillance and defense applications. NVRAMs based upon ferroelectric materials (also known as FERAMs) are proven to work in radiation-rich environments and inherently require less power than many other NVRAM technologies. However, fabrication and integration challenges have led to state-of-the-art FERAMs still being fabricated using a 130nm process while competing phase-change memory (PRAM) has been demonstrated with a 20nm process. Use of block copolymer lithography is a promising approach to patterning at the sub-32nm scale, but is currently limited to self-assembly directly on Si or SiO{sub 2} layers. Successful integration of ferroelectrics with discrete and addressable features of {approx}15-20nm would represent a 100-fold improvement in areal memory density and would enable more highly integrated electronic devices required for systems advances. Towards this end, we have developed a technique that allows us to carry out block copolymer self-assembly directly on a huge variety of different materials and have investigated the fabrication, integration, and characterization of electroceramic materials - primarily focused on solution-derived ferroelectrics - with discrete features of {approx}20nm and below. Significant challenges remain before such techniques will be capable of fabricating fully integrated NVRAM devices, but the tools developed for this effort are already finding broader use. This report introduces the nanopatterned NVRAM device concept as a mechanism for motivating the subsequent studies, but the bulk of the document will focus on the platform and technology development.

Brennecka, Geoffrey L.; Stevens, Jeffrey; Scrymgeour, David; Gin, Aaron V.; Tuttle, Bruce Andrew

2010-09-01T23:59:59.000Z

90

Memory Considerations for Carver  

NLE Websites -- All DOE Office Websites (Extended Search)

Memory Considerations Memory Considerations Memory Considerations Overview Carver login nodes each have 48GB of physical memory. Most compute nodes have 24GB; however, 80 compute nodes have 48GB. Not all of this memory is available to user processes. Some memory is reserved for the Linux kernel. Furthermore, since Carver nodes have no disk, the "root" file system (including /tmp) is kept in memory ("ramdisk"). The kernel and root file system combined occupy about 4GB of memory. Therefore users should try to use no more than 20GB on most compute nodes, or 44GB on the large-memory compute nodes. There are also two "extra-large" memory nodes; each node has four 8-core Intel X7550 ("Nehalem EX") 2.0 GHz processors (32 cores total) and 1TB memory. These nodes are available through the queue "reg_xlmem". Please

91

V-194: Citrix XenServer Memory Management Error Lets Local Administrative  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: Citrix XenServer Memory Management Error Lets Local 4: Citrix XenServer Memory Management Error Lets Local Administrative Users on the Guest Gain Access on the Host V-194: Citrix XenServer Memory Management Error Lets Local Administrative Users on the Guest Gain Access on the Host July 8, 2013 - 12:24am Addthis PROBLEM: Citrix XenServer Memory Management Error Lets Local Administrative Users on the Guest Gain Access on the Host PLATFORM: Citrix XenServer 5.0 - 6.2 ABSTRACT: A vulnerability was reported in Citrix XenServer. REFERENCE LINKS: CTX138134 SecurityTracker Alert ID: 1028740 CVE-2013-1432 IMPACT ASSESSMENT: Medium DISCUSSION: A local administrative user on a PV guest can exploit a memory management page reference counting error to gain access on the target host server. IMPACT: A local user on the guest operating system can obtain access on the target

92

V-194: Citrix XenServer Memory Management Error Lets Local Administrative  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: Citrix XenServer Memory Management Error Lets Local 4: Citrix XenServer Memory Management Error Lets Local Administrative Users on the Guest Gain Access on the Host V-194: Citrix XenServer Memory Management Error Lets Local Administrative Users on the Guest Gain Access on the Host July 8, 2013 - 12:24am Addthis PROBLEM: Citrix XenServer Memory Management Error Lets Local Administrative Users on the Guest Gain Access on the Host PLATFORM: Citrix XenServer 5.0 - 6.2 ABSTRACT: A vulnerability was reported in Citrix XenServer. REFERENCE LINKS: CTX138134 SecurityTracker Alert ID: 1028740 CVE-2013-1432 IMPACT ASSESSMENT: Medium DISCUSSION: A local administrative user on a PV guest can exploit a memory management page reference counting error to gain access on the target host server. IMPACT: A local user on the guest operating system can obtain access on the target

93

Optical memory  

DOE Patents (OSTI)

Optical memory comprising: a semiconductor wire, a first electrode, a second electrode, a light source, a means for producing a first voltage at the first electrode, a means for producing a second voltage at the second electrode, and a means for determining the presence of an electrical voltage across the first electrode and the second electrode exceeding a predefined voltage. The first voltage, preferably less than 0 volts, different from said second voltage. The semiconductor wire is optically transparent and has a bandgap less than the energy produced by the light source. The light source is optically connected to the semiconductor wire. The first electrode and the second electrode are electrically insulated from each other and said semiconductor wire.

Mao, Samuel S; Zhang, Yanfeng

2013-07-02T23:59:59.000Z

94

Memory Hard Drive Peripherals  

E-Print Network (OSTI)

1! CSI3131 Topics CPU Memory Hard Drive Peripherals Computing Systems OS Overview StructureDeadlocks M em ory M anagem ent Basic Memory Managermtn Virtual Memory Storage and I/O File Systems Hard Drive Management Swap I/O Management 2 Module 7: Memory Management Reading: Chapter 8 § To provide a detailed

Stojmenovic, Ivan

95

Robust exponential memory in Hopfield networks  

E-Print Network (OSTI)

The Hopfield recurrent neural network is an auto-associative distributed model of memory. This architecture is able to store collections of generic binary patterns as robust attractors; i.e., fixed-points of the network dynamics having large basins of attraction. However, the number of (randomly generated) storable memories scales at most linearly in the number of neurons, and it has been a long-standing question whether robust super-polynomial storage is possible in recurrent networks of linear threshold elements. Here, we design sparsely-connected Hopfield networks on $n$-nodes having \\[\\frac{2^{\\sqrt{2n} + \\frac{1}{4}}}{n^{1/4} \\sqrt{\\pi}}\\] graph cliques as robust memories by analytically minimizing the probability flow objective function over these patterns. Our methods also provide a biologically plausible convex learning algorithm that efficiently discovers these networks from training on very few sample memories.

Christopher Hillar; Ngoc M. Tran

2014-11-17T23:59:59.000Z

96

Information Access and Privacy Protection Office  

E-Print Network (OSTI)

Information Access and Privacy Protection Office I A P P Guidelines for Using Personal Information in Email and Faxes Memorial University employees are required to protect personal information (defined personal information ­ your own or someone else's. Email and faxes, in particular, pose challenges

deYoung, Brad

97

On Memory, Trauma, Public Space, Monuments, and Memorials  

E-Print Network (OSTI)

responsive sites of memory. 18. From conversations withand the Politics of Memory (Stanford: Stanford Universitysuggests that national memory debates are always shot

Bonder, Julian

2009-01-01T23:59:59.000Z

98

Rethinking the memory hierarchy design with nonvolatile memory technologies.  

E-Print Network (OSTI)

??The memory hierarchy, including processor caches and the main memory, is an important component of various computer systems. The memory hierarchy is becoming a fundamental… (more)

Zhao, Jishen

2014-01-01T23:59:59.000Z

99

Familiar Space in Social Memory  

E-Print Network (OSTI)

would be touched upon by this memory task. Of course, otherfront. Then, I produced memory routes for each list obtainedof people remembered - memory rank + 1) / # of people

Bennardo, Giovanni

2008-01-01T23:59:59.000Z

100

PDSF Memory Considerations  

NLE Websites -- All DOE Office Websites (Extended Search)

Memory Considerations Memory Considerations Memory Considerations Interactive Nodes The amount of memory available on the interactive nodes is described on the Interactive (login) Nodes page. The interactive nodes are shared among all users and running high memory jobs on the interactive nodes slows them down for everyone. If you think your work might be disruptive you should either run it in batch or run it interactively on a batch node as described here. Batch Nodes The batch system knows how much memory each node has and how much memory each job requires. By default each job is given 1.1GB, but you can request more or less memory by following the instructions in Submitting Jobs. However, it should be noted that the more memory you require, the harder it will be for the batch system to schedule your job, especially when the

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Shared Memory Parallel Programming with Entry Consistency for Distributed Memory  

E-Print Network (OSTI)

Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory to ensure a correctly functioning program. Midway is a shared memory parallel programming system which addresses the problem of excessive communication in a distributed memory multiprocessor. Midway programs

102

Practical Memory Checking with Dr. Memory Derek Bruening  

E-Print Network (OSTI)

Practical Memory Checking with Dr. Memory Derek Bruening Google bruening@google.com Qin Zhao Massachusetts Institute of Technology qin zhao@csail.mit.edu Abstract--Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs

Tomkins, Andrew

103

Simulation of thermal reset transitions in resistive switching memories including quantum effects  

SciTech Connect

An in-depth study of reset processes in RRAMs (Resistive Random Access Memories) based on Ni/HfO{sub 2}/Si-n{sup +} structures has been performed. To do so, we have developed a physically based simulator where both ohmic and tunneling based conduction regimes are considered along with the thermal description of the devices. The devices under study have been successfully fabricated and measured. The experimental data are correctly reproduced with the simulator for devices with a single conductive filament as well as for devices including several conductive filaments. The contribution of each conduction regime has been explained as well as the operation regimes where these ohmic and tunneling conduction processes dominate.

Villena, M. A.; Jiménez-Molinos, F.; Roldán, J. B. [Departamento de Electrónica y Tecnología de Computadores, Universidad de Granada, Facultad de Ciencias, Avd. Fuentenueva s/n, 18071 Granada (Spain); González, M. B.; Campabadal, F. [Institut de Microelectrònica de Barcelona, IMB-CNM (CSIC), Campus UAB, 08193 Bellaterra (Spain); Suñé, J.; Miranda, E. [Departament d'Enginyeria Electrònica, Universitat Autònoma de Barcelona, Bellaterra Cerdanyola del Vallès 08193 (Spain); Romera, E. [Departamento de Física Atómica, Molecular y Nuclear and Instituto Carlos I de Física Teórica y Computacional, Universidad de Granada, Avd. Fuentenueva s/n, 18071 Granada (Spain)

2014-06-07T23:59:59.000Z

104

Drifting absence :: drafting memory  

E-Print Network (OSTI)

The emotive power of a memorial derives from its ability to engage the viewer in active remembrance. The project considers the limitations of a monumentality which embraces a distinct division between viewer and memorial. ...

Kuhn, Marlene Eva

2006-01-01T23:59:59.000Z

105

Truth in Emotional Memories  

Science Journals Connector (OSTI)

One of the ways that true and false memories could be different from one another is in their consequentiality. That is, because true memories represent events that actually happened to people, it is plausible tha...

Cara Laney; Elizabeth F. Loftus

2010-01-01T23:59:59.000Z

106

Random walks in random environments  

Science Journals Connector (OSTI)

A renormalization-group analysis is carried out of the long-time behavior of random walks in an environment with a positionally random local drift force. It is argued that, independent of the strength of the disorder, the mean-square displacement, ?x2(t)?, is linear in time (i.e., diffusive) for dimensions d?2. In two dimensions, universal tlnt corrections are found and for d=2-?, the behavior is subdiffusive with ?x2(t)??t1-?2.

Daniel S. Fisher

1984-08-01T23:59:59.000Z

107

Cognitive Neuroscience Learning and Memory  

E-Print Network (OSTI)

1 Slide 1 Cognitive Neuroscience PSYC 685 Learning and Memory Raja Parasuraman WorkingWorking MemoryMemory SelectiveSelective AttentionAttention Slide 2 Overview Short term, working, and long-term memory The medial temporal lobe/prefrontal cortex memory system Amnesia Implicit memory Slide 3

Parasuraman, Raja

108

Memory Loss Chapter 6  

E-Print Network (OSTI)

Part II Memory Loss 129 #12;#12;Chapter 6 Generalized Conditionalization Up to this point we have to help CLF model two types of certainty-loss stories: stories in- volving memory loss and stories-sensitivity, (PEP) does almost no work in modeling stories involving memory loss. So we will proceed in stages: We

Fitelson, Branden

109

: A Scalable Shared-memory Multicore Architecture  

E-Print Network (OSTI)

-chip memory accesses, EM2 improves energy consumption by 1.3Ã? on average, and the energy-delay product by up an address not locally cached on the core it is executing on, it migrates to the home core for that data, we show that EM2 outperforms directory-based cache-coherence 1.13Ã? on average using a high

Devadas, Srinivas

110

A hybrid magnetic/complementary metal oxide semiconductor three-context memory bit cell for non-volatile circuit design  

SciTech Connect

After decades of continued scaling to the beat of Moore's law, it now appears that conventional silicon based devices are approaching their physical limits. In today's deep-submicron nodes, a number of short-channel and quantum effects are emerging that affect the manufacturing process, as well as, the functionality of the microelectronic systems-on-chip. Spintronics devices that exploit both the intrinsic spin of the electron and its associated magnetic moment, in addition to its fundamental electronic charge, are promising solutions to circumvent these scaling threats. Being compatible with the CMOS technology, such devices offer a promising synergy of radiation immunity, infinite endurance, non-volatility, increased density, etc. In this paper, we present a hybrid (magnetic/CMOS) cell that is able to store and process data both electrically and magnetically. The cell is based on perpendicular spin-transfer torque magnetic tunnel junctions (STT-MTJs) and is suitable for use in magnetic random access memories and reprogrammable computing (non-volatile registers, processor cache memories, magnetic field-programmable gate arrays, etc). To demonstrate the potential our hybrid cell, we physically implemented a small hybrid memory block using 45?nm × 45?nm round MTJs for the magnetic part and 28?nm fully depleted silicon on insulator (FD-SOI) technology for the CMOS part. We also report the cells measured performances in terms of area, robustness, read/write speed and energy consumption.

Jovanovi?, B., E-mail: bojan.jovanovic@lirmm.fr, E-mail: lionel.torres@lirmm.fr; Brum, R. M.; Torres, L. [LIRMM—University of Montpellier 2/UMR CNRS 5506, 161 Rue Ada, 34095 Montpellier (France)

2014-04-07T23:59:59.000Z

111

Memory of myself: Autobiographical memory and identity in Alzheimer's disease  

E-Print Network (OSTI)

Memory of myself: Autobiographical memory and identity in Alzheimer's disease Donna Rose Addis autobiographical memory and identity. To test this we assessed the status of autobiographical memory and identity degree of autobiographical memory impairment was associated with changes in identity. Two tests

Addis, Donna Rose

112

March 29, 2008 Operating Systems: Main Memory 1 Main Memory  

E-Print Network (OSTI)

March 29, 2008 Operating Systems: Main Memory 1 Main Memory Chapter 8 #12;March 29, 2008 Operating Systems: Main Memory 2 Chapter Outline Background Contiguous Memory Allocation Paging Structure of the Page Table Segmentation #12;March 29, 2008 Operating Systems: Main Memory 3 Objectives To provide

Adam, Salah

113

Cache directory look-up re-use as conflict check mechanism for speculative memory requests  

DOE Patents (OSTI)

In a cache memory, energy and other efficiencies can be realized by saving a result of a cache directory lookup for sequential accesses to a same memory address. Where the cache is a point of coherence for speculative execution in a multiprocessor system, with directory lookups serving as the point of conflict detection, such saving becomes particularly advantageous.

Ohmacht, Martin

2013-09-10T23:59:59.000Z

114

A multiplexed quantum memory  

Science Journals Connector (OSTI)

A quantum repeater is a system for long-distance quantum communication that employs quantum memory elements to mitigate optical fiber transmission losses. The multiplexed quantum...

Lan, S -Y; Radnaev, A G; Collins, O A; Matsukevich, D N; Kennedy, T A; Kuzmich, A

2009-01-01T23:59:59.000Z

115

Memory Usage Considerations on Hopper  

NLE Websites -- All DOE Office Websites (Extended Search)

Memory Considerations Memory Considerations Memory Considerations Memory Usage Considerations on Hopper Most Hopper compute nodes have 32 GB of physical memory, but, not all that memory is available to user programs. Compute Node Linux (the kernel), the Lustre file system software, and message passing library buffers all consume memory, as does loading the executable into memory. Thus the precise memory available to an application varies. Approximately 31 GB of memory can be allocated from within an MPI program using all 24 cores per node, i.e., 1.29 GB per MPI task on average. If an application uses 12 MPI tasks per node, then each MPI task could use about 2.58 GB of memory. You may see an error message such as "OOM killer terminated this process." "OOM" means Out of Memory and it means that your code has exhausted the

116

Novel Nanocrystal Floating Gate Memory  

E-Print Network (OSTI)

nanocrystal-based nonvolatile memory. Reference: [1] H. A.process to make metal/high-k core-shell NC memory may openup opportunities for memory applications. References [1] W.

Zhou, Huimei

2012-01-01T23:59:59.000Z

117

The Generation Effect and Memory  

E-Print Network (OSTI)

A distinct form of episodic memory? New York, NY: OxfordA meta- analytic review. Memory & Cognition, 35(2), 201–210.dissociations among memory measures: Support for a transfer-

Rosner, Zachary Alexander

2012-01-01T23:59:59.000Z

118

New 1 Terabyte Memory Node  

NLE Websites -- All DOE Office Websites (Extended Search)

New 1 Terabyte Memory Node New 1 Terabyte Memory Node June 17, 2011 by Francesca Verdier (0 Comments) A new "extra large" memory node that has four 8-core Nehalem EX processors (32...

119

Eavesdropping without quantum memory  

E-Print Network (OSTI)

In quantum cryptography the optimal eavesdropping strategy requires that the eavesdropper uses quantum memories in order to optimize her information. What happens if the eavesdropper has no quantum memory? It is shown that the best strategy is actually to adopt the simple intercept/resend strategy.

H. Bechmann-Pasquinucci

2005-04-01T23:59:59.000Z

120

Working memory, long-term memory, and medial temporal lobe function  

E-Print Network (OSTI)

1 ………………………………………………………. ………….. Working Memory, Long-term Memory, and Medial Temporal Lobe Function Whendepend on working memory? ……………………………. Impaired short-term

Jeneson, Annette

2012-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

Optical quantum memory  

E-Print Network (OSTI)

Quantum memory is important to quantum information processing in many ways: a synchronization device to match various processes within a quantum computer, an identity quantum gate that leaves any state unchanged, and a tool to convert heralded photons to photons-on-demand. In addition to quantum computing, quantum memory would be instrumental for the implementation of long-distance quantum communication using quantum repeaters. The importance of this basic quantum gate is exemplified by the multitude of optical quantum memory mechanisms being studied: optical delay lines, cavities, electromagnetically-induced transparency, photon-echo, and off-resonant Faraday interaction. Here we report on the state-of-the-art in the field of optical quantum memory, including criteria for successful quantum memory and current performance levels.

A. I. Lvovsky; B. C. Sanders; W. Tittel

2010-02-24T23:59:59.000Z

122

Capital Access Program (Vermont)  

Energy.gov (U.S. Department of Energy (DOE))

The Capital Access Program provides loan guarantees to small businesses seeking access to commercial credit. Premiums paid by the borrower and matched by Vermont Economic Development Authority fund...

123

Randomized Algorithms Robert Elsasser  

E-Print Network (OSTI)

Randomized Algorithms Robert Els¨asser 15. June 2011 Program of the day: · Random walks on graphs Robert Els¨asser Universit¨at Paderborn Randomized Algorithms SS 11 0 #12;Markov Chains and Random Walks¨asser Universit¨at Paderborn Randomized Algorithms SS 11 1 #12;Markov Chains and Random Walks A Markov chain M

Elsässer, Robert

124

Mobile applications constantly demand additional memory, and traditional  

E-Print Network (OSTI)

. This remote access could reduce local storage space, thereby reducing energy demands on the mobile plat- form60 Mobile applications constantly demand additional memory, and traditional designs increase- port connected ubiquitous environments. Engineers attempt to minimize network use because of its

Lee, Hsien-Hsin "Sean"

125

Sleep & Memory/Review Memory reactivation and consolidation during sleep  

E-Print Network (OSTI)

Sleep & Memory/Review Memory reactivation and consolidation during sleep Ken A. Paller1 and Joel L, Illinois 60208-2710, USA Do our memories remain static during sleep, or do they change? We argue here that memory change is not only a natural result of sleep cognition, but further, that such change constitutes

Paller, Ken

126

Collective Memory Transfers for Multi-Core Chips  

SciTech Connect

Future performance improvements for microprocessors have shifted from clock frequency scaling towards increases in on-chip parallelism. Performance improvements for a wide variety of parallel applications require domain-decomposition of data arrays from a contiguous arrangement in memory to a tiled layout for on-chip L1 data caches and scratchpads. How- ever, DRAM performance suffers under the non-streaming access patterns generated by many independent cores. We propose collective memory scheduling (CMS) that actively takes control of collective memory transfers such that requests arrive in a sequential and predictable fashion to the memory controller. CMS uses the hierarchically tiled arrays formal- ism to compactly express collective operations, which greatly improves programmability over conventional prefetch or list- DMA approaches. CMS reduces application execution time by up to 32% and DRAM read power by 2.2×, compared to a baseline DMA architecture such as STI Cell.

Michelogiannakis, George; Williams, Alexander; Shalf, John

2013-11-13T23:59:59.000Z

127

Memory effect of the online user preference  

E-Print Network (OSTI)

The mechanism of the online user preference evolution is of great significance for understanding the online user behaviors and improving the quality of online services. Since users are allowed to rate on objects in many online systems, ratings can well reflect the users' preference. With two benchmark datasets from online systems, we uncover the memory effect in users' selecting behavior which is the sequence of qualities of selected objects and the rating behavior which is the sequence of ratings delivered by each user. Furthermore, the memory duration is presented to describe the length of a memory, which exhibits the power-law distribution, i.e., the probability of the occurring of long-duration memory is much higher than that of the random case which follows the exponential distribution. We present a preference model in which a Markovian process is utilized to describe the users' selecting behavior, and the rating behavior depends on the selecting behavior. With only one parameter for each of the user's s...

Hou, Lei; Guo, Qiang; Liu, Jian-Guo

2014-01-01T23:59:59.000Z

128

Device Memories and Matrix Multiplication 1 Device Memories  

E-Print Network (OSTI)

the same location. The GeForce 9400M has 65,536 bytes of constant memory, the total amount of global memory is 254 MBytes. The Tesla C2050/C2070 has 65,536 bytes of constant memory, the total amount of global memory, the total amount of global memory is 4,800 MBytes (5,032,706,048 bytes) with 1

Verschelde, Jan

129

Symmetrical Multilevel Diversity Coding with an All-Access Encoder  

E-Print Network (OSTI)

and L randomly accessible en- coders 1 to L. A total of L + 1 independent discrete memoryless sources (S0, S1, . . . , SL) are to be encoded at the encoders. The decoder, which has access to encoder 0 and a subset U of the ran- domly accessible... with polyhedral cone being the first quadrant and L + 2 faces. . . . . . . . . . . . . . 24 3 An illustration of the sliding windows of length ? when the in- tegers 1, . . . , L are circularly placed (clockwise) based on their natural order...

Marukala, Neeharika

2012-07-16T23:59:59.000Z

130

Consciousness, accessibility, and the mesh between psychology and  

E-Print Network (OSTI)

; refrigerator light illusion; reportability; unconscious; vegetative state; working memory 1. Introduction In The Modularity of Mind, Jerry Fodor argued that sig- nificant early portions of our perceptual systems are modular in a number of respects, including that we do not have cognitive access to their internal states

Block, Ned

131

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines  

SciTech Connect

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this talk, we present a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on largescale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

Wang, Chao [ORNL; Vazhkudai, Sudharshan S [ORNL; Ma, Xiaosong [ORNL; Meng, Fei [ORNL; Kim, Youngjae [ORNL; Engelmann, Christian [ORNL

2012-01-01T23:59:59.000Z

132

Disorder-Induced Microscopic Magnetic Memory  

NLE Websites -- All DOE Office Websites (Extended Search)

Disorder-Induced Microscopic Magnetic Memory Print Disorder-Induced Microscopic Magnetic Memory Print The magnetic-recording industry deliberately introduces carefully controlled disorder into its materials to obtain the desired magnetic properties. But as the density of magnetic disks climbs, the size of the magnetic domains responsible for storage must decrease, posing new challenges. Beautiful theories based on random microscopic disorder have been developed over the past ten years. To directly compare these theories with precise experiments, an American-European team, led by researchers from the University of Washington, Seattle, first developed and then applied coherent x-ray speckle metrology to microscopic magnetic domains in a series of thin multilayer perpendicular magnetic materials of varying disorder. Their results, at odds with all previous theories, have set a new reference point for future theories.

133

Disorder-Induced Microscopic Magnetic Memory  

NLE Websites -- All DOE Office Websites (Extended Search)

Disorder-Induced Microscopic Disorder-Induced Microscopic Magnetic Memory Disorder-Induced Microscopic Magnetic Memory Print Wednesday, 26 October 2005 00:00 The magnetic-recording industry deliberately introduces carefully controlled disorder into its materials to obtain the desired magnetic properties. But as the density of magnetic disks climbs, the size of the magnetic domains responsible for storage must decrease, posing new challenges. Beautiful theories based on random microscopic disorder have been developed over the past ten years. To directly compare these theories with precise experiments, an American-European team, led by researchers from the University of Washington, Seattle, first developed and then applied coherent x-ray speckle metrology to microscopic magnetic domains in a series of thin multilayer perpendicular magnetic materials of varying disorder. Their results, at odds with all previous theories, have set a new reference point for future theories.

134

Disorder-Induced Microscopic Magnetic Memory  

NLE Websites -- All DOE Office Websites (Extended Search)

Disorder-Induced Microscopic Magnetic Memory Print Disorder-Induced Microscopic Magnetic Memory Print The magnetic-recording industry deliberately introduces carefully controlled disorder into its materials to obtain the desired magnetic properties. But as the density of magnetic disks climbs, the size of the magnetic domains responsible for storage must decrease, posing new challenges. Beautiful theories based on random microscopic disorder have been developed over the past ten years. To directly compare these theories with precise experiments, an American-European team, led by researchers from the University of Washington, Seattle, first developed and then applied coherent x-ray speckle metrology to microscopic magnetic domains in a series of thin multilayer perpendicular magnetic materials of varying disorder. Their results, at odds with all previous theories, have set a new reference point for future theories.

135

Mondriaan memory protection  

E-Print Network (OSTI)

Reliability and security are quickly becoming users' biggest concern due to the increasing reliance on computers in all areas of society. Hardware-enforced, fine-grained memory protection can increase the reliability and ...

Witchel, Emmett Jethro, 1970-

2004-01-01T23:59:59.000Z

136

Hardware Transactional Memory  

E-Print Network (OSTI)

This work shows how hardware transactional memory (HTM) can be implemented to support transactions of arbitrarily large size, while ensuring that small transactions run efficiently. Our implementation handles small ...

Lie, Sean

137

In memory of Roland L. Dobrushin DECAY OF CORRELATIONS IN SUBCRITICAL  

E-Print Network (OSTI)

In memory of Roland L. Dobrushin DECAY OF CORRELATIONS IN SUBCRITICAL POTTS AND RANDOM R of the cluster at the origin, for subcritical random-cluster models, under an assumption slightly throughout the subcritical phase, then P(R n) exp( n) for some > 0. This implies the exponential decay

Grimmett, Geoffrey

138

In memory of Roland L. Dobrushin DECAY OF CORRELATIONS IN SUBCRITICAL  

E-Print Network (OSTI)

In memory of Roland L. Dobrushin DECAY OF CORRELATIONS IN SUBCRITICAL POTTS AND RANDOM R of the cluster at the origin, for subcritical random­cluster models, under an assumption slightly ) ! 1 throughout the subcritical phase, then P(R â?? n) Ÿ exp(\\Gammaffn) for some ff ? 0. This implies

Grimmett, Geoffrey

139

ISIT2002, Lausanne, Switzerland, June 30 -July 5,2002 The use of memory in  

E-Print Network (OSTI)

consider the following canonical load balancing problem: Drop n balls into n bins so as to minimize the following randomized load balancing policy, called the " ( d , m )policy": Suppose that d 2 m. At the beISIT2002, Lausanne, Switzerland, June 30 -July 5,2002 The use of memory in randomized load

Prabhakar, Balaji

140

Quantum Channels with Memory  

E-Print Network (OSTI)

We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be decomposed into a concatenated memory channel. We then examine and present different physical setups in which channels with memory may be operated for the transfer of (private) classical and quantum information. These include setups in which either the receiver or a malicious third party have control of the initializing memory. We introduce classical and quantum channel capacities for these settings, and give several examples to show that they may or may not coincide. Entropic upper bounds on the various channel capacities are given. For forgetful quantum channels, in which the effect of the initializing memory dies out as time increases, coding theorems are presented to show that these bounds may be saturated. Forgetful quantum channels are shown to be open and dense in the set of quantum memory channels.

Dennis Kretschmann; Reinhard F. Werner

2005-02-17T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

Euclid, NERSC's Sunfire Shared Memory Analytics System  

NLE Websites -- All DOE Office Websites (Extended Search)

High Throughput Job Carver seriallong queue, or Hopper Hight Throughput Queue Large Memory Batch MPP Code Carver Extra-large memory noderegxlmem queue Large Memory Interactive...

142

Zinc Oxide Based Nonvolatile Memories and Random Lasers  

E-Print Network (OSTI)

2013). [41] 2010 Optoelectronics Market Report. Databeans,studied. The ZnO based optoelectronics devices are studiedmethods [7]. For many optoelectronics and microelectronics

Huang, Jian

2013-01-01T23:59:59.000Z

143

Dynamic Program Phase Detection in Distributed Shared-Memory Multiprocessors  

SciTech Connect

We present a novel hardware mechanism for dynamic program phase detection in distributed shared-memory (DSM) multiprocessors. We show that successful hardware mechanisms for phase detection in uniprocessors do not necessarily work well in DSM systems, since they lack the ability to incorporate the parallel application's global execution information and memory access behavior based on data distribution. We then propose a hardware extension to a well-known uniprocessor mechanism that significantly improves phase detection in the context of DSM multiprocessors. The resulting mechanism is modest in size and complexity, and is transparent to the parallel application.

Ipek, E; Martinez, J F; de Supinski, B R; McKee, S A; Schulz, M

2006-03-06T23:59:59.000Z

144

Remote Access Options  

Energy.gov (U.S. Department of Energy (DOE))

If access is required to DOE Headquarters internal network resources, such as messaging, productivity tools or network-stored files and folders while away from the DOE building, you can access them through a Virtual Private Network.

145

Efficient Memory Shadowing for 64-bit Architectures  

E-Print Network (OSTI)

Shadow memory is used by dynamic program analysis tools to store metadata for tracking properties of application memory. The efficiency of mapping between application memory and shadow memory has substantial impact on the ...

Zhao, Qin

2010-01-01T23:59:59.000Z

146

Colossal Electroresistive Properties Of CSD Grown Pr{sub 0.7}Ca{sub 0.3}MnO{sub 3} Films For Nonvolatile Memory Applications  

SciTech Connect

Colossal electroresistance effects upon application of electric field in perovskite oxide Pr{sub 0.7}Ca{sub 0.3}MnO{sub 3}(PCMO) thin films, which is a promising candidate for resistance random access memory (RRAM) device have been investigated. Nanocrystalline PCMO films were grown on SiO{sub 2} substrates by chemical solution deposition and crystallized at 700 deg. C under different gas atmospheres. Four terminal current voltage characteristics of Ag/PCMO/Ag planar geometry exhibited a sharp transition from a low resistance state (LRS) to a high resistance state (HRS) with a resistance switching ratio of as high as 1100% at room temperature. Nonvolatility and high retention was confirmed by electric pulse induced resistive switching measurements. The resistance switching ratios were found to depend on the annealing conditions, suggesting an interaction between the nonlattice oxygen and oxygen vacancies and/or the cationic vacancy.

Bhavsar, K. H.; Joshi, U. S. [Department of Physics, University School of Sciences, Gujarat University, Ahmedabad-380 009 (India)

2010-12-01T23:59:59.000Z

147

Cache Memories ALAN JAY SMITH  

E-Print Network (OSTI)

Cache Memories ALAN JAY SMITH Unwersity of California, Berkeley, Californm 94720 Cache memories 1982 #12;474 * A. J. Smith CONTENTS INTRODUCTION Definltlonand Rationale Overwew of Cache Deslgn Cache

Lee, Hsien-Hsin "Sean"

148

An Adaptive Memory Interface Controller for Improving Bandwidth Utilization of Hybrid and Reconfigurable Systems  

SciTech Connect

Emerging applications such as data mining, bioinformatics, knowledge discovery, social network analysis are irregular. They use data structures based on pointers or linked lists, such as graphs, unbalanced trees or unstructures grids, which generates unpredictable memory accesses. These data structures usually are large, but difficult to partition. These applications mostly are memory bandwidth bounded and have high synchronization intensity. However, they also have large amounts of inherent dynamic parallelism, because they potentially perform a task for each one of the element they are exploring. Several efforts are looking at accelerating these applications on hybrid architectures, which integrate general purpose processors with reconfigurable devices. Some solutions, which demonstrated significant speedups, include custom-hand tuned accelerators or even full processor architectures on the reconfigurable logic. In this paper we present an approach for the automatic synthesis of accelerators from C, targeted at irregular applications. In contrast to typical High Level Synthesis paradigms, which construct a centralized Finite State Machine, our approach generates dynamically scheduled hardware components. While parallelism exploitation in typical HLS-generated accelerators is usually bound within a single execution flow, our solution allows concurrently running multiple execution flow, thus also exploiting the coarser grain task parallelism of irregular applications. Our approach supports multiple, multi-ported and distributed memories, and atomic memory operations. Its main objective is parallelizing as many memory operations as possible, independently from their execution time, to maximize the memory bandwidth utilization. This significantly differs from current HLS flows, which usually consider a single memory port and require precise scheduling of memory operations. A key innovation of our approach is the generation of a memory interface controller, which dynamically maps concurrent memory accesses to multiple ports. We present a case study on a typical irregular kernel, Graph Breadth First search (BFS), exploring different tradeoffs in terms of parallelism and number of memories.

Castellana, Vito G.; Tumeo, Antonino; Ferrandi, Fabrizio

2014-05-30T23:59:59.000Z

149

Working Memory Overload: Fronto-Limbic Interactions and Effects on Subsequent Working Memory Function  

E-Print Network (OSTI)

involvement in human working memory. Neuroimage, 5(1), 49–constraints in working memory as revealed by function- alin a nonspatial working memory task with functional MRI.

Yun, Richard J.; Krystal, John H.; Mathalon, Daniel H.

2010-01-01T23:59:59.000Z

150

Access for All  

E-Print Network (OSTI)

..................................................................................... 6 Methodology................................................................................... 11 Entrance into Algebra I Pre-AP ...................................................... 14 Results... ...................................................................................... 27 III ACCESS TO ADVANCED CLASSES ............................................... 28 Introduction..................................................................................... 28 Methodology...

Stearns, Linda Lea Merenda

2012-07-16T23:59:59.000Z

151

Demystifying Open Access  

SciTech Connect

The tenets of Open Access are to grant anyone, anywhere and anytime free access to the results of scientific research. HEP spearheaded the Open Access dissemination of scientific results with the mass mailing of preprints in the pre-WWW era and with the launch of the arXiv preprint system at the dawn of the '90s. The HEP community is now ready for a further push to Open Access while retaining all the advantages of the peer-review system and, at the same time, bring the spiralling cost of journal subscriptions under control. I will present a possible plan for the conversion to Open Access of HEP peer-reviewed journals, through a consortium of HEP funding agencies, laboratories and libraries: SCOAP3 (Sponsoring Consortium for Open Access Publishing in Particle Physics). SCOAP3 will engage with scientific publishers towards building a sustainable model for Open Access publishing, which is as transparent as possible for HEP authors. The current system in which journals income comes from subscription fees is replaced with a scheme where SCOAP3 compensates publishers for the costs incurred to organise the peer-review service and give Open Access to the final version of articles. SCOAP3 will be funded by all countries active in HEP under a 'fair share' scenario, according to their production of HEP articles. In this talk I will present a short overview of the history of Open Access in HEP, the details of the SCOAP3 model and the outlook for its implementation.

Mele, Salvatore

2007-05-14T23:59:59.000Z

152

Efficient Main Memory Deduplication Through Cross Layer Integration.  

E-Print Network (OSTI)

??Limited main memory size is the primary bottleneck for consolidating VMs. Memory scanners reduce the memory footprint of VMs by eliminating duplicate memory pages. Our… (more)

Miller, Konrad

2014-01-01T23:59:59.000Z

153

Smoothness- transferred random field  

E-Print Network (OSTI)

We propose a new random field (RF) model, smoothness-transfer random field (ST-RF) model, for image modeling. In the objective function of RF models, smoothness energy is defined with compatibility function to capture the ...

Wei, Donglai

2013-01-01T23:59:59.000Z

154

TED KYCIA MEMORIAL SYMPOSIUM.  

SciTech Connect

On the afternoon of May 19 2000, a Memorial Seminar was held in the BNL physics Large Seminar Room to honor the memory of Ted Kyeia, a prominent particle physicist who had been a member of the BNL staff for 40 years. Although it was understandably a somewhat sad occasion because Ted was no longer with us, nevertheless there was much for his colleagues and friends to celebrate in recalling the outstanding contributions that he had made in those four decades. The Seminar speakers were all people who had worked with Ted during that period; each discussed one aspect of his career, but also included anecdotes and personal reminiscences. This booklet contains the Seminar program, listing the speakers, and also copies of transparencies of the talks (and one paper which was a later expansion of a talk); sadly, not all of the personal remarks appeared on the transparencies.

LITTENBERG, L.; RUBINSTEIN, R.; SAMIOS, N.; LI, K.; GIACOMELLI, G.; MOCKETT, P.; CARROLL, A.; JOHNSON, R.; BRYMAN, D.; TIPPENS, B.

2000-05-19T23:59:59.000Z

155

Genepool Memory Heatmaps  

NLE Websites -- All DOE Office Websites (Extended Search)

Genepool Memory Heatmaps Genepool Memory Heatmaps Heatmap of Memory and Slots Requested vs Time Waited (in hours) | Queue: All | Last 7 Days Memory Requested Slots <5GB 5-10GB 10-20GB 20-30GB 30-40GB 40-50GB 50-100GB 100-150GB 150-200GB 200-256GB 256-512GB 512+GB Job Count Longest Wait 1 2.26 (2693) 10.5 (201167) 3.2 (11650) 0 1.75 (282) 1.49 (1627) 0.03 (1) 0 0 0 0 0 217420 538.96 2 0.26 (103) 1.02 (2817) 0 0 0 0 0 0 0 0 0 0 2920 9.1 4 1.55 (198) 1.48 (104) 0.34 (8) 0 0 0 1.86 (3) 0 0 0 0 0 313 20.48 6 0.01 (1) 0.09 (34) 0 0 0 0 0 0 0 0 0 0 35 1.22 8 0.34 (37) 6.15 (12376) 1.01 (17) 24.7 (1) 0.03 (3) 0 0.02 (6) 0 0 0 0 0 12440 46.16 10 0 8.56 (1) 0 0 0 0 0 0 0 0 0 0 1 8.56 16 0 0.03 (1) 0 0 0 0 0 0 0 0 0 0 1 0.03 24 0 0 0.01 (1) 0 0 0 0 0 0 0 0 0 1 0.01 32 0 0.01 (4) 0.05 (9) 0 0.01 (6) 0 0.0 (1) 0 0 0 0 0 20 0.26

156

Memories of Julian Schwinger  

E-Print Network (OSTI)

The career and accomplishments of Julian Schwinger, who shared the Nobel Prize for physics in 1965, have been reviewed in numerous books and articles. For this reason these Memories, which seek to convey a sense of Schwinger's remarkable talents as a physicist, concentrate primariy (though not entirely) on heretofore unpublished pertinent recollections of the youthful Schwinger by this writer, who first encountered Schwinger in 1934 when they both were undergraduates at the City College of New York.

Gerjuoy, Edward

2014-01-01T23:59:59.000Z

157

Shape memory alloy actuator  

DOE Patents (OSTI)

An actuator for cycling between first and second positions includes a first shaped memory alloy (SMA) leg, a second SMA leg. At least one heating/cooling device is thermally connected to at least one of the legs, each heating/cooling device capable of simultaneously heating one leg while cooling the other leg. The heating/cooling devices can include thermoelectric and/or thermoionic elements.

Varma, Venugopal K. (Knoxville, TN)

2001-01-01T23:59:59.000Z

158

Web Access to Supercomputing  

Science Journals Connector (OSTI)

Theoretically computational and data grids are the computing paradigm of choice but they will not gain wide acceptance until users have seamless access to them. The authors describe how to provide comfortable intuitive yet powerful Web access to supercomputing. A Web-based grid-enabled application that processes analyzes and delivers remote-sensing images provides an example of the technology at work.

Giovanni Aloisio; Massimo Cafaro; Carl Kesselman; Roy Williams

2001-01-01T23:59:59.000Z

159

The memory glasses : wearable computing for just-in-time memory support  

E-Print Network (OSTI)

This thesis documents a body of wearable computing research surrounding the development of the Memory Glasses, a new type of proactive memory support technology. The Memory Glasses combines features of existing memory ...

DeVaul, Richard W. (Richard Wayne), 1971-

2004-01-01T23:59:59.000Z

160

Accessing HPSS at NERSC  

NLE Websites -- All DOE Office Websites (Extended Search)

Accessing HPSS Accessing HPSS Accessing HPSS Once you have successfully generated an HPSS token you can access NERSC's HPSS in the different ways listed below. HSI and HTAR are usually the best ways to transfer data in and out of HPSS but other methods are also included. Access Method When to use this method Features Limitations HSI When a full-featured unix-like interface is desired high performance (parallel); unix-like user interface; firewall mode client is specific to HPSS version and might not work at other sites; HTAR When you have large collections of smaller (~10MB or less) files high performance (parallel); creates a tar file directly in HPSS along with an index file; more efficient for large collections of file same client limitations as HSI; also does not have firewall mode so using on a remote site with a firewall will require modification of firewall rules

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

Memory effects in quantum channel discrimination  

E-Print Network (OSTI)

We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with memory. For optimal discrimination and estimation of sets of unitary channels memory-assisted protocols are not required.

Giulio Chiribella; Giacomo M. D'Ariano; Paolo Perinotti

2008-03-21T23:59:59.000Z

162

How Minds Work Working & Episodic Memory  

E-Print Network (OSTI)

1 How Minds Work Working & Episodic Memory Stan Franklin Computer Science Division & Institute for Intelligent Systems The University of Memphis #12;HMW: Working and Episodic Memory 2 Memory Systems #12;HMW: Working and Episodic Memory 3 #12;HMW: Working and Episodic Memory 4 Percept · Result of filtering

Memphis, University of

163

Is memory purely preservative?* Jrme Dokic  

E-Print Network (OSTI)

1 Is memory purely preservative?* J�r�me Dokic (University of Rouen and CREA, Paris) In C. Hoerl & T. McCormack (eds), Time and Memory, Oxford: OUP. �1 Two forms of memory and Goethe's Problem Let us start with a familiar distinction between two forms of memory: episodic memory (remembering a thing

Paris-Sud XI, Université de

164

Gifts in Memory of LEHIGH UNIVERSITY 1 Anonymous, in memory of  

E-Print Network (OSTI)

Gifts in Memory of LEHIGH UNIVERSITY 1 Anonymous, in memory of Gerald G. Leeman '71P '10GP Michael P. Ament, in memory of Hilda P. Ament and Miles K. Ament '49 Allen M. Barnett, in memory of Matthew A. Yantis '01 Samuel W. Barnhart, in memory of Donald H. Dimmick '55 Dorothy Barrows, in memory

Gilchrist, James F.

165

Working Memory and Schizophrenia 1 Running head: working memory and schizophrenia  

E-Print Network (OSTI)

Working Memory and Schizophrenia 1 Running head: working memory and schizophrenia Working memory.Park@vanderbilt.edu or Junghee.Lee@vanderbilt.edu #12;Working Memory and Schizophrenia 2 Abstract Working memory (WM) deficit and/or early part of maintenance may be problematic. #12;Working Memory and Schizophrenia 3

Park, Sohee

166

Carlsbad employees fund veteran memorial  

NLE Websites -- All DOE Office Websites (Extended Search)

Carlsbad Employees Fund Veteran Memorial Community Connections: Your link to news and opportunities from Los Alamos National Laboratory Latest Issue: Dec. 2014 - Jan. 2015 All...

167

SPRNG Parallel Random Number Generators at NERSC  

NLE Websites -- All DOE Office Websites (Extended Search)

SPRNG SPRNG SPRNG Description The SPRNG libraries of generators produce good quality random numbers, and are also fast. They have been subjected to some of the largest random number tests, with around 10^13 RNs per test. SPRNG provides both FORTRAN and C (also C++) interfaces for the use of the parallel random number generators. Access SPRNG v2.0 is available on Carver (gcc, intel and pgi) and Cray systems (pgi and cce). Use the module utility to load the software. module load sprng Using SPRNG On Cray systems: ftn sprng_test.F $SPRNG -lsprng On Carver: mpif90 sprng_test.F $SPRNG -lsprng Documentation On Carver there are various documents in $SPRNG/DOCS and various examples in $SPRNG/EXAMPLES. See the SPRNG web site at Florida State University for complete details. For help using SPRNG at NERSC contact the

168

An analysis of MRAM based memory technologies  

E-Print Network (OSTI)

MRAM is a memory (RAM) technology that uses electron spin to store information. Often been called "the ideal memory", it can potentially combine the density of DRAM with the speed of SRAM and non-volatility of FLASH memory ...

Vijayaraghavan, Rangarajan, M. Eng. Massachusetts Institute of Technology

2006-01-01T23:59:59.000Z

169

Vlsi Design And Comparison Of Bank Memory With Multiport Memory Cell Versus Conventional Multiport And Multibank Sram Memory.  

E-Print Network (OSTI)

??The main focus of this thesis is to determine whether designing a bank memory with multiport memory cell (hybrid design) is advantageous over conventionally used… (more)

Lakkakula, Sunil Kumar

2009-01-01T23:59:59.000Z

170

TERRORISM TRUMPS INTERNET ACCESS  

Science Journals Connector (OSTI)

TERRORISM TRUMPS INTERNET ACCESS ... The regulation is in response to fears that terrorists will be able to punch into the Internet and gather theoretical accident information that the government requires for environmental purposes. ...

JEFF JOHNSON

2000-07-03T23:59:59.000Z

171

Nanoparticle shuttle memory  

DOE Patents (OSTI)

A device for storing data using nanoparticle shuttle memory having a nanotube. The nanotube has a first end and a second end. A first electrode is electrically connected to the first end of the nanotube. A second electrode is electrically connected to the second end of the nanotube. The nanotube has an enclosed nanoparticle shuttle. A switched voltage source is electrically connected to the first electrode and the second electrode, whereby a voltage may be controllably applied across the nanotube. A resistance meter is also connected to the first electrode and the second electrode, whereby the electrical resistance across the nanotube can be determined.

Zettl, Alex Karlwalter (Kensington, CA)

2012-03-06T23:59:59.000Z

172

Theories with Memory  

E-Print Network (OSTI)

Dimensionally reduced supersymmetric theories retain a great deal of information regarding their higher dimensional origins. In superspace, this "memory" allows us to restore the action governing a reduced theory to that describing its higher-dimensional progenitor. We illustrate this by restoring four-dimensional N=4 Yang-Mills to its six-dimensional parent, N=(1,1) Yang-Mills. Supersymmetric truncation is introduced into this framework and used to obtain the N=1 action in six dimensions. We work in light-cone superspace, dealing exclusively with physical degrees of freedom.

Sudarshan Ananth

2005-10-07T23:59:59.000Z

173

Memory distortion: an adaptive perspective  

E-Print Network (OSTI)

concerning factors that can influence the occurrence of memory distortions, such as sleep and retrieval kinds of errors and distortions. Studies of memory distortion have a long history in both theoretical narrative that becomes our autobiography. In the process of reconstructing the past, we color and shape our

Schacter, Daniel

174

Hospital Greenspace Lawson Memorial Hospital,  

E-Print Network (OSTI)

H Hospital Greenspace Lawson Memorial Hospital, Golspie ­ Greenspace Case Study Background to hospital greenspace to be carried out in the Highlands. This project is now entering its third phase. Phase of Phase 2. This resulted in the identification of the Lawson Memorial Hospital as the site

175

Shape memory alloy thaw sensors  

DOE Patents (OSTI)

A sensor permanently indicates that it has been exposed to temperatures exceeding a critical temperature for a predetermined time period. An element of the sensor made from shape memory alloy changes shape when exposed, even temporarily, to temperatures above the Austenitic temperature of the shape memory alloy. The shape change of the SMA element causes the sensor to change between two readily distinguishable states.

Shahinpoor, Mohsen (Albuquerque, NM); Martinez, David R. (Albuquerque, NM)

1998-01-01T23:59:59.000Z

176

Random coincidence of $2\  

E-Print Network (OSTI)

Two neutrino double $\\beta$ decay can create irremovable background even in high energy resolution detectors searching for neutrinoless double $\\beta$ decay due to random coincidence of $2\

D. M. Chernyak; F. A. Danevich; A. Giuliani; E. Olivieri; M. Tenconi; V. I. Tretyak

2013-01-17T23:59:59.000Z

177

Visitor Hanford Computer Access Request - Hanford Site  

NLE Websites -- All DOE Office Websites (Extended Search)

Visitor Hanford Computer Access Request Visitor Hanford Computer Access Request Visitor Hanford Computer Access Request Visitor Hanford Computer Access Request Email Email Page |...

178

MUN WATER PLEDGE In signing this pledge, the Memorial University of Newfoundland community pledges to  

E-Print Network (OSTI)

MUN WATER PLEDGE In signing this pledge, the Memorial University of Newfoundland community pledges to: 1. Progressively and systematically eliminate the distribution of plastic bottled water at all of a university community that is bottled water free. 2. Conduct a University-wide Public Water Access Audit

Oyet, Alwell

179

Multicoloured Random Graphs: The Random Dynamics Program  

E-Print Network (OSTI)

The Random Dynamics program is a proposal to explain the origin of all symmetries, including Lorentz and gauge invariance without appeal to any fundamental invariance of the laws of nature, and to derive the known physical laws in such a way as to be almost unavoidable. C. D. Froggatt and H. B. Nielsen proposed in their book Origin of Symmetries, that symmetries and physical laws should arise naturally from some essentially random dynamics rather than being postulated to be exact. The most useful assumption of the program that can be made about the fundamental laws is taken to be that they are random and then to see how known physics like mechanics and relativity follow from them. It is believed that almost any model of these regularities would appear in some limit for example as energies become small. Almost all theories or models at the fundamental level could then explain known physics. We suggest how using the formalism and properties of random graphs might be useful in developing the theory, and point towards directions in which it can be more fully extended in future work.

Sam Tarzi

2014-07-15T23:59:59.000Z

180

Efficient Virtual Memory for Big Memory Servers Our analysis shows that many "big-memory" server workloads,  

E-Print Network (OSTI)

-memory" server workloads, such as databases, in-memory caches, and graph analytics, pay a high cost for page introduced [13]. In contrast, virtual memory usage has changed dramatically in recent years. For example-negligible energy [5, 41] To reevaluate the cost and benefit of decades-old page-based vir- tual memory in today

Hill, Mark D.

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

Quantifiers for randomness of chaotic pseudo-random number generators  

Science Journals Connector (OSTI)

...randomness of chaotic pseudo-random number generators L. De Micco 1 H. A. Larrondo 1...connection with pseudo-random number generators (PRNGs). Workers in the field are...notion to generate pseudo-random number generators (PRNGs) because random numbers are...

2009-01-01T23:59:59.000Z

182

Event Understanding and Memory 1 Running head: Event Understanding and Memory  

E-Print Network (OSTI)

Event Understanding and Memory 1 Running head: Event Understanding and Memory Event Understanding and Memory in Healthy Aging and Dementia of the Alzheimer Type Jeffrey M. Zacks, Nicole K. Speer, Jean M Understanding and Memory 2 Abstract Segmenting ongoing activity into events is important for later memory

Zacks, Jeffrey M.

183

Gifts in Memory of LEHIGH UNIVERSITY 1 James B. Abeltin `74 in memory of  

E-Print Network (OSTI)

Gifts in Memory of LEHIGH UNIVERSITY 1 James B. Abeltin `74 in memory of Roger K. McFillin `74 `04P James J. Addonizio `75 in memory of Roger K. McFillin `74 `04P Alan J. & Susan A. Fuirst Philanthropic Fund in memory of David J. Sielewicz `86 Betty W. Alderson in memory of James B. Hobbs Amaranth

Napier, Terrence

184

Item memory, source memory, and the medial temporal lobe: Concordant findings from fMRI  

E-Print Network (OSTI)

Item memory, source memory, and the medial temporal lobe: Concordant findings from fMRI and memory Lake City, UT 84143 Contributed by Larry R. Squire, April 4, 2006 We studied item and source memory with fMRI in healthy volun- teers and carried out a parallel study in memory-impaired patients

Wagner, Anthony

185

Multi-Level Bitmap Indexes for Flash Memory Storage  

SciTech Connect

Due to their low access latency, high read speed, and power-efficient operation, flash memory storage devices are rapidly emerging as an attractive alternative to traditional magnetic storage devices. However, tests show that the most efficient indexing methods are not able to take advantage of the flash memory storage devices. In this paper, we present a set of multi-level bitmap indexes that can effectively take advantage of flash storage devices. These indexing methods use coarsely binned indexes to answer queries approximately, and then use finely binned indexes to refine the answers. Our new methods read significantly lower volumes of data at the expense of an increased disk access count, thus taking full advantage of the improved read speed and low access latency of flash devices. To demonstrate the advantage of these new indexes, we measure their performance on a number of storage systems using a standard data warehousing benchmark called the Set Query Benchmark. We observe that multi-level strategies on flash drives are up to 3 times faster than traditional indexing strategies on magnetic disk drives.

Wu, Kesheng; Madduri, Kamesh; Canon, Shane

2010-07-23T23:59:59.000Z

186

Multiplayer Quantum Games and its Application as Access Controller in Architecture of Quantum Computers  

E-Print Network (OSTI)

One of the basics tasks in computer systems is the control of access of resources. Basically, there is a finite amount of resources that can be, for example, the CPU, memory or I/O ports, and several processes requiring those resources. If there is not enough resource in order to attend the demand, some kind of control access has to be employed. In this work, recognizing the resource sharing problem as a competition, we employ a simplified multiplayer quantum game as an access controller. The proposed quantum game can be employed in the architecture of quantum computers.

Paulo Benicio; Melo de Sousa; Rubens Viana Ramos

2008-02-26T23:59:59.000Z

187

Access Grid | Argonne National Laboratory  

NLE Websites -- All DOE Office Websites (Extended Search)

Access Grid Access Grid Access Grid The Access Grid is the ensemble of resources that can be used to support human interaction across the grid. It consists of multimedia display, presentation and interactive environments, interfaces to grid middleware, and interfaces to visualization environments. The Access Grid will support large-scale distributed meetings, collaborative work sessions, seminars, lectures, tutorials and training. The Access Grid design point is group-to-group communication (thus differentiating it from desktop to desktop based tools that focus on individual communication). The Access Grid environment must enable both formal and informal group interactions. Large-format displays integrated with intelligent or active meeting rooms are a central feature of the Access Grid nodes. Access Grid nodes are

188

Random multiparty entanglement distillation  

E-Print Network (OSTI)

We describe various results related to the random distillation of multiparty entangled states - that is, conversion of such states into entangled states shared between fewer parties, where those parties are not predetermined. In previous work [Phys. Rev. Lett. 98, 260501 (2007)] we showed that certain output states (namely Einstein-Podolsky-Rosen (EPR) pairs) could be reliably acquired from a prescribed initial multipartite state (namely the W state) via random distillation that could not be reliably created between predetermined parties. Here we provide a more rigorous definition of what constitutes ``advantageous'' random distillation. We show that random distillation is always advantageous for W-class three-qubit states (but only sometimes for Greenberger-Horne-Zeilinger (GHZ)-class states). We show that the general class of multiparty states known as symmetric Dicke states can be readily converted to many other states in the class via random distillation. Finally we show that random distillation is provably not advantageous in the limit of multiple copies of pure states.

Ben Fortescue; Hoi-Kwong Lo

2007-09-25T23:59:59.000Z

189

Collective Memory Transfers for Multi-Core Chips  

E-Print Network (OSTI)

A. McKee, “The impulse memory controller,” IEEE Transactionsand K. Yelick, “Improving memory subsystem performance usingBasu, and E. Horvitz, “Memory constrained face recognition,”

Michelogiannakis, George

2014-01-01T23:59:59.000Z

190

Random Testing versus Partition Testing.  

E-Print Network (OSTI)

?? The difference between Partition Testing and Random Testing has been thoroughlyinvestigated theoretically. In this thesis we present a practical study ofthe differences between random… (more)

Oftedal, Kristian

2011-01-01T23:59:59.000Z

191

Information Access Router for Integrated Information Access System Koji Murakami  

E-Print Network (OSTI)

Information Access Router for Integrated Information Access System Koji Murakami Department System (IIAS) that accepts diverse kinds of questions and provides the requested information in the most suit- able format for the information need. We designed a set of 18 Information Access Types

192

Energy Consumption in Access Networks  

Science Journals Connector (OSTI)

We present a comparison of energy consumption of access networks. We consider passive optical networks, fiber to the node, point-to-point optical systems and WiMAX. Optical access...

Baliga, Jayant; Ayre, Robert; Sorin, Wayne V; Hinton, Kerry; Tucker, Rodney S

193

Synchronization in the presence of memory  

E-Print Network (OSTI)

We study the effect of memory on synchronization of identical chaotic systems driven by common external noises. Our examples show that while in general synchronization transition becomes more difficult to meet when memory range increases, for intermediate ranges the synchronization tendency of systems can be enhanced. Generally the synchronization transition is found to depend on the memory range and the ratio of noise strength to memory amplitude, which indicates on a possibility of optimizing synchronization by memory. We also point out on a close link between dynamics with memory and noise, and recently discovered synchronizing properties of networks with delayed interactions.

Rafael Morgado; Michal Ciesla; Lech Longa; Fernando A. Oliveira

2006-10-11T23:59:59.000Z

194

Open Access Week Planning Materials  

E-Print Network (OSTI)

TAMUemployees list TAMUemployees list KAMU-TV Magazine TAMU Landing-page for Open Access Week library.tamu.edu/oaweek Open Access Week (organized by SPARC) www.openaccessweek.org Digital Repository Disseminate your work... via the Texas A&M University Digital Repository and get ? ?more exposure universal access easier information discovery persistent access wide range of content? SPARC http://www.arl.org/sparc...

195

Optimizing TLB entries for mixed page size storage in contiguous memory  

DOE Patents (OSTI)

A system and method for accessing memory are provided. The system comprises a lookup buffer for storing one or more page table entries, wherein each of the one or more page table entries comprises at least a virtual page number and a physical page number; a logic circuit for receiving a virtual address from said processor, said logic circuit for matching the virtual address to the virtual page number in one of the page table entries to select the physical page number in the same page table entry, said page table entry having one or more bits set to exclude a memory range from a page.

Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Kriegel, Jon K.; Ohmacht, Martin; Steinmacher-Burow, Burkhard

2013-04-30T23:59:59.000Z

196

A discrete fractional random transform  

E-Print Network (OSTI)

We propose a discrete fractional random transform based on a generalization of the discrete fractional Fourier transform with an intrinsic randomness. Such discrete fractional random transform inheres excellent mathematical properties of the fractional Fourier transform along with some fantastic features of its own. As a primary application, the discrete fractional random transform has been used for image encryption and decryption.

Zhengjun Liu; Haifa Zhao; Shutian Liu

2006-05-20T23:59:59.000Z

197

Phase change materials: From material science to novel storage devices  

Science Journals Connector (OSTI)

In recent years, non-volatile solid state memories have in many applications replaced magnetic hard disk drives. While the most popular and successful non-volatile memory is the “FLASH” random access memory, seve...

M. Wuttig; C. Steimer

2007-06-01T23:59:59.000Z

198

REMOTE ACCESS SERVICES | Department of Energy  

NLE Websites -- All DOE Office Websites (Extended Search)

REMOTE ACCESS SERVICES REMOTE ACCESS SERVICES REMOTE ACCESS SERVICES Access the information you need... Anywhere. Anytime. Different service providers within the Department offer remote access services based on your specific work requirements. If you need assistance, please contact your individual service provider. Energy IT Services (EITS) Remote Access Services Outlook Web Access RSA Token Login RSA Token Instructions HSPD-12 Login HSPD-12 Badge Instructions Virtual Private Network Instructions Citrix Workplace Instructions Energy Information Administration (EIA) Remote Access Services Outlook Web Access EIA VPN Office of Intelligence and Counterintelligence (IN) Remote Access Services Outlook Web Access Office of Science (SC) Remote Access Services Citrix Workplace Help for EITS Customers

199

ACCESSING SUBCONTRACTOR EMPLOYMENT RECORDS | Department of Energy  

Office of Environmental Management (EM)

ACCESSING SUBCONTRACTOR EMPLOYMENT RECORDS ACCESSING SUBCONTRACTOR EMPLOYMENT RECORDS Federal officials, on occasion, may seek access to contractor or subcontractor employment and...

200

Memory cost of quantum protocols  

E-Print Network (OSTI)

In this paper we consider the problem of minimizing the ancillary systems required to realize an arbitrary strategy of a quantum protocol, with the assistance of classical memory. For this purpose we introduce the notion of memory cost of a strategy, which measures the resources required in terms of ancillary dimension. We provide a condition for the cost to be equal to a given value, and we use this result to evaluate the cost in some special cases. As an example we show that any covariant protocol for the cloning of a unitary transformation requires at most one ancillary qubit. We also prove that the memory cost has to be determined globally, and cannot be calculated by optimizing the resources independently at each step of the strategy.

Alessandro Bisio; Giacomo Mauro D'Ariano; Paolo Perinotti; Michal Sedlak

2011-12-16T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

VEHICLE ACCESS PORTALS  

NLE Websites -- All DOE Office Websites (Extended Search)

East Jemez Road (Map 1) East Jemez Road (Map 1) VEHICLE ACCESS PORTALS Traffic Lane 1: Closed except for emergencies and maintenance operations. Traffic Lanes 2-7: Drivers required to stop and present LANL badges or other form of valid identification to Protective Force officers. Drivers may proceed upon direction of the officers. Note: Commercial delivery vehicle drivers must also pres- ent their inspection passes from Post 10. More Information: spp-questions@lanl.gov Non-work Hours Vehicles entering LANL at the East Jemez VAPs during non-work hours (between 7

202

THE HEART OF CAMPUS Memorial Union Building  

E-Print Network (OSTI)

THE HEART OF CAMPUS Memorial Union Building University of New Hampshire 83 Main Street Durham, NH The Memorial Union Building is "The Heart of Campus" and serves as the official New Hampshire State War

New Hampshire, University of

203

Design of Ferromagnetic Shape Memory Alloy Composites  

E-Print Network (OSTI)

, superelasticity, bending plate, coil spring. INTRODUCTION RECENTLY, FERROMAGNETIC SHAPE memory alloys (FSMAs torque actuator (bending of FSMA composite plate) and spring actuator (torsion of helical FSMA composite spring). KEY WORDS: shape memory alloy, ferromagnetic material, stress-induced martensite transformation

Taya, Minoru

204

Program Transformations in Weak Memory Models   

E-Print Network (OSTI)

We analyse the validity of common optimisations on multi-threaded programs in two memory models—the DRF guarantee and the Java Memory Model. Unlike in the single-threaded world, even simple program transformations, such ...

Sevcik, Jaroslav

2009-01-01T23:59:59.000Z

205

Effect of Negative Emotional Content on Working Memory and Long-Term Memory  

E-Print Network (OSTI)

Effect of Negative Emotional Content on Working Memory and Long-Term Memory Elizabeth A. Kensinger and Suzanne Corkin Massachusetts Institute of Technology In long-term memory, negative information is better remembered than neutral information. Differences in processes important to working memory may contribute

Corkin, Suzanne

206

A Memory Hierarchical Layer Assigning and Prefetching Technique to Overcome the Memory Performance/Energy Bottleneck  

E-Print Network (OSTI)

A Memory Hierarchical Layer Assigning and Prefetching Technique to Overcome the Memory Performance thanail@ee.duth.gr Abstract The memory subsystem has always been a bottleneck in performance as well as significant power contributor in memory intensive applications. Many researchers have pre- sented multi

Paris-Sud XI, Université de

207

A Partial Memory Protection Scheme for Higher Effective Yield of Embedded Memory for Video Data  

E-Print Network (OSTI)

A Partial Memory Protection Scheme for Higher Effective Yield of Embedded Memory for Video Data the on-chip embedded memory will occupy most of the silicon real estate. As the technology proceeds into very deep submicron, the yield of SoCs will drop sharply mainly because of the on-chip memory failure

Eltawil, Ahmed

208

Memory . Author manuscript Episodic memory deficits slow down the dynamics of cognitive procedural  

E-Print Network (OSTI)

Memory . Author manuscript Page /1 10 Episodic memory deficits slow down the dynamics of cognitive, each involving distinct processes. Considering the implication of the episodic memory in the first cognitive stage, the impairment of this memory system might be responsible for a slowing down

Paris-Sud XI, Université de

209

Open Access Transmission Tariff  

NLE Websites -- All DOE Office Websites (Extended Search)

Transmission | OATT Transmission | OATT Skip Navigation Links Transmission Functions Infrastructure projects Interconnection OASIS OATT Western Open Access Transmission Service Tariff Revision Western Area Power Administration submitted its revised Open Access Transmission Service Tariff with the Federal Energy Regulatory Commission on Sept. 30, 2009. The tariff became effective on Dec. 1, 2009, as modified by Western's March 2, 2011 compliance filing. The revised tariff was developed to comply with FERC Order No. 890 and to be consistent with Western's statutory and regulatory requirements. It addresses changes in transmission services and planning. FERC issued an order on Dec. 2, 2010, granting Western's petition for a Declaratory Order approving the tariff as an acceptable reciprocity tariff, subject to Western making a compliance filing within 30 days to address items in Attachment C, Attachment P and Attachment Q. Western made its compliance filing on March 2, 2010, addressing FERC's Dec. 2, 2010, order. FERC accepted Western's March 2, 2011 compliance filing on April 25, 2011. Western has made several ministerial filings to its OATT as part of FERC's eTariff viewer system, the last of these was approved on March 29, 2013. Further detail can be found in the links below.Current OATT

210

Improving locality with dynamic memory allocation  

E-Print Network (OSTI)

xii LIST OF FIGURES FIGURE Page 1 Object size distribution : : : : : : : : : : : : : : : : : : : : : : : : : 23 2 Memory distribution : : : : : : : : : : : : : : : : : : : : : : : : : : : 23 3 Example where traditional memory allocation does.... The faster, more This dissertation follows the style of ACM Special Interest Group on Programming Languages. 1In spite of a recent slowdown of the processor speed due to shrinking distances, power consumption and heat, memory bandwidth still does not keep up...

Jula, Alin Narcis

2009-05-15T23:59:59.000Z

211

Shape memory polymer foams for endovascular therapies  

DOE Patents (OSTI)

A system for occluding a physical anomaly. One embodiment comprises a shape memory material body wherein the shape memory material body fits within the physical anomaly occluding the physical anomaly. The shape memory material body has a primary shape for occluding the physical anomaly and a secondary shape for being positioned in the physical anomaly.

Wilson, Thomas S. (Castro Valley, CA); Maitland, Duncan J. (Pleasant Hill, CA)

2012-03-13T23:59:59.000Z

212

Memory Optimization for Phase-field Simulations  

SciTech Connect

Phase-field simulations are computationally and memory intensive applications. Many of the phase-field simulations being conducted in support of NEAMS were not capable of running on “normal clusters” with 2-4GB of RAM per core, and instead required specialized “big-memory” clusters with 64GB per core. To address this issue, the MOOSE team developed a new Python-based utility called MemoryLogger, and applied it to locate, diagnose, and eradicate memory bottlenecks within the MOOSE framework. MemoryLogger allows for a better understanding of the memory usage of an application being run in parallel across a cluster. Memory usage information is captured for every individual process in a parallel job, and communicated to the head node of the cluster. Console text output from the application itself is automatically matched with this memory usage information to produce a detailed picture of memory usage over time, making it straightforward to identify the subroutines which contribute most to the application’s peak memory usage. The information produced by the MemoryLogger quickly and effectively narrows the search for memory optimizations to the most data-intensive parts of the simulation.

Derek Gaston; John Peterson; Andrew Slaughter; Cody Permann; David Andrs

2014-08-01T23:59:59.000Z

213

Memory consolidation and reconsolidation: what is the  

E-Print Network (OSTI)

Memory consolidation and reconsolidation: what is the role of sleep? Robert Stickgold and Matthew P Deaconess Medical Center E/FD 861, 330 Brookline Avenue, Boston MA 02215, USA Memory consolidation and reconsolidation reflect mol- ecular, cellular and systems-level processes that convert labile memory

Walker, Matthew P.

214

The Cognitive Neuroscience of Human Memory  

E-Print Network (OSTI)

The Cognitive Neuroscience of Human Memory Since H.M. Larry R. Squire1,2,3,4 and John T. Wixted4 1 about the organization of memory that inspired decades of experi- mental work. Since H.M., the study of human memory and its disorders has continued to yield new insights and to improve understanding

Squire, Larry R.

215

Long memory and changing persistence Robinson Kruse  

E-Print Network (OSTI)

Long memory and changing persistence Robinson Kruse and Philipp Sibbertsen August 2010 Abstract We study the empirical behaviour of semi-parametric log-periodogram estimation for long memory models when suggest that evidence for long memory is likely to be found. A recently proposed test by Sibbertsen

Weber, Stefan

216

Deferred Involvement: Memories and Praxes of Iraqi Intellectuals as Civil-Society Activists between Iraq, Jordan and Syria  

E-Print Network (OSTI)

between Iraq, Jordan and Syria Paper prepared for the workshop on Memories of Iraq May 1st -2nd , 2009 limited by the lack of direct access the author had to Iraq in the 1990s. Looking specifically at state intelligentsia started finding its way inside Iraq at a time when the coercive apparatus of the regime loosened

Paris-Sud XI, Université de

217

Gifts in Memory of LEHIGH UNIVERSITY 1 ACRIA, in memory of  

E-Print Network (OSTI)

Gifts in Memory of LEHIGH UNIVERSITY 1 ACRIA, in memory of Winifred Duane `41W `73P `76P Actnow Pac Inc., in memory of Winifred Duane `41W `73P `76P Mary E. Adelman, in memory of Joseph M. King, Jr. `61 `95P Ralph P. Adkins, in memory of Joseph M. King, Jr. `61 `95P Alan J & Susan A Fuirst Philanthropic

Gilchrist, James F.

218

Configurable memory system and method for providing atomic counting operations in a memory device  

DOE Patents (OSTI)

A memory system and method for providing atomic memory-based counter operations to operating systems and applications that make most efficient use of counter-backing memory and virtual and physical address space, while simplifying operating system memory management, and enabling the counter-backing memory to be used for purposes other than counter-backing storage when desired. The encoding and address decoding enabled by the invention provides all this functionality through a combination of software and hardware.

Bellofatto, Ralph E. (Ridgefield, CT); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Ohmacht, Martin (Yorktown Heights, NY)

2010-09-14T23:59:59.000Z

219

Access to UCNI | Department of Energy  

Office of Environmental Management (EM)

Access to UCNI Access to UCNI An authorized person see 1017.20(a) may grant routine access to UCNI to eligible individuals. In order to be eligible for routine access, the...

220

Safeguarding Quantum Key Distribution through Detection Randomization  

E-Print Network (OSTI)

We propose and experimentally demonstrate a scheme to render the detection apparatus of a Quantum Key Distribution system immune to the main classes of hacking attacks in which the eavesdropper explores the back-door opened by the single-photon detectors. The countermeasure is based on the creation of modes that are not deterministically accessible to the eavesdropper. We experimentally show that the use of beamsplitters and extra single-photon detectors at the receiver station passively creates randomized spatial modes that erase any knowledge the eavesdropper might have gained when using bright-light faked states. Additionally, we experimentally show a detector-scrambling approach where the random selection of the detector used for each measurement - equivalent to an active spatial mode randomization - hashes out the side-channel open by the detection efficiency mismatch-based attacks. The proposed combined countermeasure represents a practical and readily implementable solution against the main classes of quantum hacking attacks aimed on the single-photon detector so far, without intervening on the inner working of the devices.

Thiago Ferreira da Silva; Gustavo C. do Amaral; Guilherme B. Xavier; Guilherme P. Temporão; Jean Pierre von der Weid

2014-10-02T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

R. A. Fisher Memorial Appeal  

Science Journals Connector (OSTI)

... SIR JOHN GADDTJM, chairman of the Sir Ronald Fisher Memorial Committee of Great Britain, writes:"R. A. Fisher ranks among ... host of applications of the most practical kind. The University of Adelaide, where Sir Ronald spent his last years, has already established a Sir ...

1964-06-13T23:59:59.000Z

222

Targeting Atmospheric Simulation Algorithms for Large Distributed Memory GPU Accelerated Computers  

SciTech Connect

Computing platforms are increasingly moving to accelerated architectures, and here we deal particularly with GPUs. In [15], a method was developed for atmospheric simulation to improve efficiency on large distributed memory machines by reducing communication demand and increasing the time step. Here, we improve upon this method to further target GPU accelerated platforms by reducing GPU memory accesses, removing a synchronization point, and better clustering computations. The modification ran over two times faster in some cases even though more computations were required, demonstrating the merit of improving memory handling on the GPU. Furthermore, we discover that the modification also has a near 100% hit rate in fast on-chip L1 cache and discuss the reasons for this. In concluding, we remark on further potential improvements to GPU efficiency.

Norman, Matthew R [ORNL

2013-01-01T23:59:59.000Z

223

Template Discontinuation Access  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

FOR SUBJECT FOR SUBJECT FROM: Personnel Security Program Manager SUBJECT: Discontinuation of Access Eligibility Determination Reference is made to your Questionnaire for National Security Positions signed on [insert date], which was forwarded to this office in connection with a Department of Energy security clearance request. A review of that form disclosed recent use of illegal drugs. [Insert a brief description of the circumstances such as: Specifically, you listed marijuana use 1 time in 5/02; 1 time in 2/03; and 1 time in 3/07.] This office has discontinued the personnel security processing of your security clearance due to your illegal drug usage within twelve months of the signing of your security clearance application.

224

NSLS User Access | Training  

NLE Websites -- All DOE Office Websites (Extended Search)

Training Training Training for New Users and Users with Expired Training and/or Badges: All new users and users with expired badges must complete or update the training modules shown below prior to access to the experimental floor. The training can be completed online prior to arrival at the NSLS and is strongly recommended to save considerable time during check-in at the Guest, User, Visitor (GUV) Center in Building 400. Please note each training module is followed by an exam which asks for your name and guest number. If you do not already have a guest number, leave this entry blank. All new users and users with expired badges MUST arrive on a weekday (no weekends or holidays) and check in at the GUV Center so that your training can be verified and to receive a photo ID badge (new or updated). The GUV

225

COS DCE Memory Regions (for Memory Monitor purposes) COS DCE Memory Monitors may select one of three regions: CODE space, External RAM  

E-Print Network (OSTI)

COS DCE Memory Regions (for Memory Monitor purposes) COS DCE Memory Monitors may select one-cut. Within the 8051, the CODE space and XDATA space are separate memory devices unless, by design, a common memory device is used. Both have an address range of 64KB (0000-FFFF). For the COS DCE, below the 16KB

Colorado at Boulder, University of

226

Laboratory Access | Sample Preparation Laboratories  

NLE Websites -- All DOE Office Websites (Extended Search)

Access Access Planning Ahead Planning Ahead Please complete the Beam Time Request (BTR) and Support Request forms thourgh the User Portal. Thorough chemical and sample information must be included in your BTR. Support Request forms include a list of collaborators that require laboratory access and your group's laboratory equipment requests. Researcher safety is taken seriously at SLAC. Please remember that radioactive materials, nanomaterials, and biohazardous materials have additional safety requirements. Refer to the SSRL or LCLS Safety Offices for further guidance. Upon Arrival Upon Arrival Once you arrive you must complete training and access forms before accessing the Sample Preparation Laboratories (SPL). All Sample Prep Lab doors are locked with access key codes. Once your SPL

227

Efficient Exploitation of Kernel Access to Infiniband: a Software DSM Example Liran Liss, Yitzhak Birk and Assaf Schuster  

E-Print Network (OSTI)

1 Efficient Exploitation of Kernel Access to Infiniband: a Software DSM Example Liran Liss, Yitzhak of these services. We assess this approach using a sequential-consistency Distributed Shared Memory (DSM) system the primitives to form a kernel DSM protocol. The approach is evaluated using our full-fledged Linux kernel DSM

228

Vehicle barrier with access delay  

DOE Patents (OSTI)

An access delay vehicle barrier for stopping unauthorized entry into secure areas by a vehicle ramming attack includes access delay features for preventing and/or delaying an adversary from defeating or compromising the barrier. A horizontally deployed barrier member can include an exterior steel casing, an interior steel reinforcing member and access delay members disposed within the casing and between the casing and the interior reinforcing member. Access delay members can include wooden structural lumber, concrete and/or polymeric members that in combination with the exterior casing and interior reinforcing member act cooperatively to impair an adversarial attach by thermal, mechanical and/or explosive tools.

Swahlan, David J; Wilke, Jason

2013-09-03T23:59:59.000Z

229

Storage Techniques in Flash Memories and Phase-change Memories  

E-Print Network (OSTI)

advice on research, writing, and presentation. Without Andrew?s encouragement and help during the difficult times in my PhD study, this dissertation would not have been possible. I would like to thank Dr. Jennifer Welch, Dr. Jianer Chen, and Dr. Alex... . . . . . . . . . . . . . . . . 4 1. Principles and Operations in Flash Memories . . . . . 4 a. Read Operation . . . . . . . . . . . . . . . . . . . 5 b. Programming Operation . . . . . . . . . . . . . . 5 c. Erase Operation . . . . . . . . . . . . . . . . . . . 6 d. Decreasing...

Li, Hao

2010-10-12T23:59:59.000Z

230

Mobile Information Access M. Satyanarayanan  

E-Print Network (OSTI)

Carnegie Mellon University Pittsburgh, PA 15213 To appear in IEEE Personal Communications, Volume 3, No. 1, February 1996 Abstract The ability to access information on demand when mobile will be a criticalMobile Information Access M. Satyanarayanan January 1996 CMU­CS­96­107 School of Computer Science

231

Efficient checkpointing schemes for depletion perturbation solutions on memory-limited architectures  

SciTech Connect

We describe a methodology for decreasing the memory footprint and machine I/O load associated with the need to access a forward solution during an adjoint solve. Specifically, we are interested in the depletion perturbation equations, where terms in the adjoint Bateman and transport equations depend on the forward flux solution. Checkpointing is the procedure of storing snapshots of the forward solution to disk and using these snapshots to recompute the parts of the forward solution that are necessary for the adjoint solve. For large problems, however, the storage cost of just a few copies of an angular flux vector can exceed the available RAM on the host machine. We propose a methodology that does not checkpoint the angular flux vector; instead, we write and store converged source moments, which are typically of a much lower dimension than the angular flux solution. This reduces the memory footprint and I/O load of the problem, but requires that we perform single sweeps to reconstruct flux vectors on demand. We argue that this trade-off is exactly the kind of algorithm that will scale on advanced, memory-limited architectures. We analyze the cost, in terms of FLOPS and memory footprint, of five checkpointing schemes. We also provide computational results that support the analysis and show that the memory-for-work trade off does improve time to solution. (authors)

Stripling, H. F.; Adams, M. L.; Hawkins, W. D. [Texas A and M University, Department of Nuclear Engineering, 3133 TAMU, College Station, TX 77843-3133 (United States)

2013-07-01T23:59:59.000Z

232

Randomly coupled Ising models  

Science Journals Connector (OSTI)

We consider the phase diagram of two randomly coupled Ising models to mimic the successive phase transitions in plastic crystals. Detailed mean-field calculations are performed. Depending on the strength of the couplings, the phase diagrams display three ordered phases and some multicritical points. A tetracritical point is found to turn bicritical as the strength of the couplings increases. The nature of this multicritical point is then analyzed by means of a momentum-space renormalization-group calculation. Using the replica trick, we obtain an effective n-component spin Hamiltonian. The random coupling is found to be relevant and shown to have drastic effects on the multicritical behavior. The lower critical dimension is estimated to be dl=2. In the n=0 limit, to first order in the parameter ?=4-d, a system of seven recursion relations is obtained. Although there is a stable fixed point, it cannot be reached from physically acceptable initial conditions. We give arguments to support a runaway of the flow lines associated with a fluctuation-induced first-order transition.

S. Galam; S. R. Salinas; Y. Shapir

1995-02-01T23:59:59.000Z

233

Accelerated Randomized Benchmarking  

E-Print Network (OSTI)

Quantum information processing offers promising advances for a wide range of fields and applications, provided that we can efficiently assess the performance of the control applied in candidate systems. That is, we must be able to determine whether we have implemented a desired gate, and refine accordingly. Randomized benchmarking reduces the difficulty of this task by exploiting symmetries in quantum operations. Here, we bound the resources required for benchmarking and show that, with prior information, we can achieve several orders of magnitude better accuracy than in traditional approaches to benchmarking. Moreover, by building on state-of-the-art classical algorithms, we reach these accuracies with near-optimal resources. Our approach requires an order of magnitude less data to achieve the same accuracies and to provide online estimates of the errors in the reported fidelities. We also show that our approach is useful for physical devices by comparing to simulations. Our results thus enable the application of randomized benchmarking in new regimes, and dramatically reduce the experimental effort required to assess control fidelities in quantum systems. Finally, our work is based on open-source scientific libraries, and can readily be applied in systems of interest.

Christopher Granade; Christopher Ferrie; D. G. Cory

2014-04-21T23:59:59.000Z

234

Optical triangular-partition fuzzy systems with one-memory-matrix fuzzy associative memory  

Science Journals Connector (OSTI)

Taking advantage of the special properties of fuzzy sets, we propose that one-memory-matrix fuzzy associative memory can be used to realize triangular-partition fuzzy inference...

Zhang, Shuqun; Karim, Mohammad A

1999-01-01T23:59:59.000Z

235

Attachment and memory for negative emotional events  

E-Print Network (OSTI)

Control of Emotions on Explicit Memory. . . . . . Interaction of Anxiety X EEQ Positive Affect on Explicit Memory. . 50 51 51 Mediation Model 52 Interaction of Anxiety X Video Mood on Explicit Memory 52 Interaction of Avoidance X Sex on Imphcit... monitored their responses to the video content through a hidden camera in the laboratory room. The video clip, which came from the Swedish film Autumn Sonata directed by Ingmar Bergman, was selected on the basis of its negative, attachment-relevant content...

Wilson, Carol Leigh

2012-06-07T23:59:59.000Z

236

Silicon Nanowires for Non-Volatile Memory  

E-Print Network (OSTI)

Silicon Nanowires for Non-Volatile Memory P R O J E C T L E A D E R : Curt A. Richter (NIST) C O L approaches for silicon nanowire non-volatile memory. K E Y A C C O M P L I S H M E N T S Fabricated novel non-volatile memory cells with silicon nanowire channels and Al2 O3 /HfO2 /SiO2 gate dielectric storage stacks

237

Memory in the Small: An Application to Provide Task-Based Organizational Memory for a Scientific Community  

E-Print Network (OSTI)

Memory in the Small: An Application to Provide Task-Based Organizational Memory for a Scientific of organizational memory must exist embedded within the organizational processes and tasks. This paper argues that "memory-in-the small," memory utilized in the performance of an organizational task, can serve

Ackerman, Mark S.

238

Disorder-Induced Microscopic Magnetic Memory  

NLE Websites -- All DOE Office Websites (Extended Search)

point for future theories. The Persistence of Memory Magnets are not just for refrigerator doors-they are of paramount importance in today's digital information age. In the...

239

Memorandum Memorializing Ex Parte Communication - August 12,...  

Energy Savers (EERE)

Memorandum Memorializing Ex Parte Communication - August 12, 2011 On August 9, 2011, the Air-Conditioning, Heating and Refrigeration Institute's (AHRI) Unitary Small Engineering...

240

Immunological Memory is Associative Derek J. Smith  

E-Print Network (OSTI)

Immunological Memory is Associative Derek J. Smith Department of Computer Science University of New , 1989; Nara & Goudsmit, 1990; Smith, 1994). Immunologists refer to associative recall as a cross

Somayaji, Anil

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Determining Memory Use | Argonne Leadership Computing Facility  

NLE Websites -- All DOE Office Websites (Extended Search)

Allinea DDT Core File Settings Determining Memory Use Using VNC with a Debugger bgqstack gdb Coreprocessor TotalView on BGQ Systems Performance Tools & APIs Software & Libraries...

242

Shape memory response of ni2mnga and nimncoin magnetic shape memory alloys under compression  

E-Print Network (OSTI)

In this study, the shape memory response of Ni2MnGa and NiMnCoIn magnetic shape memory alloys was observed under compressive stresses. Ni2MnGa is a magnetic shape memory alloy (MSMA) that has been shown to exhibit fully reversible, stressassisted...

Brewer, Andrew Lee

2009-05-15T23:59:59.000Z

243

Separable states improve protocols with restricted randomness  

E-Print Network (OSTI)

It is known from Bell's theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers operating on a potentially infinite number of correlated bits originating from a common source. As such, Bell inequality violations achieved through entangled states are able to characterise the quantum advantage of certain tasks, so long as the task itself imposes no restriction on the availability of correlated bits. However, if the number of shared bits is limited, additional constraints are placed on the possible LHV models and separable, i.e. disentangled, states may become a useful resource. Bell violations are therefore no longer necessary to achieve a quantum advantage. Here we show that in particular, separable states may improve the so-called random access codes, which is a class of communication problems where one party tries to read a portion of the data held by another distant party in presence of finite shared randomness and limited classical communication. We also show how the bias of classical bits can be used to avoid wrong answers in order to achieve the optimal classical protocol and how the advantage of quantum protocols is linked to quantum discord.

T. K. Chuan; T. Paterek

2014-10-07T23:59:59.000Z

244

Revised 30/04/2014 Lecture 12 -Memory  

E-Print Network (OSTI)

1 Revised 30/04/2014 Lecture 12 - Memory The Physiology of the Senses www.tutis.ca/Senses/ Contents ............................................................................................................ 2 Types of Memory............................................................................................................ 2 Mechanisms of Learning Procedural Memories

Vilis, Tutis

245

Memory Dynamics in Cross-Situational Statistical Learning  

E-Print Network (OSTI)

effect in young children’s memory and category induction.F. (1977). Infant recognition memory: Studies in forgetting.Psychology: Learning, Memory, & Cognition, 38, 246-254. doi:

Vlach, Haley Amelia Heublein

2012-01-01T23:59:59.000Z

246

Memory Slain: Recovering Cultural Heritage in Post-war Bosnia  

E-Print Network (OSTI)

Abdelaziz, A. (1995). Memory of the world—Preserving theIn J. W. Müller (Ed. ), Memory and power in post-war Europe:and constructs of social memory. Archival Issues, 24(2),

Supple, Shannon

2005-01-01T23:59:59.000Z

247

Exercise enhances memory consolidation in the aging brain  

E-Print Network (OSTI)

Persistence of long-term memory storage requires a lateSpatial reference and working memory across the lifespan ofRats depend on habit memory for discrimination learning and

Snigdha, Shikha; de Rivera, Christina; Milgram, Norton W; Cotman, Carl W

2014-01-01T23:59:59.000Z

248

Notices Accessible Format: Individuals with  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

472 Federal Register 472 Federal Register / Vol. 77, No. 83 / Monday, April 30, 2012 / Notices Accessible Format: Individuals with disabilities can obtain this document in an accessible format (e.g., braille, large print, audiotape, or computer diskette) on request to the program contact person listed under FOR FURTHER INFORMATION CONTACT. Electronic Access to This Document: The official version of this document is the document published in the Federal Register. Free Internet access to the official edition of the Federal Register and the Code of Federal Regulations is available via the Federal Digital System at: www.gpo.gov/fdsys. At this site you can view this document, as well as all other documents of this Department published in the Federal Register, in text or Adobe Portable Document

249

Florida Capital Access Program (Florida)  

Energy.gov (U.S. Department of Energy (DOE))

The Florida Capital Access Program, run by the Florida Department of Economic Development, is a loan portfolio insurance program enabling lenders to make loans to credit-worthy small businesses. ...

250

Categorical Exclusion for Access Road  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Access Road Access Road Improvements along the Pinnacle Peak- Prescott 230-kV Transmission Line between Structures 16813 and 170/1 Yavapai County. Arizona * RECORD OF CATEGORICAL EXCLUSION DETERMINATION A. Proposed Action: Western proposes to improve access roads along a portion of the Pinnacle Peak to Prescott 230-kV Transmission Line (Structures 168/3 and 170/1). which are currently impassable. to maintain worker safety and the reliability of the bulk electric system. Western plans to blade and grade the existing access road where it enters and leaves three washes so that Western's maintenance vehicles can drive across the washes. We will remove dirt from the road prism by starting at wash edges and pulling dirt up slope in order to create ramps with grades suitable for our equipment.

251

2e Carbon Access | Open Energy Information  

Open Energy Info (EERE)

Access Jump to: navigation, search Name: 2e Carbon Access Place: New York, New York Zip: 10280 Sector: Carbon Product: 2E Carbon Access is an enterprise focused solely on bringing...

252

Models on Distributed Memory Architectures  

NLE Websites -- All DOE Office Websites (Extended Search)

5/2004 Y.He 1 5/2004 Y.He 1 MPH: a Library for Coupling Multi-Component Models on Distributed Memory Architectures and its Applications Yun (Helen) He and Chris Ding CRD Division Lawrence Berkeley National Laboratory 10/15/2004 Y.He 2 10/15/2004 Y.He 3 Motivation n Application problems grow in scale & complexity n Effective organization of simulation software system that is maintainable, reusable, sharable, and efficient è a major issue n Community Climate System Model (CCSM) development n Software lasts much longer than a computer! 10/15/2004 Y.He 4

253

Detecting/Preventing Information Leakage on the Memory Bus due to Malicious Hardware 1  

E-Print Network (OSTI)

place given surreptitious processor writes to memory. Malicious memory reads can be essentially ignored

Kuzmanovic, Aleksandar

254

COMPUTING THE DRIFT OF RANDOM WALKS IN DEPENDENT RANDOM ENVIRONMENTS  

E-Print Network (OSTI)

new theory and methodology for the computation of the drift of the random walk for various depen- dent for RWREs was laid by Solomon [13], who proved conditions for recurrence/transience for one with independent random environments. The purpose of this paper is to develop theory and methodology

Kroese, Dirk P.

255

Packing Hamilton Cycles in Random and Pseudo-Random Hypergraphs  

E-Print Network (OSTI)

Packing Hamilton Cycles in Random and Pseudo-Random Hypergraphs Alan Frieze Michael Krivelevich February 16, 2011 Abstract We say that a k-uniform hypergraph C is a Hamilton cycle of type , for some 1 Hamilton cycles. A slightly weaker result is given for = k/2. We also provide sufficient conditions

Krivelevich, Michael

256

Memory-like CD8? T cells generated during homeostatic proliferation defer to antigen-experienced memory cells  

E-Print Network (OSTI)

for CD8 T- cell priming, memory generation and maintenance.Marzo. 2006. The descent of memory T-cell subsets. Nat RevHomeostasis of naive and memory T cells. Immunity 29:848-

Cheung, Kitty Pui Hang

2009-01-01T23:59:59.000Z

257

International Electricity Trade - Open Access | Department of...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

International Electricity Trade - Open Access International Electricity Trade - Open Access DOE has consistently expressed its policy that international electricity trade should be...

258

Chapter_12_Special_Access_Programs  

Office of Environmental Management (EM)

2 Special Access Programs This chapter describes the DOE Special Access Program (SAP) at DOE HQ and implements the requirements of: * Executive Order 13526, Classified National...

259

NBP RFI: Data Access | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

the National Broadband Plan by Empowering Customers and the Smart Grid: Data Access, Third Party Use, and Privacy NBP RFI: Data Access More Documents & Publications...

260

T-622: Adobe Acrobat and Reader Unspecified Memory Corruption...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2: Adobe Acrobat and Reader Unspecified Memory Corruption Vulnerability T-622: Adobe Acrobat and Reader Unspecified Memory Corruption Vulnerability May 13, 2011 - 3:25am Addthis...

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

T-569: Adobe Flash SWF File Processing Memory Corruption Remote...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

69: Adobe Flash SWF File Processing Memory Corruption Remote Code Execution Vulnerability T-569: Adobe Flash SWF File Processing Memory Corruption Remote Code Execution...

262

DOE - Office of Legacy Management -- Memorial Hospital - NY 0...  

Office of Legacy Management (LM)

Memorial Hospital - NY 0-16 FUSRAP Considered Sites Site: MEMORIAL HOSPITAL (NY.0-16 ) Eliminated from consideration under FUSRAP Designated Name: Not Designated Alternate Name:...

263

Consent Order, Battelle Memorial Institute - October 24, 2014...  

Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

Battelle Memorial Institute - October 24, 2014 October 24, 2014 Worker Safety and Health Enforcement Consent Order issued to Battelle Memorial Institute for deficiencies...

264

Y-12 historian assists in Lincoln Memorial University display...  

National Nuclear Security Administration (NNSA)

assists in Lincoln Memorial University display design NNSA Blog Y-12 historian Ray Smith, left, joins Lincoln Memorial University board of trustees chairman Pete DeBusk in...

265

Whirlpools on the Nanoscale Could Multiply Magnetic Memory  

NLE Websites -- All DOE Office Websites (Extended Search)

Whirlpools on the Nanoscale Could Multiply Magnetic Memory Whirlpools on the Nanoscale Could Multiply Magnetic Memory Print Tuesday, 21 May 2013 00:00 Research at the Advanced...

266

V-176: Adobe Flash Player Memory Corruption Flaw Lets Remote...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: Adobe Flash Player Memory Corruption Flaw Lets Remote Users Execute Arbitrary Code V-176: Adobe Flash Player Memory Corruption Flaw Lets Remote Users Execute Arbitrary Code June...

267

V-018: Adobe Flash Player Buffer Overflows and Memory Corruption...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: Adobe Flash Player Buffer Overflows and Memory Corruption Errors Let Remote Users Execute Arbitrary Code V-018: Adobe Flash Player Buffer Overflows and Memory Corruption Errors...

268

Situating ethics and memory. by Wilma Koutstaal  

E-Print Network (OSTI)

Situating ethics and memory. by Wilma Koutstaal Ethics and memory are better regarded as partially of the idea of forgetting the distinction between right and wrong, makes ethical knowledge too isolated from other kinds of knowledge. Considerations such as the role played by reminding in inculcating ethics

Koutstaal, Wilma

269

Tier identification (TID) for tiered memory characteristics  

DOE Patents (OSTI)

A tier identification (TID) is to indicate a characteristic of a memory region associated with a virtual address in a tiered memory system. A thread may be serviced according to a first path based on the TID indicating a first characteristic. The thread may be serviced according to a second path based on the TID indicating a second characteristic.

Chang, Jichuan; Lim, Kevin T; Ranganathan, Parthasarathy

2014-03-25T23:59:59.000Z

270

Memory and Reality Marcia K. Johnson  

E-Print Network (OSTI)

Memory and Reality Marcia K. Johnson Yale University Although it may be disconcerting guilty that we didn't save any for my father (Johnson, 1985). When I finished, my parents laughed in reality monitoring, or a false memory (Johnson, 1977, 1988; Johnson & Raye, 1981, 1998). Of course, people

Johnson, Marcia K.

271

Path Delay Test Through Memory Arrays  

E-Print Network (OSTI)

Memory arrays cannot be as easily tested as other storage elements in a chip. Most of the flip-flops (FFs) in a chip can be replaced by scan cells in scan-based design. However, the bits in memory arrays cannot be replaced by scan cells, due...

Pokharel, Punj

2013-07-29T23:59:59.000Z

272

Shape memory polymer actuator and catheter  

DOE Patents (OSTI)

An actuator system is provided for acting upon a material in a vessel. The system includes an optical fiber and a shape memory polymer material operatively connected to the optical fiber. The shape memory polymer material is adapted to move from a first shape for moving through said vessel to a second shape where it can act upon said material.

Maitland, Duncan J. (Pleasant Hill, CA); Lee, Abraham P. (Walnut Creek, CA); Schumann, Daniel L. (Concord, CA); Matthews, Dennis L. (Moss Beach, CA); Decker, Derek E. (Byron, CA); Jungreis, Charles A. (Pittsburgh, PA)

2007-11-06T23:59:59.000Z

273

Web-based random variate generation for stochastic simulations  

Science Journals Connector (OSTI)

This paper presents a random variate generation (RVG) world wide web (web) service and an RVG web-based software application, both of which are developed in compliance with the Java 2 Enterprise Edition (J2EE) architecture and run under the IBM WebSphere Application Server. The RVG web service can be invoked programmatically over the web by using simple object access protocol (SOAP) through the hyper text transfer protocol (HTTP) using the extensible markup language (XML). The RVG web service and software both generate random variates from 27 probability distributions and provide general statistics, scatter plot, and histogram of the requested random variates. The plots and histograms are created in the scalable vector graphics (SVG) format. The RVG web service can be used for stochastic input data modelling of a web-based simulation. The RVG software can be used as a web-based application for a variety of purposes including teaching random variate generation, probabilistic modelling and random experimentation.

Mohammad Sabah; Osman Balci

2005-01-01T23:59:59.000Z

274

Memory effects in turbulent transport  

E-Print Network (OSTI)

In the mean-field theory of magnetic fields, turbulent transport, i.e. the turbulent electromotive force, is described by a combination of the alpha effect and turbulent magnetic diffusion, which are usually assumed to be proportional respectively to the mean field and its spatial derivatives. For a passive scalar there is just turbulent diffusion, where the mean flux of concentration depends on the gradient of the mean concentration. However, these proportionalities are approximations that are valid only if the mean field or the mean concentration vary slowly in time. Examples are presented where turbulent transport possesses memory, i.e. where it depends crucially on the past history of the mean field. Such effects are captured by replacing turbulent transport coefficients with time integral kernels, resulting in transport coefficients that depend effectively on the frequency or the growth rate of the mean field itself. In this paper we perform numerical experiments to find the characteristic timescale (or memory length) of this effect as well as simple analytical models of the integral kernels in the case of passive scalar concentrations and kinematic dynamos. The integral kernels can then be used to find self-consistent growth or decay rates of the mean fields. In mean-field dynamos the growth rates and cycle periods based on steady state values of alpha effect and turbulent diffusivity can be quite different from the actual values.

Alexander Hubbard; Axel Brandenburg

2008-11-17T23:59:59.000Z

275

ETTP Security Access Control System (ESACS) | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

ETTP Security Access Control System (ESACS) ETTP Security Access Control System (ESACS) ETTP Security Access Control System (ESACS) ETTP Security Access Control System (ESACS) More...

276

Performing an allreduce operation using shared memory  

DOE Patents (OSTI)

Methods, apparatus, and products are disclosed for performing an allreduce operation using shared memory that include: receiving, by at least one of a plurality of processing cores on a compute node, an instruction to perform an allreduce operation; establishing, by the core that received the instruction, a job status object for specifying a plurality of shared memory allreduce work units, the plurality of shared memory allreduce work units together performing the allreduce operation on the compute node; determining, by an available core on the compute node, a next shared memory allreduce work unit in the job status object; and performing, by that available core on the compute node, that next shared memory allreduce work unit.

Archer, Charles J. (Rochester, MN); Dozsa, Gabor (Ardsley, NY); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

2012-04-17T23:59:59.000Z

277

Quantum memory in non-inertial frames  

E-Print Network (OSTI)

We study the effect of quantum memory in non-inertial frames under the influence of amplitude damping, depolarizing, phase flip and bit-phase flip channels. It is shown that the entanglement of initial state is heavily influenced by quantum correlations. It is seen that quantum memory compensates the loss of entanglement generated caused by the Unruh effect. It is interesting to note that the sudden death of entanglement disappears for any acceleration for higher values of memory. Therefore, it is possible to avoid ESD in non-inertial frames due to the presence of quantum memory. Furthermore, the degree of entanglement is enhanced as we increase the degree of memory and it maximizes for maximum correlations.

M. Ramzan; M. K. Khan

2011-01-15T23:59:59.000Z

278

Adiabatic Quantum Optimization for Associative Memory Recall  

E-Print Network (OSTI)

Hopfield networks are a variant of associative memory that recall information stored in the couplings of an Ising model. Stored memories are fixed points for the network dynamics that correspond to energetic minima of the spin state. We formulate the recall of memories stored in a Hopfield network using energy minimization by adiabatic quantum optimization (AQO). Numerical simulations of the quantum dynamics allow us to quantify the AQO recall accuracy with respect to the number of stored memories and the noise in the input key. We also investigate AQO performance with respect to how memories are stored in the Ising model using different learning rules. Our results indicate that AQO performance varies strongly with learning rule due to the changes in the energy landscape. Consequently, learning rules offer indirect methods for investigating change to the computational complexity of the recall task and the computational efficiency of AQO.

Hadayat Seddiqi; Travis S. Humble

2014-07-07T23:59:59.000Z

279

Data Movement Dominates: Advanced Memory Technology to Address the Real Exascale Power Problem  

SciTech Connect

Energy is the fundamental barrier to Exascale supercomputing and is dominated by the cost of moving data from one point to another, not computation. Similarly, performance is dominated by data movement, not computation. The solution to this problem requires three critical technologies: 3D integration, optical chip-to-chip communication, and a new communication model. The central goal of the Sandia led "Data Movement Dominates" project aimed to develop memory systems and new architectures based on these technologies that have the potential to lower the cost of local memory accesses by orders of magnitude and provide substantially more bandwidth. Only through these transformational advances can future systems reach the goals of Exascale computing with a manageable power budgets. The Sandia led team included co-PIs from Columbia University, Lawrence Berkeley Lab, and the University of Maryland. The Columbia effort of Data Movement Dominates focused on developing a physically accurate simulation environment and experimental verification for optically-connected memory (OCM) systems that can enable continued performance scaling through high-bandwidth capacity, energy-efficient bit-rate transparency, and time-of-flight latency. With OCM, memory device parallelism and total capacity can scale to match future high-performance computing requirements without sacrificing data-movement efficiency. When we consider systems with integrated photonics, links to memory can be seamlessly integrated with the interconnection network-in a sense, memory becomes a primary aspect of the interconnection network. At the core of the Columbia effort, toward expanding our understanding of OCM enabled computing we have created an integrated modeling and simulation environment that uniquely integrates the physical behavior of the optical layer. The PhoenxSim suite of design and software tools developed under this effort has enabled the co-design of and performance evaluation photonics-enabled OCM architectures on Exascale computing systems.

Bergman, Keren

2014-08-28T23:59:59.000Z

280

Impact of a mHealth Intervention for Peer Health Workers on AIDS Care in Rural Uganda: A Mixed Methods Evaluation of a Cluster-Randomized Trial  

Science Journals Connector (OSTI)

Mobile phone access in low and middle-income countries is rapidly expanding and offers an opportunity to leverage limited human resources for health. We conducted a mixed methods evaluation of a cluster-randomize...

Larry W. Chang; Joseph Kagaayi; Hannah Arem; Gertrude Nakigozi…

2011-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Better Randomness with Single Photons  

E-Print Network (OSTI)

Randomness is one of the most important resources in modern information science, since encryption founds upon the trust in random numbers. Since it is impossible to prove if an existing random bit string is truly random, it is relevant that they be generated in a trust worthy process. This requires specialized hardware for random numbers, for example a die or a tossed coin. But when all input parameters are known, their outcome might still be predicted. A quantum mechanical superposition allows for provably true random bit generation. In the past decade many quantum random number generators (QRNGs) were realized. A photonic implementation is described as a photon which impinges on a beam splitter, but such a protocol is rarely realized with non-classical light or anti-bunched single photons. Instead, laser sources or light emitting diodes are used. Here we analyze the difference in generating a true random bit string with a laser and with anti-bunched light. We show that a single photon source provides more r...

Oberreiter, Lukas

2014-01-01T23:59:59.000Z

282

Bounded Randomness Paul Brodhead1  

E-Print Network (OSTI)

kmng@ntu.edu.sg Abstract. We introduce some new variations of the notions of being Martin-L¨of random effective betting, effective regularities or effective compression. Exactly what we mean here by "effective to calibrate no- tions of randomness by varying the notion of effectivity. For example, classical Martin

Ng, Keng Meng "Selwyn"

283

Memorials  

Science Journals Connector (OSTI)

...attempt was made for a cooperative reform of rock nomenclature, by reorganizing...more largely to your push and energy in the matter than to anything...for he was a man of surpassing energy and a voluminous writer. In...as reports on "The gems of Mexico," "The history of the gems...

284

Generating random thermal momenta  

E-Print Network (OSTI)

Generation of random thermal particle momenta is a basic task in many problems, such as microscopic studies of equilibrium and transport properties of systems, or the conversion of a fluid to particles. In heavy-ion physics, the (in)efficiency of the algorithm matters particularly in hybrid hydrodynamics + hadronic transport calculations. With popular software packages, such as UrQMD 3.3p1 or THERMINATOR, it can still take ten hours to generate particles for a single Pb+Pb "event" at the LHC from fluid dynamics output. Below I describe reasonably efficient simple algorithms using the MPC package, which should help speed momentum generation up by at least one order of magnitude. It is likely that this wheel has been reinvented many times instead of reuse, so there may very well exist older and/or better algorithms that I am not aware of (MPC has been around only since 2000). The main goal here is to encourage practitioners to use available efficient routines, and offer a few practical solutions.

Denes Molnar

2012-12-09T23:59:59.000Z

285

Synergistic Coupling of SSD and Hard Disk for QoS-aware Virtual Memory Ke Liu Xuechen Zhang Kei Davis Song Jiang  

E-Print Network (OSTI)

Alamos, NM 87545, USA Abstract--With significant advantages in capacity, power con- sumption, and price Institute of Technology Los Alamos National Laboratory Detroit, MI 48202, USA Atlanta, GA 30332, USA Los memory to the hard disk if they are expected to be read together. Using a history of page access patterns

Jiang, Song

286

Bibliography on transmission access issues  

SciTech Connect

This paper presents a bibliography on issues related to transmission access in electric power systems. There are 233 citations referenced in this bibliography. This bibliography presents a collection of selected literature on issues related to transmission access. It does not contain all of the material available on this subject or the categories contained herein. Some readers may feel that citations within this bibliography should be strictly limited to transmission system issues and not include energy pricing or reliability issues. However, it was the decision of the Subcommittee of the IEEE Task Force on Transmission Access and Nonutility Generation that selected entries relating to reliability and energy pricing, most relevant to transmission access, should be included. This decision was made because certain issues relating to reliability, transmission and energy pricing are perceived by the industry to be critical in the discussion of transmission access. The bibliography has been divided into the following sections or sub-sections: 2.0 Operational (Engineering) Issues, 3.0 Planning, 4.0 Reliability, 5.1 Economics: Costing, 5.2(a) Economics: Location-Differentiated Pricing, 5.2(b) Economics: Time-Differentiated Pricing, 5.3 Economics: Brokering, Bidding, and Auctioning, 6.0 Regulatory, and 7.0 General. Although the content of many publications spanned two or more of these sections, the desire to limit document length required that all publications be placed in the single most appropriate section. Publications are sorted according to author or publication resource.

Lankford, C.B. [Oklahoma Gas and Electric Co., Oklahoma City, OK (United States)] [Oklahoma Gas and Electric Co., Oklahoma City, OK (United States); McCalley, J.D. [Iowa State Univ., Ames, IA (United States)] [Iowa State Univ., Ames, IA (United States); Saini, N.K. [Entergy Services Corp., Metairie, LA (United States)] [Entergy Services Corp., Metairie, LA (United States)

1996-02-01T23:59:59.000Z

287

On the Construction of Random Number Generators and Random Function Generators  

Science Journals Connector (OSTI)

Blum, Micali (1982), Yao (1982), Goldreich, Goldwasser and Micali (1984), and Luby, Rackoff (1986) have constructed random number generators, random function generators and random permutation generators

C. P. Schnorr

1988-01-01T23:59:59.000Z

288

Identity, Credential, and Access Management (ICAM)  

Directives, Delegations, and Requirements

To establish requirements and responsibilities for DOE identity, credential, and access management program.

2013-02-19T23:59:59.000Z

289

Mahima Neupane Access to land resources  

E-Print Network (OSTI)

information followed the sustainable livelihood #12;Mahima Neupane Access to land resources framework (SLF

Richner, Heinz

290

Quantifiers for randomness of chaotic pseudo random number generators  

E-Print Network (OSTI)

We deal with randomness-quantifiers and concentrate on their ability do discern the hallmark of chaos in time-series used in connection with pseudo random number generators (PRNG). Workers in the field are motivated to use chaotic maps for generating PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we feel that the analysis provided here sheds additional didactic light on the importance of the main statistical characteristics of a chaotic map, namely, i) its invariant measure and ii) the mixing constant. This is of help in answering two questions that arise in applications, that is, (1) which is the best PRNG among the available ones? and (2) If a given PRNG turns out not to be good enough and a randomization procedure must still be applied to it, which is the best applicable randomization procedure?. Our answer provides a comparative analysis of several quantifiers advanced in the extant literature.

L. De Micco; H. A. Larrondo; A. Plastino; O. A. Rosso

2008-12-11T23:59:59.000Z

291

Data Access Reorganizations in Compiling Out-of-Core Data Parallel Programs on Distributed Memory Machines  

E-Print Network (OSTI)

that these op- timizations can reduce the amount of time spent in I/O by as much as an order of magnitude. 1) administered by US Army at Fort Huachuca. Program In-Core Phase Out-of-Core Phase Node Program Figure 1. Flow-Chart

Kuzmanovic, Aleksandar

292

Providing fast and safe access to next-generation, non- volatile memories  

E-Print Network (OSTI)

symposium on Computer architecture, pages 2–13, New York,In High Performance Computer Architecture (HPCA), 2011 IEEEsymposium on Computer architecture, pages 14–23, New York,

Coburn, Joel Dylan

2012-01-01T23:59:59.000Z

293

Automatic Memory Partitioning and Scheduling for Throughput and Power Optimization  

E-Print Network (OSTI)

- matic memory partitioning technique which can efficiently improve throughput and reduce energy to tackle this problem is to increase memory ports in the final memory imple- mentations. However, recent research in [16] shows that the size of memory cells increases almost quadratically with port number N

Cong, Jason "Jingsheng"

294

Memory Effects in Quantum Channel Discrimination Giulio Chiribella,1  

E-Print Network (OSTI)

Memory Effects in Quantum Channel Discrimination Giulio Chiribella,1 Giacomo M. D'Ariano,1 quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance

D'Ariano, Giacomo Mauro

295

Memory Intensive Computing Shahar Kvatinsky, Avinoam Kolodny, and Uri C.  

E-Print Network (OSTI)

Memory Intensive Computing Shahar Kvatinsky, Avinoam Kolodny, and Uri C. Weiser Department, New York 14627, USA Abstract-- Over the past years, new memory technologies such as RRAM, STT present these emerging memory technologies as enablers to the era of memory- intensive computing, which

Friedman, Eby G.

296

Chemical Memory DOI: 10.1002/anie.200600400  

E-Print Network (OSTI)

Chemical Memory DOI: 10.1002/anie.200600400 A Reaction­Diffusion Memory Device** Akiko Kaminaga, Vladimir K. Vanag, and Irving R. Epstein* Any computer consists of processor and memory elements. Patterns suggested as media for memory-storage devices.[6] The BZ system dispersed in a water-in-oil microemulsion

Epstein, Irving R.

297

MEMORY AWARE HIGH-LEVEL SYNTHESIS FOR EMBEDDED SYSTEMS  

E-Print Network (OSTI)

MEMORY AWARE HIGH-LEVEL SYNTHESIS FOR EMBEDDED SYSTEMS Gwenole Corre, Eric Senn, Nathalie Julien to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory mapping as a set of constraints for the synthesis, and defined

Paris-Sud XI, Université de

298

L3: Memory Hierarchy Optimization I, Locality and Data Placement  

E-Print Network (OSTI)

1/25/12 1 L3: Memory Hierarchy Optimization I, Locality and Data Placement CS6235 L3: Memory: Memory Hierarchy, 1 Overview of Lecture · Where data can be stored · And how to get/Write ­ Footprint of data · High level description of how to write code to optimize for memory hierarchy ­ More

Hall, Mary W.

299

Memory for events and their spatial context: models and experiments  

E-Print Network (OSTI)

Memory for events and their spatial context: models and experiments Neil Burgess1,2* , Suzanna Main Street West, Hamilton, Ontario L8S 4K1, Canada The computational role of the hippocampus in memory-limited store supporting neocortical long-term memory; and (iii) a content-addressable associative memory

Haykin, Simon

300

Securing non-volatile memory regions  

DOE Patents (OSTI)

Methods, apparatus and articles of manufacture to secure non-volatile memory regions are disclosed. An example method disclosed herein comprises associating a first key pair and a second key pair different than the first key pair with a process, using the first key pair to secure a first region of a non-volatile memory for the process, and using the second key pair to secure a second region of the non-volatile memory for the same process, the second region being different than the first region.

Faraboschi, Paolo; Ranganathan, Parthasarathy; Muralimanohar, Naveen

2013-08-20T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

Non-volatile memory for checkpoint storage  

DOE Patents (OSTI)

A system, method and computer program product for supporting system initiated checkpoints in high performance parallel computing systems and storing of checkpoint data to a non-volatile memory storage device. The system and method generates selective control signals to perform checkpointing of system related data in presence of messaging activity associated with a user application running at the node. The checkpointing is initiated by the system such that checkpoint data of a plurality of network nodes may be obtained even in the presence of user applications running on highly parallel computers that include ongoing user messaging activity. In one embodiment, the non-volatile memory is a pluggable flash memory card.

Blumrich, Matthias A.; Chen, Dong; Cipolla, Thomas M.; Coteus, Paul W.; Gara, Alan; Heidelberger, Philip; Jeanson, Mark J.; Kopcsay, Gerard V.; Ohmacht, Martin; Takken, Todd E.

2014-07-22T23:59:59.000Z

302

Memory for Light as a Quantum Process  

E-Print Network (OSTI)

We report complete characterization of an optical memory based on electromagnetically induced transparency. We recover the superoperator associated with the memory, under two different working conditions, by means of a quantum process tomography technique that involves storage of coherent states and their characterization upon retrieval. In this way, we can predict the quantum state retrieved from the memory for any input, for example, the squeezed vacuum or the Fock state. We employ the acquired superoperator to verify the nonclassicality benchmark for the storage of a Gaussian distributed set of coherent states.

M. Lobino; C. Kupchak; E. Figueroa; A. I. Lvovsky

2008-12-21T23:59:59.000Z

303

Memory Effect and Fast Spinodal Decomposition  

E-Print Network (OSTI)

We consider the modification of the Cahn-Hilliard equation when a time delay process through a memory function is taken into account. We then study the process of spinodal decomposition in fast phase transitions associated with a conserved order parameter. The introduced memory effect plays an important role to obtain a finite group velocity. Then, we discuss the constraint for the parameters to satisfy causality. The memory effect is seen to affect the dynamics of phase transition at short times and has the effect of delaying, in a significant way, the process of rapid growth of the order parameter that follows a quench into the spinodal region.

T. Koide; G. Krein; Rudnei O. Ramos

2007-08-28T23:59:59.000Z

304

Examination of a simple example of gravitational wave memory  

E-Print Network (OSTI)

We examine a simple example of gravitational wave memory due to the decay of a point particle into two point particles. In the case where one of the decay products is null, there are two types of memory: a null memory due to the null particle and an ordinary memory due to the recoiling timelike particle. In the case where both decay products are timelike, there is only ordinary memory. However, this ordinary memory can mimic the null memory in the limit where one of the decay products has a large velocity.

Tolish, Alexander; Garfinkle, David; Wald, Robert M

2014-01-01T23:59:59.000Z

305

Examination of a simple example of gravitational wave memory  

E-Print Network (OSTI)

We examine a simple example of gravitational wave memory due to the decay of a point particle into two point particles. In the case where one of the decay products is null, there are two types of memory: a null memory due to the null particle and an ordinary memory due to the recoiling timelike particle. In the case where both decay products are timelike, there is only ordinary memory. However, this ordinary memory can mimic the null memory in the limit where one of the decay products has a large velocity.

Alexander Tolish; Lydia Bieri; David Garfinkle; Robert M. Wald

2014-05-25T23:59:59.000Z

306

Shared access to quantum information  

Science Journals Connector (OSTI)

It is shown that quantum mechanics allows a qubit to be transferred so that it can be accessed symmetrically by two observers. These can then decide later which one is to take possession of the quantum information. The process is not fully successful, but a failed experiment may allow the retention of the quantum information for use in a subsequent operation.

Stig Stenholm and Erika Andersson

2000-09-11T23:59:59.000Z

307

Random time series in astronomy  

Science Journals Connector (OSTI)

...Thomas J. Maccarone Random time series in astronomy Simon Vaughan e-mail: simon.vaughan@leicester.ac.uk X-ray and Observational Astronomy Group, Department of Physics and Astronomy, University of Leicester, Leicester LE1...

2013-01-01T23:59:59.000Z

308

Randomized algorithms for reliable broadcast  

E-Print Network (OSTI)

In this thesis, we design randomized algorithms for classical problems in fault tolerant distributed computing in the full-information model. The full-information model is a strong adversarial model which imposes no ...

Vaikuntanathan, Vinod

2009-01-01T23:59:59.000Z

309

Randomization theorems for quantum channels  

E-Print Network (OSTI)

The classical randomization criterion is an important result of statistical decision theory. Recently, a quantum analogue has been proposed, giving equivalent conditions for two sets of quantum states, ensuring existence of a quantum channel mapping one set close to the other, in $L_1$-distance. In the present paper, we extend these concepts in several ways. First, sets of states are replaced by channels and randomization is performed by either post- or pre-composition with another channel. The $L_1$-distance is replaced by the diamond norm. Secondly, the maps are not required to be completely positive, but positivity is given by an admissible family of convex cones. It is shown that the randomization theorems, generalizing both quantum and classical randomization criteria, can be proved in the framework of base section norms, including the diamond norm and its dual. The theory of such norms is developed in the Appendix.

Anna Jencova

2014-04-15T23:59:59.000Z

310

Shared Memory And Distributed Shared Memory Systems: A Survey Krishna Kavi, Hyong-Shik Kim, University of Alabama in Huntsville  

E-Print Network (OSTI)

Shared Memory And Distributed Shared Memory Systems: A Survey Krishna Kavi, Hyong-Shik Kim memory modules via a crossbar switch. This can be viewed as a Symmetric Multiprocessor (SMP) or a shared memory system. The next version of a multiprocessor system at CMU was known as Cm* and can be deemed

Lee, Ben

311

SunShot Initiative: Access to Capital  

NLE Websites -- All DOE Office Websites (Extended Search)

Access to Capital to someone by Access to Capital to someone by E-mail Share SunShot Initiative: Access to Capital on Facebook Tweet about SunShot Initiative: Access to Capital on Twitter Bookmark SunShot Initiative: Access to Capital on Google Bookmark SunShot Initiative: Access to Capital on Delicious Rank SunShot Initiative: Access to Capital on Digg Find More places to share SunShot Initiative: Access to Capital on AddThis.com... Concentrating Solar Power Photovoltaics Systems Integration Balance of Systems Reducing Non-Hardware Costs Lowering Barriers Fostering Growth Access to Capital Photo of a room full of people seated in rows with a few standing in the background. Two hands in the crowd are holding up sheets of paper with 'Like'. Participants at the SunShot Summit breakout session "Big and Small Ideas:

312

Memorial University Counselling Centre Professional Psychology  

E-Print Network (OSTI)

1 Memorial University Counselling Centre Doctoral Professional Psychology Residency Programme 2013-2014 Accredited by the Canadian Psychological Association www of Counseling Services (IACS) www.iacsinc.org Participating Member: Canadian Council of Professional Psychology

deYoung, Brad

313

Commercialization of germanium based nanocrystal memory  

E-Print Network (OSTI)

This thesis explores the commercialization of germanium-based nanocrystal memories. Demand for smaller and faster electronics and embedded systems supports the development of high-density, low-power non-volatile electronic ...

Seow, Kian Chiew

2007-01-01T23:59:59.000Z

314

Size Effects in Ferromagnetic Shape Memory Alloys  

E-Print Network (OSTI)

effects in these mechanisms has both scientific and technological relevance. Superelastic behavior of Ni54Fe19Ga27 shape memory alloy single crystalline pillars was studied under compression as a function of pillar diameter. Multiple pillars...

Ozdemir, Nevin

2012-07-16T23:59:59.000Z

315

Cultural differences on the children's memory scale  

E-Print Network (OSTI)

). Cultural effects of bilingualism on verbal learning and memory in Hispanic adults have also been found (Figueroa, 1983; Gutierrez-Clellen & Calderon, 2004; Harris, Cullum, & Puente, 1995). Ardila, Rosselli, and Rosas (1989) assessed verbal learning...

Cash, Deborah Dyer

2009-05-15T23:59:59.000Z

316

Engineer Nanocrystal Floating Gate Memory Scaling  

E-Print Network (OSTI)

flash memory [2-9]. Metal silicide NCs, with high density ofsemiconductors [14], metal, metallic silicide and metal-like2, 3], metal [4, 5], metallic silicide [6, 7, 8], core-shell

Ren, Jingjian

2012-01-01T23:59:59.000Z

317

Orthopaedic applications of ferromagnetic shape memory alloys  

E-Print Network (OSTI)

Ferromagnetic shape memory alloys (FSMAs) are a new class of magnetic field-actuated active materials with no current commercial applications. By applying a magnetic field of around 0.4 T, they can exert a stress of ...

Guo, Weimin, M. Eng. Massachusetts Institute of Technology

2008-01-01T23:59:59.000Z

318

Biopolymers: Shape memory in spider draglines  

Science Journals Connector (OSTI)

... a dangling spider twist and turn in the breeze. Measurements on the dragline of the humble garden spider show why. The silk has a torsional shape memory, and can totally ...

Olivier Emile; Albert Le Floch; Fritz Vollrath

2006-03-29T23:59:59.000Z

319

A strategy of memory : Suzhou, China  

E-Print Network (OSTI)

The thesis is trying to establish a strategy of memory for the urban preservation of old cities, like Suzhou, within the context of the rapid growing economy in Southern China. The general attitude towards the problem ...

Chang, Ping Hung

1995-01-01T23:59:59.000Z

320

Memory system characterization of commercial workloads  

Science Journals Connector (OSTI)

Commercial applications such as databases and Web servers constitute the largest and fastest-growing segment of the market for multiprocessor servers. Ongoing innovations in disk subsystems, along with the ever increasing gap between processor and memory ...

Luiz André Barroso; Kourosh Gharachorloo; Edouard Bugnion

1998-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

Resolving a gravitational wave memory paradox  

E-Print Network (OSTI)

Two different approaches to gravitational perturbation theory appear to give two different answers for the properties of gravitational wave memory. We show that this contradiction is only apparent and the two approaches actually agree.

David Garfinkle; Istvan Racz

2014-06-20T23:59:59.000Z

322

Rhodamine-doped Aerogel Random Laser  

Science Journals Connector (OSTI)

Random Laser generation can give valuable information on the structure of diffuse materials. The aerogel matrix has knowingly a fractal organization. Here, random laser generation from...

Miranda, Adriana Ramos de; Pecoraro, Édison; Ribeiro, Sidney José L; Giehl, Júlia Maria; Reijn, Saara-Maarit; Wetter, Niklaus U

323

Post polymerization cure shape memory polymers  

DOE Patents (OSTI)

This invention relates to chemical polymer compositions, methods of synthesis, and fabrication methods for devices regarding polymers capable of displaying shape memory behavior (SMPs) and which can first be polymerized to a linear or branched polymeric structure, having thermoplastic properties, subsequently processed into a device through processes typical of polymer melts, solutions, and dispersions and then crossed linked to a shape memory thermoset polymer retaining the processed shape.

Wilson, Thomas S; Hearon, Michael Keith; Bearinger, Jane P

2014-11-11T23:59:59.000Z

324

Distributed trace using central performance counter memory  

DOE Patents (OSTI)

A plurality of processing cores, are central storage unit having at least memory connected in a daisy chain manner, forming a daisy chain ring layout on an integrated chip. At least one of the plurality of processing cores places trace data on the daisy chain connection for transmitting the trace data to the central storage unit, and the central storage unit detects the trace data and stores the trace data in the memory co-located in with the central storage unit.

Satterfield, David L; Sexton, James C

2013-10-22T23:59:59.000Z

325

Associative memory in phasing neuron networks  

SciTech Connect

We studied pattern formation in a network of coupled Hindmarsh-Rose model neurons and introduced a new model for associative memory retrieval using networks of Kuramoto oscillators. Hindmarsh-Rose Neural Networks can exhibit a rich set of collective dynamics that can be controlled by their connectivity. Specifically, we showed an instance of Hebb's rule where spiking was correlated with network topology. Based on this, we presented a simple model of associative memory in coupled phase oscillators.

Nair, Niketh S [ORNL; Bochove, Erik J. [United States Air Force Research Laboratory, Kirtland Air Force Base; Braiman, Yehuda [ORNL

2014-01-01T23:59:59.000Z

326

The relationship between posture, mood and memory  

E-Print Network (OSTI)

THE RELATIONSHIP BETWEEN POSTURE, MOOD AND MEMORY A Thesis by RODNEY FLANARY Submitted to the Graduate College of Texas ASM University in partial fulfillment of the requirements for the degree of MASTER of SCIENCE July, l984 Major Subject...: psychology THE RELATIONSHIP BETWEEN POSTURE, MOOD AND MEMORY A Thesis by Rodney Flanary Approved as to style and content by t ven M. ms h (Chairman of Committee) Michael Du y (Member) Steve Rho es (for John Riskind) teve Wore el (Head of Department...

Flanary, Rodney

2012-06-07T23:59:59.000Z

327

Persistent memory retention of reward events and proactive interference in reward series learning by mice  

E-Print Network (OSTI)

Grouping, chunking, memory, and learning. The Quarterlyto the organization of memory and the abstract concept ofcan be sustained by event memories alone. Animal Learning &

Taniuchi, Tohru

2014-01-01T23:59:59.000Z

328

Noradrenergic activation of the basolateral amygdala modulates the consolidation of object-in-context recognition memory  

E-Print Network (OSTI)

and context recognition memory involve different regions ofplasticity and recognition memory in the perirhinal cortex.emo- tionally influenced memory storage. Neurobiol. Learn.

Barsegyan, Areg; McGaugh, James L; Roozendaal, Benno

2014-01-01T23:59:59.000Z

329

Subject Access to Your Information  

E-Print Network (OSTI)

Subject Access to Your Information Sandy Tucker Texas A&M University Libraries August 1, 2006 Second International Symposium on Transportation Technology Transfer Introduction You have packages ? books, pamphlets, files, electronic documents. You... have records of packages ? cards or an online database. Other? We?re talking about adding subject information to the records of packages. Specifically, we?ll talk about using a ?controlled vocabulary.? Controlled Vocabulary Using a fixed list...

Tucker, Sandra

2006-08-01T23:59:59.000Z

330

Statistical Performance Modeling of SRAMs  

E-Print Network (OSTI)

Yield analysis is a critical step in memory designs considering a variety of performance constraints. Traditional circuit level Monte-Carlo simulations for yield estimation of Static Random Access Memory (SRAM) cell is quite time consuming due...

Zhao, Chang

2011-02-22T23:59:59.000Z

331

Random walk through fractal environments  

Science Journals Connector (OSTI)

We analyze random walk through fractal environments, embedded in three-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight increments (i.e., of the displacements between two consecutive hittings) is analytically derived from a common, practical definition of fractal dimension, and it turns out to approximate quite well a power-law in the case where the dimension DF of the fractal is less than 2, there is though, always a finite rate of unaffected escape. Random walks through fractal sets with DF2 is decaying exponentially. The diffusive behavior of the random walk is analyzed in the frame of continuous time random walk, which we generalize to include the case of defective distributions of walk increments. It is shown that the particles undergo anomalous, enhanced diffusion for DF2 is normal for large times, enhanced though for small and intermediate times. In particular, it follows that fractals generated by a particular class of self-organized criticality models give rise to enhanced diffusion. The analytical results are illustrated by Monte Carlo simulations.

H. Isliker and L. Vlahos

2003-02-26T23:59:59.000Z

332

Shape memory system with integrated actuation using embedded particles  

DOE Patents (OSTI)

A shape memory material with integrated actuation using embedded particles. One embodiment provides a shape memory material apparatus comprising a shape memory material body and magnetic pieces in the shape memory material body. Another embodiment provides a method of actuating a device to perform an activity on a subject comprising the steps of positioning a shape memory material body in a desired position with regard to the subject, the shape memory material body capable of being formed in a specific primary shape, reformed into a secondary stable shape, and controllably actuated to recover the specific primary shape; including pieces in the shape memory material body; and actuating the shape memory material body using the pieces causing the shape memory material body to be controllably actuated to recover the specific primary shape and perform the activity on the subject.

Buckley, Patrick R. (New York, NY); Maitland, Duncan J. (Pleasant Hill, CA)

2012-05-29T23:59:59.000Z

333

Running head: STEREOTYPE THREAT REDUCES MEMORY ERRORS Stereotype threat can reduce older adults' memory errors  

E-Print Network (OSTI)

Running head: STEREOTYPE THREAT REDUCES MEMORY ERRORS Stereotype threat can reduce older adults, 90089-0191. Phone: 213-740-6772. Email: barbersa@usc.edu #12;STEREOTYPE THREAT REDUCES MEMORY ERRORS 2 Abstract (144 words) Stereotype threat often incurs the cost of reducing the amount of information

Mather, Mara

334

DOE Public Access Plan | Department of Energy  

Office of Environmental Management (EM)

DOE Public Access Plan DOE Public Access Plan On February 22, 2013, the Director of the White House Office of Science and Technology Policy (OSTP), Dr. John Holdren, issued a...

335

Metropolitan Accessibility and Transportation Sustainability:Sustainability  

E-Print Network (OSTI)

Metropolitan Accessibility and Transportation Sustainability:Sustainability: Comparative Reduce (fulfillment of)Promote Sustainability: Meet needs of (fulfillment of) needs present Institute SMART Sustainable Mobility and Accessibility Research andSMART Sustainable Mobility

Papalambros, Panos

336

Forests for People Access, recreation & tourism  

E-Print Network (OSTI)

Strategy Forests for People Access, recreation & tourism on the national forest estate #12;#12;Access, recreation and tourism on the national forest estate | 3 Forests for People Access, recreation suite of outdoor recreation infrastructure. The national forest estate is a place for all types

337

Revised Spring 2008 NIH Public Access Policy  

E-Print Network (OSTI)

Revised Spring 2008 NIH Public Access Policy Notice Number: NOT-OD-08-033 - (See Notice NOT-OD-08-161 (Consolidated Appropriations Act, 2008), the NIH voluntary Public Access Policy (NOT-OD-05-022) is now mandatory shall implement the public access policy in a manner consistent with copyright law. Specifics 1. The NIH

338

Human Resources Security Access Matrix Function Training  

E-Print Network (OSTI)

June 2013 Human Resources Security Access Matrix Function Training Course Required Class Mode Training Course Prerequisite Security Access Form Required Contact for Additional Information Complete Electronic I-9 Forms REC001: I-9 /E-Verify Web Training OR Online OR None Electronic I-9 Security Access Form

Wu, Shin-Tson

339

Supporting accessibility in higher education information systems  

Science Journals Connector (OSTI)

Higher education institutions (HEI) and students are highly dependent of information systems, implemented as web applications. Students must be able to access this applications, thought accessible web interfaces, in order to perform their academic activities. ... Keywords: DSpace, W3C, accessibility, higher education institutions, moodle

Arsénio Reis; João Barroso; Ramiro Gonçalves

2013-07-01T23:59:59.000Z

340

Slide #1CENTER FOR INTEGRATED ACCESS NETWORKS  

E-Print Network (OSTI)

Slide #1CENTER FOR INTEGRATED ACCESS NETWORKS Photonics Communication Engineering Khanh Kieu, Ph.D. College of Optical Sciences, University of Arizona #12;Slide #2CENTER FOR INTEGRATED ACCESS NETWORKS is around 340m/s. #12;Slide #3CENTER FOR INTEGRATED ACCESS NETWORKS Homework Problem 2: Calculate

Kieu, Khanh

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

Slide #1CENTER FOR INTEGRATED ACCESS NETWORKS  

E-Print Network (OSTI)

Slide #1CENTER FOR INTEGRATED ACCESS NETWORKS Photonics Communication Engineering Khanh Kieu, Ph.D. College of Optical Sciences, University of Arizona #12;Slide #2CENTER FOR INTEGRATED ACCESS NETWORKS multiplexing · Network topology #12;Slide #3CENTER FOR INTEGRATED ACCESS NETWORKS Communication Source

Kieu, Khanh

342

Slide #1CENTER FOR INTEGRATED ACCESS NETWORKS  

E-Print Network (OSTI)

Slide #1CENTER FOR INTEGRATED ACCESS NETWORKS Photonics Communication Engineering Khanh Kieu, Ph.D. College of Optical Sciences, University of Arizona #12;Slide #2CENTER FOR INTEGRATED ACCESS NETWORKS Significant progress #12;Slide #3CENTER FOR INTEGRATED ACCESS NETWORKS What else can we multiplex

Kieu, Khanh

343

Self-calibrating random access logarithmic pixel for on chip camera  

E-Print Network (OSTI)

??.?????????????????????????...89 VITA???????????????????????????????.. 92 viii LIST OF FIGURES Page Figure 1-1 Passive pixel schematic.................................................................................2 Figure 1-2 Photodiode-type active pixel schematic... of photons, i.e., a lens; 2) wavelength discrimination of photons, i.e., filters; 3) detector for conversion of photons, e.g., photodiode; 4) a method to readout the detectors, e.g., a CCD; 5) timing, control and drive electronics for the sensor; 6) signal...

Hong, Augustin Jinwoo

2005-08-29T23:59:59.000Z

344

Random Access Compressed Sensing for Energy-Efficient Underwater Sensor Networks  

E-Print Network (OSTI)

nodes are anchored to the bottom of the ocean and deployed for long periods of time. Each sensor node reconstructs the map of the physical field. Bandwidth and battery power are severely limited in underwater [3][4]. Authors in [5] are the first to introduce the application of compressed sensing in networks

Hochberg, Michael

345

MyRED Grant Parent/Guest Access Grant Parent/Guest Access  

E-Print Network (OSTI)

MyRED ­ Grant Parent/Guest Access Grant Parent/Guest Access Follow these steps if you need to grant a parent or guest access to your student information. 1) From your Student tab underRED. 12/1/2011 Page 1 #12;MyRED ­ Grant Parent/Guest Access 3) Select Manage

Farritor, Shane

346

Solar Access to Public Capital | Department of Energy  

Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

Solar Access to Public Capital Solar Access to Public Capital The Solar Access to Public Capital (SAPC) working group has developed standard residential lease and commercial power...

347

Solar access of residential rooftops in four California cities  

E-Print Network (OSTI)

rooftops in four California cities Solar access ofcomputed. Solar access violation California Public ResourcesSolar access of residential rooftops in four California

Levinson, Ronnen

2010-01-01T23:59:59.000Z

348

Random Walks and Electrical Networks Electrical Network Calculations in Random Walks in  

E-Print Network (OSTI)

Random Walks and Electrical Networks Electrical Network Calculations in Random Walks in Random 2/4/2008 1 / 23 #12;Random Walks and Electrical Networks Much of this talk is based on the book Random Walks and Electric Networks by Peter G. Doyle and J. Laurie Snell. Free download available at http

Peterson, Jonathon

349

Accessible Energy in Quantum Systems  

Science Journals Connector (OSTI)

A quantum system in a mixed state can transfer only part of its energy to a quantum system in a pure state if we require that the final state of the second system is once again pure. We calculate this accessible energy by constructing the optimum unitary operator that connects the initial state of the combined system with its final state. We show that for large systems such as commonly considered in thermodynamics a simple entropy argument suffices but that this method of calculation may yield results that are too large for simpler systems owing to the constraint that the time development operator must be unitary.

Adriaan Walther

1971-01-01T23:59:59.000Z

350

Random partitions in statistical mechanics  

E-Print Network (OSTI)

We consider a family of distributions on spatial random partitions that provide a coupling between different models of interest: the ideal Bose gas; the zero-range process; particle clustering; and spatial permutations. These distributions are invariant for a "chain of Chinese restaurants" stochastic process. We obtain results for the distribution of the size of the largest component.

Nicholas M. Ercolani; Sabine Jansen; Daniel Ueltschi

2014-01-07T23:59:59.000Z

351

Applications of Random Matrix Theory  

E-Print Network (OSTI)

= ­ eigenvalues lie on the unit circle. #12;Matrices - Recall · Eigenvalues = · Symmetry important complicated! · Keep the symmetry (as imposed by physics) but let everything else be random. #12;Data · Correlation matrix of time series of stock prices · Sea-level and atmospheric pressure · Longest increasing

Wirosoetisno, Djoko

352

Utility Data Accessibility Map | Open Energy Information  

Open Energy Info (EERE)

Utility Data Accessibility Map Utility Data Accessibility Map Jump to: navigation, search Residential Commercial Benchmarking Energy Efficiency Delivery of Data Time Period Frequency of Data Access to Data Residential frequency of data access Ua Utility Data Access Map Having access to your electricity use data is a very important step in understanding your overall energy usage. Comparing historical data to your current usage is one way to see trends and determine ways for reducing electricity costs and improving overall efficiency. We asked all U.S. electric utility companies to tell us how accessible their electricity use data is for both residential and commercial customers. The results are updated live based on the responses we have to date. As more utilities provide information, the utility boundaries will be automatically colored

353

Chapter_12_Special_Access_Programs  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2 2 Special Access Programs This chapter describes the DOE Special Access Program (SAP) at DOE HQ and implements the requirements of: * Executive Order 13526, Classified National Security Information, Section 4.3, Special Access Programs, and Section 5.4, General Responsibilities, subparagraph (d). * DOE Order 471.5, Special Access Programs. A SAP is a program established for a specific class of classified information that imposes safeguarding and access requirements exceeding those normally required for information at the same classification level. Terms and activities such as Limited Access, Controlled Access, and Limited Distribution programs are not authorized. HQ Implementation Procedures SAP administration for both DOE and NNSA is handled through the Executive

354

Access Fund Partners LP | Open Energy Information  

Open Energy Info (EERE)

Access Fund Partners LP Access Fund Partners LP Jump to: navigation, search Name Access Fund Partners, LP Place San Juan Capistrano, California Zip 92675 Product Boutique investment banking and investment advisory firm with clean energy focus References Access Fund Partners, LP[1] LinkedIn Connections CrunchBase Profile No CrunchBase profile. Create one now! This article is a stub. You can help OpenEI by expanding it. Access Fund Partners, LP is a company located in San Juan Capistrano, California . References ↑ "Access Fund Partners, LP" Retrieved from "http://en.openei.org/w/index.php?title=Access_Fund_Partners_LP&oldid=341703" Categories: Clean Energy Organizations Companies Organizations Stubs What links here Related changes Special pages Printable version

355

Memorandum Memorializing Ex Parte Communication, DOE impending  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Memorandum Memorializing Ex Parte Communication, DOE impending Memorandum Memorializing Ex Parte Communication, DOE impending determination of coverage for commercial and industrial fans, blowers, and fume hoods. Memorandum Memorializing Ex Parte Communication, DOE impending determination of coverage for commercial and industrial fans, blowers, and fume hoods. The meeting was requested by AMCA International to introduce the association's leadership, standards, and experience in developing fan standards to DOE; to learn more about the DOE process for developing regulations for fan efficiency standards; and to inform DOE on how commercial and industrial fan markets work. AMCA_Ex_Parte.pdf More Documents & Publications DOE-STD-1168-2013 DOE Meeting Memorandum: Ex Parte Communications Independent Oversight Review, Savannah River Site - August 2011

356

5 - Types of Access Controlled Portals  

Science Journals Connector (OSTI)

Publisher Summary This chapter introduces information about types of Access Control System Portals. A portal is the way through which a person must pass and an Access Control System Portal is a portal controlled by access control system devices. When an access control portal is confronted, one knows that he is moving from one access area into another. Depending on the security configuration of the portal, access authorization may be required to enter, to leave, or to enter and leave through the portal. In most cases, access can be granted to a single individual, but for some higher security zones, access may require the presence of two or more authorized persons. Access portals can be configured to work on a schedule so that access is free during some hours and requires authorization during others, or may be limited to certain individuals during certain hours. Pedestrian portals include standard doors, automatic doors, revolving doors, turnstiles, Man-Traps, and automated walls. Vehicle portals may include standard barrier gates, high-security barrier gates, and sally ports. An Access Portal is a passageway through which a person must pass to go from one access zone to another. When an access control portal is confronted, you know you are moving from one access area into another. Depending on the security configuration of the portal, access authorization may be required to enter, to leave, or to enter and leave through the portal. In most cases, access can be granted to a single individual, but for some higher security zones, access may require the presence of two or more authorized people. Access portals can be configured to work on a schedule so that access is free during some hours and requires authorization during others or may be limited to certain individuals during certain hours. Pedestrian portals include common doors, automatic doors, revolving doors, turnstiles, man-traps, and automated walls. Vehicle portals may include standard barrier gates, high-security barrier gates, and sally ports. Author Information: Thomas L. Norman, CPP, PSP, CSC, Executive Vice President, Protection Partners International

Thomas Norman

2012-01-01T23:59:59.000Z

357

LDRD final report : managing shared memory data distribution in hybrid HPC applications.  

SciTech Connect

MPI is the dominant programming model for distributed memory parallel computers, and is often used as the intra-node programming model on multi-core compute nodes. However, application developers are increasingly turning to hybrid models that use threading within a node and MPI between nodes. In contrast to MPI, most current threaded models do not require application developers to deal explicitly with data locality. With increasing core counts and deeper NUMA hierarchies seen in the upcoming LANL/SNL 'Cielo' capability supercomputer, data distribution poses an upper boundary on intra-node scalability within threaded applications. Data locality therefore has to be identified at runtime using static memory allocation policies such as first-touch or next-touch, or specified by the application user at launch time. We evaluate several existing techniques for managing data distribution using micro-benchmarks on an AMD 'Magny-Cours' system with 24 cores among 4 NUMA domains and argue for the adoption of a dynamic runtime system implemented at the kernel level, employing a novel page table replication scheme to gather per-NUMA domain memory access traces.

Merritt, Alexander M. (Georgia Institute of Technology, Atlanta, GA); Pedretti, Kevin Thomas Tauke

2010-09-01T23:59:59.000Z

358

Simulation and Experiment of Wide Bandgap Material Based Nonvolatile Memory  

E-Print Network (OSTI)

phase-change nonvolatile memories”, IEEE Transactions on Device and Materialsphase change phenomena of GST (Germanium-Antimony-Tellurium) materialmaterials and structures are developed to replace the floating gate memory. Phase change

LI, ZONGLIN

2012-01-01T23:59:59.000Z

359

Towards Automated Memory Model Generation Via Event Tracing  

Science Journals Connector (OSTI)

......opportunities may be created to reduce the memory configuration of a machine during procurement, reducing initial capital expenditure. In this paper, we introduce WMTools, a memory manage- ment analysis suite, comprising a lightweight profiling......

O.F.J. Perks; D.A. Beckingsale; S.D. Hammond; I. Miller; J.A. Herdman; A. Vadgama; A.H. Bhalerao; L. He; S.A. Jarvis

2013-02-01T23:59:59.000Z

360

Speedy transactions in multicore in-memory databases  

E-Print Network (OSTI)

Silo is a new in-memory database that achieves excellent performance and scalability on modern multicore machines. Silo was designed from the ground up to use system memory and caches efficiently. For instance, it avoids ...

Tu, Stephen

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

Performance analysis of fault-tolerant nanoelectronic memories  

E-Print Network (OSTI)

important that defect and fault-tolerant schemes be incorporated into the design of nanotechnology related devices. In this dissertation, we focus on the study of a novel and promising class of computer chip memories called crossbar molecular switch memories...

Coker, Ayodeji

2009-05-15T23:59:59.000Z

362

Building and exploiting ontologies for an automobile project memory  

Science Journals Connector (OSTI)

This paper describes SAMOVAR (Systems Analysis of Modelling and Validation of Renault Automobiles), aiming at preserving and exploiting the memory of past projects in automobile design (in particular the memory of the problems encountered during a project) ...

Joanna Golebiowska; Rose Dieng-Kuntz; Olivier Corby; Didier Mousseau

2001-10-01T23:59:59.000Z

363

A regularized limited-memory BFGS method for unconstrained ...  

E-Print Network (OSTI)

Aug 5, 2014 ... the BFGS method requires O(n2) memory to store the approximate ... A popular method for large-scale problems (1.1) is the limited-memory.

2014-08-05T23:59:59.000Z

364

Vibrations of raised access floors  

Science Journals Connector (OSTI)

Raised access floors play a critical role in modern cleanroom design. They have unique mechanical properties that make them respond to dynamic loading in a manner quite different from conventional floors. For example an unbraced floor is much more flexible horizontally than in the vertical direction. Horizontal vibration amplitudes with walker excitation may exceed 100??m/s in an unbraced floor exceeding the sensitivity of 1000× inspection microscopes by as much as an order of magnitude. Issues such as these become important when moderately vibration?sensitive instruments such as optical microscopes are supported on access floors typically the case in cleanrooms. This paper presents results of experimental studies involving a 3?m×3?m segment of floor and a large floor installed in a cleanroom both of which were subjected to dynamic loads using a shaker. Both drive?point and propagation properties were examined. In addition data are presented for variations in bracing and bolting using the 3?m×3?m segment.

2002-01-01T23:59:59.000Z

365

Solar access: it's the law  

SciTech Connect

The contents of the California Solar Rights Act and the California Solar Shade Control Act which may have an impact on the way in which development, particularly housing, is designed and constructed in California, are reviewed. The Solar Rights Act establishes the state government of California as supporting and encouraging solar energy implementation at the local level. The law sets parameters for establishing solar easements, amends the Solar Tax Credit to include costs of easements, prohibits ordinances and private covenants which restrict solar systems, and requires communities to consider passive solar and natural heating and cooling opportunities in new construction. The Solar Rights Act is binding on all charter cities, and is thus applicable to all California cities and counties. The Solar Shade Control Act prohibits the blockage of solar radiation by vegetation to solar collectors which meet certain specific qualifications. Owners of property with unlawful vegetation are subject to criminal charges and fines of up to $500 per day of continued infraction. However, cities and counties may elect to exempt themselves from provisions of the Solar Shade Control Act. This manuscript explains solar access concepts, interprets the legal language of the laws for lay readers, and offers specific planning and design guidelines for use by developers, planners, and government officials in reviewing or developing plans to ensure solar access to structures. Twenty-four illustrations, a glossary, and several practical appendices are offered to assist the reader in understanding and complying with the laws.

Thayer, R.L. Jr.

1981-01-01T23:59:59.000Z

366

Shape memory behavior of ultrafine grained NiTi and TiNiPd shape memory alloys  

E-Print Network (OSTI)

The cyclic instability in shape memory characteristics of NiTi-based shape memory alloys (SMAs), such as transformation temperatures, transformation and irrecoverable strains and transformation hysteresis upon thermal and mechanical cycling limits...

Kockar, Benat

2009-05-15T23:59:59.000Z

367

The nature of the working memory system underlying language processing and its relationship to the long-term memory system  

E-Print Network (OSTI)

This thesis examines two questions concerning the working memory system underlying language processing: (1) To what extent is the working memory system underlying language processing domain-specific? and (2) What is the ...

Fedorenko, Evelina Georgievna

2007-01-01T23:59:59.000Z

368

Characterization of Shape Memory Alloys Using Artificial Neural Networks  

E-Print Network (OSTI)

1 Characterization of Shape Memory Alloys Using Artificial Neural Networks Jim Henrickson, Kenton � Shape Memory Alloys � Artificial Neural Networks Process � Implement Shape Memory Alloy Model � Generate Training Data � Train Artificial Neural Network Results Conclusion Characterization of Shape

Valasek, John

369

Coding-based Energy Minimization for Phase Change Memory  

E-Print Network (OSTI)

-1-4503-1199-1/12/06 ...$10.00. states of the phase-change material. In one state, the ma- terial is amorphous with a highCoding-based Energy Minimization for Phase Change Memory Azalia Mirhoseini Electrical and Computer Phase Change Memory write energy. Our method minimizes the energy required for memory rewrites

370

Phase Change Memory An Architecture and Systems Perspective  

E-Print Network (OSTI)

#12;Phase Change Memory Store data within phase change material [Ovshinsky68] Set phase via currentPhase Change Memory An Architecture and Systems Perspective Benjamin Lee Computer Architecture lifetime 1 B.Lee et al. "Architecting phase change memory as a scalable DRAM alternative." ISCA-36

Lee, Benjamin C.

371

DSK: k-mer counting with very low memory usage  

Science Journals Connector (OSTI)

......k-mer counting with very low memory usage Guillaume Rizk 1 Dominique Lavenier 2 Rayan...function of the desired memory and disk usage. In Section 3, DSK is used to count all...sequences, k-mer length k, target memory usage M (bits), target disk space D (bits......

Guillaume Rizk; Dominique Lavenier; Rayan Chikhi

2013-03-01T23:59:59.000Z

372

Evaluating Memory Energy Efficiency in Parallel I/O Workloads  

E-Print Network (OSTI)

Evaluating Memory Energy Efficiency in Parallel I/O Workloads Jianhui Yue,Yifeng Zhu , Zhao Cai the ever- widening gap between disk and processor speeds, memory energy efficiency becomes an increasingly management policies heavily influence the overall memory energy efficiency. In partic- ular, under the same

Zhu, Yifeng

373

GENETIC HEURISTICS FOR REDUCING MEMORY ENERGY CONSUMPTION IN EMBEDDED SYSTEMS  

E-Print Network (OSTI)

GENETIC HEURISTICS FOR REDUCING MEMORY ENERGY CONSUMPTION IN EMBEDDED SYSTEMS Maha IDRISSI AOUAD.loria.fr/zendra Keywords: Energy consumption reduction, Genetic heuristics, memory allocation management, optimizations on heuristic methods for SPMs careful management in order to reduce memory energy consumption. We propose

Schott, René - Institut de Mathématiques �lie Cartan, Université Henri Poincaré

374

Direct match data flow memory for data driven computing  

DOE Patents (OSTI)

A data flow computer and method of computing is disclosed which utilizes a data driven processor node architecture. The apparatus in a preferred embodiment includes a plurality of First-In-First-Out (FIFO) registers, a plurality of related data flow memories, and a processor. The processor makes the necessary calculations and includes a control unit to generate signals to enable the appropriate FIFO register receiving the result. In a particular embodiment, there are three FIFO registers per node: an input FIFO register to receive input information form an outside source and provide it to the data flow memories; an output FIFO register to provide output information from the processor to an outside recipient; and an internal FIFO register to provide information from the processor back to the data flow memories. The data flow memories are comprised of four commonly addressed memories. A parameter memory holds the A and B parameters used in the calculations; an opcode memory holds the instruction; a target memory holds the output address; and a tag memory contains status bits for each parameter. One status bit indicates whether the corresponding parameter is in the parameter memory and one status bit to indicate whether the stored information in the corresponding data parameter is to be reused. The tag memory outputs a "fire" signal (signal R VALID) when all of the necessary information has been stored in the data flow memories, and thus when the instruction is ready to be fired to the processor.

Davidson, George S. (8516 San Francisco NE., Albuquerque, NM 87109); Grafe, Victor Gerald (1909 Saturn Ct. NE., Albuquerque, NM 87112)

1997-01-01T23:59:59.000Z

375

L6: Memory Hierarchy Optimization III, Bandwidth Optimization  

E-Print Network (OSTI)

2/9/10 1 L6: Memory Hierarchy Optimization III, Bandwidth Optimization CS6963 Administrative · Next! ­ cs6963s10-teach@list.eng.utah.edu · Please use for questions to Protonu and me CS6963 2 L6:Memory CUDA installed 3 L6:MemoryHierarchyIII CS6963 Overview · Complete discussion of data placement

Hall, Mary W.

376

Shared-Memory Programming in OpenMP  

E-Print Network (OSTI)

Shared-Memory Programming in OpenMP Advanced Research Computing #12;Advanced Research Research Compu:ng What is OpenMP? · API for parallel programming on shared memory · Scalability limited by memory architecture ­To a single node (8 to 32 cores

Crawford, T. Daniel

377

A Memory Selection Algorithm for HighPerformance Pipelines  

E-Print Network (OSTI)

A Memory Selection Algorithm for High­Performance Pipelines Smita Bakshi Daniel D. Gajski Technical that the memory organization satisfy both the storage and the performance requirements of the design. In this report, we present an algorithm to select a memory organization, in addition to selecting a pipeline

California at Irvine, University of

378

Memory Systems for Cognitive Agents Uma Ramamurthy1  

E-Print Network (OSTI)

Memory Systems for Cognitive Agents Uma Ramamurthy1 and Stan Franklin2 Abstract. The several different memory systems in human beings play crucial roles in facilitating human cognition. To build and cognitive science. In this paper we describe the various memory systems in the LIDA Architecture, which

Ramamurthy, Uma

379

Memory Scaling: A Systems Architecture Perspective Carnegie Mellon University  

E-Print Network (OSTI)

Memory Scaling: A Systems Architecture Perspective Onur Mutlu Carnegie Mellon University onur@cmu.edu http://users.ece.cmu.edu/omutlu/ Abstract--The memory system is a fundamental performance and energy that require more capacity, bandwidth, efficiency, and predictability out of the memory system make it an even

380

L4: Memory Hierarchy Optimization I, Locality and Data Placement  

E-Print Network (OSTI)

2/1/10 1 L4: Memory Hierarchy Optimization I, Locality and Data Placement CS6963 Administrative! ­ cs6963s10-teach@list.eng.utah.edu · Please use for questions to Protonu and me CS6963 2 L4:Memory to write code to optimize for memory hierarchy ­ More details Wednesday and (probably) next week · Reading

Hall, Mary W.

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Memory effects in a Markov chain dephasing channel  

E-Print Network (OSTI)

We study a dephasing channel with memory, modelled by a Markov chain. We show that even weak memory effects have a detrimental impact on the performance of quantum error correcting schemes designed for uncorrelated errors. We also discuss an alternative scheme that takes advantage of memory effects to protect quantum information.

Antonio D'Arrigo; Elena De Leo; Giuliano Benenti; Giuseppe Falci

2008-02-28T23:59:59.000Z

382

MEMORY MANAGEMENT FOR LARGE-SCALE NUMA MULTIPROCESSORS  

E-Print Network (OSTI)

MEMORY MANAGEMENT FOR LARGE-SCALE NUMA MULTIPROCESSORS Thomas J. LeBlanc Brian D. Marsh Michael L@cs.rochester.edu marsh@cs.rochester.edu scott@cs.rochester.edu March 1989 Abstract Large-scale shared-memory multiprocessors such as the BBN Butterfly and IBM RP3 Introduce a new level In the memory hierarchy: multiple

Scott, Michael L.

383

Memantine prevents reference and working memory impairment caused by sleep deprivation in both young and aged Octodon degus  

Science Journals Connector (OSTI)

Abstract Memory loss is one of the key features of cognitive impairment in either aging, Mild Cognitive Impairment (MCI) or dementia. Pharmacological treatments for memory loss are today focused on addressing symptomatology. One of these approved compounds is memantine, a partial NMDA receptor antagonist that has proved its beneficial effects in cognition. The Octodon degus (O. degus) has been recently proposed as a potential model relevant for neurodegenerative diseases. However, there are no previous studies investigating the effect of pharmacological treatments for age-related cognitive impairment in this rodent. In this work we aimed to evaluate the effect of memantine on sleep deprivation (SD)-induced memory impairment in young and old O. degus. Young and old animals were trained in different behavioral paradigms validated for memory evaluation, and randomly assigned to a control (CTL, n = 14) or an SD (n = 14) condition, and treated with vehicle or memantine (10-mg/Kg i.p.) before the SD started. We demonstrate that SD impairs memory in both young and old animals, although the effect in the old group was significantly more severe (P Memantine pretreatment was able to prevent the cognitive impairment caused by SD in both age groups, while it had no negative effect on CTL animals. The positive effect of memantine in counteracting the negative effect of SD on the retrieval process even in the aged O. degus further supports the translational potential of both the challenge and the species, and will enable a better understanding of the behavioral features of memantine effects, especially related with reference and working memories.

Ernesto Tarragon; Dolores Lopez; Cristina Estrada; Ana Gonzalez-Cuello; Carmen Ma Ros; Yves Lamberty; Fabien Pifferi; Massimo Cella; Mara Canovi; Giovanna Guiso; Marco Gobbi; Emiliano Fernández-Villalba; Olivier Blin; Regis Bordet; Jill C. Richardson; María Trinidad Herrero

2014-01-01T23:59:59.000Z

384

Episodic Memory, Semantic Memory, and Amnesia Larry R. Squire1,2,3,4* and Stuart M. Zola1,2,3  

E-Print Network (OSTI)

COMMENTARY Episodic Memory, Semantic Memory, and Amnesia Larry R. Squire1,2,3,4* and Stuart M. Zola 4Department of Psychology, University of California, La Jolla, California ABSTRACT: Episodic memory and semantic memory are two types of declarative memory. There have been two principal views about how

Squire, Larry R.

385

Hopfield model associative memory with nonzero-diagonal terms in memory matrix  

Science Journals Connector (OSTI)

The discrete-valued neural network proposed by Hopfield requires zero-diagonal terms in the memory matrix so that the net evolves toward a local minimum of an energy function. For a...

Gindi, Gene R; Gmitro, Arthur F; Parthasarathy, K

1988-01-01T23:59:59.000Z

386

SLAC All Access: Laser Labs  

SciTech Connect

From supermarket checkouts to video game consoles, lasers are ubiquitous in our lives. Here at SLAC, high-power lasers are critical to the cutting-edge research conducted at the laboratory. But, despite what you might imagine, SLAC's research lasers bear little resemblance to the blasters and phasers of science fiction. In this edition of All Access we put on our safety goggles for a peek at what goes on inside some of SLAC's many laser labs. LCLS staff scientist Mike Minitti and SLAC laser safety officer Mike Woods detail how these lasers are used to study the behavior of subatomic particles, broaden our understanding of cosmic rays and even unlock the mysteries of photosynthesis.

Minitti, Mike; Woods Mike

2013-03-01T23:59:59.000Z

387

A crossover for the bad configurations of random walk in random scenery  

E-Print Network (OSTI)

Frank den Hollander 2 3 Jeffrey E. Steif 4 March 17, 2011 This paper is dedicated to the memory of Oded

Steif, Jeffrey

388

Review of Probability Random Variable  

E-Print Network (OSTI)

at close 4) Height of wheel going over a rocky road #12;3 Random Variable Non-examples 1) `Heads' or `Tails' on coin 2) Red or Black ball from urn But we can make these into RV's Basic Idea ­ don't know · Temperature · Wheel height #12;5 Given Continuous RV X... What is the probability that X = x0 ? Oddity : P

Fowler, Mark

389

Thermodynamics of random copolymer melts  

Science Journals Connector (OSTI)

We report on a mean-field thermodynamic analysis of AB random copolymer melts with (backbone) composition correlations that reflect realistic polymerization conditions. Depending on the strength and sign of these correlations, multiple homogeneous phases, periodic mesophases, or disordered mesophases are possible. We identify an isotropic Lifshitz point and the critical lines that emerge from it. Our results should facilitate the design of new copolymeric materials.

Glenn H. Fredrickson and Scott T. Milner

1991-08-12T23:59:59.000Z

390

Enhancing Compiler Techniques for Memory Energy Optimizations  

E-Print Network (OSTI)

in the total energy consumption equation. 1 Introduction As the market for embedded systems continues to growEnhancing Compiler Techniques for Memory Energy Optimizations Joseph Zambreno1 , Mahmut Taylan Evanston IL 60208, USA {zambro1,choudhar}@ece.northwestern.edu 2 Microsystems Design Lab Pennsylvania State

Kuzmanovic, Aleksandar

391

What, where and when: deconstructing memory  

Science Journals Connector (OSTI)

...memories, such as remembering that the Battle of Hastings took place in 1066, an episodic...of the window while learning about the Battle of Hastings. Given that the focus of...flowers in the midday test (as this test is midway between two known but different rewards...

2013-01-01T23:59:59.000Z

392

3, 16031627, 2006 long-memory  

E-Print Network (OSTI)

HESSD 3, 1603­1627, 2006 Detecting long-memory W. Wang et al. Title Page Abstract Introduction Discussion EGU Hydrol. Earth Syst. Sci. Discuss., 3, 1603­1627, 2006 www.hydrol-earth-syst-sci-discuss.net/3/1603 2006 ­ Published: 14 July 2006 Correspondence to: W. Wang (w.wang@126.com) 1603 #12;HESSD 3, 1603

Boyer, Edmond

393

From Shared Memory to Message Passing  

E-Print Network (OSTI)

memory, but pass messages along networks: ... but also smart grids... Smart grid with renewable energy? The node measuring the hottest temperature? Etc. - Election of a leader - Coloring the network (e.g., frequency spectrum allocation in wireless networks), computing independent sets, etc. Complexity evaluation

Schmid, Stefan

394

CAUSALITY, MEMORY ERASING AND DELAYED CHOICE EXPERIMENTS  

E-Print Network (OSTI)

Comment on [R.L. Ingraham, Phys. Rev. A 50, 4502 (1994)]. Ingraham suggested ``a delayed-choice experiment with partial, controllable memory erasing''. It is shown that he cannot be right since his predictions contradict relativistic causality. A subtle quantum effect which was overlooked by Ingraham is explained.

Y. Aharonov; S. Popsecu; L. Vaidman

1995-01-08T23:59:59.000Z

395

Associative Memory Computing Power and Its Simulation  

E-Print Network (OSTI)

The associative memory (AM) system is a computing device made of hundreds of AM ASICs chips designed to perform “pattern matching” at very high speed. Since each AM chip stores a data base of 130000 pre-calculated patterns and large numbers of chips can be easily assembled together, it is possible to produce huge AM banks. Speed and size of the system are crucial for real-time High Energy Physics applications, such as the ATLAS Fast TracKer (FTK) Processor. Using 80 million channels of the ATLAS tracker, FTK finds tracks within 100 micro seconds. The simulation of such a parallelized system is an extremely complex task if executed in commercial computers based on normal CPUs. The algorithm performance is limited, due to the lack of parallelism, and in addition the memory requirement is very large. In fact the AM chip uses a content addressable memory (CAM) architecture. Any data inquiry is broadcast to all memory elements simultaneously, thus data retrieval time is independent of the database size. The gr...

Volpi, G; The ATLAS collaboration

2014-01-01T23:59:59.000Z

396

Associative Memory computing power and its simulation  

E-Print Network (OSTI)

The associative memory (AM) system is a computing device made of hundreds of AM ASICs chips designed to perform “pattern matching” at very high speed. Since each AM chip stores a data base of 130000 pre-calculated patterns and large numbers of chips can be easily assembled together, it is possible to produce huge AM banks. Speed and size of the system are crucial for real-time High Energy Physics applications, such as the ATLAS Fast TracKer (FTK) Processor. Using 80 million channels of the ATLAS tracker, FTK finds tracks within 100 micro seconds. The simulation of such a parallelized system is an extremely complex task if executed in commercial computers based on normal CPUs. The algorithm performance is limited, due to the lack of parallelism, and in addition the memory requirement is very large. In fact the AM chip uses a content addressable memory (CAM) architecture. Any data inquiry is broadcast to all memory elements simultaneously, thus data retrieval time is independent of the database size. The gr...

Ancu, L S; The ATLAS collaboration; Britzger, D; Giannetti, P; Howarth, J W; Luongo, C; Pandini, C; Schmitt, S; Volpi, G

2014-01-01T23:59:59.000Z

397

Mondriaan Memory Protection Emmett Jethro Witchel  

E-Print Network (OSTI)

Mondriaan Memory Protection by Emmett Jethro Witchel Submitted to the Department of Electrical the reliability and security of computer systems, but will be adopted only if the protection mechanism does for large systems, like operating systems, web servers and web clients. Protection between modules written

Asanoviæ, Krste

398

SLAC Lightsource User Access Guidelines and Agreement  

NLE Websites -- All DOE Office Websites (Extended Search)

Lightsource User Access Guidelines & Agreement Lightsource User Access Guidelines & Agreement August 3, 2011 SLAC-I-030-306-001-00-R002 1 SLAC Lightsource User Access Guidelines and Agreement LCLS / SSRL User Research Administration approval (signature/date): LCLS Safety Office approval (signature/date): SSRL Safety Office approval (signature/date): XFO Operations approval (signature/date): Revision Record Revision Date Revised Section(s) Affected Description of Change R001 October 4 th , 2010 User Form Updated SLAC Lightsource User Access Agreement Form R000 Sept 14, 2009 Original Release SLAC Lightsource User Access Guidelines & Agreement August 3, 2011 SLAC-I-030-306-001-00-R002 1 SLAC LIGHTSOURCE USER ACCESS GUIDELINES & AGREEMENT Introduction Welcome to SSRL and LCLS, SLAC's lightsource user facilities. We hope that your stay here will be

399

Content adaptivity in wireless web access  

Science Journals Connector (OSTI)

While the demand for wireless access to web-based systems increases, it becomes apparent that the design of most systems does not support the use of small screen end-devices such as PDAs or mobile phones. However, enabling wireless access should ... Keywords: adaptivity, cohesion preorder, conceptual modelling, content adaptation, internet, media types, mobile clients, mobile communications, proximity values, web-based systems, wireless access

Klaus-Dieter Schewe; Kinshuk; Tiong Goh

2004-09-01T23:59:59.000Z

400

Memory functions and Correlations in Additive Binary Markov Chains  

E-Print Network (OSTI)

A theory of additive Markov chains with long-range memory, proposed earlier in Phys. Rev. E 68, 06117 (2003), is developed and used to describe statistical properties of long-range correlated systems. The convenient characteristics of such systems, a memory function, and its relation to the correlation properties of the systems are examined. Various methods for finding the memory function via the correlation function are proposed. The inverse problem (calculation of the correlation function by means of the prescribed memory function) is also solved. This is demonstrated for the analytically solvable model of the system with a step-wise memory function.

S. S. Melnyk; O. V. Usatenko; V. A. Yampol'skii; S. S. Apostolov; Z. A. Mayzelis

2006-03-21T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

Colorado - Access Permit Application File Review Checklist |...  

Open Energy Info (EERE)

Checklist Jump to: navigation, search OpenEI Reference LibraryAdd to library General: Colorado - Access Permit Application File Review Checklist Author Colorado Department of...

402

Open Access Week Celebration Announcement, Handouts, Poster  

E-Print Network (OSTI)

Announcement, posters, handouts with information on events hosted by KU Libraries' Center for Digital Scholarship in celebration of International Open Access Week, Oct. 18-22, 2010....

KU Libraries

2010-10-18T23:59:59.000Z

403

Better accessibility for Paramaribo / Paramaribo beter bereikbaar:.  

E-Print Network (OSTI)

??A quantitative study for increasing the accessibility of Paramaribo, the capital of Suriname. The analysis was done with the help of a traffic demand model… (more)

Flu, M.E.

2012-01-01T23:59:59.000Z

404

WTB & Spectrum Access Overview | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

WTB & Spectrum Access Overview More Documents & Publications An Introduction to Spectrum Engineering NBP RFI: Communications Requirements Reply Comments of Southern Company...

405

Investment Optimization Planning for the Access Network  

Science Journals Connector (OSTI)

Verizon is nearing completion of its plan to deploy FTTP passed 18 million Wireline premises. This paper covers Verizon’s investment analysis of alternative access technologies...

Finn, Joseph

406

UNIVERSITY of CONNECTICUT LIBRARIES "Mandatory Open Access  

E-Print Network (OSTI)

UNIVERSITY of CONNECTICUT LIBRARIES "Mandatory Open Access: Friend or Foe?" IMPACT ON Peer Review. Sponsored by the University of Connecticut Libraries' Scholarly Communications and Forum Teams http

Holsinger, Kent

407

UH Parking Access & Mid-Pacific Institute  

E-Print Network (OSTI)

Pacific Ocean Science & Technology Kuykendall Annex Information Technology Center Krauss Hall Holmes HallStairs Pond UH Parking Access & Mid-Pacific Institute Exit Dole Street Offices Multipurpose

408

Random Matrix Theory, Numerical Computation and Applications  

E-Print Network (OSTI)

a precursor to a book on Random Matrix Theory that will be forthcoming. We reserve the right to reuseRandom Matrix Theory, Numerical Computation and Applications Alan Edelman, Brian D. Sutton new approaches to theory. We illustrate by describing such random matrix techniques as the stochastic

Edelman, Alan

409

Invertibility of random matrices M. Rudelson  

E-Print Network (OSTI)

Invertibility of random matrices M. Rudelson We will discuss several recent developments related to invertibility and spectral properties of large random matrices. Consider an n Ã? n matrix, whose values are independent identically distributed random variables. The invertibility questions can be roughly divided

Weinberger, Hans

410

Analysis of Random Number Generators Parijat Naik  

E-Print Network (OSTI)

1 Analysis of Random Number Generators Parijat Naik Department of Computer Science Oregon State generation used in practice and a comparison of their efficiency. The paper focuses on the techniques used Random number generators are used for generating an array of numbers that have a random distribution

411

Random sets lotteries and decision theory  

Science Journals Connector (OSTI)

Abstract We apply random sets theory to decision making under risk. This leads to a unifying concept which is compatible with some types of behavior like the Choquet Expected Utility and MaxMin Expected Utility. We show that the “expected utility” of a random set lottery is easy to calculate. Hence a decision making model with random sets is actually very tractable.

Marc-Arthur Diaye; Gleb Koshevoy

2014-01-01T23:59:59.000Z

412

Lévy Flights in Random Environments  

Science Journals Connector (OSTI)

We consider Lévy flights characterized by the step index f in a quenched isotropic short-range random force field to one loop order. By means of a dynamic renormalization group analysis, we find that the dynamic exponent z for f<2 locks onto f, independent of dimension and independent of the presence of weak quenched disorder. The critical dimension for f<2 is given by dc=2f-2. For d

Hans C. Fogedby

1994-11-07T23:59:59.000Z

413

Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction  

Science Journals Connector (OSTI)

Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it to two different existing quantum random-number systems in the literature. Moreover, we provide a guideline of QRNG data postprocessing for which we implement two information-theoretically provable randomness extractors: Toeplitz-hashing extractor and Trevisan's extractor.

Xiongfeng Ma; Feihu Xu; He Xu; Xiaoqing Tan; Bing Qi; Hoi-Kwong Lo

2013-06-21T23:59:59.000Z

414

Towards a sustainable web accessibility Giorgio Brajnik  

E-Print Network (OSTI)

this is by focussing on sustainable accessibility, i.e. by shaping and establishing effective acces- sibility processes;processes that can be sustained mainly by their own return on investment and by minimal additional resourcesTowards a sustainable web accessibility Giorgio Brajnik Dip. di Matematica e Informatica Universit

Brajnik, Giorgio

415

National Radiobiology Archives Distributed Access user's manual  

SciTech Connect

This User's Manual describes installation and use of the National Radiobiology Archives (NRA) Distributed Access package. The package consists of a distributed subset of information representative of the NRA databases and database access software which provide an introduction to the scope and style of the NRA Information Systems.

Watson, C.; Smith, S. (Pacific Northwest Lab., Richland, WA (United States)); Prather, J. (Linfield Coll., McMinnville, OR (United States))

1991-11-01T23:59:59.000Z

416

RESEARCH Open Access Probabilistic framework for opportunistic  

E-Print Network (OSTI)

approaches. Keywords: Cognitive radio networks, Opportunistic spectrum management, Medium access control 1 that the licensed spectrum is underutilized for 15 to 85% of the time depending on the spatial location [1]. ThusRESEARCH Open Access Probabilistic framework for opportunistic spectrum management in cognitive ad

Perkins, Dmitri

417

Metering Schemes for General Access Structures  

E-Print Network (OSTI)

Metering Schemes for General Access Structures Barbara Masucci Dipartimento di Informatica ed, Canada E­mail: dstinson@cacr.math.uwaterloo.ca Abstract A metering scheme is a method by which an audit time frame. In this paper we construct metering schemes for more general access structures, which

Stinson, Douglas

418

RESEARCH & INNOVATION OFFICE EASY ACCESS IP  

E-Print Network (OSTI)

RESEARCH & INNOVATION OFFICE EASY ACCESS IP AN INTRODUCTION FOR INDUSTRY PARTNERS FEBRUARY 2014 #12 to economic, environmental and social benefits. We believe there are some significant benefits to Easy Access, design and innovation Simple template license agreements means no lengthy and expensive negotiations

University of Technology, Sydney

419

Locally accessible information and distillation of entanglement  

SciTech Connect

A different type of complementarity relation is found between locally accessible information and final average entanglement for a given ensemble. It is also shown that in some well-known distillation protocols, this complementary relation is optimally satisfied. We discuss the interesting trade-off between locally accessible information and distillable entanglement for some states.

Ghosh, Sibasish [Department of Computer Science, University of York, Heslington, York, YO10 (United Kingdom); Joag, Pramod [Department of Physics, University of Pune, Ganeshkhind, Pune 411 007 (India); Kar, Guruprasad; Kunkri, Samir [Physics and Applied Mathematics Unit, Indian Statistical Institute, 203, B.T. Road, Kolkata 700 108 (India); Roy, Anirban [Institute of Mathematical Sciences, CIT Campus, Taramani, Chennai 600 113 (India)

2005-01-01T23:59:59.000Z

420

Access control models and security labelling  

Science Journals Connector (OSTI)

Security labels convey information that is utilised to perform access control decisions, specify protective measures, and aid in the determination of additional handling restrictions required by security policies. In discussing security labelling, one ... Keywords: access control, assurance, dynamic labelling model, open system, security label, security policy

Chuchang Liu; Angela Billard; Maris Ozols; Nikifor Jeremic

2007-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

Improving VPN Performance over Multiple Access Links  

E-Print Network (OSTI)

, cable modem) or suffer different or time-varying communication characteristics (e.g., available distinct innovations. First, we continuously measure the communication characteristics of the underlying the intranet), and reduced internet access throughput via the VPN (relative to direct internet access). One

Singh, Jaswinder Pal

422

Web Accessibility Office of Diversity and Inclusion  

E-Print Network (OSTI)

Web Accessibility Office of Diversity and Inclusion Applies to: Any website conducting university of the art digital and web based information delivery of information is increasingly central in carrying out constituencies. This policy establishes minimum standards for the accessibility of web based information

Jones, Michelle

423

Usability and Accessibility in Consumer Health Informatics  

E-Print Network (OSTI)

Usability and Accessibility in Consumer Health Informatics Current Trends and Future Challenges, for innovative eHealth systems to have true value and impact, they must first and foremost be usable challenges in the usability and accessibility of consumer health informatics will be described. Consumer

Shneiderman, Ben

424

Ethiopia Energy Access Project | Open Energy Information  

Open Energy Info (EERE)

Ethiopia Energy Access Project Ethiopia Energy Access Project Jump to: navigation, search Name of project Ethiopia Energy Access Project Location of project Ethiopia Energy Services Lighting, Cooking and water heating, Information and communications Year initiated 2005 Organization World Bank Website http://documents.worldbank.org Coordinates 9.145°, 40.489673° References The World Bank[1] The Energy Access Project for Ethiopia will establish a sustainable program for expanding the population's access to electricity and improving the quality and adequacy of electricity supply, reduce environmental degradation and improve energy end-use efficiency; reduce the barriers to the wide spread adoption of renewable energy technologies, and provide technical support for institutional and capacity building of key sector

425

3 - How Electronic Access Control Systems Work  

Science Journals Connector (OSTI)

Publisher Summary This chapter focuses on Electronic Access Control Systems concepts and how they work. These systems comprise electronic elements, physical elements, operational elements, and logical elements to create a complete working system that facilitates rapid and reliable access to authorized users in a facility at minimum long-term cost to the organization. They are digital networks that control access to security portals. A security portal is an entry into or out of a security boundary. Most Electronic Access Control Systems also function as an intrusion alarm system. From this point forward, it assumes that the systems have an alarm system element. Electronic Access Control Systems comprise field equipment, decision modules, a communications network, one or more databases, and one or more human interface terminals. The most obvious elements of an Electronic Access Control System are the Field Elements: Access Control System Portals (for pedestrians or vehicles), alarm sensors, and any controlled devices such as roll-up doors and lights. This chapter is about Electronic Access Control Systems concepts and how they work. It is important to read this chapter very carefully and be certain that you understand everything in it. Go over the Chapter Objectives and the Chapter Summary. Everything else you read in this book is based on the material in this chapter. Electronic Access Control Systems comprise electronic elements, physical elements, operational elements, and logical elements to create a complete working system that facilitates rapid and reliable access to authorized users in a facility at minimum long-term cost to the organization. This book is written in a hierarchical fashion; that is, the concepts are related first and then expanded on in greater detail later in the book. Accordingly, you will see repetition throughout the book, but that repetition is designed to instill learning in a layered fashion. Author Information: Thomas L. Norman, CPP, PSP, CSC, Executive Vice President, Protection Partners International

Thomas Norman

2012-01-01T23:59:59.000Z

426

Search in unknown random environments  

Science Journals Connector (OSTI)

N searchers are sent out by a source in order to locate a fixed object which is at a finite distance D, but the search space is infinite and D would be in general unknown. Each of the searchers has a finite random lifetime, and may be subject to destruction or failures, and it moves independently of other searchers, and at intermediate locations some partial random information may be available about which way to go. When a searcher is destroyed or disabled, or when it “dies naturally,” after some time the source becomes aware of this and it sends out another searcher, which proceeds similarly to the one that it replaces. The search ends when one of the searchers finds the object being sought. We use N coupled Brownian motions to derive a closed form expression for the average search time as a function of D which will depend on the parameters of the problem: the number of searchers, the average lifetime of searchers, the routing uncertainty, and the failure or destruction rate of searchers. We also examine the cost in terms of the total energy that is expended in the search.

Erol Gelenbe

2010-12-07T23:59:59.000Z

427

Quantum Memory with a controlled homogeneous splitting  

E-Print Network (OSTI)

We propose a quantum memory protocol where a input light field can be stored onto and released from a single ground state atomic ensemble by controlling dynamically the strength of an external static and homogeneous field. The technique relies on the adiabatic following of a polaritonic excitation onto a state for which the forward collective radiative emission is forbidden. The resemblance with the archetypal Electromagnetically-Induced-Transparency (EIT) is only formal because no ground state coherence based slow-light propagation is considered here. As compared to the other grand category of protocols derived from the photon-echo technique, our approach only involves a homogeneous static field. We discuss two physical situations where the effect can be observed, and show that in the limit where the excited state lifetime is longer than the storage time, the protocols are perfectly efficient and noise-free. We compare the technique to other quantum memories, and propose atomic systems where the experiment c...

Hétet, G; Chanelière, T

2013-01-01T23:59:59.000Z

428

Memory effect in uniformly heated granular gases  

E-Print Network (OSTI)

We evidence a Kovacs-like memory effect in a uniformly driven granular gas. A system of inelastic hard particles, in the low density limit, can reach a non-equilibrium steady state when properly forced. By following a certain protocol for the drive time dependence, we prepare the gas in a state where the granular temperature coincides with its long time value. The temperature subsequently does not remain constant, but exhibits a non-monotonic evolution with either a maximum or a minimum, depending on the dissipation, and on the protocol. We present a theoretical analysis of this memory effect, at Boltzmann-Fokker-Planck equation level, and show that when dissipation exceeds a threshold, the response can be coined anomalous. We find an excellent agreement between the analytical predictions and direct Monte Carlo simulations.

E. Trizac; A. Prados

2014-07-15T23:59:59.000Z

429

Lower bounds for randomized Exclusive Write PRAMs  

SciTech Connect

In this paper we study the question: How useful is randomization in speeding up Exclusive Write PRAM computations? Our results give further evidence that randomization is of limited use in these types of computations. First we examine a compaction problem on both the CREW and EREW PRAM models, and we present randomized lower bounds which match the best deterministic lower bounds known. (For the CREW PRAM model, the lower bound is asymptotically optimal.) These are the first non-trivial randomized lower bounds known for the compaction problem on these models. We show that our lower bounds also apply to the problem of approximate compaction. Next we examine the problem of computing boolean functions on the CREW PRAM model, and we present a randomized lower bound, which improves on the previous best randomized lower bound for many boolean functions, including the OR function. (The previous lower bounds for these functions were asymptotically optimal, but we improve the constant multiplicative factor.) We also give an alternate proof for the randomized lower bound on PARITY, which was already optimal to within a constant additive factor. Lastly, we give a randomized lower bound for integer merging on an EREW PRAM which matches the best deterministic lower bound known. In all our proofs, we use the Random Adversary method, which has previously only been used for proving lower bounds on models with Concurrent Write capabilities. Thus this paper also serves to illustrate the power and generality of this method for proving parallel randomized lower bounds.

MacKenzie, P.D.

1995-05-02T23:59:59.000Z

430

A Framework for Flexible Access Control in Digital Library Systems  

E-Print Network (OSTI)

to merely control access to documents local to the digital library. The access control policies are often called DACM (Document Access Control Methods). The basic idea is geared toward discretionary accessA Framework for Flexible Access Control in Digital Library Systems Indrajit Ray and Sudip

Ray, Indrajit

431

Consumer access to utility billing envelopes  

SciTech Connect

Billing envelope inserts are a medium of advertising used by utilities for a variety of purposes, from encouraging conservation to expressing political opinions. Recently, consumer groups have begun to assert a right of access to the same medium. A constitutional right of reply has been advocated. Commissions have found regulatory authority to direct companies to provide access on the basis of several different theories. At least two states have passed legislation permitting consumer groups to use bill inserts to solicit members and contributions. When examined, these developments reveal a trend of granting organizations access to utility billing envelopes.

Anglin, M.K.

1984-09-13T23:59:59.000Z

432

Geometric random inner products: A family of tests for random number generators  

Science Journals Connector (OSTI)

We present a computational scheme, GRIP (geometric random inner products), for testing the quality of random number generators. The GRIP formalism utilizes geometric probability techniques to calculate the average scalar products of random vectors distributed in geometric objects, such as circles and spheres. We show that these average scalar products define a family of geometric constants which can be used to evaluate the quality of random number generators. We explicitly apply the GRIP tests to several random number generators frequently used in Monte Carlo simulations, and demonstrate a statistical property for good random number generators.

Shu-Ju Tu and Ephraim Fischbach

2003-01-28T23:59:59.000Z

433

Memory consistency models for high performance distributed computing  

E-Print Network (OSTI)

This thesis develops a mathematical framework for specifying the consistency guarantees of high performance distributed shared memory multiprocessors. This framework is based on computations, which specify the operations ...

Luchangco, Victor

2001-01-01T23:59:59.000Z

434

False Memories of UFO Encounters: An fMRI Investigation .  

E-Print Network (OSTI)

??The idea of ‘false memories’ for traumatic events has powered numerous controversies. For this reason, the present study was designed as an attempt to resolve… (more)

Lambrinos, Angela

2011-01-01T23:59:59.000Z

435

Experimental and Simulation Study of Resistive Switches for Memory Applications  

E-Print Network (OSTI)

7, 8]), so that the resistance of the material will changebased Resistance change Memory” Advanced Materials 2008, 20,material on the top, it effectively determines the overall resistance

Pan, Feng

2012-01-01T23:59:59.000Z

436

Rebuilding it Better: Greensburg, Kansas, Kiowa County Memorial...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

& Publications Rebuilding it Better: Greensburg, Kansas, Kiowa County Memorial Hospital (Brochure) (Revised) DOE and NREL Technical Assistance Building Green in Greensburg:...

437

Rebuilding it Better: Greensburg, Kansas, Kiowa County Memorial...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

the sustainable and green aspects of the LEED Platinum-designed Kiowa County Memorial Hospital in Greensburg, Kansas. 47461.pdf More Documents & Publications Rebuilding it Better:...

438

Rebuilding it Better: Greensburg, Kansas, Kiowa County Memorial Hospital (Brochure)  

SciTech Connect

This brochure details the sustainable and green aspects of the LEED Platinum-designed Kiowa County Memorial Hospital in Greensburg, Kansas.

Not Available

2010-03-01T23:59:59.000Z

439

Recommendation 196: Alternatives to Memorialize the K-25 Building  

Energy.gov (U.S. Department of Energy (DOE))

The ORSSAB Recommends to DOE Alternatives to Memorialize the K-25 Building at East Tennessee Technology Park and Manhattan Project Exhibits in Oak Ridge, Tennessee.

440

Life-cycle assessment of NAND flash memory  

E-Print Network (OSTI)

OF SSD VS . HDD Primary energy consumption MJ 96 GB ?ashpaired trends, primary energy consumption per gigabyte (GB)have been Fig. 2. Primary energy consumption per memory

Boyd, Sarah; Horvath, A; Dornfeld, David

2010-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Building Green in Greensburg: Kiowa County Memorial Hospital  

Office of Energy Efficiency and Renewable Energy (EERE)

This poster highlights energy efficiency, renewable energy, and sustainable features of the high-performing Kiowa County Memorial Hospital building in Greensburg, Kansas.

442

Optimization Online - On Efficiently Combining Limited Memory and ...  

E-Print Network (OSTI)

Nov 25, 2013 ... Abstract: Limited memory quasi-Newton methods and trust-region methods represent two efficient approaches used for solving unconstrained ...

Oleg Burdakov

2013-11-25T23:59:59.000Z

443

Memory Effects and Transport Coefficients for Non-Newtonian Fluids  

E-Print Network (OSTI)

We discuss the roles of viscosity in relativistic fluid dynamics from the point of view of memory effects. Depending on the type of quantity to which the memory effect is applied, different terms appear in higher order corrections. We show that when the memory effect applies on the extensive quantities, the hydrodynamic equations of motion become non-singular. We further discuss the question of memory effect in the derivation of transport coefficients from a microscopic theory. We generalize the application of the Green-Kubo-Nakano (GKN) to calculate transport coefficients in the framework of projection operator formalism, and derive the general formula when the fluid is non-Newtonian.

T. Kodama; T. Koide

2008-12-22T23:59:59.000Z

444

Optimization Online - A regularized limited-memory BFGS method ...  

E-Print Network (OSTI)

Aug 4, 2014 ... Abstract: The limited-memory BFGS (L-BFGS) algorithm is a popular method of solving large-scale unconstrained minimization problems.

Shinji Sugimoto

2014-08-04T23:59:59.000Z

445

U-205: RSA Access Manager Session Replay Flaw Lets Remote Users Access the  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: RSA Access Manager Session Replay Flaw Lets Remote Users 5: RSA Access Manager Session Replay Flaw Lets Remote Users Access the System U-205: RSA Access Manager Session Replay Flaw Lets Remote Users Access the System July 5, 2012 - 7:02am Addthis PROBLEM: RSA Access Manager Session Replay Flaw Lets Remote Users Access the System PLATFORM: Version(s): Server version 6.0.x, 6.1, 6.1 SP1, 6.1 SP2, 6.1 SP3; all Agent versions ABSTRACT: A vulnerability was reported in RSA Access Manager. A remote user can gain access to the target system. reference LINKS: SecurityFocus ESA-2012-026 SecurityTracker Alert ID: 1027220 CVE-2012-2281 RSA SecurCare Online MPACT ASSESSMENT: Medium Discussion: RSA Access Manager contains a vulnerability that can be potentially exploited by a malicious user to replay the session with compromised session tokens. This is due to improper invalidation of session tokens

446

U-205: RSA Access Manager Session Replay Flaw Lets Remote Users Access the  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

205: RSA Access Manager Session Replay Flaw Lets Remote Users 205: RSA Access Manager Session Replay Flaw Lets Remote Users Access the System U-205: RSA Access Manager Session Replay Flaw Lets Remote Users Access the System July 5, 2012 - 7:02am Addthis PROBLEM: RSA Access Manager Session Replay Flaw Lets Remote Users Access the System PLATFORM: Version(s): Server version 6.0.x, 6.1, 6.1 SP1, 6.1 SP2, 6.1 SP3; all Agent versions ABSTRACT: A vulnerability was reported in RSA Access Manager. A remote user can gain access to the target system. reference LINKS: SecurityFocus ESA-2012-026 SecurityTracker Alert ID: 1027220 CVE-2012-2281 RSA SecurCare Online MPACT ASSESSMENT: Medium Discussion: RSA Access Manager contains a vulnerability that can be potentially exploited by a malicious user to replay the session with compromised session tokens. This is due to improper invalidation of session tokens

447

The Theory of Random Laser Systems  

SciTech Connect

Studies of random laser systems are a new direction with promising potential applications and theoretical interest. The research is based on the theories of localization and laser physics. So far, the research shows that there are random lasing modes inside the systems which is quite different from the common laser systems. From the properties of the random lasing modes, they can understand the phenomena observed in the experiments, such as multi-peak and anisotropic spectrum, lasing mode number saturation, mode competition and dynamic processes, etc. To summarize, this dissertation has contributed the following in the study of random laser systems: (1) by comparing the Lamb theory with the Letokhov theory, the general formulas of the threshold length or gain of random laser systems were obtained; (2) they pointed out the vital weakness of previous time-independent methods in random laser research; (3) a new model which includes the FDTD method and the semi-classical laser theory. The solutions of this model provided an explanation of the experimental results of multi-peak and anisotropic emission spectra, predicted the saturation of lasing modes number and the length of localized lasing modes; (4) theoretical (Lamb theory) and numerical (FDTD and transfer-matrix calculation) studies of the origin of localized lasing modes in the random laser systems; and (5) proposal of using random lasing modes as a new path to study wave localization in random systems and prediction of the lasing threshold discontinuity at mobility edge.

Xunya Jiang

2002-06-27T23:59:59.000Z

448

Focusing and energy deposition inside random media  

Science Journals Connector (OSTI)

The degree of control over waves transmitted through random media is determined by characteristics of the singular values of the transmission matrix. This Letter explores focusing and...

Cheng, Xiaojun; Genack, Azriel Z

2014-01-01T23:59:59.000Z

449

How Can Random Noise Help Us  

E-Print Network (OSTI)

How Can Random Noise Help Us. Global Transports from Thermal Fluctuations. Aaron N. K. Yip. Department of Mathematics. Purdue University. 0. 1. 2. 3. 4. 5. 6.

2009-03-18T23:59:59.000Z

450

PARS II User Account Access Guide  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Office of Management Office of Management Office of Engineering and Construction Management User Account Access Guide for PARS II Version 1.5 June 25, 2011 Submitted by: Energy Enterprise Solutions 20440 Century Blvd. Suite 150 Germantown, MD 20874 Phone 301-916-0050 Fax 301-916-0066 www.eesllc.net June 25, 2011 (V1.5) PARS II User Account Access Guide ii This page intentionally left blank. June 25, 2011 (V1.5) PARS II User Account Access Guide iii Title Page Document Name: User Account Access Guide for PARS II Version Number: V1.5 Publication Date: June 25, 2011 Contract Number: DE-AT01-06IM00102 Project Number: 1ME07 CLIN 4 Prepared by: Scott Burns, Energy Enterprise Solutions, LLC Reviewed by: Judith Bernsen, Energy Enterprise Solutions, LLC

451

Decision Analysis of Dynamic Spectrum Access Rules  

SciTech Connect

A current trend in spectrum regulation is to incorporate spectrum sharing through the design of spectrum access rules that support Dynamic Spectrum Access (DSA). This paper develops a decision-theoretic framework for regulators to assess the impacts of different decision rules on both primary and secondary operators. We analyze access rules based on sensing and exclusion areas, which in practice can be enforced through geolocation databases. Our results show that receiver-only sensing provides insufficient protection for primary and co-existing secondary users and overall low social welfare. On the other hand, using sensing information between the transmitter and receiver of a communication link, provides dramatic increases in system performance. The performance of using these link end points is relatively close to that of using many cooperative sensing nodes associated to the same access point and large link exclusion areas. These results are useful to regulators and network developers in understanding in developing rules for future DSA regulation.

Juan D. Deaton; Luiz A. DaSilva; Christian Wernz

2011-12-01T23:59:59.000Z

452

Cognitive Medium Access: Exploration, Exploitation and Competition  

E-Print Network (OSTI)

1 Cognitive Medium Access: Exploration, Exploitation and Competition Lifeng Lai, Hesham El Gamal, Hai Jiang and H. Vincent Poor Abstract-- This paper establishes the equivalence between cognitive cognitive user wishes to opportunistically exploit the availability of empty fre- quency bands

El-Gamal, Hesham

453

Abstracts of posters in Access in children  

Science Journals Connector (OSTI)

In paediatric hemodialysed patients it is often very difficult to realize a lasting vascular access with a balanced flow rate. To perform an effective surgical management without a serious injury to the vessel...

Gauke Kootstra MD; PhD; Paul J. G. Jörning MD; PhD

1983-01-01T23:59:59.000Z

454

Metadata Value Chain for Open Access Journals  

E-Print Network (OSTI)

In this session, Holly Mercer presented a case for finding global solutions to improve the metadata that is available for journals, particularly small, independent open access journals. She discussed the scholarly communication lifecycle...

Mercer, Holly; Dyas-Correia, Sharon

2011-01-01T23:59:59.000Z

455

JOBAID-ACCESSING AND MODIFYING TALENT PROFILE  

Energy.gov (U.S. Department of Energy (DOE))

The purpose of this job aid is to guide users through the step-by-step process of accessing their talent profiles, adding information to their profiles, and editing existing talent profile...

456

North Carolina Capital Access Program (North Carolina)  

Energy.gov (U.S. Department of Energy (DOE))

The North Carolina Capital Access Program provides matching reserve funds for business loans that are beyond the traditional lending means of a lender’s usual standards. The average CAP loan is ...

457

Property:EnergyAccessYearInitiated | Open Energy Information  

Open Energy Info (EERE)

EnergyAccessYearInitiated EnergyAccessYearInitiated Jump to: navigation, search Property Name EnergyAccessYearInitiated Property Type Date Description Year Initiated Pages using the property "EnergyAccessYearInitiated" Showing 10 pages using this property. B Benin: Increased Access to Modern Energy Project + 2009 + Burkina Faso Energy Access Project + 2007 + E Ethiopia Energy Access Project + 2005 + G Ghana Energy Development and Access Project (GEDAP) + 2007 + M Mongolia Renewable Energy and Rural Electricity Access Project + 2006 + P Papua New Guinea Improved Energy Access for Rural Communities + 2012 + R Republic of Yemen Energy Access Project + 2006 + S Sri Lanka Credit to Connect + 2011 + T Tanzania Energy Development and Access Expansion Project + 2007 + V Viet Nam Rural Electrification + 2009 +

458

Center for Nanoscale Materials User Access Program Overview  

NLE Websites -- All DOE Office Websites (Extended Search)

Materials User Access Program Overview Materials User Access Program Overview CNM User Access Program Overview 1. Objective ............................................................................................................................................... 1 2. Submission Guidelines .......................................................................................................................... 1 2.1 Proposal Content ............................................................................................................................ 1 3. Proposal Review Process ....................................................................................................................... 2 3.1 Proposal Evaluation Board .............................................................................................................. 2

459

Environment/Health/Safety/Security (EHSS): Building Access  

NLE Websites -- All DOE Office Websites (Extended Search)

Building Access Building Access Access Control - On-site access is controlled by either keys or by LBNL's automated access control system. LBNL's automated access control system is used for exterior perimeter doors to most buildings, as well as some individual labs, offices, and equipment. The access system is linked to the LBNL Human Resources PeopleSoft database and is updated with the employees' or affiliates' current appointment status at the Laboratory. . If your LBNL appointment end date has expired, then your access will be suspended. Security Access Managers (SAM) Administrators - LBNL's automated access control system is a decentralized access permission control structure managed by each Division or major program via Security Access Managers (SAM) Administrators and In-putters. Go here for the current

460

Nemesis: Preventing Authentication & Access Control Vulnerabilities in Web Applications  

E-Print Network (OSTI)

Nemesis: Preventing Authentication & Access Control Vulnerabilities in Web Applications Michael web applications. Authentication attacks occur when a web application authenticates users unsafely, granting access to web clients that lack the ap- propriate credentials. Access control attacks occur when

Sabatini, David M.

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

A rough set-based corporate memory for the case of ecotourism  

Science Journals Connector (OSTI)

Abstract Corporate memory (CM) is a major asset of any modern organization and provides access to the strategic knowledge and experience making a company more competitive. Until now, CM has not been broadly applied to tourisms, where changes are rapid, both in the nature of eco-tourist behavior and impact on the environment. In order to develop sustainable ecotourism, agile decision-making based on rules induced from data is required. However, ecotourism often provides numerous qualitative data. The qualitative nature of the data makes it difficult to analyze using standard statistical techniques. The rough set approach is suitable for processing qualitative information. In this paper, the proposed CM is incorporated within the rough set in the tourism sector, to provide efficient knowledge management for resolving the problems: (1) to understand the purposes for traveling of tourists and their feedback, and (2) to improve a travel package for attracting valued eco-tourists and reducing environmental damage.

Chun-Che Huang; Wen-Yau Liang; Tzu-Liang (Bill) Tseng; Ruo-Yin Wong

2015-01-01T23:59:59.000Z

462

Computational Thermodynamics of CoNiGa High Temperature Shape Memory Alloys  

E-Print Network (OSTI)

Shape Memory Alloys (SMAs) are advanced materials with interesting properties such as pseudoelasticity (PE) and the shape memory effect (SME). Recently, the CoNiGa system has emerged as the basis for very promising High Temperature Shape Memory...

Chari, Arpita

2012-10-19T23:59:59.000Z

463

Memory, brain and aging: The good, the bad and the promising  

E-Print Network (OSTI)

temporal region — endur- ing memory impairment following aE. 1994. What are the memory systems of 1994? In: SchacterDL, Tulving E (eds. ). Memory Systems 1994. Cambridge, MA:

Ober, Beth A.

2010-01-01T23:59:59.000Z

464

Prospective memory impairment in early breast cancer survivors: Finally homing in on the real deficit?  

Science Journals Connector (OSTI)

...2012; San Antonio, TX Prospective memory impairment in early breast cancer survivors...early breast cancer (EBC) treatment on memory functioning. One limitation of existing...may not be sensitive enough to detect memory problems as encountered in daily life...

S Verma; B Collins; X Song; M Bedard; L Paquet

2012-12-17T23:59:59.000Z

465

Memory in Microbes: Quantifying History-Dependent Behavior in a Bacterium  

E-Print Network (OSTI)

4. Casadesus J, D'Ari R (2002) Memory in bacteria and phage.2004) Switches, cross?talk and memory in Escherichia coli2007) Rational design of memory in eukaryotic cells. Genes

Wolf, Denise M.

2009-01-01T23:59:59.000Z

466

Memory in microbes: quantifying history-Dependent behavior in a bacterium.  

E-Print Network (OSTI)

4. Casadesus J, D'Ari R (2002) Memory in bacteria and phage.2004) Switches, cross-talk and memory in Escherichia coli2007) Rational design of memory in eukaryotic cells. Genes

Wolf, Denise M.

2010-01-01T23:59:59.000Z

467

Memory-like CD8? T cells generated during homeostatic proliferation defer to antigen-experienced memory cells.  

E-Print Network (OSTI)

??Naïve T cells proliferate in response to lymphopenia and acquire the phenotypic and functional qualities of memory T cells, providing enhanced protection against infection. How… (more)

Cheung, Kitty Pui Hang

2009-01-01T23:59:59.000Z

468

Hippocampal damage impairs recognition memory broadly, affecting both parameters in two prominent models of memory  

Science Journals Connector (OSTI)

...Psychology and Neuroscience Center, Brigham Young University, Provo, UT 84143; anddPulmonary...resulted from hypoxia secondary to heroin abuse. Yonelinas et al. (18, p. 395) wrote that...memory for travel scenes taken from the Internet, the DPSD model performed better (27...

Adam J. O. Dede; John T. Wixted; Ramona O. Hopkins; Larry R. Squire

2013-01-01T23:59:59.000Z

469

Effects of Constrained Aging on the Shape Memory Response of Nickel Rich Niti Shape Memory Alloys  

E-Print Network (OSTI)

Ni50.6Ti49.4 single and Ni52Ti48 polycrystalline shape memory alloy samples were subjected to aging under a uniaxial stress, to form a single Ni4Ti3 precipitate variant and to investigate the effects of single versus multi-variant coherent...

Barrie, Fatmata Haja

2011-02-22T23:59:59.000Z

470

Environment/Health/Safety/Security (EHSS): Site Access  

NLE Websites -- All DOE Office Websites (Extended Search)

Site Access Office Site Access Office Contact Information | Feedback Most-viewed links: Badging Getting a badge - new, stolen, or replacement. Building Access On-site access, key requests, Security Access Managers. Visitor Access Visitor passes, general information. Parking at the Lab Permits, parking map, vehicles registration, parking policy. Other information: FAQ Frequently Asked Questions. Foreign National Access Information on access to DOE sites. Gate Information Information on the different Lab gates. Getting to the Lab Directions and options for getting to Berkeley Lab: buses, carpooling, rapid transit, biking. Guest House Guest House information. Lost and Found Lost and found information and contacts. Meeting and Conference Meeting and conference procedures and general information.

471

Public Roundtable- Data Access and Privacy Issues Related to...  

Office of Environmental Management (EM)

Public Roundtable- Data Access and Privacy Issues Related to Smart Grid Technologies Public Roundtable- Data Access and Privacy Issues Related to Smart Grid Technologies Transcript...

472

National Geothermal Data Systems Data Acquisition and Access...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

National Geothermal Data Systems Data Acquisition and Access National Geothermal Data Systems Data Acquisition and Access Project objective: To support the acquisition of new and...

473

Overview of Access Authorization Process for Applicants, May...  

NLE Websites -- All DOE Office Websites (Extended Search)

& Reports Security Overview of Access Authorization Process for Applicants, May, 2013 Overview of Access Authorization Process for Applicants, May, 2013 May, 2013 This...

474

Re~ Request for Information NBP RFI: Data Access | Department...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

for Information NBP RFI: Data Access Re Request for Information NBP RFI: Data Access Xcel Energy, a combination electricity and natural gas utility operating in eight Midwestern...

475

Request for Information NBP RFI: Data Access | Department of...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Request for Information NBP RFI: Data Access Request for Information NBP RFI: Data Access Xcel Energy, a combination electricity and natural gas utility operating in eight...

476

SBA Expands Access to Contracting Opportunities for Women-Owned...  

Office of Environmental Management (EM)

SBA Expands Access to Contracting Opportunities for Women-Owned Small Businesses SBA Expands Access to Contracting Opportunities for Women-Owned Small Businesses January 22, 2013 -...

477

Property:EnergyAccessImpactAreas | Open Energy Information  

Open Energy Info (EERE)

Name EnergyAccessImpactAreas Property Type String Description Impact Areas Retrieved from "http:en.openei.orgwindex.php?titleProperty:EnergyAccessImpactAreas&oldid421177...

478

Property:EnergyAccessPowerSource | Open Energy Information  

Open Energy Info (EERE)

Name EnergyAccessPowerSource Property Type String Description Power Source Retrieved from "http:en.openei.orgwindex.php?titleProperty:EnergyAccessPowerSource&oldid421179...

479

Pre-Packaged Commercial Property-Accessed Clean Energy Financing...  

Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

Packaged Commercial Property-Accessed Clean Energy Financing Solutions - 2014 BTO Peer Review Pre-Packaged Commercial Property-Accessed Clean Energy Financing Solutions - 2014 BTO...

480

Instructions for using HSPD-12 Authenticated Outlook Web Access...  

Energy Savers (EERE)

Instructions for using HSPD-12 Authenticated Outlook Web Access (OWA) Instructions for using HSPD-12 Authenticated Outlook Web Access (OWA) Provides instructions for remote Outlook...

Note: This page contains sample records for the topic "random access memory" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

Oil Price Trackers Inspired by Immune Memory  

E-Print Network (OSTI)

We outline initial concepts for an immune inspired algorithm to evaluate and predict oil price time series data. The proposed solution evolves a short term pool of trackers dynamically, with each member attempting to map trends and anticipate future price movements. Successful trackers feed into a long term memory pool that can generalise across repeating trend patterns. The resulting sequence of trackers, ordered in time, can be used as a forecasting tool. Examination of the pool of evolving trackers also provides valuable insight into the properties of the crude oil market.

Wilson, WIlliam; Aickelin, Uwe

2010-01-01T23:59:59.000Z

482

Betti numbers of random real hypersurfaces and determinants of random symmetric matrices  

E-Print Network (OSTI)

Betti numbers of random real hypersurfaces and determinants of random symmetric matrices Damien Betti numbers of random real hypersurfaces in smooth real projective manifolds. Our upper bounds grow get exponentially small away from mid-dimensional Betti numbers. In order to get these results, we

Paris-Sud XI, Université de

483

Hamilton Cycles Containing Randomly Selected Edges in Random Regular Graphs \\Lambda  

E-Print Network (OSTI)

Hamilton Cycles Containing Randomly Selected Edges in Random Regular Graphs \\Lambda R. W. Robinson oriented root edges have been randomly specified for the cycle to contain. The Hamilton cycle must be orientable to agree with all of the orientations on the j root edges. It is shown that the requisite Hamilton

Robinson, Robert W.

484

Measure, Randomness and Sublocales Alex Simpson  

E-Print Network (OSTI)

Measure, Randomness and Sublocales Alex Simpson Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, UK Abstract This paper investigates aspects of measure and randomness in the context of locale theory (point-free topology). We prove that every measure (-continuous

Simpson, Alex

485

Introduction to Network Science 1 Random Models  

E-Print Network (OSTI)

Introduction to Network Science 1 Random Models #12;Introduction to Network Science 2 mean degree in a graph with exactly m edges Taylor series reminder: #12;Introduction to Network Science 3 In contrast to the degree distribution in random model ... #12;Introduction to Network Science 4 In contrast to the degree

Safro, Ilya

486

Lattice Vibration and Random Walk Problems  

Science Journals Connector (OSTI)

......1960 research-article Articles Lattice Vibration and Random Walk Problems Ei Teramoto...Mathematical relations between the lattice vibration and the random walk problems are presented...the frequency spectrum of the lattice vibration can be expressed in terms of the transition......

Ei Teramoto

1960-12-01T23:59:59.000Z

487

Randomized Parallel Algorithms in Optimization Stephen Wright  

E-Print Network (OSTI)

Randomized Parallel Algorithms in Optimization Stephen Wright University of Wisconsin-Madison July 2013 Wright (UW-Madison) Random Parallel Optimization July 2013 1 / 52 #12;Collaborators @ UW-Madison Victor Bittorf Ji Liu Ben Recht ( Berkeley) Chris R´e ( Stanford) Krishna Sridhar Wright (UW

488

High speed optical quantum random number generation  

E-Print Network (OSTI)

High speed optical quantum random number generation Martin F¨urst1,2,, Henning Weier1,2, Sebastian, ready-for-use quantum random number generator (QRNG) whose stochastic model is based on the ran- domness directly delivered to a PC, generated at a rate of up to 50 Mbit/s, clearly pass all tests relevant

Weinfurter, Harald

489

Memory management in a large project developed in C/C++.  

E-Print Network (OSTI)

?? This thesis has been a study in memory management in C/C++, with practical work in finding and solving memory leaks in a large project.… (more)

Suopanki, Peter

2012-01-01T23:59:59.000Z

490

E-Print Network 3.0 - anterograde associative memory Sample Search...  

NLE Websites -- All DOE Office Websites (Extended Search)

associative memory Search Powered by Explorit Topic List Advanced Search Sample search results for: anterograde associative memory Page: << < 1 2 3 4 5 > >> 1 Reduction in Learning...

491

E-Print Network 3.0 - auditory memory induced Sample Search Results  

NLE Websites -- All DOE Office Websites (Extended Search)

memory induced Search Powered by Explorit Topic List Advanced Search Sample search results for: auditory memory induced Page: << < 1 2 3 4 5 > >> 1 PERSPECTIVES timely to consider...

492

E-Print Network 3.0 - aversive memory recall Sample Search Results  

NLE Websites -- All DOE Office Websites (Extended Search)

memory recall Search Powered by Explorit Topic List Advanced Search Sample search results for: aversive memory recall Page: << < 1 2 3 4 5 > >> 1 Behavioural Brain Research 125...

493

E-Print Network 3.0 - alters memory anxiety Sample Search Results  

NLE Websites -- All DOE Office Websites (Extended Search)

memory anxiety Search Powered by Explorit Topic List Advanced Search Sample search results for: alters memory anxiety Page: << < 1 2 3 4 5 > >> 1 Neurobiology of...

494

Flash Memory Garbage Collection in Hard Real-Time Systems  

E-Print Network (OSTI)

-date behavior and time consuming garbage collection mechanism, NAND-based flash memory is difficult to integrate into hard-real-time embedded systems. In this thesis, I propose a performance model for flash memory garbage collection that can be used...

Lai, Chien-An

2012-10-19T23:59:59.000Z

495

When long memory meets the Kalman filter: A comparative study  

Science Journals Connector (OSTI)

The finite sample properties of the state space methods applied to long memory time series are analyzed through Monte Carlo simulations. The state space setup allows to introduce a novel modeling approach in the long memory framework, which directly ... Keywords: ARFIMA models, Level shifts, Measurement error, Missing observations, State space

Stefano Grassi, Paolo Santucci De Magistris

2014-08-01T23:59:59.000Z

496

ESSES 2003 2003, Carla Schlatter Ellis Power-Aware Memory  

E-Print Network (OSTI)

1 ESSES 2003© 2003, Carla Schlatter Ellis Power-Aware Memory Management 2ESSES 2003© 2003, Carla management · OS page allocation policies · Experimental results · Future work, open questions #12;2 3ESSES Allocation [ASPLOS00] ESSES 2003© 2003, Carla Schlatter Ellis Memory System Power Consumption · Laptop

Ellis, Carla

497

Dynamic Loading of Polycrystalline Shape Memory Alloy Rods  

E-Print Network (OSTI)

Memory Alloys are a class of materials that change their internal struc- ture due to changes austenite phase (A). At low temperatures the material exists in a low symmetry martensite phase (M with the specific way the phase transition occurs (Funakubo, 1987). The shape memory effect allows material which

Popov, Peter

498

Stream and Memory Hierarchy Design for Multi-Purpose Accelerators  

E-Print Network (OSTI)

Stream and Memory Hierarchy Design for Multi-Purpose Accelerators Sylvain Girbal, Sami Yehia Hugues-purpose loop-based generated accelerators have emerged as an especially attractive accelerator option, with multiple streams, the memory behavior of such accelerators can become at least as complex

Boyer, Edmond

499

Data Representation for Efficient and Reliable Storage in Flash Memories  

E-Print Network (OSTI)

schemes are designed for already deployed low-power devices that use on-chip ash memory. Moreover, while devices at the scale of sensor nodes might switch to block-grained, large o -chip ash memory, RFID-scale platforms might not bene t from...

Wang, Yue

2013-05-02T23:59:59.000Z

500

Ubiquitous Memory Introspection Qin Zhao1,2  

E-Print Network (OSTI)

Center 4 Massachusetts Institute of Technology Abstract Modern memory systems play a critical role of a low cost, online, and accurate methodology for deriving fine- grained memory behavior profiles can delinquent load instruc- tions with an 88% rate of accuracy for applications with a relatively high number

Wong, Weng Fai