A Recursive Procedure for Designing Optimal d-Matched Digraphs
スポンサーリンク
概要
- 論文の詳細を見る
We define a d-matched digraph and propose a recursive procedure for designing an optimal d-matched digraph without bidirectional edges. The digraph represents an optimal highly structured system which is a special class of self-diagnosable systems and identifies all of the faulty units independently and locally in O(|E|) time complexity. The procedure is straightforward and gives a system flexible in netwurk connections. Hence the procedure is applicable to real systems such as the Internet or cooperative robotic systems which change their topology dynamically.
- 2003-05-01
著者
-
Kohda Tohru
Department Of Computer Science And Communication Engineering Faculty Of Information Science And Elec
-
Sujaku Yasumasa
Faculty Of Engineering Kurume Institute Of Technology
-
YOSHIDA Kiyoaki
Faculty of Engineering, Kurume Institute of Technology
-
Yoshida Kiyoaki
Faculty Of Engineering Kurume Institute Of Technology
関連論文
- Disorder Parameter for Chaos
- Code Acquisition in Asynchronous DS/CDMA Systems
- Code Acquisition in Asynchronous DS/CDMA Systems
- Code Acquisition in Asynchronous DS/CDMA Systems
- Code Acquisition in Asynchronous DS/CDMA Systems
- Code Acquisition in Asynchronous DS/CDMA Systems
- Low-Complexity Code Acquisition Method in DS/CDMA Communication Systems : Application of the Maximum Likelihood Method to Propagation Delay Estimation
- Chaotic Binary Sequences with Their Applications to Communications
- Correlated Behaviour of Logistic Chaotic Sequences
- A Recursive Procedure for Designing Optimal d-Matched Digraphs
- Construction of a Piecewise Linear One-Dimensional Map Generating an Arbitrary Prescribed Tree Source(Nonlinear Theory and its Applications)
- Code Acquisition in DS/CDMA Systems by Employing a Detector Based on a posteriori Probability Calculation(Wireless Communication Technologies)
- Reduction of MAI in Asynchronous DS/CDMA Systems Using Post-Filter(Nonlinear Theory and its Applications)
- Large Deviation for Chaotic Binary Sequences Generated by Nonlinear Maps and Threshold Functions(Stochastic Process)(Information Theory and Its Applications)
- Kalman's Recognition of Chaotic Dynamics in Designing Markov Information Sources (Special Section on Nonlinear Theory and Its Applications)
- Cross Correlation Matrices for Multiuser Chip-Asynchronous DS/CDMA Systems(情報通信基礎サブソサイエティ合同研究会)
- Cross Correlation Matrices for Multiuser Chip-Asynchronous DS/CDMA Systems(情報通信基礎サブソサイエティ合同研究会)
- Variance of Average Interference Parameter for LFSR and Random Markov Codes
- Cross Correlation Matrices for Multiuser Chip-Asynchronous DS/CDMA Systems(情報通信基礎サブソサイエティ合同研究会)
- A Method for Evaluating Randomness of Random Sequence Based on Perron-Frobenius Operator(Some Problems on the Theory of Dynamical Systems in Applied Sciences)
- I.I.D. Chaotic Binary Sequences