空集

研究了权重、阈值和匹配度之间的关系，提出了避免查询结果为空集或全集的方法，使得查询更加人性化。

The relation between threshold , weight and matching degree is also discussed . In order to make the querying friendlier , the method to avoid returning null set and corpora is also presented .

莱布尼茨阐明了我们现在叫做合取、析取、否定、同一、集合包含和空集的首要性质。

Leibniz enunciated the principal properties of what we now call conjunction , disjunction , negation , identity , set inclusion , and the empty set .

p序列且谱是空集的一个充分条件。

P sequences whose spectrums are empty sets .

c是溶液中吸光粒子的浓度；T解集中不出现空集；

C is the concentration of light absorbers in the solution ; T 's solution .

并论证了当只有Z°为空集时，就可推出强最优性必要条件，而不必要求X°是最优解。

The paper proves the optimality conditions can been got when Z ° is empty , and it isn 't neccessary for x ° is optimal .

定理2.1.3.设X是非空集，Y是紧Hausdorff拓扑空间，T：X→2~Y是具有非空紧闭值的广义R-KKM映象。

Theorem 2.1.1 . Let X be a nonempty set and Y be a Hausdorff topological space .

另一方面，如果一个完全没有特权的用户运行同一个程序，他的可继承集是空的，这个集与fI求交集，会产生一个空集。

In contrast , if a completely unprivileged user runs this same program , his empty inheritable set is masked against fI , resulting in the empty set .

消极事实就是一个不包含任何元素的空集。

The negative fact is a set that contain any element .

任意非空集类上可能性测度的扩张

Extension of Possibility Measures Defined on an Arbitrary Nonempty Class of Sets

空集则对应于常数项1。

The null subset corresponds to the term 1 .

多人合作对策模型中联盟的收入和总体的收入常常出现相互矛盾的情况，此时核是空集。

The conflict usually takes place between the income of coalition and integration in model of multiple-person cooperation game .

T解集中不出现空集；锥-连续凸映射的严有效解连通性

T 's solution . On the Connectedness of the Set of Strictly Efficient Solution of Cone - continuous Convex Map

由于此方法保留了对机器学习贡献较大的核集属性因此在具有核集属性的数据集上比其他利用空集作为初始集合的属性选择算法有更好的属性选择效果。

Experimental results have shown that this algorithm had better performance on the data with non-empty feature core sets than the previous algorithms .

该过程被称为“索引匹配”，并且为给定的查询生成一组合适的索引（可能是空集）。

This process is known as " index matching " and produces a ( possibly empty ) set of eligible indexes for the given query .

本文不仅引入了非空集的有效下界的概念，而且引入了新的严格C-伪单调映射。

In this paper , the concept of efficient lower bounds of a nonempty set is introduced . A new strictly C pseudomonotone mapping is introduced .

在电路中同流拓扑子集为空集的前提下，可以利用回路电流法来估计电路的电流特征矩阵，从而实现电流拓扑向量的求取；

On condition that the identical current topology set is null , the current topology vectors are found by estimating the current eigenmatrix with the current loop method .

证明了文[1]（具有一细焦点和一粗焦点的二次系统）3个定理的条件是空的，即满足定理条件的参数之集为空集。

It is proved that conditions of theorem in paper [ 1 ] are empty , that is , the coefficient set satisfying the conditions of the theorem in paper [ 1 ] is an empty one .

特别地，在可行集非紧的条件下，向量均衡问题的有效解集（弱有效解集）往往是空集，但近似解集在很弱的条件下一般都是非空的。

In particular , efficient solution set ( or weak efficient solution set ) may often be the empty set when the feasible set is noncompact . But the set of approximate solution in very weak conditions can be not empty .

摘要考虑核心是空集的情况，针对核心法的适用范围和局限性，建立了一种多人合作费用分摊的多目标规划模型，给出了求解费用分摊方案的两阶段算法。

Considering a core is an empty set , in view of the application scope of the core and its limit , this paper develops one multi-objective programming model for the cost allocation problem of n-person cooperation game , and then presents two-phase approach for solving the cost allocation problem .