Results 241 to 250 of about 1,748,309 (288)
Advancements and expanding applications of CAR-T cell therapy. [PDF]
Zhang X +5 more
europepmc +1 more source
Bridging worlds: connecting glycan representations with glycoinformatics via Universal Input and a canonicalized nomenclature. [PDF]
Urban J, Joeres R, Bojar D.
europepmc +1 more source
Single spin exact gradients for the optimization of complex pulses and pulse sequences. [PDF]
Slad S, Luy B.
europepmc +1 more source
Universal relation between spectral and wavefunction properties at criticality. [PDF]
Jiricek S +4 more
europepmc +1 more source
Accelerating Catalyst Materials Discovery With Large Artificial Intelligence Models. [PDF]
Zhang D +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Bounded Universal Functions
Computational Methods and Function Theory, 2012Let \(K\subset\mathbb{C}\) be a compact set. By \(K^c\) denote the complement of \(K\). In the paper under review, the author investigates boundedness properties of some universal functions. Let \((a_n)_{n\in\mathbb{N}}\) be an unbounded sequence in \(\mathbb{C}\).
exaly +3 more sources
Universal Functions Originator
Applied Soft Computing, 2020Abstract Nowadays, couples of computing systems have been introduced to perform many applications, such as function approximation, pattern classification, categorization/clustering, forecasting/prediction, control, and optimization. Linear regression (LR) is commonly used for simple data where the relation between its coefficients is linear, while ...
Ali R. Al-Roomi, Mohamed E. El-Hawary
openaire +1 more source
Mathematical Notes, 2005
A partial recursive function \(\alpha\) is called \(R\)-universal, if \(R\) is a recursively enumerable set, the range of \(\alpha\) equals \(R\), and the range of \(\beta\) \(\subseteq R\) implies \(\beta\leq_m\alpha\) for any partial recursive function \(\beta\), where \(\beta\leq_m\alpha\) means \(\beta=\alpha f\) for some recursive function \(f ...
openaire +1 more source
A partial recursive function \(\alpha\) is called \(R\)-universal, if \(R\) is a recursively enumerable set, the range of \(\alpha\) equals \(R\), and the range of \(\beta\) \(\subseteq R\) implies \(\beta\leq_m\alpha\) for any partial recursive function \(\beta\), where \(\beta\leq_m\alpha\) means \(\beta=\alpha f\) for some recursive function \(f ...
openaire +1 more source

