1)maximum term极大项
1.The minimum term and maximum term defined by the propositional variations,are the core problems of expressions and applications stemmed from the propositional formula.极小项和极大项是主范式问题的核心,体现了命题公式的成真赋值和成假赋值以及公式类型等诸多特征。
2)maxiterm极大项
1.Through a discussion on the suffix features of miniterm and maxiterm,this paper offers a suffix calculating approach to miniterm and maxiterm in principal disjunctive normal form,principal conjunctive normal form determined by disjunctive normal form,and conjunctive normal form of propositional formula.通过极小项和极大项的下标特征的讨论,给出了由命题公式的析取范式、合取范式而确定的主析取范式、主合取范式中的极小项、极大项的下标计算方法,从而简化了由繁杂的命题公式推演或真值计算求主范式的计算过程。
3)maxima[英]['m?ksim?][美]['m?ks?m?]极大值项
1.The oscillation for a second order neutral difference equations with "maxima" 2 xn+pnxn k qn× max s n l, n rsxs=0 and 2 xn+pnxn k qns mn al,x n f xs k 1 , , xs k m =0 is studied.研究了一种带有极大值项的二阶中立型差分方程2xn+pnxnk+qnmaxsnl,nrsxs=0与2xn+pnxnk+qnmaxsnl,nfxsk1,,xskm=0的振动性,探讨了其所有解振动的充分条件。
2.Consider a class of neutral difference equation with !maxima", some results for the asymptotical properties of all non-oscillatory solutions of the equation are obtained, that is, sufficient conditions for all non-oscillatory solutions {x-n} satisfying {lim}n→∞ x-n=0 or {lim}n→∞|x-n|=∞ are obtained, which extend the corresponding results of the references. 考虑一类带有极大值项的中立型差分方程,得到了方程非振动解渐近性的若干结果,即方程的所|xn|=∞的充分条件,推广了已有文献中的相关结果。
4)maximal frequent item set极大频繁项目集
1.After analyzing many typical association rule mining algorithms and the maximal frequent item set mining algorithm,a new algorithm of maximal frequent item set mining,named as BOFPV_MMFIA,is proposed.在分析和研究诸多经典关联规则挖掘算法或最大频繁项目集挖掘算法的基础上,提出了一种新的极大频繁项目集挖掘算法BOFPV_MMFIA算法。
英文短句/例句
1.Maximal frequent item set mining with establishment of frequent item set vectors建立频繁项目集向量的极大频繁项目集挖掘
2.Research on Maximum Frequent Itemsets Based on Improved FP-tree基于改进FP-树的最大频繁项目集研究
3.An Algorithm for Mining Maximum Frequent Itemsets Based on T-tree基于T-tree的最大频繁项目集挖掘算法
4.An Improved Maximal Frequent Itemsets Mining Algorithm一种改进的最大频繁项目集挖掘算法
5.A fast algorithm for mining maxmum frequent itemsets;基于集合运算的最大频繁项目集生成算法
6.Research and Implementation of an Algorithms for Mining Constrained Maximum Frequent Itemsets;基于约束的最大频繁项目集挖掘算法与实现
7.An Integrated Updating Algorithm for Mining Maximal Frequent Itemsets Based on FP-Tree;基于FP-Tree的最大频繁项目集综合更新算法
8.Study on Fast Mining Algorithm Constrained Maximum Frequent Itemsets一种约束最大频繁项目集快速挖掘算法研究
9.Research of Mining Maximum Frequent Itemsets Based on Dynamic Programming基于动态规划的最大频繁项目集挖掘研究
10.Incremental updating algorithm of maximum frequent itemsets based on FP_tree基于FP_tree的最大频繁项目集增量式更新算法
11.An Algorithm for Mining Maximum Frequent Item Sets Based on FP-tree一种基于FP-tree的最大频繁项目集挖掘算法
12.An Algorithm Mining Frequent Item Set and their Related Transaction Set频繁项目集及相关事务集的挖掘算法
13.A frequent itemsets mining algorithm based on set;一种基于集合的频繁项目集挖掘算法
14.New algorithm for mining maximum frequent itemsets based on datasets iteration挖掘最大频繁项集的事务集迭代算法
15.Algorithm based on adjacent lattice for finding frequent itemsets;基于邻接网络的频繁项目集发现算法
16.Discovering maximum frequent itemsets is a key problem in many data mining applications.发现最大频繁项目集是多种数据开采应用中的关键问题 .
17.Fast Mining of Maximum Frequent Item-set Based on Item-set Dismantling基于项集分解的快速挖掘最大频繁项集算法
18.Mining Maximal Frequent Patterns in a Unidirectional FP-tree;基于单向FP-树的最大频繁项集挖掘
相关短句/例句
maxiterm极大项
1.Through a discussion on the suffix features of miniterm and maxiterm,this paper offers a suffix calculating approach to miniterm and maxiterm in principal disjunctive normal form,principal conjunctive normal form determined by disjunctive normal form,and conjunctive normal form of propositional formula.通过极小项和极大项的下标特征的讨论,给出了由命题公式的析取范式、合取范式而确定的主析取范式、主合取范式中的极小项、极大项的下标计算方法,从而简化了由繁杂的命题公式推演或真值计算求主范式的计算过程。
3)maxima[英]['m?ksim?][美]['m?ks?m?]极大值项
1.The oscillation for a second order neutral difference equations with "maxima" 2 xn+pnxn k qn× max s n l, n rsxs=0 and 2 xn+pnxn k qns mn al,x n f xs k 1 , , xs k m =0 is studied.研究了一种带有极大值项的二阶中立型差分方程2xn+pnxnk+qnmaxsnl,nrsxs=0与2xn+pnxnk+qnmaxsnl,nfxsk1,,xskm=0的振动性,探讨了其所有解振动的充分条件。
2.Consider a class of neutral difference equation with !maxima", some results for the asymptotical properties of all non-oscillatory solutions of the equation are obtained, that is, sufficient conditions for all non-oscillatory solutions {x-n} satisfying {lim}n→∞ x-n=0 or {lim}n→∞|x-n|=∞ are obtained, which extend the corresponding results of the references. 考虑一类带有极大值项的中立型差分方程,得到了方程非振动解渐近性的若干结果,即方程的所|xn|=∞的充分条件,推广了已有文献中的相关结果。
4)maximal frequent item set极大频繁项目集
1.After analyzing many typical association rule mining algorithms and the maximal frequent item set mining algorithm,a new algorithm of maximal frequent item set mining,named as BOFPV_MMFIA,is proposed.在分析和研究诸多经典关联规则挖掘算法或最大频繁项目集挖掘算法的基础上,提出了一种新的极大频繁项目集挖掘算法BOFPV_MMFIA算法。
5)isomorphically complement (maximal) direct summands同构补(极大)直和项
6)maximal frequent itemsets(maximal frequent patterns)极大频繁项目集(极大频繁模式)
延伸阅读
国际现代五项和冬季两项联盟 1948年成立国际现代五项联合会,1969年由于增加了冬季两项活动改为现名,会址设在瑞典兰斯克鲁纳。现代五项有50个会员协会,冬季两项有40个会员协会,正式工作语言为英语和法语。 国际现代五项和冬季两项联盟的宗旨是:推动现代五项和冬季两项运动及其附属项目综合训练的发展和技术水平的提高;促进各协会领导人和运动员之间的诚挚、友好合作,反对任何种族、宗教或政治的歧视。 国际现代五项和冬季两项联盟的最高权力机构是全体代表大会,每4年举行1次(在奥运会年的秋季召开),一个协会只有 1票表决权,可以委托投票。现代五项和冬季两项每年还分别召开 1次代表大会。单项代表大会只对与本项目有关的事宜作出决定。每个会员协会有1票表决权,可以委托投票。代表大会闭会期间,国际现代五项和冬季两项联盟的领导机构是行政理事会。理事会每年在夏、冬两季各召开1次会议。联盟的日常事务由执?形被岣涸稹V次嵊芍飨⒌?1副主席、两名执行副主席、秘书长、司库、副秘书长和副司库组成。联盟下设技术委员会、医务委员会和新闻委员会。现任主席是S.托费尔特(瑞典);秘书长是W.格吕特(瑞典)。联盟管辖的世界锦标赛有:现代五项运动(跑、马术、击剑、射击和游泳),冬季两项(滑雪+射击)。
