In this paper, a new linear delayed delta operator switched system model is proposed to describe networked control systems with packets dropout and network-induced delays. The plant is a continuous-time system, which ...
详细信息
Recently, Gutierrez-Naranjo and Leporati considered performing basic arithmetic operations on a new class of bioinspired computing devices -- spiking neural P systems (for short, SN P systems). However, the binary enc...
详细信息
Recently, Gutierrez-Naranjo and Leporati considered performing basic arithmetic operations on a new class of bioinspired computing devices -- spiking neural P systems (for short, SN P systems). However, the binary encoding mechanism used in their research looks like the encoding approach in electronic circuits, instead of the style of spiking neurons (in usual SN P systems, information are encoded as the time interval between spikes). In this work, three SN P systems are constructed as adder, subtracter and multiplier, respectively. In these devices, a number is inputted to the system as the interval of time elapsed between two spikes received by input neuron, the result of a computation is the time between the moments when the output neuron spikes.
In remote sensing researches, the curse of dimensionality is one greatly difficult classification problem. Many studies have demonstrated that multiple classifier systems, such as the random subspace method (RSM), can...
详细信息
In remote sensing researches, the curse of dimensionality is one greatly difficult classification problem. Many studies have demonstrated that multiple classifier systems, such as the random subspace method (RSM), can alleviate small sample size and high dimensionality concern and obtain more outstanding and robust results than a single classifier on extensive pattern recognition issues. A dynamic subspace method (DSM) was proposed for constructing component classifiers with adaptive subspaces to adjust the shortcomings of RSM based on re substitution accuracy by applying each classifier. However, the performances of SVMs are based on choosing the proper kernel functions or proper parameters of a kernel function. The objective of this research is to develop a novel ensemble technique based on support vector machines (SVMs) via the optimal kernel method, and propose a novel subspace selection mechanism, named the kernel-based dynamic subspace method (KDSM), to improve DSM on automatically determining dimensionality and selecting component dimensions for diverse subspaces. Experimental results show a sound performance of classification on the famous hyperspectral images, Washington DC Mall.
作者:
G. LiW.P. HeathG. HerrmannSchool of Engineering
Computing and Mathematics University of Exeter North Park Road Exeter UK EX4 4QF Control Systems Centre
School of Electrical and Electronic Engineering University of Manchester Sackville Street Building Manchester M13 9PL UK ACTLab
Department of Mechanical Engineering University of Bristol Queens Building University Walk Bristol BS8 1TR UK
Abstract We develop an anti-windup (AW) compensator synthesis approach using Integral Quadratic Constraints (IQC). The synthesis finds the AW compensator that achieves a specified robustness against additive or input ...
Abstract We develop an anti-windup (AW) compensator synthesis approach using Integral Quadratic Constraints (IQC). The synthesis finds the AW compensator that achieves a specified robustness against additive or input multiplicative uncertainty, provided there exists a feasible solution. We also incorporate a performance criterion into the AW compensator synthesis to achieve an appropriate trade-off between the performance and robustness. The efficacy of this approach is demonstrated by a numerical example.
This paper introduces a two-stage Linear Logic based program synthesis approach to automatic RESTful web service composition. The Linear Logic theorem proof is applied at both resource and service invocation method le...
详细信息
This paper introduces a two-stage Linear Logic based program synthesis approach to automatic RESTful web service composition. The Linear Logic theorem proof is applied at both resource and service invocation method levels, which greatly improves the searching efficiency and guarantees the correctness and completeness of the service composition. Furthermore, the process calculus is used as formalism for the composition process, which enables the approach to be executable at the business management level. The process calculus is attached to the Linear Logic inference rules in the style of type theory, so the process model is extracted directly from the complete proof. An example is given to show the extraction of a process model from a Linear Logic proof search.
This article deals with the exploitation of magnetic susceptibility artifacts in magnetic resonance imaging (MRI) for the recognition of metallic delivery capsules. The targeted application is a closed-loop position c...
详细信息
When tracking people or other moving objects with a mobile robot, detection is the first and most critical step. At first most researchers focused on the tracking algorithms, but recently AdaBoost (supervised machine ...
详细信息
Presented paper deals with processing of electron-microscope images of Picea Abies stomas. A stoma character strongly depends on the level of air pollution in the area where the tree grows - as the stoma epidermis cov...
详细信息
This paper is concerned with the problem of H ∞ filtering for a class of discrete-time linear parameter-varying (LPV) systems with Markovian switching under data missing and quantization. A stochastic variable is us...
详细信息
This paper is concerned with the problem of H ∞ filtering for a class of discrete-time linear parameter-varying (LPV) systems with Markovian switching under data missing and quantization. A stochastic variable is used to describe the model of the data missing phenomenon. Then a H ∞ filter is designed to guarantee the filtering error dynamics is stochastically stable with H ∞ performance. The existence of the desired H ∞ filter is ensured by some sufficient conditions expressed in terms of parameterized linear matrix inequalities (PLMIs). The proposed theoretical findings are validated by numerical results.
暂无评论