1087779
A note on the robust stability of uncertain stochastic fuzzy systems with time-delays
Takagi-Sugeno (T-S) fuzzy models are now often used to describe complex nonlinear systems in terms of fuzzy sets and fuzzy reasoning applied to a set of linear submodels. In this note, the T-S fuzzy model approach is exploited to establish stability criteria for a class of nonlinear stochastic systems with time delay. Sufficient conditions are derived in the format of linear matrix inequalities (LMIs), such that for all admissible parameter uncertainties, the overall fuzzy system is stochastically exponentially stable in the mean square, independent of the time delay. Therefore, with the numerically attractive Matlab LMI toolbox, the robust stability of the uncertain stochastic fuzzy systems with time delays can be easily checked.
44693659
Global exponential stability of generalized recurrent neural networks with discrete and distributed delays
This paper is concerned with analysis problem for the global exponential stability of a class of recurrent neural networks (RNNs) with mixed discrete and distributed delays. We first prove the existence and uniqueness of the equilibrium point under mild conditions, assuming neither differentiability nor strict monotonicity for the activation function. Then, by employing a new Lyapunov-Krasovskii functional, a linear matrix inequality (LMI) approach is developed to establish sufficient conditions for the RNNs to be globally exponentially stable. Therefore, the global exponential stability of the delayed RNNs can be easily checked by utilizing the numerically efficient Matlab LMI toolbox, and no tuning of parameters is required. A simulation example is exploited to show the usefulness of the derived LMI-based stability conditions.
10306588
Word Graphs: The Second Set
In continuation of the paper of Hoede and Li on word graphs for a set of prepositions, word graphs are given for adjectives, adverbs and Chinese classifier words. It is argued that these three classes of words belong to a general class of words that may be called adwords. These words express the fact that certain graphs may be brought into connection with graphs that describe the important classes of nouns and verbs. Some subclasses of adwords are discussed as well as some subclasses of Chinese classifier words.
5760140
Reliable control design of fuzzy dynamic systems with time-varying delay
This paper focuses on the reliable fuzzy control design problem for fuzzy control systems with time delay. Based on linear matrix inequality (LMI) approach, a method for designing a reliable fuzzy controller is presented. The resulting fuzzy control systems are reliable in the sense that asymptotic stability is achieved not only when all control components are operating well, but also in the presence of some component failures. A reliable fuzzy control design scheme via state feedback is proposed in terms of LMIs. The result is extended to the case of observer-based reliable fuzzy control. Two illustrative examples are given to illustrate the validity of the proposed design procedures.
11194956
Fuzzy guaranteed cost control for nonlinear systems with time-varying delay
This paper focuses on the problem of guaranteed cost control for Takagi-Sugeno (T-S) fuzzy systems with time-varying delayed state. A linear quadratic cost function is considered as a performance index of the closed-loop fuzzy system. Then, the guaranteed cost control of the closed-loop fuzzy system is discussed, and the sufficient conditions are provided for the construction of a guaranteed cost controller via state feedback and observer-based output feedback. When these conditions, which are given in terms of the feasibility of linear matrix inequalities (LMIs), are satisfied, the designed state feedback controller and observer-based controller gain matrices can be obtained via a convex optimization problem. Two illustrative examples are provided to demonstrate the effectiveness of the approaches proposed in this paper.
4392406
Synthesis and rendering of bidirectional texture functions on arbitrary surfaces
The bidirectional texture function (BTF) is a 6D function that describes the appearance of a real-world surface as a function of lighting and viewing directions. The BTF can model the fine-scale shadows, occlusions, and specularities caused by surface mesostructures. We present algorithms for efficient synthesis of BTFs on arbitrary surfaces and for hardware-accelerated rendering. For both synthesis and rendering, a main challenge is handling the large amount of data in a BTF sample. To addresses this challenge, we approximate the BTF sample by a small number of 4D point appearance functions (PAFs) multiplied by 2D geometry maps. The geometry maps and PAFs lead to efficient synthesis and fast rendering of BTFs on arbitrary surfaces. For synthesis, a surface BTF can be generated by applying a texton-based synthesis algorithm to a small set of 2D geometry maps while leaving the companion 4D PAFs untouched. As for rendering, a surface BTF synthesized using geometry maps is well-suited for leveraging the programmable vertex and pixel shaders on the graphics hardware. We present a real-time BTF rendering algorithm that runs at the speed of about 30 frames/second on a mid-level PC with an ATI Radeon 8500 graphics card. We demonstrate the effectiveness of our synthesis and rendering algorithms using both real and synthetic BTF samples.
17203041
Tight upper bounds for cell loss probabilities in ATM multiplexers and required bandwidth estimation
Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traffic control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-off sources with exponentially distributed on and off periods. Based on this approximation, a simple and accurate method is proposed to estimate the aggregate required bandwidth by a given mix of traffic to guarantee a given cell loss probability.