nowhere dense subset

nowhere dense subset的基本解释

-

无处稠密子集

与nowhere dense subset相关的网络例句 [注：此内容来源于网络，仅供参考]

We proved that there exists a dense G (subscript δ) subset of the complete metric space consisting of the vector optimization problems satisfying some conditions ,and each problem in the dense G (subscript δ) subset has stable solution set, which generalized the corresponding results in the literature.

证明了满足一定条件的向量优化问题构成的完备度量空间中，存在一个稠密G集，在此稠密集中每个问题的解集都是稳定的，推广了文献中的相应结果。

Followed by the decomposition phase is optimal feature subset selection, in which the optimal feature subset acquired the best divergence is obtained according to interclass/intraclass distance of the training samples. This procedure is implemented by a Genetic Algorithm, with each possible feature subset encoded as chromosome. Fitness scores in GA are calculated and evaluated based on Jeffries-Matusita distance of the selected training samples.

然后，对这些线性光谱特征利用遗传算法结合训练样本计算类内/类间距离搜索最优分类子集，其具体染色体编码取可能的特征号，适应度函数基于样本平均Jeffries-Matusita距离计算。

For an objective comparison, the iteration numbers of these methods are: MLEM with 32iterations, OSEM with 4-subset 8 iterations and 2, 4, 8, 16, 20, 40-subset and 20 iterations, RAMLA with 4-subset and 8 iteration and relaxation parameter 0.5 and 1.5, respectively.

本研究取Inveon microPET扫描小鼠的正弦图，以MLEM、OSEM及RAMLA重建，MLEM叠代次数为32次；OSEM序列子集阶层为2、4、8、20、40，叠代次数为8、20次；RAMLA因定松弛系数为0.5、1、1.5，序列子集阶层4，叠代次数为8次。

与nowhere dense subset相关的网络解释 [注：此内容来源于网络，仅供参考]

nowhere dense subset：无处稠密子集

nowhere dense set 无处稠密点集 | nowhere dense subset 无处稠密子集 | nuclear operator 核算子