English translation for "irredundant"
|
- 不可缩短的, 无赘的
Related Translations:
- Example Sentences:
| 1. | On perfect neighborhood and irredundant sets in trees
关于树的完美邻域集与无冗余集 | | 2. | In [ 8 ] have given the definition of the total irredundant set of a graph , and discussed the irredundance number of some special graphs
在文[ 8 ]中给出了图的全无赘数的概念，并讨论了一些特殊图的全无赘数，而odilefavaronetal 。 | | 3. | To date , the resaerch about the irredundance in graphs is more and more deeper . resaerchers have got a lot of properties about the irredundant set in graphs
到目前为止，对于图的无赘数的研究已经越来越深入，研究者们也已经得到了图的无赘集的大量的性质。 | | 4. | In the end , when the domain is finite , b is a meet - irreducible element or 6 has an irredundant finite meet - decomposition , a sufficient and necessary condition that the solution set is nonempty is given and the number of distinct minimal solutions is formulated
最后，当论域为有限集， b为交既约元或有不可约有限交分解时，给出了方程inf _ ( i j ) ( a _ j ， x _ j ) = b解集非空的充要条件以及极大元的个数公式。 | | 5. | When / is infinite and 6 is a compact element and with an irredundant finite join - decomposition , it is showed that a sufficient and necessary condition that the solution set is nonempty . it is also proved that there exists a minimal solution if the solution set of the equation sup t ( ai , xi ) = b is nonempty
当论域为无限集， b为紧元且有不可约有限并分解时，给出了解集非空的充要条件，证明了如果方程sup _ ( i i ) ( a _ i ， x _ i ) = b有解，则一定存在极小解。 | | 6. | In order to determine the solution set of the equation , by the means of meet - irreducible element and irredundant finite meet - decomposition , we first obtain the maximal solutions to the simple equation in the case that b has an irredundant finite meet - decomposition , and then consider the relation between the equation and the equation , based on this , we obtain the maximal solutions to the equation in the case that each element of the matrix b has an irredundant finite meet - decomposition and so determine its solution set completely
为了确定方程的解集,本文利用交既约元与不可缩短的有限交分解等工具,同样地先求出简单形式的型矩阵方程的所有极大解,然后讨论方程与方程之间的关系,在此基础上,在b的每个元素均有不可缩短的有限交分解的情况下,求出了方程的所有极大解,从而完全确定了方程的解集 | | 7. | In the case of infinite domains , it is proven that there exists a maximal solution x " of a @ x = b such that x * x for every solution x of a @ x = b if the solution set of a @ x = b is unempty and b has an irredundant completely meet - irreducible decomposition . it is also identified that there exists a maximal solution x * of a @ x = b such that x * x for every solution x of a @ x = b if the solution set of a @ x = bis unempty and every component of b is dual - compact and has an irredundant finite - decomposition . in the end , a necssary and sufficient condition that there exists a maximal solution x * of a @ x = bsuch that x * x for every solution x of a @ x = b is given when the solution set of a @ x = b is unempty
当论域为无限集时，证明了如果方程a @ x = b有解且b有不可约完全交既分解，则对方程a @ x = b的每一个解至少存在一个大于等于它的极大解；进一步证明了如果方程a @ x = b有解且b的每一个分量为对偶紧元并有不可约有限交分解，则对方程a @ x = b的每一个解存在一个大于等于它的极大解；最后给出了对方程a @ x = b的每一个解存在一个大于等于它的极大解的一个充要条件及[ 0 ， 1 ]格上方程a @ x = b的解集中存在极大解的一个充要条件。 | | 8. | This paper analyses some of the existed algorithms of mining association rules , and proposes an new algorithm ffc based on the algorithm aprioritid and close which is used to mine close items . this algorithm can compute simultaneously frequent and frequent closed itemsets . it lays a foundation for efficiently mining irredundant rules
本文分析了目前已有的部分关联规则挖掘算法，并基于aprioritid算法和挖掘闭包项集算法close提出了一种新算法ffc算法，这个算法在挖掘出频繁项集的同时还得出了闭包频繁项集，有效地为挖掘无冗余规则奠定了基础。 |
- Similar Words：
- "irreducible wave equation" English translation, "irreduciblequadraticirrationalnumber" English translation, "irreduciblesaturation" English translation, "irreducibletensor" English translation, "irreduciblity" English translation, "irredundant disjunctive form" English translation, "irredundant maitra cascade" English translation, "irredundant prime closed set" English translation, "irreduzibel irreducible" English translation, "irreflexible" English translation
|
|
|
