算法

Semi-active control algorithms can make some seismic responses of bridge nodes neighboring the dampers to produce acute magnifying effect. The continuous type semi-control algorithms can mitigate the ""needlepoint"" phenomenon well because they operate the damping force more gently, and their acceleration-magnified effect are more mitigatory than that of switch type algorithms.

半主动控制算法会使得阻尼器附近桥梁结点的某些地震反应会产生剧烈的放大效应，"连续型"控制算法由于能够较为平缓地施加阻尼力，能够较好地减轻"针尖"效应，其加速度放大效应比"开关型"控制算法缓和，而采用主动控制时没有出现加速度放大效应。

This paper presents a fixed point number and floating point number mixed algorithm for the precise straightening press automatic detecting system.

针对精校机自动检测系统研究中出现的问题，提出一种定点数和浮点数混合算法，并进行浮点数算法与定点数浮点数混合算法之间的对比实验。

In this paper, we propose an improved evolutionary programming using a mixed strategy based on Gaussion mutation and single-point mutation, which is named SPCEP.

本文提出一种基于经典进化算法和单点变异算法的混合策略进化算法SPCEP。

As expected, the results show that GA cannot identify the high order building block problems. Also, the problem for mixing and juxtaposing of building blocks is analyzed. The study suggests that simple selection and crossover require the help of additional operators if fast, efficient processing is desired.

由Holland首先提出的基本遗传算法是研究最为广泛的进化计算算法之一，其基本理论依据是模式定理和"构造块"假设理论，但理论和应用表明GA中的重组操作常造成构造块破坏，导致算法容易早熟逼近局部。

Since both Mnemosyne and Anki are based on a early version of the SuperMemo algorithm, it is, in some sense, the "original," although the current algorithm is far more complicated than the ones used in Mnemosyne and Anki.

显然，supermemo具有最好的算法，既然mnemosyne和anki都是根据supermemo早期的算法来设计的，那么从某种程度上来说，supermemo的目前的算法要比mnemosyne和anki的更先进。

The paper contains four parts. In the first chapter, the application back ground and the main algorithms of the complementarity problems is introduced. In Chapter 2, some basic definitions and theories of complementarity problems are introduced. The 3rd chapter is the most important part of this paper, in which a modified smoothing Newton method is detailed; also the global convergence is established for the method.

全文共分为四章，各部分内容安排如下：第一章是绪论部分，介绍了互补问题的应用背景和近年来有关互补问题求解方法的研究成果；第二章是预备知识，介绍了与求解互补问题有关的一些定义以及相关的定理和推论；第三章是本文的重点，提出了求解互补问题的一种修正的光滑Newton算法，从理论上对算法的全局收敛性了证明；第四章是这种修正的光滑Newton法用于求解广义非线性互补问题中，同样证明了算法的全局收敛性。

FMA decreases the computation complexity from O to O by decomposing the dense matrix in Moment Method into the combination form of four sparse matrix—Near interaction, Aggregation, Translation and Deaggregation matrix.

本文严格推导了二维和三维快速多极算法的各步骤，并根据其稀疏矩阵形式，讨论了该算法的计算量和存储量；提出了获得该算法众多参数选取规则的新途径，在理论上丰富和发展了该方法。

A automatic image morphing algorithm based on wavelet edge detection is presented.

改进了基于域的图象变形算法，较大地减小了变形算法的复杂度，提高了算法的运算速度。

A recorded human voice pours into an algorithm which figures out how Moxy's lips should move, and then moves them.

这是通过一个算法做到的，你把录制好的人声灌入这个算法，这个算法就可以计算出莫西的嘴唇到底应该怎么动，然后引动它们。

We present a SNMP-based topology discovery algorithm using direct connection theorem and simple connection theorem for judging relationship of switches in subnets. In order to in discover the map of network without SNMP, several key problems such as subnet guessing and multi-address routers are discussed in details. And then a topology discovery algorithm based on primitive protocols is presented. We also deeply study some routing protocols such as OSPF and BGP and propose a routing-protocols-based algorithm for topology discovery.

基于判断交换机互联的直接连接定理和间接连接定理，提出了一种完整的基于SNMP的拓扑发现算法；详细讨论了子网获取、多址路由器处理等关键问题，针对不同的网络环境给出了相应的解决方案，并以此为基础提出了一种基于通用协议的拓扑发现算法；在对OSPF，BGP等网络路由协议进行分析的基础上给出了一种基于路由协议的拓扑发现算法，并设计了一个自上而下的拓扑发现框架结构。

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.

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