Analysis of steady-states of continuous-time impulse K-winners-take-all neural network

Simple item page
dc.citation.conferenceXXVI Міжнародна українсько-польська науково-технічна конференція “САПР у проектуванні машин. Задачі впровадження та навчання”
dc.citation.epage26
dc.citation.journalTitleСАПР у проектуванні машин. Задачі впровадження та навчання : матеріали XXVI Міжнародної українсько-польської науково-технічної конференції
dc.citation.spage20
dc.contributor.affiliationLviv Polytechnic National University
dc.contributor.authorTymoshchuk, Pavlo
dc.coverage.placenameЛьвів
dc.coverage.temporal19-20 жовтня 2018 року, Львів
dc.date.accessioned2019-06-24T14:07:06Z
dc.date.available2019-06-24T14:07:06Z
dc.date.created2018-10-19
dc.date.issued2018-10-19
dc.format.extent20-26
dc.format.pages7
dc.identifier.citationTymoshchuk P. Analysis of steady-states of continuous-time impulse K-winners-take-all neural network / Pavlo Tymoshchuk // САПР у проектуванні машин. Задачі впровадження та навчання : матеріали XXVI Міжнародної українсько-польської науково-технічної конференції, 19-20 жовтня 2018 року, Львів. — Львів : Видавництво Львівської політехніки, 2018. — С. 20–26.
dc.identifier.citationenTymoshchuk P. Analysis of steady-states of continuous-time impulse K-winners-take-all neural network / Pavlo Tymoshchuk // SAPR u proektuvanni mashyn. Zadachi vprovadzhennia ta navchannia : materialy XXVI Mizhnarodnoi ukrainsko-polskoi naukovo-tekhnichnoi konferentsii, 19-20 zhovtnia 2018 roku, Lviv. — Lviv : Vydavnytstvo Lvivskoi politekhniky, 2018. — P. 20–26.
dc.identifier.isbn978-966-941-229-4
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/45233
dc.language.isoen
dc.publisherВидавництво Львівської політехніки
dc.relation.ispartofСАПР у проектуванні машин. Задачі впровадження та навчання : матеріали XXVI Міжнародної українсько-польської науково-технічної конференції, 2018
dc.relation.references[1] E. Majani, R. Erlanson, and Y. Abu-Mostafa, “On the k-winners-take-all network,” in Advances in Neural Information Processing Systems 1, R. P. Lippmann, J. E. Moody, and D. S. Touretzky, Eds. San Mateo, CA: Morgan Kaufmann, 1989, pp. 634-642.
dc.relation.references[2] J. Wang, “Analysis and design of a k-winners-take-all network with a single state variable and the Heaviside step activation function,” IEEE Trans. Neural Networks, vol. 21, no. 9, pp. 1496-1506, Sept. 2010.
dc.relation.references[3] P. Tymoshchuk, “Stability of impulse K-Winners-Take-All neural network,” Computer Systems of Design. Theory and Practice, No 882,pp. 90-98, 2017.
dc.relation.references[4] R. P. Lippmann, “An introduction to computing with neural nets,” IEEE Acoustics, Speech and Signal Processing Magazine, vol. 3, no. 4, pp. 4-22, Apr. 1987.
dc.relation.references[5] P.Tymoshchuk and E.Kaszkurewicz, ”A winner-take all circuit using neural networks as building blocks,” Neurocomputing, vol. 64, pp.375-396, Mar. 2005.
dc.relation.references[6] X. Cai, D. Prokhorov, and D. Wunsch, “Training winner-take-all simultaneous recurrent neural networks,” IEEE Trans. Neural Networks,vol. 18, no. 3, pp. 674-684, May 2007.
dc.relation.references[7] J. Lazzaro, S. Ryckebusch, M. A. Mahowald, and C. A. Mead, “Winnertake- all networks of O(N) complexity,” in Advances in Neural Information Processing Systems 1, R. P. Lippmann, J. E. Moody, and D.S. Touretzky, Eds. San Mateo, CA: Morgan Kaufmann, 1989, pp. 703-711.
dc.relation.references[8] B. Sekerkiran and U. Cilingiroglu, “A CMOS K-winners-take-all circuits with 0(N) complexity,” IEEE Trans. Circuits Systems II, vol. 46, no. 1, pp. 1-5, Jan. 1999.
dc.relation.references[9] A. Cichocki and R. Unbehauen, Neural Networks for Optimization andSignal Processing. New York, NY, USA: Wiley, 1993.
dc.relation.references[10] R. C. O’Reilly and Y. Munakata, Computational Explorations in Cognitive Neuroscience: Understanding the Mind by Simulating the Brain. Cambridge, MA: MIT Press, 2000.
dc.relation.references[11] W. Maass, “Neural computation with winner-take-all as the only nonlinear operation,” in Advances in Information Processing Systems, vol. 12, S. A. Solla, T. K. Leen, and K.-R. Mueller, Eds. Cambridge, MA: MIT Press, 2000, pp. 293–299.
dc.relation.referencesen[1] E. Majani, R. Erlanson, and Y. Abu-Mostafa, "On the k-winners-take-all network," in Advances in Neural Information Processing Systems 1, R. P. Lippmann, J. E. Moody, and D. S. Touretzky, Eds. San Mateo, CA: Morgan Kaufmann, 1989, pp. 634-642.
dc.relation.referencesen[2] J. Wang, "Analysis and design of a k-winners-take-all network with a single state variable and the Heaviside step activation function," IEEE Trans. Neural Networks, vol. 21, no. 9, pp. 1496-1506, Sept. 2010.
dc.relation.referencesen[3] P. Tymoshchuk, "Stability of impulse K-Winners-Take-All neural network," Computer Systems of Design. Theory and Practice, No 882,pp. 90-98, 2017.
dc.relation.referencesen[4] R. P. Lippmann, "An introduction to computing with neural nets," IEEE Acoustics, Speech and Signal Processing Magazine, vol. 3, no. 4, pp. 4-22, Apr. 1987.
dc.relation.referencesen[5] P.Tymoshchuk and E.Kaszkurewicz, "A winner-take all circuit using neural networks as building blocks," Neurocomputing, vol. 64, pp.375-396, Mar. 2005.
dc.relation.referencesen[6] X. Cai, D. Prokhorov, and D. Wunsch, "Training winner-take-all simultaneous recurrent neural networks," IEEE Trans. Neural Networks,vol. 18, no. 3, pp. 674-684, May 2007.
dc.relation.referencesen[7] J. Lazzaro, S. Ryckebusch, M. A. Mahowald, and C. A. Mead, "Winnertake- all networks of O(N) complexity," in Advances in Neural Information Processing Systems 1, R. P. Lippmann, J. E. Moody, and D.S. Touretzky, Eds. San Mateo, CA: Morgan Kaufmann, 1989, pp. 703-711.
dc.relation.referencesen[8] B. Sekerkiran and U. Cilingiroglu, "A CMOS K-winners-take-all circuits with 0(N) complexity," IEEE Trans. Circuits Systems II, vol. 46, no. 1, pp. 1-5, Jan. 1999.
dc.relation.referencesen[9] A. Cichocki and R. Unbehauen, Neural Networks for Optimization andSignal Processing. New York, NY, USA: Wiley, 1993.
dc.relation.referencesen[10] R. C. O’Reilly and Y. Munakata, Computational Explorations in Cognitive Neuroscience: Understanding the Mind by Simulating the Brain. Cambridge, MA: MIT Press, 2000.
dc.relation.referencesen[11] W. Maass, "Neural computation with winner-take-all as the only nonlinear operation," in Advances in Information Processing Systems, vol. 12, S. A. Solla, T. K. Leen, and K.-R. Mueller, Eds. Cambridge, MA: MIT Press, 2000, pp. 293–299.
dc.rights.holder© Національний університет «Львівська політехніка», 2018
dc.titleAnalysis of steady-states of continuous-time impulse K-winners-take-all neural network
dc.typeConference Abstract

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
2018_Tymoshchuk_P-Analysis_of_steady_states_20-26.pdf
Size:
1.55 MB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
2018_Tymoshchuk_P-Analysis_of_steady_states_20-26__COVER.png
Size:
998.61 KB
Format:
Portable Network Graphics
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.94 KB
Format:
Plain Text
Description:
Download

Collections

САПР у проектуванні машин. Задачі впровадження та навчання. – 2018 р.