The Experts below are selected from a list of 64869 Experts worldwide ranked by ideXlab platform
Jinde Cao - One of the best experts on this subject based on the ideXlab platform.
-
stochastic sampled data Control for synchronization of complex dynamical networks with Control Packet loss and additive time varying delays
Neural Networks, 2015Co-Authors: R Rakkiyappan, N Sakthivel, Jinde CaoAbstract:This study examines the exponential synchronization of complex dynamical networks with Control Packet loss and additive time-varying delays. Additionally, sampled-data Controller with time-varying sampling period is considered and is assumed to switch between m different values in a random way with given probability. Then, a novel Lyapunov-Krasovskii functional (LKF) with triple integral terms is constructed and by using Jensen's inequality and reciprocally convex approach, sufficient conditions under which the dynamical network is exponentially mean-square stable are derived. When applying Jensen's inequality to partition double integral terms in the derivation of linear matrix inequality (LMI) conditions, a new kind of linear combination of positive functions weighted by the inverses of squared convex parameters appears. In order to handle such a combination, an effective method is introduced by extending the lower bound lemma. To design the sampled-data Controller, the synchronization error system is represented as a switched system. Based on the derived LMI conditions and average dwell-time method, sufficient conditions for the synchronization of switched error system are derived in terms of LMIs. Finally, numerical example is employed to show the effectiveness of the proposed methods.
-
synchronization of neural networks with Control Packet loss and time varying delay via stochastic sampled data Controller
IEEE Transactions on Neural Networks, 2015Co-Authors: R Rakkiyappan, S Dharani, Jinde CaoAbstract:This paper addresses the problem of exponential synchronization of neural networks with time-varying delays. A sampled-data Controller with stochastically varying sampling intervals is considered. The novelty of this paper lies in the fact that the Control Packet loss from the Controller to the actuator is considered, which may occur in many real-world situations. Sufficient conditions for the exponential synchronization in the mean square sense are derived in terms of linear matrix inequalities (LMIs) by constructing a proper Lyapunov–Krasovskii functional that involves more information about the delay bounds and by employing some inequality techniques. Moreover, the obtained LMIs can be easily checked for their feasibility through any of the available MATLAB tool boxes. Numerical examples are provided to validate the theoretical results.
R Rakkiyappan - One of the best experts on this subject based on the ideXlab platform.
-
stochastic sampled data Control for synchronization of complex dynamical networks with Control Packet loss and additive time varying delays
Neural Networks, 2015Co-Authors: R Rakkiyappan, N Sakthivel, Jinde CaoAbstract:This study examines the exponential synchronization of complex dynamical networks with Control Packet loss and additive time-varying delays. Additionally, sampled-data Controller with time-varying sampling period is considered and is assumed to switch between m different values in a random way with given probability. Then, a novel Lyapunov-Krasovskii functional (LKF) with triple integral terms is constructed and by using Jensen's inequality and reciprocally convex approach, sufficient conditions under which the dynamical network is exponentially mean-square stable are derived. When applying Jensen's inequality to partition double integral terms in the derivation of linear matrix inequality (LMI) conditions, a new kind of linear combination of positive functions weighted by the inverses of squared convex parameters appears. In order to handle such a combination, an effective method is introduced by extending the lower bound lemma. To design the sampled-data Controller, the synchronization error system is represented as a switched system. Based on the derived LMI conditions and average dwell-time method, sufficient conditions for the synchronization of switched error system are derived in terms of LMIs. Finally, numerical example is employed to show the effectiveness of the proposed methods.
-
synchronization of neural networks with Control Packet loss and time varying delay via stochastic sampled data Controller
IEEE Transactions on Neural Networks, 2015Co-Authors: R Rakkiyappan, S Dharani, Jinde CaoAbstract:This paper addresses the problem of exponential synchronization of neural networks with time-varying delays. A sampled-data Controller with stochastically varying sampling intervals is considered. The novelty of this paper lies in the fact that the Control Packet loss from the Controller to the actuator is considered, which may occur in many real-world situations. Sufficient conditions for the exponential synchronization in the mean square sense are derived in terms of linear matrix inequalities (LMIs) by constructing a proper Lyapunov–Krasovskii functional that involves more information about the delay bounds and by employing some inequality techniques. Moreover, the obtained LMIs can be easily checked for their feasibility through any of the available MATLAB tool boxes. Numerical examples are provided to validate the theoretical results.
Yongtae Shi - One of the best experts on this subject based on the ideXlab platform.
-
error recovery algorithm for multimedia stream in the tree based multicast environments
Lecture Notes in Computer Science, 2003Co-Authors: Kiyoung Kim, Miyou Yoo, Yongtae ShiAbstract:This paper describes Tree-based Multicast System which leverages Preceding Error Recovery(PER) algorithm and Media Controller(MC). This mechanism solves jitter and delay problem by reducing Control Packets over tree-based reliable multicast. Our proposed PER results in suppression of Control Packets over the network and fast recovery of a buffer space from underflow status by considering constraints of dependency between the frames and the data being played within proper time. Proposed algorithm is operated at improved TMTP(Tree-based Multicast Transport Protocol) and located in each receiver. We also evaluate and simulate the performance of PER. The results are shown that PER much superior to previous works in the point of buffer efficiency and the number of occurred Control Packet.
Kiyoung Kim - One of the best experts on this subject based on the ideXlab platform.
-
preceding error recovery algorithm for multimedia stream in the tree based multicast environments
The Kips Transactions:partc, 2003Co-Authors: Kiyoung Kim, Miyoun Yoon, Youngtae ShinAbstract:IP Multicast is required of more little network resources than one in unicast. Furthermore, reliable multicast has been researched for supporting reliability at IP Multicast mechanism. Although these studies are carried out, they only have focused on general data. In other words, in case that realtime Packet, they can not support reliability since they do not consider realtime properties such as dependency of interframe and playback in time. Besides, we also request to support scalability because we are based on Mobile IP network together with internet. Thus, we need a mechanism to guarantee reliability and scalability of realtime stream data. In this paper, we propose PER (Preceding Error Recovery) that reflect characteristics of the realtime data, especially for H.323. PER provides scalable reliability because it is based on tree-based multicast basically and helps to support scalable relibility as reducing Control Packet and recovers stream buffer space from underflow status as soon as possible. PER shows much better scalable and reliable than existing works.
-
error recovery algorithm for multimedia stream in the tree based multicast environments
Lecture Notes in Computer Science, 2003Co-Authors: Kiyoung Kim, Miyou Yoo, Yongtae ShiAbstract:This paper describes Tree-based Multicast System which leverages Preceding Error Recovery(PER) algorithm and Media Controller(MC). This mechanism solves jitter and delay problem by reducing Control Packets over tree-based reliable multicast. Our proposed PER results in suppression of Control Packets over the network and fast recovery of a buffer space from underflow status by considering constraints of dependency between the frames and the data being played within proper time. Proposed algorithm is operated at improved TMTP(Tree-based Multicast Transport Protocol) and located in each receiver. We also evaluate and simulate the performance of PER. The results are shown that PER much superior to previous works in the point of buffer efficiency and the number of occurred Control Packet.
Susan Billingsgagliardi - One of the best experts on this subject based on the ideXlab platform.
-
does reading about stroke increase stroke knowledge the impact of different print materials
Patient Education and Counseling, 2003Co-Authors: Kathleen M Mazor, Susan BillingsgagliardiAbstract:The purpose of this study was to determine whether print materials on stroke resulted in increased knowledge in a sample of lay people. One hundred and seventy-seven participants received (at random) one of five versions of a stroke information Packet, or a Control Packet on colorectal cancer. Participants rated the materials on readability, understandability and usefulness immediately after reading. After a delay of 18 days on average, participants answered questions assessing stroke knowledge. Ratings of all Packets were generally positive; however, stroke knowledge scores were significantly higher for the stroke information groups compared to the Control group only for knowledge of causal mechanisms (stroke pathophysiology). While there was some indication that the fictionalized material on stroke was more effective than the expository materials, overall the impact of print materials on stroke knowledge, measured after a delay of at least 1 week, was minimal at best. Further research is needed to determine whether fictional contexts make some information more memorable.