经研究表明，并行fft算法的最佳体系结构为超立方体。
The result of research shows that the best architecture of the parallel FFT algorithm is hypercube architecture.
多维数据库中的超立方体结构应用于对海量数据的多维分析中。
The cube in multidimensional database is used in the multidimensional analysis of the huge data.
研究了具有大量错误结点的超立方体网络中的并行容错路由算法。
Parallel fault tolerant routing algorithms in hypercube networks with a large number of faulty nodes are studied.
本文研究了超立方体网络中容错路由算法的有效性及其保障机制。
We study validity and safeguard on fault tolerant routing on hypercube networks.
比较环和网状结构，超立方体上的并行fft算法具有更好的性能。
Comparing with the ring or the mesh architecture, the parallel FFT algorithm on the hypercube is found to have better performances.
交叉立方体的某些性质优于超立方体，比如其直径几乎是超立方体的一半。
For example, the diameter of the crossed cube is approximately half that of the hypercube.
基于LIP和RSC的概念，提出了一个有效的超立方体网络单播容错路由算法。
Based on the conception of LIP and RSC, this paper proposed an efficient unicast fault-tolerant routing algorithm for hypercube networks.
本文给出了超立方体计算机结构的集合描述，并由此导出了该结构的递归构造法。
A formal description of hypercube is given, from which a recursive method of constructing a hypercube is derived.
最后给出一个实用超立方体多微处理机系统的设计，着重讨论了其通信控制板的设计。
A practicable hypercube multi-microprocessor system design is presented with more details of its communication control board.
通过不同规模和不同优化准则的拉丁超立方体最优实验设计，验证改进算法的应用效果。
The application results of the improved algorithm are verified by searching Latin hypercube optimal design of varying scales under different optimization criteria.
并且在超立方体中含有的错误结点或错误联接越多，极大安全链路矩阵的形式就越简单。
And the more faulty nodes and faulty links in the hypercube, the Maximum Safety-Path Matrices (MSPMs) is more simple.
汉明距离也等于一个n维的超立方体上两个顶点间的曼哈顿距离，n指的是单词的长度。
The Hamming distance is also equivalent to the Manhattan distance between two vertices in ann-dimensional hypercube, where nis the length of the words.
本文提出了数据超立方体模型，并在代数表达方面进行了改进，使得其可以支持OLAP操作。
In this paper, we address this issue by proposing a model of a data-cube and an algebra to support OLAP operations on this cube.
通过分析财务分析的需求指出直接用OLAP超立方体模型实现财务分析存在的问题和局限性。
Analyzing the requirement of financial analysis, people realize that there are some problems and restrictions in straightly using the OLAP model in financial analysis.
基于超立方体中的LIP容错模型及其该模型的三个重要性质，给出超立方体中求解LIP的改进程序。
Based on the LIP fault-tolerant model and its three properties, an improved program of getting LIP is proposed.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
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.
本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。
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.
本文讨论超立方体结构上的并行fft算法，着重分析算法的通信复杂性，并在此基础上导出算法的加速比。
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.
为了减少随机抽样的次数并保证蒙特卡罗法的数值模拟精度，对比引入了重要抽样法和拉丁超立方体抽样方法；
To reduce sampling number and assure simulation precision, Importance Sampling method and Latin Hypercube Sampling method are coupled with Neumann expansion SFEM respectively.
超立方体及其变体是一类具有良好的拓扑性质和网络参数的互连网络模型，所以关于它们的研究与应用在互连网络的研究中备受青睐。
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.
论文用两种方法给出了广义超立方体网络宽直径的具体证明，而两种方法的主要区别在于分别采用数学归纳法和直接构造法证明了不等式(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 -超边连通度和折叠立方体的1 -超边连通度和限制边连通度。
The 2-extra edge connectivity of the hypercubes and the 1-extra edge connectivity and restricted edge connectivity of the folded hypercubes are determined.
确定了立方体的2 -超边连通度和折叠立方体的1 -超边连通度和限制边连通度。
The 2-extra edge connectivity of the hypercubes and the 1-extra edge connectivity and restricted edge connectivity of the folded hypercubes are determined.
应用推荐