Abstract An ordered set S of vertices a graph G is resolving for if every vertex uniquely determined by its vector distances to the in . The metric dimension minimum cardinality set. In this paper we study sets tolerant several failures three-dimensional grids. Concretely, seek that are after removing any k from This equivalent finding $$(k+1)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/...

Recent research in brain development and cognitive development leads to an apparent paradox. One set of recent experiments suggests that infants are well-endowed with sophisticated mechanisms for analyzing the world; another set of recent experiments suggests that brain development is extremely flexible. In this paper, I review various ways of resolving the implicit tension between the two, and...

The metric dimension problem was first introduced in 1975 by Slater [12], and independently by Harary and Melter [6] in 1976; however the problem for hypercube was studied (and solved asymptotically) much earlier in 1963 by Erdős and Rényi [4]. A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G...

We introduce the concept of weighted rules under the stable model semantics following the log-linear models of Markov Logic. This provides versatile methods to overcome the deterministic nature of the stable model semantics, such as resolving inconsistencies in answer set programs, ranking stable models, associating probability to stable models, and applying statistical inference to computing w...

Wagner 10] introduced the Integer Circuit Evaluation problem. Informally , the problem concerns a circuit that takes singleton sets, each containing one integer, and combines them using three types of set operations: The problem is to determine whether the set output by the circuit contains a particular integer. In this paper we show that the Integer Circuit problem is PSPACE-complete, resolvin...

Inductive Loops are widely used in California for traffic detection and monitoring. Extensive studies have been conducted to improve loop detection system performance. This paper reviews previous work on faulty loop data analysis for correction and faulty loop diagnosis. It is necessary to distinguish faulty loop data analysis and loop fault detection according to the data level. According to t...

We study the multi-agent path finding problem (MAPF) for a group of agents which are allowed to move into arbitrary directions on a 2D square grid. We focus on centralized conflict resolution for independently computed plans. We propose an algorithm that eliminates conflicts by using local re-planning and introducing time offsets to the execution of paths by different agents. Experimental resul...

H junction-resolving enzymes are metal ion-dependent endonucleases that recognize and cleave four-way DNA junctions arising during recombination (reviewed in ref. 1). Examples include RuvC in eubacteria (2, 3), Cce1 in fungal mitochondria (4), Hjc in archaea (5, 6), and three enzymes in bacteriophage [RusA (7), T4 endonuclease VII (8), and T7 endonuclease I (9, 10)]. These six nucleases display...