算法的

A new crossover operator is proposed to keep goad genes and enhance the search performance. Local search mechanism is added into GA to find solutions for TA problems with a more rapid convergence speed. Simulated annealing is used to overcome the problem of local optimum. A heuristically greedy local search is also proposed to improve the search efficiency. The simulation results show that the improved algorithm can improve the search efficiency of GA.

构造了适合于目标分配问题的染色体；设计了搜索性能较好且能够保留优秀基因的交叉操作方法；将局部搜索机制引入标准遗传算法，提高了目标分配算法的收敛速度；把模拟退火算法引入局部搜索问题，在一定程度上避免了局部最优问题；将贪婪算法应用于局部搜索提高了最优分配方案的搜索效率。

This algorithm is designed in the style of tableau algorithms, which is usually used in classical description logics. The transformation rules and the process of this algorithm is described and optimized with three main techniques: recursive procedure call, branch cutting and introducing sets of mesne results.

该算法的设计参考用于经典描述逻辑的tableau算法；详细描述了EFALC的转化规则和推理算法的过程，并使用递归函数调用、分支裁减和引入中间结果集合这3种技术对算法进行优化。

In order to study these algorithms systematically and deeply, they are reviewed in this paper based on c-means algorithm, from metrics, entropy, and constraints on membership function or cluster centers. Moreover, the advantages and disadvantages of the typical fuzzy partitional algorithms are discussed.

为了能更为系统和深入地了解这些聚类算法及其性质，本文从改变度量方式、改变约束条件、在目标函数中引入熵以及考虑对聚类中心进行约束等几个方面，对在C-均值算法的基础上得到的基于划分的模糊聚类算法作了综述和评价，对各典型算法的优缺点进行了实验比较分析。

Simulation results show that the proposed method has good performance in time delay predictation of networked control systems, and the plant output can trace desired output effectively.(2)By combining node buffer queuing management and adaptive predictive control, a novel approach on predictive control of NCS is proposed.

在本方法中，使用了直接辨识控制器参数的自适应预测控制算法，该算法不需要在线求解Diophantine方程，减少了计算时间，较好地保证了NCS的实时性；在此基础上，又进一步提出了一种改进型的自适应预测控制算法，不仅避免了在线求解Diophantine方程，并且也不需要进行矩阵求逆运算，使算法的实时性大大提高。

The reconstruction problem is ill-posed, so two optimal criterions, the least module and the smoothness criterion base on Tikhonov regularization technique, are introduced into reconstruction algorithm. Many regularization parameters choice strategies are investigated, and the TPA(Two—Parameter Algorithm) strategy which is based on the Morozov discrepancy principles, is implemented in two regularization reconstruction algorithms.Numerical experiment results show that the nonnegative and smoothness constraint condition can overcome the difficulty of iteration semiconvergent, preconditioned technique can improve convergence rate and reconstruction accuracy, smoothness regularization criterion can meliorate ill-posed problem of reconstruction and enhance iteration stability, and the TPA is an effective strategy of regularization parameters choice.

数值试验表明：在共轭梯度法中引入非负约束和光滑约束改善了迭代的&半收敛&性，非负约束保证了解的非负性，光滑约束抑制了重建解的振荡现象，约束算法的重建精度与无约束算法相比大幅度提高；在约束共轭梯度重建算法中引入预优技术，可以加快算法的收敛速度，提高迭代的稳定性和重建精度；引入光滑准则的正则化技术可以有效改善图像重建问题的不适定性，加快迭代的收敛速度，提高迭代的稳定性和图像重建质量，计算正则参数的TPA算法在闪光照相图像重建中是有效的。

New coefficients of the equation are developed, then a set of coning error compensation algorithm is derived.

本文丰富和完善了新的圆锥补偿算法设计方法，并利用新的设计方法给出了7种新的圆锥补偿算法，在计算量增加不多的情况下，提高了圆锥误差的补偿精度；圆锥补偿后的剩余误差是评价圆锥补偿精度的重要指标，也是工程实际中设计圆锥补偿算法的重要依据，本文给出了新的圆锥补偿算法精度评定方法，既可以评价圆锥补偿算法的精度，又方便于实际应用

The fluctuation of available wireless link bandwidth motivates the study of adaptive multimedia services in wireless/mobile networks This paper focusses on a bandwidth adaptation scheme, which takes the maximum revenue as the objective The optimal bandwidth adaptation algorithm which seeks to achieve maximum revenue is an NP hard problem, because it has to investigate every adaptation case A bandwidth adaptation scheme based on genetic algorithm is proposed, which achieves near optimal total revenue with much less complexity compared to an optimal bandwidth adaptation algorithm Simulation is carried out to compare the algorithm with an optimal bandwidth adaptation algorithm, the results reveal that the genetic algorithm approximates the optimal solution very well

无线链路带宽的快速波动推动了无线/移动网络中对适应的多媒体服务的研究以无线网络系统的利润最大化为目标，研究适应的多媒体应用的带宽适应方案达到利润最大化的最优带宽适应算法是一个NP hard问题提出一个基于遗传算法的带宽适应方案，在算法复杂度大大低于最优算法的同时，获得的利润值近似最优性能分析和实验结果证明了这一结论1 引言因特网和无线/移动通信技术的迅速发展，推动了两者服务的融合无线/移动环境下因特网服务的提供需要解决的一个关键问题是QoS保证提供QoS保证的一个重要技术手段是连接接纳控制 [1] CAC算法的目标是在保证切换连接请求丢弃率满足系

Firstly, the RFCM algorithm and Apriori algorithm were expounded. The production parameters were fuzzed by fuzzy clustering algorithm. Depending on Fuzzy_ClustApriori algorithm, the fuzzy association rules were studied and implemented in processing industry.

首先阐述了模糊聚类的RFCM算法和关联规则的Apriori算法的内容，分析了实现模糊关联规则的Fuzzy_ClustApriori算法流程，并用RFCM算法对实际数据进行分析，得到不同类别的模糊数。

The motion scope judgement search method based prognosticating the search beginning point, it utilizes the time relativity and the space relativity of block to prognosticate the search beginning point, and adopts the different search pattern according to the block motion scope, the search efficiency is close to the Three Step Search, which proves the feasibility of researching the new efficient motion estimation algorithm according to the characteristic of block motion to use the different search methods; In the end, this paper evaluates the advantage and disadvantage of the different fast algorithms through the data get from the experiment, it will have some reference value to bringing the new and effective motion estimation fast algorithm in the later research.

基于预测起点的运动幅度判断搜索法，该算法利用块的时间相关性和空间相关性来预测搜索起点，根据块的运动幅度大小分别采用不同步长的搜索策略，搜索效率比较接近三步法，证明了根据块运动的特性以结合运用不同的搜索算法来研究有效的运动估计算法的可行性。最后本文通过实验得来的数据来定量地分析评价各快速算法的优缺点，对今后提出新的更有效的运动估计快速算法具有一定的参考价值。

For regularization method, different situations require different types of regularizing term, which employs apriori knowledge to improve the generalization performance of an algorithm in solving a problem.

与SVR现有的SMO算法相比，简化算法的数学形式简洁直观，在不增加算法空间和时间复杂度的前提下避免了大量繁复的判别条件，较大幅度地简化了算法实现，有利于SVR的广泛使用。

It has been put forward that there exists single Ball point and double Ball points on the symmetrical connecting-rod curves of equilateral mechanisms.

从鲍尔点的形成原理出发，分析对称连杆曲线上鲍尔点的产生条件，提出等边机构的对称连杆曲线上有单鲍尔点和双鲍尔点。

The factory affiliated to the Group primarily manufactures multiple-purpose pincers, baking kits, knives, scissors, kitchenware, gardening tools and beauty care kits as well as other hardware tools, the annual production value of which reaches US$ 30 million dollars.

集团所属工厂主要生产多用钳、烤具、刀具、剪刀、厨具、花园工具、美容套等五金产品，年生产总值3000万美元，产品价廉物美、选料上乘、质量保证，深受国内外客户的青睐