You can also set whether the custom field will accept new values and , if so , whether the new value will be automatically added to the list of acceptable values 您还可设置自定义域是否接受列表中没有列出的新值，以及在可接受的情况下，是否自动将这个新值添加到可接受值列表中。
Analyze characterizations of determine set for the social choice function which domain is profiles of linear order . and then prove arrow impossibility theorem with this characterizations 分析了定义域为线性偏好断面的社会选择函数的决定集的性质，并用这些性质来证明arrow不可能定理。
The results show that the class of problems has at least one solution or positive solution provided the " maximal height " of nonlinear term is appropriate on a bounded set of its domain 结论表明，只要非线性项在其定义域的某个有界集上的“最大高度”是适当的，那么这类问题至少存在一个解或者正解。
Then this quadrature is used to classifying the blocks in the encoding phase , resulting in a great reduction to number of domain blocks to search for , hence shortening the encoding time dramatically 在分形编码时，用该不变量来对图像块进行分类，极大地减少了编码时定义域块的搜索数目，达到了加速编码的目的。
Then the fractal dimension can be used to classifying the blocks in the encoding phase , resulting in a great reduction to number of domain blocks to search for , hence shortening the encoding time dramatically 在分形编码时，用这个维数值来对图像块进行分类，大大减少了编码时定义域块的搜索数目，达到了加速编码的目的。
At first the problem of the matching search of domain and range in the jacquin algorithm of fractal image coding has been analyzed and the result of it belonging to the np _ hard has been found 首先经过分析发现简库恩算法中的定义域、值域匹配搜索问题属于组合优化问题中的np ? hard ，并把组合优化方法应用于分形图像压缩编码的搜索过程。
The proposed algorithm can effectively exploit the temporal correlation in real image sequences , since each range block is approximated by the domain block in the adjacent frame , which is of the same size as the range block 这个新算法在实际图像序列中，能充分地开发出时间上的相关性，因为每个值域块都是由相邻图像帧中的相同尺寸的定义域块来逼近的。
Note that in fractal encoding , each range block is to compare with domain blocks after some grey - level affine map . hence we first put forward a kind of image quadrature invariant of affine maps above , which can be thought of a generalization of mario feature 由于在分形编码时值域块实际上是与经过灰度仿射变换之后的定义域块进行比较，因此我们首先提出了一种在灰度仿射变换下保持不变的图像矩不变量，它可看作是mario特征的推广。
Based on the study of 8 geometry transforms , the result shows that the transforms are not an intrinsic part of fractal image coding . we can increase the domain blocks directly to enlarge the search pools . it may replace the search pools of 8 geometry transforms 通过对8种几何变换研究发现，它们并不是传统分形图像压缩编码中固有的不可缺少的一部分，可以通过直接在图像内部增加定义域块扩大搜索空间的方法来替代用8种几何变换构造的搜索空间。
Chaotic variables have not uniform distribution , and it is worse that chaotic variables are very sensitive to the change of initial value and the defining range of variable ; therefore it is uncertain that the optimal solution can be found . all those shortcomings above bring numerous problems in the process of optimization 通过分析揭示了混沌优化的本质，首先混沌算子在变量定义域上并非均匀分布，所以能否找到最优解是不确定的；再之混沌优化对初值的变化和变量定义域的变化特别敏感，这些给优化过程带来许多难以确定的问题。
