Lower bound on BER performance for maximal ratio combining with weighting errors

The theoretical lower bounds on mean squared channel estimation errors for typical fading channels are presented by the infinite-length and non-causal Wiener filter and the exact closed-form expressions of the lower bounds for different channel Doppler spectra are derived. Based on the obtained lower bounds on mean squared channel estimation errors, the limits on bit error rate （BER） for maximal ratio combining （MRC） with Gaussian distributed weighting errors on independent and identically distributed （i. i. d） fading channels are presented. Numerical results show that the BER performances of ideal MRC are the lower bounds on the BER performances of non-ideal MRC and deteriorate as the maximum Doppler frequency increases or the SNR of channel estimate decreases.

High-Order Local Discontinuous Galerkin Algorithm with Time Second-Order Schemes for the Two-Dimensional Nonlinear Fractional Diffusion Equation

In this article,some high-order local discontinuous Galerkin(LDG)schemes based on some second-order θ approximation formulas in time are presented to solve a two-dimen-sional nonlinear fractional diffusion equation.The unconditional stability of the LDG scheme is proved,and an a priori error estimate with O(h^(k+1)+At^(2))is derived,where k≥0 denotes the index of the basis function.Extensive numerical results with Q^(k)(k=0,1,2,3)elements are provided to confirm our theoretical results,which also show that the second-order convergence rate in time is not impacted by the changed parameter θ.

ASYMPTOTIC EXPANSIONS OF ZEROS FOR KRAWTCHOUK POLYNOMIALS WITH ERROR BOUNDS

Krawtchouk polynomials are frequently applied in modern physics. Based on the results which were educed by Li and Wong, the asymptotic expansions of Krawtchouk polynomials are improved by using Airy function, and uniform asymptotic expansions are got. Furthermore, the asymptotic expansions of the zeros for Krawtchouk polynomials are again deduced by using the property of the zeros of Airy function, and their corresponding error bounds axe discussed. The obtained results give the asymptotic property of Krawtchouk polynomials with their zeros, which are better than the results educed by Li and Wong.

Generalized gap functions and error bounds for generalized variational inequalities

We consider some classes of generalized gap functions for two kinds of generalized variational inequality problems. We obtain error bounds for the underlying variational inequalities using the generalized gap functions under the condition that the involved mapping F is g-strongly monotone with respect to the solution, but not necessarily continuous differentiable, even not locally Lipschitz.

Impulsive stabilization of a class of nonlinear system with bounded gain error

Considering mechanical limitation or device restriction in practical application, this paper investigates impulsive stabilization of nonlinear systems with impulsive gain error. Compared with the existing impulsive analytical approaches,the proposed impulsive control method is more practically applicable, which includes control gain error with an acceptable boundary. A sufficient criterion for global exponential stability of an impulsive control system is derived, which relaxes the condition for precise impulsive gain efficiently. The effectiveness of the proposed method is confirmed by theoretical analysis and numerical simulation based on Chua＇s circuit.

OPTIMAL ERROR BOUND IN A SOBOLEV SPACE OF REGULARIZED APPROXIMATION SOLUTIONS FOR A SIDEWAYS PARABOLIC EQUATION

The inverse heat conduction problem （IHCP） is a severely ill-posed problem in the sense that the solution （ if it exists） does not depend continuously on the data. But now the results on inverse heat conduction problem are mainly devoted to the standard inverse heat conduction problem. Some optimal error bounds in a Sobolev space of regularized approximation solutions for a sideways parabolic equation, i. e. , a non-standard inverse heat conduction problem with convection term which appears in some applied subject are given.

Gap Functions and Error Bounds for Set-Valued Vector Quasi Variational Inequality Problems

One of the classical approaches in the analysis of a variational inequality problem is to transform it into an equivalent optimization problem via the notion of gap function. The gap functions are useful tools in deriving the error bounds which provide an estimated distance between a specific point and the exact solution of variational inequality problem. In this paper, we follow a similar approach for set-valued vector quasi variational inequality problems and define the gap functions based on scalarization scheme as well as the one with no scalar parameter. The error bounds results are obtained under fixed point symmetric and locally α-Holder assumptions on the set-valued map describing the domain of solution space of a set-valued vector quasi variational inequality problem.

An Existent Condition of Error Bounds for Abstract Linear Inequality System

We consider the abstract linear inequality system （A, C, b） and give a sufficient condition for the system （A, C, b） to have an error bound, which extends the previous result.

ERROR BOUNDS IN PERIODIC QUARTIC SPLINE INTERPOLATION

In this paper we develop periodic quartic spline interpolation theory which,in general,gives better fus to continuous functions than does the existing quintic spline interpolation theory.The main theorem of the paper is to establish that r=0,1,2,3.Also,the nanperiodic cases cannot be constructed empoly-ing the methodology of this paper because that will involve several other end conditions entirely different than(1,10).

Alternative Error Bounds for Some Numerical Quadrature Rules

Similar to having done for the mid-point and trapezoid quadrature rules,we obtain alternative estimations of error bounds for the Simpson＇s quadrature rule involving n-time（1 ≤ n ≤ 4） differentiable mappings and then to the estimations of error bounds for the adaptive Simpson＇s quadrature rule.

OPTIMAL ERROR BOUNDS FOR THE CUBIC SPLINE INTERPOLATION OF LOWER SMOOTH FUNCTIONS(1)

In this paper,the kernel of the cubic spline interpolation is given.An optimal error bound for the cu- bic spline interpolation of lower smooth functions is obtained.

OPTIMAL ERROR BOUNDS FOR THE CUBIC SPLINE INTERPOLATION OF LOWER SMOOTH FUNCTION(Ⅱ)

Abstract In this paper, by using the explicit expression of the kernel of the cubic spline interpolation, the optimal error bounds for the cubic spline interpolation of lower soomth functions are obtained.

EBound：一种高效的空间内存错误检测方法

空间内存错误是C语言程序中经常出现的一种漏洞。针对目前空间内存错误检测方法的性能开销高的问题,提出一种高效的空间内存错误检测方法 EBound。EBound使用动态指针边界检测方法检测程序中的空间内存错误,并使用静态污点分析方法来消除不必要的指针边界检查,从而降低了性能开销。EBound基于LLVM编译器实现,不需要对程序源代码进行修改。实验结果表明,EBound可以有效地防御利用空间内存错误进行的缓冲区溢出攻击。与当前比较好的空间内存错误检测方法 Soft Bound相比,EBound有更低的性能开销。

基于信号飞行时间与误差分析的改进无线传感网络Bounding-box定位算法

为提高无线传感网络定位算法的实效性,针对Bounding-box定位算法定位精度不足的问题,提出了基于信号飞行时间与误差分析的改进Bounding-box定位算法。该算法根据累计距离误差,在正方形重叠区域重新划分离散小方格,然后按照累计距离误差最小化准则,选择对应离散小方格的中心点坐标作为待定位节点的定位位置。通过仿真实验表明,提出的改进Bounding-box定位算法,在距离测量精确和小误差情况下,能够明显提高定位精度。此外,真实环境实验表明,在采用信号飞行时间作为距离测量技术的条件下,提出算法的定位误差最小。

Ellipsoidal bounding set-membership identification approach for robust fault diagnosis with application to mobile robots

A robust fault diagnosis approach is developed by incorporating a set-membership identification (SMI) method. A class of systems with linear models in the form of fault related parameters is investigated, with model uncertainties and parameter variations taken into account explicitly and treated as bounded errors. An ellipsoid bounding set-membership identification algorithm is proposed to propagate bounded uncertainties rigorously and the guaranteed feasible set of faults parameters enveloping true parameter values is given. Faults arised from abrupt parameter variations can be detected and isolated on-line by consistency check between predicted and observed parameter sets obtained in the identification procedure. The proposed approach provides the improved robustness with its ability to distinguish real faults from model uncertainties, which comes with the inherent guaranteed robustness of the set-membership framework. Efforts are also made in this work to balance between conservativeness and computation complexity of the overall algorithm. Simulation results for the mobile robot with several slipping faults scenarios demonstrate the correctness of the proposed approach for faults detection and isolation (FDI).

Using self-location to calibrate the errors of observer positions for source localization

The uncertainty of observers＇ positions can lead to significantly degrading in source localization accuracy. This pa-per proposes a method of using self-location for calibrating the positions of observer stations in source localization to reduce the errors of the observer positions and improve the accuracy of the source localization. The relative distance measurements of the two coordinative observers are used for the linear minimum mean square error （LMMSE） estimator. The results of computer si-mulations prove the feasibility and effectiveness of the proposed method. With the general estimation errors of observers＇ positions, the MSE of the source localization with self-location calibration, which is significantly lower than that without self-location calibra-tion, is approximating to the Cramer-Rao lower bound （CRLB）.

THE CRUCIAL CONSTANTS IN THE EXPONENTIAL-TYPE ERROR ESTIMATES FOR GAUSSIAN INTERPOLATION

It＇s well-known that there is a very powerful error bound for Gaussians put forward by Madych and Nelson in 1992. It＇s of the form｜f（x） - s（x）｜≤（Cd）c/d｜｜f｜｜h where C, c are constants, h is the Gaussian function, s is the interpolating function, and d is called fill distance which, roughly speaking, measures the spacing of the points at which interpolation occurs. This error bound gets small very fast as d → 0. The constants C and c are very sensitive. A slight change of them will result in a huge change of the error bound. The number c can be calculated as shown in [9]. However, C cannot be calculated, or even approximated. This is a famous question in the theory of radial basis functions. The purpose of this paper is to answer this question.

BOUNDED TRAVELING WAVE SOLUTIONS OF VARIANT BOUSSINESQ EQUATION WITH A DISSIPATION TERM AND DISSIPATION EFFECT

This article studies bounded traveling wave solutions of variant Boussinesq equation with a dissipation term and dissipation effect on them. Firstly, we make qualitative analysis to the bounded traveling wave solutions for the above equation by the theory and method of planar dynamical systems, and obtain their existent conditions, number, and general shape. Secondly, we investigate the dissipation effect on the shape evolution of bounded traveling wave solutions. We find out a critical value r^＊ which can characterize the scale of dissipation effect, and prove that the bounded traveling wave solutions appear as kink profile waves if ｜r｜≥ r^＊; while they appear as damped oscillatory waves if ｜r｜ 〈 r^＊. We also obtain kink profile solitary wave solutions with and without dissipation effect. On the basis of the above discussion, we sensibly design the structure of the approximate damped oscillatory solutions according to the orbits evolution relation corresponding to the component u（ξ） in the global phase portraits, and then obtain the approximate solutions （u（ξ）, H（ξ））. Furthermore, by using homogenization principle, we give their error estimates by establishing the integral equation which reflects the relation between exact and approximate solutions. Finally, we discuss the dissipation effect on the amplitude, frequency, and energy decay of the bounded traveling wave solutions.

Double sampling derivatives and truncation error estimates

This paper investigates double sampling series derivatives for bivariate functions defined on R2 that are in the Bernstein space. For this sampling series, we estimate some of the pointwise and uniform bounds when the function satisfies some decay conditions. The truncated series of this formula allow us to approximate any order of partial derivatives for function from Bernstein space using only a finite number of samples from the function itself. This sampling formula will be useful in the approximation theory and its applications, especially after having the truncation error well-established. Examples with tables and figures are given at the end of the paper to illustrate the advantages of this formula.

Safe Bounds in Semidefinite Programming by Using Interval Arithmetic

Efficient solvers for optimization problems are based on linear and semidefinite relaxations that use floating point arithmetic. However, due to the rounding errors, relaxation thus may overestimate, or worst, underestimate the very global optima. The purpose of this article is to introduce an efficient and safe procedure to rigorously bound the global optima of semidefinite program. This work shows how, using interval arithmetic, rigorous error bounds for the optimal value can be computed by carefully post processing the output of a semidefinite programming solver. A lower bound is computed on a semidefinite relaxation of the constraint system and the objective function. Numerical results are presented using the SDPA (SemiDefinite Programming Algorithm), solver to compute the solution of semidefinite programs. This rigorous bound is injected in a branch and bound algorithm to solve the optimisation problem.