National Library of Energy BETA

Sample records for random access memory

  1. Some Randomly Accessed Memories From my Days at the ISI

    E-Print Network [OSTI]

    Jammalamadaka, S. Rao

    Some Randomly Accessed Memories From my Days at the ISI Sreenivasa Rao Jammalamadaka (J.S. Rao that would trump engineering. Along with my uncle who came to drop me off at the ISI, we entered the RTS at the ISI in those days, Professor only meant PCM and perhaps JBS because he didn't have a formal doctorate

  2. Spin-Hall-assisted magnetic random access memory

    SciTech Connect (OSTI)

    Brink, A. van den, E-mail: a.v.d.brink@tue.nl; Swagten, H. J. M.; Koopmans, B. [Physics of Nanostructures, Eindhoven University of Technology, 5600 MB Eindhoven (Netherlands)] [Physics of Nanostructures, Eindhoven University of Technology, 5600 MB Eindhoven (Netherlands); Cosemans, S.; Manfrini, M.; Van Roy, W.; Min, T. [imec, Kapeldreef 75, B-3001 Leuven (Belgium)] [imec, Kapeldreef 75, B-3001 Leuven (Belgium); Cornelissen, S.; Vaysset, A. [imec, Kapeldreef 75, B-3001 Leuven (Belgium) [imec, Kapeldreef 75, B-3001 Leuven (Belgium); Departement elektrotechniek (ESAT), KU Leuven, Kasteelpark Arenberg 10, B-3001 Heverlee (Belgium)

    2014-01-06

    We propose a write scheme for perpendicular spin-transfer torque magnetoresistive random-access memory that significantly reduces the required tunnel current density and write energy. A sub-nanosecond in-plane polarized spin current pulse is generated using the spin-Hall effect, disturbing the stable magnetic state. Subsequent switching using out-of-plane polarized spin current becomes highly efficient. Through evaluation of the Landau-Lifshitz-Gilbert equation, we quantitatively assess the viability of this write scheme for a wide range of system parameters. A typical example shows an eight-fold reduction in tunnel current density, corresponding to a fifty-fold reduction in write energy, while maintaining a 1?ns write time.

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

    DOE Patents [OSTI]

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

    2013-05-21

    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.

  4. Materials Selection for Oxide-based Resistive Random Access Memories

    E-Print Network [OSTI]

    Guo, Yuzheng; Robertson, John

    2014-12-05

    and interstitials in four key oxides used for RRAM; HfO2, TiO2, Ta2O5 and Al2O3, so as to understand which properties are critical for memory operation. An oxide-based RRAM consists of an oxide layer between two electrodes and with a thin metal layer next...

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

    SciTech Connect (OSTI)

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

    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.

  6. Voltage induced magnetostrictive switching of nanomagnets: Strain assisted strain transfer torque random access memory

    SciTech Connect (OSTI)

    Khan, Asif Nikonov, Dmitri E.; Manipatruni, Sasikanth; Ghani, Tahir; Young, Ian A.

    2014-06-30

    A spintronic device, called the “strain assisted spin transfer torque (STT) random access memory (RAM),” is proposed by combining the magnetostriction effect and the spin transfer torque effect which can result in a dramatic improvement in the energy dissipation relative to a conventional STT-RAM. Magnetization switching in the device which is a piezoelectric-ferromagnetic heterostructure via the combined magnetostriction and STT effect is simulated by solving the Landau-Lifshitz-Gilbert equation incorporating the influence of thermal noise. The simulations show that, in such a device, each of these two mechanisms (magnetostriction and spin transfer torque) provides in a 90° rotation of the magnetization leading a deterministic 180° switching with a critical current significantly smaller than that required for spin torque alone. Such a scheme is an attractive option for writing magnetic RAM cells.

  7. In situ observation of nickel as an oxidizable electrode material for the solid-electrolyte-based resistive random access memory

    SciTech Connect (OSTI)

    Sun, Jun; Wu, Xing; Xu, Feng; Xu, Tao; Sun, Litao [SEU-FEI Nano-Pico Center, Key Laboratory of MEMS of Ministry of Education, Southeast University, Nanjing 210096 (China)] [SEU-FEI Nano-Pico Center, Key Laboratory of MEMS of Ministry of Education, Southeast University, Nanjing 210096 (China); Liu, Qi; Xie, Hongwei; Long, Shibing; Lv, Hangbing; Li, Yingtao; Liu, Ming [Laboratory of Nano-fabrication and Novel Devices Integrated Technology, Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029 (China)] [Laboratory of Nano-fabrication and Novel Devices Integrated Technology, Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029 (China)

    2013-02-04

    In this letter, we dynamically investigate the resistive switching characteristics and physical mechanism of the Ni/ZrO{sub 2}/Pt device. The device shows stable bipolar resistive switching behaviors after forming process, which is similar to the Ag/ZrO{sub 2}/Pt and Cu/ZrO{sub 2}/Pt devices. Using in situ transmission electron microscopy, we observe in real time that several conductive filaments are formed across the ZrO{sub 2} layer between Ni and Pt electrodes after forming. Energy-dispersive X-ray spectroscopy results confirm that Ni is the main composition of the conductive filaments. The ON-state resistance increases with increasing temperature, exhibiting the feature of metallic conduction. In addition, the calculated resistance temperature coefficient is equal to that of the 10-30 nm diameter Ni nanowire, further indicating that the nanoscale Ni conductive bridge is the physical origin of the observed conductive filaments. The resistive switching characteristics and the conductive filament's component of Ni/ZrO{sub 2}/Pt device are consistent with the characteristics of the typical solid-electrolyte-based resistive random access memory. Therefore, aside from Cu and Ag, Ni can also be used as an oxidizable electrode material for resistive random access memory applications.

  8. Effect of embedded metal nanocrystals on the resistive switching characteristics in NiN-based resistive random access memory cells

    SciTech Connect (OSTI)

    Yun, Min Ju; Kim, Hee-Dong; Man Hong, Seok; Hyun Park, Ju; Su Jeon, Dong; Geun Kim, Tae, E-mail: tgkim1@korea.ac.kr [School of Electrical Engineering, Korea University, Seoul 136-701 (Korea, Republic of)

    2014-03-07

    The metal nanocrystals (NCs) embedded-NiN-based resistive random access memory cells are demonstrated using several metal NCs (i.e., Pt, Ni, and Ti) with different physical parameters in order to investigate the metal NC's dependence on resistive switching (RS) characteristics. First, depending on the electronegativity of metal, the size of metal NCs is determined and this affects the operating current of memory cells. If metal NCs with high electronegativity are incorporated, the size of the NCs is reduced; hence, the operating current is reduced owing to the reduced density of the electric field around the metal NCs. Second, the potential wells are formed by the difference of work function between the metal NCs and active layer, and the barrier height of the potential wells affects the level of operating voltage as well as the conduction mechanism of metal NCs embedded memory cells. Therefore, by understanding these correlations between the active layer and embedded metal NCs, we can optimize the RS properties of metal NCs embedded memory cells as well as predict their conduction mechanisms.

  9. Perpendicular spin transfer torque magnetic random access memories with high spin torque efficiency and thermal stability for embedded applications (invited)

    SciTech Connect (OSTI)

    Thomas, Luc, E-mail: luc.thomas@headway.com; Jan, Guenole; Zhu, Jian; Liu, Huanlong; Lee, Yuan-Jen; Le, Son; Tong, Ru-Ying; Pi, Keyu; Wang, Yu-Jen; Shen, Dongna; He, Renren; Haq, Jesmin; Teng, Jeffrey; Lam, Vinh; Huang, Kenlin; Zhong, Tom; Torng, Terry; Wang, Po-Kang [TDK-Headway Technologies, Inc., Milpitas, California 95035 (United States)

    2014-05-07

    Magnetic random access memories based on the spin transfer torque phenomenon (STT-MRAMs) have become one of the leading candidates for next generation memory applications. Among the many attractive features of this technology are its potential for high speed and endurance, read signal margin, low power consumption, scalability, and non-volatility. In this paper, we discuss our recent results on perpendicular STT-MRAM stack designs that show STT efficiency higher than 5?k{sub B}T/?A, energy barriers higher than 100?k{sub B}T at room temperature for sub-40?nm diameter devices, and tunnel magnetoresistance higher than 150%. We use both single device data and results from 8?Mb array to demonstrate data retention sufficient for automotive applications. Moreover, we also demonstrate for the first time thermal stability up to 400?°C exceeding the requirement of Si CMOS back-end processing, thus opening the realm of non-volatile embedded memory to STT-MRAM technology.

  10. Dynamic Modeling and Analysis for Design of Memristive and Static Random Access Memories 

    E-Print Network [OSTI]

    Ho, Yenpo

    2014-08-27

    . By starting from basic memristor device equations, this work aims to develop a comprehensive set of properties and design equations for memristor based memory. The introduced schemes are specifically targeting key device properties relevant to memory...

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

    SciTech Connect (OSTI)

    Fang, Runchen; Yu, Shimeng; Gonzalez Velo, Yago; Chen, Wenhao; Holbert, Keith E.; Kozicki, Michael N.; Barnaby, Hugh

    2014-05-05

    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.

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

    SciTech Connect (OSTI)

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

    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.

  13. Remote direct memory access

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.

    2012-12-11

    Methods, parallel computers, and computer program products are disclosed for remote direct memory access. Embodiments include transmitting, from an origin DMA engine on an origin compute node to a plurality target DMA engines on target compute nodes, a request to send message, the request to send message specifying a data to be transferred from the origin DMA engine to data storage on each target compute node; receiving, by each target DMA engine on each target compute node, the request to send message; preparing, by each target DMA engine, to store data according to the data storage reference and the data length, including assigning a base storage address for the data storage reference; sending, by one or more of the target DMA engines, an acknowledgment message acknowledging that all the target DMA engines are prepared to receive a data transmission from the origin DMA engine; receiving, by the origin DMA engine, the acknowledgement message from the one or more of the target DMA engines; and transferring, by the origin DMA engine, data to data storage on each of the target compute nodes according to the data storage reference using a single direct put operation.

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

    E-Print Network [OSTI]

    Wicaksono, Aulia Tegar

    2009-01-01

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

  15. Random access wireless networks with controlled mobility

    E-Print Network [OSTI]

    Modiano, Eytan H.

    This paper considers wireless networks where messages arriving randomly (in time and space) are collected by a mobile receiver. The messages are transmitted to the mobile receiver according to a random access scheme and ...

  16. Low latency memory access and synchronization

    DOE Patents [OSTI]

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

    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.

  17. Low latency memory access and synchronization

    DOE Patents [OSTI]

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

    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.

  18. Hydrodynamical random walker with chemotactic memory

    E-Print Network [OSTI]

    H. Mohammady; B. Esckandariun; A. Najafi

    2014-10-01

    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.

  19. Effect of annealing treatment on the electrical characteristics of Pt/Cr-embedded ZnO/Pt resistance random access memory devices

    SciTech Connect (OSTI)

    Chang, Li-Chun; Kao, Hsuan-Ling; Liu, Keng-Hao

    2014-03-15

    ZnO/Cr/ZnO trilayer films sandwiched with Pt electrodes were prepared for nonvolatile resistive memory applications. The threshold voltage of a ZnO device embedded with a 3-nm Cr interlayer was approximately 50% lower than that of a ZnO monolayer device. This study investigated threshold voltage as a function of Cr thickness. Both the ZnO monolayer device and the Cr-embedded ZnO device structures exhibited resistance switching under electrical bias both before and after rapid thermal annealing (RTA) treatment, but resistive switching effects in the two cases exhibited distinct characteristics. Compared with the as-fabricated device, the memory cell after RTA demonstrated remarkable device parameter improvements, including a lower threshold voltage, a lower write current, and a higher R{sub off}/R{sub on} ratio. Both transmission electron microscope observations and Auger electron spectroscopy revealed that the Cr charge trapping layer in Cr-embedded ZnO dispersed uniformly into the storage medium after RTA, and x-ray diffraction and x-ray photoelectron spectroscopy analyses demonstrated that the Cr atoms lost electrons to become Cr{sup 3+} ions after dispersion. These results indicated that the altered status of Cr in ZnO/Cr/ZnO trilayer films during RTA treatment was responsible for the switching mechanism transition.

  20. Remote direct memory access over datagrams

    DOE Patents [OSTI]

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

    2014-12-02

    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.

  1. Direct memory access transfer completion notification

    DOE Patents [OSTI]

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

    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.

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

    DOE Patents [OSTI]

    Ohmacht, Martin

    2014-09-09

    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.

  3. Abstract of thesis Separating Instruction Fetches from Memory Accesses : ILAR

    E-Print Network [OSTI]

    Dietz, Henry G. "Hank"

    Abstract of thesis Separating Instruction Fetches from Memory Accesses : ILAR (Instruction Line access performance. This thesis investigates applying the same ideas to improve instruction access. ILAR instruction. This thesis proposes an instruction set architecture for ILAR, investigates a mechanism to load

  4. On admissible memory kernels for random unitary qubit evolution

    E-Print Network [OSTI]

    Filip A. Wudarski; Pawe? Nale?yty; Gniewomir Sarbicki; Dariusz Chru?ci?ski

    2015-04-12

    We analyze random unitary evolution of the qubit within memory kernel approach. We provide su?cient conditions which guarantee that the corresponding memory kernel generates physically legitimate quantum evolution. Interestingly, we are able to recover several well known examples and generate new classes of nontrivial qubit evolution. Surprisingly, it turns out that quantum evolution with memory kernel generated by our approach gives rise to vanishing non-Markovianity measure based on the distinguishability of quantum states.

  5. Direct access inter-process shared memory

    DOE Patents [OSTI]

    Brightwell, Ronald B; Pedretti, Kevin; Hudson, Trammell B

    2013-10-22

    A technique for directly sharing physical memory between processes executing on processor cores is described. The technique includes loading a plurality of processes into the physical memory for execution on a corresponding plurality of processor cores sharing the physical memory. An address space is mapped to each of the processes by populating a first entry in a top level virtual address table for each of the processes. The address space of each of the processes is cross-mapped into each of the processes by populating one or more subsequent entries of the top level virtual address table with the first entry in the top level virtual address table from other processes.

  6. Utility-Optimal Random Access for Wireless Multimedia Networks

    E-Print Network [OSTI]

    Wong, Vincent

    Utility-Optimal Random Access for Wireless Multimedia Networks Man Hon Cheung, Hamed Mohsenian-of-service (QoS) requirements, we model their utilities with concave, step, and quasi-concave functions. We to the users for random access, based on solving a non-convex network utility maximization problem. We propose

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

    DOE Patents [OSTI]

    Blocksome, Michael A; Mamidala, Amith R

    2014-02-11

    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.

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

    DOE Patents [OSTI]

    Blocksome, Michael A.; Mamidala, Amith R.

    2013-09-03

    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.

  9. Circuit-Switched Memory Access in Photonic Interconnection Networks for

    E-Print Network [OSTI]

    Bergman, Keren

    streaming access to memory, and very stringent energy constraints [12], [46], [50]. While commodity general characteristics that will impede per- formance scaling and energy efficiency for applications that require large lower frequencies, currently up to 1600 MT/s with the most recent DDR3 implementation [32]. Recent

  10. Direct memory access transfer completion notification

    DOE Patents [OSTI]

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

    2011-02-15

    DMA transfer completion notification includes: inserting, by an origin DMA engine on an origin node in an injection first-in-first-out (`FIFO`) buffer, a data descriptor for an application message to be transferred to a target node on behalf of an application on the origin 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 a packet header for a completion notification packet; transferring, by the origin DMA engine to the target node, the message in dependence upon the data descriptor; sending, by the origin DMA engine, the completion notification packet to a local reception FIFO buffer using a local memory FIFO transfer operation; and notifying, by the origin DMA engine, the application that transfer of the message is complete in response to receiving the completion notification packet in the local reception FIFO buffer.

  11. Administering an epoch initiated for remote memory access

    DOE Patents [OSTI]

    Blocksome, Michael A; Miller, Douglas R

    2014-03-18

    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.

  12. Administering an epoch initiated for remote memory access

    DOE Patents [OSTI]

    Blocksome, Michael A; Miller, Douglas R

    2012-10-23

    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.

  13. Administering an epoch initiated for remote memory access

    DOE Patents [OSTI]

    Blocksome, Michael A.; Miller, Douglas R.

    2013-01-01

    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.

  14. Quantum Random Access Codes using Single $d$-level Systems

    E-Print Network [OSTI]

    Armin Tavakoli; Alley Hameedi; Breno Marques; Mohamed Bourennane

    2015-04-30

    Random access codes (RACs) are used by a party to despite limited communication access an arbitrary subset of information held by another party. Quantum resources are known to enable RACs that break classical limitations. Here, we study quantum and classical RACs with high-level communication. We derive average performances of classical RACs and present families of high-level quantum RACs. Our results show that high-level quantum systems can significantly increase the advantage of quantum RACs over the classical counterparts. We demonstrate our findings in an experimental realization of a quantum RAC with four-level communication.

  15. Efficient Memory Access with NumPy Global Arrays using Local Memory Access

    SciTech Connect (OSTI)

    Daily, Jeffrey A.; Berghofer, Dan C.

    2013-08-03

    This paper discusses the work completed working with Global Arrays of data on distributed multi-computer systems and improving their performance. The tasks completed were done at Pacific Northwest National Laboratory in the Science Undergrad Laboratory Internship program in the summer of 2013 for the Data Intensive Computing Group in the Fundamental and Computational Sciences DIrectorate. This work was done on the Global Arrays Toolkit developed by this group. This toolkit is an interface for programmers to more easily create arrays of data on networks of computers. This is useful because scientific computation is often done on large amounts of data sometimes so large that individual computers cannot hold all of it. This data is held in array form and can best be processed on supercomputers which often consist of a network of individual computers doing their computation in parallel. One major challenge for this sort of programming is that operations on arrays on multiple computers is very complex and an interface is needed so that these arrays seem like they are on a single computer. This is what global arrays does. The work done here is to use more efficient operations on that data that requires less copying of data to be completed. This saves a lot of time because copying data on many different computers is time intensive. The way this challenge was solved is when data to be operated on with binary operations are on the same computer, they are not copied when they are accessed. When they are on separate computers, only one set is copied when accessed. This saves time because of less copying done although more data access operations were done.

  16. 2015 Salishan Random Access (Conference) | SciTech Connect

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield MunicipalTechnicalInformation4563 LLNL Small-scale Friction(TechnicalRandom Access Citation Details

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

    DOE Patents [OSTI]

    Gala, Alan; Ohmacht, Martin

    2014-09-02

    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.

  18. Spin-Hall-assisted magnetic random access memory (Journal Article) |

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail. (Conference)Feedback System in thewitness

  19. RandFile package for Mathematica for accessing file-based sources of randomness

    E-Print Network [OSTI]

    J. A. Miszczak; M. Wahl

    2015-03-15

    We present a package for Mathematica computer algebra system which allows the exploitation of local files as sources of random data. We provide the description of the package and illustrate its usage by showing some examples. We also compare the provided functionality with alternative sources of randomness, namely a built-in pseudo-random generator and the package for accessing hardware true random number generators.

  20. Packet acquisition for time-frequency hopped asynchronous random multiple access

    E-Print Network [OSTI]

    Nguyen, Hoang

    Packet acquisition for a time-frequency hopped asynchronous random multiple access (RMA) system is investigated. A novel analytical approach to performance evaluation is provided, which enables the waveform designer to ...

  1. Trading Infinite Memory for Uniform Randomness in Timed Games

    E-Print Network [OSTI]

    Henzinger, Thomas A.

    restriction on the game structure, and gives both players equally powerful options for advancing time specified as parity conditions. These games offer an appropriate model for the synthesis of real randomized real- time controllers are much simpler in structure than the corresponding pure controllers

  2. Trading Infinite Memory for Uniform Randomness in Timed Games #

    E-Print Network [OSTI]

    Henzinger, Thomas A.

    restriction on the game structure, and gives both players equally powerful options for advancing time objectives specified as parity conditions. These games o#er an appropriate model for the synthesis of real randomized real­ time controllers are much simpler in structure than the corresponding pure controllers

  3. Analyzing Energy Behavior of Spatial Access Methods for Memory-Resident Data

    E-Print Network [OSTI]

    Huang, Wei

    resources, storage capacity, battery energy, and connectivity, that are a consequence of design implications of spatial data storage and access methods for memory resident datasets. While there has been- formance trade-offs of different storage organizations for spatial data on resource-constrained mobile

  4. Making Write Less Blocking for Read Accesses in Phase Change Memory

    E-Print Network [OSTI]

    Zhu, Yifeng

    for read accesses caused by uninterrupted serialized writes. Micro-write breaks a large write into multiple-computing technology achieves much less power saving on memory chips than processors. While the power dissipation, the background power of DRAM chips stills accounts for more than 40% of DRAM power [2]. Fortunately, phase

  5. Improving the Performance of MPI Derived Datatypes by Optimizing Memory-Access Cost

    E-Print Network [OSTI]

    Sun, Xian-He

    1 Improving the Performance of MPI Derived Datatypes by Optimizing Memory-Access Cost Surendra Byna Argonne, IL 60439 {gropp, thakur}@mcs.anl.gov Abstract The MPI Standard supports derived datatypes, which data. In practice, however, few MPI implementations implement derived datatypes in a way that performs

  6. 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. Flikkema and Brent West Department of Electrical Engineering Northern Arizona University Flagstaff, AZ protocol design for wireless ad hoc networks is between proactive and reactive coor- dination, where

  7. Circuit design for embedded memory in low-power integrated circuits

    E-Print Network [OSTI]

    Qazi, Masood

    2012-01-01

    This thesis explores the challenges for integrating embedded static random access memory (SRAM) and non-volatile memory-based on ferroelectric capacitor technology-into lowpower integrated circuits. First considered is the ...

  8. Memory abstractions for parallel programming

    E-Print Network [OSTI]

    Lee, I-Ting Angelina

    2012-01-01

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

  9. Accessibility

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room News Publications Traditional Knowledge KiosksAbout UsAboutWeb Policies » Accessibility

  10. Accessibility

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory of raregovAboutRecovery Act Recovery ActARMAccelerators,Access to the

  11. A random matrix approach to detect defects in a strongly scattering polycrystal: how the memory effect can help overcome multiple scattering

    E-Print Network [OSTI]

    Shahjahan, Sharfine; Rupin, Fabienne; Chassignole, Bertrand; Derode, Arnaud

    2015-01-01

    We report on ultrasonic imaging in a random heterogeneous medium. The goal is to detect flaws embedded deeply into a polycrystalline material. A 64-element array of piezoelectric transmitters/receivers at a central frequency of 5 MHz is used to capture the Green's matrix in a backscattering configuration. Because of multiple scattering, conventional imaging completely fails to detect the deepest flaws. We utilize a random matrix approach, taking advantage of the deterministic coherence of the backscattered wave-field which is characteristic of single scattering and related to the memory effect. This allows us to separate single and multiple scattering contributions. As a consequence, we show that flaws are detected beyond the conventional limit, as if multiple scattering had been overcome.

  12. Leveraging Heterogeneity in DRAM Main Memories to Accelerate Critical Word Access Niladrish Chatterjee Manjunath Shevgoor Rajeev Balasubramonian Al Davis

    E-Print Network [OSTI]

    Balasubramonian, Rajeev

    manufacturers have produced chips with vastly differing latency and energy characteristics. This provides different latencies and energy per access. The limited prior work in this area has explored smart placement in a low-energy region. We design an architecture that has low complexity and that can accelerate

  13. E cient Use of Memory-Mapped Network Interfaces for Shared Memory Computing

    E-Print Network [OSTI]

    Scott, Michael L.

    E cient Use of Memory-Mapped Network Interfaces for Shared Memory Computing Nikolaos Hardavellas@cs.rochester.edu Abstract Memory-mapped network interfaces provide users with fast and cheap access to remote memory access capabilities of these networks suggest the need to re-evaluate the assumptions underlying

  14. Ferroelectric tunneling element and memory applications which utilize the tunneling element

    DOE Patents [OSTI]

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

    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.

  15. RTDB: A memory resident real-time object database

    SciTech Connect (OSTI)

    Jerzy M. Nogiec; Eugene Desavouret

    2003-06-04

    RTDB is a fast, memory-resident object database with built-in support for distribution. It constitutes an attractive alternative for architecting real-time solutions with multiple, possibly distributed, processes or agents sharing data. RTDB offers both direct and navigational access to stored objects, with local and remote random access by object identifiers, and immediate direct access via object indices. The database supports transparent access to objects stored in multiple collaborating dispersed databases and includes a built-in cache mechanism that allows for keeping local copies of remote objects, with specifiable invalidation deadlines. Additional features of RTDB include a trigger mechanism on objects that allows for issuing events or activating handlers when objects are accessed or modified and a very fast, attribute based search/query mechanism. The overall architecture and application of RTDB in a control and monitoring system is presented.

  16. Mechanical memory

    DOE Patents [OSTI]

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

    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.

  17. Mechanical memory

    DOE Patents [OSTI]

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

    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.

  18. Web Accessibility Accessibility

    E-Print Network [OSTI]

    Oklahoma, University of

    Web Accessibility #12;Accessibility Webaim This is a pre-y prolific site that vary based on the type of web content. StaFc, content managed and dynamic web sites can benefit from our accessibility review service. Rich media

  19. In-Line-Test of Variability and Bit-Error-Rate of HfOx-Based Resistive Memory

    E-Print Network [OSTI]

    Ji, B L; Ye, Q; Gausepohl, S; Deora, S; Veksler, D; Vivekanand, S; Chong, H; Stamper, H; Burroughs, T; Johnson, C; Smalley, M; Bennett, S; Kaushik, V; Piccirillo, J; Rodgers, M; Passaro, M; Liehr, M

    2015-01-01

    Spatial and temporal variability of HfOx-based resistive random access memory (RRAM) are investigated for manufacturing and product designs. Manufacturing variability is characterized at different levels including lots, wafers, and chips. Bit-error-rate (BER) is proposed as a holistic parameter for the write cycle resistance statistics. Using the electrical in-line-test cycle data, a method is developed to derive BERs as functions of the design margin, to provide guidance for technology evaluation and product design. The proposed BER calculation can also be used in the off-line bench test and build-in-self-test (BIST) for adaptive error correction and for the other types of random access memories.

  20. Galen Sasaki EE 361 University of Hawaii 1 Memory technologies

    E-Print Network [OSTI]

    Sasaki, Galen H.

    Galen Sasaki EE 361 University of Hawaii 1 Memory · Memory technologies · Memory hierarchy ­ Cache basics ­ Cache variations ­ Virtual memory · Synchronization Galen Sasaki EE 361 University of Hawaii 2 cell ­ Faster DRAM, e.g. synchronous DRAM #12;Galen Sasaki EE 361 University of Hawaii 3 ROM · Random

  1. Estimating memory locality for virtual machines on NUMA systems

    E-Print Network [OSTI]

    Milouchev, Alexandre (Alexandre M.)

    2013-01-01

    The multicore revolution sparked another, similar movement towards scalable memory architectures. With most machines nowadays exhibiting non-uniform memory access (NUMA) properties, software and operating systems have seen ...

  2. Unconditionally secure computers, algorithms and hardware, such as memories, processors, keyboards, flash and hard drives

    E-Print Network [OSTI]

    Laszlo B. Kish; Olivier Saidi

    2008-04-24

    In the case of the need of extraordinary security, Kirchhoff-loop-Johnson-(like)-noise ciphers can easily be integrated on existing types of digital chips in order to provide secure data communication between hardware processors, memory chips, hard disks and other units within a computer or other data processor system. The secure key exchange can take place at the very first run and the system can renew the key later at random times with an authenticated fashion to prohibit man-in-the-middle attack. The key can be stored in flash memories within the communicating chip units at hidden random addresses among other random bits that are continuously generated by the secure line but are never actually used. Thus, even if the system is disassembled, and the eavesdropper can have direct access to the communication lines between the units, or even if she is trying to use a man-in-the-middle attack, no information can be extracted. The only way to break the code is to learn the chip structure, to understand the machine code program and to read out the information during running by accessing the proper internal ports of the working chips. However such an attack needs extraordinary resources and even that can be prohibited by a password lockout. The unconditional security of commercial algorithms against piracy can be provided in a similar way.

  3. Testing for Subcellular Randomness

    E-Print Network [OSTI]

    Babatunde O. Okunoye

    2008-01-29

    Statistical tests were conducted on 1,000 numbers generated from the genome of Bacteriophage T4, obtained from GenBank with accession number AF158101.The numbers passed the non-parametric, distribution-free tests.Deoxyribonucleic acid was discovered to be a random number generator, existent in nature.

  4. This article was downloaded by:[Yale University Sterling Memorial Library] [Yale University Sterling Memorial Library

    E-Print Network [OSTI]

    Richardson, Andrew D.

    , formulae and drug doses should be independently verified with primary sources. The publisher shallThis article was downloaded by:[Yale University Sterling Memorial Library] [Yale University Sterling Memorial Library] On: 11 May 2007 Access Details: [subscription number 769486266] Publisher

  5. Associative memories: randomness, continuity and biological plausibility

    E-Print Network [OSTI]

    Segura, Enrique Carlos

    ¢sdq¢s ¢ &wa)Wt ¢Wtp F &tpe¢p &w )h&p r &w&p q)t 2j¢p s d &qk j)s p ¢w p Fr t p )ql&q¢kt u¢ tp tp q¢s r

  6. Direct memory access transfer completion notification

    SciTech Connect (OSTI)

    Archer, Charles J.; Blocksome, Michael A.; Parker, Jeffrey J.

    2010-08-17

    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.

  7. Direct memory access transfer completion notification

    SciTech Connect (OSTI)

    Archer, Charles J. , Blocksome; Michael A. , Parker; Jeffrey J.

    2011-02-15

    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.

  8. [ME]morial

    E-Print Network [OSTI]

    Lee, Beomki

    2015-01-01

    Challenging an archetypal relationship between collective memory and a multitude of traditional memorials, "[ME]morial" presents a new concept in memorial architecture based on the reinterpretation of Freud's and Bergson's ...

  9. RandomAccessECI_Final.pptx

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration wouldMassR&D100 Winners * Impacts on GlobalRachel2 RadiometerRafael L.Ralph

  10. Memory Considerations

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformationJesse BergkampCentermillion MeasurementMemorandum ofMemory Considerations Memory

  11. Memory Considerations

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformationJesse BergkampCentermillion MeasurementMemorandum ofMemory ConsiderationsMemory

  12. V-228: RealPlayer Buffer Overflow and Memory Corruption Error...

    Broader source: Energy.gov (indexed) [DOE]

    a memory corruption error and execute arbitrary code on the target system. IMPACT: Access control error SOLUTION: vendor recommends upgrading to version 16.0.3.51 Addthis...

  13. Accessible buildings Moderately accessible buildings*

    E-Print Network [OSTI]

    Lee, Dongwon

    Campus neighborhood map Moderately accessible paths** Accessible building entrance via parking lot to the University Park campus. This map, provided by UAC, is designed to assist persons with disabilities in finding accessibility. Your observations and suggestions regarding architectural For more information on UAC, you can

  14. Pseudo-random construction and reduced complexity decoding for low density parity check codes 

    E-Print Network [OSTI]

    Prabhakar, Abhiram

    2001-01-01

    The bipartite graph of an LDPC code is typically constructed at random. The memory required to store the randomly constructed parity-check matrix at the decoder can be prohibitive in some applications. When a system has a ...

  15. Nanopatterned ferroelectrics for ultrahigh density rad-hard nonvolatile memories.

    SciTech Connect (OSTI)

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

    2010-09-01

    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.

  16. Memory Considerations

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformationJesse BergkampCentermillion MeasurementMemorandum ofMemory Considerations

  17. Memory Considerations

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformationJesse BergkampCentermillion MeasurementMemorandum ofMemory

  18. Benchmarking the Memory Hierarchy of Modern GPUs

    E-Print Network [OSTI]

    Chu, Xiaowen

    GPUs Generation Tesla Fermi Kepler Device GeForce GTX 280 GeForce GTX 560 Ti GeForce GTX 780 Compute access efficiency [11­16]. The memory hierarchies are different from those of earlier generations. Our contributions are summarized as follows: #12;Table 1. Comparison of NVIDIA Tesla, Fermi and Kepler

  19. An optical simulation of shared memory

    SciTech Connect (OSTI)

    Goldberg, L.A.; Matias, Y.; Rao, S.

    1994-06-01

    We present a work-optimal randomized algorithm for simulating a shared memory machine (PRAM) on an optical communication parallel computer (OCPC). The OCPC model is motivated by the potential of optical communication for parallel computation. The memory of an OCPC is divided into modules, one module per processor. Each memory module only services a request on a timestep if it receives exactly one memory request. Our algorithm simulates each step of an n lg lg n-processor EREW PRAM on an n-processor OCPC in O(lg lg n) expected delay. (The probability that the delay is longer than this is at most n{sup {minus}{alpha}} for any constant {alpha}). The best previous simulation, due to Valiant, required {Theta}(lg n) expected delay.

  20. Hypergraph Partitioning for Automatic Memory Hierarchy Management

    SciTech Connect (OSTI)

    Krishnamoorthy, Sriram; Catalyurek, Umit; Nieplocha, Jarek; Rountev, Atanas; Sadayappan, Ponnuswamy

    2007-11-15

    The paper presents present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming framework. The programmer specifies the parallelism and locality in the computation. The scheduling of the computation into stages, together with the movement of the associated data between secondary storage and global memory, and between global memory and local memory, is automatically managed by the framework. A novel formulation of hypergraph partitioning is used to model the optimization problem of minimizing disk I/O by improving locality of access. Experimental evaluation of the proposed approach using a sub-computation from the quantum chemistry domain shows a reduction in the disk I/O cost by upto a factor of 11, and a reduction in turnaround time by upto 97%, as compared to alternatives used in state-of-the-art quantum chemistry codes.

  1. Optical memory

    DOE Patents [OSTI]

    Mao, Samuel S; Zhang, Yanfeng

    2013-07-02

    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.

  2. Information Access and Privacy Protection Office

    E-Print Network [OSTI]

    deYoung, Brad

    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

  3. Using on-package memory

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    3D stacked memory interposed between the KNL chip and the slower off-package DDR memory. Compared to the on-node DDR4 memory, the high-bandwidth memory (HBM) has...

  4. Drifting absence :: drafting memory

    E-Print Network [OSTI]

    Kuhn, Marlene Eva

    2006-01-01

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

  5. New Paradigms for Digital Generation and Post-Processing of Random Data

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    . The generated random binary sequences inherently have a high speed and a very high and robust entropy rate and memories in such devices. The output of a random number generator (RNG) is typically a binary sequenceNew Paradigms for Digital Generation and Post-Processing of Random Data #3; Jovan Dj. Goli#19;c

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

    SciTech Connect (OSTI)

    Jovanovi?, B. E-mail: lionel.torres@lirmm.fr; Brum, R. M.; Torres, L.

    2014-04-07

    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.

  7. Accessing PDSF

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room News Publications Traditional Knowledge KiosksAbout UsAboutWeb Policies »FacilitiesAccessing

  8. Accessibility | NREL

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory of raregovAboutRecovery Act Recovery ActARMAccelerators,Access toServices

  9. Gate Access

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory ofDid you not find whatGasEnergyfeatureCleanperformanceCareersGate Access Gate

  10. Remote Access

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservation of Fe(II) by Carbon-RichProtonAbout UsRegionalScientific andRemote Access Remote

  11. Using DMA for copying performance counter data to memory

    DOE Patents [OSTI]

    Gara, Alan; Salapura, Valentina; Wisniewski, Robert W

    2013-12-31

    A device for copying performance counter data includes hardware path that connects a direct memory access (DMA) unit to a plurality of hardware performance counters and a memory device. Software prepares an injection packet for the DMA unit to perform copying, while the software can perform other tasks. In one aspect, the software that prepares the injection packet runs on a processing core other than the core that gathers the hardware performance data.

  12. Using DMA for copying performance counter data to memory

    DOE Patents [OSTI]

    Gara, Alan; Salapura, Valentina; Wisniewski, Robert W.

    2012-09-25

    A device for copying performance counter data includes hardware path that connects a direct memory access (DMA) unit to a plurality of hardware performance counters and a memory device. Software prepares an injection packet for the DMA unit to perform copying, while the software can perform other tasks. In one aspect, the software that prepares the injection packet runs on a processing core other than the core that gathers the hardware performance counter data.

  13. RON MINER MEMORIAL BIOENGINEERING SCHOLARSHIP The Ron Miner Memorial Scholarship honors the memory of J. Ronald Miner, an

    E-Print Network [OSTI]

    Tullos, Desiree

    RON MINER MEMORIAL BIOENGINEERING SCHOLARSHIP The Ron Miner Memorial Scholarship honors the memory & Ecological Engineering. DONOR Ron Miner Memorial Bioengineering Scholarship Fund ELIGIBILITY REQUIREMENTS

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

    E-Print Network [OSTI]

    Adam, Salah

    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

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

    DOE Patents [OSTI]

    Ohmacht, Martin

    2013-09-10

    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.

  16. DMA-Aware Memory Energy Management Vivek Pandey, Weihang Jiang, Yuanyuan Zhou, and Ricardo Bianchini

    E-Print Network [OSTI]

    Bianchini, Ricardo

    DMA-Aware Memory Energy Management Vivek Pandey, Weihang Jiang, Yuanyuan Zhou, and Ricardo energy management, no study has focused on data servers, where main memory is predominantly accessed by DMAs instead of processors. In this paper, we study DMA-aware techniques for mem- ory energy management

  17. Successful Restoration of Arteriovenous Dialysis Access Patency after Late Intervention

    E-Print Network [OSTI]

    El-Damanawi, Ragada; Kershew, Stephanie; Campbell, Gary; Hiemstra, Thomas F.

    2014-11-16

    -intensity warfarin is ineffective for the prevention of PTFE graft failure in patients on hemodialysis: a randomized controlled trial. J Am Soc Nephrol 2002; 13: 2331–2337. Table 1: Baseline Patient and Access Characteristics PATIENTS n 38 Male (%) 21...

  18. [MRO] Oligocrystalline Shape Memory Alloys

    E-Print Network [OSTI]

    Chen, Ying

    Copper-based shape memory alloys (SMAs) exhibit excellent shape memory properties in single crystalline form. However, when they are polycrystalline, their shape memory properties are severely compromised by brittle fracture ...

  19. Random Walks and Electrical

    E-Print Network [OSTI]

    Jonathon Peterson

    2008-01-30

    Feb 4, 2008 ... Electrical Network Calculations in Random Walks in. Random ... Markov Chains. 2. Electrical Networks and Reversible Markov Chains. 3.

  20. Computer memory management system

    DOE Patents [OSTI]

    Kirk, III, Whitson John (Greenwood, MO)

    2002-01-01

    A computer memory management system utilizing a memory structure system of "intelligent" pointers in which information related to the use status of the memory structure is designed into the pointer. Through this pointer system, The present invention provides essentially automatic memory management (often referred to as garbage collection) by allowing relationships between objects to have definite memory management behavior by use of coding protocol which describes when relationships should be maintained and when the relationships should be broken. In one aspect, the present invention system allows automatic breaking of strong links to facilitate object garbage collection, coupled with relationship adjectives which define deletion of associated objects. In another aspect, The present invention includes simple-to-use infinite undo/redo functionality in that it has the capability, through a simple function call, to undo all of the changes made to a data model since the previous `valid state` was noted.

  1. Pointers and Structures in C Variables that hold memory addresses

    E-Print Network [OSTI]

    1 Pointers and Structures in C Chapter 4 2 Overview · Pointers · Variables that hold memory addresses · Using pointers to do "call-by-reference" in C · Struct · Multiple values grouped together · Dereferencing to access individual elements #12;3 Exercise: Write a swap function void swap(int x, int y

  2. Internet architecture Access networks

    E-Print Network [OSTI]

    architecture (1) router PC server wireless laptop smartphone Wired Communication links in router)/wireless access point Ethernet Wireless access point Wireless laptops Router links " connect end systems/routers/switches/access points " fiber, copper and radio " transmission rate

  3. Motivation Valued Outranking Digraphs Random Performance Tableaux Random Outranking Digraphs Conclusion Random Outranking Digraphs

    E-Print Network [OSTI]

    Bisdorff, Raymond

    Motivation Valued Outranking Digraphs Random Performance Tableaux Random Outranking Digraphs/CSC Leuven, January, 2009 Motivation Valued Outranking Digraphs Random Performance Tableaux Random Outranking Motivation Valued Outranking Digraphs Random Performance Tableaux Random Outranking Digraphs Conclusion

  4. A fast and memory-sparing probabilistic selection algorithm for the GPU

    SciTech Connect (OSTI)

    Monroe, Laura M; Wendelberger, Joanne; Michalak, Sarah

    2010-09-29

    A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements and the average time required for the algorithm. This algorithm is well-suited to more general parallel processors with multiple layers of memory hierarchy. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be especially useful for processors having a limited amount of fast memory available.

  5. Collective Memory Transfers for Multi-Core Chips

    SciTech Connect (OSTI)

    Michelogiannakis, George; Williams, Alexander; Shalf, John

    2013-11-13

    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.

  6. Exploring DRAM Organizations for Energy-Efficient and Resilient Exascale Memories

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    Exploring DRAM Organizations for Energy-Efficient and Resilient Exascale Memories Bharan Giridhar reliability and energy is a co-optimization problem involving tradeoffs between error correction cost, access energy and refresh power--reducing the physical page size to decrease access energy increases the energy

  7. Warship : memorial in antithesis

    E-Print Network [OSTI]

    Tchelistcheff, Andre Victor

    1992-01-01

    This thesis is divided into three distinct yet related parts. The first consists of observations and reflections on some of New York City's many war memorials, ranging from one commemorating the Revolutionary War to one ...

  8. Schema and memory consolidation 

    E-Print Network [OSTI]

    Tse, Dorothy

    2011-06-27

    The traditional view of systems memory consolidation is that it is a gradual process that takes place over days or weeks. Within this approach, the hippocampus (HPC) is thought to be involved in the rapid encoding of ...

  9. Hardware Transactional Memory

    E-Print Network [OSTI]

    Lie, Sean

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

  10. Khan & Black (in press), Journal of Immersive Education Surrogate Embodied Learning in MUVEs: Enhancing Memory and Motivation through

    E-Print Network [OSTI]

    : Enhancing Memory and Motivation through Embodiment Saadia A. Khan, and John B. Black Teachers College text, motivation, near transfer, and far transfer. Participants were randomly assigned to three types memory, motivation, near transfer, and far transfer more than No Embodiment; (b) Surrogate Embodiment

  11. Motor Representations In Memory And Mental Models: The Embodied Zork Daniel C. Richardson (dcr18@cornell.edu)

    E-Print Network [OSTI]

    Richardson, Daniel C.

    Motor Representations In Memory And Mental Models: The Embodied Zork Daniel C. Richardson (dcr18 suggested that motor systems can participate in what were thought to be purely perceptual tasks. Extending stimulus accessed from memory can activate potential motor interactions. Other research has shown

  12. Memory effects and active Brownian diffusion

    E-Print Network [OSTI]

    Ghosh, Pulak K; Marchegiani, Giampiero; Marchesoni, Fabio

    2015-01-01

    A self-propelled artificial microswimmer is often modeled as a ballistic Brownian particle moving with constant speed aligned along one of its axis, but changing direction due to random collisions with the environment. Similarly to thermal noise, its angular randomization is described as a memoryless stochastic process. Here, we speculate that finite-time correlations in the orientational dynamics can affect the swimmer's diffusivity. To this purpose we propose and solve two alternative models. In the first one we simply assume that the environmental fluctuations governing the swimmer's propulsion are exponentially correlated in time, whereas in the second one we account for possible damped fluctuations of the propulsion velocity around the swimmer's axis. The corresponding swimmer's diffusion constants are predicted to get, respectively, enhanced or suppressed upon increasing the model memory time. Possible consequences of this effect on the interpretation of the experimental data are discussed.

  13. Memory effects and active Brownian diffusion

    E-Print Network [OSTI]

    Pulak K. Ghosh; Yunyun Li; Giampiero Marchegiani; Fabio Marchesoni

    2015-11-19

    A self-propelled artificial microswimmer is often modeled as a ballistic Brownian particle moving with constant speed aligned along one of its axis, but changing direction due to random collisions with the environment. Similarly to thermal noise, its angular randomization is described as a memoryless stochastic process. Here, we speculate that finite-time correlations in the orientational dynamics can affect the swimmer's diffusivity. To this purpose we propose and solve two alternative models. In the first one we simply assume that the environmental fluctuations governing the swimmer's propulsion are exponentially correlated in time, whereas in the second one we account for possible damped fluctuations of the propulsion velocity around the swimmer's axis. The corresponding swimmer's diffusion constants are predicted to get, respectively, enhanced or suppressed upon increasing the model memory time. Possible consequences of this effect on the interpretation of the experimental data are discussed.

  14. Open Access Task Force Open Access to

    E-Print Network [OSTI]

    Jiang, Huiqiang

    Libraries Initiative launched by National Science Foundation; Social Sciences Research Network (SSRN Library System rgmiller@pitt.edu #12;Open Access Task Force Open Access is... · A family of copyright · The only constraint on reproduction and distribution, and the only role for copyright in this domain

  15. Throughput Analysis for Cooperation in Random Access Networks

    E-Print Network [OSTI]

    Liu, K. J. Ray

    1 Department of Electrical Engineering, 2 Department of Electrical and Computer Engineering, Alexandria University, Alexandria, 21544, Egypt. University of Maryland, College Park, MD 20742, USA. amr

  16. RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies

    E-Print Network [OSTI]

    that of the processing speed [1]. Therefore, the problem of high storage requirements and low I/O efficiency/cache uti

  17. Random Access Compressed Sensing over Fading and Noisy Communication Channels

    E-Print Network [OSTI]

    Fazel, Maryam

    of the climate change. Such applications require the least control and intervention as well as minimum energy consumption. The data from distributed sensors is conveyed to a fusion center (FC) where a full map method for data gathering from a network of distributed sensors with limited resources. RACS relies

  18. Sarkar-Salishan-RandomAccess-April-2014.pptx

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power AdministrationRobust, High-ThroughputUpcoming ReleaseSecurity Administration winsSarah L. Gamage

  19. 2015 Salishan Random Access (Conference) | SciTech Connect

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield MunicipalTechnicalInformation4563 LLNL Small-scale Friction(Technical

  20. choi_salishan15_random_access.pptx

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power AdministrationRobust,Field-effectWorkingLos AlamosSimulation Initiative ccsi.jpglibfabric: your new BFF

  1. Selling Random Energy

    E-Print Network [OSTI]

    Bitar, Eilyan Yamen

    2011-01-01

    continuous time model presented in Chapter 3 and model wind power production as a discrete time random process

  2. An analog memory using a CCD memory cell 

    E-Print Network [OSTI]

    Murray, James Ray

    1983-01-01

    23 26 29 E. Digital-to-Analog Converter F. Analog-to-Digital Converter G. Operation CHAPTER IV. ANALYSIS OF THE CIRCUIT A. Testing of Major Components B. Performance of the Memory C. Comparison with Digital Memories D. Proposed Modifications... of Memory Cell 24. Four Interconnected Memory Cells 25. Four-to-Sixteen Converter 26. Column Address Decoding Circuit. 27. Row Address Decoding Circuit 28. Digital-to-Analog Converter 29. Comparator Circuit Diagram . 30. DC Transfer Function...

  3. Accessing Online COR Training

    Office of Energy Efficiency and Renewable Energy (EERE)

    Contracting Officer’s Representative (COR) training is now be available in an online format. "Accessing Online COR Training" provides a step-by-step guide to access the online COR course. 

  4. Using on-package memory

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    memory Introduction The NERSC-8 system will include a novel feature on its node architecture: 16 GB of high-bandwidth 3D stacked memory interposed between the KNL chip and the...

  5. Quantum random number generator

    E-Print Network [OSTI]

    M. Stipcevic; B. Medved Rogina

    2007-01-01

    We report upon a novel principle for realization of a fast nondeterministic random number generator whose randomness relies on intrinsic randomness of the quantum physical processes of photonic emission in semiconductors and subsequent detection by the photoelectric effect. Timing information of detected photons is used to generate binary random digits-bits. The bit extraction method based on restartable clock theoretically eliminates both bias and autocorrelation while reaching efficiency of almost 0.5 bits per random event. A prototype has been built and statistically tested.

  6. Shape memory polymer medical device

    DOE Patents [OSTI]

    Maitland, Duncan (Pleasant Hill, CA); Benett, William J. (Livermore, CA); Bearinger, Jane P. (Livermore, CA); Wilson, Thomas S. (San Leandro, CA); Small, IV, Ward (Livermore, CA); Schumann, Daniel L. (Concord, CA); Jensen, Wayne A. (Livermore, CA); Ortega, Jason M. (Pacifica, CA); Marion, III, John E. (Livermore, CA); Loge, Jeffrey M. (Stockton, CA)

    2010-06-29

    A system for removing matter from a conduit. The system includes the steps of passing a transport vehicle and a shape memory polymer material through the conduit, transmitting energy to the shape memory polymer material for moving the shape memory polymer material from a first shape to a second and different shape, and withdrawing the transport vehicle and the shape memory polymer material through the conduit carrying the matter.

  7. Life-cycle Assessment of Semiconductors

    E-Print Network [OSTI]

    Boyd, Sarah B.

    2009-01-01

    4 Life-cycle Assessment of CMOS Logic5 Life-cycle Assessment of Flash Memory6 Life-cycle Assessment of Dynamic Random Access Memory

  8. Selling Random Energy

    E-Print Network [OSTI]

    Bitar, Eilyan Yamen

    2011-01-01

    variability of wind and solar power production poses seriousof wind and solar power. They are essentially random – ais variability in wind an solar power production dealt with

  9. Random coincidence of $2\

    E-Print Network [OSTI]

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

    2013-01-17

    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\

  10. Compiler-Assisted Detection of Transient Memory Errors

    SciTech Connect (OSTI)

    Tavarageri, Sanket; Krishnamoorthy, Sriram; Sadayappan, Ponnuswamy

    2014-06-09

    The probability of bit flips in hardware memory systems is projected to increase significantly as memory systems continue to scale in size and complexity. Effective hardware-based error detection and correction requires that the complete data path, involving all parts of the memory system, be protected with sufficient redundancy. First, this may be costly to employ on commodity computing platforms and second, even on high-end systems, protection against multi-bit errors may be lacking. Therefore, augmenting hardware error detection schemes with software techniques is of consider- able interest. In this paper, we consider software-level mechanisms to comprehensively detect transient memory faults. We develop novel compile-time algorithms to instrument application programs with checksum computation codes so as to detect memory errors. Unlike prior approaches that employ checksums on computational and architectural state, our scheme verifies every data access and works by tracking variables as they are produced and consumed. Experimental evaluation demonstrates that the proposed comprehensive error detection solution is viable as a completely software-only scheme. We also demonstrate that with limited hardware support, overheads of error detection can be further reduced.

  11. ACCESSIBILITY KB&S Railroad

    E-Print Network [OSTI]

    Pittendrigh, Barry

    Purdue's ONEWAY PGG Grave STEW PMU Memorial DuhmeDr. WWaldraldronSt.onSt. Columbia St. FSTW FSTE HNLY

  12. USIMM: the Utah SImulated Memory Module A Simulation Infrastructure for the JWAC Memory

    E-Print Network [OSTI]

    Balasubramonian, Rajeev

    memory controllers and four DDR3 memory channels [19, 31]. While other memory channel and memory for DDR3 channels and DIMMs. 1 #12;A modern DDR3 channel typically has a 64-bit data bus and a 23-bit

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

    E-Print Network [OSTI]

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

    2004-01-01

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

  14. TED KYCIA MEMORIAL SYMPOSIUM.

    SciTech Connect (OSTI)

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

    2000-05-19

    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.

  15. Random Surfers on a Web Encyclopedia

    E-Print Network [OSTI]

    Geigl, Florian; Hofmann-Wellenhof, Rainer; Walk, Simon; Strohmaier, Markus; Helic, Denis

    2015-01-01

    The random surfer model is a frequently used model for simulating user navigation behavior on the Web. Various algorithms, such as PageRank, are based on the assumption that the model represents a good approximation of users browsing a website. However, the way users browse the Web has been drastically altered over the last decade due to the rise of search engines. Hence, new adaptations for the established random surfer model might be required, which better capture and simulate this change in navigation behavior. In this article we compare the classical uniform random surfer to empirical navigation and page access data in a Web Encyclopedia. Our high level contributions are (i) a comparison of stationary distributions of different types of the random surfer to quantify the similarities and differences between those models as well as (ii) new insights into the impact of search engines on traditional user navigation. Our results suggest that the behavior of the random surfer is almost similar to those of users...

  16. Shape memory alloy actuator

    DOE Patents [OSTI]

    Varma, Venugopal K. (Knoxville, TN)

    2001-01-01

    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.

  17. Memory effects in quantum channel discrimination

    E-Print Network [OSTI]

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

    2008-04-02

    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.

  18. The severe scaling challenges of mainstream memories mo vated recent ac ve research on emerging nonvola le memory (eNVM) technologies. Some promising candidates, i.e., phase change memory, spintronic memory, and resis ve memory

    E-Print Network [OSTI]

    DeMara, Ronald F.

    nonvola le memory (eNVM) technologies. Some promising candidates, i.e., phase change memory, spintronic

  19. Memorial University Department of Psychology

    E-Print Network [OSTI]

    Oyet, Alwell

    1 Memorial University Department of Psychology GRADUATE STUDENT & SUPERVISOR HANDBOOK 2014 ­ 2015 .........................................................................................................................5 Masters of Applied Social Psychology (MASP ............................................................................9 Experimental Psychology

  20. An analysis of MRAM based memory technologies

    E-Print Network [OSTI]

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

    2006-01-01

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

  1. Creating a False Memory in the Hippocampus

    E-Print Network [OSTI]

    Ramirez Moreno, Steve

    Memories can be unreliable. We created a false memory in mice by optogenetically manipulating memory engram–bearing cells in the hippocampus. Dentate gyrus (DG) or CA1 neurons activated by exposure to a particular context ...

  2. Nitinol-reinforced shape-memory polymers

    E-Print Network [OSTI]

    Di Leo, Claudio V

    2010-01-01

    Reinforced shape-memory polymers have been developed from an acrylate based thermoset shape-memory polymer and nitinol wires. A rectangular shape-memory polymer measuring approximately 1 by 2 by 0.1 inches has a ten fold ...

  3. MultiScale: Memory System DVFS with Multiple Memory Controllers

    E-Print Network [OSTI]

    Wenisch, Thomas F.

    of server energy consumed by the memory system has been increasing rapidly and is now on par with that consumed by processors. Recent work demonstrates that substantial memory energy can be saved with only to select and apply a frequency combination that will minimize the overall system energy within user

  4. Selling Random Energy

    E-Print Network [OSTI]

    Bitar, Eilyan Yamen

    2011-01-01

    Selling Random Energy in a Two-Settlement System 3.1Wind Energy Aggregation and Profit Sharing 4.1 IntroductionPower Model . . . . . . . . . . . . . 5.3.2 Energy Storage

  5. Directed random testing

    E-Print Network [OSTI]

    Pacheco, Carlos, Ph.D. Massachusetts Institute of Technology

    2009-01-01

    Random testing can quickly generate many tests, is easy to implement, scales to large software applications, and reveals software errors. But it tends to generate many tests that are illegal or that exercise the same parts ...

  6. Genepool Memory Heatmaps

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformation Current HABFESOpportunities Nuclearlong version)shortGate HoursGenepool Memory

  7. Dismantling sparse random graphs

    E-Print Network [OSTI]

    Janson, Svante

    2007-01-01

    We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).

  8. Random array grid collimator

    DOE Patents [OSTI]

    Fenimore, E.E.

    1980-08-22

    A hexagonally shaped quasi-random no-two-holes touching grid collimator. The quasi-random array grid collimator eliminates contamination from small angle off-axis rays by using a no-two-holes-touching pattern which simultaneously provides for a self-supporting array increasng throughput by elimination of a substrate. The presentation invention also provides maximum throughput using hexagonally shaped holes in a hexagonal lattice pattern for diffraction limited applications. Mosaicking is also disclosed for reducing fabrication effort.

  9. Identity and Access Management: Access Management Survey 1 Access Management Survey Questions

    E-Print Network [OSTI]

    Maroncelli, Mark

    Identity and Access Management: Access Management Survey 1 Access Management Survey Questions The Identity and Access Management (IAM) Technical Architect Group (TAG) was formed by Kevin Morooney, the vice assistance with defining the requirements for Access Management, as outlined in Strategic Recommendations 4

  10. Shape memory alloy thaw sensors

    DOE Patents [OSTI]

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

    1998-01-01

    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.

  11. Paver Program Oklahoma Memorial Union

    E-Print Network [OSTI]

    Oklahoma, University of

    Paver Program Oklahoma Memorial Union The UniversiTy of oklahoma Alumni Association Pave the Way in the Oklahoma Memorial Union Courtyard. Now you can. The UniversiTy of oklahoma Alumni Association 900 Asp Ave of Oklahoma is an equal opportunity institution. This brochure was printed at no cost to the taxpayers

  12. ACCESS Magazine Fall 2006

    E-Print Network [OSTI]

    2006-01-01

    of cars whose owners have prepaid to enter the CCZ; privateowners who have not prepaid and do not pay by midnight areA LMANAC : Unlimited Access: Prepaid Transit at Universities

  13. Accessibility HANDBOOK AND

    E-Print Network [OSTI]

    Accessibility Awareness HANDBOOK AND LEARNING MODULE A Guide for Faculty and Staff #12;Table Awareness Handbook and Learning Module 1 Sometimes the worst thing about having a disability is that people

  14. Accessing the spoken word 

    E-Print Network [OSTI]

    Goldman, Jerry; Renals, Steve; Bird, Steven; de Jong, Franciska; Federico, Marcello; Fleischhauer, Carl; Kornbluh, Mark; Lamel, Lori; Oard, Douglas W; Stewart, Claire; Wright, Richard

    Spoken-word audio collections cover many domains, including radio and television broadcasts, oral narratives, governmental proceedings, lectures, and telephone conversations. The collection, access, and preservation of such data is stimulated...

  15. Unconditional Room Temperature Quantum Memory

    E-Print Network [OSTI]

    M. Hosseini; G. Campbell; B. M. Sparkes; P. K. Lam; B. C. Buchler

    2015-02-10

    Just as classical information systems require buffers and memory, the same is true for quantum information systems. The potential that optical quantum information processing holds for revolutionising computation and communication is therefore driving significant research into developing optical quantum memory. A practical optical quantum memory must be able to store and recall quantum states on demand with high efficiency and low noise. Ideally, the platform for the memory would also be simple and inexpensive. Here, we present a complete tomographic reconstruction of quantum states that have been stored in the ground states of rubidium in a vapour cell operating at around 80$^o$C. Without conditional measurements, we show recall fidelity up to 98% for coherent pulses containing around one photon. In order to unambiguously verify that our memory beats the quantum no-cloning limit we employ state independent verification using conditional variance and signal transfer coefficients.

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

    E-Print Network [OSTI]

    Oyet, Alwell

    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

  17. Neural Correlates of the In-Group Memory Advantage on the Encoding and Recognition of Faces

    E-Print Network [OSTI]

    Curran, Tim

    Herzmann1 *, Tim Curran2 1 Department of Psychology, The College of Wooster, Wooster, Ohio, United States experience. Citation: Herzmann G, Curran T (2013) Neural Correlates of the In-Group Memory Advantage; Published December 17, 2013 Copyright: ß 2013 Herzmann, Curran. This is an open-access article distributed

  18. A discrete fractional random transform

    E-Print Network [OSTI]

    Zhengjun Liu; Haifa Zhao; Shutian Liu

    2006-05-20

    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.

  19. Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction

    E-Print Network [OSTI]

    Goodrich, Michael T.

    design for coarse-to-medium-grain parallel environments 18, 21], where the ratio of memory to processorsRandomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction address two fundamental problems: multi-searching and convex hull construction. Our methods result

  20. Working memory MARK D'ESPOSITO*

    E-Print Network [OSTI]

    subjects is usually six to seven digits (Lezak, 1995). In contrast, long-term memory is prop- erly defined underpinnings of memory function. The most common theoretical classification of mem- ory distinguishes short-term and long-term memory. In clinical practice, the terms short-term and long-term memory are used imprecisely

  1. Characterizing Application Memory Error Vulnerability to

    E-Print Network [OSTI]

    Mutlu, Onur

    -reliability memory (HRM) Store error-tolerant data in less-reliable lower-cost memory Store error-vulnerable data an application Observation 2: Data can be recovered by software ·Heterogeneous-Reliability Memory (HRM: Data can be recovered by software ·Heterogeneous-Reliability Memory (HRM) ·Evaluation 4 #12;Server

  2. Energy Efficient Phase Change Memory Based Main Memory for Future High Performance Systems

    E-Print Network [OSTI]

    Conte, Thomas M.

    time of a slow PCM based memory and significant energy reductions against a DDR3 commodity DRAM memoryEnergy Efficient Phase Change Memory Based Main Memory for Future High Performance Systems Abstract the point of view of scaling and energy consumption. PCM-only memories suffer from latency issues, high

  3. Improving Memory Subsystem Performance Using ViVA: Virtual Vector Architecture

    SciTech Connect (OSTI)

    Gebis, Joseph; Oliker, Leonid; Shalf, John; Williams, Samuel; Yelick, Katherine

    2009-01-12

    The disparity between microprocessor clock frequencies and memory latency is a primary reason why many demanding applications run well below peak achievable performance. Software controlled scratchpad memories, such as the Cell local store, attempt to ameliorate this discrepancy by enabling precise control over memory movement; however, scratchpad technology confronts the programmer and compiler with an unfamiliar and difficult programming model. In this work, we present the Virtual Vector Architecture (ViVA), which combines the memory semantics of vector computers with a software-controlled scratchpad memory in order to provide a more effective and practical approach to latency hiding. ViVA requires minimal changes to the core design and could thus be easily integrated with conventional processor cores. To validate our approach, we implemented ViVA on the Mambo cycle-accurate full system simulator, which was carefully calibrated to match the performance on our underlying PowerPC Apple G5 architecture. Results show that ViVA is able to deliver significant performance benefits over scalar techniques for a variety of memory access patterns as well as two important memory-bound compact kernels, corner turn and sparse matrix-vector multiplication -- achieving 2x-13x improvement compared the scalar version. Overall, our preliminary ViVA exploration points to a promising approach for improving application performance on leading microprocessors with minimal design and complexity costs, in a power efficient manner.

  4. Maotai 3.0: Automatic Detection of View Access in VOPP K. Leung and Z. Huang

    E-Print Network [OSTI]

    Huang, Zhiyi

    ) model. VOPP is a shared-memory-based, data-centric model that uses "views" to bundle mutual exclusion is designed to eliminate data race [4, 5]. VOPP is a data-centric model, where shared data objects other data-centric models [8], VOPP bundles mutual exclusion and data access together and therefore

  5. Scalable Dynamic Memory Management Module on Shared Memory Multiprocessors

    E-Print Network [OSTI]

    memory multiprocessors. The focus is to achieve scalability; for this purpose, both garbage collector (GC is done on Sun Ultra Enterprise 10000 (symmetric multiprocessor) and Origin 2000 (distributed shared

  6. Effects of ZrO{sub 2} doping on HfO{sub 2} resistive switching memory characteristics

    SciTech Connect (OSTI)

    Ryu, Seung Wook; Kwac, Jungsuk; Nishi, Yoshio [Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Cho, Seongjae, E-mail: felixcho@gachon.ac.kr [Department of Electronic Engineering and New Technology Component and Material Research Center (NCMRC), Gachon University, Seongnam-si, Gyeonggi-do 461-741 (Korea, Republic of); Park, Joonsuk [Department of Materials Science and Engineering, Stanford University, Stanford, California 94305 (United States); Kim, Hyeong Joon [Department of Materials Science and Engineering and Inter-university Semiconductor Research Center (ISRC), Seoul National University, Seoul 151-744 (Korea, Republic of)

    2014-08-18

    A resistive switching (RS) random access memory device with ZrO{sub 2}-doped HfO{sub 2} exhibits better RS performance than that with pure HfO{sub 2}. In particular, I{sub res}, V{sub res}, and V{sub set} are reduced by approximately 58%, 38%, and 39%, respectively, when HfO{sub 2} is doped with ZrO{sub 2} (9 at.?%). In addition, the ZrO{sub 2} doping in HfO{sub 2} makes the distribution of most parameters steeper. Transmission electron microscopy (TEM) analysis reveals that the deposited zirconium-doped hafnium oxide (HZO) (9 at.?%) is polycrystalline. Elemental mapping results by scanning TEM–energy dispersive spectroscopy also prove that ZrO{sub 2} is uniformly distributed in the HZO (9 at.?%) film. The possible mechanism for the improvement in the RS characteristics is also suggested on the basis of the X-ray photoelectron spectroscopy results and filamentary RS mechanism. These results suggest that the ZrO{sub 2} doping into HfO{sub 2} likely not only will reduce power consumption but also will improve cyclic endurance by controlling the nonstoichiometric phase.

  7. Shape memory alloy thaw sensors

    DOE Patents [OSTI]

    Shahinpoor, M.; Martinez, D.R.

    1998-04-07

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

  8. Accessible Parking Motorcycle Parking

    E-Print Network [OSTI]

    Nanyes, Ollie

    Hartmann Center Comstock Hall Holmes Main Street Parking Deck Transitional Parking Lot Lovelace JobstNorth Accessible Parking Motorcycle Parking Visitors Commuter Student Resident Student Resident St & Staff University Vehicles © Bradley University · 06/18/14 Emergency Phone Parking Legend FIJI

  9. Library Guide Access ... 3

    E-Print Network [OSTI]

    Steiner, Ullrich

    ____________________________ Library Guide 2012-2013 #12;Contents Access ... 3 Finding things ... 4-6 Layout and classification... 7 Floor plans ... 8-9 Borrowing things ... 10 Renewing and returning things;Sidney Sussex Library Guide 2012-2013 Welcome to the Richard Powell Library Tel: (01223) 338852 e

  10. Library Guide Access ... 3

    E-Print Network [OSTI]

    Steiner, Ullrich

    ____________________________ Library Guide 2014-2015 #12;Contents Access ... 3 Finding things ... 4-6 Layout and classification... 7 Floor plans ... 8-9 Borrowing things ... 10 Renewing and returning things;Sidney Sussex Library Guide 2014-2015 Welcome to the Richard Powell Library Tel: (01223) 338852 e

  11. Deregulation Direct Access

    E-Print Network [OSTI]

    Kammen, Daniel M.

    AB 1890 AB1X Aggregator Blue Book CEC CPUC CTC Deregulation Direct Access Divestiture DWR EOB EPAct an initiative on the ballot in response to the energy crisis. www.ftcr.org ESPs that sell electricity generated of peak demand. Investor Owned Utility. A private electric utility (owned by shareholders) regulated

  12. Special Access Programs

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2011-03-29

    This Order is for OFFICIAL USE ONLY and will not be distributed on the Directives' Portal. For distribution, please contact the Executive Secretary of the Special Access Program Oversight Committee at (202) 586-3345. Does not cancel/supersede other directives.

  13. Access for All 

    E-Print Network [OSTI]

    Stearns, Linda Lea Merenda

    2012-07-16

    district to determine if there is fair and equitable access for all students. The paper contains two major components. The first is quantitative study of the four entrance requirements for 8th grade Algebra I Pre-AP at a central Texas middle school...

  14. Insights into the Mechanism of Memory Allocation Through the Trapping and Activating of Emotional Memories

    E-Print Network [OSTI]

    Rogerson, Thomas William Arundel

    2013-01-01

    Secondly, synaptic allocation functions to allocate memorieswhile neuronal allocation functions to allocate memories onwill be how memory allocation functions in the formation of

  15. Randomization vs. Nondeterminisma What are the differences between randomized algorithms

    E-Print Network [OSTI]

    Lyuu, Yuh-Dauh

    Inequalitya Lemma 61 Let x be a random variable taking nonnegative integer values. Then for any k > 0, prob[ x

  16. Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms

    E-Print Network [OSTI]

    Del Moral , Pierre

    Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms do not Work and how Abstract We show that the original classic randomized algorithms for approximate counting in NP simultaneously multiple Markov chains. We present several algorithms of the combined version, which we simple

  17. Random Selection for Drug Screening

    SciTech Connect (OSTI)

    Center for Human Reliability Studies

    2007-05-01

    Simple random sampling is generally the starting point for a random sampling process. This sampling technique ensures that each individual within a group (population) has an equal chance of being selected. There are a variety of ways to implement random sampling in a practical situation.

  18. Access Management Software Requirements Specification

    E-Print Network [OSTI]

    Maroncelli, Mark

    · Access to directory data · Emergency Rehire · Multiple IDs · Deceased Employee · Outreach Registration and Abbreviations Abbreviation Definition Group Collection of people who exist in the Penn State Directory. Role · Employee Confidentiality · Provisioning of an employee's digital Identity · Student early access

  19. Memory cost of quantum protocols

    E-Print Network [OSTI]

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

    2011-12-16

    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.

  20. Hipikat: A Project Memory for Software Development

    E-Print Network [OSTI]

    van der Hoek, André

    Hipikat: A Project Memory for Software Development Davor CCubranicc, Gail C. Murphy, Member, IEEE's usefulness in software modification tasks. One study evaluated the usefulness of Hipikat's recommendations Terms--Software development teams, project memory, software artifacts, recommender system, user studies

  1. Hardware support for unbounded transactional memory

    E-Print Network [OSTI]

    Lie, Sean, 1980-

    2004-01-01

    In this thesis, I propose a design for hardware transactional memory where the transaction size is not bounded by a specialized hardware buffer such as a cache. I describe an unbounded transactional memory system called ...

  2. Brain&oscillations&mediate&memory&suppression&1! Running&Title:&BRAIN&OSCILLATIONS&MEDIATE&MEMORY&SUPPRESSION&

    E-Print Network [OSTI]

    Schubart, Christoph

    Brain&oscillations&mediate&memory&suppression&1! & ! Running&Title:&BRAIN&OSCILLATIONS&MEDIATE&MEMORY&SUPPRESSION& & & Brain&oscillations&mediate&successful&suppression&of&unwanted&memories& Gerd&T.&Waldhauser1,&Karl1Heinz.de& Phone:&+49(0)753118815707& Fax:&+49(0)753118814829& #12;Brain&oscillations&mediate&memory&suppression&2

  3. Memory with memory: Soft assignment in Genetic Programming

    E-Print Network [OSTI]

    Poli, Riccardo

    that an instruction of the form x:=y or LOAD R2 R1 completely overwrites the previous value of a memory location or register. That earlier value is lost forever, and has no impact on the future be- havior of the system traditional GP). Instead of having the new value completely overwrite the old value of the register

  4. Memory with Memory: Soft Assignment in Genetic Programming

    E-Print Network [OSTI]

    Fernandez, Thomas

    that an instruction of the form x:=y or LOAD R2 R1 completely overwrites the previous value of a memory location or register. That earlier value is lost forever, and has no impact on the future be- havior of the system traditional GP). Instead of having the new value completely overwrite the old value of the register

  5. Access to the ALS

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 OutreachProductswsicloudwsicloudden Documentation DataStreamsTotalproposalsAboutAcceleratingthYourAccess to the

  6. Access to the ALS

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory of raregovAboutRecovery Act Recovery ActARMAccelerators,Access to the ALS

  7. Accessibility - Hanford Site

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory of raregovAboutRecovery Act Recovery ActARMAccelerators,Access to

  8. Accelerated Randomized Benchmarking

    E-Print Network [OSTI]

    Christopher Granade; Christopher Ferrie; D. G. Cory

    2014-09-24

    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.

  9. Random rectangular Graphs

    E-Print Network [OSTI]

    Estrada, Ernesto

    2015-01-01

    A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square \\left[0,1\\right]^{2}. The topological properties, such as connectivity, average degree, average path length and clustering, of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b=1/a, and the radius r used to connect the nodes. When a=1 we recover the RGG, and when a\\rightarrow\\infty the very elongated rectangle generated resembles a one-dimensional RGG. We provided computational and analytical evidence that the topological properties of the RRG differ significantly from those of the RGG. The connectivity of the RRG depends not only on the number of nodes as in the case of the RGG, but also on the side length of the rectangle. As the rectangle is more elongated the critical radius for connectivity increases following first a power-law an...

  10. Memory Optimization for Phase-field Simulations

    SciTech Connect (OSTI)

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

    2014-08-01

    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.

  11. DESIGNING EFFICIENT MEMORY FOR FUTURE COMPUTING SYSTEMS

    E-Print Network [OSTI]

    Balasubramonian, Rajeev

    , limited pin counts, increasing heterogeneity and complexity, and the diminished importance of cost main memory system with the following innovative features: (i) overfetch-aware re-organized chips, (ii) low-cost silicon photonic memory channels, (iii) largely autonomous memory modules with a packet

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

    DOE Patents [OSTI]

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

    2010-09-14

    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.

  13. Random Operator Compressions

    E-Print Network [OSTI]

    Stephen Ng; Meg Walters

    2014-09-19

    Let $A$ be a Hermitian operator of order $n$. We show that for $k\\leq n$ sufficiently large, the eigenvalues of a compression of $A$ to a $k$-dimensional subspace are almost the same for all subspaces. We prove this result using the methods introduced in a paper by Chatterjee and Ledoux on eigenvalues of principle submatrices. We show that by choosing an appropriate Markov chain, the methods of Chatterjee and Ledoux can be applied to give a more general result on operator compressions. As an additional application of this method, we prove concentration of measure of the length of the longest increasing subsequence of a random walk distributed under the invariant measure for the asymmetric exclusion process.

  14. LHAPDF6: parton density access in the LHC precision era

    E-Print Network [OSTI]

    Andy Buckley; James Ferrando; Stephen Lloyd; Karl Nordstrom; Ben Page; Martin Ruefenacht; Marek Schoenherr; Graeme Watt

    2015-03-05

    The Fortran LHAPDF library has been a long-term workhorse in particle physics, providing standardised access to parton density functions for experimental and phenomenological purposes alike, following on from the venerable PDFLIB package. During Run 1 of the LHC, however, several fundamental limitations in LHAPDF's design have became deeply problematic, restricting the usability of the library for important physics-study procedures and providing dangerous avenues by which to silently obtain incorrect results. In this paper we present the LHAPDF 6 library, a ground-up re-engineering of the PDFLIB/LHAPDF paradigm for PDF access which removes all limits on use of concurrent PDF sets, massively reduces static memory requirements, offers improved CPU performance, and fixes fundamental bugs in multi-set access to PDF metadata. The new design, restricted for now to interpolated PDFs, uses centralised numerical routines and a powerful cascading metadata system to decouple software releases from provision of new PDF data and allow completely general parton content. More than 200 PDF sets have been migrated from LHAPDF 5 to the new universal data format, via a stringent quality control procedure. LHAPDF 6 is supported by many Monte Carlo generators and other physics programs, in some cases via a full set of compatibility routines, and is recommended for the demanding PDF access needs of LHC Run 2 and beyond.

  15. Stretched Polymers in Random Environment

    E-Print Network [OSTI]

    Dmitry Ioffe; Yvan Velenik

    2011-03-01

    We survey recent results and open questions on the ballistic phase of stretched polymers in both annealed and quenched random environments.

  16. Mitigation of cache memory using an embedded hard-core PPC440 processor in a Virtex-5 Field Programmable Gate Array.

    SciTech Connect (OSTI)

    Learn, Mark Walter

    2010-02-01

    Sandia National Laboratories is currently developing new processing and data communication architectures for use in future satellite payloads. These architectures will leverage the flexibility and performance of state-of-the-art static-random-access-memory-based Field Programmable Gate Arrays (FPGAs). One such FPGA is the radiation-hardened version of the Virtex-5 being developed by Xilinx. However, not all features of this FPGA are being radiation-hardened by design and could still be susceptible to on-orbit upsets. One such feature is the embedded hard-core PPC440 processor. Since this processor is implemented in the FPGA as a hard-core, traditional mitigation approaches such as Triple Modular Redundancy (TMR) are not available to improve the processor's on-orbit reliability. The goal of this work is to investigate techniques that can help mitigate the embedded hard-core PPC440 processor within the Virtex-5 FPGA other than TMR. Implementing various mitigation schemes reliably within the PPC440 offers a powerful reconfigurable computing resource to these node-based processing architectures. This document summarizes the work done on the cache mitigation scheme for the embedded hard-core PPC440 processor within the Virtex-5 FPGAs, and describes in detail the design of the cache mitigation scheme and the testing conducted at the radiation effects facility on the Texas A&M campus.

  17. Pseudo-random number generator based on asymptotic deterministic randomness

    E-Print Network [OSTI]

    Kai Wang; Wenjiang Pei; Haishan Xia; Yiu-ming Cheung

    2007-10-10

    An approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks.

  18. Shape memory alloy/shape memory polymer tools

    DOE Patents [OSTI]

    Seward, Kirk P.; Krulevitch, Peter A.

    2005-03-29

    Micro-electromechanical tools for minimally invasive techniques including microsurgery. These tools utilize composite shape memory alloy (SMA), shape memory polymer (SMP) and combinations of SMA and SMP to produce catheter distal tips, actuators, etc., which are bistable. Applications for these structures include: 1) a method for reversible fine positioning of a catheter tip, 2) a method for reversible fine positioning of tools or therapeutic catheters by a guide catheter, 3) a method for bending articulation through the body's vasculature, 4) methods for controlled stent delivery, deployment, and repositioning, and 5) catheters with variable modulus, with vibration mode, with inchworm capability, and with articulated tips. These actuators and catheter tips are bistable and are opportune for in vivo usage because the materials are biocompatible and convenient for intravascular use as well as other minimal by invasive techniques.

  19. Vehicle barrier with access delay

    DOE Patents [OSTI]

    Swahlan, David J; Wilke, Jason

    2013-09-03

    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.

  20. 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 will report on the implementation of one important com- ponent of the system, the Information Ac- cess Router

  1. Supply Chain Supernetworks Random Demands

    E-Print Network [OSTI]

    Nagurney, Anna

    Supply Chain Supernetworks with Random Demands June Dong and Ding Zhang Department of Marketing of three tiers of decision-makers: the manufacturers, the distributors, and the retailers, with the demands equilibrium model with electronic commerce and with random demands for which modeling, qualitative analysis

  2. Random Curves by Conformal Welding

    E-Print Network [OSTI]

    K. Astala; P. Jones; A. Kupiainen; E. Saksman

    2009-12-17

    We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle given in terms of the exponential of Gaussian Free Field. We conjecture that our curves are locally related to SLE$(\\kappa)$ for $\\kappa<4$.

  3. Random Curves by Conformal Welding

    E-Print Network [OSTI]

    Astala, K; Kupiainen, A; Saksman, E

    2009-01-01

    We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle given in terms of the exponential of Gaussian Free Field. We conjecture that our curves are locally related to SLE$(\\kappa)$ for $\\kappa<4$.

  4. TABLE OF CONTENTS Safe Access

    E-Print Network [OSTI]

    US Army Corps of Engineers

    , construction, and maintenance of the means of access, and b. Erection and dismantling procedures of scaffolds, including provisions for providing fall protection (FP) during the erection or dismantling when the erection or dismantling involves work at heights. > See Sections 21.K.02 and 22.A.03. 24.A.03 Job-made means of access

  5. A quantum access network

    E-Print Network [OSTI]

    Bernd Fröhlich; James F. Dynes; Marco Lucamarini; Andrew W. Sharpe; Zhiliang Yuan; Andrew J. Shields

    2014-09-02

    The theoretically proven security of quantum key distribution (QKD) could revolutionise how information exchange is protected in the future. Several field tests of QKD have proven it to be a reliable technology for cryptographic key exchange and have demonstrated nodal networks of point-to-point links. However, so far no convincing answer has been given to the question of how to extend the scope of QKD beyond niche applications in dedicated high security networks. Here we show that adopting simple and cost-effective telecommunication technologies to form a quantum access network can greatly expand the number of users in quantum networks and therefore vastly broaden their appeal. We are able to demonstrate that a high-speed single-photon detector positioned at a network node can be shared between up to 64 users for exchanging secret keys with the node, thereby significantly reducing the hardware requirements for each user added to the network. This point-to-multipoint architecture removes one of the main obstacles restricting the widespread application of QKD. It presents a viable method for realising multi-user QKD networks with resource efficiency and brings QKD closer to becoming the first widespread technology based on quantum physics.

  6. An elementary derivation of first and last return times of 1D random walks

    E-Print Network [OSTI]

    Kostinski, Sarah

    2015-01-01

    Random walks, and in particular, their first passage times, are ubiquitous in nature. Using direct enumeration of paths, we find the first return time distribution of a 1D random walker, which is a heavy-tailed distribution with infinite mean. Using the same method we find the last return time distribution, which follows the arcsine law. Both results have a broad range of applications in physics and other disciplines. The derivation presented here is readily accessible to physics undergraduates, and provides an elementary introduction into random walks and their intriguing properties.

  7. Galen Sasaki EE 361 University of Hawaii 1 Memory technologies

    E-Print Network [OSTI]

    Sasaki, Galen H.

    1 Galen Sasaki EE 361 University of Hawaii 1 Memory · Memory technologies · Memory hierarchy of Hawaii 2 Memory Technologies · Read Only Memory (ROM) · Static RAM (SRAM) ­ Basic cell: clocked D latch) ­ Basic cell ­ Faster DRAM, e.g. synchronous DRAM #12;2 Galen Sasaki EE 361 University of Hawaii 3 ROM

  8. Distance-based accessibility indices

    E-Print Network [OSTI]

    Csató, László

    2015-01-01

    The paper attempts to develop a suitable accessibility index for networks where each link has a value such that a smaller number is preferred like distance, cost, or travel time. A measure called distance sum is characterized by three independent properties: anonymity, an appropriately chosen independence axiom, and dominance preservation, which requires that a node not far to any other is at least as accessible. We argue for the need of eliminating the independence property in certain applications. Therefore generalized distance sum, a family of accessibility indices, will be suggested. It is linear, considers the accessibility of vertices besides their distances and depends on a parameter in order to control its deviation from distance sum. Generalized distance sum is anonymous and satisfies dominance preservation if its parameter meets a sufficient condition. Two detailed examples demonstrate its ability to reflect the vulnerability of accessibility to link disruptions.

  9. Quantum memories: emerging applications and recent advances

    E-Print Network [OSTI]

    Khabat Heshami; Duncan G. England; Peter C. Humphreys; Philip J. Bustard; Victor M. Acosta; Joshua Nunn; Benjamin J. Sussman

    2015-11-12

    Quantum light-matter interfaces are at the heart of photonic quantum technologies. Quantum memories for photons are a prominent consequence of superb control over interactions between light and matter, where non-classical states of photons are mapped onto stationary matter states and preserved for subsequent retrieval into photonic excitations. The ability of quantum memories to synchronize probabilistic events makes them a key component in quantum repeaters and quantum computation based on linear optics. This has motivated several groups to dedicate theoretical and experimental research to develop quantum memory devices. In recent years, exciting new applications and more advanced developments of quantum memories have proliferated. In this review, we outline some of the emerging applications of quantum memories in optical signal processing, quantum computation, and nonlinear optics. We review recent experimental and theoretical developments, and their impacts on more advanced photonic quantum technologies based on quantum memories.

  10. Raman Quantum Memory of Photonic Polarised Entanglement

    E-Print Network [OSTI]

    Dong-Sheng Ding; Wei Zhang; Zhi-Yuan Zhou; Shuai Shi; Bao-Sen Shi; Guang-Can Guo

    2014-11-06

    Quantum entanglement of particles is regarded as a fundamental character in quantum information, in which quantum state should be given for whole system instead of independently describing single particle. Constructing quantum memory of photonic entanglement is essential for realizing quantum networks, which had been performed previously by many memory protocols. Of which Raman quantum memory gives advantages in broadband and high-speed properties, resulting in huge potential in quantum network and quantum computation. However, Raman quantum memory of photonic polarised entanglement is a challenge work and still missing. Here, we report two Raman quantum memories based on gas atomic ensembles: 1. Heralded Raman quantum memory of hybrid entanglement of path and polarization of single photon. 2. Raman storage of two-particle photonic polarised entangled state. Our experimental performances of these two different Raman quantum storages of photonic entanglement show a very promising prospective in quantum information science.

  11. Random wave functions and percolation

    E-Print Network [OSTI]

    E. Bogomolny; C. Schmit

    2007-08-31

    Recently it was conjectured that nodal domains of random wave functions are adequately described by critical percolation theory. In this paper we strengthen this conjecture in two respects. First, we show that, though wave function correlations decay slowly, a careful use of Harris' criterion confirms that these correlations are unessential and nodal domains of random wave functions belong to the same universality class as non critical percolation. Second, we argue that level domains of random wave functions are described by the non-critical percolation model.

  12. Memorandum Memorializing Ex Parte Communication, DOE impending...

    Energy Savers [EERE]

    Communication, DOE impending determination of coverage for commercial and industrial fans, blowers, and fume hoods. Memorandum Memorializing Ex Parte Communication, DOE impending...

  13. Improving Memory Error Handling Using Linux

    SciTech Connect (OSTI)

    Carlton, Michael Andrew [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Blanchard, Sean P. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Debardeleben, Nathan A. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2014-07-25

    As supercomputers continue to get faster and more powerful in the future, they will also have more nodes. If nothing is done, then the amount of memory in supercomputer clusters will soon grow large enough that memory failures will be unmanageable to deal with by manually replacing memory DIMMs. "Improving Memory Error Handling Using Linux" is a process oriented method to solve this problem by using the Linux kernel to disable (offline) faulty memory pages containing bad addresses, preventing them from being used again by a process. The process of offlining memory pages simplifies error handling and results in reducing both hardware and manpower costs required to run Los Alamos National Laboratory (LANL) clusters. This process will be necessary for the future of supercomputing to allow the development of exascale computers. It will not be feasible without memory error handling to manually replace the number of DIMMs that will fail daily on a machine consisting of 32-128 petabytes of memory. Testing reveals the process of offlining memory pages works and is relatively simple to use. As more and more testing is conducted, the entire process will be automated within the high-performance computing (HPC) monitoring software, Zenoss, at LANL.

  14. Exploiting Data Similarity to Reduce Memory Footprints

    SciTech Connect (OSTI)

    Biswas, S; de Supinski, B R; Schulz, M; Franklin, D; Sherwood, T; Chong, F T

    2011-01-28

    Memory size has long limited large-scale applications on high-performance computing (HPC) systems. Since compute nodes frequently do not have swap space, physical memory often limits problem sizes. Increasing core counts per chip and power density constraints, which limit the number of DIMMs per node, have exacerbated this problem. Further, DRAM constitutes a significant portion of overall HPC system cost. Therefore, instead of adding more DRAM to the nodes, mechanisms to manage memory usage more efficiently - preferably transparently - could increase effective DRAM capacity and thus the benefit of multicore nodes for HPC systems. MPI application processes often exhibit significant data similarity. These data regions occupy multiple physical locations across the individual rank processes within a multicore node and thus offer a potential savings in memory capacity. These regions, primarily residing in heap, are dynamic, which makes them difficult to manage statically. Our novel memory allocation library, SBLLmalloc, automatically identifies identical memory blocks and merges them into a single copy. SBLLmalloc does not require application or OS changes since we implement it as a user-level library. Overall, we demonstrate that SBLLmalloc reduces the memory footprint of a range of MPI applications by 32.03% on average and up to 60.87%. Further, SBLLmalloc supports problem sizes for IRS over 21.36% larger than using standard memory management techniques, thus significantly increasing effective system size. Similarly, SBLLmalloc requires 43.75% fewer nodes than standard memory management techniques to solve an AMG problem.

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

    E-Print Network [OSTI]

    Brewer, Andrew Lee

    2009-05-15

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

  16. Watchdog: Hardware for Safe and Secure Manual Memory Management and Full Memory Safety

    E-Print Network [OSTI]

    Plotkin, Joshua B.

    Watchdog: Hardware for Safe and Secure Manual Memory Management and Full Memory Safety Santosh) to become the root cause of exploitable security vulnerabilities. This paper proposes Watchdog, a hardware full hardware-enforced memory safety at low overheads. 1. Introduction Languages such as C and C

  17. Product-form solution techniques for the performance analysis of multiple-bus multiprocessor systems with nonuniform memory references

    SciTech Connect (OSTI)

    Chiola, G.; Marsan, M.A.; Balbo, G.

    1988-05-01

    Recursive relations are derived for the exact computation of the steady-state probability distribution of some queueing models with passive resources that can be used to analyze the performance of multiple-bus multiprocessor system architectures. The most general case that was shown to admit a product-form solution is described, and a recursive solution is obtained considering different processor access rates, different memory selection probabilities, and an FCFS bus scheduling policy. Several simpler cases allowing easier model solutions are also considered. Numerical evaluations of large computing systems with nonuniform memory references show the usefulness of the results.

  18. Access Digital Library, Search, News and more

    E-Print Network [OSTI]

    Goodrich, Lisa V.

    [General] Access Digital Library, Search, News and more [Education] Access MyCourses content [Research] Access Digital Library, NCBI Blast and more [Personal] Access your portable bookmarks using My and 500 textbooks via the Digital Library, one click access to NCBI Blast sequence databases. [General

  19. Motivation Random Performance Tableaux Special Performance Tableaux Conclusion Generating Random Performance Tableaux

    E-Print Network [OSTI]

    Bisdorff, Raymond

    Motivation Random Performance Tableaux Special Performance Tableaux Conclusion Generating Random Performance Tableaux Raymond Bisdorff University of Luxembourg, FSTC/CSC Mons, April, 2009 Motivation Random Performance Tableaux Special Performance Tableaux Conclusion Motivation Provide random instances

  20. Definition of a Random Variable Distribution Functions Properties of Distribution Functions Random Variables and Distribution Functions

    E-Print Network [OSTI]

    Watkins, Joseph C.

    Definition of a Random Variable Distribution Functions Properties of Distribution Functions Topic 7 Random Variables and Distribution Functions Distribution Functions 1 / 11 #12;Definition of a Random Variable Distribution Functions Properties of Distribution Functions Outline Definition of a Random

  1. Fall Graduation Access Information Accessibility, Wheelchairs, and Disability

    E-Print Network [OSTI]

    needs parking pass" on the dashboard of the car. The first two parking bays in the lot nearest Cassell in the portal areas. The band platform area is not accessible for wheelchairs (between Aisles 11 and 13). #12

  2. Integration of Non-volatile Memory into Storage Hierarchy 

    E-Print Network [OSTI]

    Qiu, Sheng

    2013-12-04

    In this dissertation, we present novel approaches for integrating non-volatile memory devices into storage hierarchy of a computer system. There are several types of non- volatile memory devices, such as flash memory, Phase ...

  3. Grain constraint and size effects in shape memory alloy microwires

    E-Print Network [OSTI]

    Ueland, Stian Melhus

    2013-01-01

    Shape memory alloys exhibit interesting and useful properties, such as the shape memory effect and superelasticity. Among the many alloy families that have been shown to exhibit shape memory properties the ones based on ...

  4. Saving Energy This Memorial Day | Department of Energy

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

    Saving Energy This Memorial Day Saving Energy This Memorial Day May 19, 2014 - 4:07pm Addthis Be energy efficient while you spend time outside this Memorial Day. | Photo courtesy...

  5. Threshold phenomena and complexity: a statistical physics analysis of the random

    E-Print Network [OSTI]

    Duxbury, Phillip M.

    Threshold phenomena and complexity: a statistical physics analysis of the random Satis#12;ability problem. R#19;emi Monasson 1 Laboratoire de Physique Th#19;eorique de l'ENS, 75005 Paris. Abstract designed by physicists to deal with optimization or decision problems in an accessible language

  6. Random Search Algorithms Zelda B. Zabinsky

    E-Print Network [OSTI]

    Del Moral , Pierre

    Random Search Algorithms Zelda B. Zabinsky April 5, 2009 Abstract Random search algorithms with convergence results in probability. Random search algorithms include simulated an- nealing, tabu search, genetic algorithms, evolutionary programming, particle swarm optimization, ant colony optimization, cross

  7. Memory of jamming - multiscale models for soft and granular matter

    E-Print Network [OSTI]

    Nishant Kumar; Stefan Luding

    2015-12-07

    Soft, disordered, micro-structured materials are ubiquitous in nature and industry, and are different from ordinary fluids or solids, with unusual, interesting static and flow properties. The transition from fluid to solid -at the so-called jamming density- features a multitude of complex mechanisms, but there is no unified theoretical framework that explains them all. In this study, a simple yet quantitative and predictive model is presented, which allows for a variable, changing jamming density, encompassing the memory of the deformation history and explaining a multitude of phenomena at and around jamming. The jamming density, now introduced as a new state-variable, changes due to the deformation history and relates the system's macroscopic response to its microstructure. The packing efficiency can increase logarithmically slow under gentle repeated (isotropic) compression, leading to an increase of the jamming density. In contrast, shear deformations cause anisotropy, changing the packing efficiency exponentially fast with either dilatancy or compactancy. The memory of the system near jamming can be explained by a microstatistical model that involves a multiscale, fractal energy landscape and links the microscopic particle picture to the macroscopic continuum description, providing a unified explanation for the qualitatively different flow-behavior for different deformation modes. To complement our work, a recipe to extract the history-dependent jamming density from experimentally accessible data is proposed, and alternative state-variables are compared. The proposed simple macroscopic constitutive model is calibrated with the memory of microstructure. Such approach can help understanding predicting and mitigating failure of structures or geophysical hazards, and will bring forward industrial process design/optimization, and help solving scientific challenges in fundamental research.

  8. On Randomness in Quantum Mechanics

    E-Print Network [OSTI]

    Alberto C. de la Torre

    2007-07-19

    The quantum mechanical probability densities are compared with the probability densities treated by the theory of random variables. The relevance of their difference for the interpretation of quantum mechanics is commented.

  9. Random Selection for Drug Screening

    SciTech Connect (OSTI)

    Center for Human Reliability Studies

    2007-05-01

    Sampling is the process of choosing some members out of a group or population. Probablity sampling, or random sampling, is the process of selecting members by chance with a known probability of each individual being chosen.

  10. Design Space and Performance Analysis of the Hybrid Memory Cube The Hybrid Memory Cube is an emerging main memory

    E-Print Network [OSTI]

    Jacob, Bruce

    be operated at higher throughput and lower energy per bit compared to traditional DDRx memory. This technology's performance, we compare the execution of HMC, Buffer-on-Board, and quad channel DDR3-1600 main memory systems full-system execution time over an extremely aggressive quad channel DDR3-1600 system by a factor

  11. Internet Usage Mining Using Random Forests

    E-Print Network [OSTI]

    Liu, Xuening

    2013-01-01

    Los Angeles Internet Usage Mining Using Random Forests Aof the Thesis Internet Usage Mining Using Random Forests bydata emerges, data mining is finally in the spotlight. This

  12. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformation Current HABFES OctoberEvan Racah Evan-5 BeamlineGE, Ford,Extra-Large Memory

  13. Memory-2014-salishan.key

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration wouldMass map shines light on dark matter By SarahMODELINGMeetingsMembranesMemorial Day

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

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in RSA Access Manager. A remote user can gain access to the target system.

  15. ACADEMIC AFFAIRS ACCESS AND ADMINISTRATION

    E-Print Network [OSTI]

    Arnold, Elizabeth A.

    , Accounting Operations & Disbursements Copy Centers Dining Services Facilities Management Finance Human & Reporting Prospect Research Quality Assurance Campaign Management College Engagement Donor RelationsACADEMIC AFFAIRS ACCESS AND ENROLLMENT MANAGEMENT ADMINISTRATION AND FINANCE STUDENT AFFAIRS

  16. Building Green in Greensburg: Kiowa County Memorial Hospital...

    Energy Savers [EERE]

    Kiowa County Memorial Hospital Building Green in Greensburg: Kiowa County Memorial Hospital This poster highlights energy efficiency, renewable energy, and sustainable features of...

  17. LOW-POWER METHODOLOGY FOR FAULT TOLERANT NANOSCALE MEMORY DESIGN

    E-Print Network [OSTI]

    Kim, Seokjoong

    2012-01-01

    Outline . . . . . . . . . . . . . . . . . . . . . . . Low-Methodologies for Low-Power Memory . . . . . . . . . . . . .Scaling for SEU-Tolerance in Low-Power Memories 7.1 Soft-

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

  19. Local random quantum circuits are approximate polynomial-designs

    E-Print Network [OSTI]

    Fernando G. S. L. Brandao; Aram W. Harrow; Michal Horodecki

    2015-08-13

    We prove that local random quantum circuits acting on n qubits composed of O(t^{10} n^2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are infty-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O(t^{10}n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O(n^k) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O(n^{(k-9)/11}) that are given oracle access to U.

  20. Switching Magnetization of a Nanoscale Ferromagnetic Particle Using Nonlocal Spin Injection T. Kimura,1,2,3,* Y. Otani,1,2,3

    E-Print Network [OSTI]

    Otani, Yoshichika

    to operate future spintronic devices including a magnetic random access memory [1]. Unlike conventional technologies for developing spintronic devices. The switching mechanism due to spin torque is explained

  1. NS201: Learning and Memory (8 Lectures)

    E-Print Network [OSTI]

    Murthy, Aditya

    and Argument Is it unique to humans ? #12;Birth of animal models and search for memory Karl Lashley Trained are not the same #12;The Standard Model and Memory Systems Squire and Zola (PNAS) #12;Priming What are the two Spontaneous Recovery: CR regains with mild presentation of US Renewal : (TBD under contextual conditioni

  2. Mechanisms underlying working memory for novel information

    E-Print Network [OSTI]

    Hasselmo, Michael

    Mechanisms underlying working memory for novel information Michael E. Hasselmo and Chantal E. Stern Cummington St, Boston, MA 02215, USA In this Opinion article we describe a theory that the brain mechanisms modeling indicates that mechanisms for maintaining novel information in working memory could differ from

  3. Designing asymmetric neural networks with associative memory

    SciTech Connect (OSTI)

    Zhao Hong [Department of Physics, Xiamen University, Xiamen 361005 (China)

    2004-12-01

    A strategy for designing asymmetric neural networks of associative memory with controllable degree of symmetry and controllable basins of attraction is presented. It is shown that the performance of the networks depends on the degree of the symmetry, and by adjusting the degree of the symmetry the spurious memories or unwanted attractors can be suppressed completely.

  4. MEMORY HIERARCHY DESIGN FOR STREAM A DISSERTATION

    E-Print Network [OSTI]

    Dally, William J.

    . Prior research has shown that stream processors provide an energy-efficient, programmable approachMEMORY HIERARCHY DESIGN FOR STREAM COMPUTING A DISSERTATION SUBMITTED TO THE DEPARTMENT of memory and bandwidth hierarchy utilization in stream processors. We first evaluate the appropriate

  5. Android Malware Analysis Based On Memory Forensics

    E-Print Network [OSTI]

    Levente, Buttyán

    Android Malware Analysis Based On Memory Forensics Andr´as Gazdag and Levente Butty´an Laboratory for the Android platform using a memory forensics approach. We explore the required modification of the Android gathered from the analysis steps we present a methodology of behaviour analysis of android applications

  6. Energy Splitting Theorems for Materials with Memory

    E-Print Network [OSTI]

    Antonino Favata; Paolo Podio-Guidugli; Giuseppe Tomassetti

    2009-07-30

    We extend to materials with fading memory and materials with internal variables a result previously established by one of us for materials with instantaneous memory: the additive decomposability of the total energy into an internal and a kinetic part, and a representation of the latter and the inertial forces in terms of one and the same mass tensor.

  7. Tier identification (TID) for tiered memory characteristics

    DOE Patents [OSTI]

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

    2014-03-25

    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.

  8. Memorial University of Newfoundland Indirect Costs Report

    E-Print Network [OSTI]

    deYoung, Brad

    Memorial University of Newfoundland Indirect Costs Report 2012-13 The grant provided through the Government of Canada Indirect Costs Program (ICP) is essential to Memorial's research success. Funding and impact can be found in the following section. Total 2013 Indirect Costs Grant: $4,318,814 Management

  9. Dynamical Slowdown of Polymers in Laminar and Random Flows

    E-Print Network [OSTI]

    Antonio Celani; Alberto Puliafito; Dario Vincenzi

    2006-09-22

    The influence of an external flow on the relaxation dynamics of a single polymer is investigated theoretically and numerically. We show that a pronounced dynamical slowdown occurs in the vicinity of the coil-stretch transition, especially when the dependence on polymer conformation of the drag is accounted for. For the elongational flow, relaxation times are exceedingly larger than the Zimm relaxation time, resulting in the observation of conformation hysteresis. For random smooth flows hysteresis is not present. Yet, relaxation dynamics is significantly slowed down because of the large variety of accessible polymer configurations. The implications of these results for the modeling of dilute polymer solutions in turbulent flows are addressed.

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

    SciTech Connect (OSTI)

    Bergman, Keren

    2014-08-28

    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.

  11. Performing an allreduce operation using shared memory

    DOE Patents [OSTI]

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

    2012-04-17

    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.

  12. Performing an allreduce operation using shared memory

    SciTech Connect (OSTI)

    Archer, Charles J; Dozsa, Gabor; Ratterman, Joseph D; Smith, Brian E

    2014-06-10

    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.

  13. Memory effects in turbulent transport

    E-Print Network [OSTI]

    Alexander Hubbard; Axel Brandenburg

    2009-11-13

    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.

  14. TLM Modelling of 3D Stacked Wide I/O DRAM Subsystems A Virtual Platform for Memory Controller Design Space Exploration

    E-Print Network [OSTI]

    times higher than the energy required for on-chip memory accesses. This is due to complex and power bandwidth has in- creased but more importantly this technology provides a major boost in energy efficiency in comparison to standard off-chip SDR or DDR/2/3 DRAM devices [3, 4]. The com- bination of high bandwidth

  15. Boston solar retrofits: studies of solar access and economics

    SciTech Connect (OSTI)

    Shapiro, M.

    1980-11-01

    Studies of solar access and solar retrofit economics are described for residential applications in the City of Boston. The study of solar access was based upon a random sample of 94 buildings; the sample was stratified to ensure a broad geographic representation from the city's various sections. Using available data on the heights and orientations of the sampled structures and surrounding buildings, each building's hourly access to sunlight was computed separately for the roof and south facing walls. These data were then aggregated by broad structural classifications in order to provide general measures of solar access. The second study was a comparative analysis of the economics of several solar heating and hot water systems. An active hot water system, installed using pre-assembled, commercially purchased equipment, was selected as a reference technology. A variety of measures of economic performance were computed for this system, with and without existing tax credits and under various financing arrangements. Next, a number of alternative approaches for solar space and water heating were identified from interviews with individuals and groups involved in solar retrofit projects in the Boston area. The objective was to identify approaches that many of those interviewed believe to be low-cost means of applying solar energy in residential settings. The approaches selected include thermal window covers, wall collectors, bread box water heaters, and sun spaces. Preliminary estimates of the performance of several representative designs were developed and the economics of these designs evaluated.

  16. Detecting Tampering in Random Graphs

    E-Print Network [OSTI]

    Pinsky, Ross G

    2012-01-01

    Let $\\mathcal{G}_n=(V_n,E_n)$ be a growing sequence of deterministic finite graphs, with $V_n$ denoting the vertices and $E_n$ denoting the edges. Consider the random graph $\\mathcal{G}_n(p_n)=(V_n, E_n(p_n))$ obtained by including any given edge with probability $p_n$, independent of other edges, and let $P_n^{p_n}$ denote the corresponding probability measure on $\\mathcal{G}_n$. Now tamper with the random graph in some regular way. For example, if $\\mathcal{G}_n$ is the complete graph on $n$ vertices, so that $\\mathcal{G}_n(p_n)$ is the Erdos-Renyi graph, then one might tamper with it by disconnecting all the edges of a randomly chosen vertex, or by adding all the edges of a randomly chosen Hamiltonian path from $\\mathcal{G}_n$, or by adding all the edges of a randomly chosen clique of order $k_n$ from $\\mathcal{G}_n$. Denote the resulting induced measure on $\\mathcal{G}_n$ by $P_n^{p_n,\\text{tamper}}$. The tampering is called \\it detectable\\rm\\ if $\\lim_{n\\to\\infty}||P_n^{p_n,\\text{tamper}}-P_n^{p_n}||_{\\t...

  17. Homogeneous Random Measures and Strongly Supermedian Kernels

    E-Print Network [OSTI]

    Fitzsimmons, Patrick J.

    . Keywords and phrases: Homogeneous random measure, additive functional, Kuznets* *ov measure, potential

  18. Random sequential adsorption of tetramers

    E-Print Network [OSTI]

    Micha? Cie?la

    2013-06-12

    Adsorption of tetramer built of four identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Tetramers were adsorbed on a two dimensional, flat and homogeneous surface. Two different models of the adsorbate were investigated: a rhomboid and a square one; monomer centres were put on vertices of rhomboids and squares, respectively. Numerical simulations allow to establish the maximal random coverage ratio as well as the Available Surface Function (ASF), which is crucial for determining kinetics of the adsorption process. These results were compared with data obtained experimentally for KfrA plasmid adsorption. Additionally, the density autocorrelation function was measured.

  19. 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 and tourism on the national forest estate Setting the scene Everyone has a right of responsible access

  20. LOCH: Open Access Implementation Responsibility Matrix 

    E-Print Network [OSTI]

    Krzak, Anna

    2015-02-05

    Draft Responsibility Matrix for College of Medicine and Veterinary Medicine for REF Open Access requirements implementation.

  1. PennAccess: Towne Building Entrance Information

    E-Print Network [OSTI]

    Plotkin, Joshua B.

    PennAccess: Towne Building Entrance Information: 220 South 33rd Street . Philadelphia . PA . 19104 1. Towne Building is accessible through the main entrance to Levine Hall off Chancellor Walk. This entrance does not access the basement of the Towne Building. 2. There is also access through the Levine

  2. Disaggregated Memory for Expansion and Sharing in Blade Servers

    E-Print Network [OSTI]

    Wenisch, Thomas F.

    1 Disaggregated Memory for Expansion and Sharing in Blade Servers Kevin Lim*, Jichuan Chang-memory co-location on a single system and details the design of a new general-purpose architectural building block--a memory blade--that allows memory to be "disaggregated" across a system ensemble. This remote

  3. Memory Power Management via Dynamic Voltage/Frequency Scaling

    E-Print Network [OSTI]

    Mutlu, Onur

    *Dual 4-core Intel Xeon®, 48GB DDR3 (12 DIMMs), SPEC CPU2006, all cores active. Measured AC power, analytically modeled memory power. #12;Existing Solution: Memory Sleep States? n Most memory energy for SPEC CPU2006 #12;Memory Power can be Scaled Down n DDR can operate at multiple frequencies à

  4. Pseudo Functional Path Delay Test through Embedded Memories 

    E-Print Network [OSTI]

    Gao, Yukun

    2015-04-29

    On-chip memory arrays are widely used in systems-on-chip. Prior research has shown that timing critical paths often go through these memories. Embedded memories are typically tested using memory built-in self-test and macro test. However...

  5. Memory search and the neural representation of context

    E-Print Network [OSTI]

    Polyn, Sean

    the most important behavioral observation in memory search is the finding that recent events are remembered

  6. Hitting the Memory Wall: Implications of the Obvious Appeared in Computer Architecture News, 23(1):2024, March 1995. 7

    E-Print Network [OSTI]

    McKee, Sally A.

    (1):20­24, March 1995. 7 References [Bas91] F. Baskett, Keynote address. International Symposium on Shared Memory: Implications of the Obvious Appeared in Computer Architecture News, 23(1):20­24, March 1995. 6 Figure 2 Trends miss/hit cost ratio 1 10 100 1000 10000 average cycles per access p = 99.0% p = 99.4% p = 99.8% 1995

  7. Non-volatile memory for checkpoint storage

    DOE Patents [OSTI]

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

    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.

  8. Securing non-volatile memory regions

    DOE Patents [OSTI]

    Faraboschi, Paolo; Ranganathan, Parthasarathy; Muralimanohar, Naveen

    2013-08-20

    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.

  9. Low Latency Messages on Distributed Memory Multiprocessors

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Rosing, Matt; Saltz, Joel

    1995-01-01

    This article describes many of the issues in developing an efficient interface for communication on distributed memory machines. Although the hardware component of message latency is less than 1 ws on many distributed memory machines, the software latency associated with sending and receiving typed messages is on the order of 50 ?s. The reason for this imbalance is that the software interface does not match the hardware. By changing the interface to match the hardware more closely, applications with fine grained communication can be put on these machines. This article describes several tests performed and many of the issues involvedmore »in supporting low latency messages on distributed memory machines.« less

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

    E-Print Network [OSTI]

    Peterson, Jonathon

    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

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

    E-Print Network [OSTI]

    Gurumurthi, Sudhanva

    specifically on spatial databases (an important and useful class of mobile applications), this paper explores,gurumurt,anand,vijay,kandemir,mjig@cse.psu.edu Abstract The proliferation of mobile and pervasive computing devices has brought energy constraints of the system architecture, and the software has a key role to play in conserving the battery energy

  12. AI-Ckpt: Leveraging Memory Access Patterns for Adaptive Asynchronous Incremental Checkpointing

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    the last years in all fields of science and industry. They pro- vide an indispensable tool for new insight Bogdan Nicolae IBM Research Dublin, Ireland bogdan.nicolae@ie.ibm.com Franck Cappello Joint Laboratory for Petascale Computing INRIA, France University of Illinois at Urbana-Champaign, USA fci@lri.fr ABSTRACT

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

    E-Print Network [OSTI]

    Coburn, Joel Dylan

    2012-01-01

    attached Storage Array . 2.3.2 DDR-attached Storage . . . .Disk PCIe-Flash PCIe-NVM DDR-NVM Latency (µs) Bandwidth (MB/RAID Disk PCIe Flash PCIe NVM DDR NVM Storage Device Figure

  14. Filling the Memory Access Gap: A Case for On-Chip Magnetic Storage

    E-Print Network [OSTI]

    , an exciting new storage tech- nology based on MicroElectroMechanical Systems (MEMS) is poised to #12;ll and at costs much lower than EEPROM technology [10, 2]. Based on MEMS (MicroElectroMechanical Systems many new types of applications. This research explores the impact MEMS-based storage will have

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

    E-Print Network [OSTI]

    Coburn, Joel Dylan

    2012-01-01

    support for programming languages and operating systems,support for programming languages and operating sys- tems,Support for Programming Languages and Operating Systems,

  16. Chaining direct memory access data transfer operations for compute nodes in a parallel computer

    DOE Patents [OSTI]

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

    2010-09-28

    Methods, systems, and products are disclosed for chaining DMA data transfer operations for compute nodes in a parallel computer that include: receiving, by an origin DMA engine on an origin node in an origin injection FIFO buffer for the origin DMA engine, a RGET data descriptor specifying a DMA transfer operation data descriptor on the origin node and a second RGET data descriptor on the origin node, the second RGET data descriptor specifying a target RGET data descriptor on the target node, the target RGET data descriptor specifying an additional DMA transfer operation data descriptor on the origin node; creating, by the origin DMA engine, an RGET packet in dependence upon the RGET data descriptor, the RGET packet containing the DMA transfer operation data descriptor and the second RGET data descriptor; and transferring, by the origin DMA engine to a target DMA engine on the target node, the RGET packet.

  17. Supersymmetry in Random Matrix Theory

    E-Print Network [OSTI]

    Thomas Guhr

    2010-05-06

    Supersymmetry is nowadays indispensable for many problems in Random Matrix Theory. It is presented here with an emphasis on conceptual and structural issues. An introduction to supermathematics is given. The Hubbard-Stratonovich transformation as well as its generalization and superbosonization are explained. The supersymmetric non-linear sigma model, Brownian motion in superspace and the color-flavor transformation are discussed.

  18. Models of random graph hierarchies

    E-Print Network [OSTI]

    Paluch, Robert; Holyst, Janusz

    2015-01-01

    We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in the LRGH model clusters of size $1$ stop participating in further steps. We find that in both models the number of nodes at a given hierarchy level $h$ decreases approximately exponentially with $h$. The height of the hierarchy $H$, i.e. the number of all hierarchy levels, increases logarithmically with the system size $N$, i.e. with the number of nodes at the first level. The height $H$ decreases monotonically with the conne...

  19. The Cambridge Car Memory Test: A task matched in format to the Cambridge Face Memory Test, with norms, reliability,

    E-Print Network [OSTI]

    Duchaine, Bradley C.

    The Cambridge Car Memory Test: A task matched in format to the Cambridge Face Memory Test a prosopagnosic shows a face-specific or object- general deficit). Here, we present such a task. Our Cambridge Car higher than the mean for females. We demonstrate independence between face memory and car memory

  20. Statistical Performance Modeling of SRAMs 

    E-Print Network [OSTI]

    Zhao, Chang

    2011-02-22

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

  1. Cybersecurity Framework AccessControl

    E-Print Network [OSTI]

    Cybersecurity Framework AccessControl Policy Machine Cloud Computing Cryptography Evaluation Guidelines Standards Systems SecurityPractices Critical Infrastructure Verification Security Controls Assets-170 Computer Security Division 2013 Annual Report #12;#12;NIST Special Publication 800-170 Computer Security

  2. open access journal Public Health

    E-Print Network [OSTI]

    Oakley, Jeremy

    open access journal Journal of Public Health in AfricaeISSN 2038-9930 i www the Journal of Public Health in Africa is a peer-reviewed, electronic quarterly, that focuses on health issues in the African continent. The journal editors seek high quality original articles on public health related issues

  3. RESTRICTED ACCESS to Groat Road

    E-Print Network [OSTI]

    MacMillan, Andrew

    RESTRICTED ACCESS to Dudely B Menzies Bridge to Kinsmen Park to High Level Bridge to Groat Road 89 Ave Edinboro Road Saskatchewan Drive Saskatchewan Drive Saskatchewan Drive 88 Corbett Field West Aberhart Centre Childcare Centre South Field Car Park Thermal Energy Storage Corbett Hall Canadian Blood

  4. Space applications of shape memory alloys 

    E-Print Network [OSTI]

    Godard, Olivier Jean

    2002-01-01

    This work presents an investigation of two new possible space applications of shape memory alloys. The first application uses these alloys as active devices to optimally reorient solar panels in space. The thermal issues related to the actuation...

  5. An autoassociative model of recovery in memory 

    E-Print Network [OSTI]

    Cohen, Andrew L

    1996-01-01

    A model of memory is presented. The model is a neural system which utilizes an autoassociator trained via the Buhmann learning rule. Context plays a central role in the storage and recovery of stored items. Context is ...

  6. Commercialization of germanium based nanocrystal memory

    E-Print Network [OSTI]

    Seow, Kian Chiew

    2007-01-01

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

  7. Size Effects in Ferromagnetic Shape Memory Alloys 

    E-Print Network [OSTI]

    Ozdemir, Nevin

    2012-07-16

    The utilization of ferromagnetic shape memory alloys (FSMAs) in small scale devices has attracted considerable attention within the last decade. However, the lack of sufficient studies on their reversible shape change ...

  8. Allegories of Modernity, Geographies of Memory 

    E-Print Network [OSTI]

    Jeon, Seenhwa

    2012-10-19

    with local and national history as alternative history lessons and challenges the Idea of Progress by revisiting sites of traumatic memory. Midnight's Children constructs counter-stories of Post-Independence India as multiple alternatives to one official...

  9. Memorial University Counselling Centre Professional Psychology

    E-Print Network [OSTI]

    Oyet, Alwell

    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

  10. Directoryless shared memory coherence using execution migration

    E-Print Network [OSTI]

    Lis, Mieszko

    We introduce the concept of deadlock-free migration-based coherent shared memory to the NUCA family of architectures. Migration-based architectures move threads among cores to guarantee sequential semantics in large ...

  11. Orthopaedic applications of ferromagnetic shape memory alloys

    E-Print Network [OSTI]

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

    2008-01-01

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

  12. Characterizing Flash Memory: Anomalies, Observations, and Applications

    E-Print Network [OSTI]

    Siegel, Paul H.

    these characteris- tics. Flash manufacturers provide conservative guidelines about these metrics, and this lack characteris- tics. To be successful, we must understand the trade-offs between flash memory's performance

  13. Housing memory: architecture, materiality and time 

    E-Print Network [OSTI]

    Spanou, Sofia-Irini

    2008-01-01

    , and cognition – and their intricate relationships with material culture, especially architecture, landscapes, practical action and social life, the aim is to suggest a theoretical and methodological framework within which to explore how memory of the past...

  14. Thermomechanical modeling of a shape memory polymer 

    E-Print Network [OSTI]

    Ghosh, Pritha B.

    2009-05-15

    The aim of this work is to demonstrate a Helmholtz potential based approach for the development of the constitutive equations for a shape memory polymer undergoing a thermomechanical cycle. The approach is motivated by the use of a simple spring...

  15. Page-Differential Logging: An Efficient and DBMS-independent Approach for Storing Data into Flash Memory

    E-Print Network [OSTI]

    Kim, Yi-Reun; Song, Il-Yeol

    2010-01-01

    Flash memory is widely used as the secondary storage in lightweight computing devices due to its outstanding advantages over magnetic disks. Flash memory has many access characteristics different from those of magnetic disks, and how to take advantage of them is becoming an important research issue. There are two existing approaches to storing data into flash memory: page-based and log-based. The former has good performance for read operations, but poor performance for write operations. In contrast, the latter has good performance for write operations when updates are light, but poor performance for read operations. In this paper, we propose a new method of storing data, called page-differential logging, for flash-based storage systems that solves the drawbacks of the two methods. The primary characteristics of our method are: (1) writing only the difference (which we define as the page-differential) between the original page in flash memory and the up-to-date page in memory; (2) computing and writing the pag...

  16. Distributed trace using central performance counter memory

    DOE Patents [OSTI]

    Satterfield, David L; Sexton, James C

    2013-10-22

    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.

  17. Associative memory in phasing neuron networks

    SciTech Connect (OSTI)

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

    2014-01-01

    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.

  18. An electromagnetic analog of gravitational wave memory

    E-Print Network [OSTI]

    Lydia Bieri; David Garfinkle

    2013-09-10

    We present an electromagnetic analog of gravitational wave memory. That is, we consider what change has occurred to a detector of electromagnetic radiation after the wave has passed. Rather than a distortion in the detector, as occurs in the gravitational wave case, we find a residual velocity (a "kick") to the charges in the detector. In analogy with the two types of gravitational wave memory ("ordinary" and "nonlinear") we find two types of electromagnetic kick.

  19. Distributed trace using central performance counter memory

    DOE Patents [OSTI]

    Satterfield, David L.; Sexton, James C.

    2013-01-22

    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.

  20. Aggressive children's memory for attachment relevant information 

    E-Print Network [OSTI]

    Collie, Claire Futamase

    2004-09-30

    MEMORY FOR ATTACHMENT RELEVANT INFORMATION A Dissertation by CLAIRE FUTAMASE COLLIE Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR... OF PHILOSOPHY May 2004 Major Subject: Psychology AGGRESSIVE CHILDREN?S MEMORY FOR ATTACHMENT RELEVANT INFORMATION A Dissertation by CLAIRE FUTAMASE COLLIE Submitted to Texas A&M University in partial...

  1. Gravitational wave memory in de Sitter spacetime

    E-Print Network [OSTI]

    Bieri, Lydia; Yau, Shing-Tung

    2015-01-01

    We examine gravitational wave memory in the case where sources and detector are in an expanding cosmology. For simplicity, we treat the case where the cosmology is de Sitter spacetime, and discuss the possibility of generalizing our results to the case of a more realistic cosmology. We find results very similar to those of gravitational wave memory in an asymptotically flat spacetime, but with the magnitude of the effect multiplied by a redshift factor.

  2. Post polymerization cure shape memory polymers

    DOE Patents [OSTI]

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

    2014-11-11

    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.

  3. Evaluating operating system vulnerability to memory errors.

    SciTech Connect (OSTI)

    Ferreira, Kurt Brian; Bridges, Patrick G.; Pedretti, Kevin Thomas Tauke; Mueller, Frank; Fiala, David; Brightwell, Ronald Brian

    2012-05-01

    Reliability is of great concern to the scalability of extreme-scale systems. Of particular concern are soft errors in main memory, which are a leading cause of failures on current systems and are predicted to be the leading cause on future systems. While great effort has gone into designing algorithms and applications that can continue to make progress in the presence of these errors without restarting, the most critical software running on a node, the operating system (OS), is currently left relatively unprotected. OS resiliency is of particular importance because, though this software typically represents a small footprint of a compute node's physical memory, recent studies show more memory errors in this region of memory than the remainder of the system. In this paper, we investigate the soft error vulnerability of two operating systems used in current and future high-performance computing systems: Kitten, the lightweight kernel developed at Sandia National Laboratories, and CLE, a high-performance Linux-based operating system developed by Cray. For each of these platforms, we outline major structures and subsystems that are vulnerable to soft errors and describe methods that could be used to reconstruct damaged state. Our results show the Kitten lightweight operating system may be an easier target to harden against memory errors due to its smaller memory footprint, largely deterministic state, and simpler system structure.

  4. BRIDGING THE GAP BETWEEN BRAIN AND BEHAVIOR: COGNITIVE AND NEURAL MECHANISMS OF EPISODIC MEMORY

    E-Print Network [OSTI]

    Fortin, Norbert J.

    memory. Key words: episodic memory, hippocampus, recollection, associations, odor discrimination, digging of cognitive neuroscience. Aristotle (1931) contended that ``other ani- mals (as well as man) have memory, but

  5. Low-level software security : exploiting memory safety vulnerabilities and assumptions

    E-Print Network [OSTI]

    Checkoway, Stephen

    2012-01-01

    memory cartridge slots . . . . . . . . . . . . . . . . .by means of a memory cartridge containing a specially-by means of a memory cartridge containing a specially-

  6. Delay and throughput analysis of tree algorithms for random access over noisy collision channels

    E-Print Network [OSTI]

    /FS was also combined with the binary exponential backoff (BEB) algorithm in [5] in an 802.16 setting of the BEB algorithm. Furthermore, [5] also indicated that the saturation throughput of SICTA/FS degrades quickly as the number of users increases, while BEB-SICTA/FS still achieves high throughputs

  7. Memory of jamming - multiscale flow in soft and granular matter

    E-Print Network [OSTI]

    Nishant Kumar; Stefan Luding

    2015-07-29

    Soft, disordered, micro-structured materials are ubiquitous in nature and industry, and are different from ordinary fluids or solids, with unusual, interesting flow properties. The transition from fluid to solid - at the so-called jamming density - features a multitude of complex mechanisms, but there is no unified theoretical framework that explains them all. In this study, a simple yet quantitative and predictive model is presented, which allows for a changing jamming density, encompassing the memory of the deformation history and explaining a multitude of flow phenomena at and around jamming. The jamming density, introduced as a new state-variable, changes due to the deformation history and relates the system's macroscopic response to its micro-structure. The packing efficiency can increase logarithmically slow under gentle "tapping" or repeated (isotropic) compression, leading to an increase of the jamming density. In contrast, shear deformations cause anisotropy, changing the packing efficiency exponentially fast with either dilatancy or compactancy. The memory of the system near jamming can be explained by a micro-statistical model that involves a multiscale, fractal energy landscape and links the microscopic particle picture to the macroscopic continuum description, providing a unified explanation for the qualitatively different flow-behavior for different deformation modes. To complement our work, a recipe to extract the history-dependent jamming density from experimentally accessible data is proposed, and alternative state-variables are compared. The proposed simple, usable macroscopic model, will help predicting and avoiding geophysical hazards, bring forward industrial process design and optimization, and understand and solve scientific challenges in fundamental research.

  8. Memory of jamming - multiscale flow in soft and granular matter

    E-Print Network [OSTI]

    Nishant Kumar; Stefan Luding

    2015-11-03

    Soft, disordered, micro-structured materials are ubiquitous in nature and industry, and are different from ordinary fluids or solids, with unusual, interesting static and flow properties. The transition from fluid to solid - at the so-called jamming density - features a multitude of complex mechanisms, but there is no unified theoretical framework that explains them all. In this study, a simple yet quantitative and predictive model is presented, which allows for a variable, changing jamming density, encompassing the memory of the deformation history and explaining a multitude of phenomena at and around jamming. The jamming density, now introduced as a new state-variable, changes due to the deformation history and relates the system's macroscopic response to its micro-structure. The packing efficiency can increase logarithmically slow under gentle ``tapping'' or repeated (isotropic) compression, leading to an increase of the jamming density. In contrast, shear deformations cause anisotropy, changing the packing efficiency exponentially fast with either dilatancy or compactancy. The memory of the system near jamming can be explained by a micro-statistical model that involves a multiscale, fractal energy landscape and links the microscopic particle picture to the macroscopic continuum description, providing a unified explanation for the qualitatively different flow-behavior for different deformation modes. To complement our work, a recipe to extract the history-dependent jamming density from experimentally accessible data is proposed, and alternative state-variables are compared. The proposed simple, usable macroscopic model, will help understanding, predicting and avoiding failure of structures or geophysical hazards, and will bring forward industrial process design and optimization, and help solving scientific challenges in fundamental research.

  9. Shape memory system with integrated actuation using embedded particles

    DOE Patents [OSTI]

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

    2009-09-22

    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.

  10. Shape memory system with integrated actuation using embedded particles

    DOE Patents [OSTI]

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

    2012-05-29

    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.

  11. Shape memory system with integrated actuation using embedded particles

    DOE Patents [OSTI]

    Buckley, Patrick R; Maitland, Duncan J

    2014-04-01

    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.

  12. Space-Memory-Memory Architecture for Clos-Network Packet Switches

    E-Print Network [OSTI]

    Hamdi, Mounir

    resequencing buffers. As a result, the SMM architecture can achieve very high performance, and is readily implemented using current technology. I. INTRODUCTION The Clos network architecture [1] was first proposedSpace-Memory-Memory Architecture for Clos-Network Packet Switches Xin Li, Zhen Zhou and Mounir

  13. EFFICIENT STOCHASTIC GALERKIN METHODS FOR RANDOM ...

    E-Print Network [OSTI]

    2008-09-16

    EFFICIENT STOCHASTIC GALERKIN METHODS FOR RANDOM. DIFFUSION EQUATIONS. DONGBIN XIU? AND JIE SHEN†. Abstract. We discuss in this ...

  14. Subject Access to Your Information 

    E-Print Network [OSTI]

    Tucker, Sandra

    2006-08-01

    =ISO-8859-1 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... Lists Transportation Research Thesaurus Your own list Use a Short List or a Long List of Terms? If you have a small collection, a short list of terms is appropriate. If you have a large collection, a longer list of more specific terms...

  15. Choosing a Random Peer [Extended Abstract

    E-Print Network [OSTI]

    Saia, Jared

    ­ damental statistical operation; a function which chooses a random peer can be used for many types collection by statistically rig­ orous sampling methods; to provide support for randomized, distributed algorithms over peer­to­peer networks; and to support the creation and maintenance of random links

  16. Choosing a Random Peer [Extended Abstract

    E-Print Network [OSTI]

    Saia, Jared

    - damental statistical operation; a function which chooses a random peer can be used for many types collection by statistically rig- orous sampling methods; to provide support for randomized, distributed algorithms over peer-to-peer networks; and to support the creation and maintenance of random links

  17. Alexandria Digital Library Project Content Access Characterization

    E-Print Network [OSTI]

    Janée, Greg

    Alexandria Digital Library Project Content Access Characterization in Digital Libraries Greg Janée · James Frew · David Valentine University of California, Santa Barbara #12;Alexandria Digital Library environments e.g., GIS #12;Alexandria Digital Library Project Janée, Frew, Valentine · Content Access

  18. Metropolitan Accessibility and Transportation Sustainability:Sustainability

    E-Print Network [OSTI]

    Papalambros, Panos

    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

  19. HM-ACCESS Project | Department of Energy

    Office of Environmental Management (EM)

    Project HM-ACCESS Project Framework for the Use of Electronic Shipping Papers for the Transport of Hazardous Materials HM-ACCESS Project (Framework for the Use of Electronic...

  20. Premier Access Insurance Company Certificate of Insurance

    E-Print Network [OSTI]

    Leistikow, Bruce N.

    Premier Access Insurance Company Certificate of Insurance Policy/Group Number: 3725 We certify provided by Premier Access Insurance Company for You and Your eligible Dependents. All terms and benefits...................................................... Family Deductible Amount

  1. Low-temperature coherence properties of Z_2 quantum memory

    E-Print Network [OSTI]

    Tomoyuki Morimae

    2010-01-08

    We investigate low-temperature coherence properties of the Z_2 quantum memory which is capable of storing the information of a single logical qubit. We show that the memory has superposition of macroscopically distinct states for some values of a control parameter and at sufficiently low temperature, and that the code states of this memory have no instability except for the inevitable one. However, we also see that the coherence power of this memory is limited by space and time. We also briefly discuss the RVB memory, which is an improvement of the Z_2 quantum memory, and the relations of our results to the obscured symmetry breaking in statistical physics.

  2. A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Database Replication) \\Lambda

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    databases while keeping their queries secret from the database managers. We propose a new model for PIR, utilizing auxiliary random servers to provide privacy services for database access. In this model, prior. In this model, the database is viewed as an n­bit string x out of which the user retrieves the i­th bit x i

  3. Identity, Credential, and Access Management (ICAM)

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2013-02-19

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

  4. Characterizing Open Access Publishing at Your Institution 

    E-Print Network [OSTI]

    Hubbard, David E.; Li, Yu

    2014-11-03

    Medical Library, 2008) Open Access (OA) “… digital, online, free of charge, and free of most copyright and licensing restrictions.” (Suber, 2012, p. 4) “Flavors” of Open Access Gold: provide immediate open access, peer reviewed; authors retain copyright... Green: self-archiving; not necessarily peer reviewed Hybrid: some open access Delayed: embargo period Some Questions about OA Publishing? How much OA publishing is there at my institution? In what OA journals are my faculty publishing? In what...

  5. Accessing Fieldbus Systems via Web Services

    E-Print Network [OSTI]

    Turau, Volker

    Accessing Fieldbus Systems via Web Services Marcus Venzke1 and Stefan Pitzek2 1 Telematics -- This paper discusses accessing fieldbus systems via web services over the Internet or intranets, having validation. It rejects all accesses not conforming to the specification of the web service's interface. 1

  6. The University of Western Ontario's Accessibility Plan

    E-Print Network [OSTI]

    Lennard, William N.

    The University of Western Ontario's Accessibility Plan September 2004 to August 2005 Prepared Appendix C ­ King's University College Accessibility Plan #12;3 The University of Western Ontario's Annual Accessibility Plan September 30, 2004 Introduction In December 2001, Ontario passed the Ontarians

  7. The University of Western Ontario's Accessibility Plan

    E-Print Network [OSTI]

    Lennard, William N.

    The University of Western Ontario's Accessibility Plan September 2005 to August 2006 Prepared ........................................................................................................15 Appendix A ­ Members of WODAC Appendix B ­ The University of Western Ontario Accessibility of Western Ontario's Annual Accessibility Plan September 30, 2005 Introduction In December 2001, Ontario

  8. Building Access Program Facilities Management Bridge Group

    E-Print Network [OSTI]

    Building Access Program Facilities Management Bridge Group January 21, 2014 #12;Campus Safety Initiatives · Lighting and Landscaping · Video Surveillance · Building Access #12;The Challenge · How do we;Components of Building Access · Perimeter automation · Tightening of public hours #12;Perimeter Automation

  9. Human Resources Security Access Matrix Function Training

    E-Print Network [OSTI]

    Wu, Shin-Tson

    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

  10. Emotional Arsoual and Modulation of Multiple Memory Systems: Effects of Unconditioned and Conditioned Stressors 

    E-Print Network [OSTI]

    Leong, Kah-Chung

    2014-09-18

    importantly, the different types of memory are mediated by different neuroanatomical regions. Two primary memory systems are the hippocampus-dependent cognitive memory system and the dorsolateral striatum-dependent habit memory system. Interestingly...

  11. Field effect memory alloy heat engine

    SciTech Connect (OSTI)

    Johnson, A.D.; Kirkpatrick, P.F.

    1981-08-04

    A heat engine employing a memory alloy and a force field such as gravity for converting heat energy into mechanical work is disclosed. Field effect elements are mounted on the distal ends of flexible spokes which in turn are mounted about a hub to form a rotating wheel. The memory alloy is in the form of a helix disposed about the circumference of the wheel and interconnecting the ends of adjacent spoke pairs. Heat is transferred to segments of the memory alloy on one side of the wheel so that the segments deform toward their memory shape and deflect the associated spokes toward each other. Heat is transferred away from the memory alloy segments on the opposite side so that the segments deform toward their trained shape and permit the spokes to flex apart. The concentration of field effect elements on the first side of the wheel is greater than the concentration on the other side so that the resultant force created by a remote field acts as a torque for rotating the wheel.

  12. The Aesthetics of Remembering 9/11: Towards a Transnational Typology of Memorials

    E-Print Network [OSTI]

    Gessner, Ingrid

    2015-01-01

    Memorial (Fort Carson) Connecticut Alexander R. SteinmanNursery School (Easton) Connecticut’s 9/11 Living Memorial (

  13. The Aesthetics of Remembering 9/11: Towards a Transnational Typology of Memorials

    E-Print Network [OSTI]

    Gessner, Ingrid

    2015-01-01

    Run Park The National 9/11 Pentagon Memorial Florida Friendship Park 9/11 Memorial (Redington Beach) Indian River

  14. Parking on a Random Tree

    E-Print Network [OSTI]

    H. Dehling; S. R. Fleurke; C. Kuelske

    2007-11-26

    Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one. The particle sticks to the vertex whenever the vertex and all of its nearest neighbors are not occupied yet. We provide an explicit expression for the so-called parking constant in terms of the generating function.

  15. Random sets and confidence procedures

    E-Print Network [OSTI]

    Barnett, William A.

    1979-06-01

    ) —* (Y, -T, (Qe)eee) be a random set with Y C ^ ( 0 ) - {0} and with Qe the probability distribution of S induced on Y by P0. Assume that S is surjective. The relation of statistical confidence sets to the following definition will be investigated... of confidence procedures now can be defined. DEFINITION 6. Let S be a confidence procedure. Then S has (lower) confidence level y — inl{Q6{êe) \\ 6 ^ Q). If S is a confidence pro­ cedure, and if x E ST, then S(x) will be called a confidence subset of 0...

  16. Overview of Quantum Memory Protection and Adiabaticity Induction by Fast-Signal Control

    E-Print Network [OSTI]

    Jun Jing; Lian-Ao Wu

    2014-12-04

    A quantum memory or information processing device is subject to disturbance from its surrounding environment or inevitable leakage due to its contact with other systems. To tackle these problems, several control protocols have been proposed for quantum memory or storage. Among them, the fast-signal control or dynamical decoupling based on external pulse sequences provides a prevailing strategy aimed at suppressing decoherence and preventing the target systems from the leakage or diffusion process. In this paper, we review the applications of this protocol in protecting quantum memory under the non-Markovian dissipative noise and maintaining systems on finite speed adiabatic passages without leakage there-from. We analyze leakage and control perturbative and nonperturbative dynamical equations including second-order master equation, quantum-state-diffusion equation, and one-component master equation derived from Feshbach PQ-partitioning technique. It turns out that the quality of fast-modulated signal control is insensitive to configurations of the applied pulse sequences. Specifically, decoherence and leakage will be greatly suppressed as long as the control sequence is able to effectively shift the system beyond the bath cutoff frequency, almost independent of the details of the control sequences which could be ideal pulses, regular rectangular pulses, random pulses and even noisy pulses.

  17. Video, Audio, and Animation Text Versions for Web Accessibility...

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

    Video, Audio, and Animation Text Versions for Web Accessibility Video, Audio, and Animation Text Versions for Web Accessibility For accessibility, Section 508 requires text...

  18. A proposal for a UPC memory consistency model, v1.0

    SciTech Connect (OSTI)

    Yelick, Katherine; Bonachea, Dan; Wallace, Charles

    2004-05-05

    The memory consistency model in a language defines the order in which the results of write operations maybe observed through read operations. The behavior of a UPC program may depend on the timing of accesses to shared variables, so a program defines a set of possible executions, rather than a single execution. The memory consistency model constrains the set of possible executions for a given program; the user may then rely on properties that are true of all of those executions. The memory consistency model is defined in terms of the read and write operations issued by each thread in naive translation of the code, i.e., without any code transformations by the compiler, with each thread issuing operations as defined by the abstract machine defined in ISO C 5.1.2.3. A UPC compiler or run time system may perform various code transformations to improve performance, so long as they are not visible to the programmer - i.e., provided the set of externally-visible behaviors (the input/output dynamics and volatile behavior defined in ISO C 5.1.2.3) from any execution of the transformed program are identical to those of the original program executing on the abstract machine and adhering to the consistency model defined in this document.

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

    SciTech Connect (OSTI)

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

    2010-09-01

    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.

  20. Memory device using movement of protons

    DOE Patents [OSTI]

    Warren, W.L.; Vanheusden, K.J.R.; Fleetwood, D.M.; Devine, R.A.B.

    1998-11-03

    An electrically written memory element is disclosed utilizing the motion of protons within a dielectric layer surrounded by layers on either side to confine the protons within the dielectric layer with electrode means attached to the surrounding layers to change the spatial position of the protons within the dielectric layer. The device is preferably constructed as a silicon-silicon dioxide-silicon layered structure with the protons being introduced to the structure laterally through the exposed edges of the silicon dioxide layer during a high temperature anneal in an atmosphere containing hydrogen gas. The device operates at low power, is preferably nonvolatile, is radiation tolerant, and is compatible with convention silicon MOS processing for integration with other microelectronic elements on the same silicon substrate. With the addition of an optically active layer, the memory element becomes an electrically written, optically read optical memory element. 19 figs.

  1. Memory device using movement of protons

    DOE Patents [OSTI]

    Warren, William L. (Albuquerque, NM); Vanheusden, Karel J. R. (Albuquerque, NM); Fleetwood, Daniel M. (Albuquerque, NM); Devine, Roderick A. B. (St. Martin le Vinoux, FR)

    1998-01-01

    An electrically written memory element utilizing the motion of protons within a dielectric layer surrounded by layers on either side to confine the protons within the dielectric layer with electrode means attached to the surrounding layers to change the spatial position of the protons within the dielectric layer. The device is preferably constructed as a silicon-silicon dioxide-silicon layered structure with the protons being introduced to the structure laterally through the exposed edges of the silicon dioxide layer during a high temperature anneal in an atmosphere containing hydrogen gas. The device operates at low power, is preferably nonvolatile, is radiation tolerant, and is compatible with convention silicon MOS processing for integration with other microelectronic elements on the same silicon substrate. With the addition of an optically active layer, the memory element becomes an electrically written, optically read optical memory element.

  2. Memory device using movement of protons

    DOE Patents [OSTI]

    Warren, William L. (Albuquerque, NM); Vanheusden, Karel J. R. (Albuquerque, NM); Fleetwood, Daniel M. (Albuquerque, NM); Devine, Roderick A. B. (St. Martin le Vinoux, FR)

    2000-01-01

    An electrically written memory element utilizing the motion of protons within a dielectric layer surrounded by layers on either side to confine the protons within the dielectric layer with electrode means attached to the surrounding layers to change the spatial position of the protons within the dielectric layer. The device is preferably constructed as a silicon-silicon dioxide-silicon layered structure with the protons being introduced to the structure laterally through the exposed edges of the silicon dioxide layer during a high temperature anneal in an atmosphere containing hydrogen gas. The device operates at low power, is preferably nonvolatile, is radiation tolerant, and is compatible with convention silicon MOS processing for integration with other microelectronic elements on the same silicon substrate. With the addition of an optically active layer, the memory element becomes an electrically written, optically read optical memory element.

  3. Characterization of Shape Memory Alloys Using Artificial Neural Networks

    E-Print Network [OSTI]

    Valasek, John

    1 Characterization of Shape Memory Alloys Using Artificial Neural Networks Jim Henrickson, Kenton ­ Generate Training Data ­ Train Artificial Neural Network Results Conclusion Characterization of Shape Characterization of Shape Memory Alloys Using Artificial Neural Networks Jim Henrickson, Kenton Kirkpatrick, Dr

  4. Object Co-location and Memory Reuse for Java Programs

    E-Print Network [OSTI]

    Lau, Francis C.M.

    : Memory allocator, garbage collector, mutator, Java, object co- location, memory reuse ACM Reference of a runtime system becomes increasingly signif- icant [Sun Microsystems 2003]. Our second goal is to find

  5. OpenRAM: An Open-Source Memory Compiler

    E-Print Network [OSTI]

    Butera, Jeffrey Thomas

    2013-01-01

    3 Software Implementation Main CompilerAn Open-Source Memory Compiler by Jeffrey T. Butera InAn Open-Source Memory Compiler A thesis submitted in partial

  6. Reversible neural inactivation reveals hippocampal particin several memory processesipation 

    E-Print Network [OSTI]

    Riedel, G; Micheau, J; Lam, A G M; Roloff, E.v.L.; Martin, Stephen J; Bridge, H; de Hoz, L; Poeschel, B; McCulloch, J; Morris, Richard G M

    Studies of patients and animals with brain lesions have implicated the hippocampal formation in spatial, declarative/relational and episodic types of memory. These and other types of memory consist of a series of ...

  7. Fast in-memory storage systems : two aspects

    E-Print Network [OSTI]

    Mao, Yandong

    2014-01-01

    This dissertation addresses two challenges relating to in-memory storage systems. The first challenge is storing and retrieving data at a rate close to the capabilities of the underlying memory system, particularly in the ...

  8. Storage Systems for Non-volatile Memory Devices 

    E-Print Network [OSTI]

    Wu, Xiaojian

    2011-10-21

    This dissertation presents novel approaches to the use of non-volatile memory devices in building storage systems. There are many types of non-volatile memory devices, and they usually have better performance than regular magnetic hard disks...

  9. Intellectual property strategy : analysis of the flash memory industry

    E-Print Network [OSTI]

    Ogura, Tomoko H

    2006-01-01

    This thesis studies the intellectual property strategy of companies in the flash memory industry, with special emphasis on technology and the development of nitride-based flash, a new and emerging type of memory technology. ...

  10. Method for refreshing a non-volatile memory

    DOE Patents [OSTI]

    Riekels, James E. (New Hope, MN); Schlesinger, Samuel (Aventura, FL)

    2008-11-04

    A non-volatile memory and a method of refreshing a memory are described. The method includes allowing an external system to control refreshing operations within the memory. The memory may generate a refresh request signal and transmit the refresh request signal to the external system. When the external system finds an available time to process the refresh request, the external system acknowledges the refresh request and transmits a refresh acknowledge signal to the memory. The memory may also comprise a page register for reading and rewriting a data state back to the memory. The page register may comprise latches in lieu of supplemental non-volatile storage elements, thereby conserving real estate within the memory.

  11. Molecular and quantum dot floating gate non-volatile memories

    E-Print Network [OSTI]

    Abdu, Hassen

    2008-01-01

    Conventional Flash memory devices face a scaling issue that will impede memory scaling beyond the 50nm node: a reliability issue involving the tunneling oxide thickness and charge retention. A possible solution is to replace ...

  12. Good Programming in Transactional Memory$ Game Theory Meets Multicore Architecture

    E-Print Network [OSTI]

    Good Programming in Transactional Memory$ Game Theory Meets Multicore Architecture Raphael compatible. Keywords: transactional memory, game theory, multicore architecture, concurrency, contention management, mechanism design, human factors 1. Introduction In traditional single core architecture

  13. Good Programming in Transactional Memory Game Theory Meets Multicore Architecture

    E-Print Network [OSTI]

    Good Programming in Transactional Memory Game Theory Meets Multicore Architecture Raphael Eidenbenz compatible. Key words: transactional memory, game theory, multicore architecture, concur- rency, contention management, mechanism design, human factors. 1 Introduction In traditional single core architecture

  14. Curating Memory: 9/11 Commemoration and Foucault's Archive 

    E-Print Network [OSTI]

    Rowe, Sara 1988-

    2012-08-17

    This study of commemoration of 9/11 on the 10th anniversary is performed at the intersection of public memory and rhetorical studies. Examining the role of the individual within public memory, this study furthers both ...

  15. Structural Thermomechanical Models for Shape Memory Alloy Components 

    E-Print Network [OSTI]

    Rao, Ashwin

    2014-04-18

    Thermally responsive shape memory alloys (SMA) demonstrate interesting properties like shape memory effect (SME) and superelasticity (SE). SMA components in the form of wires, springs and beams typically exhibit complex, nonlinear hysteretic...

  16. Laboratory Access | Sample Preparation Laboratories

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformationJesse Bergkamp Graduate student Subtask22BackgroundLabSanta'sNewNaturalAccess

  17. DIRECTIONS FOR MEMORY HIERARCHIES AND THEIR COMPONENTS: RESEARCH AND DEVELOPMENT

    E-Print Network [OSTI]

    Smith, Alan Jay

    2011-01-01

    system should perhaps be subsumed into the overall management of the unified memory hierarchy on which the data base

  18. PHASE FIELD EQUATIONS WITH MEMORY: THE HYPERBOLIC CASE

    E-Print Network [OSTI]

    Rotstein, Horacio G.

    , memory effects, mean curvature flow, crystalline algorithms AMS subject classifications. 80A22, 74D10, 45

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

    E-Print Network [OSTI]

    Kockar, Benat

    2009-05-15

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

  20. MPI+OPENMP IMPLEMENTATION OF MEMORY-SAVING PARALLEL PIC APPLICATIONS ON HIERARCHICAL DISTRIBUTED-SHARED MEMORY

    E-Print Network [OSTI]

    Vlad, Gregorio

    MPI+OPENMP IMPLEMENTATION OF MEMORY-SAVING PARALLEL PIC APPLICATIONS ON HIERARCHICAL DISTRIBUTED for the development of memory- saving parallel Particle-in-cell simulation codes, targeted to hierarchical distributed

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

    E-Print Network [OSTI]

    Fedorenko, Evelina Georgievna

    2007-01-01

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

  2. Energy Efficient Proactive Thermal Management in Memory Subsystem

    E-Print Network [OSTI]

    Simunic, Tajana

    Energy Efficient Proactive Thermal Management in Memory Subsystem Raid Ayoub rayoub management of memory subsystem is challenging due to performance and thermal constraints. Big energy gains appreciable energy savings in memory sub-system and mini- mize thermal problems. We adopt the consolidation

  3. Direct match data flow memory for data driven computing

    DOE Patents [OSTI]

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

    1997-01-01

    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.

  4. FAST SEARCH IN MAIN MEMORY DATABASES Anastasia Analyti & Sakti Pramanik *

    E-Print Network [OSTI]

    Analyti, Anastasia

    FAST SEARCH IN MAIN MEMORY DATABASES ABSTRACT Anastasia Analyti & Sakti Pramanik * Computer Science and analyze high performance hash based search methods for main memory databasea. We define optimal search in main memory databases as the search that requires at most one key comparison to locate a record

  5. Conjunctive Selection Conditions in Main Memory Kenneth A. Ross

    E-Print Network [OSTI]

    Ross, Kenneth A.

    Conjunctive Selection Conditions in Main Memory Kenneth A. Ross Columbia University kar of records. With large main memories available cheaply, systems may choose to keep the data entirely in main in main memory needs to take into account the architectural characteristics of modern processors, just

  6. An implementation of SISAL for distributed-memory architectures

    SciTech Connect (OSTI)

    Beard, P.C.

    1995-06-01

    This thesis describes a new implementation of the implicitly parallel functional programming language SISAL, for massively parallel processor supercomputers. The Optimizing SISAL Compiler (OSC), developed at Lawrence Livermore National Laboratory, was originally designed for shared-memory multiprocessor machines and has been adapted to distributed-memory architectures. OSC has been relatively portable between shared-memory architectures, because they are architecturally similar, and OSC generates portable C code. However, distributed-memory architectures are not standardized -- each has a different programming model. Distributed-memory SISAL depends on a layer of software that provides a portable, distributed, shared-memory abstraction. This layer is provided by Split-C, a dialect of the C programming language developed at U.C. Berkeley, which has demonstrated good performance on distributed-memory architectures. Split-C provides important capabilities for good performance: support for program-specific distributed data structures, and split-phase memory operations. Distributed data structures help achieve good memory locality, while split-phase memory operations help tolerate the longer communication latencies inherent in distributed-memory architectures. The distributed-memory SISAL compiler and run-time system takes advantage of these capabilities. The results of these efforts is a compiler that runs identically on the Thinking Machines Connection Machine (CM-5), and the Meiko Computing Surface (CS-2).

  7. Evaluating Memory Energy Efficiency in Parallel I/O Workloads

    E-Print Network [OSTI]

    Zhu, Yifeng

    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

  8. Shape Memory Assisted Self-Healing Coating Xiaofan Luo

    E-Print Network [OSTI]

    Mather, Patrick T.

    Shape Memory Assisted Self-Healing Coating Xiaofan Luo and Patrick T. Mather* Department and characterization of new shape memory assisted self- healing (SMASH) coatings. The coatings feature a phase in a shape memory epoxy matrix. Mechanical damage to the coating can be self-healed via heating, which

  9. Phoenix++: Modular MapReduce for Shared-Memory Systems

    E-Print Network [OSTI]

    Kozyrakis, Christos

    Phoenix++: Modular MapReduce for Shared-Memory Systems Justin Talbot, Richard M. Yoo, and Christos This paper describes our rewrite of Phoenix, a MapReduce framework for shared-memory CMPs and SMPs. Despite successfully demonstrating the applicability of a MapReduce- style pipeline to shared-memory machines, Phoenix

  10. Guide wire extension for shape memory polymer occlusion removal devices

    SciTech Connect (OSTI)

    Maitland, Duncan J.; Small, IV, Ward; Hartman, Jonathan

    2009-11-03

    A flexible extension for a shape memory polymer occlusion removal device. A shape memory polymer instrument is transported through a vessel via a catheter. A flexible elongated unit is operatively connected to the distal end of the shape memory polymer instrument to enhance maneuverability through tortuous paths en route to the occlusion.

  11. Direct match data flow memory for data driven computing

    DOE Patents [OSTI]

    Davidson, G.S.; Grafe, V.G.

    1997-10-07

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

  12. Chronic administration of corticosterone impairs spatial reference memory before spatial working memory in rats

    E-Print Network [OSTI]

    Anderson, Brenda

    of glucocorticoids occur in numerous disorders, such as anorexia nervosa (Seed, Dixon, McCluskey, & Young, 2000) and CushingÕs syndrome (Starkman et al., 1992, 1999), as well as memory deficits in anorexia nervosa (Seed et

  13. Martensite Strain Memory in the Shape Memory Alloy Nickel-Titanium Under Mechanical Cycling

    E-Print Network [OSTI]

    Daly, Samantha

    that largely stabilize during the first loading cycle. Keywords Shape memory alloy. Nickel-Titanium . Nitinol in the recovery of mechanically-induced strains as large as 8% in Nickel-Titanium (Nitinol), a nearly equi- atomic

  14. On-Chip Random Spectrometer

    E-Print Network [OSTI]

    Redding, Brandon; Sarma, Raktim

    2013-01-01

    Light scattering in disordered media has been studied extensively due to its prevalence in natural and artificial systems [1]. In the field of photonics most of the research has focused on understanding and mitigating the effects of scattering, which are often detrimental. For certain applications, however, intentionally introducing disorder can actually improve the device performance, e.g., in photovoltaics optical scattering improves the efficiency of light harvesting [2-5]. Here, we utilize multiple scattering in a random photonic structure to build a compact on-chip spectrometer. The probe signal diffuses through a scattering medium generating wavelength-dependent speckle patterns which can be used to recover the input spectrum after calibration. Multiple scattering increases the optical pathlength by folding the paths in a confined geometry, enhancing the spectral decorrelation of speckle patterns and thus increasing the spectral resolution. By designing and fabricating the spectrometer on a silicon wafe...

  15. ANTHROPOLOGY HISTORY AND MEMORY Anthropology Professors

    E-Print Network [OSTI]

    Watkins, Joseph C.

    ANTHROPOLOGY HISTORY AND MEMORY Anthropology Professors Ana Alonzo Maribel Alvarez TJ Ferguson of the Southwest ANTH 417A (MENAS) North African Societies: History, Culture and Politics ANTH 418 Southwest Land, Culture and History ANTH 475A (MAS) The Education of Latinas/Latinos Click here to search for course

  16. Enhancing Compiler Techniques for Memory Energy Optimizations

    E-Print Network [OSTI]

    that the best performance opti- mizations do not necessarily generate the best energy behavior in mem- ory. WeEnhancing Compiler Techniques for Memory Energy Optimizations Joseph Zambreno1 , Mahmut Taylan frequencies steadily rise in modern microprocessors, energy consumption is quickly joining perfor- mance

  17. Rewritable Memory by Controllable Nanopatterning of DNA

    E-Print Network [OSTI]

    Pierce, Niles A.

    ABSTRACT Fabricating a nanostructure capable of reversibly patterning molecules is a fundamental goal within nanotechnology, underlying diverse processes such as information storage, scaffold functioning of the device as rewritable memory. The bit state of each address is controlled by specific DNA

  18. MEMORY SYSTEM DESIGN FOR BUS BASED MULTIPROCESSORS

    E-Print Network [OSTI]

    Sohi, Guri S.

    -cost microprocessors have led to the construction of small- to medium-scale shared memory multipro- cessors the operating environment of the multiprocessor. Two major operating environments - throughput-oriented and speedup-oriented, are considered in this thesis. 1.2. Operating Environment of Multiprocessors 1

  19. MEMORY SYSTEM DESIGN FOR BUS BASED MULTIPROCESSORS

    E-Print Network [OSTI]

    Sohi, Guri S.

    ­cost microprocessors have led to the construction of small­ to medium­scale shared memory multipro­ cessors the operating environment of the multiprocessor. Two major operating environments ­ throughput­oriented and speedup­oriented, are considered in this thesis. 1.2. Operating Environment of Multiprocessors 1

  20. Protist Web Alert Memories of Times Past

    E-Print Network [OSTI]

    Simpson, Larry

    Protist Web Alert Memories of Times Past The Euglenoid Project (http that the Euglenoids have always fascinated me and so did this site. Micro*scope Astrobiology Institute Web Site from reviewed this site in a previous Web Alert, but it has been revised and updated and so is worth another

  1. Entanglement preserving memory for quantum microwave

    E-Print Network [OSTI]

    Vallette, Bruno

    -in entanglement generation Flurin et al., PRL 2013 #12;memory cavity itinerant wave packet Entanglement Entanglement generation #12;itinerant wave packet Entanglement Retrieval Retrieval #12;Entanglement Retrieval) @ Saclay, France Zhu et al. Nature (2011) @ Atsugi, Japan High Q cavity Yin et al. PRL (2013) @ Santa

  2. Memory Space Representation Heterogeneous Network Process Migration

    E-Print Network [OSTI]

    Sun, Xian-He

    Memory Space Representation for Heterogeneous Network Process Migration Kasidit Chanchio Xian@bit.csc.lsu.edu http://www.csc.lsu.edu/~scs/ Abstract A major difficulty of heterogeneous process migration is how and effective for heterogeneous network process migration. 1. Introduction As network computing becomes

  3. TEXAS MEMORIAL MUSEUM Speleological Monographs, Number 7

    E-Print Network [OSTI]

    Suarez, Andrew V.

    TEXAS MEMORIAL MUSEUM Speleological Monographs, Number 7 Studies on the CAVE AND ENDOGEAN FAUNA Science Research Laboratory Museum of Texas Tech University, 3301 4th Street Lubbock, Texas 79409 U.S.A. Email: james.cokendolpher@ttu.edu and James R. Reddell Texas Natural Science Center The University

  4. Weather Report Translation using a Translation Memory

    E-Print Network [OSTI]

    Langlais, Philippe

    Weather Report Translation using a Translation Memory Thomas Leplus, Philippe Langlais and Guy to French weather report translation system. This system, which has been in operation for more than 20 years approach based on the analysis of hundreds of thousands of weather reports. We show that it is possible

  5. SEMANTIC MEMORY University of Western Ontario

    E-Print Network [OSTI]

    Jones, Michael

    . Reisberg (Ed.). The Oxford Handbook of Cognitive Psychology Ken McRae Department of Psychology Social Science Centre University of Western Ontario London, ON, Canada N6A 5C2 Email: kenm@uwo.ca Phone: (519;Semantic Memory 2 1. INTRODUCTION Concepts and meaning are fundamental components of nearly all aspects

  6. True random numbers from amplified quantum vacuum

    E-Print Network [OSTI]

    M. Jofre; M. Curty; F. Steinlechner; G. Anzolin; J. P. Torres; M. W. Mitchell; V. Pruneri

    2011-10-17

    Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true random numbers while quantum random number generators (QRNGs) exploit intrinsic quantum randomness to produce true random numbers. Single-photon QRNGs are conceptually simple but produce few random bits per detection. In contrast, vacuum fluctuations are a vast resource for QRNGs: they are broad-band and thus can encode many random bits per second. Direct recording of vacuum fluctuations is possible, but requires shot-noise-limited detectors, at the cost of bandwidth. We demonstrate efficient conversion of vacuum fluctuations to true random bits using optical amplification of vacuum and interferometry. Using commercially-available optical components we demonstrate a QRNG at a bit rate of 1.11 Gbps. The proposed scheme has the potential to be extended to 10 Gbps and even up to 100 Gbps by taking advantage of high speed modulation sources and detectors for optical fiber telecommunication devices.

  7. Logarithmic Opinion Pools for Conditional Random Fields 

    E-Print Network [OSTI]

    Smith, Andrew

    2007-06-26

    Since their recent introduction, conditional random fields (CRFs) have been successfully applied to a multitude of structured labelling tasks in many different domains. Examples include natural language processing ...

  8. The random lattice as a regularization scheme

    E-Print Network [OSTI]

    B. Alles

    1994-12-05

    A semi-analytic method to compute the first coefficients of the renormalization group functions on a random lattice is introduced. It is used to show that the two-dimensional $O(N)$ non-linear $\\sigma$-model regularized on a random lattice has the correct continuum limit. A degree $\\kappa$ of ``randomness'' in the lattice is introduced and an estimate of the ratio $\\Lambda_{random}/\\Lambda_{regular}$ for two rather opposite values of $\\kappa$ in the $\\sigma$-model is also given. This ratio turns out to depend on $\\kappa$.

  9. Sealed head access area enclosure

    DOE Patents [OSTI]

    Golden, Martin P. (Trafford, PA); Govi, Aldo R. (Greensburg, PA)

    1978-01-01

    A liquid-metal-cooled fast breeder power reactor is provided with a sealed head access area enclosure disposed above the reactor vessel head consisting of a plurality of prefabricated structural panels including a center panel removably sealed into position with inflatable seals, and outer panels sealed into position with semipermanent sealant joints. The sealant joints are located in the joint between the edge of the panels and the reactor containment structure and include from bottom to top an inverted U-shaped strip, a lower layer of a room temperature vulcanizing material, a separator strip defining a test space therewithin, and an upper layer of a room temperature vulcanizing material. The test space is tapped by a normally plugged passage extending to the top of the enclosure for testing the seal or introducing a buffer gas thereinto.

  10. SLAC All Access: Laser Labs

    ScienceCinema (OSTI)

    Minitti, Mike; Woods Mike

    2014-06-03

    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.

  11. Comparison of the CPU and memory performance of StatPatternRecognition (SPR) and Toolkit for MultiVariate Analysis (TMVA)

    E-Print Network [OSTI]

    Giulio Palombo

    2011-03-28

    High Energy Physics data sets are often characterized by a huge number of events. Therefore, it is extremely important to use statistical packages able to efficiently analyze these unprecedented amounts of data. We compare the performance of the statistical packages StatPatternRecognition (SPR) and Toolkit for MultiVariate Analysis (TMVA). We focus on how CPU time and memory usage of the learning process scale versus data set size. As classifiers, we consider Random Forests, Boosted Decision Trees and Neural Networks. For our tests, we employ a data set widely used in the machine learning community, "Threenorm" data set, as well as data tailored for testing various edge cases. For each data set, we constantly increase its size and check CPU time and memory needed to build the classifiers implemented in SPR and TMVA. We show that SPR is often significantly faster and consumes significantly less memory. For example, the SPR implementation of Random Forest is by an order of magnitude faster and consumes an order of magnitude less memory than TMVA on Threenorm data.

  12. T-606: Sun Java System Access Manager Lets Remote Users Partially Modify Data and Remote Authenticated Users Partially Access Data

    Broader source: Energy.gov [DOE]

    Sun Java System Access Manager Lets Remote Users Partially Modify Data and Remote Authenticated Users Partially Access Data.

  13. The Access Almanac: Graduated Parking Fines

    E-Print Network [OSTI]

    Shoup, Donald

    2010-01-01

    THE ACCESS ALMANAC Graduated Parking Fines BY DONALD SHOUPC ITIES OFTEN INCREASE THEIR PARKING FINESWHEN overtime parking in a calendar year is $35, the second

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

    Broader source: Energy.gov (indexed) [DOE]

    DOE has consistently expressed its policy that international electricity trade should be subject to the same principles of comparable open access and non-discrimination that apply...

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

  16. Adjudicative Guidelines for Determining Eligibility for Access...

    Broader source: Energy.gov (indexed) [DOE]

    consultants, contractors, employees of contractors, licensees, certificate holders or grantees and their employees and other individuals who require access to classified...

  17. Random Models Unit code: MATH20712

    E-Print Network [OSTI]

    Sidorov, Nikita

    MATH20712 Random Models Unit code: MATH20712 Credit Rating: 10 Unit level: Level 2 Teaching period, and renewal processes. Syllabus 1.Review of conditional probability, probability distributions, random. The probability of extinction. [6] 6.Renewal processes. The counting processes and occurrence time processes

  18. RNG: A Practitioner's Overview Random Number Generation

    E-Print Network [OSTI]

    Mascagni, Michael

    -Kac/path integral methods to solve partial differential equations with random walks Defense: neutronics, nuclear random numbers 1. Each calculation is a numerical experiment Subject to known and unknown sources a calculation with the same numbers Across different machines (modulo arithmetic issues) Parallel

  19. Selfattractive random polymers Remco van der Hofstad

    E-Print Network [OSTI]

    Klenke, Achim

    Self­attractive random polymers Remco van der Hofstad Stieltjes Institute of Mathematics Delft polymer of finite length in Zd . Its law is that of a finite simple random walk path in Zd receiving that for > the attraction dominates the repulsion, i.e., with high probability the polymer is contained in a finite box

  20. Contagious Sets in Random Graphs Uriel Feige

    E-Print Network [OSTI]

    Contagious Sets in Random Graphs Uriel Feige Michael Krivelevich Daniel Reichman August 10, 2014. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random graph G := G(n, p

  1. Random Numbers Certified by Bell's Theorem

    E-Print Network [OSTI]

    S. Pironio; A. Acin; S. Massar; A. Boyer de la Giroday; D. N. Matsukevich; P. Maunz; S. Olmschenk; D. Hayes; L. Luo; T. A. Manning; C. Monroe

    2010-10-19

    Randomness is a fundamental feature in nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize mathematically, and their generation must rely on an unpredictable physical process. Inaccuracies in the theoretical modelling of such processes or failures of the devices, possibly due to adversarial attacks, limit the reliability of random number generators in ways that are difficult to control and detect. Here, inspired by earlier work on nonlocality based and device independent quantum information processing, we show that the nonlocal correlations of entangled quantum particles can be used to certify the presence of genuine randomness. It is thereby possible to design of a new type of cryptographically secure random number generator which does not require any assumption on the internal working of the devices. This strong form of randomness generation is impossible classically and possible in quantum systems only if certified by a Bell inequality violation. We carry out a proof-of-concept demonstration of this proposal in a system of two entangled atoms separated by approximately 1 meter. The observed Bell inequality violation, featuring near-perfect detection efficiency, guarantees that 42 new random numbers are generated with 99% confidence. Our results lay the groundwork for future device-independent quantum information experiments and for addressing fundamental issues raised by the intrinsic randomness of quantum theory.

  2. Organization of growing random networks

    SciTech Connect (OSTI)

    Krapivsky, P. L.; Redner, S.

    2001-06-01

    The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A{sub k}. When A{sub k} grows more slowly than linearly with k, the number of nodes with k links, N{sub k}(t), decays faster than a power law in k, while for A{sub k} growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A{sub k} is asymptotically linear, N{sub k}(t){similar_to}tk{sup {minus}{nu}}, with {nu} dependent on details of the attachment probability, but in the range 2{lt}{nu}{lt}{infinity}. The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node{emdash}namely, its {open_quotes}descendants{close_quotes} and {open_quotes}ancestors{close_quotes}{emdash}are also determined. The in component exhibits a robust s{sup {minus}2} power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network.

  3. SDO/IRIS Data Access Hands-on Web Access to SDO Data from JSOC

    E-Print Network [OSTI]

    SDO/IRIS Data Access Hands-on Shuo Wang SWRL/NJIT March 2014 #12;Web Access to SDO Data from JSOC 2010) at: http://jsoc.stanford.edu/doc/exports/tour.pdf See my PowerPoint file titled "Web Access

  4. ACCESSIBLE TEXT ENTRY ACCESSIBLE HANDHELD AND DESKTOP TEXT ENTRY FOR PEOPLE WITH

    E-Print Network [OSTI]

    Wobbrock, Jacob O.

    a new text entry method for PDAs and mobile phones called EdgeWrite, which provides physical stabilityACCESSIBLE TEXT ENTRY ACCESSIBLE HANDHELD AND DESKTOP TEXT ENTRY FOR PEOPLE WITH MOTOR IMPAIRMENTS the EdgeWrite design to common input devices for desktop computer access, thus lowering the cost

  5. UCSB Geography Access Authorization Record Fall 2014 Geography Access Control / Identification Application

    E-Print Network [OSTI]

    California at Santa Barbara, University of

    UCSB Geography Access Authorization Record Fall 2014 Geography Access Control / Identification): Geography Use of this card is for University academic purposes only. The issued access/identification card of Geography as soon as possible. I hereby certify that the above information is true and correct, and I

  6. RESEARCH & INNOVATION OFFICE EASY ACCESS IP

    E-Print Network [OSTI]

    University of Technology, Sydney

    RESEARCH & INNOVATION OFFICE EASY ACCESS IP AN INTRODUCTION FOR INDUSTRY PARTNERS FEBRUARY 2014 #12 to provide industry with greater opportunity and incentive to develop products and services that will lead regardless of how successful the end product is You gain easy access to cutting edge science, technology

  7. Access Paths Multi-dimensional Index Structures

    E-Print Network [OSTI]

    Mannheim, Universität

    for result TID-lists) · high cost for intersection if one of the indexes deliverse many results · But') · index.find_key(`ZH1984') · Discussion: · cost equivalent to the cost of a one-dimensional access! KeyAccess Paths Multi-dimensional Index Structures 1Freitag, 4. Juni 2010 #12;September 27, 2007

  8. The University of Western Ontario's Accessibility Plan

    E-Print Network [OSTI]

    Lennard, William N.

    The University of Western Ontario's Accessibility Plan September 2008 to August 2009 Prepared ........................................................................................................15 Appendix A Members of WODAC #12;3 The University of Western Ontario's Annual Accessibility Plan September 30, 2008 Introduction In December 2001, Ontario passed the Ontarians with Disabilities Act, 2001

  9. The University of Western Ontario's Accessibility Plan

    E-Print Network [OSTI]

    Lennard, William N.

    The University of Western Ontario's Accessibility Plan September 2006 to August 2007 Prepared;3 The University of Western Ontario's Annual Accessibility Plan September 30, 2006 Introduction In December 2001, Ontario passed the Ontarians with Disabilities Act, 2001 (the "Act"). The purpose of the Act is to improve

  10. The University of Western Ontario's Accessibility Plan

    E-Print Network [OSTI]

    Lennard, William N.

    The University of Western Ontario's Accessibility Plan September 2011 to August 2012 Prepared .....................................................................................17 #12;3 Introduction In December 2001, Ontario passed the Ontarians with Disabilities Act, 2001 (the Ontario has reported on its compliance with the customer service standard under the Accessibility

  11. The University of Western Ontario's Accessibility Plan

    E-Print Network [OSTI]

    Lennard, William N.

    The University of Western Ontario's Accessibility Plan September 2007 to August 2008 Prepared ........................................................................................................12 Appendix A Members of WODAC #12;3 The University of Western Ontario's Annual Accessibility Plan September 30, 2007 Introduction In December 2001, Ontario passed the Ontarians with Disabilities Act, 2001

  12. Foreign National Access to DOE Cyber Systems

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    1999-11-01

    DOE N 205.16, dated 9-15-05, extends this Notice until 9-30-06, unless sooner rescinded. To ensure foreign national access to DOE cyber systems continues to advance DOE program objectives while enforcing information access restrictions.

  13. Logic in Access Control (Tutorial Notes)

    E-Print Network [OSTI]

    Ahmed, Amal

    of California, Santa Cruz Abstract. Access control is central to security in computer systems. Over the years to a tutorial given at the 2009 International School on Foundations of Security Analysis and Design. 1 provide a simple, solid, and general foundation for access control, as well as methods for designing

  14. University Library Fact Sheet Sconul Access

    E-Print Network [OSTI]

    Brierley, Andrew

    University Library Fact Sheet Sconul Access Opening Hours Please consult the library website for our current opening hours: http://www.st-andrews.ac.uk/library/ Library Cards To borrow books and access the Library you must bring your card with you to the library on each visit. Please notify

  15. National Radiobiology Archives Distributed Access user's manual

    SciTech Connect (OSTI)

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

    1991-11-01

    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.

  16. Web Accessibility Office of Diversity and Inclusion

    E-Print Network [OSTI]

    Jones, Michelle

    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

  17. Quantum Error Correction for Quantum Memories

    E-Print Network [OSTI]

    Barbara M. Terhal

    2015-04-10

    Active quantum error correction using qubit stabilizer codes has emerged as a promising, but experimentally challenging, engineering program for building a universal quantum computer. In this review we consider the formalism of qubit stabilizer and subsystem stabilizer codes and their possible use in protecting quantum information in a quantum memory. We review the theory of fault-tolerance and quantum error-correction, discuss examples of various codes and code constructions, the general quantum error correction conditions, the noise threshold, the special role played by Clifford gates and the route towards fault-tolerant universal quantum computation. The second part of the review is focused on providing an overview of quantum error correction using two-dimensional (topological) codes, in particular the surface code architecture. We discuss the complexity of decoding and the notion of passive or self-correcting quantum memories. The review does not focus on a particular technology but discusses topics that will be relevant for various quantum technologies.

  18. Memory in Nonlinear Ionization of Transparent Solids

    SciTech Connect (OSTI)

    Rajeev, P. P.; Simova, E.; Hnatovsky, C.; Taylor, R. S.; Rayner, D. M.; Corkum, P. B.; Gertsvolf, M.; Bhardwaj, V. R.

    2006-12-22

    We demonstrate a shot-to-shot reduction in the threshold laser intensity for ionization of bulk glasses illuminated by intense femtosecond pulses. For SiO{sub 2} the threshold change serves as positive feedback reenforcing the process that produced it. This constitutes a memory in nonlinear ionization of the material. The threshold change saturates with the number of pulses incident at a given spot. Irrespective of the pulse energy, the magnitude of the saturated threshold change is constant ({approx}20%). However, the number of shots required to reach saturation does depend on the pulse energy. Recognition of a memory in ionization is vital to understand multishot optical or electrical breakdown phenomena in dielectrics.

  19. Multi-core and Many-core Shared-memory Parallel Raycasting Volume Rendering Optimization and Tuning

    SciTech Connect (OSTI)

    Howison, Mark

    2012-01-31

    Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. And, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

  20. Association between MAPT haplotype and memory function in patients with Parkinson’s disease and healthy aging individuals

    E-Print Network [OSTI]

    Winder-Rhodes, Sophie E.; Hampshire, Adam; Rowe, James B.; Peelle, Jonathan E.; Robbins, Trevor W.; Owen, Adrian M.; Barker, Roger A.

    2014-12-11

    , University of Cambridge, Cambridge, UK b y, InstituAssociation between MAPT haplotype an patients with Parkinson’s disease and h Sophie E. Winder-Rhodes a,b,*, Adam Hampshire c,d Jonathan E. Peelle f, Trevor W. Robbins e, Adrian M.Inc. This is an open access... subcomponents of memory encoding, focusing our analysis on medial temporal lobe regions, particularly the hippocampus, which are known to be crucial for the registration of new information (Fernández et al., 1998; Milner et al., 1998). Our aims were to Table 1...

  1. Scaling of Seismic Memory with Earthquake Size

    E-Print Network [OSTI]

    Zheng, Zeyu; Tenenbaum, Joel; Podobnik, Boris; Stanley, H Eugene

    2011-01-01

    It has been observed that the earthquake events possess short-term memory, i.e. that events occurring in a particular location are dependent on the short history of that location. We conduct an analysis to see whether real-time earthquake data also possess long-term memory and, if so, whether such autocorrelations depend on the size of earthquakes within close spatiotemporal proximity. We analyze the seismic waveform database recorded by 64 stations in Japan, including the 2011 "Great East Japan Earthquake", one of the five most powerful earthquakes ever recorded which resulted in a tsunami and devastating nuclear accidents. We explore the question of seismic memory through use of mean conditional intervals and detrended fluctuation analysis (DFA). We find that the waveform sign series show long-range power-law anticorrelations while the interval series show long-range power-law correlations. We find size-dependence in earthquake auto-correlations---as earthquake size increases, both of these correlation beha...

  2. High-speed quantum memory with thermal motion of atoms

    E-Print Network [OSTI]

    K. Tikhonov; T. Golubeva; Yu. Golubev

    2015-02-26

    We discuss the influence of atomic thermal motion on the efficiency of multimode quantum memory in two configurations: over the free expand of atoms cooled beforehand in a magneto-optical trap, and over complete mixing of atoms in a closed cell at room temperature. We consider the high-speed quantum memory, and assume that writing and retrieval are short enough, and the displacements of atoms during these stages are negligibly small. At the same time we take in account thermal motion during the storage time, which, as well known, must be much longer than durations of all the other memory processes for successful application of memory cell in communication and computation. We will analyze this influence in terms of eigenmodes of the full memory cycle and show that distortion of the eigenmodes, caused by thermal motion, leads to the efficiency reduction. We will demonstrate, that in the multimode memory this interconnection has complicated character.

  3. A prototype functional language implementation for hierarchical-memory architectures

    SciTech Connect (OSTI)

    Wolski, R.; Feo, J.; Cann, D.

    1991-06-05

    The first implementation of Sisal was designed for general shared-memory architectures. Since then, we have optimized the system for vector and coherent-cache multiprocessors. Coherent-cache systems can be thought of as simple, two-level hierarchical memory systems, where the memory hierarchy is managed by the hardware. The compiler and run-time system for such an architecture needs to maintain data locality so that the processor caches are used as much as possible. In this paper, we extend the coherent-cache implementation to include explicit compiler and run-time control for medium-grain and coarse-grain hierarchical-memory architectures. We implemented the extended system on the BBN Butterfly using interleaved shared memory exclusively for the purposes of data sharing and exploiting the per-processor local memories. We give preliminary performance results for this extended system. 10 refs., 7 figs.

  4. Near-field NanoThermoMechanical memory

    SciTech Connect (OSTI)

    Elzouka, Mahmoud; Ndao, Sidy

    2014-12-15

    In this letter, we introduce the concept of NanoThermoMechanical Memory. Unlike electronic memory, a NanoThermoMechanical memory device uses heat instead of electricity to record, store, and recover data. Memory function is achieved through the coupling of near-field thermal radiation and thermal expansion resulting in negative differential thermal resistance and thermal latching. Here, we demonstrate theoretically via numerical modeling the concept of near-field thermal radiation enabled negative differential thermal resistance that achieves bistable states. Design and implementation of a practical silicon based NanoThermoMechanical memory device are proposed along with a study of its dynamic response under write/read cycles. With more than 50% of the world's energy losses being in the form of heat along with the ever increasing need to develop computer technologies which can operate in harsh environments (e.g., very high temperatures), NanoThermoMechanical memory and logic devices may hold the answer.

  5. BUILDING CONNECTION SOUTH BLOCK: ACCESS VIA MAIN ENTRANCE

    E-Print Network [OSTI]

    Shoubridge, Eric

    ENTRANCE ELEVATOR WASHROOMS BUILDING CONNECTION SOUTH BLOCK: ACCESS VIA MAIN ENTRANCE NORTH BLOCK: ACCESS VIA MAIN ENTRANCE WEST BLOCK: ALL LEVELS ARE ACCESSIBLE BY PUBLIC ELEVATOR SOUTH BLOCK MAIN ENTRANCE NORTH BLOCK: ACCESS VIA MAIN ENTRANCE WEST BLOCK: ALL LEVELS ARE ACCESSIBLE BY PUBLIC

  6. Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices

    E-Print Network [OSTI]

    Carl A. Miller; Yaoyun Shi

    2015-04-10

    Randomness is a vital resource for modern day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high quality random numbers generated securely. Here we show how to expand a random seed at an exponential rate without trusting the underlying quantum devices. Our approach is secure against the most general adversaries, and has the following new features: cryptographic quality output security, tolerating a constant level of implementation imprecision, requiring only a constant size quantum memory for the honest implementation, and allowing a large natural class of constructions. In conjunct with a recent work by Chung, Shi and Wu (QIP 2014), it also leads to robust unbounded expansion using just 2 multi-part devices. When adapted for distributing cryptographic keys, our method achieves, for the first time, exponential expansion combined with cryptographic security and noise tolerance. The proof proceeds by showing that the Renyi divergence of the outputs of the protocol (for a specific bounding operator) decreases linearly as the protocol iterates. At the heart of the proof are a new uncertainty principle on quantum measurements, and a method for simulating trusted measurements with untrusted devices.

  7. Lifetime of topological quantum memories in thermal environment

    E-Print Network [OSTI]

    Abbas Al-Shimary; James R. Wootton; Jiannis K. Pachos

    2012-09-13

    Here we investigate the effect lattice geometry has on the lifetime of two-dimensional topological quantum memories. Initially, we introduce various lattice patterns and show how the error-tolerance against bit-flips and phase-flips depends on the structure of the underlying lattice. Subsequently, we investigate the dependence of the lifetime of the quantum memory on the structure of the underlying lattice when it is subject to a finite temperature. Importantly, we provide a simple effective formula for the lifetime of the memory in terms of the average degree of the lattice. Finally, we propose optimal geometries for the Josephson junction implementation of topological quantum memories.

  8. Controlling the Actuation Rate of Low Density Shape Memory Polymer...

    Office of Scientific and Technical Information (OSTI)

    Controlling the Actuation Rate of Low Density Shape Memory Polymer Foams in Water Citation Details In-Document Search Title: Controlling the Actuation Rate of Low Density Shape...

  9. Miniscule Mirrored Cavities Connect Quantum Memories | U.S. DOE...

    Office of Science (SC) Website

    Miniscule Mirrored Cavities Connect Quantum Memories Basic Energy Sciences (BES) BES Home About Research Facilities Science Highlights Benefits of BES Funding Opportunities Basic...

  10. Total Recall: Detailing Nitinol's Shape-Memory Behavior | The...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    developed. Despite its industrial popularity, the underlying physics and atomistic mechanics of Nitinol have remained unclear for over 50 years. Shape-memory alloys can remember...

  11. Departure and return : abandonment, memorial and aging in Japan

    E-Print Network [OSTI]

    Danely, Jason Allen

    2008-01-01

    The four major memorial holidays (Obon, Spring Equinox ???, Autumn Equinox ??? and New Years ???) are important daysand Spring and Autumn equinox (Ohigan). Obon ?? Obon is an

  12. Memory Effects and Transport Coefficients for Non-Newtonian Fluids

    E-Print Network [OSTI]

    T. Kodama; T. Koide

    2008-12-22

    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.

  13. Consent Order, Battelle Memorial Institute - WCO-2014-01 | Department...

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

    issued to Battelle Memorial Institute for deficiencies associated with the Chronic Beryllium Disease Prevention Program at DOE's Pacific Northwest National Laboratory. On...

  14. Development of Superelastic Effects in Ferrous Shape Memory Alloy

    E-Print Network [OSTI]

    Olson, Scott Michael

    SME: Shape memory effect Nitinol: Nickel-titanium shapelearned in optimizing Nitinol. To develop the properties ofbe recovered. Currently, Nitinol, an alloy made of nickel

  15. Neuromorphic, Digital and Quantum Computation with Memory Circuit Elements

    E-Print Network [OSTI]

    Yuriy V. Pershin; Massimiliano Di Ventra

    2011-09-28

    Memory effects are ubiquitous in nature and the class of memory circuit elements - which includes memristors, memcapacitors and meminductors - shows great potential to understand and simulate the associated fundamental physical processes. Here, we show that such elements can also be used in electronic schemes mimicking biologically-inspired computer architectures, performing digital logic and arithmetic operations, and can expand the capabilities of certain quantum computation schemes. In particular, we will discuss few examples where the concept of memory elements is relevant to the realization of associative memory in neuronal circuits, spike-timing-dependent plasticity of synapses, digital and field-programmable quantum computing.

  16. How Can Random Noise Help Us

    E-Print Network [OSTI]

    2009-03-18

    Basics of Random Walk – 2. 0. 5. 10. 15. 20. 25. 30. 35. 40. 45. 50. ?5. ?4. ?3. ?2. ?1. 0 ..... Back to Parrondo's Paradox. Playing Game A. . winning prob = 0.495.

  17. Supply Chain Supernetworks With Random Demands

    E-Print Network [OSTI]

    Nagurney, Anna

    Supply Chain Supernetworks With Random Demands June Dong Ding Zhang School of Business State Field Warehouses: stocking points Customers, demand centers sinks Production/ purchase costs Inventory Customer Demand Customer Demand Retailer OrdersRetailer Orders Distributor OrdersDistributor Orders

  18. High speed optical quantum random number generation

    E-Print Network [OSTI]

    Weinfurter, Harald

    High speed optical quantum random number generation Martin F¨urst1,2,, Henning Weier1,2, Sebastian/publicationFile/30276/ais20 pdf.pdf (1999). 2. "Fips 140-2, security requirements for cryptographic modules

  19. Electromagnetic wave propagation in random waveguides

    E-Print Network [OSTI]

    Ricardo Alonso; Liliana Borcea

    2013-10-18

    We study long range propagation of electromagnetic waves in random waveguides with rectangular cross-section and perfectly conducting boundaries. The waveguide is filled with an isotropic linear dielectric material, with randomly fluctuating electric permittivity. The fluctuations are weak, but they cause significant cumulative scattering over long distances of propagation of the waves. We decompose the wave field in propagating and evanescent transverse electric and magnetic modes with random amplitudes that encode the cumulative scattering effects. They satisfy a coupled system of stochastic differential equations driven by the random fluctuations of the electric permittivity. We analyze the solution of this system with the diffusion approximation theorem, under the assumption that the fluctuations decorrelate rapidly in the range direction. The result is a detailed characterization of the transport of energy in the waveguide, the loss of coherence of the modes and the depolarization of the waves due to cumulative scattering.

  20. Chaotic generation of pseudo-random numbers 

    E-Print Network [OSTI]

    Dornbusch, Andrew Wesley

    1999-01-01

    Generation of repeatable pseudo-random sequences with chaotic analog electronics is not feasible using standard circuit topologies. Component variation caused by imperfect fabrication causes the same divergence of output ...

  1. Fast generation of sparse random kernel graphs

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo

    2015-09-10

    The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore »at most ?(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less

  2. Beta dose distribution for randomly packed microspheres 

    E-Print Network [OSTI]

    Urashkin, Alexander

    2007-04-25

    of radiation dose distribution when utilizing this technique. This study focuses on random packing of microspheres and seeks to determine dose distributions for specific cases. The Monte Carlo Neutral Particle code (MCNP) developed by Los Alamos National...

  3. Random Walks for Mesh Denoising Xianfang Sun

    E-Print Network [OSTI]

    Martin, Ralph R.

    Random Walks for Mesh Denoising Xianfang Sun Cardiff University, UK Beihang University, China Paul noise-free po- sitions. Generally, the vertex positions are the primary measured e-mail: Xianfang.Sun

  4. QCD, Symmetry Breaking and the Random Lattice

    E-Print Network [OSTI]

    Saul D. Cohen

    2006-02-15

    According to the Nielsen-Ninomiya No-Go theorem, the doubling of fermions on the lattice cannot be suppressed in a chiral theory. Whereas Wilson and staggered fermions suppress doublers with explicit breaking of chiral symmetry, the random lattice does so by spontaneous chiral symmetry breaking even in the free theory. I present results for meson masses, the chiral condensate and fermionic eigenvalues from simulations of quenched QCD on random lattices in four dimensions, focusing on chiral symmetry breaking.

  5. Random matrix ensembles associated with Lax matrices

    E-Print Network [OSTI]

    E. Bogomolny; O. Giraud; C. Schmit

    2009-04-30

    A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an integrable structure permits to calculate the joint distribution of eigenvalues for these matrices analytically. Spectral statistics of these ensembles are quite unusual and in many cases give rigorously new examples of intermediate statistics.

  6. Memory Hierarchy Hardware-Software Co-design in Embedded Systems

    E-Print Network [OSTI]

    Ge, Zhiguo

    The memory hierarchy is the main bottleneck in modern computer systems as the gap between the speed of the processor and the memory continues to grow larger. The situation in embedded systems is even worse. The memory ...

  7. The maturational course of sequential memory and its relation to the development of frontal lobe functioning 

    E-Print Network [OSTI]

    Romine, Cassandra Burns

    2005-11-01

    processes by enhancing the organization of to-be-remembered information. Among the specific memory systems presumed to be based on anterior cerebral structures is the temporal organization of memory. An essential component of memory that involves temporal...

  8. Episodic future thinking and episodic counterfactual thinking: Intersections between memory and decisions

    E-Print Network [OSTI]

    Szpunar, Karl K.

    Episodic future thinking and episodic counterfactual thinking: Intersections between memory: Available online xxxx Keywords: Episodic memory Episodic future thinking Episodic counterfactual thinking into the relationship between memory and decision making. One line of research concerns episodic future thinking, which

  9. The Aesthetics of Remembering 9/11: Towards a Transnational Typology of Memorials

    E-Print Network [OSTI]

    Gessner, Ingrid

    2015-01-01

    s 9/11 Memorial Dedication. ” Jewish Press, November 25,ground” at the memorial’s dedication ceremony. 13 WhileNews equally stress the dedication to his job and his family

  10. Global Trees: A Framework for Linked Data Structures on Distributed Memory Parallel Systems

    SciTech Connect (OSTI)

    Larkins, D. B.; Dinan, James S.; Krishnamoorthy, Sriram; Parthasarathy, Srinivasan; Rountev, Atanas; Sadayappan, Ponnuswamy

    2008-11-17

    This paper describes the Global Trees (GT) system that provides a multi-layered interface to a global address space view of distributed tree data structures, while providing scalable performance on distributed memory systems. The Global Trees system utilizes coarse-grained data movement to enhance locality and communication efficiency. We describe the design and implementation of GT, illustrate its use in the context of a gravitational simulation application, and provide experimental results that demonstrate the effectiveness of the approach. The key benefits of using this system include efficient sharedmemory style programming of distributed trees, tree-specific optimizations for data access and computation, and the ability to customize many aspects of GT to optimize application performance.

  11. ETSU College of Medicine Onity Door Access Authorization Form

    E-Print Network [OSTI]

    Karsai, Istvan

    ETSU College of Medicine Onity Door Access Authorization Form Please grant access to: 6 access. ____ ALL AREAS (ETSU Service Personnel Only) Medical School Research & Training, VA Bldg. #119-Mail: johnsodl@etsu.edu #12;

  12. Policy 3507 Information Technology Accessibility 1 OLD DOMINION UNIVERSITY

    E-Print Network [OSTI]

    Policy 3507 ­ Information Technology Accessibility 1 OLD DOMINION UNIVERSITY University Policy Policy #3507 INFORMATION TECHNOLOGY ACCESSIBILITY POLICY Responsible Oversight Executive: Vice President, regardless of physical disability, will have the opportunity for appropriate access to information technology

  13. Nemesis: Preventing Authentication & Access Control Vulnerabilities in Web Applications

    E-Print Network [OSTI]

    Sabatini, David M.

    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

  14. Extreme slowdowns for one-dimensional excited random walks

    E-Print Network [OSTI]

    2013-12-20

    Dec 20, 2013 ... Rate of growth of a transient cookie random walk. Electron. J. Probab. ... Excited random walk. Electron. Comm. Probab., 8:86–92 (elec- tronic) ...

  15. Stabilizing Topological Phases in Graphene via Random Adsorption...

    Office of Scientific and Technical Information (OSTI)

    Stabilizing Topological Phases in Graphene via Random Adsorption Prev Next Title: Stabilizing Topological Phases in Graphene via Random Adsorption Authors: Jiang, Hua ; Qiao,...

  16. Application of Random Vibration Theory Methodology for Seismic...

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

    Random Vibration Theory Methodology for Seismic Soil-Structure Interaction Analysis Application of Random Vibration Theory Methodology for Seismic Soil-Structure Interaction...

  17. The Pursuit of Balance in Sequential Randomized Trials

    E-Print Network [OSTI]

    Guiteras, Raymond P.; Levine, David I.; Polley, Thomas H.

    2015-01-01

    2003). “The pursuit of balance using stratified and dynamicThe Pursuit of Balance in Sequential Randomized Trials ?Mikel (2001). “Randomization, balance, and the validity and

  18. The Access Almanac: Solar Parking Requirements

    E-Print Network [OSTI]

    Shoup, Donald

    2012-01-01

    getting solar power from our parking lots. ? A C C E S STHE ACCESS ALMANAC Solar Parking Requirements DONALD SHOUP SC E I N T H E S U N — on parking lots surrounding commercial

  19. The Access Almanac: The Parking of Nations

    E-Print Network [OSTI]

    Shoup, Donald; Stark, Seth

    2000-01-01

    THE ACCESS ALMANAC The Parking of Nations B Y D O N A L D Spaved paradise and put up a parking lot. — Joni Mitchell V E4.4 billion vehicles. Parking would be a global problem. How

  20. Metadata Value Chain for Open Access Journals 

    E-Print Network [OSTI]

    Mercer, Holly; Dyas-Correia, Sharon

    2011-01-01

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

  1. CIVIL ENGINEERING LAB ACCESS REQUEST FORM Instructions

    E-Print Network [OSTI]

    Maxwell, Bruce D.

    CIVIL ENGINEERING LAB ACCESS REQUEST FORM Instructions: 1) Fill out request 2) A request may Estimated Key Return Date/When does job terminate? Section C: Approval Signatures (for Civil Engineering use

  2. Fair resource allocation in multiple access channels

    E-Print Network [OSTI]

    ParandehGheibi, Ali

    2008-01-01

    We consider the problem of resource allocation in a multiple access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates over ...

  3. The University of Western Ontario's Accessibility Plan

    E-Print Network [OSTI]

    Lennard, William N.

    The University of Western Ontario's Accessibility Plan September 2010 to August .....................................................................................15 #12;3 Introduction In December 2001, Ontario of this report, remain in force. As of March 2010, the University of Western Ontario has reported on its

  4. JOBAID-ACCESSING AND MODIFYING TALENT PROFILE

    Broader source: Energy.gov [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...

  5. Accessible Programming using Program Synthesis Rishabh Singh

    E-Print Network [OSTI]

    Accessible Programming using Program Synthesis by Rishabh Singh Bachelor of Technology (Honors Singh, MMXIV. All rights reserved. The author hereby grants to MIT permission to reproduce singh Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment

  6. Decision Analysis of Dynamic Spectrum Access Rules

    SciTech Connect (OSTI)

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

    2011-12-01

    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.

  7. Audio information access from meeting rooms. 

    E-Print Network [OSTI]

    Renals, Steve; Ellis, Dan

    2003-01-01

    We investigate approaches to accessing information from the streams of audio data that result from multi-channel recordings of meetings. The methods investigated use word-level transcriptions, and information derived ...

  8. Performance gains in memory have traditionally been obtained by increasing memory bus widths and speeds. The

    E-Print Network [OSTI]

    Jacob, Bruce

    channels have supported up to 8 DIMMs of memory, some types of DDR channels support only 4 DIMMs, DDR2 channels have but 2 DIMMs, and DDR3 channels are expected to support only a single DIMM. In addition modules is identical to that seen in DDR2 or DDR3 systems, which we shall refer to as DDRx systems

  9. Oil Price Trackers Inspired by Immune Memory

    E-Print Network [OSTI]

    Wilson, WIlliam; Aickelin, Uwe

    2010-01-01

    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.

  10. Localized quantum walks as secured quantum memory

    E-Print Network [OSTI]

    C. M. Chandrashekar; Th. Busch

    2015-04-21

    We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a compact position space and faithfully recover it on demand. Since the localization occurss with a finite spread in position space, the stored information of the qubit will be naturally secured from the simple eavesdropper. Our protocol can be adopted to any quantum system for which experimental control over quantum walk dynamics can be achieved.

  11. Shape memory alloy seals for geothermal applications

    SciTech Connect (OSTI)

    Friske, Warren H.; Schwartzbart, Harry

    1982-10-08

    Rockwell International's Energy Systems Group, under contract to Brookhaven National Laboratory, has completed a 2-year program to develop a novel temperature-actuated seal concept for geothermal applications. This seal concept uses the unique properties of a shape memory alloy (Nitinol) to perform the sealing function. The several advantages of the concept are discussed in the paper. Demonstration tests of both face and shaft seals have shown that leaktight seals are feasible. Supporting materials studies have included corrosion tests in geothermal fluids, elevated temperature tensile tests, experimental electroplating and metallographic evaluations of microstructures.

  12. Memorial Day Message | National Nuclear Security Administration

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration wouldMass map shines light on dark matter By SarahMODELINGMeetingsMembranesMemorial Day Message

  13. Levels of interaction between episodic and semantic memory: an electrophysiological and computational investigation. 

    E-Print Network [OSTI]

    Greve, Andrea

    2007-01-01

    There is compelling evidence that memory is supported by multiple, functionally independent subsystems that distinguish declarative from non-declarative memories (Tulving, 1972). The declarative subsystems, episodic and ...

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

    E-Print Network [OSTI]

    Wolf, Denise M.

    2010-01-01

    Memory in Microbes: Quantifying History-Dependent Behaviorboth the persistence of memory in microbes and the amount ofan evolutionary advantage in microbes as well. For instance,

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

    E-Print Network [OSTI]

    Wolf, Denise M.

    2009-01-01

    Memory in Microbes: Quantifying History-Dependent Behaviorboth the persistence of memory in microbes and the amount ofan evolutionary advantage in microbes as well. For instance,

  16. A signal-detection-based investigation into the nature of recognition memory

    E-Print Network [OSTI]

    Mickes, Laura Beth

    2010-01-01

    memory. Memory & Cognition, Speer, N. K. , & Curran, T. (Eichenbaum, 2008; Speer & Curran, 2007; Turriziani, Fadda,unitized familiarity (cf. Speer & Curran, 2007). While this

  17. Application for Permit to Construct Access Driveway Facilities...

    Open Energy Info (EERE)

    relocate an access connection to state ROWs. Published NA Year Signed or Took Effect 2000 Legal Citation Application for Permit to Construct Access Driveway Facilities on...

  18. Green Button: Providing Consumers with Access to Their Energy...

    Broader source: Energy.gov (indexed) [DOE]

    customers in California now have access to their electricity usage data through the Green Button program, and millions more will get access as the program expands. This...

  19. Thanks to Energy Department Funding, Safer Access to Offshore...

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

    Thanks to Energy Department Funding, Safer Access to Offshore Wind Turbine Platforms is Demonstrated Thanks to Energy Department Funding, Safer Access to Offshore Wind Turbine...

  20. Acronyms A AAAP Accelerated Access Authorization Program ACREM...

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

    12 I IAA Interim Access Authorization ICAM Identity, Credential, and Access Management IEA Office of Independent Enterprise Assessments IG Inspector General IN Office of...

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

  2. Energy Department Announces Funding to Access Higher Quality...

    Office of Environmental Management (EM)

    Energy Department Announces Funding to Access Higher Quality Wind Resources and Lower Costs Energy Department Announces Funding to Access Higher Quality Wind Resources and Lower...

  3. KuppingerCole Leadership Compass Cloud User and Access Management

    E-Print Network [OSTI]

    Chaudhuri, Surajit

    and Access Management Leaders in innovation, product features, and market reach for Cloud User and Access .............................................................................................................................................9 3. Product Rating........................................................................................................................................17 9. Product Leaders

  4. Department of Energy Data Access and Privacy Issues Related To...

    Energy Savers [EERE]

    Department of Energy Data Access and Privacy Issues Related To Smart Grid Technologies Department of Energy Data Access and Privacy Issues Related To Smart Grid Technologies This...

  5. NBP RFI: Data Access, Third Party Use, and Privacy- Comments...

    Energy Savers [EERE]

    & Publications Comments of Oncor Electric Delivery Company LLC Department of Energy Data Access and Privacy Issues Related To Smart Grid Technologies NBP RFI: Data Access,...

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

    Energy Savers [EERE]

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

  7. Request Access to the PARSIIe Project Management Lessons Learned...

    Energy Savers [EERE]

    Request Access to the PARSIIe Project Management Lessons Learned (PMLL) Repository Request Access to the PARSIIe Project Management Lessons Learned (PMLL) Repository PURPOSE...

  8. Increasing Community Access to Solar: Designing and Developing...

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

    Increasing Community Access to Solar: Designing and Developing a Shared Solar Photovoltaic System (Fact Sheet), U.S. Department of Energy (DOE) Increasing Community Access to...

  9. Green Button Energy Data Access Expanding Across America | Department...

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

    Green Button Energy Data Access Expanding Across America Green Button Energy Data Access Expanding Across America October 17, 2012 - 6:01pm Addthis Utilities demonstrating the...

  10. Comparison of collisions on HOV facilities with limited and continuous access

    E-Print Network [OSTI]

    Jang, Kitae; Chung, Koohong; Ragland, David R.; Chan, Ching-Yao

    2008-01-01

    in continuous access while slightly higher proportion ofcontinuous access HOV lanes, limited access HOV lanes have a higher proportion

  11. Exploring the randomness of Directed Acyclic Networks

    E-Print Network [OSTI]

    Joaquín Goñi; Bernat Corominas-Murtra; Ricard V. Solé; Carlos Rodríguez-Caso

    2010-06-11

    The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems -such as some food-webs and electronic and neural wiring- can be described in terms of so-called directed acyclic graphs (DAGs). An important ingredient of the analysis of such networks is a proper comparison of their observed architecture against an ensemble of randomized graphs, thereby quantifying the {\\em randomness} of the real systems with respect to suitable null models. This approximation is particularly relevant when the finite size and/or large connectivity of real systems make inadequate a comparison with the predictions obtained from the so-called {\\em configuration model}. In this paper we analyze four methods of DAG randomization as defined by the desired combination of topological invariants (directed and undirected degree sequence and component distributions) aimed to be preserved. A highly ordered DAG, called \\textit{snake}-graph and a Erd\\:os-R\\'enyi DAG were used to validate the performance of the algorithms. Finally, three real case studies, namely, the \\textit{C. elegans} cell lineage network, a PhD student-advisor network and the Milgram's citation network were analyzed using each randomization method. Results show how the interpretation of degree-degree relations in DAGs respect to their randomized ensembles depend on the topological invariants imposed. In general, real DAGs provide disordered values, lower than the expected by chance when the directedness of the links is not preserved in the randomization process. Conversely, if the direction of the links is conserved throughout the randomization process, disorder indicators are close to the obtained from the null-model ensemble, although some deviations are observed.

  12. Enabling Remedyforce Accessibility v1.0 Page 1 Enabling Remedyforce Accessibility

    E-Print Network [OSTI]

    Guillas, Serge

    SERVICES DIVISION #12;Enabling Remedyforce Accessibility v1.0 Page 2 DOCUMENT HISTORY Version Amendments...................................................................................................................................11 Internet Explorer...............................................................................................................................11 Internet Explorer

  13. ORIGINAL PAPER Prevention of cerebral ischemia-induced memory deficits

    E-Print Network [OSTI]

    memory impairment produced pharmacologically or genetically. Comparably, much less is known about4 activity in the hippocam- pus. Memory was examined using Morris water-maze and step-through passive avoidance tests in rats subjected to global cerebral ischemia with or without repeated treatment

  14. Research Report Semantic and perceptual effects on recognition memory

    E-Print Network [OSTI]

    Curran, Tim

    al., 1999; Hunt and Elliot, 1980; Nairne, 2002; Reder et al., 2002). Although the perceptual match between study and test may not always lead to better memory (Hunt and Elliot, 1980; Nairne, 2002 that perceptual match affects recognition memory when items are distinctive (Hunt and Elliot, 1980; Reder et al

  15. External Memory Controller for Virtex II Pro Blagomir Donchev

    E-Print Network [OSTI]

    An implementation of an On Chip Memory (OCM) based Dual Data Rate external memory controller (OCM2DDR) for Virtex II Pro is described. The proposed OCM2DDR controller comprises Data Side OCM (DSOCM) bus interface module, read and write control logic, halt read module and Xilinx DDR controller IP core. The presented design

  16. Boosting FMAX of Processor Pipelines using Intentional Memory Clock Skew

    E-Print Network [OSTI]

    Lemieux, Guy

    Boosting FMAX of Processor Pipelines using Intentional Memory Clock Skew Alexander Brant 1 , Ameer--FPGAs are increasingly being used to implement many new applications, including pipelined processor designs. Designers often employ memories to communicate and pass data between these pipeline stages. However, one

  17. Familiarity in source memory Matthew V. Mollison n

    E-Print Network [OSTI]

    Curran, Tim

    Familiarity in source memory Matthew V. Mollison n , Tim Curran University of Colorado, Boulder-process recognition memory system (for reviews, see Curran, Tepe, & Piatt, 2006, Chap. 18; Eichenbaum, Yonelinas, & Ranganath, 2007; Parks & Yonelinas, 2007; Rugg & Curran, 2007; Skinner & Fernandes, 2007; Vilberg & Rugg

  18. A Scratchpad Memory Allocation Scheme for Dataflow Shamik Bandyopadhyay

    E-Print Network [OSTI]

    @eecs.berkeley.edu Edward A. Lee EECS, UC Berkeley eal@eecs.berkeley.edu August 25, 2008 Abstract Scratchpad memories energy consumption. However, program code and data must be explicitly moved in the memory hierarchy for scratchpads are low power and energy consumption, and a higher degree of predictability in program execution

  19. An Integrated Approach to Reducing Power Dissipation in Memory Hierarchies

    E-Print Network [OSTI]

    , and then propose on-chip memory module buffers, called Energy-Saver Buffers (ESB), which reside in- between the L2-delay product, Energy-Saver Buffers (ESB), integrated approach, power, RDRAM 1. INTRODUCTION One of the major costs associated with reactivating memory modules from a low- power state by introducing Energy-Saver

  20. CADS: Core-Aware Dynamic Scheduler for Multicore Memory Controllers

    E-Print Network [OSTI]

    Sun, Xian-He

    Xian-He Sun Department of Computer Science Illinois Institute of Technology, Chicago, IL 60616, USA {eolmedo, sbyna, sun}@iit.edu Abstract Memory controller scheduling is crucial in multicore processors the computing power these processors offer. However, current multicore processors are using traditional memory