1) UTA
不可分辩跃迁阵
1.
Those arrays were superposed according to their total stength of UTA for each ionic spectrum and weight of ion for whole M band with a Gaussian curve.
用不可分辩跃迁阵模型（ＵＴＡｍｏｄｅｌ）计算了金Ｍ带０。
2) unresolved transition array
不可分辨跃迁阵
3) unresolvable transition approximation
不可分辨跃迁系
4) unresolved transition arrays
不可分辨跃迁模型
5) undistributed class
不可分辩类
1.
Then it uses the results of references paper [5],the undistributed class and the significance,meanwhile,a heuristic algorithm based on general core set for attribute reduction;finally,the experiment shows that it can get better effect and it also shows the reduction results of UCI database using this algorithm.
主要对RoughSet理论中的离散化问题进行了研究,提出了基于属性值重要性的离散化算法,利用文献[5]中不可分辩类的定义、属性重要性的讨论及属性约简的启发式算法,得到了一种离散化与属性约简相结合的启发式算法,并通过Delphi程序验证了该算法对UCI数据库的有效性。
6) reversible transition
可逆跃迁
补充资料：分辩
辩白：证据俱在，无需～ㄧ他们说什么就是什么，我不想～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条