选择3作为集群的最大值并用Kohonen作为集群算法。
Select 3 as the maximum number of clusters and Kohonen as the clustering algorithm.
创建了一组矢量之后，接下来需要运行k - Means集群算法。
Given a set of vectors, the next step is to run the k-Means clustering algorithm.
使用Mahout中可用的 Hadoop 就绪的驱动程序运行所选集群算法。
Run the clustering algorithm of choice using one of the many Hadoop-ready driver programs available in Mahout.
InfoSphereWarehouse使用一个统计集群算法将在这两个维上相近的客户分到集群中。
InfoSphere Warehouse USES a statistical clustering algorithm to group customers that are similar in those two dimensions into clusters.
Mahout支持一些集群算法实现(都是使用Map - Reduce编写的)，它们都有一组各自的目标和标准。
Mahout supports several clustering-algorithm implementations, all written in Map-Reduce, each with its own set of goals and criteria.
Mahout为所有集群算法都提供了驱动程序，包括k - Means算法，更合适的名称应该是KMeansDriver。
Mahout provides driver programs for all of the clustering algorithms, including the k-Means algorithm, aptly named the KMeansDriver.
这说明该算法只使用集群的dc列，对于其他的列来说，则只收集统计信息。
This instructs the algorithm to only use the DC columns for clustering, for the other columns, only statistics are collected.
我们的解决方案将采用一种算法（协议）来适应高可用性集群中应用程序（或节点）的第一次和第二次故障。
Our solution was to come up an algorithm (protocol) to accommodate a first and second failure of application (or nodes) within the highly available cluster.
查询主题使用存储过程访问由挖掘算法创建的集群模型的集群信息。
A query subject that USES a stored procedure to access the cluster information of the clustering model created by the mining algorithm.
第2部分将介绍并行算法的知识，并介绍如何编写并行程序、如何构建集群以及如何进行基准测试。
Part 2 covers parallel algorithms, how to write parallel programs, how to set up clusters, and cluster benchmarking.
本文介绍了并行算法，并介绍了如何编写并行程序、构建集群以及对集群进行基准测试。
This article covers parallel algorithms, and shows you how to write parallel programs, set up clusters, and benchmark clusters.
由于所有队列都属于同一个集群，当消息到达队列管理器时，WebSphereMQ将调用工作负载平衡算法来确定应由哪个队列接收此消息。
Since all of the queues belong to the same cluster, when a message arrives to a queue manager, WebSphere MQ invokes a workload-balancing algorithm to decide which queue should receive the message.
集群工作负载平衡算法不允许将消息放置到禁用放置的队列(没有活动消息使用方应用程序的队列)。
The cluster workload balancing algorithm does not allow puts to queues that are put-disabled (those queues with no active message consumer applications).
影响集群工作负载平衡算法。
Mean - Shift：无需任何关于集群数量的推理知识的算法，它可以生成任意形状的集群。
Mean-Shift: Algorithm that does not require any a priori knowledge about the number of clusters and can produce arbitrarily shaped clusters.
还有其他备用方案，包括影响集群工作负载算法的集群通道属性(例如，集群工作负载等级或集群工作负载权重)。
There are additional alternatives, including altering cluster channel attributes that influence the cluster workload algorithm (for example, cluster workload rank or cluster workload weight).
本文主要讨论了网络负载均衡集群系统下，当前的均衡算法和动态负载均衡机制。
Discussed current arithmetic of balance and mechanism of dynamic server load balance in cluster system of server load balance.
然后针对系统性能的提高，介绍了服务器端的负载均衡技术，集群的特点，并具体分析了几种常用的负载均衡算法。
Aiming at reinforcing for the system performance, it then introduces the load balancing techniques on the server side, the features of a Cluster, and some common used load algorithms.
讨论了网络负载平衡集群系统下，基本的平衡算法和动态负载平衡机制。
This article mainly discusses the basic arithmetic and mechanism of dynamic loading balance in the network loading balance clustering system.
本文提出了一种局部集群平均数字图象滤波算法。
A digital image filtering algorithm of local cluster averaging is described.
介绍了MPI并行计算的基本概念和并行计算集群的实现，着重论述了图像处理算法的并行实现方法。
The concept of parallel-computing based MPI and the implementation of parallel-computing cluster are introduced. The parallel way of image processing arithmetic is presented.
对不同函数优化试例的仿真表明细菌群体趋药性算法性能良好，是一种具有进一步研究价值的集群函数优化方法。
The simulation of some test function optimization using BCC algorithm shows BCC algorithm a kind of potentially powerful optimization method worth of much more research.
通过对n皇后问题棋盘矩阵的旋转，改进了回溯算法，并通过计算机集群并行实现了N皇后的计数问题。
Traditional backtracking algorithm has been improved by rotating the chessboard matrix and put into solving N-queens counting problem in computer cluster.
在集群系统中，为了提升已有资源的资源利用率，调度算法的改进和优化是关键。
In cluster system, it is key point to improve and optimize the scheduling algorithm for increasing the utilization of system resource.
算法在某指控实时集群系统中的应用证明了它的可行性。
The application in a command and control real-time cluster system proves its feasibility.
本算法在高性能计算机集群MPI环境中并行实现时，采用主从模式设计程序，合理调配各节点的计算负载，并应用容错处理手段，达到了较高的并行效率。
The method was realized in powerful cluster MPI computing environment using master-slave model. Strategies of load relocation on different nodes and fault-tolerance were adopted.
在对集群结构的深入分析基础上，探讨了负载均衡算法的主要研究内容。
Then it explores the main contents of the load-balancing algorithm based on an in-depth analysis of the structure of the cluster.
结合加权轮询算法讨论了集群的动态负载反馈机制，给出了一个基本的动态均衡模型并加以分析。
Discussed the mechanism of dynamic feed backed load and given a basic and dynamic balance model and analysis it combined with the arithmetic of Weighted Round-Robin Scheduling.
高性能集群上运行的应用程序一般通过并行算法来缩短计算周期。
In general, the application program running in High-Performance computing Cluster shorten computing period through parallel arithmetic.
高性能集群上运行的应用程序一般通过并行算法来缩短计算周期。
In general, the application program running in High-Performance computing Cluster shorten computing period through parallel arithmetic.
应用推荐