Results 21 to 30 of about 430,873 (249)
APPROXIMATION OF UNIVERSAL MAGNETIC CHARACTERISTIC FOR MODELLING ELECTRIC TRACTION MACHINES
Nauka ta progres transportu, 2017 Purpose. The scientific work is aimed to obtain an analytic expression describing universal magnetic characteristic and enabling to take into account the demagnetizing effect of the armature.
A. Yu. Drubetskyi
doaj +1 more source
Applied Categorical Structures, 2017 In a locally $ $-presentable category, with $ $ a regular cardinal, classes of objects that are injective with respect to a family of morphisms whose domains and codomains are $ $-presentable, are known to be characterized by their closure under products, $ $-directed colimits and $ $-pure subobjects. Replacing the strict commutativity of diagrams
J. Rosický, W. Tholen
openaire +3 more sources
Ou comme ça, machin et autres marqueurs d’indétermination dans les listes
Discours, 2017 This article deals with two extension particles (or “general extenders”) found in the OFROM corpus (French spoken in Switzerland). On the one hand, we study the sequence ou comme ça (“or like that”), whose high frequency seems to be characteristic of the
Marie-José Béguelin +1 more
doaj +1 more source
Approximate approximations from scattered data
Journal of Approximation Theory, 2007 The aim of this paper is to extend the approximate quasi-interpolation on a uniform grid by dilated shifts of a smooth and rapidly decaying function on a uniform grid to scattered data quasi-interpolation. It is shown that high order approximation of smooth functions up to some prescribed accuracy is possible, if the basis functions, which are centered
LANZARA, Flavia, MAZ'YA V, SCHMIDT G.
openaire +4 more sources
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022 For a function $g\colon\{0,1\}^m\to\{0,1\}$, a function $f\colon \{0,1\}^n\to\{0,1\}$ is called a $g$-polymorphism if their actions commute: $f(g(\mathsf{row}_1(Z)),\ldots,g(\mathsf{row}_n(Z))) = g(f(\mathsf{col}_1(Z)),\ldots,f(\mathsf{col}_m(Z)))$ for all $Z\in\{0,1\}^{n\times m}$.
Chase, Gilad +4 more
openaire +2 more sources
Zeros of Approximate Functional Approximations [PDF]
Mathematics of Computation, 1967 The gN(s) are of interest as approximations to the Riemann zeta function. Let s = or + it. In [1], it was shown that for t sufficiently large, gi(s) and g2(s) have their zeros on the critical line ar = 2. After encountering analytical difficulties in attempting to extend this theorem to further N, the calculations described below were undertaken.
openaire +2 more sources
Advanced Engineering Research, 2017 Introduction. Prof A.V. Belokon’s (1941-2013; former Rector of Rostov State University and President of Southern Federal University) PhD thesis was devoted to asymptotical methods in contact problems of the elasticity theory for bodies of cylindrical ...
Dmitry A Pozharskii, Nikita B. Zolotov
doaj +1 more source
Advanced Engineering Research, 2014 A solution to the problem on describing experimentally obtained dependences is considered. The autho r’s method is based upon getting some local approximations of fragments of these relations, and their additive reduction to a single analytical ...
Rudolf Anatolyevich Neydorf
doaj +1 more source
Approximating Approximate Pattern Matching
, 2018 ISSN:1868 ...
Studený, Jan, Uznański, Przemysław
openaire +4 more sources
IEEE Access, 2023 The radial basis function (RBF) neural network is a type of universal approximator, and has been widely used in various fields. Improving the training speed and compactness of RBF networks are critical for promoting their applications.
Lifei Sun +6 more
doaj +1 more source