Novel results on robust finite-time passivity for discrete-time delayed neural networks
Neurocomputing, ISSN: 0925-2312, Vol: 177, Page: 585-593
2016
- 36Citations
- 15Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
This paper presents some novel results on robust finite-time passivity for a class of uncertain discrete-time neural networks (DNNs) with time varying delays. Using the Lyapunov theory together with the zero inequalities, convex combination and reciprocally convex combination approaches, we propose the sufficient conditions for finite-time boundedness and finite-time passivity of DNN for all admissible uncertainties. The results are achieved by using a new Lyapunov-Krasovskii functional (LKF) with novel triple summation terms, several delay-dependent criteria for the DNN are derived in terms of linear matrix inequalities (LMIs) which can be easily verified via the LMI toolbox. Finally, numerical example with simulation scheme have been presented to illustrate the applicability and usefulness of the obtained results.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0925231215018688; http://dx.doi.org/10.1016/j.neucom.2015.10.125; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84959152284&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0925231215018688; https://dx.doi.org/10.1016/j.neucom.2015.10.125
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know