This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. One of the key difficulties in this context is to design scalable algorithms for incremental fusion of information across platforms robust to what is known as the “rumor problem”. Incremental fusion is in general based on a...

We consider the following problem: minx∈Rn min‖E‖≤η ‖(A+E)x− b‖, where A is an m×n real matrix and b is an n-dimensional real column vector when it has multiple global minima. This problem is an errors-in-variables problem, which has an important relation to total least squares with bounded uncertainty. A computable condition for checking if the problem is degenerate as well as an efficient alg...

This communication presents a new approach to blind equalization of a FIR channel. It is based on a boundederror assumption and takes into account the fact that the input signal is in a nite alphabet. We show that even in the noisy case, identi ability can be guaranteed in nite time, provided that the support of the noise density is suitably bounded.

In this survey paper we present an iterative method to analyze linear programming formulations for combinatorial optimization problems. This method is introduced by Jain to give a 2-approximation algorithm for the survivable network design problem. First we will present Jain’s method and the necessary background including the uncrossing technique in Section 2. Then we extend the iterative metho...

In this paper we try to put different practical aspects of the general linear methods discussed in the papers [1,6,7] under one algorithm to show more details of its implementation. With a proposed initial step size strategy this algorithm shows a better performance in some problems. To illustrate the efficiency of the method we consider some standard test problems and report more useful detail...

Location data becomes more and more important. In this paper, we focus on the trajectory data, and propose a new framework, namely PRESS (Paralleled Road-Network-Based Trajectory Compression), to effectively compress trajectory data under road network constraints. Different from existing work, PRESS proposes a novel representation for trajectories to separate the spatial representation of a tra...

In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different tools from the inverse problem literature and the machine learning community. ...

In this study, an observer-based tracking controller is proposed and evaluatedexperimentally to solve the trajectory tracking problem of robotic manipulators with the torque saturationin the presence of model uncertainties and external disturbances. In comparison with the state-of-the-artobserver-based controllers in the literature, this paper introduces a saturated observer-based controllerbas...

We consider the binary-LWE problem, which is the learning with errors problem when the entries of the secret vector are chosen from {0, 1} or {−1, 0, 1} (and the error vector is sampled from a discrete Gaussian distribution). Our main result is an improved lattice decoding algorithm for binary-LWE which first translates the problem to the inhomogeneous short integer solution (ISIS) problem, and...

The Learning with Errors problem (LWE) is one of the most important hardness assumptions latticebased constructions base their security on. Recently, Albrecht et al. (Journal of Mathematical Cryptology, 2015) presented the software tool LWE-Estimator to estimate the hardness of concrete LWE instances, making the choice of parameters for lattice-based primitives easier and better comparable. To ...