查询词典 algorithms

Results of both theoretical analysis and calculation examples show that these algorithms are effective, and the accuracy of algorithms relies on the expectation of nodal voltage and computation accuracy of covariances.

理论分析和算例结果表明了这些算法的有效性，算法的精确性依赖于节点电压的均值和协方差的计算精度。

In this thesis, the theories and methods of GA are analyzed in detail , the trend of GA in recent times is briefly discussed. Because of the importance of image segmentation, two methods of color image segmentation based on GA are proposed. One is the surface of thresholds image segment method, the other is entropic threshold method. Two algorithms are realized through VC++ 6.0. After that, we compare the characteristics of two algorithms and prove that GA can be very well applied to solving image optimal problems.

本篇论文比较详细地论述了遗传算法的基本理论、方法，指出了算法的研究现状，由于图象分割的重要性，提出了两种基于遗传算法的彩色图象分割方法，即阈值曲面分割方法和最佳熵阈值分割方法，通过VC++6.0编程得到了实验验证，比较了两种算法的性能，证明遗传算法完全适用于图象的优化问题。

Entropic algorithms realizing automatic segmentation of chromosomes in one scene were proposed. These algorithms adequately consider properties of chromosome images, such as a large number of chromosomes in one scene, many broken pieces in one chromosome with bright and dark bands, etc.

文中提出了实现染色体的自动分割的熵分割算法，该算法充分考虑了每个视野中分割目标的数量大以及人类显带染色体被明暗交迭的带纹分割为若干不连续的片段等特点。

In this ***, we also show how to compute a perceptual matrix about the Just Noticeable Difference based on Watson model. Then, according to the matrix, we develop two new algorithms of digital watermark based on Discrete Cosine Transform. In the last part of this chapter, we use some experiments to validate our algorithms.

在对Watson的视觉模型作了较为详细的描述的基本上，依据Watson模型并结合JPEG图像紧缩中常用的DCT变换及JPEG紧缩量化表，提出了基于Watson模型的DCT域低频与中频数字水印算法，并给出试验结果。

In the first place, this paper reviews two main methods in surface triangulations, named as plane projection and direct triangulation. For the former, Delaunay triangulations are mainly enunciated. For the later, algorithm developed by B. K. Choi is particularized. Some typical algorithms are introduced in detail, as well as various data-structures built in these algorithms.

本文回顾了三维散乱点集曲面三角剖分的两种主要方法即平面投影法和直接剖分法，对几种常用的算法作了较为详细的描述，同时对剖分算法中经常出现的数据结构作了详细的介绍。

It is pointed that, in practical engineering, it is necessary to develop new algorithms with new criteria for triangulations of scattered points sampled from complicated surfaces so as to maintain the properties such as better smoothness and shape preserving. Finally the time and space complexities of various algorithms are briefly and concisely discussed, also the research trend of surface triangulations based on 3D arbit rary point-sets.

最后简要地讨论了算法复杂度以及目前剖分的主要研究方向，并指出在实际工程应用中对复杂曲面采样得到的散乱点集，要得到光顺和保形的三角剖分，需要新的剖分准则和算法。

In this dissertation, we have discussed and compared these algorithms in the environment of quickly changed echo path, time-varying noise, and double-talk We also have used actual voice data to simulate these states, and have simulated these algorithms in such states.

文中逐个比较了几种常见算法，对它们在时变回声信道、时变噪声和双讲这些声场状态变化下的性能进行分析比较，用实际语音数据模拟出类似声场状态的变化，并进行仿真。

Researches on kernel clustering algorithms. After combining K-means clustering algorithm and the theory of kernel-based learning algorithms, we propose a fast kernel K-means clustering method which is based on CPD kernel. The experiment results indicate that the clustering effect of the algorithm is better than that of K-means algorithm, the clustering speed of the algorithm is also fast than that of K-means algorithm.

核聚类算法的研究：探讨了K-均值聚类算法，通过将核学习理论与K-均值聚类算法结合，提出了一种基于CPD核函数的快速核K-均值聚类算法，并将该算法与基于Mercer核的核聚类算法进行了比较，实验结果显示，我们的方法不仅比K-均值聚类算法的聚类效果好，而且聚类速度快。

Firstly, this paper carries a deep research of K-means which is one of clustering analysis algorithms, and proposes an efficient clustering algorithm based upon vector space initial clustering and nearby cluster search, which is composed of the two sub algorithms SPIC and CANC.

本文首先对聚类分析方法中的K-means算法展开深入研究，提出了一种基于向量空间预聚类和邻近簇调整聚类的高效聚类算法，该算法由两个子算法部分构成：SPIC子算法和CANC子算法。

T-Group and S-Group are two important types of operation group. To preserve T-Groups in operational transformation new algorithms are developed based on the REDUCE approach, and some explanations and examples of the correctness of the proposed algorithms are also given. We also give a strategy to preserve S-Group in REDUCE approach.

本文中定义了两类操作群：T-群和S-群，给出了维护T-群的操作变换算法，给出了其证明及算法实例，同时给出了维护S-群的系统策略。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。