查询词典 algorithm

In this thesis, we implement a computational procedure to categorize and classify 3-D objects from their contour under a simple environment. First, we use foreground detection, Canny edge detection and speedy GVF snake to obtain the object's contour. The contour is then used to establish the object's features. Two databases are built using methods which compute similarity by modified aspect-combination algorithm proposed by Cyr and Kimia and new proposed aspect-combination algorithm. By using these two databases, we recognize 3-D objects using four recognition methods and compare their performance. Finally, a conclusion is made that our newly proposed algorithm is better than the modified algorithm proposed by Cyr and Kimia.

在本论文中，对一个在单纯环境下的三维物体，由撷取到辨识出此物体做了一个完整的实现，首先，利用前景侦测结合肯尼边缘侦测法和加速的梯度向量流动态轮廓侦测法，来得到物体轮廓，接著利用此轮廓找寻出物体的特徵，然后配合计算相似度的方法，代入修改后的Cyr and Kimia的外观结合演算法（aspect-combination algorithm）和新提出的外观结合演算法去建资料库，然后，对於三维物体则依据两种不同方法所建出的资料库，利用四种辨识的方法来辨识并比较其结果，最后得出新提出的外观结合演算法是优於修改后的Cyr and Kimia的外观结合演算法的结论。

Combined these several traditional optimal path algorithms and ant foraging behavior, a new algorithm was introduced, that was Ant Colony Algorithm.

在以上几种经典最优路径算法的基础上结合蚂蚁觅食行为引入新的算法——蚁群算法(Ant Colony Algorithm，ACA)。

The update model of the probability vector in compact GA is characterized by random walk, based on which the components update of the probability vector in the CGA with binary code is studied. A novel algorithm is proposed consequently. By using this algorithm, the fitness difference of the two competitors is increased. This can guarantee the probability vector updates availably.

紧致遗传算法中概率向量进化的模型是随机游动模型，据此研究了二进制编码中向量分量的进化特性，提出了分级竞争紧致遗传算法（grading competition compact genetic algorithm，GCCGA），加大参与竞争的两个个体的适应度的差距，使概率向量有效进化。

A good platform for web recomposition is built on this basis.Aiming at the advantages and deficiencies of these methods, on the basis of analyzing the characteristics of natural evolution, modifications are made on the Genetic Algorithm. A BMGA (Balanced Multi-objective Genetic Algorithm) is proposed.

结合网络服务组织和网络服务重组的基本需求，在分析自然界进化特点的基础上，通过对遗传算法进行改进，在保证主要进化方向优化的前提下，让各进化方向平衡发展，提出了一种平衡多目标遗传算法BMGA(Balanced Multi-Objective Genetic Algorithm)。

Traditional link access control algorithm such as LBRCA（Link Bandwidth Require Control Algorithm） has the problem of high link access rejection probability and low bandwidth resource usage ratio.A model of sharing bandwidth allocation in multi-link is proposed,the features of link bandwidth allocation and QoS level are also discussed.The DBAMQ（dynamic bandwidth allocation and multi-level QoS） link access control algorithm is presented.In this algorithm,the bandwidth is readjusted according to variable QoS level.

针对传统的基于带宽请求链路接入控制算法（Link Bandwidth Require Control Algorithm，LBRCA）的接入成功率和系统带宽利用率不高的问题，设计了一种多链路接入共享带宽分配模型，分析了链路带宽分配和QoS等级的特点，提出一种动态带宽分配分级QoS链路接入控制算法DBAMQ（Dynamic Bandwidth Allocation and Multi-level QoS），该算法在保证某QoS等级的基础上允许动态地对系统的带宽进行重分配。

Moreover, the proposed VIGA was applied to optimize two typical testing functions with multimodal and multivariate. From the comparison of different optimized solutions by conventional GA, simulated annealing algorithm with the analytical for the testing functions, the feasibility and validity of the VIGA was verified.

以2个典型测试函数为例，分别进行了多峰值、多变量测试函数寻优测试，通过将VIGA寻优结果与测试函数解析解、传统遗传算法(genetic algorithm，GA)以及模拟退火优化(simulated annealing algorithm，SA)策略所得优化结果进行对比分析，VIGA的可行性和有效性得到证实。

Based on the propagation algorithm of signal probability,the decomposition algorithm of a multi-input XOR/AND gate,and the multiple segment algorithm of polarity conversion,this paper successfully applies the whole annealing genetic algorithm to find the best polarity of an RM circuit.

徐建 宁波大学电路与系统研究所，宁波 315211针对n变量逻辑函数在不同极性下所对应REED-MULLER 电路功耗和面积不同的特点，对信号几率传递算法、多输入XOR/AND门的低功耗分解算法和多成份极性转换算法进行了深入研究，成功地将整体退火遗传算法(whole annealing genetic algorithm，WAGA)应用于RM电路最佳极性的搜索。

Supposing processing information as a task of node,power constraints of node is considered,and node uses way of awaking/sleeping,during awaking assureed that sensor node accomplishes task and cluster head node can schedule multi-task of sensor node.will resolve such problem:before satisfying multi-tasks deadline invaliding of sensor node,how to feasibly schedule schedule algorithm of improving Rate-Monotonicand dynamic Preemptive Earliest Deadline First Algorithm,via concrete example are presented,The process of algorithm achieving is explained.

假定每个节点对信息的处理看作是一个任务，考虑节点能量限制，节点采用唤醒/休眠机制，在唤醒期间确保节点任务完成，簇头节点能够调度处理多个传感器节点的任务。文中解决的问题：在满足多个传感器节点任务处理的截止期失效前，簇头节点如何合理的调度任务，提出了改进的 RM(rate-monotonic)调度算法和动态的抢占式最早截止期优先任务调度算法(Preemptive Earliest Deadline First Algorithm，PEDFA)。

By introducing the real valued code, deteminstic crowding niching algorithm, improving the genetic algorithm, we present an evolutionary algorithm that generates Hypercube detector - Deviation Levels based Detection Algorithm and an evolutionary algorithm that generates fuzzy rule detectors - Fuzzy Rules based Anomaly Detection Algorithm.

通过引入实数编码，精确排挤小生态算法，对遗传算法进行改进，研究了基于背离等级的检测算法(Deviation Levels based Detection Algorithm，简称DLDA)，同时为了提高检测的准确性，引入了一种生成模糊检测规则的演进算法，使用模糊异常检测算法，对网络中的异常行为进行模糊检测。

Then a BGPEOpt(BGP Egress Optimization Algorithm) algorithm is proposed to reduce the execution time of the typical algorithm by leveraging the .characteristics of cut link in the topology graph to reduce the frequency of recomputing traffic demand. Further more, mediate results are used in the iterative process to reduce the time of computing the IGP shortest distances from a source node to other nodes. Experimental results indicate that the running time of BGPEOpt reduced 7%~30% with the similar link utilization comparing to that of typical algorithms.

在此基础上，提出了静态阶段的BGP出口选择优化算法BGPEOpt(BGP Egress Optimization Algorithm)，BGPEOpt算法利用网络拓扑结构中割边的特殊性，减少流量矩阵重新计算的频率；同时利用算法在迭代过程中的中间结果，减少重新计算从一个源节点到其它节点最短路径的时间，从而提高了算法的时间性能。

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.

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