Uncertainty quantification is the state-of-the-art framework dealing with uncertainties arising in all kind of real-life problems. One of the framework’s functions is to propagate uncertainties from the stochastic input factors to the output quantities of interest, hence the name uncertainty propagation. To this end, polynomial chaos expansions (PCE) have been effectively used in a wide variety...

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...

This paper introduces the algorithm on SAR image orthorectification based on polynomial rectification and height displacement correction, and experiments according to the algorithm on ERS-2, RADARSAT, and airborne SAR image in mountain area. Many factors result in SAR image distortion, and most of them can be corrected by polynomial rectification. But the distortion of SAR image brought by elev...

Our main objective is to consider a concept of nonuniform behavior and obtain appropriate versions of the well-known stability due to R. Datko and L. Barbashin. This concept has been considered in the works of L. Barreira and C. Valls. Our approach is based on the extension of techniques for exponential stability to the case of polynomial stability. 2000 Mathematics Subject Classification: 34D0...

In this work we present a new method to compute the delays of delay differential equations (DDEs), such that the DDE has a purely imaginary eigenvalue. For delay differential equations with multiple delays, the critical curves or critical surfaces in delay space (that is, the set of delays where the DDE has a purely imaginary eigenvalue) are parameterized. We show how the method is related to o...

In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not only have high complexity, but also provide no simple proof of unsatisfiability. Recently, a reduction of this problem to semidefinite programming and numeri...

Classical Volterra and Wiener theory of nonlinear systems does not address the problem of noisy measurements in system identification. This issue is treated in the present part of the report. We first show how to incorporate the implicit estimation technique for Volterra and Wiener series described in Part I into the framework of regularised estimation without giving up the orthogonality proper...

This report presents a faster version of the polynomial recursive orthogonalization (PRO) algorithm, which is used in segmented image coding to generate orthonormal base functions on a non-rectangular discrete image. It shows that up to 25% of the oating point operations can be eliminated by using previously computed results; also, some orthogonalizations can be avoided altogether, because they...

This study concerns numerical simulation, modeling and optimization of aerodynamic stall control using a synthetic jet actuator. Thenumerical simulation was carried out by a large-eddy simulation that employs a RNG-based model as the subgrid-scale model. The flow around a NACA0015 airfoil, including a synthetic jet located at 10 % of the chord, is studied under Reynolds number Re = 12.7 × 106 a...