A new nonlinear protocol is proposed for state consensus of multi-agent systems in this paper. It is shown that this protocol can provide faster convergence rate than the typical linear protocol, presented by Olfati-S...
详细信息
A new nonlinear protocol is proposed for state consensus of multi-agent systems in this paper. It is shown that this protocol can provide faster convergence rate than the typical linear protocol, presented by Olfati-Saber and Murray, and furthermore guarantees the states of agents reach a consensus in finite time, provided that the interaction topology, represented by a directed graph, has a spanning tree.
This chapter presents our solution to the CoCoME assignment that is based on the Fractal component model. The solution involves (i) modeling architecture in Fractal ADL, (ii) specification of component behavior via be...
详细信息
Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, Weber Local Descriptor (WLD). It is based on the fact that human perception of a pattern depends on not only th...
详细信息
Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, Weber Local Descriptor (WLD). It is based on the fact that human perception of a pattern depends on not only the change of a stimulus (such as sound, lighting, et al.) but also the original intensity of the stimulus. Specifically, WLD consists of two components: its differential excitation and orientation. A differential excitation is a function of the ratio between two terms: One is the relative intensity differences of its neighbors against a current pixel;the other is the intensity of the current pixel. An orientation is the gradient orientation of the current pixel. For a given image, we use the differential excitation and the orientation components to construct a concatenated WLD histogram feature. Experimental results on Brodatz textures show that WLD impressively outperforms the other classical descriptors (e.g., Gabor). Especially, experimental results on face detection show a promising performance. Although we train only one classifier based on WLD features, the classifier obtains a comparable performance to state-of-the-art methods on MIT+CMU frontal face test set, AR face dataset and CMU profile test set.
Most work on multi-biometric fusion is based on static fusion rules which cannot respond to the changes of the environment and the individual users. This paper proposes adaptive multi-biometric fusion, which dynamical...
详细信息
Most work on multi-biometric fusion is based on static fusion rules which cannot respond to the changes of the environment and the individual users. This paper proposes adaptive multi-biometric fusion, which dynamically adjusts the fusion rules to suit the real-time external conditions. As a typical example, the adaptive fusion of gait and face in video is studied. Two factors that may affect the relationship between gait and face in the fusion are considered, i.e., the view angle and the subject-to-camera distance. Together they determine the way gait and face are fused at an arbitrary time. Experimental results show that the adaptive fusion performs significantly better than not only single biometric traits, but also those widely adopted static fusion rules including SUM, PRODUCT, MIN, and MAX.
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of e...
详细信息
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of each flow for the mQAP, it is best to use Pareto optimization to obtain the Pareto front or an approximation of it. Although Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems, research on mQAP has not much been investigated. This paper introduces a fuzzy particle swarm algorithm to handle the Multiobjective Quadratic Assignment Problem (mQAP). In the fuzzy scheme, the representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is introduced between the particles in the swarm and the problem space in an efficient way. We evaluated the performance of the proposed approach. Empirical results illustrate that the approach can be applied for solving mQAP's very effectively.
Single-row routing is fundamentally a routing technique for pairs of nodes arranged in a single-row *** contributes in the printed circuit hoard(PCB)design. The main objective in single-row routing is to achieve minim...
详细信息
Single-row routing is fundamentally a routing technique for pairs of nodes arranged in a single-row *** contributes in the printed circuit hoard(PCB)design. The main objective in single-row routing is to achieve minimum congestion arising from the number of horizontal tracks in the *** results for a single layer network have been achieved through our previous model called ***,a single layer model suffers from non-tolerable lower bound values with high congestion depending on the network size. These results may further be improved by partitioning the network into two or more *** this paper,we propose a technique based on the graph partitioning concept for partitioning the nodes from a single-row network into several layers of planar *** experiment result shows that the proposed technique is able to decrease the network congestions.
Component-based engineering is a recognized paradigm, which models an application as a collection of reusable components. The key idea behind components is that they contain only the business logic and communicate wit...
详细信息
Component-based engineering is a recognized paradigm, which models an application as a collection of reusable components. The key idea behind components is that they contain only the business logic and communicate with one another only via well-defined interfaces. The communication paths among components (so called bindings) are in modern component systems realized by software connectors, which allow explicit modeling of communication and also its implementation at runtime. An important aspect of using connectors is the possibility of their automatic generation, which saves a significant amount of development work. However, the generation itself is not a trivial task, since there is a big semantic gap between the abstract specification of a connector at design time and its implementation at runtime. In this paper, we present an approach to generating implementations of software connectors. The approach is based on a new domain specific language for describing templates of connector implementations and a transformation framework using the Strate-go/XT term rewriting system for generating source code of connectors.
To allow comfortable and easy development, component systems have to provide a rather a big set of development supporting tools including at least a tool for composition and repository for storing and retrieving compo...
详细信息
To allow comfortable and easy development, component systems have to provide a rather a big set of development supporting tools including at least a tool for composition and repository for storing and retrieving components. In this paper, we evaluate and present advantages of using MOF and meta-modeling during definition of component system and also during development of the supporting tools. Most of the presented arguments are based on a broad practical experience with designing the component systems SOFA and SOFA 2; the former designed in the classical ad hoc manual way, while the latter via meta-modeling.
In this paper we present a general FEM (finite element method) solution that enables fast dynamic deformation simulation on the newly available GPU (graphics processing unit) hardware with compute unified device archi...
详细信息
In this paper we present a general FEM (finite element method) solution that enables fast dynamic deformation simulation on the newly available GPU (graphics processing unit) hardware with compute unified device architecture (CUDA) from NVIDIA. CUDA-enabled GPUs harness the power of 128 processors which allow data parallel computations. Compared to the previous GPGPU, it is significantly more flexible with a C language interface. We not only implement FEM deformation computation algorithms with CUDA but also analyze the performance in detail. Our test results indicate that the GPU with CUDA enables about 4 times speedup for FEM deformation computation on an Intel(R) Core 2 Quad 2.0 GHz machine with GeForce 8800 GTX.
暂无评论