A class of connected sets, whose Hausdorff dimension were S=n/(n+1)ln3/ln2 (n≥1) , were constructed on the Sierpinski gasket.
在Sierpinski垫上构造Hausdorff维数为S的连通集合,其中S=n/(n+1)ln3/ln2,n≥1。
The author extended the connected set s property theorem and made it possible to solve the problems perfectly which can t be solved by the previous theorem.
对连通集的性质定理予以推广 ,使得许多在原定理下不能解决的问题 ,得到了较为圆满的解答 。
A class of connected sets,whose Hausdorff dimension was S=ln(30+31+…+3n)ln3n,n1,was constructed on the Sierpinski Rug.
以Sierpinski地毯为例,在其上构造Hausdorff维数为S的一类连通集合,其中S=ln(30+31+…+3n)ln3n,n 1。
These algorithms are either based on the density connected chains,or weighted density,or the gravity based connected sets.
随着聚类分析的蓬勃发展,涌现出了许多聚类算法,其中最重要的算法之一是基于密度的空间聚类以及其多种变种——基于密度连通链、基于加权密度、基于引力连通集合的算法。
A connected set is constructed on the special fractal set (generalized Sierpinski rug), and whose Hausdorff dimension is ln10/ln9; then a differential function is constructed on the connected set to prove that the connected set is a Whitney s critical set.
在特殊的分形集(广义的Sierpinski地毯)上构造一个Hausdorff维数为ln10/ln9连通集合,然后在该连通集合上构造一个可微函数,利用该函数证明了该连通集合是一个Whitney临界集。
Firstly,a connected set E was constructed on the Sierpinski gasket which was self-similar set resulted from nine contraction function with contraction ratio of 1/8 and satisfied the open set conditions, and whose Hausdorff dimension was ln9/ln8;secondly,a differential function was constructed on the connected set E to prove that E was a Whitney′s cri.
首先 ,在 Sierpinski垫中构造一个连通集合 E,E是由 9个压缩比为 1 /8的压缩函数生成的自相似集且满足开集条件 ,它的 Hausdorff维数为 ln9/ln8;其次 ,在连通集合 E上构造一个可微函数 ,利用该函数分 3种情形证明了 E是一个 Whitney临界集 。
Continuity and Connectivity of Almost Connectivity Set-Valued Map
几乎连通集值映射的连通性与连续性
The connectedness of the globally minimal solution set for set-valued optimization problems
集值优化问题全局极小解集的连通性
An open connected set that contains at least one point.
域至少含有一个点的开通连集
Connectivity, Cutsets and Hamiltonian Cycles of Johnson Graphs;
Johnson图的连通度、割集和哈密尔顿圈
Existence of Essential Components of Some Set-valued Mappings;
一类集值映射本质连通区的存在问题
Connected Dominating Set Algorithm Study in Ad Hoc Networks;
Ad Hoc网络中连通支配集算法研究
Study on P2P Search Technology Based on Connected Dominating Set;
基于连通支配集的P2P搜索技术研究
Connectivity of Filled Julia Sets for a Kind of Quartic Polynomials
一类四次多项式填充Julia集的连通性
On Connectedness ofαk-Major Efficient Solution Sets for Multiobjective Programming
多目标规划αk-较多有效解集的连通性
Connectivity of the Henig Proper Efficient Point (Solution) Set for Vector Optimization
向量优化的Henig真有效点(解)集的连通性
3D IC Stacking with TSV Interconnect
3D IC集成与硅通孔(TSV)互连
The Solution Sets and Connectedness for Weak Vector Variational Inequalities
弱向量变分不等式的解集及其连通性
Communication of Intelligent Network Based on the Service of FPH;
基于被叫集中付费业务的智能网互连互通
The 1-Connected 1-Dominating Set Construction in Wireless Sensor Network;
无线传感器网络中1-连通1-支配集的构造
Research on Connected Cover Set Deployment Manage in Wireless Sensor Networks
无线传感器网络连通覆盖集布置方式的研究
Algorithms for Connected Dominating Sets in Sensor Networks
传感器网络拓扑控制连通支配集算法研究
Properties of Connected Cubic G-Arc Transitive Coset Graphs on PSL(2,11)
PSL(2,11)的连通3度G-弧传递陪集图的性质
Hygienic Investigation on Central Air Conditioning Ventilation System in Public Places of Dalian City
大连市公共场所集中空调通风系统卫生学调查
