邻域空间

词组短语

neighborhood space

与邻域空间相关的网络例句 [注：此内容来源于网络，仅供参考]

The proof is given that the category of linear fuzzy neighborhood spaces in the sense of Katsaras is isomorphic to that of co-towers of topological vector spaces and the intersection of the category of linear fuzzy neighborhood spaces with the category of type fuzzy topological vector spaces is the extract category of induced fuzzy topological vector spaces.

证明了Katsaras的线性fuzzy邻域空间范畴与分明线性拓扑空间的余塔空间范畴同构，而Katsaras的线性fuzzy邻域空间范畴与型fuzzy拓扑线性空间范畴的交集恰为诱导的fuzzy拓扑线性空间范畴。

Analysis on UPCA model spatial sensitivityAgainst the situation that most urban CA model with no consideration of the spatial scale of data input, taking Changsha as the example, it analyzed the UPCA model spatial sensitivity, drew that the appropriate resolution and the neighborhood structure of Changsha area are respectively 30m and C-1 (taking a cell as radius circular neighborhood).

3UPCA模型的空间尺度敏感性分析针对目前大多城市CA模型在模拟城市空间形态演变时没有考虑输入数据的空间尺度影响，本研究论证UPCA模型模拟长沙市城市空间形态的空间尺度敏感性，得出了应用于长沙地区的适宜分辨率和邻域结构分别为30m和C-1(以一个元胞为半径的圆形邻域)，并基于此空间尺度获取了模型的最佳校验参数。

Finally,as to an equicontinuous homeomorphism on a compact metric space,...

最后，针对紧致度量空间上的等度连续同胚，利用空间的极小性和紧致性，得到以空间中某有限个点的有限长轨道为中心，以ε2为半径的开邻域构成的有限子覆盖，并利用f的等度连续性，由该子覆盖构造出以空间任一点的有限长轨道为中心的开邻域所作成的有限子覆盖，进而得到所要结论。

Based on constraint satisfaction,an entirely feasible scheduling is obtained by constraint propogation technology and heuristic repair method and is regarded as initial solution for tabu search algorithm.Current solution is optimized by neighborhood transformation on a critical path.The final optimizal solution is improved by adopting a global neighborhood swapping strategy.

该算法基于约束满足思想，通过约束传播技术和启发式修复算法，得到可行调度作为禁忌搜索算法的初始解；再进行关键路径上的邻域变换，优化当前解；并采用一种全局邻域交换策略，扩大搜索空间，改善优化结果。

Furthermore, based on Two-term local quadrat variance algorithm, a scale decomposing method is pointed out. This thesis also evaluates the question that whether we can apply scale decomposing results into gully ordering results for getting gully ordering system keeping the same scale characteristics results.The primary works and contributions of this thesis are summarized as follows:1. Three term local strip lacuanrity algorithm (3TLSL)This thesis shows that the gliding algorithm of Lacunarity has several shortcomings, such as it can only focus on the current analysis window, and is easily influenced by some local irregular values.

更多。本文进行的主要研究工作如下：1、流域沟谷网络多尺度分析模式与算法研究首先，为解决空隙度的滑动框算法只考虑当前窗口、易受局部异常值影响的缺陷，本文提出了顾及邻域空间关系的3阶局部条形窗口空隙度(Three-term Local Strip Lacuanrity，3TLSL)算法，并以模拟沟谷网络为例，对比分析了3TLSL算法与滑动框算法的结果，研究结果显示，3TLSL算法在分析结果的精确性、可靠性、有效性等方面均有明显的提高。

To solve this problem,we present a method of self-intersecting manifold learning. The core of this method is to select neighborhood points based on tangent space clustering. We construct a layered neighbor-graph to storage the trusted information of low dimensional neighborhood.

为了解决这个问题，本文提出一种自相交流形学习算法，其核心内容是基于切空间分类的邻域选取方法，主要是通过逐步建立分层邻域图储存正确的邻域关系，以获取有效的局部低维结构。

To advance the concept system of half space in the vicinity of parametric surface which has been used to settle the key technique problem of set operations-a unified classification method between surface and solid.

提出了参数曲面的邻域半空间的概念体系，并利用邻域半空间解决了集合运算过程中曲面与实体统一分类的关键技术问题。

The point cloud was divided twice and distributed to 3D cell grids, then ultimate space, internal space, external space were decided for each grid. With the help of each point s sphere space, K-nearest neighbors of the point can be found quickly.

首先，采用二次划分的方法将点云划分到相应的立方体小栅格中；然后，为采样点所在的立方体小栅格确定最终子空间、内子空间和外子空间，结合采样点的球空间，就能很快确定该采样点的K邻域的搜索范围。

The method includes the following steps: firstly, a spherical neighborhood of present sample points is established by using the geometric spherical-modelling theory and all the sample points contained in the spherical neighborhood are adopted as candidate neighbor points, thus not only preserving the effectivity of the dimension reduction capability when data sets are sparse but also getting the advantages of low-sensitivity to isolated points and good stability of the preserved topological structure; then a data relevance matrix more matching semantics can be obtained by relevance measurement based on route clusters to update the candidate neighbor points in the spherical neighborhood and optimize the regular neighborhood space of the present sample points, thus improving the phenomenon that the dimension reduction of sample sets provided with folded curved faces is apt to suffer the integrated-structure distortion in case of heterogeneous data distribution.

首先利用几何开球原理建立当前样本点的球状邻域，将包含在球状邻域内的所有样本点作为候选近邻点，不但能够保持在数据集稀疏情况下的降维性能的有效性，而且具有对孤立点敏感性不高、保留拓扑结构稳定性好的优点。然后利用基于路径聚类的相关性度量得到更符合语义的数据相关性矩阵，用来对球状邻域内的候选近邻点进行更新，优化当前样本点的规则邻域空间，改善了当数据不均匀分布时在带有折叠弯曲面的样本集上降维容易出现整体结构扭曲的现象。

The above problems are studied in this thesis. First, the implicit NND scheme with mix flux splitting method proposed by Zhang Hanxin that is first order accurate in time and second order in space is modified. The modified scheme keeps the characteristics of fast convergence and is second order accurate both in time and space. It can be capable of simulating the unsteacly flow. Second, the topological method founded by Zhang Hanxin is improved to study the characteristics of vortex near the singular point on its axis and the cross streamlines on the longitudinal section passing the vortex axis. On the basis of topological results, a program which visualises numerical results is made out. It can help us analyse the characteristics of vortex motion.

本文对上述问题做了研究：第一，在数值模拟方面，借助于张涵信提出的NND算法和混合通量法，我们将他建立的时间为一阶、空间为二阶精度的快速隐式算法推广为时间和空间均为二阶精度的算法，这样做保留了原格式收敛快的特点，而且能适用于真实的非定常流态的计算；第二，将张涵信的拓扑分析方法加以推广，研究了涡轴附近及破裂点邻域内流场的空间特征，并以这些拓扑分析结果为指导，研制了一套显示计算结果的软件，这一软件能很好地帮助我们分析流场的计算结果和旋涡演变的特征。

与邻域空间相关的网络解释 [注：此内容来源于网络，仅供参考]

etale neighborhood：层邻域

estimator 估计量 | etale neighborhood 层邻域 | etale space 层空间

etale space：层空间

etale neighborhood 层邻域 | etale space 层空间 | etale topology 层拓扑

neighborhood retract：邻域收缩核

neighborhood filter 邻域滤子 | neighborhood retract 邻域收缩核 | neighborhood space 邻域空间

neighborhood retract：近旁(邻域)收缩核

邻近;近旁;邻域 neighborhood | 近旁(邻域)收缩核 neighborhood retract | 邻域空间 neighborhood space

neighborhood space：邻域空间

neighborhood retract 邻域收缩核 | neighborhood space 邻域空间 | neighborhood system 邻域系

Social contact space of neighborhood：邻里交往空间

区域方向直方图:region direction histogram | 邻里交往空间:Social contact space of neighborhood | 图的下完美邻域数:the lower perfect neighborhood number of graphs

neighborhood system：邻域系

neighborhood space 邻域空间 | neighborhood system 邻域系 | neighborhood topology 邻域拓扑

neighborhood system：近旁(邻域)系;邻域组

邻域空间 neighborhood space | 近旁(邻域)系;邻域组 neighborhood system | 邻曲线 neighboring curve