Related papers: Node Failure Localization: Theorem Proof

This paper introduces an algorithm able to detect and localize the occurrance of a fault in an Active Distribution Network, using the measurements collected by Phasor Measurement Units (PMUs). First, a basic algorithm that works under the…

This paper addresses the distributed localization problem for a network of sensors placed in a three-dimensional space, in which sensors are able to perform range measurements, i.e., measure the relative distance between them, and exchange…

As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology…

In this article we give a totally new proof of the integral localization formula for equivariantly closed differential forms (Theorem 7.11 in [BGV]). We restate it here as Theorem 2. This localization formula is very well known, but the…

This paper comments on the published work dealing with robustness and regularization of support vector machines (Journal of Machine Learning Research, vol. 10, pp. 1485-1510, 2009) [arXiv:0803.3490] by H. Xu, etc. They proposed a theorem to…

Deep neural networks (DNNs) are shown to be promising solutions in many challenging artificial intelligence tasks. However, it is very hard to figure out whether the low precision of a DNN model is an inevitable result, or caused by…

Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probability of existence. In this paper, we investigate the novel and…

The purpose of this note is to highlight and address inaccuracies in the convergence guarantees of SCvx, a nonconvex trajectory optimization algorithm proposed by Mao et al. (arXiv:1804.06539), and make connections to relevant prior work.…

Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet. Also, these node failures are usually transient. Consequently, having the routing paths globally recomputed…

This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem.…

Nowadays it is not uncommon to have to deal with dissemination on multi-layered networks and often finding the source of said propagation can be a crucial task. In this paper we tackle this exact problem with a maximum likelihood approach…

This note points out a gap in the proof of the main theorem of the article "Birationally rigid hypersurfaces" published in Invent. Math. 192 (2013), 533-566, and provides a new proof of the theorem.

In the recent paper [J. Funct. Anal. {\bf 259} (2010)], Naor and Tao introduce a new class of measures with a so-called micro-doubling property and present, via martingale theory and probability methods, a localization theorem for the…

This paper focuses on target localization in a widely distributed multiple-input-multiple-output (MIMO) radar system. In this system, range measurements, which include the sum of distances between transmitter and target and the distances…

Efficient structural damage localization remains a challenge in structural health monitoring (SHM), particularly when the problem is coupled with uncertainty of conditions and complexity of structures. Traditional methods simply based on…

We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the…

Underground cable power transmission and distribution system are susceptible to faults. Accurate fault location for transmission lines is of vital importance. A quick detection and analysis of faults is necessity of power retailers and…

Manfred Stelzer has pointed out that part of Corollary 4.5 of our paper "Topological nonrealization results via the Goodwillie tower approach to iterated loopspace homology" [Alg. Geo. Top. 8 (2008), 2109--2129] was not sufficiently proved,…

Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding…

We elucidate the different mechanisms of wave localisation in disordered finite systems of subwavelength resonators, where the disorder is in the spatial arrangement of the resonators. To do so, we employ the capacitance matrix formalism…