In this paper, two controllers are developed for a class of MIMO nonlinear systems. First, a robust adaptive controlleris proposed and proven to yield semi-global asymptotic tracking in the presence of additive disturbances and parametricuncertainty. In addition to guaranteeing an asymptotic output tracking result, it is also proven that the parameter estimatevector is driven to...

A decisive question in nonparametric smoothing techniques is the choice of the bandwidth or smoothing parameter. The present paper addresses this question when using local polynomial approximations for estimating the regression function and its derivatives. A fully-automatic bandwidth selection procedure has been proposed by Fan and Gijbels (1995), and the empirical performance of it was tested...

In this paper, both the asymptotic stability and l1 persistent disturbance attenuation issues are investigated for a class of networked control systems (NCSs) under bounded uncertain access delay and packet dropout effects. The basic idea is to formulate such NCSs as discrete-time switched systems with arbitrary switching. Then the NCSs’ stability and performance problems can be reduced to the ...

We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension d > 1. Its asymptotic performance ratio is (Π∞) , where Π∞ ≈ 1.691 is the asymptotic ...

The paper considers one of the standard processes for modeling returns in finance, the stochastic volatility process with regularly varying innovations. The aim of the paper is to show how point process techniques can be used to derive the asymptotic behavior of the sample autocorrelation function of this process with heavy-tailed marginal distributions. Unlike other non-linear models used in f...

We present a framework in Isabelle for verifying asymptotic time complexity of imperative programs. We build upon an extension of Imperative HOL and its separation logic to include running time. In addition to the basic arguments, our framework is able to handle advanced techniques for time complexity analysis, such as the use of the Akra–Bazzi theorem and amortized analysis. Various automation...

In this work, we are concerned with the derivation of full asymptotic expansions for Fou-rier integrals R b a f ðxÞe AEisx dx as s ? 1, where s is real positive, [a, b] is a finite interval, and the functions f(x) may have different types of algebraic and logarithmic singularities at x = a and x = b. This problem has been treated in the literature by techniques involving neu-tralizers and Melli...

In this paper we consider the probabilities of finiteand infinite-time absolute ruin in the renewal risk model with constant premium rate and constant force of interest. In the particular case of compound Poisson model, explicit asymptotic expressions for the finiteand infinite-time absolute ruin probabilities are given. For the general renewal risk model, we present an asymptotic expression fo...

Plantholt and Tipnis (1991) proved that for any even integer r, a regular multigraph G with even order n, multiplicity μ(G) ≤ r and degree high relative to n and r is 1-factorable. Here we extend this result to include the case when r is any odd integer. Häggkvist and Perković and Reed (1997) proved that the One-factorization Conjecture for simple graphs is asymptotically true. Our techniques y...

By using some new analytical techniques, modified inequalities and Mawhin’s continuation theorem of coincidence degree theory, some sufficient conditions for the existence of at least one positive almost periodic solution of a kind of two-species model of facultative mutualism with time delays are obtained. Further, the global asymptotic stability of the positive almost periodic solution of thi...