具有参数自适应的交互式多模型算法

动态多模型估计（SMME）广泛应用于结构和参数的不确定／变化的估计问题中,比如目标跟踪和故障诊断与隔离,然而由先验信息选定的滤波参数是模式切换与模式未切换情况下的折衷,针对SMME,本文通过在每个滤波循环开始处起始多个状态预测器实时辨识滤波参数,包括模式切换概率和基于模型的过程噪声方差,考虑到交互式多模型（IMM）是SMME中比较有效的方法,我们将上述的参数辨识与IMM相结合,提出了一种自适应IMM（AIMM）,在跟踪一个机动目标的仿真中,AIMM表现出了比IMM更高的估计精度。     

粒子滤波器在机动目标被动跟踪中的应用

为处理机动目标被动跟踪中的非线性非高斯问题，提出了一种基于粒子滤波器的交互多模型（IMM）多观测站跟踪方法。使用转弯率建立了被动跟踪模型，用“蛙跳”处理方式来提高多站被动跟踪问题的可观测性，结合被动跟踪模型，利用非线性粒子滤波方法，对IMM算法进行了改进，提高了对IMM混和密度的近似程度，通过被动跟踪仿真实例，同时使用IMM粒子滤波器（IMM-PF）与IMM扩展卡尔曼滤波器（IMM-EKF）进行跟踪仿真，分析了轨迹跟踪性能，利用均方根误差比较了误差性能。仿真结果表明，与IMM-EKF相比，IMM-PF具有更高的跟踪精度和更快的机动响应速度。     

基于强跟踪滤波器的多目标跟踪方法

在诸多的多目标跟踪算法中，相互作用多模型（IMM）算法是目前公认的最为有效的算法。但到目前为止，LMM估计方法都是建立在卡尔曼滤波器（KF）和扩展卡尔曼滤波器（EKF）基础上，因而其性能不仅依赖于所采用的模型集，而且在更大程度上依赖于所采用的滤波技术。强跟踪滤波器（STF）克服了卡尔曼和扩展卡尔曼的三大缺陷，因而设计一种基于STF的IMM目标跟踪算法显然能提高其性能。仿真实验表明，基于STF的IMM算法的跟踪性能要优于基于KF和EKF的IMM算法的跟踪性能。     

带有色厚尾量测噪声的鲁棒高斯近似滤波器和平滑器

为了解决带有色厚尾量测噪声的非线性状态估计问题,本文提出了新的鲁棒高斯近似（Gaussian approximate,GA）滤波器和平滑器.首先,基于状态扩展方法将量测差分后带一步延迟状态和白色厚尾量测噪声的非线性状态估计问题,转化成带厚尾量测噪声的标准非线性状态估计问题.其次,针对量测差分后模型中的噪声尺度矩阵和自由度（Degrees of freedom,DOF）参数未知问题,设计了新的高斯近似滤波器和平滑器,通过建立未知参数和待估计状态的共轭先验分布,并利用变分贝叶斯方法同时估计未知的状态、尺度矩阵、自由度参数.最后,利用目标跟踪仿真验证了本文提出的带有色厚尾量测噪声的鲁棒高斯近似滤波器和平滑器的有效性以及与现有方法相比的优越性.     

AR预测模型的IMM跟踪算法

针对LOS/NLOS混合条件下对机动目标的鲁棒跟踪问题,提出一种基于AR预测模型的交互式多模型（Interacting Multiple Model,IMM）跟踪算法（ARIMM）。该算法利用AR预测模型对运动状态建模,针对LOS与NLOS条件下观测噪声的分布不同分别使用无迹卡尔曼滤波器（Unscented Kalman Filter,UKF）和改进的无迹卡尔曼滤波器（Robust Unscented Kalman Filter,RUKF）,通过IMM方法估计出移动台的位置,利用该位置更新AR模型的参数,使AR模型与真实运动状态更加匹配,实现精确跟踪。仿真结果表明,在LOS/NLOS混合条件下,与传统的UKF和RUKF算法相比,该算法对机动目标跟踪的鲁棒性更好。     

基于交互容积卡尔曼的随机切换系统故障诊断

针对一类随机切换非线性系统的故障检测和故障估计问题,提出了一种基于交互式多模型和容积卡尔曼滤波（IMM CKF）的系统状态估计算法。该算法利用容积卡尔曼滤波（CKF）在不同时刻对每个子系统进行状态估计,把不同子系统状态估计结果融合得到最终的状态估计,实现对系统真实状态的估计。针对一类随机切换非线性系统发生执行器故障,采用IMM CKF估计系统状态;然后分析了IMM CKF算法的稳定性;根据状态估计结果,构造残差信号,设计残差评价函数,检测故障发生。当检测到故障发生时,设计增广系统,对故障幅值进行估计。通过仿真实验验证提出算法的有效性,结果表明该算法可以较为准确地诊断系统故障。     

基于PF和UKF的水下目标运动估计方法研究

针对无人水下航行器（UUV）目标跟踪控制需求,分别提出了水下目标的粒子滤波（PF）和无迹卡尔曼滤波（UKF）运动估计方法,建立了目标运动参考坐标系,给出了坐标系之间转换基本方法;设计了建立了目标的典型运动模型和非线性随机运动模型,利用前视声呐实测实验数据,完成水下目标运动估计。通过与扩展卡尔曼滤波器（EKF）的目标运动估计对比仿真实验,验证了PF和UKF两种目标运动估计方法的有效性。     

基于量测迭代更新集合卡尔曼滤波的机动目标跟踪算法

在机动目标跟踪中,用于模型辨识和状态估计的非线性滤波器的合理选择和优化是提升滤波精度的关键.融合量测迭代更新集合卡尔曼滤波和交互式多模型(interacting multiple models,IMM)方法,本文提出了基于量测迭代更新集合卡尔曼滤波的机动目标跟踪算法.通过迭代更新思想的引入构建了一种量测迭代更新下集合卡尔曼滤波的实现结构,并将其作为IMM的模型滤波器实现对于目标运动模式和状态的辨识与估计.针对算法结合过程中滤波精度和计算量的平衡,设计了用于输入交互环节的状态估计样本,同时简化输入交互环节和输出交互环节中滤波误差协方差矩阵的交互过程.理论分析和仿真结果验证了算法的可行性和有效性.     

具有不确定动态线性系统的鲁棒状态估计

本文研究了一类具有参数和噪声特性不确定线性系统的鲁棒状态估计问题。利用对策论思想,定义了能使不确定下最坏性能最好的极小极大鲁棒状态估计器,提出了一种简单的近似设计方法,即设计最坏对象的最优滤波器。给出了这种设计方法设计滤波器导致的性能误差边界,进一步指出当满足文中给出的鞍点条件时,最坏对象的最优滤波器就是极小极大鲁棒滤波器。     

机动目标跟踪的一种自适应“当前”模型

针对单个模型跟踪机动目标的性能不够理想、多模型方法最优模型集设计困难且算法较复杂的问题．基于“当前”模型，从目标与跟踪雷达的相对角运动出发，提出一种能适应多类飞行器的自适应跟踪单模型，并给出了优化估计目标与雷达的相对角运动及距离运动的算法．仿真结果表明．该自适应单模型跟踪性能稳定，远优于“当前”模型，对于强机动飞行的目标，其跟踪性能要优于交互多模型方法（IMM），而且其计算量要低于IMM．     

飞行颤振数据处理软件多线程编程的有效实现

多线程编程提高了飞行颤振数据处理软件的灵活性和易操作性，但也增加了软件编程和维护的复杂程度。针对这一矛盾，本文引进新的设计思想，提出新的多线程编程框图实现方法（Diagram method for multiple thread programming,DM/MTP），从而简化多线程的设计思路，特别适合于大型工程软件的设计。文中详细介绍了DM／MTP在模态参数识别算法NLUP中的应用。     

A pairing-free certificateless digital multisignature scheme using elliptic curve cryptography

In a digital multisignature scheme, two or more signers are allowed to produce a single signature on a common message, which can be verified by anyone. In the literature, many schemes are available based on the public key infrastructure or identity-based cryptosystem with bilinear pairing and map-to-point (MTP) hash function. The bilinear pairing and the MTP function are time-consuming operations and they need a large super-singular elliptic curve group. Moreover, the cryptosystems based on them are difficult to implement and less efficient for practical use. To the best of our knowledge, certificateless digital multisignature scheme without pairing and MTP hash function has not yet been devised and the same objective has been fulfilled in this paper. Furthermore, we formally prove the security of our scheme in the random oracle model under the assumption that ECDLP is hard.     

TFT‐LCD driver IC with embedded non‐volatile memory for portable applications

Abstract— To improve the display quality and yield of the TFT‐LCD driver IC, non‐volatile multiple‐time‐programmable (MTP) memory, which consists of an EEPROM cell and our proposed sense amplifier and power control circuit (SP), was integrated into a TFT‐LCD driver IC. The proposed SP has a 30% smaller layout area and a 18% faster response time compared to that of the conventional SP. The proposed SP also has lower power consumption because it does not use a static current. The TFT‐LCD quality was also improved by tuning the characteristics of the driver IC and the panel with the VREF, OSC, and VCOM blocks, using non‐volatile MTP memory. When the display quality improved, the yield also improved, along with a reduction in the failure ratio of the display module, which consists of the driver IC and the panel. As a result, the TFT‐LCD driver IC with the non‐volatile MTP memory demonstrated improved display quality and a higher yield compared to conventional driver ICs without such a memory.     

Stability evaluation and track life of the PDAF for tracking inclutter

The authors present an effective approach of a hybrid nature to the nonsimulation performance evaluation of the probabilistic data association filtering (PDAF) method for tracking in clutter. In this approach, a continuous-valued covariance, which is a function of a discrete-valued random variable (the number of validated measurements), is used to characterize the tracking errors in an average sense. This covariance can be calculated offline recursively from a modified Riccati equation, which can be obtained by replacing the measurement-dependent terms in the original stochastic equation with their conditional expectations. This approach has the merit that it yields a quantification of the transients of tracking divergence as well as substantially better accuracy than previous work. Such an approach is particularly suitable for stability evaluation of tracking filters. In addition, a quantitative study of the track-life problem is made in which the number of validated measurements plays a central role     

The Bin-Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP

In this paper a problem generator for the Bin-Packing Problem (BPP) is presented which is suggested to be used in future for the empirical evaluation of exact and heuristic solution methods. Also some numerical experiments are performed with FFD Packing in order to identify hard problem classes of the BPP. From the results it becomes evident that the design of a previous test by Martello and Toth, in which the authors tried to verify the solution power of their method, MTP, has been biased. Thus, new experiments with MTP have been performed on instances from more challenging problem classes. Our results confirm the general opinion that MTP represents the state-or-the-art for exact solution methods for the BPP, even though the size of the problems, which can be solved to a proven optimum in reasonable computing time, still appears to be unsatisfactory.     

Emotion recognition based on physiological changes in music listening

This paper investigates the potential of physiological signals as reliable channels for emotion recognition. All essential stages of an automatic recognition system are discussed, from the recording of a physiological dataset to a feature-based multiclass classification. In order to collect a physiological dataset from multiple subjects over many weeks, we used a musical induction method which spontaneously leads subjects to real emotional states, without any deliberate lab setting. Four-channel biosensors were used to measure electromyogram, electrocardiogram, skin conductivity and respiration changes. A wide range of physiological features from various analysis domains, including time/frequency, entropy, geometric analysis, subband spectra, multiscale entropy, etc., is proposed in order to find the best emotion-relevant features and to correlate them with emotional states. The best features extracted are specified in detail and their effectiveness is proven by classification results. Classification of four musical emotions (positive/high arousal, negative/high arousal, negative/low arousal, positive/low arousal) is performed by using an extended linear discriminant analysis (pLDA). Furthermore, by exploiting a dichotomic property of the 2D emotion model, we develop a novel scheme of emotion-specific multilevel dichotomous classification (EMDC) and compare its performance with direct multiclass classification using the pLDA. Improved recognition accuracy of 95\% and 70\% for subject-dependent and subject-independent classification, respectively, is achieved by using the EMDC scheme.     

Optimized load planning for motorail transportation

This paper studies a real-world problem arising in the area of motorail transportation. The considered problem deals with the loading of cars and motorcycles onto motorail wagons under realistic technical and legal constraints. The load planning problem, introduced as motorail transportation problem (MTP), occurs during the booking process and afterwards during the loading process at motorail terminals. Optimization based decision support is highly valuable due to the combinatorial nature of these problems. In practical applications, the fast generation of good solutions is essential. Previous model formulations in literature reveal considerable optimality gaps in real-world instances. Hence, we propose and evaluate two novel integer linear programming formulations of the MTP. The first formulation is a simplified reformulation of the original problem, uses less variables and provides a tighter LP relaxation. The second model is a column-generation formulation of the reformulated model which is solved using branch-and-price. Both novel model formulations are compared and evaluated on the basis of real-world data sets and considerably outperform previous approaches in terms of solution quality and speed.     

Extending the alternating-offers protocol in the presence of competition: models and theoretical analysis

The automation of bargaining is receiving a lot of attention in artificial intelligence research. Indeed, considering that bargaining is the most common form of economic transaction, its automation could lead software agents to reach more effective agreements. In the present paper we focus on the best-known bargaining protocol, i.e., the alternating-offers protocol. It provides an elegant mechanism whereby a buyer and a seller can bilaterally bargain. Although this protocol and its refinements have been studied extensively, no work up to the present provides an adequate model for bargaining in electronic markets. A result of these settings means that multiple buyers are in competition with each other for the purchase of a good from the same seller while, analogously, multiple sellers are in competition with each other for the sale of a good to the same buyer. The study of these settings is of paramount importance, as they will be commonplace in real-world applications. In the present paper we provide a model that extends the alternating-offers protocol to include competition among agents.¹ Our game theoretical analysis shows that the proposed model is satisfactory: it effectively captures the competition among agents, equilibrium strategies are efficiently computable, and the equilibrium outcome is unique. The main results we achieve are the following. 1) With m buyers and n sellers and when the outside option (i.e., the possibility of leaving a negotiation to start a new one) is inhibited, we show that it can be reduced to a problem of matching and that can be addressed by using the Gale-Shapley’s stable marriage algorithm. The equilibrium outcome is unique and can be computed in $O(l \cdot m\cdot n \cdot \overline T + (m+n)^2)$ , where l is the number of the issues and $\overline{T}$ is the maximum length of the bargaining. 2) With m buyers and one seller and when the seller can exploit the outside option, we show that agents’ equilibrium strategies can be computed in $O(l \cdot m \cdot \overline{T})$ and may be not unique. However, we show that a simple refinement of the agents’ utility functions leads to equilibrium uniqueness.     

具有多个时滞的积分时滞系统的稳定性分析

首先,针对具有多个时滞的积分时滞系统,建立新的基于线性矩阵不等式的稳定性条件.该条件与正整数k有关,给出$k=1$时该条件与现有结果间的关系.该关系表明所提出条件在$k\geqslant2$时的保守性比现有结果小;然后,基于所提出的稳定性条件,进一步研究具有参数不确定性的积分时滞系统的鲁棒稳定性问题,建立基于线性矩阵不等式的充分条件;最后,利用所提出方法,研究具有多个离散时滞和分布时滞的积分时滞系统的稳定性问题.数值算例结果表明了所提出稳定性判据的有效性.