hypercube
n. 超立方体
2025-11-24 03:50 浏览次数 8
n. 超立方体
1. a geometric figure (such as a tesseract) in Euclidean space of n dimensions that is analogous to a cube in three dimensions
2. a computer architecture in which each processor is connected to n others based on analogy to a hypercube of n dimensions
hypercube database超立方体数据库
hypercube network超立方体网络
hypercube method超立方体
virtual hypercube虚拟超立方体
hypercube multiprocessor超立方体结构并行处理
hypercube embedding立方体的嵌入
hypercube computer超立方体的电脑
hypercube multiprocessors超立方体多处理机上
hypercube subspace超立方体子空间
it used hypercube as our network topology and propose a routing algorithm.
以超立方体网络为分析的网络拓扑,提出在其上的一个路由算法。
because of the limitation the former control topologies usually have, people proposed hypercube and researching widely on it.
因为以往的控制拓扑具有较大的局限性,近年来超立方体结构被提出并得到了广泛的研究。
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算法,着重分析算法的通信复杂性,并在此基础上导出算法的加速比。
comparing with the ring or the mesh architecture, the parallel fft algorithm on the hypercube is found to have better performances.
比较环和网状结构,超立方体上的并行fft算法具有更好的性能。
analyzed the graphs of the statistics, we draw the conclusion that logical hypercube has good performance in multicast.
根据对统计结果曲线图的分析研究,我们得到结论:逻辑超立方体在组播应用中,确实具有良好的性能。
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.
在一系列不同的极限状态函数条件下,对随机抽样法和拉丁超立方抽样法以及是否使用方差减缩技术进行了比较研究。
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.
已经有几种拓扑结构被设计出来并做过试验,其中一个是以超级立方配置互连节点,与网状网络中节点互连的方式类似。
a practicable hypercube multi-microprocessor system design is presented with more details of its communication control board.
最后给出一个实用超立方体多微处理机系统的设计,着重讨论了其通信控制板的设计。
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.
本文给出了超立方体计算机结构的集合描述,并由此导出了该结构的递归构造法。
the application results of the improved algorithm are verified by searching latin hypercube optimal design of varying scales under different optimization criteria.
通过不同规模和不同优化準则的拉丁超立方体最优实验设计,验证改进算法的应用效果。
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.
超立方体及其变体是一类具有良好的拓扑性质和网络参数的互连网络模型,所以关于它们的研究与应用在互连网络的研究中备受青睐。
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)。
this paper proposes latin hypercube sampling combined with variance reduction techniques of conditional expectation and antithetic variates to assess ultimate strength reliability of ship hull girder.
本文将拉丁超立方抽样法与条件期望和对偶变数方差减缩技术组合用于分析船体总纵极限强度可靠性。
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.
本文讨论超立方体结构上的并行归并排序算法,着重分析算法的通信复杂性,在此基础上推导算法的加速比。
however the crossed cube has not the superior properties as the hypercube in some aspects such as symmetry.
当然,交叉立方体也有一些比超立方体差的性质,如交叉立方体不像超立方体那样是边对称的。
we study validity and safeguard on fault tolerant routing on hypercube networks.
本文研究了超立方体网络中容错路由算法的有效性及其保障机制。
hypercube multi-computers system is of good performance in parallel and distributed computation.
超立方体网络拓扑结构是多处理机系统中常见的一种。
the upper and lower bound evaluations of lip fault-tolerant model in hypercube are given and a very significant conjecture on the bound of lip is obtained.
给出了超立方体网络中lip容错模型的上下界估计及一个非常有意义的猜想,并且结合已有结果对上下界及猜想进行了验证。
the result of research shows that the best architecture of the parallel fft algorithm is hypercube architecture.
经研究表明,并行fft算法的最佳体系结构为超立方体。
based on the conception of lip and rsc, this paper proposed an efficient unicast fault-tolerant routing algorithm for hypercube networks.
基于lip和rsc的概念,提出了一个有效的超立方体网络单播容错路由算法。
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.
结果表明,与普通随机采样相比,拉丁超几何体采样能捕获更多的不确定性,特别是在蒙特卡罗模拟次数较少时。
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)与模糊最小最大神经网络算法,提出一种基于超长方体集的模糊模式识别算法。