Ethernet fundamental and its data transmission model are introduced in brief and end-to-end network latency was analyzed in this paper. On the premise of not considering transmission quality and transmission cost, lat...Ethernet fundamental and its data transmission model are introduced in brief and end-to-end network latency was analyzed in this paper. On the premise of not considering transmission quality and transmission cost, latency was the function of the rest of network resource parameter (NRP). The relation between the number of nodes and that of end-to-end links was presented. In ethernet architecture, the algorithm to determine the link with the smallest latency is a polynomial issue when the number of network nodes is limited, so it can be solved by way of polynomial equations. Latency measuring is the key issue to determine the link with the smallest network latency. 3-node brigade (regiment) level network centric warfare (NCW) demonstration platform was studied and the latency between the detectors and weapon control stations was taken as an example. The algorithm of end-to-end network latency and link information in NCW was presented. The algorithm program based on Server/Client architecture was developed. The data transmission optimal link is one whose end-to-end latency is the smallest. This paper solves the key issue to determine the link whose end-to-end latency is the smallest in ethernet architecture. The study can be widely applied to determine the optimal link which is in the complex network environment of multiple service provision points.展开更多
In this paper the structure-based test generation algorithm has been studied for the problem that test patterns are obtained by determined finite faults set in the past. This Algorithm can find out all test patterns o...In this paper the structure-based test generation algorithm has been studied for the problem that test patterns are obtained by determined finite faults set in the past. This Algorithm can find out all test patterns one tithe, so faults detection is very convenient. By simulation, the smallest test patterns set can be obtained and faults coverage rate is 100%.展开更多
The main purpose of this paper is to consider the Perron pair of an irreducible and symmetric nonnegative tensor and the smallest eigenvalue of an irreducible and symmetric nonsingular M-tensor.We analyze the analytic...The main purpose of this paper is to consider the Perron pair of an irreducible and symmetric nonnegative tensor and the smallest eigenvalue of an irreducible and symmetric nonsingular M-tensor.We analyze the analytical property of an algebraic simple eigenvalue of symmetric tensors.We also derive an inequality about the Perron pair of nonnegative tensors based on plane stochastic tensors.We finally consider the perturbation of the smallest eigenvalue of nonsingular M-tensors and design a strategy to compute its smallest eigenvalue.We verify our results via random numerical examples.展开更多
基金Sponsored by Grand Preresearch Project Foundation of General Armament Department of the CPLAin the Tenth Five-year Plan (Grant No41306020202)the National Natural Science Foundation of China(Grant No60672150)
文摘Ethernet fundamental and its data transmission model are introduced in brief and end-to-end network latency was analyzed in this paper. On the premise of not considering transmission quality and transmission cost, latency was the function of the rest of network resource parameter (NRP). The relation between the number of nodes and that of end-to-end links was presented. In ethernet architecture, the algorithm to determine the link with the smallest latency is a polynomial issue when the number of network nodes is limited, so it can be solved by way of polynomial equations. Latency measuring is the key issue to determine the link with the smallest network latency. 3-node brigade (regiment) level network centric warfare (NCW) demonstration platform was studied and the latency between the detectors and weapon control stations was taken as an example. The algorithm of end-to-end network latency and link information in NCW was presented. The algorithm program based on Server/Client architecture was developed. The data transmission optimal link is one whose end-to-end latency is the smallest. This paper solves the key issue to determine the link whose end-to-end latency is the smallest in ethernet architecture. The study can be widely applied to determine the optimal link which is in the complex network environment of multiple service provision points.
文摘In this paper the structure-based test generation algorithm has been studied for the problem that test patterns are obtained by determined finite faults set in the past. This Algorithm can find out all test patterns one tithe, so faults detection is very convenient. By simulation, the smallest test patterns set can be obtained and faults coverage rate is 100%.
基金the National Natural Science Foundation of China(No.11271084)International Cooperation Project of Shanghai Municipal Science and Technology Commission(No.16510711200).
文摘The main purpose of this paper is to consider the Perron pair of an irreducible and symmetric nonnegative tensor and the smallest eigenvalue of an irreducible and symmetric nonsingular M-tensor.We analyze the analytical property of an algebraic simple eigenvalue of symmetric tensors.We also derive an inequality about the Perron pair of nonnegative tensors based on plane stochastic tensors.We finally consider the perturbation of the smallest eigenvalue of nonsingular M-tensors and design a strategy to compute its smallest eigenvalue.We verify our results via random numerical examples.
