Integral barrier Lyapunov function-based adaptive fuzzy output feedback control for nonlinear delayed systems with time-varying full-state constraints

In this article, an adaptive fuzzy output feedback control method is presented for nonlinear time-delay systems with time-varying full state constraints and input saturation. To overcome the problem of time-varying constraints, the integral barrier Lyapunov functions (IBLFs) integrating with dynamic surface control (DSC) are applied for the first time to keep the state from violating constraints. The effects of unknown time delays can be removed by using designed Lyapunov-Krasovskii functions (LKFs). An auxiliary design system is introduced to solve the problem of input saturation. The unknown nonlinear functions are approximated by the fuzzy logic systems (FLS), and the unmeasured states are estimated by a designed fuzzy observer. The novel controller can guarantee that all signals remain semiglobally uniformly ultimately bounded and satisfactory tracking performance is achieved. Finally, two simulation examples illustrate the effectiveness of the presented control methods.     

基于启发式BP算法的软件缺陷预测模型

针对软件缺陷预测时缺陷数据集中存在的类别分布不平衡问题，结合上采样算法SMOTE与Edited Nearest Neighbor (ENN) 数据清洗策略，提出了一种基于启发式BP神经网络算法的软件缺陷预测模型。模型中采用上采样算法SMOTE增加少数类样本以改善项目中的数据不平衡状况，并针对采样后数据噪声问题进行ENN数据清洗，结合基于启发式学习的模拟退火算法改进四层BP神经网络后建立分类预测模型，在AEEEM数据库上使用交叉验证对提出的方案进行性能评估，结果表明所提出的算法能够有效提高模型在预测类不平衡数据时的分类准确度。     

Deep reinforcement learning-based cooperative interactions among heterogeneous vehicular networks

Most real-world vehicle nodes can be structured into an interconnected network of vehicles. Through structuring these services and vehicle device interactions into multiple types, such internet of vehicles becomes multidimensional heterogeneous overlay networks. The heterogeneousness of the overlays makes it difficult for the overlay networks to coordinate with each other to improve their performance. Therefore, it poses an interesting but critical challenge to the effective analysis of heterogeneous virtual vehicular networks. A variety of virtual vehicular networks can be easily deployed onto the native network by applying the concept of SDN (Software Defined Networking). These virtual networks reflect their heterogeneousness due to their different performance goals, and they compete for the same physical resources of the underlying network, so that a sub-optimal performance of the virtual networks may be achieved. Therefore, we propose a Deep Reinforcement Learning (DRL) approach to make the virtual networks cooperate with each other through the SDN controller. A cooperative solution based on the asymmetric Nash bargaining is proposed for co-existing virtual networks to improve their performance. Moreover, the Markov Chain model and DRL resolution are introduced to leverage the heterogeneous performance goals of virtual networks. The implementation of the approach is introduced, and simulation results confirm the performance improvement of the latency sensitive, loss-rate sensitive and throughput sensitive heterogeneous vehicular networks using our cooperative solution.     

Supporting primary students' learning of fraction conceptual knowledge through digital games

With the advent of mobile technologies, well-designed fraction apps can be used to help children gain fraction knowledge, a challenging topic for both teachers and students. The present pilot study adopted a quasi-experimental design to investigate whether children can learn fraction concepts equally well if half of the lesson time (20 min) is replaced with game-based learning. Keeping the total lesson time (40 min) identical, the control group (N = 33) received traditional instruction, and the experimental group (N = 32) was presented with a blended learning approach spending half of the class time (20 min) playing tablet-based fraction games, where each of the learners had their own tablet. The results suggested that in the posttest, the experimental group achieved similar learning gains to the control group and appear to have achieved better performance in the transfer test than the control group. This paper also discusses the efficiency of game-based learning, the mechanism of how fraction games might enhance learning, and the potential of integrating game-based learning in educational settings.     

基于深度信念网络的列车故障音频诊断方法

铁路在交通运输行业有着举足轻重的地位，一旦列车发生故障将会导致严重的生命财产损失。由于列车发生故障的概率相对较低，因此难以捕获列车的故障样本。针对上述问题，提出了一种无监督学习的列车故障识别方法，通过检测列车音频信号来识别列车故障。该方法基于深度信念网络(DBN)，利用小波包分解提取检测信号的特征向量并将其作为DBN的输入，待网络充分训练后，由训练好的DBN识别当前列车的运行状况。现场监测实验结果表明，该方法能够在无监督的条件下有效识别列车故障，保障了列车的运行安全。     

基于深度学习的秀丽隐杆线虫显微图像分割方法

利用计算机实现自动、准确的秀丽隐杆线虫(C.elegans)的各项形态学参数分析,至关重要的是从显微图像上分割出线虫体态,但由于显微镜下的图像噪声较多,线虫边缘像素与周围环境相似,而且线虫的体态具有鞭毛和其他附着物需要分离,多方面因素导致设计一个鲁棒性的C.elegans分割算法仍然面临着挑战。针对这些问题,提出了一种基于深度学习的线虫分割方法,通过训练掩模区域卷积神经网络(Mask R-CNN)学习线虫形态特征实现自动分割。首先,通过改进多级特征池化将高级语义特征与低级边缘特征融合,结合大幅度软最大损失(LMSL)损失算法改进损失计算;然后,改进非极大值抑制;最后,引入全连接融合分支等方法对分割结果进行进一步优化。实验结果表明,相比原始的Mask R-CNN,该方法平均精确率(AP)提升了4.3个百分点,平均交并比(mIOU)提升了4个百分点。表明所提出的深度学习分割方法能够有效提高分割准确率,在显微图像中更加精确地分割出线虫体。     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Evolutionary collective behavior decomposition model for time series data mining

In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model.     

Adaptive robust boundary control of shaft vibrations under perturbations with unknown upper bounds

This paper presents robust and adaptive boundary control designs to stabilize the two‐dimensional vibration of hybrid shaft model. The hybrid shaft is mathematically represented by a set of partial differential equations, governing the shaft vibrations, coupled to ordinary differential equations, describing rigid body spinning and dynamic boundary conditions. The control objective is to stabilize the transverse vibrations of the perturbed shaft while regulating the spinning rate. To achieve this, the paper first establishes robust boundary control laws that fulfil the control objective in the presence of modeling uncertainties and external disturbances operating over the shaft domain and boundary. Lyapunov‐based analyses show that the proposed robust control exponentially stabilizes the shaft with vanishing distributive perturbations, while assuring ultimately bounded vibrations in the case of nonvanishing perturbations. Then, adaptive control philosophy is utilized to achieve redesigned robust controllers that only use online adaptation of control gains without acquiring the knowledge of bounds on perturbations, as well as dynamic parameters. An advantage of this design is avoiding an overconservative robust control law, which may induce poor stability and chattering in tackling system perturbations with unknown upper bounds. Simulations through finite element method illustrate the results. Copyright © 2014 John Wiley & Sons, Ltd.     

Leader-following consensus of fractional-order multi-agent systems via adaptive control

This article focuses on the consensus problem of leader-following fractional-order multi-agent systems (MASs) with general linear and Lipschitz nonlinear dynamics. First, the distributed adaptive protocols for linear and nonlinear fractional-order MASs are constructed, respectively. We allow the control coupling gains to be time varying for each agent. Moreover, the adaptive modification schemes for the control gain are designed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing consensus convergence. Second, based on fractional-order Lyapunov stability theorem and Barbalat's lemma, two novel sufficient conditions in terms of linear matrix inequalities are provided to ensure that the leader-following consensus can be obtained in the case for any undirected connected communication graph. Furthermore, we show that the proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics. As a result, the proposed framework requires no global information and thus can be implemented in a fully distributed manner. Finally, the numerical simulations are given to demonstrate the effectiveness of obtained the theoretical results.