This paper examines the use of gradient basedmethods for extremum seeking control of possibly infinitedimensional dynamic nonlinear systems with general attractors within a periodic sampled-data framework. First, discrete-time gradient descent method is considered and semi-global practical asymptotic stability with respect to an ultimate bound is shown. Next, under the more complicated setting ...

We show that the neighbourhood of a regular language L with respect to an additive quasi-distance can be recognized by an additive weighted finite automaton (WFA). The size of the WFA is the same as the size of an NFA (nondeterministic finite automaton) for L and the construction gives an upper bound for the state complexity of a neighbourhood of a regular language with respect to a quasi-dista...

by Qi Wang, M.S. Washington State University December 2003 Chair: Krishnamoorthy Sivakumar Preserving privacy is becoming an important issue in data mining. Random perturbation is a widely used technique to protect privacy of sensitive data values. This technique hides the true data records by modifying the data values using additive random noise, but can still estimate the data distribution fr...

The complexes HgBrO and HgClO have been previously determined by ab initio methods to be strongly bound and were suggested to be important intermediates during mercury depletions events observed in the polar troposphere. In the present work accurate near-equilibrium potential energy surfaces (PESs) of these species are reported. The PESs are determined using accurate coupled cluster methods and...

We focus primarily on the use of additive and matrix multiplicative data perturbation techniques in privacy preserving data mining (PPDM). We survey a recent body of research aimed at better understanding the vulnerabilities of these techniques. These researchers assumed the role of an attacker and developed methods for estimating the original data from the perturbed data and any available prio...

A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat both low and high rate cases in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.

We review several universal lower bounds on statistical estimation, including deterministic bounds on unbiased estimators such as Cramér-Rao bound and Barankin-type bound, as well as Bayesian bounds such as Ziv-Zakai bound. We present explicit forms of these bounds, illustrate their usage for parameter estimation in Gaussian additive noise, and compare their tightness.

The aim of this study was to determine whether the effects of alveolar distention and surfactant dysfunction on alveolocapillary barrier function are different and additive. Pulmonary clearance of aerosolized technetium-99m-labelled human serum albumin (99mTc-HSA) was used to characterize barrier function after perturbing the surfactant system with the detergent dioctyl sodium sulphosuccinate e...