基于克隆选择调节算法的IIR数字滤波器设计

在克隆选择算法的基础上．结合独特型免疫网络理论中抗体间的自适应动态调节思想，提出一种新的免疫算法——克隆选择调节算法（CSAA）．并用于IIR数字滤波器的设计．该算法能更好地保持解的多样性及收敛速度快．有效地避免了早熟现象．对多个典型系统进行随机仿真并与其他方法进行比较研究，结果表明．该算法在多模态搜索空间中具有更好的全局收敛性和稳定性．是一种有效可行的IIR数字滤波器设计方法．     

基于蚂蚁算法的PGIS中动态路径诱导技术研究

停车诱导系统（PGIS）将计算机、信息与多媒体等技术应用于交通管理领域，是智能交通的重要组成部分。首先分析了PGIS中一项关键技术——动态路径诱导的特点和实时诱导技术要求，根据该要求，介绍了一种生物界仿真算法——蚂蚁算法的特点及其应用在最优路径搜索中的基本方法。仿真实验表明该方法搜索效率较高，可用于动态路径诱导技术中。     

基于Marginalized粒子滤波的卫星姿态估计算法

针对具有矢量观测的卫星姿态估计问题。提出一种基于Marginalized粒予滤波（MPF）的算法．采用Rao-Blackwellization技术，将卫星模型状态向量中的线性状态部分（陀螺漂移）和非线性状态部分（卫星姿态）分开处理，从而使得估计的方差降低．以较少的运算量获得较好的估计效果．通过引入解决含等式约束条件的估计问题方法，保证了姿态四元数的归一化．将所提出的方法应用于某型号卫星．仿真验证了用该算法处理卫星姿态估计问题的优越性．     

一种新的克隆选择调节算法

基于生物免疫系统克隆选择机理和独特型免疫网络理论，提出了一种新的免疫算法——克隆选择调节算法（CSAA）．其主要特点是在克隆选择算法的基础上，引入了抗体的促进与抑制动态调节思想．通过运用自适应柯西变异、免疫记忆和克隆抑制等机制，该算法更好地保持了种群的多样性，提高了全局收敛的速度，从而有效避免了早熟现象．本文利用随机过程理论作为数学工具，采用纯概率方法证明了CSAA的概率弱收敛性．对该算法与其他克隆选择算法进行了仿真比较实验；仿真结果不仅验证了CSAA理论上的概率弱收敛性结论，同时也表明了该算法在求解多模态函数优化问题时具有更好的收敛性能和稳定性，更为有效可行。     

基于Hakopian插值的快速图像重建算法

在2004年工作的基础上，利用Hakopian插值多项式的Chebyshev-Fourier分解形式，提出了一种重建二维图像的快速算法．该算法在重建时间上具有明显优势．此外，与传统的滤波反投影（FBP）方法相比，该算法还可以用于局部图像重建．仿真实验验证了该算法的有效性．     

基于子空间跟踪的修正MMSE多用户检测算法

在研究基于子空间跟踪的最小均方误差（MMSE）多用户检测器（MUD）的基础上，为解决原算法因引入特征值估计误差而导致检测性能下降的问题，设计了一种改进的算法——修正的MMSE多用户检测器．采用正交性能优良的OPAST算法跟踪子空间，提出一种基于OPAST的修正MMSE多用户检测算法．仿真结果显示,与基于OPAST的MMSE MUD相比，基于OPAST的修正MMSE MUD算法收敛速度快，输出信干比和误码率性能逼近SVD MUD算法，并且计算复杂度较低．     

感知器在语言模型训练中的应用

感知器（perceptron）是神经网络模型中的一种，它可以通过监督学习（supervised learning）的方法建立模式识别的能力．将感知器应用到语言模型的训练中，实现了感知器的两种不同训练规则以及多种特征权值计算方法，讨论了不同的训练参数对训练效果的影响．在训练之前，使用了一种基于经验风险最小化（empirical risk minimization，ERM）的特征选择算法确定特征集合．感知器训练之后的语言模型在日文假名到汉字（kana-kanji）的转换中进行评估．通过实验对比了感知器的两种训练规则以及变形算法的性能，同时发现通过感知器训练的模型比传统模型（N-gram）在性能上有了很大的提高，使相对错误率下降了15％～20％．     

基于免疫原理的差分进化

为了提高疫苗在复杂函数优化问题中的正确性和使用效率．提出一种新的疫苗形式及其提取方法．并给出了接种概率的自适应确定方法．将上述方法与差分进化相结合．得到一种新算法——免疫差分进化（IDE）．引入超变异算子来维持种群的多样性，防止早熟现象．实验结果表明，与标准的差分进化算法相比．新算法计算量小．收敛速度快，全局寻优能力强．     

基于节点流量及路径评估网络节点重要性的优化算法

如何合理有效地评估通信网络中各节点的重要性,对整个网络的设计至关重要．在以往相关理论研究的基础上,提出了一种基于网络传输流量和网络节点问两两最短距离的新算法一DFC算法（Combinationoftransmissionflowandshoaet path distance）．该算法从每个节点在通信网络中所占的通信流量,及节点失效后两两间最短距离的变化出发,来反映该节点对整个通信网络的重要程度．通过实验仿真,并与目前最通用有效的节点删除法相比,证明该方法具有更高的精确性,是一种有效的方法．     

TISO-OEAR模型的分解递推最小二乘辨识方法

针对输出误差模型参数估计过程中的计算量较大的问题,提出了基于分解的两输入单输出（TISO）输出误差自回归模型（OEAR）的分解递推最小二乘（DRLS）算法．基本的思想是分解TISO系统为3个子系统,并通过递推最小二乘分别辨识每个子系统．DRLS算法是解决大规模系统的计算量大和复杂辨识模型的辨识难题的一种有效的方法．最后通过仿真实例验证和分析了所提出算法的有效性与优越性,并对两种算法的特点进行了总结．     

Parallel simulation of DEDS via event synchronization

In this paper we use the event synchronization scheme to develop a new method for parallel simulation of many discrete event dynamic systems simultaneously. Though a few parallel simulation methods have been developed during the last several years, such as the well-known Standard Clock method, most of them are largely limited to Markovian systems. The main advantage of our method is its applicability to non-Markovian systems. For Markovian systems a comparison study on efficiency between our method and the Standard Clock method is done on Connection Machine CM-5. CM-5 is a parallel machine with both SIMD (Single Instruction, Multiple Data) and MIMD (Multiple Instruction Multiple Data) architectures. The simulation results show that if event rates of Markovian systems do not differ by much then both methods are compatible but the Standard Clock method performs better in most cases. For Markovian systems with very different event rates, our method often yields better results. Most importantly, our simulation results also show that our method works as efficiently for non-Markovian systems as for Markovian systems.     

Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks

In this paper we apply the ideas of ordinal optimization and the technique of Standard Clock (SC) simulation to the voice-call admission-control problem in integrated voice/data multihop radio networks. This is an important problem in networking that is not amenable to exact analysis by means of the usual network modeling techniques. We first describe the use of the SC approach on sequential machines, and quantify the speedup in simulation time that is achieved by its use in a number of queueing examples. We then develop an efficient simulation model for wireless integrated networks based on the use of the SC approach, which permits the parallel simulation of a large number of admission-control policies, thereby reducing computation time significantly. This model is an extension of the basic SC approach in that it incorporates fixed-length data packets, whereas SC simulation is normally limited to systems with exponentially distributed interevent times. Using this model, we demonstrate the effectiveness of ordinal-optimization techniques, which provide a remarkably good ranking of admission-control policies after relatively short simulation runs, thereby facilitating the rapid determination of good policies. Moreover, we demonstrate that the use of crude, inaccurate analytical and simulation models can provide highly accurate policy rankings that can be used in conjunction with ordinal-optimization methods, provided that they incorporate the key aspects of system operation.     

Delay-dependent guaranteed cost control for state-delayed system with disturbance and its application to engine idle speed control

This paper proposes a delay-dependent guaranteed cost control scheme for engine idle speed control （ISC） with induction-to-torque delay and external load disturbance. An augmented linearization model of engine at idle speed operating mode was developed based on physical principle and experiment data. To provide a compromise between disturbance rejection and other performance requirements of ISC, a multi-objective cost function upper bound was given, which can help us to take into account the fuel economy and disturbance rejection performance together in ISC. Poles constraint was added to the closed-loop system to guarantee convergence rates of state. The whole optimization solution to ISC can be solved under the framework of LMI. A commercial engine model was utilized to assess the performance of the controller. Simulation results on this model show us that designed controller can achieve desired performance.     

一种改进的自适应时钟算法

针对LIRS算法结构复杂、适应性差的不足,提出一种改进的自适应时钟算法.在LIRS算法基础上借鉴Clock算法思想,简化算法组织结构,加强对不同数据访问模式的适应性和捕获高频数据的能力.实验结果证明,与LIRS算法及2种传统替换算法相比,自适应时钟算法在命中率上有更好的表现,较好地满足用户对Cache高命中率和占用额外计算资源少的要求.     

基于三层双向闭环作业网络的重空车流组织优化策略

剖析三层双向闭环作业网络的作业机理,在此基础上建立以成本最小化为目标函数的数学规划模型.该问题属于NP问题,利用求解混合整数规划的传统割平面法(MIP-CPM法)求解效率不高.对此,设计基于三区段分步编码的改进遗传(简称IGA-3SC法)求解策略:给出解的三区段分步编码方案,构建基于三区段基因位取值的初始解生成机制,确定基于遗传操作的解更新过程,最终形成IGA-3SC求解策略.设计不同规模的仿真实验,对两种方法进行数值研究.数值仿真分析表明,IGA-3SC求解策略总体性能优于传统MIP-CPM方法,可以得到比MIP-CPM求解方法更高质量的解,在计算速度上也有较好表现.     

一种基于结群的零偏差时钟布线算法

介绍了一种基于结群的零偏差时钟布线算法，该算法采用新的单元匹配策略，递归地把时钟节点划分成2个负载和半径比较均衡的子集，结合缓冲器的适当插入，产生一棵零偏差的时钟布线树。实验表明，结群处理对处理规模较大的电路快速有效，时钟延迟得到了明显减少。     

Subtree semantic geometric crossover for genetic programming

The semantic geometric crossover (SGX) proposed by Moraglio et al. has achieved very promising results and received great attention from researchers, but has a significant disadvantage in the exponential growth in size of the solutions. We propose a crossover operator named subtree semantic geometric crossover (SSGX), with the aim of addressing this issue. It is similar to SGX but uses subtree semantic similarity to approximate the geometric property. We compare SSGX to standard crossover (SC), to SGX, and to other recent semantic-based crossover operators, testing on several symbolic regression problems. Overall our new operator out-performs the other operators on test data performance, and reduces computational time relative to most of them. Further analysis shows that while SGX is rather exploitative, and SC rather explorative, SSGX achieves a balance between the two. A simple method of further enhancing SSGX performance is also demonstrated.     

Discovering instance and process spanning constraints from process execution logs

Instance spanning constraints (ISC) are the instrument to establish controls across multiple instances of one or several processes. A multitude of applications crave for ISC support. Consider, for example, the bundling and unbundling of cargo across several instances of a logistics process or dependencies between examinations in different medical treatment processes. Non-compliance with ISC can lead to severe consequences and penalties, e.g., dangerous effects due to undesired drug interactions. ISC might stem from regulatory documents, extracted by domain experts. Another source for ISC are process execution logs. Process execution logs store execution information for process instances, and hence, inherently, the effects of ISC. Discovering ISC from process execution logs can support ISC design and implementation (if the ISC was not known beforehand) and the validation of the ISC during its life time. This work contributes a categorization of ISC as well as four discovery algorithms for ISC candidates from process execution logs. The discovered ISC candidates are put into context of the associated processes and can be further validated with domain experts. The algorithms are prototypically implemented and evaluated based on artificial and real-world process execution logs. The results facilitate ISC design as well as validation and hence contribute to a digitalized ISC and compliance management.     

基于Gibbs抽样的轴承故障诊断方法

针对现有轴承故障诊断方法的不足,即诊断片面性问题,提出了一种基于Gibbs抽样的轴承故障诊断方法。首先对轴承振动信号进行局部特征尺度分解（LCD）得到内禀尺度分量（ISC）;然后对轴承振动信号和ISC分别提取时域特征,按照特征敏感度高低对时域特征排名,选择排名靠前的特征组成特征集;其次使用特征集训练产生基于Gibbs抽样的多维高斯分布模型;最后通过后验分析得到概率,实现轴承故障诊断。实验结果表明诊断正确率达到100%,与基于SVM的轴承诊断方法相比,在特征数为43个时诊断正确率提升了11.1个百分点。所提方法能够有效地对滚动轴承故障状态进行诊断,对高维复杂的轴承故障数据也有很好的诊断效果。     

SDH设备时钟中的数字锁相环设计

提出了一种新的用于实现SDH设备时钟的数字锁相环,采用时数转换器来实现数字锁相环中的鉴相器;该时数转换器的时间测量精度达到200 ps,因而极大地改进了鉴相器的鉴相精度;改进后的数字锁相环具有很好的频率稳定度和相位特性,对时钟源有很好的跟踪能力,且能实现时钟源的平滑切换,完全满足了ITU-T G.813规范要求。