In this paper w e study distributed position estimation for sensor net w orks.The fundamentals of distributed position estimation algorithms are presented. Two types of ellipsoid outer-approximation algorithms are employed to estimate the positions of unknown sensors. P olytopeouter-approximation algorithm is also investigated. Numerical experiments demonstrate the e ectiveness of the algorithm...

It was recently shown in [12] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) feasibility constraints and independent additive bidders with arbitrary (possibly combinatorial) demand constraints. This reduction provides a poly-time solution to the optimal mechan...

We propose a build-up interior-point method for solving an m equation n variable linear program which has the same convergence properties as its well known analogue Dikin's algorithm in dual aane form but may require less computational eeort. It diiers from Dikin's algorithm in that the ellipsoid chosen to generate the improving direction in dual space is constructed from only a subset of the d...

This paper introduces a finite-time algorithm which allows a hybrid system to determine whether or not a specified symbolic behaviour can be realized by the system. The proposed algorithm is an inductive inference protocol based on the ellipsoid method. I t can be viewed as a means by which the hybrid system can autonomously set its achievable goal behaviour. This ability for goal self-determin...

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle calls is bounded by a polynomial in the size of the underlying set.

This paper suggests an optimized algorithm for computer based field strength and coverage predicting tools. This algorithm is intended for network planning software and focuses on the calculation stages of the diffraction loss caused by multiple edgeknife obstruction of the first Fresnel ellipsoid. The results presented here have been obtained by comparison between former software implementatio...

Corresponding to each origin-symmetric convex (or more general) subset of Euclidean n-space R, there is a unique ellipsoid with the following property: The moment of inertia of the ellipsoid and the moment of inertia of the convex set are the same about every 1-dimensional subspace ofR. This ellipsoid is called the Legendre ellipsoid of the convex set. The Legendre ellipsoid and its polar (the ...

This technical report presents a fault detection and accomodation algorithm for continuous-time linear state feedback control systems with bounded input disturbances and bounded structured model uncertainty. Faults are declared when the system's observed state and state derivatives are inconsistent with a speciied level of bounded amplitude performance. Faults are accomodated by using the ellip...