找到所有的数据簇。
给出授权约束的可视数据簇维扩充以及ACBR3D的形式化描述。
The former constraints are extended so that it can describe the visual data muster character.
在定义隶属度函数前先做网格划分，形成数据簇的基本形状，并提供真实的参数信息参与此后的隶属度函数定义。
The algorithm presents a clear and precise membership function for every cluster after data preprocessing by traditional grid partition.
另外的解决方案，取决于具体的错误，可能是手工重建非聚簇索引，如果数据是静态的手工扔掉和重新载入表，诸如此类。
Additional solutions, depending on the errors, may be to manually rebuild non-clustered indexes, manually drop and reload a table if the data is static, and so on.
Peerset从数百万计的网站、档案、状态消息中提取数据，并整理成一系列关键词簇。
Peerset scrapes data from millions of sites, profiles and status messages and compiles a series of word clusters.
数据聚簇对于数据仓库查询性能的影响尤其显著，因为常常在一个查询中获取许多行。
Data clustering can have an especially large impact on data warehouse query performance, because rows are often retrieved in large Numbers.
总线是连接计算机各部件的一簇公共信号线，由地址总线、数据总线和控制总线组成。
The bus is the computer parts connected by a bunch of public signal, address bus, data bus and control bus composition.
MapReduce簇可以通过替换函数子和提供新的数据源来重新使用，而无需每次都对整个应用进行编译，测试和部署。
MapReduce clusters are reused by replacing the functors and providing new data sources without having to build, test, and deploy a complete application every time.
该算法将具有足够高密度的区域划分为簇，并可以在带有“噪声”的空间数据库中发现任意形状的聚类。
It can handle spatial data and spot any-shape clusters in a noised spatial database by dividing them into clusters with high enough density.
从栅格数据创建斑块主题是创建一个新图层(主题)，每类像素簇被指定其面积和周长。
Create Patch theme Grid creates a new layer (theme), where each clump of like-classified pixels is assigned its own area and perimeter.
从栅格数据创建斑块主题是创建一个新图层(主题)，每类像素簇被指定其面积和周长。
Create Patch theme from Grid creates a new layer (theme), where each clump of like-classified pixels is assigned its own area and perimeter.
本文重点描述了这个结构及其对数据质量有效支持的机制——簇和转换代理。
The highlight in this paper describes a mechanism which is used to develop data quality in the architecture.
IP是一簇非常复杂的协议，尤其是TCP协议，因此实现它需要很大的程序空间和数据空间。
However, TCP/IP protocol suit, especially for TCP is so complicated that it needs an amount of program space and data space to implement.
这种方法可以用来过滤“噪声”孤立点数据，发现任意形状的簇。
The method can be used to filtrate the outlier data and discover clusters of arbitrary shape.
新建像数组和簇这样的符合数据的控制器和指示器需要两个步骤。
It takes two steps to make the controls and indicators for compound data types like arrays and clusters.
为解决上述矛盾问题，提出了一种轻量级的、能量有效的、基于无损聚合的层次分簇数据收集机制(QTBDC)。
To solve the contradiction problem, a lightweight, energy efficient, in-network lossless aggregation and hierarchical cluster was proposed based on data collecting mechanism (QTBDC).
提出一种传感器网络中层次簇模型的分布式数据压缩算法。
A new distributed algorithm of data compression of hierarchical cluster model in sensor network is proposed.
本文采用中国经济系统的152个主要指标的11年数据，先后建立了全变量自组织模型和采用簇分析后的核心变量自组织模型。
According to 152 indexes of China economic system for 11 years data we make self-organization models for all variables and core variables by cluster analyze.
分簇协议的目的是要利用节点有限的资源，完成高效的数据采集任务，延长网络使用寿命。
The purpose of clustering protocol is to achieve efficient data collection by making use of the limited resource in wireless sensor networks, which prolongs the lifetime of networks.
针对这个问题，分析了簇内数据误差成因，提出了一种改进后的自适应数据融合算法。
Aiming at this problem, this paper analyzed the reason of the errors in WSN, and presented an improved adaptive data fusion algorithm.
并通过对试验数据进行拟合，确定不同粉煤灰掺量混凝土簇单元的流变参数。
By fitting the experimental data, the cluster unit rheological parameters of different fly ash content concrete were determined.
表或者簇中的存储参数决定了数据段中区的分配原则。
A segment is a set of extents that contains all the data for a specific logical storage structure within a tablespace.
本文也进行了划分为二级簇结构或数据传输多跳的尝试性研究，其方案为LEACH - CT。
This paper also made an attempted research on dividing nodes into Secondary cluster structure or multi-hop data transmission. and the method is LEACH-CT.
算法的目的是为了支持MANET环境中的数据复制，通过分簇来预测网络分割，以提高数据访问的可用性。
The purpose of the clustering algorithm is to support the data replication for improving data availability at the point of network partitioning in the MANET environment.
本文阐述了MSOL分簇路由算法的基本步骤，设计了算法相应的数据结构和报文。
This paper elaborates basic steps of MSOL clustering routing algorithm, and designs the data structure and corresponding messages.
成员节点负责感知和收集信息，发送数据给簇首节点。
Members of the node is responsible for sensing and gathering information, sending data to the cluster head node.
该协议提出了基于最小成本路径的数据转发法并运用于簇内路由中。
A data delivery based on the minimum cost routing which apply in the cluster is proposed.
探讨了基于非均匀分簇的无线传感器网络路由协议，提出了一种高数据融合的非均匀分簇无线传感器网络路由协议。
This paper discussed the unequal clustering routing protocol for wireless sensor networks, and then presented a highly data fusion unequal clustering routing protocol for wireless sensor networks.
在已有的基于簇的数据传输模式的基础上提出了簇中建簇的新的传输方法。
Based on the clusterbased data transmission mode, the paper proposed a new method that a cluster is built in a cluster.
该算法使得簇头分布更加均匀，同时在数据传输中，提出了改进后多跳路由算法。
The novel algorithm makes it more uniform in distribution of cluster heads, an improved multi-hop routing algorithm is proposed in data transmission.
应用推荐