Results 241 to 250 of about 135,583 (285)
Qualia structures collapse for geometric shapes, but not faces, when spatial attention is withdrawn. [PDF]
Neurosci ConsciousRowe EG +5 more
europepmc +1 more source
Geometry Reduced Order Modeling (GROM) with application to modeling of glymphatic function.
Brain Res BullSolheim A +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Enriching Parikh matrix mappings
International Journal of Computer Mathematics, 2013In this paper, we define the Super-Parikh S-Parikh matrix mapping as an extension of the Parikh matrix mapping introduced by Mateescu et al . Like the Parikh matrix, the extension revolves around a certain type of square matrices, but instead of non-negative integers, its matrix-mapped elements are non-negative rationals fractions.
Adrian Atanasiu, Radu-Florian Atanasiu
openaire +1 more source
COUPLED-EXPANDING MAPS AND MATRIX SHIFTS
International Journal of Bifurcation and Chaos, 2013For an irreducible transition matrix A of size m × m, which is not a permutation, a map f : X → X is said to be strictly A-coupled-expanding if there are nonempty sets V1,…, Vm ⊂ X such that the distance between any two of them is positive and f(Vi) ⊃ Vj holds whenever aij = 1.
MARCIN KULCZYCKI, PIOTR OPROCHA
openaire +3 more sources
1992
We now consider the use of the multimesh graph method for mapping matrix algorithms onto existing application-specific array processors. The term application-specific indicates that the processing elements and the interconnection structure are basically well-suited for the class of matrix algorithms. However, since the underlying generality is achieved
Jaime H. Moreno, Tomás Lang
openaire +1 more source
We now consider the use of the multimesh graph method for mapping matrix algorithms onto existing application-specific array processors. The term application-specific indicates that the processing elements and the interconnection structure are basically well-suited for the class of matrix algorithms. However, since the underlying generality is achieved
Jaime H. Moreno, Tomás Lang
openaire +1 more source
PARIKH MATRIX MAPPING AND LANGUAGES
International Journal of Foundations of Computer Science, 2010Restricting the Parikh Matrix mapping to a language rather than to an alphabet rises a set of problems that seem interesting to us. Moreover, amiability (or M -equivalence as it is named by other authors) is exploited in order to characterise certain types of languages. The paper also proposes a series of results establishing relations between classes
openaire +2 more sources
TOTALLY CONTRACTIVE MAPPINGS ON MATRIX BALLS
Analysis, 1986This paper gives some properties of totally contractive holomorphic mappings of the unit \(n\times n\) matrix ball. It shows that any linear totally contractive mapping L must satisfy the equation \(\det L(Z)=\det L(I)\cdot \det Z\) for all Z in the unit ball; in fact this equation, together with det L(I)\(\neq 0\), characterizes (up to scalar ...
openaire +1 more source
Linear Maps Preserving Matrix Discriminant
Journal of Mathematical ScienceszbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2012
AbstractThis article examines the changing meaning of the Tonnetz in Riemann's writings over the course of his career. It examines how Riemann came to reconcile the literal-acoustical and the spatial-metaphorical views of the Tonnetz—how the Tonnetz as a literal matrix to represent and calculate relative frequencies of the tones in just intonation ...
openaire +1 more source
AbstractThis article examines the changing meaning of the Tonnetz in Riemann's writings over the course of his career. It examines how Riemann came to reconcile the literal-acoustical and the spatial-metaphorical views of the Tonnetz—how the Tonnetz as a literal matrix to represent and calculate relative frequencies of the tones in just intonation ...
openaire +1 more source