Multi‐switching combination–combination synchronization of non‐identical fractional‐order chaotic systems

In this paper, multi‐switching combination–combination synchronization scheme has been investigated between a class of four non‐identical fractional‐order chaotic systems. The fractional‐order Lorenz and Chen's systems are taken as drive systems. The combination–combination of multi drive systems is then synchronized with the combination of fractional‐order Lü and Rössler chaotic systems. In multi‐switching combination–combination synchronization, the state variables of two drive systems synchronize with different state variables of two response systems simultaneously. Based on the stability of fractional‐order chaotic systems, the multi‐switching combination–combination synchronization of four fractional‐order non‐identical systems has been investigated. For the synchronization of four non‐identical fractional‐order chaotic systems, suitable controllers have been designed. Theoretical analysis and numerical results are presented to demonstrate the validity and feasibility of the applied method. Copyright © 2017 John Wiley & Sons, Ltd.     

地震作用下基于ADMF和系统参数组合的最优MTMD

多重调谐质量阻尼器 ( MTMD)是由许多频率成线性分布的调谐质量阻尼器组成。可能的系统参数组合形成 5种 MTMD,即 MTMD-1～MTMD-5。基于在基底加速度作用下具有一般 MTMD时结构的加速度传递函数 ,建立了 MTMD-1～ MTMD-5加速度动力放大系数 ( ADMF)的统一模式。利用 ADMF和数值寻优技术进行了详细的最优参数研究。最优参数包括 :最优频率间隔、最优阻尼比、最优调谐频率比。大量的数值比较表明 :在MTMD地震反应控制工程中 ,应优先选择 MTMD-1。     

基于多功能数据采集卡和变速PID的转台控制系统设计

为了提高采用转台对惯导系统和惯性仪表进行误差模型标定时的可靠性和精度,对角位置转台的控制系统进行了研究。首先借助NI公司PXI-8101控制器和功能强大的数据采集卡PXIe-6363对转台控制系统进行了硬件设计。随后在对转台常规PID控制方法研究的基础上提出了一种能随系统调节偏差自动改变积分项累加速度的变速PID控制方法。接着又对基于软件实现的双通道旋转变压器轴角解调算法进行了研究并提出了一种粗精组合角纠错方法。最后对本文设计的转台控制系统进行了测试实验,结果表明提出的轴角解调算法具有较好的解码速度和精度,并且变速PID控制方法大大提高了转台控制系统的自学习能力和鲁棒性,显著地改善了转台控制过程的稳定性。     

基于梯度与曲率相结合的图像平滑模型的研究

在图像处理过程中, 为了在图像去噪时更好地保留图像边缘细节信息, 首先结合扩散系数和曲率的性质建立了一个曲率平滑模型. 考虑到图像受到噪声污染时曲率会发生显著变化, 将图像的水平集曲率作为一个检测因子代入到上述模型中, 提出了一个梯度与曲率相结合的新模型. 分析与仿真结果表明, 该模型与Perona-Malik模型相比较保留了更多的图像信息, 有效地增强了图像尖锐的边缘, 同时很好地保持了图像的直线和曲线边缘、角点、斜坡和小尺度特征, 是一个理想的模型.     

Finding the shortest paths by node combination

By repeatedly combining the source node’s nearest neighbor, we propose a node combination (NC) method to implement the Dijkstra’s algorithm. The NC algorithm finds the shortest paths with three simple iterative steps: find the nearest neighbor of the source node, combine that node with the source node, and modify the weights on edges that connect to the nearest neighbor. The NC algorithm is more comprehensible and convenient for programming as there is no need to maintain a set with the nodes’ distances. Experimental evaluations on various networks reveal that the NC algorithm is as efficient as Dijkstra’s algorithm. As the whole process of the NC algorithm can be implemented with vectors, we also show how to find the shortest paths on a weight matrix.     

On the use of double cross-validation for the combination of proteomic mass spectral data for enhanced diagnosis and prediction

We consider a proteomic mass spectrometry case-control study for the calibration of a diagnostic rule for the detection of early-stage breast cancer. For each patient, a pair of two distinct mass spectra is recorded, each of which is derived from a different prior fractionation procedure on the available patient serum. We propose a procedure for combining the distinct spectral expressions from patients for the calibration of a diagnostic discriminant rule. This is achieved by first calibrating two distinct prediction rules separately, each on only one of the two available spectral data sources. A double cross-validatory approach is used to summarize the available spectral data using the two classifiers to posterior class probabilities, on which a combined predictor can be calibrated.     

Belief functions combination without the assumption of independence of the information sources

This paper considers the problem of combining belief functions obtained from not necessarily independent sources of information. It introduces two combination rules for the situation in which no assumption is made about the dependence of the information sources. These two rules are based on cautious combinations of plausibility and commonality functions, respectively. The paper studies the properties of these rules and their connection with Dempster’s rules of conditioning and combination and the minimum rule of possibility theory.     

基于方法集的棕地再开发项目组合评价研究

棕地再开发项目综合评价具有重要的理论意义实践意义.为了科学、合理地对棕地再开发项目进行评价,提出了一种基于方法集的组合评价模型.首先,分别应用灰色关联评价、模糊综合评价、TOPSIS和主成分评价分别对备选方案进行单一评价;然后,使用KENDALL-W协和系数检验对单一评价的排序结果进行统计一致性检验,并以满足统计一致性的评价方法构成方法集;其次,分别使用平均值法、Borda法、Copeland法对单一评价的排序结果进行组合评价,并使用循环组合的方法保证组合评价结果的完全一致性;最后,应用该模型对某市棕地再开发项目进行组合评价,评价结果验证了模型的有效性.     

具有工作故障及有限容量的MAP/M/1排队系统性能分析

为了拓展随机排队理论,在具有工作故障的MAP/M/1排队的基础上,引入有限容量策略建立起一个新的排队模型.通过Uniformization Technique将连续时间排队模型转化成对应的离散时间排队模型,运用矩阵几何组合解给出系统中的顾客数量和服务器状态的联合稳态概率表达式,并给出基于稳态概率的性能指标.最后通过一些数值例子展示参数对性能指标的影响.