Results 261 to 270 of about 35,860 (292)
Some of the next articles are maybe not open access.
2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2019
Domain-wall memory (DWM), also known as Racetrack memory, is a new kind of spintronic memory that extends the concept of spin-transfer torque magnetic memory, a high storage capacity and high speed, comparable with STT-RAM. Using the novel Transverse Read (TR), this paper presents new and rising possibilities for DWM.
Sébastien Ollivier +5 more
openaire +2 more sources
Domain-wall memory (DWM), also known as Racetrack memory, is a new kind of spintronic memory that extends the concept of spin-transfer torque magnetic memory, a high storage capacity and high speed, comparable with STT-RAM. Using the novel Transverse Read (TR), this paper presents new and rising possibilities for DWM.
Sébastien Ollivier +5 more
openaire +2 more sources
Orthogonal Signals and the Orthogonalization Procedure
2021Abstract Chapter 2 is dedicated to the principle of signal orthogonalization, because orthogonal signals are widely used in telecommunication theory and practice, like the carriers of baseband signals, subcarriers in orthogonal frequency division multiplexing systems, and the spreading sequences in spread-spectrum and code division ...
openaire +1 more source
Proceedings of the seventh annual symposium on Computational geometry - SCG '91, 1991
Any tree, with \(n\) edges and \(n + 1\) vertices, can be realized in Euclidean \(n\)-space so that its edges, of any chosen lengths, are mutually perpendicular. The convex hull of such an orthogonal tree is an orthogonal simplex whose dihedral angles include \((\begin{smallmatrix} n \\2 \end{smallmatrix})\) right angles. More precisely, each vertex of
openaire +3 more sources
Any tree, with \(n\) edges and \(n + 1\) vertices, can be realized in Euclidean \(n\)-space so that its edges, of any chosen lengths, are mutually perpendicular. The convex hull of such an orthogonal tree is an orthogonal simplex whose dihedral angles include \((\begin{smallmatrix} n \\2 \end{smallmatrix})\) right angles. More precisely, each vertex of
openaire +3 more sources
Annals of Combinatorics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Mediating Reaction Orthogonality in Polymer and Materials Science
Angewandte Chemie - International Edition, 2021Nathaniel Corrigan +2 more
exaly
ON THE TRUE INTERVAL OF ORTHOGONALITY FOR ORTHOGONAL POLYNOMIALS
The Quarterly Journal of Mathematics, 1970openaire +2 more sources
Orthogonality and retract orthogonality of operations
2018Summary: In this article, we study connections between orthogonality and retract orthogonality of operations. We prove that if a tuple of operations is retractly orthogonal, then it is orthogonal. However, orthogonality of operations doesn't provide their retract orthogonality.
openaire +1 more source
On Birkhoff orthogonality and isosceles orthogonality in normed linear spaces
Aequationes Mathematicae, 2011Javier Alonso, Senlin Wu
exaly