Results 41 to 50 of about 8,830,736 (317)
Resolving sets tolerant to failures in three-dimensional grids [PDF]
Mediterranean Journal of Mathematics, 2021 An ordered set S of vertices of a graph G is a resolving set for G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set.
M. Mora +2 more
semanticscholar +1 more source
Progress toward resolving the attentional capture debate
Visual Cognition, 2020 For over 25 years, researchers have debated whether physically salient stimuli capture attention in an automatic manner, independent of the observer’s goals, or whether the capture of attention depends on the match between a stimulus and the observer’s ...
S. Luck +4 more
semanticscholar +1 more source
Resolvent Estimates for Normally Hyperbolic Trapped Sets [PDF]
Annales Henri Poincaré, 2011 Further changes to erratum correcting small problems with Section 3.5 and Lemma 4.1; this now also corrects hypotheses, explicitly requiring trapped set to be symplectic.
Wunsch, Jared, Zworski, Maciej
openaire +2 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure.
PLoS ONE, 2023 The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin +4 more
doaj +1 more source
On the Minimum Differentially Resolving Set Problem for Diffusion Source Inference in Networks
AAAI Conference on Artificial Intelligence, 2016 In this paper we theoretically study the minimum Differentially Resolving Set (DRS) problem derived from the classical sensor placement optimization problem in network source locating.
Chuan Zhou +5 more
semanticscholar +1 more source
Restrained 2-Resolving Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
semanticscholar +1 more source
Limit sets of stable Cellular Automata [PDF]
, 2013 We study limit sets of stable cellular automata standing from a symbolic dynamics point of view where they are a special case of sofic shifts admitting a steady epimorphism.
Alexis Ballier, Santiago Chile
core +1 more source
Coloring Cantor sets and resolvability of pseudocompact spaces [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2019 Let us denote by $ ( , )$ the statement that $\mathbb{B}( ) = D( )^ $, i.e. the Baire space of weight $ $, has a coloring with $ $ colors such that every homeomorphic copy of the Cantor set $\mathbb{C}$ in $\mathbb{B}( )$ picks up all the $ $ colors. We call a space $X\,$ {\em $ $-regular} if it is Hausdorff and for every non-empty open set $
Juhász, István +2 more
openaire +3 more sources
On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks
Complex, 2021 In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. In localization, some special vertices (resolving sets) are selected to locate the position of all vertices in a computer network. If an
Hua Wang +4 more
semanticscholar +1 more source
Resolving Transition Metal Chemical Space: Feature Selection for Machine Learning and Structure-Property Relationships. [PDF]
Journal of Physical Chemistry A, 2017 Machine learning (ML) of quantum mechanical properties shows promise for accelerating chemical discovery. For transition metal chemistry where accurate calculations are computationally costly and available training data sets are small, the molecular ...
J. Janet, Heather J. Kulik
semanticscholar +1 more source