We study validity and safeguard on fault tolerant routing on hypercube networks.
本文研究了超立方体网络中容错路由算法的有效性及其保障机制。
Optimal Latin hypercube experimental design method was used to produce data samples.
最佳拉丁超立方试验设计方法被用来生产数据样本。
For example, the diameter of the crossed cube is approximately half that of the hypercube.
交叉立方体的某些性质优于超立方体，比如其直径几乎是超立方体的一半。
We develop efficient unicast, broadcast and parallel routing algorithms on locally connected hypercube networks.
本文基于局部连通性网络容错模型设计了高效的单播、广播和并行容错路由算法。
The result of research shows that the best architecture of the parallel FFT algorithm is hypercube architecture.
经研究表明，并行fft算法的最佳体系结构为超立方体。
Parallel fault tolerant routing algorithms in hypercube networks with a large number of faulty nodes are studied.
研究了具有大量错误结点的超立方体网络中的并行容错路由算法。
A formal description of hypercube is given, from which a recursive method of constructing a hypercube is derived.
本文给出了超立方体计算机结构的集合描述，并由此导出了该结构的递归构造法。
On the other hand, Latin hypercube important sampling technique was presented to consider the tail of distribution.
另一方面，为顾及概率分布的尾部特征，提出拉丁超立方重要抽样技术。
And the more faulty nodes and faulty links in the hypercube, the Maximum Safety-Path Matrices (MSPMs) is more simple.
并且在超立方体中含有的错误结点或错误联接越多，极大安全链路矩阵的形式就越简单。
A practicable hypercube multi-microprocessor system design is presented with more details of its communication control board.
最后给出一个实用超立方体多微处理机系统的设计，着重讨论了其通信控制板的设计。
Comparing with the ring or the mesh architecture, the parallel FFT algorithm on the hypercube is found to have better performances.
比较环和网状结构，超立方体上的并行fft算法具有更好的性能。
Factorials design and Latin hypercube sampling design are applied in the high-speed milling experiments of martensitic stainless steel.
综合应用析因试验设计与拉丁超立方抽样试验设计，对难加工材料马氏体不锈钢进行了高速铣削试验。
Based on the conception of LIP and RSC, this paper proposed an efficient unicast fault-tolerant routing algorithm for hypercube networks.
基于LIP和RSC的概念，提出了一个有效的超立方体网络单播容错路由算法。
In order to deal with the problem of fault tolerant routing on exchanged hypercube, the concept of the neighbor sets of present node is defined.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
The Hamming distance is also equivalent to the Manhattan distance between two vertices in ann-dimensional hypercube, where nis the length of the words.
汉明距离也等于一个n维的超立方体上两个顶点间的曼哈顿距离，n指的是单词的长度。
Based on fuzzy C-Means algorithm (FCM) and fuzzy Min-Max Neural Networks, an integrated algorithm for fuzzy pattern recognition using hypercube set was proposed.
结合模糊c均值算法(FCM)与模糊最小最大神经网络算法，提出一种基于超长方体集的模糊模式识别算法。
The application results of the improved algorithm are verified by searching Latin hypercube optimal design of varying scales under different optimization criteria.
通过不同规模和不同优化准则的拉丁超立方体最优实验设计，验证改进算法的应用效果。
Structural parameters with uncertain but bounded parameters are described by a hypercube-an interval vector in interval mathematics and by ellipsoid in convex models.
区间数学将有界不确定结构参数用超长方体即区间向量进行定量化，而凸模型理论则用椭球对有界不确定参数进行定量化。
Results showed that Latin Hypercube sampling can capture more variability in the sample space than simple random sampling especially when the number of simulations is small.
结果表明，与普通随机采样相比，拉丁超几何体采样能捕获更多的不确定性，特别是在蒙特卡罗模拟次数较少时。
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.
本文讨论超立方体结构上的并行fft算法，着重分析算法的通信复杂性，并在此基础上导出算法的加速比。
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.
在一系列不同的极限状态函数条件下，对随机抽样法和拉丁超立方抽样法以及是否使用方差减缩技术进行了比较研究。
To reduce sampling number and assure simulation precision, Importance Sampling method and Latin Hypercube Sampling method are coupled with Neumann expansion SFEM respectively.
为了减少随机抽样的次数并保证蒙特卡罗法的数值模拟精度，对比引入了重要抽样法和拉丁超立方体抽样方法；
This paper analyzes the seismic vulnerability of multistory dwelling brick buildings by Latin Hypercube Sampling technique and nonlinear seismic time history response analysis.
本文采用概率方法借助于拉丁超立方采样技术和非线性地震反应时程分析对多层住宅砖房的地震易损性进行分析。
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.
本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。
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.
已经有几种拓扑结构被设计出来并做过试验，其中一个是以超级立方配置互连节点，与网状网络中节点互连的方式类似。
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).
论文用两种方法给出了广义超立方体网络宽直径的具体证明，而两种方法的主要区别在于分别采用数学归纳法和直接构造法证明了不等式(1)。
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.
超立方体及其变体是一类具有良好的拓扑性质和网络参数的互连网络模型，所以关于它们的研究与应用在互连网络的研究中备受青睐。
Eventually, the response surfaces composed of the CD main influence factor H1, H2 and limit drawing depth are established by the combination of GA-BP neural network and Latin Hypercube.
最后通过GA - BP神经网络与拉丁超立方抽样法相结合构建了可控拉深筋主要影响因子h1和H2与极限拉深深度之间的响应面。
Eventually, the response surfaces composed of the CD main influence factor H1, H2 and limit drawing depth are established by the combination of GA-BP neural network and Latin Hypercube.
最后通过GA - BP神经网络与拉丁超立方抽样法相结合构建了可控拉深筋主要影响因子h1和H2与极限拉深深度之间的响应面。
应用推荐