In this paper, we discuss rough set approximation under granulation, and establish positive approximation under dynamic granulation.
本文讨论了粒度意义下的粗糙集近似，并定义了动态粒度下的正向近似。
The thesis studies the generalized rough set models and proposes a multi-level rough set approximation model CBM-RS based on a covering of the universe.
作者研究了粗糙集扩展理论，提出了一种多层粗糙集模型CBM-RS。 该模型是一种基于覆盖的扩展的多层粗糙集模型。
And, if we set these things equal, what we get is actually, we are replacing the function by its linear approximation.
如果把这两个看做等价的，实际上，就是用函数的线性近似式来代替原函数。
Alright. So now, as promised, the next approximation is that where are set up the fast equilibrium.
好，那么现在，就像说好的，下一个近似是建立，快平衡。
Instead, consider how you can best retrieve a set of objects that can constitute a good approximation of the set of data that an operator must use for the next several minutes.
相反，考虑如何最好的得到一系列对象的集合，用来创建一个好的数据集合代理，处理一些在后来几分钟内一定会处理的对象。
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
提出了集合覆盖问题的一种随机近似算法。
The algorithm employed ellipsoidal outer approximation of the feasible set assuming instantaneous process and observation noise vectors and the initial state to be bounded by known ellipsoids.
算法假设系统的过程和量测噪声以及初始状态由已知椭球来定界，然后利用椭球集合来描述系统真实状态的可行集。
The existence of a best approximation of the pairwise comparison matrix from the set of consistent matrices is proved.
本文证明了成对比较矩阵在相容性矩阵集合中的最佳逼近的存在性和不唯一性。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
We discuss the relation between fuzzy measure defined by lower approximation and upper approximation of fuzzy set and probability fuzzy measures.
讨论了利用模糊集的下近似和上近似定义的模糊测度和概率模糊测度的关系。
In addition, for the minimal rank solution set, the expression of the optimal approximation solution to a given matrix is derived.
另外，给出了中心对称最小秩解集合中与给定矩阵的最佳逼近解。
The main contents include the approximation set, decision systems, data preprocessing and attribute reduction and so on. It is a effective method of dealing with incomplete, inaccurate data.
其主要内容包括近似集、决策系统、数据预处理以及属性约简等等，是一种处理不完整，不精确数据的有效方法。
Based on the atoms and congruence relations of approximation algebra, it is proved that rough set algebra becomes pseudo-complemented ms algebra if proper complement operators are selected.
借助近似代数上的原子及同余关系，证明了在适当选取余运算之后，粗集代数就构成伪补MS代数。
The existence of a best approximation to the pairwise comparison matrix from the set of consistent matrices is proved.
本文首先证明了成对比较矩阵在相容性矩阵集合中的最佳逼近的存在性和不唯一性。
It is to select product samples, then to use methods of function approximation and set up model.
首先选取产品样本，然后采用函数逼近方法建立评价模型。
Unconventional double set parameter finite element approximation for a fourth order variational inequality with displacement obstacle is considered.
研究位移障碍下的一个四阶变分不等式的非常规双参数有限元逼近。
The TM set of equations can be solved using a finite difference time domain (FDTD) approximation that is second-order accurate in both space and time.
采用时间和空间均为二阶精确的有限差分方法，将偏微分方程进行差分化。这样，空间的电磁场可由时间域有限差分法（FDTD）来求解。
An approximation function of the fractal image regardless of black and white or colour can be considered as a fuzzy set. So the research of iterated fuzzy set system (IFZS) is necessary.
分形的黑白图象和彩色图象之逼近函数可以看作一个模糊集，因此对迭代模糊集系统IFZS的研究是极有必要的。
According to the dual theory, the dual programming was used to map the original problem exactly and the second approximation of the dual problem was set up by Taylor's expansion.
根据对偶理论，应用对偶规划精确映射原问题，再按泰勒展式建立对偶问题的二阶近似。
An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
应用推荐