1) p-cut set
p-截集
2) pure set
p-集
3) p typed section
p型截面
4) cut set
截集
1.
Axiomatic description of cut sets of μ-Fuzzy set;
L-模糊集的截集的公理化描述
2.
By using the relation between cut sets,it is proved that,under reflexive condition,the maximum fuzzy set contains the greatest fuzzy set,and that,under both reflexive and complete conditions,the two sets are equal to each other.
用截集间的关系证明了模糊集之间的关系,得出自反条件下模糊极大集包含模糊最大集,自反、完全条件下模糊极大集与模糊最大集相等。
3.
Based on the cut set and representation theorem of fuzzy set,the approximation operator,the strong approximation operator and the weak approximation operator of rough fuzzy set are constructed in a new way,and two new descriptions of rough fuzzy set is obtained.
基于模糊集的截集和表现定理,从新的角度建立了粗糙模糊集的近似算子,强近似算子和弱近似算子,并得到粗糙模糊集的两种新的描述形式。
5) cut
[英][kʌt] [美][kʌt]
截集
1.
A flow network is established from activity and the algorithm forthe time-cost optimization in the latter network is provided by finding out theminimum-cut and opposite cut in the former network.
从活动网络中建立了流量网络，通过找出流量网络的最小载集及反截集，给出了活动网络时间费用优化算法，本文的算法比列举法更有效，比线性规划法更方便。
2.
This paper gives out a negative answer to the question that a circuit (cut) set can be represented by combinations of a set of disconnected cycle (cut) with coeffient in Z
本文证明了有向图Ｇ的回路集（或截集）不能表示成Ｇ的彼此不交的回路（或截集）的系数在Ｚ３中的线性组合。
6) cut sets
截集
1.
The concept of faith degree of grey information and its calculating formulas were given when the concept of cut sets in the obverse and the reverse of grey information was presented.
提出了灰信息的正、反面信息截集概念，并在此基础上提出并证明了灰信息的分解定理。
2.
Then it gives an approach to build covering fuzzy rough sets,which is based on the cut sets of fuzzy sets.
在引入重截集概念的基础上,主要研究了基于覆盖的模糊粗糙集的截集性质,同时给出了基于覆盖的模糊粗糙集的截集表示。
补充资料：断截截
1.形容剪裁利索。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条