117969594
Delay-Dependent Robust Hinfinity Control for T-S Fuzzy Systems With Time Delay
9790968
Fuzzy approximate disturbance decoupling of MIMO nonlinear systems by backstepping and application to chemical processes
Fuzzy approximate disturbance decoupling concept is introduced for a class of multiple-input-multiple-output (MIMO) nonlinear systems with completely unknown nonlinearities. Based on backstepping technique, a fuzzy almost disturbance decoupling control scheme is proposed. The fuzzy controllers guarantee internal uniform ultimate boundedness of the closed-loop adaptive systems and render a bounded approximate L/sub 2/ gain from the disturbance input to the output. The developed design scheme is applied to control a two continuous stirred tank reactor process. The simulation results illustrate the effectiveness of the method proposed in this paper.
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.
23519212
Lower bounds of length of longest cycles in graphs involving neighborhood unions
Let G be a simple graph of order n. Let NC = min {|N(x)∪N(y)|: xy ∉ E(G)}. Denote by c(G), the circumference of G, the length of a longest cycle in G. In this paper we settle a conjecture of Faudree, Gould, Jacobson and Schelp [4], proving that (a) if G is 3-connected, then c(G) ⩾ min {n, 3(NC + 1)/2}; and (b) if G is 4-connected, then c(G) ⩾ min {n, 2NC}. Two examples are given to show that both bounds are sharp.
27917358
Continuous dependence on initial values for impulsive delay differential equations
This paper studies the property of continuous dependence of solutions with respect to initial values for impulsive delay differential equations. Criteria on continuous dependence of solutions with respect to initial functions are established. It is shown, however, that due to the discontinuities of the function space and the time delays in the system, continuous dependence with respect to the initial time, or more generally with respect to the entire initial data, is unfortunately not generally satisfied.
7114960
On the optimum design of planar 3-DOF parallel manipulators with respect to the workspace
The design of the robotic mechanisms is one of the most important activities, because these mechanisms determine the performance characteristics of the robots. The paper concerns the issue of computer-aided design (CAD) for planar 3-DOF parallel robotic mechanisms by means of the physical model of the solution space, which can be used systematically to express the relationships between the performance criteria and all link lengths of one type of the robotic mechanism. The performance atlases of the workspace volume for the manipulators are plotted in the physical model of the solution space. The characteristics of the distribution of the workspace shapes in the physical model of the solution space are presented. The results are useful for the optimum design of the robotic mechanisms. The paper proposes a new way for the robotic CAD.
204983610
Pyramidic Clustering of Large-Scale Microarray Images
With ongoing research and development of imaging techniques such as those involved in brain MRIs, cDNA microarrays and satellite reconnaissance, the need for tools that can intelligently parse larger images is ever increasing. One group of such techniques often used is that of segmentation, an example of which is that of clustering algorithms. In order to deal with large data sets, current approaches require the data to be sampled or summarized before true analysis can take place. In this paper we propose a novel image analysis technique using pyramidic type grouping, namely copasetic clustering, which focuses on the problem of applying traditional clustering techniques to these large-scale image data sets with limited resources. A further benefit of the technique is the transparency of its intermediate clustering steps; when applied to spatial data sets this allows the capture and incorporation of contextual information to improve result accuracy. The algorithm achieves an ∼1--3 dB w-to-noise ratio when compared with the conventional techniques described.