大容量储能发电机并联运行励磁控制算法

大容量储能发电机作为脉冲电源,整流后通过逆变器向大功率脉冲负载供电。采用储能发电机直流侧并联方式工作,可以有效提高系统带载能力与可靠性。当并联运行的储能发电机转速不同时,根据转速合理分配电机释放功率可以有效提高系统工作效能,因此需要设计一种具有功率调节功能的励磁控制算法。在电压、电流双闭环控制的基础上,引入功率前馈控制,推导并求解了前馈功率与励磁电流关系以及控制参数,并根据电机初始转速设计了功率分配算法。仿真试验结果表明,功率前馈控制在励磁控制过程中起主导作用,有效分配储能电机释放功率大小,提高了励磁电流响应速度,抑制了负载功率扰动对励磁控制系统的影响。     

决策系统的信息机理

本文从信息与决策的角度,分析了决策系统信息特性的几个侧面,为研究信息对决策系统的作用机理做了一些基础性的定量工作。     

基于语音频谱包络抽取的MFCC算法

MFCC可以更加准确地表示语音低频处的频谱包络,在语音转换中是一种很好的频谱包络表示方法;提出一种新的有效的求解MFCC的算法,先对频谱通过谐波抽取得到阶梯谱包络,再对阶梯谱包络进行Mel尺度变换,最后通过余弦变换求得MFCC参数。该方法实现简单,运算结果准确。     

独立分量分析在雷达盲信号处理上的应用

独立分量分析(ICA)是近年来发展起来的一种有效的雷达盲信源分离方法。目前新体制雷达的大量涌现,运用原有的雷达分选方法是无法分选的,这已经无法适应现代复杂的电磁环境。在深入分析FastICA算法的基础上,将其应用于连续波雷达信号分选中。计算机仿真表明,这种算法应用于连续波雷达盲信号分选时,不仅提高了信号的分选速度和信号分离的准确率,而且可以有效地提高信号分选的效能,也为盲信号处理提供了一种新的思路。     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

平面图形对象拾取算法研究

介绍了在图形处理中,利用面向对象技术实现的平面图形对象拾取算法。与传统的以大量图像信息的存储为基础的位图存储方式下的图形对象拾取算法相比,本算法不但包括单个图形对象的拾取,而且也探讨了在复杂的图形组合下,如在图形重叠与覆盖的情况下进行多个图形对象拾取所需解决的算法难点。本算法对提高图像信息的存储效率和图形对象拾取的质量,对图像科学与面向对象技术的发展具有实际意义。     

一种飞行器在线实时航迹规划算法

针对飞行器在线航迹规划问题展开研究,提出了一种实时航迹搜索算法。该方法将飞行器的运动与航迹搜索结合在一起,可以有效地调节搜索的时间,满足在线实时应用的要求。通过在限定的时间内扩大寻优范围,该算法可以有效地避免不可行区域,并使生成的航迹更加优化。实验结果表明,算法能有效地处理各种航迹约束,实时地生成满意的三维航迹。     

邻近支持向量机的阵列波束优化

针对标准支持向量回归波束形成器的计算复杂度高、内存开销大、训练速度慢的缺点,提出了邻近支持向量机(Proximal Support Vector Machine,PSVM)波束优化方法。PSVM打破了通过对偶问题求解原问题的传统思维,将支持向量回归的约束条件等式化,直接对原问题进行分析与求解,给出了基于PSVM波束形成器的优化模型及具体实现过程,并进行了数值仿真实验。研究结果表明,在保持波束形成器性能基本不变的情况下,降低了计算复杂度,减少了内存开销,提高了训练速度。与传统的支持向量回归波束形成相比,具有良好的快速性,为波束形成器的优化设计提供了一种新的有效方法。