Results 71 to 80 of about 5,939,728 (334)

Deep Nets for Local Manifold Learning

open access: yesFrontiers in Applied Mathematics and Statistics, 2018
The problem of extending a function f defined on a training data C on an unknown manifold š• to the entire manifold and a tubular neighborhood of this manifold is considered in this paper. For š• embedded in a high dimensional ambient Euclidean space ā„D, a
Charles K. Chui, Hrushikesh N. Mhaskar
doaj   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

open access: yesFEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy   +4 more
wiley   +1 more source

APPROXIMATION PROPERTIES OF SOME DISCRETE FOURIER SUMS FOR PIECEWISE SMOOTH DISCONTINUOUS FUNCTIONS

open access: yesŠŸŃ€Š¾Š±Š»ŠµŠ¼Ń‹ анализа, 2019
Denote by Ln, N (f, x) a trigonometric polynomial of order at most n possessing the least quadratic deviation from f with respect to the system  tk = u + 2Ļ€k N Nāˆ’1 k=0 , where u ∈ R and n 6 N/2.
G. G. Akniyev
doaj   +1 more source

Structural insights into an engineered feruloyl esterase with improved MHET degrading properties

open access: yesFEBS Letters, EarlyView.
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa   +5 more
wiley   +1 more source

Learning in Deep Radial Basis Function Networks

open access: yesEntropy
Learning in neural networks with locally-tuned neuron models such as radial Basis Function (RBF) networks is often seen as instable, in particular when multi-layered architectures are used. Furthermore, universal approximation theorems for single-layered
Fabian Wurzberger, Friedhelm Schwenker
doaj   +1 more source

Spacetime: function and approximation

open access: yesSynthese, 2022
AbstractSeveral approaches to quantum gravity (QG) signal the loss of spacetime at some level. According to spacetime functionalism, spacetime is functionally realised by a more fundamental structure. According to one version of spacetime functionalism, the spacetime role is specified by Ramsifying general relativity (GR).
openaire   +3 more sources

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

Approximation Error Bounds via Rademacher's Complexity [PDF]

open access: yes, 2008
Approximation properties of some connectionistic models, commonly used to construct approximation schemes for optimization problems with multivariable functions as admissible solutions, are investigated.
Gnecco, Giorgio, Sanguineti, Marcello
core  

The human gut microbiome across the life course

open access: yesFEBS Letters, EarlyView.
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Ɩzkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero   +4 more
wiley   +1 more source

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search [PDF]

open access: yes, 2013
We present an optimal, combinatorial 1āˆ’1/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, PĆ”l and VondrĆ”k, 2008), our algorithm is extremely simple ...
Filmus, Yuval   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy