This paper provides a complete solution for the problem how to accurately compute the similarity between fuzzy sets with Gaussian membership functions, which is a fundamental issue for the identification and simplific...
详细信息
ISBN:
(纸本)9781467376839
This paper provides a complete solution for the problem how to accurately compute the similarity between fuzzy sets with Gaussian membership functions, which is a fundamental issue for the identification and simplification of FNNs. It is shown that there are three different types of similarities between a pair of Gaussian membership functions dependent on the relative positioning between the given pair of membership functions, and the accurate and detailed computing formulas are given in each type. A simulation example is given to compare the proposed accurate similarity analysis method with the existing approximation approaches and to show how much more accuracy can be obtained than the approximation one in terms of absolute percentage approximation error.
In order to complete a service task more efficiently, robot needs to create a map quickly and recognize objects during this process. In this paper, a novel mapping method is proposed to address this problem. Firstly, ...
详细信息
ISBN:
(纸本)9781479970995
In order to complete a service task more efficiently, robot needs to create a map quickly and recognize objects during this process. In this paper, a novel mapping method is proposed to address this problem. Firstly, Admissible Space Tree is generated to acquire possible node. Then, immune algorithm is applied for its advantages such as diversity, dynamic, parallel management and self-adaptation. And antibody affinity is constructed to select optimal path. Meanwhile, robot recognizes key objects on its way to get the semantic information. To achieve this purpose, normed gradients feature has been extracted to describe the object windows. It is based on just a few training images and also has the ability to learn incrementally. Subsequently, three support vector machines are respectively used for objectness estimation and object types detection. Experimental results demonstrate that the presented method can build a semantic map more efficient, which verifies the feasibility of proposed algorithm.
High dimension of the features employed for face recognition is the main reason to slow down the recognition speed. Additionally, selecting salient facial features has significant impact on the efficiency of face reco...
详细信息
High dimension of the features employed for face recognition is the main reason to slow down the recognition speed. Additionally, selecting salient facial features has significant impact on the efficiency of face recognition. In order to get the sparse and salient facial features, this paper propose a new sparse learning approach for salient facial feature description. This approach is to learn the feature evaluation vector with the training samples composed of within- and between-class distance vector sets. Then, the feature evaluation vector is employed to construct a new model for salient facial feature description. Experimental results show that the proposed method achieves much better face recognition performance with lower feature dimensionality.
The High Efficiency Video Coding (HEVC) with the transform bypass mode is simple but inefficient for lossless coding. For this reason, we propose a novel transform to further eliminate the redundancy between residues ...
详细信息
Graph pattern matching is a hot spot in the big data era, which is to find answer graphs matching a given query graph in a data graph of graph databases. “Matching” means two graphs satisfy some relation, such as is...
详细信息
Graph pattern matching is a hot spot in the big data era, which is to find answer graphs matching a given query graph in a data graph of graph databases. “Matching” means two graphs satisfy some relation, such as isomorphism, simulation, bisimulation, etc. Since there are seldom algorithms for the subgraph bisimulation, our work commits to solve the graph pattern matching problem involving bisimulation relations through the model checking technology. We characterize query graphs by modal formulas. By model checking the formulas in the data graphs, the answer graphs bisimilar to the query graphs can be discovered. We add * to basic modal logic language resulting in ML + * language, and add r* to form ML + * formulas. Then a theorem which states that ML + * formulas characterize finite directed graphs modulo bisimulation is put forward. Furthermore, we list steps to find answer graphs bisimilar to a query graph.
In this paper, continuous-time Zhang dynamics (CTZD) models and discrete-time Zhang dynamics (DTZD) models are proposed to solve in real time for the time-varying pth root, from real domain to complex domain. In addit...
详细信息
In this paper, continuous-time Zhang dynamics (CTZD) models and discrete-time Zhang dynamics (DTZD) models are proposed to solve in real time for the time-varying pth root, from real domain to complex domain. In addition, the convergence properties of the proposed Zhang dynamics (ZD) models are discussed and proved. Furthermore, exploiting different parameters in the proposed ZD models is investigated in order to achieve superior convergence and better accuracy. Computer-simulation and experiment results further substantiate the efficacy of the proposed ZD models. Moreover, the superiority of DTZD models is verified by comparing with Newton-Raphson iteration (NRI).
Modern societies increasingly rely on automatic controlsystems. These systems are hardly pure technical systems; instead they are complex socio-technical systems, which consist of technical elements and social compon...
详细信息
Modern societies increasingly rely on automatic controlsystems. These systems are hardly pure technical systems; instead they are complex socio-technical systems, which consist of technical elements and social components. It is necessary to have a systematic approach to analyze these systems because it is growing evidence that accidents from these systems usually have complex causal factors which form an interconnected network of events,rather than a simple cause-effect chain. We take railway Train controlsystems(TCS) as an example to demonstrate the importance of the socio-technical approach to analyze the system. The paper presents an investigation of recent high-speed railway accident by applying STAMP – one of the most notable socio-technical system analysis techniques, outlines improvements to the system which could avoid similar accidents in the future. We also provide our valuable feedback for the use of STAMP.
In this paper, the Zhang-gradient (ZG) method, which is a combination of Zhang dynamics (ZD) and gradient dynamics (GD) methods, is proposed for solving the tracking control problem of the multiple-input multiple-outp...
详细信息
ISBN:
(纸本)9781467391054
In this paper, the Zhang-gradient (ZG) method, which is a combination of Zhang dynamics (ZD) and gradient dynamics (GD) methods, is proposed for solving the tracking control problem of the multiple-input multiple-output (MIMO) system. Different from the traditional ZG method, GD is used additionally twice more in this paper to get through the derivation procedure. Moreover, each GD parameter is tunable for each GD design formula instead of being traditionally assigned the same value, which is the key point in this research for making simulations successful. Besides, simulation verifications further illustrate that the proposed controller group based on the ZG method achieves not only satisfactory tracking accuracy but also rapid tracking rate.
With high definition cameras are widely used in urban traffic monitoring, the resolution of vehicle and traffic monitoring image rises. As the main component of intelligent traffic system, the vehicle license plate re...
详细信息
Traditional anti-windup compensators are designed for activation immediately at the occurrence of actuator ***,anti-windup compensators were designed for actuation either after the saturation has reached a certain lev...
详细信息
Traditional anti-windup compensators are designed for activation immediately at the occurrence of actuator ***,anti-windup compensators were designed for actuation either after the saturation has reached a certain level or in anticipation of its *** the case of static anti-windup compensators,it has been shown that an anti-windup compensator designed for activation in anticipation of actuator saturation would lead to better performance than those designed for immediate or delayed activation could,both in terms of transient performance and the size of the domain of *** recently,it has been shown that a dynamic anti-windup compensator designed for anticipatory activation would also result in better transient performance than those designed for immediate or delayed activation *** this paper,we design dynamic anti-windup compensators for the enlargement of the domain of *** compensators are designed respectively for immediate,delayed and anticipatory *** will show by simulation that a dynamic anti-windup compensator designed for anticipatory activation would result in a larger domain of attraction than a dynamic anti-windup compensator designed for immediate or delayed activation could.
暂无评论