Search results for "Approx"
showing 10 items of 922 documents
Development of the H-point standard additions method for analyte determinations in unknown matrix
1993
Abstract The development of the H-point standard additions method is proposed in order to obtain the unbiased analyte concentration when the matrix of the sample is completely unknown. A spectral region where the interferent behaviour can be considered linear at three wavelengths must be chosen. The method uses the analytical signal data at these three wavelengths, usually situated in the maxima region of the analyte. Two procedures are proposed in order to know and to locate this behaviour for the unknown interferent. Several binary and ternary mixtures of phenol, 4-chlorophenol and 4-chloro-3-methylphenol as representative examples have been assayed, with accurate (less than 3% relative e…
Investigating the Impact of Radiation-Induced Soft Errors on the Reliability of Approximate Computing Systems
2020
International audience; Approximate Computing (AxC) is a well-known paradigm able to reduce the computational and power overheads of a multitude of applications, at the cost of a decreased accuracy. Convolutional Neural Networks (CNNs) have proven to be particularly suited for AxC because of their inherent resilience to errors. However, the implementation of AxC techniques may affect the intrinsic resilience of the application to errors induced by Single Events in a harsh environment. This work introduces an experimental study of the impact of neutron irradiation on approximate computing techniques applied on the data representation of a CNN.
On the Measure of Many-Level Fuzzy Rough Approximation for L-Fuzzy Sets
2019
We introduce a many-level version of L-fuzzy rough approximation operators and define measures of approximation obtained by such operators. In a certain sense, theses measures characterize the quality of the resulting approximation. We study properties of such measures and give a topological interpretation of the obtained results.
The Calderón problem for the fractional Schrödinger equation
2020
We show global uniqueness in an inverse problem for the fractional Schr\"odinger equation: an unknown potential in a bounded domain is uniquely determined by exterior measurements of solutions. We also show global uniqueness in the partial data problem where the measurements are taken in arbitrary open, possibly disjoint, subsets of the exterior. The results apply in any dimension $\geq 2$ and are based on a strong approximation property of the fractional equation that extends earlier work. This special feature of the nonlocal equation renders the analysis of related inverse problems radically different from the traditional Calder\'on problem.
On Erlang B-formula and ERT method extension
2010
The key result of the paper is the theorem on traffic splitting and the ERT method extension for estimation of the throughput for schemes with traffic splitting. The excellent accuracy (relative error is less than 1%) is shown in numerical example. The paper also contains new Erlang-B formula algorithm for non-integer number of channels based on parabolic approximation.
Influence of Active Device Nonlinearities on the Determination of Adler's Injection.Locking Q-Factor
2011
The problem of the correct evaluation of Q-factor appearing in Adler's equation for injection-locking is addressed. Investigation has shown that recent results presented in the literature, while extending applicability of the original method, do not completely account for nonlinear effects occurring when two-port active devices are involved. To overcome such limitation, use can be made of a newly developed theory in the dynamical complex envelope domain, capable of providing first-approximation exact dynamical models of driven quasi-sinusoidal oscillators. Some preliminary results are presented here concerning a class of injection-locked oscillators with single-loop feedback type configurat…
On spline methods of approximation under L-fuzzy information
2011
This work is closely related to our previous papers on algorithms of approximation under L-fuzzy information. In the classical theory of approximation central algorithms were worked out on the basis of usual, that is crisp splines. We describe central methods for solution of linear problems with balanced L-fuzzy information and develop the concept of L-fuzzy splines.
Finite element approximation of parabolic hemivariational inequalities
1998
In this paper we introduce a finite element approximation for a parabolic hemivariational initial boundary value problem. We prove that the approximate problem is solvable and its solutions converge on subsequences to the solutions of the continuous problem
Real-time clothoid approximation by Rational Bezier curves
2008
This paper presents a novel technique for implementing Clothoidal real-time paths for mobile robots. As first step, rational Bezier curves are obtained as approximation of the Fresnel integrals. By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant. This on-line approach guarantees that an RBC has the same behavior as the original Clothoid using a low curve order. The resulting Clothoidal path allows any two arbitrary poses to be joined in a plane. RBCs working as Clothoids are also used to search for the shortest bounded-curvature path with a significant comput…
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
2009
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…