Many organizations maintain identity information for their customers, vendors, and employees, etc. However, identities being compromised cannot be retrieved effectively. In this paper we first present a case study on identity problems existing in a local police department. The study show that more than half of the sampled suspects have altered identities existing in the police information syste...

In this paper, we investigate the distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from some convex sets, where each set is only associated with one agent. To deal with the optimization problem with projection uncertainties, we propose a distributed continuous-time dynamical protocol based on a new concept ...

We state an approximate controllability result for the bilinear Schrödinger equation in the case in which the uncontrolled Hamiltonian has discrete non-resonant spectrum. This result applies both to bounded or unbounded domains and to the case in which the control potential is bounded or unbounded. In addition we get some controllability properties for the density matrix. Finally we show, by me...

and assume that the conditions of the Lax-Milgram lemma are satisfied so that (5.1) admits a unique solution u ∈ V . We assume that H is a null sequence of positive real numbers and (Vh)h∈H an associated family of conforming finite element spaces Vh ⊂ V, h ∈ H. We approximate the bilinear form a(·, ·) : V × V → lR and the functional `(·) : V → lR in (5.1) by bounded bilinear forms and bounded l...

In this article, we consider a stochastic PDE of parabolic type, driven by a space-time white-noise, and its numerical discretization in time with a semi-implicit Euler scheme. When the nonlinearity is assumed to be bounded, then a dissipativity assumption is satisfied, which ensures that the SDPE admits a unique invariant probability measure, which is ergodic and strongly mixing with exponenti...

We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on

A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.