Use of a smartphone-based Student Response System in large active-learning Chemical Engineering Thermodynamics classrooms

Smartphones are a promising tool as student response systems (SRS) for interactive teaching due to their widespread diffusion. Here, the main purpose is to assess the efficacy of smartphone-based SRS in large classroom settings of undergraduate Thermodynamics, as representative of engineering courses requiring high-level cognitive skills for problem solving. Four sets of multiple-choice questions were presented during the course. Overall, the results refer to 1055 students between control and SRS classes, each corresponding to a3 years period.One of the main results of this work is the strong linear correlation between the average questionnaire score and the final exam grade (R² = 0.91). A similar correlation, although with a lower value of R², is already found in the first questionnaire, thus showing the SRS high predictive power of class performance. The results of this study provide guidance for a quantitative use of smartphone-based SRS in teaching basic disciplines. The SRS monitoring capability allows early detection of struggling students, thus paving the way to personalized tutoring and improved student engagement in active learning practices. This approach is especially important in emergency situations, such as the SARS-Cov-2 pandemic, when distance learning is widely adopted, and remote interactive tools are highly needed.     

Identifying catalyst layer compositions of proton exchange membrane fuel cells through machine-learning-based approach

Membrane electrode assembly (MEA) is considered a key component of a proton exchange membrane fuel cell (PEMFC). However, developing a new MEA to meet desired properties, such as operation under low-humidity conditions without a humidifier, is a time- and cost-consuming process. This study employs a machine-learning-based approach using K-nearest neighbor (KNN) and neural networks (NN) in the MEA development process by identifying a suitable catalyst layer (CL) recipe in MEA. Minimum redundancy maximum relevance and principal component analysis were implemented to specify the most important predictor and reduce the data dimension. The number of predictors was found to play an essential role in the accuracy of the KNN and NN models although the predictors have self-correlations. The KNN model with a K of 7 was found to minimize the model loss with a loss of 11.9%. The NN model constructed by three corresponding hidden layers with nine, eight, and nine nodes can achieve the lowest error of 0.1293 for the Pt catalyst and 0.031 for PVA as a good additive blending in the CL of the MEA. However, even if the error is low, the prediction of PVA seems to be inaccurate, regardless of the model structure. Therefore, the KNN model is more appropriate for CL recipe prediction.     

Neural network-based flight control systems: Present and future

As the first review in this field, this paper presents an in-depth mathematical view of Intelligent Flight Control Systems (IFCSs), particularly those based on artificial neural networks. The rapid evolution of IFCSs in the last two decades in both the methodological and technical aspects necessitates a comprehensive view of them to better demonstrate the current stage and the crucial remaining steps towards developing a truly intelligent flight management unit. To this end, in this paper, we will provide a detailed mathematical view of Neural Network (NN)-based flight control systems and the challenging problems that still remain. The paper will cover both the model-based and model-free IFCSs. The model-based methods consist of the basic feedback error learning scheme, the pseudocontrol strategy, and the neural backstepping method. Besides, different approaches to analyze the closed-loop stability in IFCSs, their requirements, and their limitations will be discussed in detail. Various supplementary features, which can be integrated with a basic IFCS such as the fault-tolerance capability, the consideration of system constraints, and the combination of NNs with other robust and adaptive elements like disturbance observers, would be covered, as well. On the other hand, concerning model-free flight controllers, both the indirect and direct adaptive control systems including indirect adaptive control using NN-based system identification, the approximate dynamic programming using NN, and the reinforcement learning-based adaptive optimal control will be carefully addressed. Finally, by demonstrating a well-organized view of the current stage in the development of IFCSs, the challenging issues, which are critical to be addressed in the future, are thoroughly identified. As a result, this paper can be considered as a comprehensive road map for all researchers interested in the design and development of intelligent control systems, particularly in the field of aerospace applications.     

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.     

用于厚屏蔽小探测器的蒙特卡罗模拟减方差方法研究

反应堆屏蔽计算中经常出现厚屏蔽、小探测器问题，常规蒙特卡罗方法难以有效解决。基于自动重要抽样（AIS）方法，本文提出了小探测器自动重要抽样(SDAIS)方法，并针对小探测器问题，优化了AIS方法的虚粒子赌分裂算法。该方法在自主开发的蒙特卡罗屏蔽程序MCShield上进行了实现。使用NUREG/CR-6115 PWR基准题验证该方法的正确性和计算效率。结果表明，SDAIS方法可有效地解决厚屏蔽小探测器问题，相比AIS方法及传统的重要性方法，计算效率提升1~2个量级。     

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.     

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.     

Fault handling in large water networks with online dictionary learning

Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks.     

面部运动单元检测研究综述

面部运动单元检测旨在让计算机从给定的人脸图像或视频中自动检测需要关注的运动单元目标。经过二十多年的研究，尤其是近年来越来越多的面部运动单元数据库的建立和深度学习的兴起，面部运动单元检测技术发展迅速。首先，阐述了面部运动单元的基本概念，介绍了已有的常用面部运动单元检测数据库，概括了包括预处理、特征提取、分类器学习等步骤在内的传统检测方法；然后针对区域学习、面部运动单元关联学习、弱监督学习等几个关键研究方向进行了系统性的回顾梳理与分析；最后讨论了目前面部运动单元检测研究存在的不足以及未来潜在的发展方向。