机会网络中基于能量消耗的缓存管理策略

为了减少机会网络中节点的能量消耗,均衡各节点之间能量使用情况,延长网络寿命,提出基于能耗的缓存管理策略。在节点缓存空间有限的情况下,所提出的算法根据周围邻居节点能量的使用情况,动态调整节点用于缓存转发消息空间的大小,从而减少节点在存储-转发过程中的能量消耗。同时,为了避免传统休眠机制的能耗路由算法中由于目的节点休眠而导致消息投递失败的情况,引入了新的Inactive节点状态。实验仿真表明,与定时休眠机制的能耗算法比较,采用基于能量消耗的缓存管理策略能够使得机会网络中所有节点的整体能耗降低50%左右,并且节点之间能耗的标准差降低80%以上。     

基于粒子群蚁群算法的供应链合作伙伴选择研究

针对供应链合作伙伴选择的准确性和效率问题,提出一种基于粒子群和蚁群优化的合作伙伴选择算法。建立基于供应链链节体和连接弧的有向图路径模型,构造多目标规划模型。利用改进的离散型粒子群算法,求取伙伴选择问题的初始解集,构建初始信息素矩阵,通过改进蚁群算法的寻径规则,求取供应链合作伙伴选择问题的最优解。实验结果表明,所提算法有效提高了供应链合作伙伴选择的精度和效率,具有较好的性能。     

大学计算机基础课程实战化案例教学研究与实践

针对当前军校大学计算机基础课程立足于以建设信息化军队,打赢信息化战争的根本方针,结合自身的教学经验,注重在教学实施上以实战化案例教学为原则,形成问题前导、主题研讨、案例辨析、推演论证四位一体的案例化教学方法。列出了大学计算机基础课程中的所有知识模块及教学目标,并详细分析几个关键模块的教学步骤,为军校大学计算机基础课程教学提供一些方法和思路。     

应用财经新闻挖掘的金融品种价格走势预测

随着经济的不断发展,金融活动中的不确定性日益增加,金融预测受到学术界及金融界的高度重视。人们希望通过获得预测性的判断和推测,掌握金融产品未来的发展趋势和规律。而近期随着互联网发展,出现海量财经信息,仅仅依靠历史价格的数据挖掘技术,不能很好地反映金融市场多元因素的影响。因此,通过挖掘财经新闻信息中的情感倾向信息,结合金融历史价格数据,组合多元线性回归和差分自回归滑动平均模型,提出了一种基于财经新闻信息挖掘的金融价格走势预测方法,通过实际数据验证,表明该方法可以获得较为准确的预测结果。     

A novel algorithm for selective current limit used in AMOLED panel

A selective current limit algorithm based on color space conversion is proposed in this paper. There are mainly two advantages for this algorithm. Firstly, only the luminance component Y is decreased, and the color component Cb or Cr is not changed; thus, the color distortion is avoided in the process of current limit. Secondly, the current of pixels with high luminance is limited while that of those pixels with low luminance is not, which means current limit is executed selectively. For the same value of mean square error, the simulation results show that the ratio of pixels with high luminance of the image processed by the proposed algorithm is zero, and that processed by the net power control and the algorithm based on color space conversion is 0.081 and 0.0854, respectively. This algorithm is implemented on a field‐programmable gate array to drive the image display on the AMOLED panel.     

Finite‐time asynchronous filtering for discrete‐time Markov jump systems over a lossy network

This paper is concerned with the problem of finite‐time asynchronous filtering for a class of discrete‐time Markov jump systems. The communication links between the system and filter are assumed to be unreliable, which lead to the simultaneous occurrences of packet dropouts, time delays, sensor nonlinearity and nonsynchronous modes. The objective is to design a filter that ensures not only the mean‐square stochastic finite‐time bounded but also a prescribed level of performance for the underlying error system over a lossy network. With the help of the Lyapunov–Krasovskii approach and stochastic analysis theory, sufficient conditions are established for the existence of an admissible filter. By using a novel simple matrix decoupling approach, a desired asynchronous filter can be constructed. Finally, a numerical example is presented and a pulse‐width‐modulation‐driven boost converter model is employed to demonstrate the effectiveness of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd.     

Semi-supervised classification using multiple clusterings

Graph determines the performance of graph-based semi-supervised classification. In this paper, we investigate how to construct a graph from multiple clusterings and propose a method called Semi-Supervised Classification using Multiple Clusterings (SSCMC in short). SSCMC firstly projects original samples into different random subspaces and performs clustering on the projected samples. Then, it constructs a graph by setting an edge between two samples if these two samples are clustered in the same cluster for each clustering. Next, it combines these graphs into a composite graph and incorporates the resulting composite graph with a graph-based semi-supervised classifier based on local and global consistency. Our experimental results on two publicly available facial images show that SSCMC not only achieves higher accuracy than other related methods, but also is robust to input parameters.     

Multifocus image fusion method of Ripplet transform based on cycle spinning

The curvelet transform can represent images at both different scales and different directions. Ripplet transform, as a higher dimensional generalization of the curvelet transform, provides a new tight frame with sparse representation for images with discontinuities along C² curves. However, the ripplet transform is lack of translation invariance, which causes the pseudo-Gibbs phenomenon on the edges of image. In this paper, the cycle spinning method is adopted to suppress the pseudo-Gibbs phenomena in the multifocus image fusion. On the other hand, a modified sum-modified-laplacian rule based on the threshold is proposed to make the decision map to select the ripplet coefficient. Several experiments are executed to compare the presented approach with other methods based on the curvelet, sharp frequency localized contourlet transform and shearlet transform. The experiments demonstrate that the presented fusion algorithm outperforms these image fusion works.     

Analysis of General Ideal Proportional Navigation Guidance Laws

In this work, the capture region of the general ideal proportional navigation guidance law is analyzed with the following constraints: (i) the target's input acceleration is subject to independent or magnitude saturation, and (ii) the missile's input acceleration is subject to magnitude saturation. In addition to the case of unbounded maneuverability of missile with or without knowing the target acceleration, the necessary and sufficient condition for a bounded maneuvering missile that captures a nonmaneuvering target is also derived. Furthermore, the conditions that result in zero impact velocity are discovered and discussed in some of the cases. The capture regions that cannot be obtained analytically are determined numerically by a powerful classifier, the least square support vector machines. To have the capture region ready for least square support vector machines, all the state variables are transformed into modified polar variables and non‐dimensionalized to reduce the number of independent variables. In order to make the implementation possible in real time, an approximation of the Gaussian radial basis function is adopted to obtain the corresponding nonlinear feature mapping function. Through numerous numerical experiments, the proposed technique is found to be adequate for storing the capture region in an onboard fire control computer.