Results 11 to 20 of about 4,538 (226)
Improved fault-tolerant sorting algorithm in hypercubes
Consider M unsorted elements and an n-dimensional hypercube Hn with ⌊3n/2⌋−1 faulty nodes, where M⪢N=2n. Employing a newly proposed partition strategy and the light-occupied dimension concept, this paper improves Sheu et al.'s algorithm [Sheu, Chen ...
Yu-Wei Chen, K. Chung
semanticscholar +2 more sources
Fault-tolerant communication with partitioned dimension-order routers [PDF]
The current fault-tolerant routing methods require extensive changes to practical routers such as the Cray T3D's dimension-order router to handle faults. In this paper, we propose methods to handle faults in multicomputers with dimension-order routers with simple changes to router structure and logic.
Rajendra V. Boppana, Suresh Chalasani
openaire +1 more source
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks [PDF]
A set of vertices S ⊆ V (G) is a resolving set of a graph G if for each x, y ∈ V (G) there is a vertex u ∈ S such that d(x, u) 6= d(y, u). A resolving set S is a fault-tolerant resolving set if S \ {x} is a resolving set for every x ∈ S.
S. Prabhu +3 more
semanticscholar +1 more source
To extract fault features of rolling bearing vibration signals precisely, a fault diagnosis method based on parameter optimized multi-scale permutation entropy (MPE) and Gath-Geva (GG) clustering is proposed.
Shaopu Yang +3 more
core +1 more source
All metric bases and fault-tolerant metric dimension for square of grid
Summary: For a simple connected graph G = ( V, E ) and an ordered subset W = { w 1 , w 2 , . . . , w k } of V , the code of a vertex v ∈ V , denoted by code( v ) , with respect to W is a k -tuple ( d ( v, w 1 ) , . . . , d ( v, w k )) , where d ( v, w t )
L. Saha +2 more
semanticscholar +1 more source
Fault-tolerant edge metric dimension of certain families of graphs
Let $W_E=\{w_1,w_2, \ldots,w_k\}$ be an ordered set of vertices of graph $G$ and let $e$ be an edge of $G$. Suppose $d(x,e)$ denotes distance between edge $e$ and vertex $x$ of $G$, defined as $d(e,x) = d(x,e) = \min \{d(x,a),d(x,b)\}$, where $e=ab$.
Xiaogang Liu +3 more
semanticscholar +1 more source
Fault-Tolerant Metric Dimension of Cube of Paths
For a simple connected graph G = (V (G), E(G)), a set R ⊆ V (G) is said to be a resolving set of G if every pair of vertices of G are resolved by some vertices in R i.e., every pair of vertices of G are identified uniquely by some vertex elements in F. A
L. Saha
semanticscholar +1 more source
Metric and Fault-Tolerant Metric Dimension of Hollow Coronoid
Coronoid systems actually arrangements of hexagons into six sides of benzenoids. By nature, it is an organic chemical structure. Hollow coronoids are primitive and catacondensed coronoids. It is also known as polycyclic conjugated hydrocarbons.
Ali N. A. Koam +3 more
semanticscholar +1 more source
Temperatures in ambient mantle and plumes: Constraints from basalts, picrites, and komatiites [PDF]
Several methods have been developed to assess the thermal state of the mantle below oceanic ridges, islands, and plateaus, on the basis of the petrology and geochemistry of erupted lavas. One leads to the conclusion that mantle potential temperature (i.e.
Lesher, C. M. +25 more
core +1 more source
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source

