Results 1 to 10 of about 21,616 (213)
Some of the next articles are maybe not open access.

A Survey of Fault Diagnosis and Fault-Tolerant Techniques—Part I: Fault Diagnosis With Model-Based and Signal-Based Approaches

IEEE Transactions on Industrial Electronics, 2015
Zhiwei Gao   +2 more
exaly  

Novel Neural Networks-Based Fault Tolerant Control Scheme With Fault Alarm

IEEE Transactions on Cybernetics, 2014
Qikun Shen, Bin Jiang, Peng Shi
exaly  

Active Fault-Tolerant Control System Design for Spacecraft Attitude Maneuvers with Actuator Saturation and Faults

IEEE Transactions on Industrial Electronics, 2019
Qiang Shen   +2 more
exaly  

Optimal Fault-Tolerant Resolving Set of Power Paths

open access: yesMathematics, 2023
In a simple connected undirected graph G, an ordered set R of vertices is called a resolving set if for every pair of distinct vertices u and v, there is a vertex w∈R such that d(u,w)≠d(v,w).
Laxman Saha   +4 more
doaj   +4 more sources

On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks

open access: yesComplexity, 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
doaj   +2 more sources

Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure. [PDF]

open access: yesPLoS 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   +2 more sources

Optimal Multi-Level Fault-Tolerant Resolving Sets of Circulant Graph C(n : 1, 2)

open access: yesMathematics, 2023
Let G=(V(G),E(G)) be a simple connected unweighted graph. A set R⊂V(G) is called a fault-tolerant resolving set with the tolerance level k if the cardinality of the set Sx,y={w∈R:d(w,x)≠d(w,y)} is at least k for every pair of distinct vertices x,y of G ...
Laxman Saha   +4 more
doaj   +2 more sources

Fault-Tolerant Metric Dimension of Circulant Graphs

open access: yesMathematics, 2022
Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha   +4 more
doaj   +3 more sources

Fault-tolerance in metric dimension of boron nanotubes lattices [PDF]

open access: yesFrontiers in Computational Neuroscience, 2023
The concept of resolving set and metric basis has been very successful because of multi-purpose applications both in computer and mathematical sciences.
Zafar Hussain, Muhammad Mobeen Munir
doaj   +2 more sources

Home - About - Disclaimer - Privacy