Results 31 to 40 of about 175,321 (149)

Gradient-Descent-like Ghost Imaging

open access: yesSensors, 2021
Ghost imaging is an indirect optical imaging technique, which retrieves object information by calculating the intensity correlation between reference and bucket signals.
Wen-Kai Yu   +4 more
doaj   +1 more source

Free iterative and iteration K-semialgebras [PDF]

open access: yesAlgebra universalis, 2012
We consider algebras of rational power series over an alphabet $ $ with coefficients in a commutative semiring $K$ and characterize them as the free algebras in various classes of algebraic structures.
Ésik, Z., Kuich, W.
openaire   +2 more sources

Application of a simultaneous iterations reconstruction technique for a 3-D water vapor tomography system

open access: yesGeodesy and Geodynamics, 2013
The simultaneous iterations reconstruction technique (SIRT) is one of several reconstruction algorithms of the ART family. It is used widely in tomography because of its convenience in dealing with large sparse matrices.
Wang Wei, Ye Biwen, Wang Jiexian
doaj   +1 more source

Generalization of the Harmonic Weighted Mean Via Pythagorean Invariance Identity and Application

open access: yesAnnales Mathematicae Silesianae, 2020
Under some simple conditions on the real functions f and g defined on an interval I ⊂ (0, ∞), the two-place functions Af (x, y) = f (x) + y − f (y) and Gg(x,y)=g(x)g(y)y{G_g}\left({x,y} \right) = {{g\left(x \right)} \over {g\left(y \right)}}y generalize,
Kahlig Peter, Matkowski Janusz
doaj   +1 more source

Shelah-Stupp’s Iteration and Muchnik’s Iteration [PDF]

open access: yesFundamenta Informaticae, 2018
In the early seventies, Shelah proposed a model-theoretic construction, nowadays called “iteration”. This construction is an infinite replication in a tree-like manner where every vertex possesses its own copy of the original structure. Stupp proved that the decidability of the monadic second-order (MSO) theory is transferred from the original ...
Caucal, Didier, Knapik, Teodor
openaire   +2 more sources

ITERATED LOGARITHM INEQUALITIES [PDF]

open access: yesProceedings of the National Academy of Sciences, 1967
1. Introduction—Let x,x 1, x 2 … be a sequence of independent, identically distributed random variables with mean 0, variance 1, and moment generating function ϕ(t) = E(etz) finite in some neighborhood of t= 0, and put S n = x 1, + … + x n, \(\bar x\) n = S n/n.
Darling, D. A., Robbins, H.
openaire   +2 more sources

Iterated arc graphs [PDF]

open access: yesCommentationes Mathematicae Universitatis Carolinae, 2018
The arc graph $ (G)$ of a digraph $G$ is the digraph with the set of arcs of $G$ as vertex-set, where the arcs of $ (G)$ join consecutive arcs of $G$. In 1981, Poljak and R dl characterised the chromatic number of $ (G)$ in terms of the chromatic number of $G$ when $G$ is symmetric (i.e., undirected).
Rorabaugh, Danny   +3 more
openaire   +2 more sources

Residual Interpolation Integrated Pixel-by-Pixel Adaptive Iterative Process for Division of Focal Plane Polarimeters

open access: yesSensors, 2022
Residual interpolations are effective methods to reduce the instantaneous field-of-view error of division of focal plane (DoFP) polarimeters. However, their guide-image selection strategies are improper, and do not consider the DoFP polarimeters’ spatial
Jie Yang   +4 more
doaj   +1 more source

Iterating iterated substitution

open access: yesTheoretical Computer Science, 1977
AbstractBy iterating iterated substitution not all regular languages can be copied. Hence the smallest full hyper (1)-AFL is properly contained in ETOL, the smallest full hyper-AFL. The number of iterations of iterated substitution gives rise to a proper hierarchy. Consequently the smallest full hyper (1)-AFL is not a full principal AFL.
openaire   +1 more source

Iterated discriminants

open access: yesJournal of Symbolic Computation, 2009
In this paper the authors prove that the discriminant of the discriminant of a multivariate polynomial has the same irreducible factors of the product of seven polynomials. These seven polynomials are obtained as the GCD of the generators of an elimination ideal. This result is similar to the one by \textit{L. Busé} and \textit{B.
Lazard, Daniel, Mccallum, Scott
openaire   +2 more sources

Home - About - Disclaimer - Privacy