Multi-Classifier Fusion Based on MI–SFFS for Cross-Subject Emotion Recognition

With the widespread use of emotion recognition, cross-subject emotion recognition based on EEG signals has become a hot topic in affective computing. Electroencephalography (EEG) can be used to detect the brain’s electrical activity associated with different emotions. The aim of this research is to improve the accuracy by enhancing the generalization of features. A Multi-Classifier Fusion method based on mutual information with sequential forward floating selection (MI_SFFS) is proposed. The dataset used in this paper is DEAP, which is a multi-modal open dataset containing 32 EEG channels and multiple other physiological signals. First, high-dimensional features are extracted from 15 EEG channels of DEAP after using a 10 s time window for data slicing. Second, MI and SFFS are integrated as a novel feature-selection method. Then, support vector machine (SVM), k-nearest neighbor (KNN) and random forest (RF) are employed to classify positive and negative emotions to obtain the output probabilities of classifiers as weighted features for further classification. To evaluate the model performance, leave-one-out cross-validation is adopted. Finally, cross-subject classification accuracies of 0.7089, 0.7106 and 0.7361 are achieved by the SVM, KNN and RF classifiers, respectively. The results demonstrate the feasibility of the model by splicing different classifiers’ output probabilities as a portion of the weighted features.     

Domain Adaptation with Data Uncertainty Measure Based on Evidence Theory

Domain adaptation aims to learn a classifier for a target domain task by using related labeled data from the source domain. Because source domain data and target domain task may be mismatched, there is an uncertainty of source domain data with respect to the target domain task. Ignoring the uncertainty may lead to models with unreliable and suboptimal classification results for the target domain task. However, most previous works focus on reducing the gap in data distribution between the source and target domains. They do not consider the uncertainty of source domain data about the target domain task and cannot apply the uncertainty to learn an adaptive classifier. Aimed at this problem, we revisit the domain adaptation from source domain data uncertainty based on evidence theory and thereby devise an adaptive classifier with the uncertainty measure. Based on evidence theory, we first design an evidence net to estimate the uncertainty of source domain data about the target domain task. Second, we design a general loss function with the uncertainty measure for the adaptive classifier and extend the loss function to support vector machine. Finally, numerical experiments on simulation datasets and real-world applications are given to comprehensively demonstrate the effectiveness of the adaptive classifier with the uncertainty measure.     

Age Analysis of Status Updating System with Probabilistic Packet Preemption

The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is Ber/Geo/1/2*/η, which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability η. Instead of considering the system’s AoI separately, we use a three-dimensional state vector (n,m,l) to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system’s average AoI and show that the average AoI of the system without packet preemption is obtained by letting η=0. When η is set to 1, the mean of the AoI of the system with a Ber/Geo/1/2* queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the Ber/Geo/1/c queue and the average continuous AoI with the M/M/1/c queue. For each of two extreme cases where η=0 and η=1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability η, as well as the AoI’s distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.     

Application of Two Novel Acoustic Emission Parameters on Identifying the Instability of Granite

The issue of monitoring and early warning of rock instability has received increasing critical attention in the study of rock engineering. To investigate the damage evolution process of granite under triaxial compression tests, acoustic emission (AE) tests were performed simultaneously. This study firstly introduced two novel parameters, i.e., the coefficient of variation (CoV) of the information entropy and correlation dimension of the amplitude data from the AE tests, to identify the precursor of the failure of granite. Then the relationship between the changes in these parameters and the stress-time curve was compared and analyzed. The results of this study show that: (1) There is a strong correlation between the CoV of the information entropy and the failure process of granite. The granite failed when the CoV curve raised to a plateau, which could be used as an indicator of rock instability. (2) The fluctuation of the correlation dimension indicates the different stages during the loading process, i.e., the initial compaction stage, the linear elastic stage, the yield stage, and the failure stage. Each stage contains a descending and a rising process in the correlation dimension curve, and the exhibited starting point or the bottom point at the correlation dimension curve could be selected as the indicator point for the rock instability. (3) The combined analysis of the Information entropy and Correlation dimension can improve the accuracy of rock instability prediction. This study provides new insights into the prediction of rock instability, which has theoretical implications for the stability of subsurface engineering rock masses.     

From Chaos to Ordering: New Studies in the Shannon Entropy of 2D Patterns

Properties of the Voronoi tessellations arising from random 2D distribution points are reported. We applied an iterative procedure to the Voronoi diagrams generated by a set of points randomly placed on the plane. The procedure implied dividing the edges of Voronoi cells into equal or random parts. The dividing points were then used to construct the following Voronoi diagram. Repeating this procedure led to a surprising effect of the positional ordering of Voronoi cells, reminiscent of the formation of lamellae and spherulites in linear semi-crystalline polymers and metallic glasses. Thus, we can conclude that by applying even a simple set of rules to a random set of seeds, we can introduce order into an initially disordered system. At the same time, the Shannon (Voronoi) entropy showed a tendency to attain values that are typical for completely random patterns; thus, the Shannon (Voronoi) entropy does not distinguish the short-range ordering. The Shannon entropy and the continuous measure of symmetry of the patterns demonstrated the distinct asymptotic behavior, while approaching the close saturation values with the increase in the number of iteration steps. The Shannon entropy grew with the number of iterations, whereas the continuous measure of symmetry of the same patterns demonstrated the opposite asymptotic behavior. The Shannon (Voronoi) entropy is not an unambiguous measure of order in the 2D patterns. The more symmetrical patterns may demonstrate the higher values of the Shannon entropy.     

Formalising the Pathways to Life Using Assembly Spaces

Assembly theory (referred to in prior works as pathway assembly) has been developed to explore the extrinsic information required to distinguish a given object from a random ensemble. In prior work, we explored the key concepts relating to deconstructing an object into its irreducible parts and then evaluating the minimum number of steps required to rebuild it, allowing for the reuse of constructed sub-objects. We have also explored the application of this approach to molecules, as molecular assembly, and how molecular assembly can be inferred experimentally and used for life detection. In this article, we formalise the core assembly concepts mathematically in terms of assembly spaces and related concepts and determine bounds on the assembly index. We explore examples of constructing assembly spaces for mathematical and physical objects and propose that objects with a high assembly index can be uniquely identified as those that must have been produced using directed biological or technological processes rather than purely random processes, thereby defining a new scale of aliveness. We think this approach is needed to help identify the new physical and chemical laws needed to understand what life is, by quantifying what life does.     

应用波分复用改善像束传像系统像质的研究

本文通过分析空间波分复用系统中包散元件的色散平均效应,用线扩散传递函数研究了像束传像性质,由光学成像的本征理论用像束成像信息量分析了波分复用改善像束传像像质的机制,并从实验上验证了上述分析结论.     

基于多层次特征的跨场景服装检索

针对跨场景服装检索如何提取更有表述力的服装特征问题,提出了一种新的基于高层公共特征约束的相似性度量算法。首先,通过类别空间学习提取不同场景域的类别信息;然后,在场景域空间网络用类别信息约束传统对比损失函数,增大对类间负样本对的惩罚以减轻过拟合;最后,融合类别公共特征和域特定特征并通过类别判断进行辅助检索。分析和实验结果表明,新算法对跨场景服装检索的准确度要优于当前前沿的方法。     

考虑多阶段决策信息集结的新算法及其应用

针对多阶段区间信息集结与决策问题,提出一种考虑最小化集结矩阵与阶段区间矩阵之间距离的新方法,寻求更趋近帕累托最优的集结结果,使最终评价值更符合多阶段评价的目标。 首先,根据多阶段专家评价值将区间信息转化为二维坐标点,并将其映射到二维坐标系中。然后,构建区间信息离差最小化集结模型,并基于植物模拟生长算法(PGSA）进行群体判断信息的集结,再通过合成各方案的属性评价值,给出各决策方案的综合评价值并进行排序,进而给出最优决策方案。最后,以物流服务商的多阶段绩效评价为例,验证了该方法的合理性和有效性。