阵

This is one of the matrix multiply algorithm, we want to help!

这是一个关于距阵相乘的算法，希望对大家有用！

The characterization of the access structures of ideal secret sharing schemes is one of the main open problems in secret sharing and has important connections with matroid theory.

一直以来，理想的存取结构具有的特性是秘密共享领域中主要的开放性问题之一，并且该问题与拟阵论有着密切的联系。

Through the investigation of the reconfiguration practice in a certain plant, the conclusion is attained that the greedy method based on matroid model is efficient and practicable.

针对某工厂的重组实践，经与现场结果对比证明，在快速重组制造系统的布局规划优化设计中，基于拟阵的贪馋算法是一种快捷实用的算法。

In this section, we also give a conjecture: A finite lattice is isomorphic to the lattice of flats of a finite poset matroid if and only if it is a semi-modular lattice.

本节的一个中心问题是提出了一个猜想：一个有限格L同构于一个有限偏序集拟阵的闭集所构成的格当且仅当L是一个半模格。

Given the assumption of analysis-of-variance model, the text selection can be transformed to a linear parameter estimation problem, which can then be solved by a greedy matroid cover algorithm.

在方差分析模型的假设下，最优文本选择就转化为线性参数估计问题，相当于寻找拟阵的最小代价覆盖集，从而可通过贪心算法求解。

This work is done in many ways, the most famous and representative are the following i one is poset matroid that comes from replacing the underlying set of a matroid by a partially ordered set; another is greed...

因此，本文采用与前人不同的思维方式，利用偏序集理论，在保持拟阵某些原有性质的基础上，对两种新理论给予充实和完善。

The optimal design of layout programming of RRMS is explored. The mathematical programming model based on matroid is established and the greedy method is selected serving as the optimal method. The application program based on this method is also developed and compiled.

摘 要：研究探索了快速可重组制造系统布局规划中的优化设计问题，建立了基于拟阵的数学规划模型，通过对比选取贪馋算法作为优化算法，并编制开发了此算法的应用程序。

Graph theory s 02 graph theory widely used for its own development. 40-60 20th century era matroid theory and graph theory-very graph theory, algebra and graph theory. topology theory has great development.

详细说明：图论讲义02 图论的广泛应用，促进了它自身的发展。20世纪40-60年代，拟阵理论、超图理论、极图理论，以及代数图论、拓扑图论等都有很大的发展。

Second, by modifying the cost function in the matroid cover problem, we can further generalize the greedy optimal text selection so as to minimize the total number of phonemes in the training text.

其二，通过修正拟阵覆盖问题中代价函数的形式，可以进一步将最佳文本选择问题由追求最小句子数推广至使训练文本中音素总数最少。

The decomposition of the eigenspace of the defective matrix and the general form of Jordan chain ;2. The general form of the maximal Jordan chain s of the defective matrix is getten with the notation of depths of the generalized eigenvectors.

利用广义特征向量的深度，获得极大若当链的一般形式，并推导出在满足PJP-1=SJS-1的2个可逆矩阵P和S之间存在一个主对角线上具有上三角分块Toeplitz子阵的可逆矩阵H，使得S=PH，从而证明广义特征矩阵的唯一性。

They weren't aggressive, but I yelled and threw a rock in their direction to get them off the trail and away from me, just in case.

他们没有侵略性，但我大喊，并在他们的方向扔石头让他们过的线索，远离我，以防万一。

In slot 2 in your bag put wrapping paper, quantity does not matter in this case.

在你的书包里槽2把包装纸、数量无关紧要。