In this paper we examine the role of very simple and noisy sensors for tracking problem. We propose a binary sensor model, where each sensor's value is converted reliably to one bit information only: whether object moving toward or away from sensor. show that network has geometric properties can be used develop solution with present resulting algorithms simulation experiments. particle filtering style algorithm target using such minimalist sensors. an analysis fundamental limitation under...

The numerical stability of the Levinson-Durbin algorithm for solving Yule-Walker equations with a positive-definite symmetric Toeplitz matrix is studied. Arguments based on analytic results an error analysis fixed-point and floating-point arithmetics show that stable in fact comparable to Cholesky algorithm. Conflicting evidence accuracy performance explained by demonstrating underlying typically ill-conditioned most applications.

Mobile computers have become increasingly popular as users discover the benefits of having their electronic work available at all times. Using Internet resources from a mobile platform, however, is major challenge. do not permanent network connection and are often disconnected for long periods. When computer connected, prone to sudden failure, such when physical obstruction blocks signal cellular modem. In addition, performs poorly can vary dramatically one session next, since might use...

Abstract D'Agents is a general‐purpose mobile‐agent system that has been used in several information‐retrieval applications. In this paper, we first examine one such application, operational support for military field personnel, where greatly simplifies the task of providing efficient, application‐specific access to remote information resources. After describing discuss key differences between and most other systems, notably its strong mobility multiple agent languages. Finally, derive...

Most information depreciates over time, so keeping Web pages current presents new design challenges. This article quantifies what "current" means for search engines and estimates how often they must reindex the to keep with its changing structure.

The gossip problem involves communicating a unique item from each node in graph to every other node. This paper studies the minimum time required do this under weakest model of parallel communication, which allows participate just one communication at as either sender or receiver. A number topologies are studied, including omplete graph, grids, hypercubes, and rings. Definitive new optimal algorithms derived for complete graphs, rings, regular toroidal grids that significantly extend...

The training problem for feedforward neural networks is nonlinear parameter estimation that can be solved by a variety of optimization techniques. Much the literature on has focused variants gradient descent. using such techniques known to slow process with more sophisticated not always performing significantly better. This paper shows have ill-conditioned Hessians and this ill-conditioning quite common. analysis experimental results in lead conclusion many network problems are ill...

In the past three years, Perfect Benchmark TM Suite has evolved from a supercomputer performance evaluation plan, presented by Kuck and Sameh at 1987 International Conference on Supercomputing, to vigorous international activity. This paper surveys current state of this effort with particular focus adopted methodology. While there been considerable success in achieving goals some issues remain unresolved, new questions have surfaced.

QuERIES offers a novel multidisciplinary approach to quantifying risk associated with security technologies resulting in investment-efficient cybersecurity strategies. R esearchers can use the methodology rigorously determine, for first time, appropriate investment levels and strategies protection of intellectual property complex systems. As result, it have significant immediate impact on critical IP, including weapons systems chip designs, computer software, databases containing personal...

Vulnerability remediation is a critical task in operational software and network security management. In this article, an effective vulnerability management strategy, called VULCON (VULnerability CONtrol), developed evaluated. The strategy based on two fundamental performance metrics: (1) time-to-vulnerability (TVR) (2) total exposure (TVE). takes as input real scan reports, metadata about the discovered vulnerabilities, asset criticality, personnel resources. uses mixed-integer...

Quantum computations are intimately connected with unitary operators. This article shows that standard techniques from numerical linear algebra can be used to represent quantum as sequences of simple operations, called Givens operators, on single bits.

On 25 August 2000, stockholders were stunned by news that server and storage provider Emulex was revising its earnings from a per-share gain to loss, while lowering reported net the previous quarter as well. Within minutes, shares plummeted. Yet none of this fostered hacker's bogus press release - true. The case illustrates speed, scale, subtlety with which networked information can propagate how quickly severe consequences occur. This rapid dissemination, makes such cognitive hacking...

A method for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix is given. It relies solely upon Levinson–Durbin algorithm. The procedure involves combination bisection and Newton’s method. Good starting values are also shown to be obtainable from

A new orthogonalization technique is presented for computing the<italic>QR</italic>factorization of a general<inline-formula content-type="math/mathml"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n times p"><mml:semantics><mml:mrow><mml:mi>n</mml:mi><mml:mo>×<!-- × --></mml:mo><mml:mi>p</mml:mi></mml:mrow><mml:annotation encoding="application/x-tex">n \times p</mml:annotation></mml:semantics></mml:math></inline-formula>matrix full rank<inline-formula alttext="p...