hypercube造句
1. In this paper, the wide-diameter of generalized hypercube is proved in two ways whose difference is to use mathematical induction and constructing method to prove the inequation (1) .
2. The Latin hypercube method was used to represent the uncertainty surrounding the input parameters.
3. Comparative study on random sampling and Latin hypercube sampling with and without variance reduction techniques is carried out to a number of different limit state functions.
4. The generalized Hypercube is an important network topology for parallel processing computer system.
5. Hypercube multi - computers system is of good performance in parallel distributed computation.
6. According to the tree structure, the hypercube is formed hierarchically./hypercube.html
7. Parallel fault tolerant routing algorithms in hypercube networks with a large number of faulty nodes are studied.
8. The crossed cube is a variant of the hypercube, and it has better recursive structure, graph parameters and topological properties.
9. Hypercube network is one of the most important and attractive network topologies so far.
10. The hypercube and its variations are a kind of interconnected networks model with better structure properties and network parameters, so it is favorite in research of interconnection.
11. Based on the weak connectivity of hypercube model, a layered framework is presented for key-sharing connectivity, and a node's localized searching algorithm is proposed.
12. A practicable hypercube multi-microprocessor system design is presented with more details of its communication control board.
13. Their architecture is quite different from that of parallel machines such as the hypercube.
14. The application results of the improved algorithm are verified by searching Latin hypercube optimal design of varying scales under different optimization criteria.
15. This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.
16. This paper discusses the parallel FFT algorithm on the hypercube architecture. Based on the analysis of the communication complexity, the speedup of the algorithm is derived.
17. We develop efficient unicast, broadcast and parallel routing algorithms on locally connected hypercube networks.
18. Some measurements such as the shortest path, diameter, average distance and network average distance are analyzed to evaluate the transmission delay of the hypercube network and crossed cube network.
19. Because of the limitation the former control topologies usually have, people proposed HyperCube and researching widely on it.
20. The paper demonstrates its hardware system structure, and points out that hypercube is the superior of array computer topologies.
21. Based on the conception of LIP and RSC, this paper proposed an efficient unicast fault-tolerant routing algorithm for hypercube networks.
22. Several topologies have been designed and tested, including the interconnection of nodes in a hypercube configuration, similar to the way nodes are interconnected in a mesh network.
23. To reduce sampling number and assure simulation precision, Importance Sampling method and Latin Hypercube Sampling method are coupled with Neumann expansion SFEM respectively.
24. Comparing with the ring or the mesh architecture, the parallel FFT algorithm on the hypercube is found to have better performances.
25. Moreover, very few researches on load balancing can be found on the hypercube networks.