irredundant 中文意思是什麼
irredundant
解釋
不可縮短的, 無贅的-
On perfect neighborhood and irredundant sets in trees
關于樹的完美鄰域集與無冗餘集 -
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解集非空的充要條件以及極大元的個數公式。 -
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的每個元素均有不可縮短的有限交分解的情況下，求出了方程的所有極大解，從而完全確定了方程的解集 -
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演算法，這個演算法在挖掘出頻繁項集的同時還得出了閉包頻繁項集，有效地為挖掘無冗餘規則奠定了基礎。 -
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 。 -
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
到目前為止，對于圖的無贅數的研究已經越來越深入，研究者們也已經得到了圖的無贅集的大量的性質。 -
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有解，則一定存在極小解。 -
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的解集中存在極大解的一個充要條件。
分享友人