Results 291 to 300 of about 4,074,119 (344)

Axial Skeletal Assessment in Osteoporosis Using Radiofrequency Echographic Multi-spectrometry: Diagnostic Performance, Clinical Utility, and Future Directions. [PDF]

Cureus
As'ad M.
europepmc   +1 more source

A novel MCDM method for assessing student employability psychology using complex Pythagorean hesitant fuzzy Sugeno Weber aggregation. [PDF]

Sci Rep
He X.
europepmc   +1 more source

A Metric Learning-Based Improved Oriented R-CNN for Wildfire Detection in Power Transmission Corridors. [PDF]

Sensors (Basel)
Wang X, Wang B, Luo P, Wang L, Wu Y.
europepmc   +1 more source

A novel method based on improved SFLA for IP information extraction from TEM signals. [PDF]

Sci Rep
Li R, Li R, Li G, Zhang Y, Ding X, Zhang L.   +5 more
europepmc   +1 more source

High-dimensional neuronal activity from low-dimensional latent dynamics: a solvable model

Schmutz V, Haydaroglu A, Wang S, Feng Y, Carandini M, Harris KD.   +5 more
europepmc   +1 more source

Invertible Composition Operators: The Product of a Composition Operator with the Adjoint of a Composition Operator [PDF]

Complex Analysis and Operator Theory, 2014
In this paper, we study the product of a composition operator $$C_{\varphi }$$ with the adjoint of a composition operator $$C^{*}_ ...
J. Clifford, Trieu Le, Alan D. Wiggins
semanticscholar   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Neural Operator: Learning Maps Between Function Spaces

arXiv.org, 2021
The classical development of neural networks has primarily focused on learning mappings between finite dimensional Euclidean spaces or finite sets. We propose a generalization of neural networks to learn operators, termed neural operators, that map ...
Nikola B. Kovachki, Zong-Yi Li, Burigede Liu, K. Azizzadenesheli, K. Bhattacharya, Andrew M. Stuart, Anima Anandkumar   +6 more
semanticscholar   +1 more source

Operations and compositions in transrecursive operators

Cybernetics and Systems Analysis, 1994
Earlier, the authors introduced classes of alphabetic operators that have greater computational possibilities than classical algorithms. In Dokl. Akad. Nauk SSSR 321, No. 5, 876-879 (1991), they gave a uniform procedure for obtaining such alphabetic operators, which will be called transrecursive operators in what follows.
Mark Burgin, Yu. M. Borodyanskii
openaire   +4 more sources

Algebraic composition operators [PDF]

Integral Equations and Operator Theory, 1992
Let \(F(X)\) be a linear space of complex valued functions on a set \(X\). Any self-map \(b:X\to X\) defines the automorphism \(C_ b: F(X)\to F(X)\) where \(C_ b u(x):= u(b(x))\). The paper deals with the following problem: For a given \(F(X)\) and a polynomial \(P(z)=z^ n+ p_{n-1}z^{n-1}+ \cdots+p_ 0\) is there a self-map \(b:X\to X\) such that: (i) \(
Albrecht Böttcher, Harald Heidler
openaire   +1 more source