查询词典 algorithm

One is tradition algorithm,which consists branch and bound method,improving loop method,cupidity algorithm,MST algorithm,MM algorithm,insertion method.Another is modern optimization algorithm which consists simulated annealing algorithm,artificial immune algorithm,genetic algorithm,ant colony algorithm,particle swarm optimization,Tabu Search,Hopfield neural network.The third is algorithm of DNA computing which is designed by authors.

第一种为传统算法，包括分支定界法、改良回路法、贪婪算法、MST算法、MM算法、插入法等；第二种为现代优化算法，包括模拟退火算法、人工免疫算法、遗传算法、蚁群算法、粒子群优化算法、禁忌搜索算法、Hopfield神经网络算法等；第三种为论文提出的DNA计算算法。

It solves the problem that the unitary contour presentation can not correctly extract face contour in a face image which suffers from scale, rotation etc. The definition of the internal and external energy function is provided. At the same time, the global matching algorithm and local matching algorithm is given. The experiment shows that this presentation and the accompanying matching algorithm can be used to extract the face contour very well. So the image segmentation can be implemented by using it.②By analyzing the recognition principle of PCA method, we can conclude that the face images coming from different surrounding consist of different face image space. This is the essential reason that makes the generality of PCA method worse. Also, we give a measurement means to measure the distance from different face image space, so we can analyze face image space more conveniently.③We also construct various scale models and rotation pose models to detect the scale and rotating angle of face image to be recognized. The experiment results show that the detecting precision is very high. So it is good for face image feature extraction and face image representation.④Similarly, we construct local feature models of face image and utilize them to detect the local feature of face image. At the same time, we put forward a novel face image local feature detection algorithm, locating step by step. The experiment results show that this method can accurately detect the location of local face feature in a image.⑤A novel face image presentation model, dual attribute graph , is put forward. Firstly, it utilizes attribute graph to present the face image, then exact the local principal component coefficient and Gabor transform coefficient of thc pixels which corresponds to the nodes of the graph as the attribute of the nodes. This representation fully makes use of the statistical characteristic of the local face feature and utilizes Gabor transform to present the topographical structure of face image. So DAG has more general property.⑥Based on the DAG presentation, we give a DAG matching function and matching algorithm. During the design of the function and algorithm, the noise factor, e. g., lighting, scale and rotation pose are considered and tried to be eliminated. So the algorithm can give more general property.⑦A general face image recognition system is implemented. The experiment show the system can get better recognition performance under the noise surrounding of lighting, scale and rotation pose.

本文在上述研究的基础上，取得了如下主要研究成果：①构造了一个通用的人脸轮廓模型表示，解决了由于人脸图象尺度、旋转等因素而使得仅用单一轮廓表示无法正确提取人脸轮廓的问题，并给出了模型内、外能函数的定义，同时给出了模型的全局与局部匹配算法，实验表明，使用这种表示形式以及匹配算法，能够较好地提取人脸图象的轮廓，可实际用于人脸图象的分割；②深入分析了PCA方法的识别机制，得出不同成象条件下的人脸图象构成不同的人脸图象空间的结论，同时指出这也是造成PCA方法通用性较差的本质原因，并给出了不同人脸空间距离的一种度量方法，使用该度量方法能够直观地对人脸图象空间进行分析；③构造了各种尺度模板、旋转姿势模板以用于探测待识人脸图象的尺度、旋转角度，实验结果表明，探测精确度很高，从而有利于人脸图象特征提取，以及图象的有效表示；④构造了人脸图象的各局部特征模板，用于人脸图象局部特征的探测；同时提出了一种新的人脸图象局部特征探测法---逐步求精定位法，实验结果表明，使用这种方法能够精确地得到人脸图象各局部特征的位置；⑤提出了一种新的人脸图象表示法---双属性图表示法；利用属性图来表示人脸图象，并提取图节点对应图象位置的局部主成分特征系数以及Gabor变换系数作为图节点的属性，这种表示方法充分利用了人脸图象的局部特征的统计特性，并且使用Gabor变换来反映人脸图象的拓扑结构，从而使得双属性图表示法具有较强的通用性；⑥在双属性图表示的基础上，给出双属性图匹配函数及匹配算法，在函数及算法设计过程中，考虑并解决了光照、尺度、旋转姿势变化等因素对人脸图象识别的影响，使得匹配算法具有较强的通用性；⑦设计并实现了一个通用的人脸图象识别系统，实验结果表明，该系统在图象光照、尺度、旋转姿势情况下，得到了较好的识别效果。

Finally, it analyses the time complexity of the algorithm and researches how it is influenced by culture operator.3、The paper presents the evaluation standard of the GA's application capability. Basing on characters such as continuity, multi-peak, vibration, randomicity as well as large-scale, five functions are selected to test search ability and robustcity of co-evolution algorithm. Finally, it analyses the simulation result and researches the influence of algorithm brought by culture operators.4、Basing on the concept of collection overcast, it researches the task distribution issue and constitutes delaminated math model on task distribution issue. It puts out the co-evolution algorithm of subtask's decomposing. The experiment compare IGA、SGA to CN and validates the efficiency of co-evolution algorithm on the NP completeness issue.5、Being aim at the optimization issue of load of antenna near ground, it combines many GA strategies and puts forward strategic meme. And it puts out co-evolution algorithm of load of antenna design. And it emulates the optimization design of load of antenna near ground. Finally, it valuates the co-evolution algorithm's efficiency on the continuum search issues of multi-variable and multi-peak value.6、Being aiming at the knowledge of image model matching, it adopts single meme and real code. It puts out fast co-evolution matching algorithm strategy. Basing on NPROD resemble measurement, I emulate the indiscrimination model matching and discrimination model matching. Finally, it valuates the co-evolution algorithm's efficiency on the real code and real time search issue.

分析了算法的时间复杂度，研究了文化算子对算法时间复杂度的影响。3、提出了GA的应用性能评价标准，从连续性、多峰性、随机性、振荡性、广域性多个角度出发选择五个测试函数，对共同进化算法的搜索性能和鲁棒性作了函数优化的性能测试，分析了仿真结果，研究了文化算子对算法的影响。4、基于集覆盖的概念，研究了MAS中的任务分配问题，建立了任务分配问题的分层数学模型，给出了子任务分解共同进化算法，实验比较了IGA、SGA、CN，验证了共同进化算法对NP完全问题的有效性。5、针对近地天线加载优化设计问题，结合多种改进GA策略，提出了策略型拟子，给出天线加载设计的共同进化算法，对有耗半空间对称偶极子天线加载优化设计作了仿真实验，验证了共同进化算法对多变量多峰连续搜索问题上的有效性。6、针对图像模板匹配问题的领域知识，采用单类拟子和实数编码，给出快速共同进化匹配算法策略，基于NPROD相似度测度，仿真试验了无差别和有差别模板匹配，验证了共同进化算法对实数编码和实时性搜索问题上的有效性。

On this basis, according to historical data, apply ANN and differential simulation method to get the quantitatively correlative relations between each production and its own influence factors, and introduce the new methods of prediction for dynamic indexes with gas-field development (The combinatorial prediction method based on fuzzy comprehensive evaluation, the method of ANN to select optimally combinatorial prediction models and the ANN prediction method based on genetic algorithm).(2) Base on mathematical programming, combine with quantitative economics and techno-economics, introduce economical indexes to establish production"s distribution optimal model, production"s constitution optimal model and measured production"s constitution optimal model, including multi-objective models and five-years models. Upon this, the optimal project for all gas field and each gas-collected factory can be got. Also, introduce the time value of capitals to improve on these models.(3) Base on the optimal solution theory and algorithm theory for the nonlinear programming problem, introduce the SUMT algorithm and genetic algorithm to study how to solve the models, and on the basis of normal genetic algorithm, make use of auto-adaptively modulating method to improve on normal genetic algorithm; Base on algorithm"s convergence theory and calculation"s complexity theory to analyze seriatim SUMT algorithm"s convergence and genetic algorithms convergence, and compare performance with each other.

在此基础上，利用神经网络方法和微分模拟方法根据历史数据得到各分项产量与其影响因素之间的定量关联关系，并引入气田开发动态指标新的预测方法(基于模糊综合评判的组合预测方法、神经网络优选组合预测模型预测方法以及基于遗传优化的神经网络预测方法)；(2)以数学规划为基础，结合数量经济学和技术经济学，引入经济指标建立产量分配优化模型、产量构成优化模型、措施产量构成优化模型、气田开发多目标规划模型以及五年规划模型，进而获得全气田及各采气厂的最优方案，并引入资金时间价值对五年规划模型进行改进；(3)以非线性规划问题的最优解及算法理论为基础，引入SUMT算法以及遗传算法对模型的求解进行研究，并在原有的遗传算法基础上，引入自适应调整方法对遗传算法进行改进；以算法的收敛性理论和计算复杂性理论为基础，逐一分析SUMT算法以及遗传算法的收敛性，并比较三种算法的优劣性。

This system mainly contains the front-end pulse interception and back-end software analysis. In the first part, we used a non-invasive infrared measurement method based on the dual channel simultaneous measurement technique. We measured the photo-plethysmograph from the subject's fingers and toes simultaneously, then used an analog circuit and central control unit to process the signals. Finally, the digital volume pulse data is processed by a personal computer. Because the characteristic points of digital volume pulse always occur in sharp variations, this paper proposes two algorithms to solve this problem. First, we find the pacemaker and percussion wave peak from transient slope variation, and then locate the dicrotic notch and dicrotic wave peak by using the wavelet transformation algorithm. When we analyze the data, we use the Visual Basic graphical user interface, which together with the Matlab is the core of the system.

本系统主要包含前端脉波撷取及后端软体分析两部分，其中前端脉波撷取部份是以非侵入式的红外线量测方式，双通道同步量测受测者手指与脚趾的光容积变化描记图，同时将此讯号经类比处理电路及中央控制单元输出成为数位容积波，再传送至个人电脑中；而在后端软体分析部份，因数位容积波之特徵点皆出现於波形中急剧变化的部份，故本论文以瞬间斜率变化量来定位脉波讯号中的起搏点及主波峰顶点，并利用小波转换演算法（wavelet transformation algorithm）来分析重搏切迹与重搏波顶点；程式撰写主要以Matlab为核心，结合Visual Basic的图形化使用者操作介面，增加系统与使用者间的亲和力。

Aiming at the two main disadvantages of the MUSIC (Multiple Signal Classification Algorithm) method, longer computing time and the adverse effect of issuable false peaks to the fault detection, the corresponding solution methods is proposed.

针对MUSIC(Multiple Signal Classification Algorithm)算法用于故障诊断的两大缺点：运算量大和可能产生的虚假波峰对故障特征的混淆带来的不利影响，给出了相应的解决方法。

Clustering has been discussed and applied in many areas, and K-means algorithm is one that best represents of Partitional clustering algorithms.

分群在许多领域被广泛的讨论与应用，其中K-means Algorithm是分割式分群演算法的代表。

This paper analyzes the key ideas of Minimum InterferenceRouting Algorithm for LSP routing and then surveys the current improved schemes of MIRA. According totheir technical methods, they are classified as reconfirming critical links class, utilizing traffic profile informationclass, adding admission control class, and solving multiple Quality of Service constraints class.

深入剖析了LSP选路算法中的最小干扰选路算法(minimum interference routing algorithm，简称MIRA)的关键思想，综述了对MIRA的各种改进方案，并依据其实现方案将现有主要最小干扰选路算法分为4类：关键链路的重新定位类、利用流量特征信息类、增加准入控制类和解决多服务质量受限类。

A filter based algorithm which continuously maintains sliding window skylines over a wireless sensor network is proposed.

提出了一种基于过滤的算法（filter based algorithm，FBA）来连续地维护传感器网络中的滑动窗口轮廓查询。

Therefore, this paper analyzes the merits and demerits of the pseudo parallel genetic algorithm and discusses the optimum possibility by using PPGA, and at last, applies it to the optimization of maintenance planning for existing bridges.

为此，分析伪并行遗传算法的优缺点，探讨用伪并行遗传算法(pseudo parallel genetic algorithm，简称PPGA)求最优桥梁维修管理计划的解的可能性，并用于桥梁维修管理计划的优化。

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.

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