http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Kernel Reference Set and Its Computation Algorithm
Ding-Yuan Bian,Qi-Wei Ge,Qian Zhu,Qian-Ming Shao 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
This paper proposes a new concept of graphs: kernel reference set. A kernel reference set is a fraction of vertices in a graph such that if their positions are known, positions of all other vertices can be derived from information of the distance matrix. We present an algorithm to find kernel reference set of graphs. Because the problem of kernel reference set is firstly proposed in this paper, and the theoretical limit of computation complexity is unknown currently. So we implement our algorithm with C to do the simulation. From simulation results, we verified the validity of our algorithm and evaluate its performance. Inspired by anchor nodes in wireless sensor networks, kernel reference set could be used to analyze anchorbased localization schemes of WSNs applications such as coalmine security monitoring, etc.