In this paper. the first kind of Chebyshev interpolation in the Wiener space are discussed. under the L-p norm, the convergence properties of Chebyshev interpolation polynomials base on the zeros of the Chebyshev poly...
详细信息
ISBN:
(纸本)9783642275029;9783642275036
In this paper. the first kind of Chebyshev interpolation in the Wiener space are discussed. under the L-p norm, the convergence properties of Chebyshev interpolation polynomials base on the zeros of the Chebyshev polynomials are proved. Furthermore, the estimation for the average error of the first kind of Chebyshev interpolation polynomials are weakly equivalent to the average errors of the corresponding best polynomial approximation. while p = 4 the weakly asypmtotic order e(4) (H-n, G(4)) approximate to 1/root n of the average error in the Wiener space is obtained.
To obtain the average error of flank wear in turning Duplex Stainless Steel (DSS) using Canny's Edge Detection Algorithm and compare it with Fuzzy Logic Algorithm. The average error accuracy of flank wear is compu...
详细信息
For weighted approximation in Lp-norm,we determine strongly asymptotic orders for the average errors of both function approximation and derivative approximation by the Bernstein operators sequence on the r-fold integr...
详细信息
For weighted approximation in Lp-norm,we determine strongly asymptotic orders for the average errors of both function approximation and derivative approximation by the Bernstein operators sequence on the r-fold integrated Wiener space.
Approximate computing is an effective computing paradigm to reduce area, delay, and power for error-tolerant applications. average error is a widely-used metric for approximate circuits, measuring the average deviatio...
详细信息
ISBN:
(纸本)9798350348606;9783981926385
Approximate computing is an effective computing paradigm to reduce area, delay, and power for error-tolerant applications. average error is a widely-used metric for approximate circuits, measuring the average deviation between the outputs of exact and approximate circuits. This paper proposes VACSEM, a formal method to verify average errors in approximate circuits using simulation-enhanced model counting. VACSEM leverages circuit structure information and logic simulation to speed up verification. Experimental results show that VACSEM is on average 35x faster than the state-of-the-art method.
We consider the problem df minimizing mean flow time for the Imprecise Computation Model introduced by Lin et al. A task system TS = ({Ti}, {r(T-i)}, {d(T-i)}, {m(T-i)}, {o(T-i)}) consists of a set of n independent ta...
详细信息
We consider the problem df minimizing mean flow time for the Imprecise Computation Model introduced by Lin et al. A task system TS = ({Ti}, {r(T-i)}, {d(T-i)}, {m(T-i)}, {o(T-i)}) consists of a set of n independent tasks, where r(T-i), d(T-i), m(T-i), and o(T-i) denote the ready time, deadline, execution time of the mandatory part, and execution time of the optional part of T-i, respectively. Given a task system TS and an error threshold K, our goal is to find a preemptive schedule on one processor such that the average error is no more than K and the mean flow time of the schedule is minimized. Such a schedule is called an optimal schedule. In this article we show that the problem of finding an optimal schedule is NP-hard, even if all tasks have identical ready times and deadlines. A pseudopolynomial-time algorithm is given for a set of tasks with identical ready times and deadlines, and oppositely ordered mandatory execution times and total execution times (i.e., there is a labeling of tasks such that m(T-i) less than or equal to m(Ti+1) and m(T-i) + o(T-i) greater than or equal to m(Ti+1) + o(Ti+1) for each 1 less than or equal to i < n). Finally, polynomial-time algorithms are given for (1) a set of tasks with identical ready rimes, and similarly ordered mandatory execution times and total execution times and (2) a set of tasks with similarly ordered ready times, deadlines, mandatory execution times, and total execution times.
For weighted approximation in L-p-norm, we determine strongly asymptotic orders for simultaneous approximation average errors of sequence of Kantorovitch operators on r-fold integrated Wiener space. These results show...
详细信息
For weighted approximation in L-p-norm, we determine strongly asymptotic orders for simultaneous approximation average errors of sequence of Kantorovitch operators on r-fold integrated Wiener space. These results show the saturation properties of the Kantorovitch operators in the average case setting.
Hexagonal spatial sampling is used widely in image and signal processing. However, no rigorous treatment of the quantization error due to hexagonal sampling has appeared in the literature. In this paper, we develop ma...
详细信息
Hexagonal spatial sampling is used widely in image and signal processing. However, no rigorous treatment of the quantization error due to hexagonal sampling has appeared in the literature. In this paper, we develop mathematical tools for estimating quantization error in hexagonal sensory configurations. These include analytic expressions for the average error and the error distribution of a function of an arbitrary number of independently quantized variables. These two quantities are essential for assessing the reliability of a given algorithm. They can also be used to compare the relative sensitivity of a particular algorithm to quantization error for hexagonal and other spatial samplings, e.g., square, and can have an impact on sensor design. Furthermore, we show that the ratio of hexagonal error to square error is bounded between 0.90 and 1.05.
ForXwith binomial (n, p) distribution the usual measure of the error ofX/nas an estimator ofpis its standard errorSn(p)= √{E(X/n – p)2} = √{p(1 –p)/n}. A somewhat more natural measure is the average absolute error...
详细信息
ForXwith binomial (n, p) distribution the usual measure of the error ofX/nas an estimator ofpis its standard errorSn(p)= √{E(X/n – p)2} = √{p(1 –p)/n}. A somewhat more natural measure is the average absolute errorDn(p) = E‖X/n – p‖. This article considers use ofDn(p)instead ofSn(p)in a student's first introduction to statistical estimation. Exact and asymptotic values ofDn(p), and the appearance of its graph, are described in detail. The same is done for the Poisson distribution.
In this paper, we discuss the average errors of function approximation by linear combinations of Bernstein-Kantorovich operators. The strongly asymptotic orders for the average errors of these operators sequence are d...
详细信息
In this paper, we discuss the average errors of function approximation by linear combinations of Bernstein-Kantorovich operators. The strongly asymptotic orders for the average errors of these operators sequence are determined on the Wiener space.
In this paper, we discuss the average errors of function weighted approximation by the Bernstein-Kantorovich operators. The strongly asymptotic orders for the average errors of the Bernstein-Kantorovich operators sequ...
详细信息
In this paper, we discuss the average errors of function weighted approximation by the Bernstein-Kantorovich operators. The strongly asymptotic orders for the average errors of the Bernstein-Kantorovich operators sequence are determined on the r-fold integrated Wiener Space.
暂无评论