基于加载算法的室内无线信道OFDM接收机的性能

本文研究了无线局域网中使信号频谱得到优化的一种简单OFDM子载波加载算法。此算法基于边缘自适应（Margin Adaptive）加载准则及其在室内无线信道上的性能。     

A tolerant approach to reconstruct topology from unorganized trimmed surfaces

Presented in this paper is a topology reconstruction algorithm from a set of unorganized trimmed surfaces. Error-prone small geometric elements are handled to give proper topological information. It gives complete topology to topologically complete models, and it is also tolerant to incomplete models. The proposed algorithm is vertex-based in that clues for topological information are searched from the set of vertices first, not from that of edges.     

多部件设备维修问题研究及遗传算法求解

合理组织设备维修，缩短设备维修时间是生产运营管理的一个重要环节。本文探讨了多部件设备维修的有效组织问题。考虑到维修工人对拆分后设备的不同部分具有不同的维修效率，提出了一种基于维修时间优化的决策方法，将其与经典指派方法进行了比较；进一步地，对这一NP-hard问题设计了遗传算法，通过数值例子讨论了其求解有效性。     

并联机床后置处理器的开发及实验研究

以六自由度6-TPS型并联机床为模型，阐述了机床控制数据的生成原理和流程；以此为基础，规划了后置处理器的功能和整体结构。对若干关键技术进行了研究和探讨，包括基于参数化二进制格式的内部数据传输，基于刀轴矢量的笛卡儿空间粗插补算法，三维和二维刀具半径补偿，刀位文件的预处理以及加工代码的词法和语法检查等。最后介绍了利用本系统进行的切削实验，验证了系统的工程实用性。     

基于非锐化掩模的实时自适应图像增强算法

针对传统的非锐化掩模算法的局限性,依据图像中各像素点及以其为中心的若干相邻像素点的均方差值,提出了自适应图像增强算法的原理,并分析其硬件实现方法,然后给出了该算法与其它算法应用于图像增强的对比结果,最后在FPGA（field programmable gate array）实验板上进行验证.实验结果表明,此算法有效的增强图像的细节区域,防止图像边缘区域出现过冲现象,抑制图像平坦区域的噪声放大.因此,该算法取得了良好的视觉效果,硬件实现简单,适合于实时条件下图像的增强.     

Job-shop Scheduling问题的研究

本文研究了Job-Shop类型矛性制造系统的调度问题，建立了数学模型，并用遗传算法进行求解。实践表明，该算法具有较好的实用性和可行性。     

An optimization algorithm based on stochastic sensitivity analysis for noisy objective landscapes

A function minimization algorithm that updates solutions based on approximated derivative information is proposed. The algorithm generates sample points with Gaussian white noise, and approximates derivatives based on stochastic sensitivity analysis. Unlike standard trust region methods which calculate gradients with n or more sample points, where n is the number of variables, the proposed algorithm allows the number of sample points M to be less than n. Furthermore, it ignores small amounts of noise within a trust region. This paper addresses the following two questions: how does the derivative approximation become worse when the number of sample points is small? Can the algorithm find good solutions with inexact derivative information when the objective landscape is noisy? Through intensive numerical experiments using quadratic functions, the algorithm is shown to be able to approximate derivatives when M is about n/10 or more. The experiments using a formulation of the traveling salesman problem show that the algorithm can find reasonably good solutions for noisy objective landscapes with inexact derivatives information.     

Determination of the Coordinates of the Center of a Gaussian Beam by Means of a Matrix Photodetector Using a Weighting Method

A weighting algorithm to determine the coordinates of the center of a Gaussian laser beam projected onto a matrix photodetector is considered. The influence of the internal noise of the photodetector, the maximum brightness of the signal at the beam maximum, and the beam radius on the precision of the algorithm is investigated. Recommendations on image processing are presented.     

COPART:一种面向约束条件的自适应软硬件划分算法

本文介绍一种将自适应算法、遗传算法和列表调度算法结合起来应用于软硬件划分问题的算法COPARTART，并提出了一种基于约束条件的开销系数自适应调整方法，该方法所获得的划分结果能够良好体现设计目标。     

遗传算法的改进及其在电力系统无功优化中的应用

针对无功优化的动态、多目标、多约束以及非线性特点,提出了基于简单遗传算法的改进算法,在简单遗传算法的基础上,添加了自适应控制和适应度排序思想,并对算法终止准则进行了改进。以IEEE14节点标准测试系统为例对该算法进行了有效性验证。仿真结果表明,该方法对电力系统的无功优化效果良好。