A deep learning approach to the classification of 3D CAD models简

Model classification is essential to the management and reuse of 3D CAD models. Manual model classification is laborious and error prone. At the same time, the automatic classification methods are scarce due to the intrinsic complexity of 3D CAD models. In this paper, we propose an automatic 3D CAD model classification approach based on deep neural networks. According to prior knowledge of the CAD domain, features are selected and extracted from 3D CAD models first, and then pre-processed as high dimensional input vectors for category recognition. By analogy with the thinking process of engineers, a deep neural network classifier for 3D CAD models is constructed with the aid of deep learning techniques. To obtain an optimal solution, multiple strategies are appropriately chosen and applied in the training phase, which makes our classifier achieve better per-formance. We demonstrate the efficiency and effectiveness of our approach through experiments on 3D CAD model datasets.     

Path selection in disaster response management based on Q-learning

Suitable rescue path selection is very important to rescue lives and reduce the loss of disasters, and has been a key issue in the field of disaster response management. In this paper, we present a path selection algorithm based on Q-learning for disaster response applications. We assume that a rescue team is an agent, which is operating in a dynamic and dangerous environment and needs to find a safe and short path in the least time. We first propose a path selection model for disaster response management, and deduce that path selection based on our model is a Markov decision process. Then, we introduce Q-learning and design strategies for action selection and to avoid cyclic path. Finally, experimental results show that our algorithm can find a safe and short path in the dynamic and dangerous environment, which can provide a specific and significant reference for practical management in disaster response applications.     

Speaker-independent speech emotion recognition by fusion of functional and accompanying paralanguage features

Functional paralanguage includes considerable emotion information, and it is insensitive to speaker changes. To improve the emotion recognition accuracy under the condition of speaker-independence, a fusion method combining the functional paralanguage features with the accompanying paralanguage features is proposed for the speaker-independent speech emotion recognition. Using this method, the functional paralanguages, such as laughter, cry, and sigh, are used to assist speech emotion recognition. The contributions of our work are threefold. First, one emotional speech database including six kinds of functional paralanguage and six typical emotions were recorded by our research group. Second, the functional paralanguage is put forward to recognize the speech emotions combined with the accompanying paralanguage features. Third, a fusion algorithm based on confidences and probabilities is proposed to combine the functional paralanguage features with the accompanying paralanguage features for speech emotion recognition. We evaluate the usefulness of the functional paralanguage features and the fusion algorithm in terms of precision, recall, and F1-measurement on the emotional speech database recorded by our research group. The overall recognition accuracy achieved for six emotions is over 67% in the speaker-independent condition using the functional paralanguage features.     

Community Detection in Dynamic Social Networks Based on Multiobjective Immune Algorithm

Community structure is one of the most important properties in social networks,and community detection has received an enormous amount of attention in recent years.In dynamic networks,the communities may evolve over time so that pose more challenging tasks than in static ones.Community detection in dynamic networks is a problem which can naturally be formulated with two contradictory objectives and consequently be solved by multiobjective optimization algorithms.In this paper,a novel multiobjective immune algorithm is proposed to solve the community detection problem in dynamic networks.It employs the framework of nondominated neighbor immune algorithm to simultaneously optimize the modularity and normalized mutual information,which quantitatively measure the quality of the community partitions and temporal cost,respectively.The problem-specific knowledge is incorporated in genetic operators and local search to improve the effectiveness and efficiency of our method.Experimental studies based on four synthetic datasets and two real-world social networks demonstrate that our algorithm can not only find community structure and capture community evolution more accurately but also be more steadily than the state-of-the-art algorithms.     

An affective model based on fuzzy theory

A new affective model is presented, developed by fuzzy mathematics based on the differential emotions theory, in the model, human emotion and personality trait we defined is presented with fuzzy sets, and an emotion change equation to depict the change of human emotion. The equation includes the factors that affect human emotion, such as stimulus, personality trait and the fading of emotion. The paper develops a model that can simulate the human emotion better, and offers a new thinking for the research of artificial emotion.     

End-to-end delay estimation for multi-hop wireless networks with random access policy

End-to-end delay analysis is an important element of network performance analysis in multi-hop wireless networks.In this paper,we propose an analytical model for estimating the end-to-end delay performance of wireless networks employing a random access policy for managing node’transmissions on shared channels with time-varying capacity.To obtain the closed form expression,a new concept of residual effective capacity is presented using the definitions of effective bandwidth theory and effective capacity theory.This allows us to calculate the cumulative distribution function of the queuing delay.Based on this concept,we derive a formula to calculate the average end-to-end delay for multi-hop wireless networks,with the result including the effect of a random access protocol,which has not previously been considered.Finally,we validate our analysis through simulations and provide an example application for our results.     

A temporal context model for boosting video annotation

In this paper, we propose a new method to model the temporal context for boosting video annotation accuracy. The motivation of our idea mainly comes from the fact that temporally continuous shots in video are generally with relevant content, so that the performance of video annotation could be comparably boosted by mining the temporal dependency between shots in video. Based on this consideration, we propose a temporal context model to mine the redundant information between shots. By connecting our model with conditional random field and borrowing the learning and inference approaches from it, we could obtain the refined probability of a concept occurring in the shot, which is the leverage of temporal context information and initial output of video annotation. Comparing with existing methods for temporal context mining of video annotation, our model could capture different kinds of shot dependency more accurately to improve the video annotation performance. Furthermore, our model is relatively simple and efficient, which is important for the applications which have large scale data to process. Extensive experimental results on the widely used TRECVID datasets exhibit the effectiveness of our method for improving video annotation accuracy.     

Exploiting Structural and Temporal Influence for Dynamic Social-Aware Recommendation

Recent years have witnessed the rapid development of online social platforms,which effectively support the business intelligence and provide services for massive users.Along this line,large efforts have been made on the socialaware recommendation task,i.e.,leveraging social contextual information to improve recommendation performance.Most existing methods have treated social relations in a static way,but the dynamic influence of social contextual information on users'consumption choices has been largely unexploited.To that end,in this paper,we conduct a comprehensive study to reveal the dynamic social influence on users'preferences,and then we propose a deep model called Dynamic Social-Aware Recommender System(DSRS)to integrate the users'structural and temporal social contexts to address the dynamic socialaware recommendation task.DSRS consists of two main components,i.e.,the social influence learning(SIL)and dynamic preference learning(DPL).Specifically,in the SIL module,we arrange social graphs in a sequential order and borrow the power of graph convolution networks(GCNs)to learn social context.Moreover,we design a structural-temporal attention mechanism to discriminatively model the structural social influence and the temporal social influence.Then,in the DPL part,users'individual preferences are learned dynamically by recurrent neural networks(RNNs).Finally,with a prediction layer,we combine the users'social context and dynamic preferences to generate recommendations.We conduct extensive experiments on two real-world datasets,and the experimental results demonstrate the superiority and effectiveness of our proposed model compared with the state-of-the-art methods.     

Graph-ranking collective Chinese entity linking algorithm

Entity linking(EL)systems aim to link entity mentions in the document to their corresponding entity records in a reference knowledge base.Existing EL approaches usually ignore the semantic correlation between the mentions in the text,and are limited to the scale of the local knowledge base.In this paper,we propose a novel graphranking collective Chinese entity linking(GRCCEL)algorithm,which can take advantage of both the structured relationship between entities in the local knowledge base and the additional background information offered by external knowledge sources.By improved weighted word2vec textual similarity and improved PageRank algorithm,more semantic information and structural information can be captured in the document.With an incremental evidence mining process,more powerful discrimination capability for similar entities can be obtained.We evaluate the performance of our algorithm on some open domain corpus.Experimental results show the effectiveness of our method in Chinese entity linking task and demonstrate the superiority of our method over state-of-the-art methods.     

Towards True Dynamic Workflow for Emergency Response

Emergency management is a process by which all individuals, groups, and communities manage hazards in an effort to avoid or ameliorate the impact of disasters resulting from the hazards. Emergency response workflow is dynamic because there are lots of uncertainties with the course of hazard development and rescue effort. Existing dynamic workflow modeling technologies are not su±cient to describe the complex emergency response processes which are context aware and data-driven. In this paper, we propose an intelligent agent based approach to supporting the emergency response process management. The approach integrates BDI (Belief-Desire-Intention) agents with WIFA workflow model, which was developed in our previous work, to a powerful tool for truly dynamic workflow modeling and enactment. A BDI agent is an intelligent agent. Beliefs represent the informational state of the agent - in other words its beliefs about the world. Desires (or goals) represent the motivational state of the agent. They represent objectives or situations that the agent would like to accomplish or bring about. Intentions represent the deliberative state of the agent: what the agent has chosen to do. Intentions are desires to which the agent has to some extent committed. Workflows represent sequences of actions that an agent can perform to achieve one or more of its intentions. Based on this approach, we developed an emergency response training tool which is customizable for individual organization use and scalable to incident response settings from rural to urban domestically and foreign outposts for military applications, and can operate at a holistic exercise level.     

Class-specific multiple classifiers scheme to recognize emotions from speech signals

Automatic emotion recognition from speech signals is one of the important research areas, which adds value to machine intelligence. Pitch, duration, energy and Mel-frequency cepstral coefficients (MFCC) are the widely used features in the field of speech emotion recognition. A single classifier or a combination of classifiers is used to recognize emotions from the input features. The present work investigates the performance of the features of Autoregressive (AR) parameters, which include gain and reflection coefficients, in addition to the traditional linear prediction coefficients (LPC), to recognize emotions from speech signals. The classification performance of the features of AR parameters is studied using discriminant, k-nearest neighbor (KNN), Gaussian mixture model (GMM), back propagation artificial neural network (ANN) and support vector machine (SVM) classifiers and we find that the features of reflection coefficients recognize emotions better than the LPC. To improve the emotion recognition accuracy, we propose a class-specific multiple classifiers scheme, which is designed by multiple parallel classifiers, each of which is optimized to a class. Each classifier for an emotional class is built by a feature identified from a pool of features and a classifier identified from a pool of classifiers that optimize the recognition of the particular emotion. The outputs of the classifiers are combined by a decision level fusion technique. The experimental results show that the proposed scheme improves the emotion recognition accuracy. Further improvement in recognition accuracy is obtained when the scheme is built by including MFCC features in the pool of features.     

基于SVM-KNN算法的情绪脑电识别

情绪识别与日常生活的诸多领域都有很大联系.然而,通过单一算法难以获得较高的情绪识别准确率,为此,提出一种基于支持向量机(support vector machine,SVM)和K近邻(K-nearest neighbors,KNN)融合算法(SVMKNN)的情绪脑电识别模型.在情绪分类时,首先计算待识别样本与最优分类超平面的空间距离,若两者距离大于提前设定的阈值,选用SVM分类器对情绪样本分类,否则选用KNN分类器.最后在SEED情感数据集上进行实验测试,通过对比实验,得出SVM-KNN算法提高了情绪三分类的准确率.运用该模型可有效地对情绪类型进行识别,对于医疗护理方面获取表达障碍患者的情绪状态有积极意义.     

Employing hierarchical Bayesian networks in simple and complex emotion topic analysis

Traditional emotion models, when tagging single emotions in documents, often ignore the fact that most documents convey complex human emotions. In this paper, we join emotion analysis with topic models to find complex emotions in documents, as well as the intensity of the emotions, and study how the document emotions vary with topics. Hierarchical Bayesian networks are employed to generate the latent topic variables and emotion variables. On average, our model on single emotion classification outperforms the traditional supervised machine learning models such as SVM and Naive Bayes. The other model on the complex emotion classification also achieves promising results. We thoroughly analyze the impact of vocabulary quality and topic quantity to emotion and intensity prediction in our experiments. The distribution of topics such as Friend and Job are found to be sensitive to the documents’ emotions, which we call emotion topic variation in this paper. This reveals the deeper relationship between topics and emotions.     

Extracting common emotions from blogs based on fine-grained sentiment clustering

Recently, blogs have emerged as the major platform for people to express their feelings and sentiments in the age of Web 2.0. The common emotions, which reflect people’s collective and overall sentiments, are becoming the major concern for governments, business companies and individual users. Different from previous literatures on sentiment classification and summarization, the major issue of common emotion extraction is to find out people’s collective sentiments and their corresponding distributions on the Web. Most existing blog clustering methods take into account keywords, stories or timelines but neglect the embedded sentiments, which are considered very important features of blogs. In this paper, a novel method based on Probabilistic Latent Semantic Analysis (PLSA) is presented to model the hidden sentiment factors and an emotion-oriented clustering approach is proposed to find common emotions according to the fine-grained sentiment similarity between blogs. Extensive experiments are conducted on real-world datasets consisting of different topics. The results show that our approach can partition blogs into sentiment coherent clusters and the extracted common emotion words afford good navigation guidelines for embedded sentiments in each cluster.     

A BDI approach to infer student’s emotions in an intelligent learning environment

In this article we describe the use of mental states approach, more specifically the belief-desire-intention (BDI) model, to implement the process of affective diagnosis in an educational environment. We use the psychological OCC model, which is based on the cognitive theory of emotions and is possible to be implemented computationally, in order to infer the learner’s emotions from his actions in the system interface. In our work we profit from the reasoning capacity of the BDI model in order to infer the student’s appraisal (a cognitive evaluation of a person that elicits an emotion), which allows us to deduce student’s emotions. The system reasons about an emotion-generating situation and tries to infer the user’s emotion by using the OCC model. Besides, the BDI model is very adequate to infer and also model students affective states since the emotions have a dynamic nature.     

基于传递熵关键因果连接的情感识别方法

人脑在情绪活动中呈现的信息流是复杂多变的,因此理解脑区间的动态交互过程至关重要,但是基于原始脑电信号构建的情绪网络包含了许多与情绪无关的冗余信息.针对此问题,提出一种在不丢失关键因果信息的前提下去除情绪无关网络连接的方法,并验证其在情感识别过程中的有效性.首先,基于传递熵因果分析方法对积极、中性和消极情绪构建归一化传递熵矩阵,再从积极、消极情绪矩阵中减去中性情绪矩阵,最后基于简化后的矩阵构建因效性脑网络并利用图论分析不同情绪的网络连通性.通过在DEAP数据集上的验证发现,该方法有效地提高了情感识别准确率.     

基于多级SVM分类的语音情感识别算法

为了提高语音情感识别系统的识别准确率,本文在传统支持向量机(SVM)方法的基础之上,提出了一种基于PCA的多级SVM情感分类算法。首先将容易区分的情感分开,针对混淆度大且不能再利用多级分类策略直接进行区分的情感,采用主成分分析法(PCA)进行特征降维,然后逐级地判断出输入语音所属的情感类型。与传统基于SVM分类算法的语音情感识别相比,本文提出的方法可将7种情感的平均识别率提高5.05%,并且特征维度可降低58.3%,从而证明了本文所提出的方法的正确性与有效性。     

基于DBN的多特征融合音乐情感分类方法

本文在音乐情感分类中的两个重要的环节：特征选择和分类器上进行了探索.在特征选择方面基于传统算法中单一特征无法全面表达音乐情感的问题,本文提出了多特征融合的方法,具体操作方式是用音色特征与韵律特征相结合作为音乐情感的符号表达;在分类器选择中,本文采用了在音频检索领域表现较好的深度置信网络进行音乐情感训练和分类.实验结果表明,该算法对音乐情感分类的表现较好,高于单一特征的分类方法和SVM分类的方法.     

基于过程神经元的语音情感识别的建模与仿真

为克服由传统语音情感识别模型的缺陷导致的识别正确率不高的问题,将过程神经元网络引入到语音情感识别中来。通过提取基频、振幅、音质特征参数作为语音情感特征参数,利用小波分析去噪,主成分分析（PCA）消除冗余,用过程神经元网络对生气、高兴、悲伤和惊奇四种情感进行识别。实验结果表明,与传统的识别模型相比,使用过程神经元网络具有较好的识别效果。     

基于多流CNN-LSTM网络的群体情绪识别

群体情绪识别是人机交互领域的前言课题,针对群体情绪识别准确率的问题,结合卷积神经网络（CNN）与长短期记忆网络（LSTM）,提出一种多流CNN-LSTM网络模型学习群体情绪的静态和动态特征。以视频序列的原始图像、视觉显著图形和叠加的光流图像分别作为三个通道的输入,利用CNN网络对空间特征和局部运动特征进行分析,得到的特征图直接输入LSTM网络,进行全局运动特征的学习。最后连接Softmax分类器,对三个通道的Softmax输出进行加权融合,得到分类结果。实验结果表明,本文模型可有效地识别4种典型的群体情绪,且识别率高于已有算法,准确度（ACC）和宏平均精度（MAP）分别最高可达82.6%、84.1%。