Search results for "Memory."
showing 10 items of 1949 documents
Terahertz electrical writing speed in an antiferromagnetic memory
2018
The speed of writing of state-of-the-art ferromagnetic memories is physically limited by an intrinsic gigahertz threshold. Recently, realization of memory devices based on antiferromagnets, in which spin directions periodically alternate from one atomic lattice site to the next has moved research in an alternative direction. We experimentally demonstrate at room temperature that the speed of reversible electrical writing in a memory device can be scaled up to terahertz using an antiferromagnet. A current-induced spin-torque mechanism is responsible for the switching in our memory devices throughout the 12-order-of-magnitude range of writing speeds from hertz to terahertz. Our work opens the…
Primo Levi, a critic humanist
2015
La intención de este escrito es reflexionar sobre el pensamiento del italiano Primo Levi y defender como apropiado el referirnos a él como un ‘humanista crítico’. Para ello seguimos los criterios propuestos por T. Todorov para caracterizar la doctrina humanista en tres elementos: autonomía del yo, finalidad del tú y universalidad de los ellos, y los propios del humanismo crítico, único posible tras lo ocurrido en Auschwitz y Kolyma: el reconocimiento del horror del que somos capaces los seres humanos y la afirmación de la posibilidad del bien. Palabras-clave: Humanismo crítico, Campos de concentración, Sobreviviente,Testimonio, Memoria. The aim of this research is to reflect upon the though…
Primo Levi, a critic humanist
2015
La intención de este escrito es reflexionar sobre el pensamiento del italiano Primo Levi y defender como apropiado el referirnos a él como un ‘humanista crítico’. Para ello seguimos los criterios propuestos por T. Todorov para caracterizar la doctrina humanista en tres elementos: autonomía del yo, finalidad del tú y universalidad de los ellos, y los propios del humanismo crítico, único posible tras lo ocurrido en Auschwitz y Kolyma: el reconocimiento del horror del que somos capaces los seres humanos y la afirmación de la posibilidad del bien. Palabras-clave: Humanismo crítico, Campos de concentración, Sobreviviente,Testimonio, Memoria. The aim of this research is to reflect upon the though…
Full Tunability of Strain along the fcc-bcc Bain Path in Epitaxial Films and Consequences for Magnetic Properties
2009
Strained coherent film growth is commonly either limited to ultrathin films or low strains. Here, we present an approach to achieve high strains in thicker films, by using materials with inherent structural instabilities. As an example, 50 nm thick epitaxial films of the ${\mathrm{Fe}}_{70}{\mathrm{Pd}}_{30}$ magnetic shape memory alloy are examined. Strained coherent growth on various substrates allows us to adjust the tetragonal distortion from $c/{a}_{\mathrm{bct}}=1.09$ to 1.39, covering most of the Bain transformation path from fcc to bcc crystal structure. Magnetometry and x-ray circular dichroism measurements show that the Curie temperature, orbital magnetic moment, and magnetocrysta…
Guilty Knowledge- testi valheenpaljastustestinä : Tarina- proseduuria käyttäen saadut tulokset kahdella eri pisteytysmenetelmällä
1997
OpenCMISS: A multi-physics & multi-scale computational infrastructure for the VPH/Physiome project
2011
The VPH/Physiome Project is developing the model encoding standards CellML (cellml.org) and FieldML (fieldml.org) as well as web-accessible model repositories based on these standards (models.physiome.org). Freely available open source computational modelling software is also being developed to solve the partial differential equations described by the models and to visualise results. The OpenCMISS code (opencmiss.org), described here, has been developed by the authors over the last six years to replace the CMISS code that has supported a number of organ system Physiome projects. OpenCMISS is designed to encompass multiple sets of physical equations and to link subcellular and tissue-level b…
Probabilistic versus deterministic memory limited learning
1995
Dictionary-symbolwise flexible parsing
2012
AbstractLinear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compression theory. A recent result is the Flexible Parsing algorithm of Matias and Sahinalp (1999) that works when the dictionary is prefix closed and the encoding of dictionary pointers has a constant cost. We present the Dictionary-Symbolwise Flexible Parsing algorithm that is optimal for prefix-closed dictionaries and any symbolwise compressor under some natural hypothesis. In the case of LZ78-like algorithms with variable costs and any, linear as usual, symbolwise compressor we show how to implement our parsing algorithm in linear time. In the case of LZ77-like dictionaries and any symbol…
Solving Graph Coloring Problems Using Learning Automata
2008
The graph coloring problem (GCP) is a widely studied combinatorial optimization problem with numerous applications, including time tabling, frequency assignment, and register allocation. The growing need for more efficient algorithms has led to the development of several GCP solvers. In this paper, we introduce the first GCP solver that is based on Learning Automata (LA). We enhance traditional Random Walk with LA-based learning capability, encoding the GCP as a Boolean satisfiability problem (SAT). Extensive experiments demonstrate that the LA significantly improve the performance of RW, thus laying the foundation for novel LA-based solutions to the GCP.
Parallel Collision Queries on the GPU
2013
We present parallel algorithms to accelerate collision tests of rigid body objects for a high number of independent transformations as they occur in sampling-based motion planning and path validation problems. We compare various GPU approaches with a different level of parallelism against each other and against a parallel CPU implementation. Our algorithms require no sophisticated load balancing schemes. They make no assumption on the distribution of the input transformations and require no pre-processing. Yet, we can perform up to 1 million collision tests per second with our best GPU implementation in our benchmarks. This is about 2.5X faster than our reference multi-core CPU implementati…