The BDI model has always been the focus of subject modeling research, which includes three kinds of thinking states of the rational subject: Belief, Desire and Intention. Belief is the cognition of agent to the world;...
详细信息
The BDI model has always been the focus of subject modeling research, which includes three kinds of thinking states of the rational subject: Belief, Desire and Intention. Belief is the cognition of agent to the world;it is a collection of environmental information, other agent information, and its own information that the agent has;and it is also the basis of the agent's thinking activity. Due to differences in the individual's living environment and experience, the formation of heterogeneous beliefs is an important issue in the BDI model study. This article divides individual belief set into two parts: knowledge belief and achievable belief. This article proposes an overall framework for the formation of individual heterogeneity beliefs: First, the individual's knowledge experience is modeled, and the empirical knowledge is structured and quantified into binary propositions;then the BP neural network learn and memory propositions of different combinations to form heterogeneous beliefs. Experiments show that this method can simulate the heterogeneity of individual beliefs caused by the individual's own experience, and can realize the belief generation mechanism of gradual information flow, limited attention and heterogeneous priors.
In this paper, a distributed extended Kalman filtering algorithm is developed for a class of discrete-time nonlinear systems subject to stochastic disturbances and randomly occurring deception attacks. In order to uti...
详细信息
In this paper, a distributed extended Kalman filtering algorithm is developed for a class of discrete-time nonlinear systems subject to stochastic disturbances and randomly occurring deception attacks. In order to utilize the limited communication and computation resources efficiently, the event-triggered communication scheme is introduced such that data transmission is executed only when the predefined condition is violated. Furthermore, a set of independent Bernoulli random variables with known statistical properties is defined to characterize the phenomenon of randomly occurring deception attacks. An upper bound for the estimation error covariance considering the event-triggered meachanism and linearization errors is derived via the varianceconstrained approach. The filter gain for each node can be calculated recursively by solving two Raccati-like difference equations to minimize such an upper bound, which is suitable for online application. Finally, an illustrative example is presented to verify the feasibility and effectiveness of the proposed algorithm.
The field of person re-identification has made significant advances riding on the wave of deep learning. However, owing to the fact that there are much more easy examples than those meaningful hard examples in dataset...
详细信息
The field of person re-identification has made significant advances riding on the wave of deep learning. However, owing to the fact that there are much more easy examples than those meaningful hard examples in dataset, the training tends to stagnate quickly and the model may suffer from over-fitting. Therefore, the hard sample mining method is fateful to optimize the model and improve the learning efficiency. In this paper, an Adaptive Hard Sample Mining algorithm is proposed for training a robust person re-identification model. No need for hand-picking the images in the batch or designing the loss function for both positive and negative pairs, we can briefly calculate the hard level by comparing the prediction result with the true label of the sample. Meanwhile, an adaptive threshold of hard level can make the algorithm not only stay in step with training process harmoniously but also alleviate the under-fitting and over-fitting problem simultaneously. Besides, the designed network to implement the approach has good generalization performance that can be combined with various of existing models readily. Experimental results on Market-1501 and DukeMTMC-reID datasets clearly demonstrate the effectiveness of the proposed algorithm.
Numerical P systems(for short, NP systems) are distributed and parallel computing models inspired from the structure of living cells and economics. Enzymatic numerical P systems(for short, ENP systems) are a variant o...
详细信息
Numerical P systems(for short, NP systems) are distributed and parallel computing models inspired from the structure of living cells and economics. Enzymatic numerical P systems(for short, ENP systems) are a variant of NP systems, which have been successfully applied in designing and implementing controllers for mobile robots. Since ENP systems were proved to be Turing universal, there has been much work to simplify the universal systems, where the complexity parameters considered are the number of membranes, the degrees of polynomial production functions or the number of variables used in the *** the number of enzymatic variables, which is essential for ENP systems to reach universality, has not been investigated. Here we consider the problem of searching for the smallest number of enzymatic variables needed for universal ENP systems. We prove that for ENP systems as number acceptors working in the all-parallel or one-parallel mode, one enzymatic variable is sufficient to reach universality; while for the one-parallel ENP systems as number generators, two enzymatic variables are sufficient to reach *** results improve the best known results that the numbers of enzymatic variables are 13 and 52 for the all-parallel and one-parallel systems, respectively.
作者:
Wang X.Su H.Cai Y.Department of Automation
Shanghai Jiaotong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China School of Automation
Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Luoyu Road 1037 Wuhan 430074 China
This paper focuses on the robust semi-global coordinated tracking of general linear systems subject to input saturation together with input additive disturbance and dead zone. A fully distributed algorithm which relat...
详细信息
Deep learning is widely used in computer vision. In this study, we present a new method based on Convolutional Neural Networks (CNN) and subspace learning for face recognition under two circumstances. A very deep CNN ...
详细信息
In this paper, the H∞ consensus of fractional-order multi-agent systems with directed communication graph is investigated. It's the first time to introduce the H∞ control to investigate the consensus problem of ...
详细信息
In this paper, the H∞ consensus of fractional-order multi-agent systems with directed communication graph is investigated. It's the first time to introduce the H∞ control to investigate the consensus problem of the fractional-order multi-agent systems. In view of Mittag-Leffler stability theory and fractional Lyapunov directed method, a sufficient condition is presented to guarantee all the agents reach consensus with the desired H∞ performance. Finally, the results are verified by several numerical simulations.
Regression problems are pervasive in real-world applications. Generally a substantial amount of labeled samples are needed to build a regression model with good generalization ability. However, many times it is relati...
详细信息
Multi-view datasets are frequently encountered in learning tasks, such as web data mining and multimedia information analysis. Given a multi-view dataset, traditional learning algorithms usually decompose it into seve...
详细信息
Rolling bearing faults are among the primary causes of breakdown in mechanical equipment. Aiming at the vibration signals of rolling bearing which are non-stationary and easy to be disturbed by noise, a novel fault di...
Rolling bearing faults are among the primary causes of breakdown in mechanical equipment. Aiming at the vibration signals of rolling bearing which are non-stationary and easy to be disturbed by noise, a novel fault diagnosis method based on curvelet transform and metric learning is proposed. This method consists of 3 parts. The first one is feature engineering which includes reshaping the original timing features of rolling bearings, employing curvelet transform to transform reshaped features and making its coefficients as the new features. Curvelet transform can analyse the original signal from many angles. The second one is employing metric learning to map these new features into special embedding space. The last one is applying KNN classifier to detect the rolling bearing faults. Metric learning can effectively improve the performance of KNN by learning a mapping matrix to modify the distribution of samples. The proposed method overcomes the problems such as the subjectivity and blindness of manual feature extraction, poor coupling in each stage and sensitive to the effect of noise. Extensive simulations based on several data-sets show that the our method has better performance on bearing fault diagnosis than traditional methods.
暂无评论