Books
Gwizdałła T M, Manzoni L, Sirakoulis G Ch, Bandini S, Podlaski K (Ed.)
1, Springer Nature, 2021, ISBN: 978-3-030-69479-1.
@book{gwizdalla2021cellular,
title = {Cellular Automata: 14th International Conference on Cellular Automata for Research and Industry, ACRI 2020, Lodz, Poland, December 2-4, 2020, Proceedings},
editor = {Tomasz M Gwizda\l\la and Luca Manzoni and Georgios Ch. Sirakoulis and Stefania Bandini and Krzysztof Podlaski},
url = {https://link.springer.com/book/10.1007/978-3-030-69480-7},
doi = {doi.org/10.1007/978-3-030-69480-7},
isbn = {978-3-030-69479-1},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
volume = {12599},
pages = {275},
publisher = {Springer Nature},
edition = {1},
abstract = {This book constitutes the refereed proceedings of the 14th International Conference on Cellular Automata for Research and Industry, ACRI 2020, which took place in Lodz, Poland, during December 2-4, 2020.
The 24 full and 3 short papers presented in this volume were carefully reviewed and selected from 40 submissions. They were organized in topical sections named: theory and cryptography, modeling and simulation, and disease spreading dynamics.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
This book constitutes the refereed proceedings of the 14th International Conference on Cellular Automata for Research and Industry, ACRI 2020, which took place in Lodz, Poland, during December 2-4, 2020.
The 24 full and 3 short papers presented in this volume were carefully reviewed and selected from 40 submissions. They were organized in topical sections named: theory and cryptography, modeling and simulation, and disease spreading dynamics.
The 24 full and 3 short papers presented in this volume were carefully reviewed and selected from 40 submissions. They were organized in topical sections named: theory and cryptography, modeling and simulation, and disease spreading dynamics.
Adamatzky A, Akl S, Sirakoulis G Ch (Ed.)
From Parallel to Emergent Computing Book
CRC Press, 2020, ISBN: 9780367656607.
@book{adamatzky2019parallel,
title = {From Parallel to Emergent Computing},
editor = {Andrew Adamatzky and Selim Akl and Georgios Ch. Sirakoulis},
url = {https://www.routledge.com/From-Parallel-to-Emergent-Computing/Adamatzky-Akl-Sirakoulis/p/book/9780367656607},
isbn = {9780367656607},
year = {2020},
date = {2020-09-30},
urldate = {2020-09-30},
pages = {628},
publisher = {CRC Press},
abstract = {Modern computing relies on future and emergent technologies which have been conceived via interaction between computer science, engineering, chemistry, physics and biology. This highly interdisciplinary book presents advances in the fields of parallel, distributed and emergent information processing and computation. The book represents major breakthroughs in parallel quantum protocols, elastic cloud servers, structural properties of interconnection networks, internet of things, morphogenetic collective systems, swarm intelligence and cellular automata, unconventionality in parallel computation, algorithmic information dynamics, localized DNA computation, graph-based cryptography, slime mold inspired nano-electronics and cytoskeleton computers.
Features
Truly interdisciplinary, spanning computer science, electronics, mathematics and biology
Covers widely popular topics of future and emergent computing technologies, cloud computing, parallel computing, DNA computation, security and network analysis, cryptography, and theoretical computer science
Provides unique chapters written by top experts in theoretical and applied computer science, information processing and engineering
From Parallel to Emergent Computing provides a visionary statement on how computing will advance in the next 25 years and what new fields of science will be involved in computing engineering. This book is a valuable resource for computer scientists working today, and in years to come.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Modern computing relies on future and emergent technologies which have been conceived via interaction between computer science, engineering, chemistry, physics and biology. This highly interdisciplinary book presents advances in the fields of parallel, distributed and emergent information processing and computation. The book represents major breakthroughs in parallel quantum protocols, elastic cloud servers, structural properties of interconnection networks, internet of things, morphogenetic collective systems, swarm intelligence and cellular automata, unconventionality in parallel computation, algorithmic information dynamics, localized DNA computation, graph-based cryptography, slime mold inspired nano-electronics and cytoskeleton computers.
Features
Truly interdisciplinary, spanning computer science, electronics, mathematics and biology
Covers widely popular topics of future and emergent computing technologies, cloud computing, parallel computing, DNA computation, security and network analysis, cryptography, and theoretical computer science
Provides unique chapters written by top experts in theoretical and applied computer science, information processing and engineering
From Parallel to Emergent Computing provides a visionary statement on how computing will advance in the next 25 years and what new fields of science will be involved in computing engineering. This book is a valuable resource for computer scientists working today, and in years to come.
Features
Truly interdisciplinary, spanning computer science, electronics, mathematics and biology
Covers widely popular topics of future and emergent computing technologies, cloud computing, parallel computing, DNA computation, security and network analysis, cryptography, and theoretical computer science
Provides unique chapters written by top experts in theoretical and applied computer science, information processing and engineering
From Parallel to Emergent Computing provides a visionary statement on how computing will advance in the next 25 years and what new fields of science will be involved in computing engineering. This book is a valuable resource for computer scientists working today, and in years to come.
Chua L, Sirakoulis G Ch, Adamatzky A (Ed.)
Handbook of Memristor Networks Book
Springer, Cham, 2019, ISBN: 978-3-319-76374-3.
@book{chua2019handbook,
title = {Handbook of Memristor Networks},
editor = {Leon Chua and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/book/10.1007/978-3-319-76375-0},
doi = {doi.org/10.1007/978-3-319-76375-0},
isbn = {978-3-319-76374-3},
year = {2019},
date = {2019-11-26},
urldate = {2019-11-26},
pages = {1368},
publisher = {Springer, Cham},
abstract = {This Handbook presents all aspects of memristor networks in an easy to read and tutorial style. Including many colour illustrations, it covers the foundations of memristor theory and applications, the technology of memristive devices, revised models of the Hodgkin-Huxley Equations and ion channels, neuromorphic architectures, and analyses of the dynamic behaviour of memristive networks. It also shows how to realise computing devices, non-von Neumann architectures and provides future building blocks for deep learning hardware.
With contributions from leaders in computer science, mathematics, electronics, physics, material science and engineering, the book offers an indispensable source of information and an inspiring reference text for future generations of computer scientists, mathematicians, physicists, material scientists and engineers working in this dynamic field.
},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
This Handbook presents all aspects of memristor networks in an easy to read and tutorial style. Including many colour illustrations, it covers the foundations of memristor theory and applications, the technology of memristive devices, revised models of the Hodgkin-Huxley Equations and ion channels, neuromorphic architectures, and analyses of the dynamic behaviour of memristive networks. It also shows how to realise computing devices, non-von Neumann architectures and provides future building blocks for deep learning hardware.
With contributions from leaders in computer science, mathematics, electronics, physics, material science and engineering, the book offers an indispensable source of information and an inspiring reference text for future generations of computer scientists, mathematicians, physicists, material scientists and engineers working in this dynamic field.
With contributions from leaders in computer science, mathematics, electronics, physics, material science and engineering, the book offers an indispensable source of information and an inspiring reference text for future generations of computer scientists, mathematicians, physicists, material scientists and engineers working in this dynamic field.
Zhang Y, Sirakoulis G Ch (Ed.)
IEEE Computer Society, Los Alamitos, CA, USA, 2019, ISBN: 978-1-7281-5520-3.
@book{nokey,
title = {NANOARCH '19: Proceedings of the 2019 IEEE/ACM International Symposium on Nanoscale Architectures, Qingdao, China, July 17-19 2019},
editor = {Yue Zhang and Georgios Ch. Sirakoulis},
url = {https://www.computer.org/csdl/proceedings/nanoarch/2019/1jrW7Pg1Hck},
doi = {10.1109/NANOARCH47378.2019.9073638},
isbn = {978-1-7281-5520-3},
year = {2019},
date = {2019-07-19},
urldate = {2019-07-19},
pages = {155},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Sirakoulis G Ch, Cotofana S (Ed.)
Association for Computing Machinery, New York, NY, United States, 2018, ISBN: 978-1-4503-5815-6.
@book{nanoarch18,
title = {NANOARCH '18: Proceedings of the 14th IEEE/ACM International Symposium on Nanoscale Architectures, Athens, Greece, 17-19 July 2018},
editor = {Georgios Ch. Sirakoulis and Sorin Cotofana},
url = {https://dl.acm.org/doi/proceedings/10.1145/3232195},
isbn = {978-1-4503-5815-6},
year = {2018},
date = {2018-07-19},
urldate = {2018-07-19},
pages = {168},
publisher = {Association for Computing Machinery},
address = {New York, NY, United States},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Zoiros K, Sirakoulis G Ch (Ed.)
IEEE, 2017, ISBN: 978-1-5386-2287-2.
@book{pacet2017,
title = {PACET' 17: Proceeding of Panhellenic Conference on Electronics and Telecommunications, Xanthi, Greece, 17-18 November 2017},
editor = {Kyriakos Zoiros and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/xpl/conhome/8245950/proceeding},
doi = {10.1109/PACET42760.2017},
isbn = {978-1-5386-2287-2},
year = {2017},
date = {2017-11-17},
urldate = {2017-11-17},
pages = {185},
publisher = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Vourkas I, Sirakoulis G Ch
Memristor-Based Nanoelectronic Computing Circuits and Architectures Book
Springer, 2015, ISBN: 978-3-319-37359-1.
@book{vourkas2016memristor,
title = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/book/10.1007/978-3-319-22647-7},
doi = {doi.org/10.1007/978-3-319-22647-7},
isbn = {978-3-319-37359-1},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
volume = {19},
pages = {241},
publisher = {Springer},
series = { Emergence, Complexity and Computation},
abstract = {This book considers the design and development of nanoelectronic computing circuits, systems and architectures focusing particularly on memristors, which represent one of today’s latest technology breakthroughs in nanoelectronics. The book studies, explores, and addresses the related challenges and proposes solutions for the smooth transition from conventional circuit technologies to emerging computing memristive nanotechnologies. Its content spans from fundamental device modeling to emerging storage system architectures and novel circuit design methodologies, targeting advanced non-conventional analog/digital massively parallel computational structures. Several new results on memristor modeling, memristive interconnections, logic circuit design, memory circuit architectures, computer arithmetic systems, simulation software tools, and applications of memristors in computing are presented. High-density memristive data storage combined with memristive circuit-design paradigms and computational tools applied to solve NP-hard artificial intelligence problems, as well as memristive arithmetic-logic units, certainly pave the way for a very promising memristive era in future electronic systems. Furthermore, these graph-based NP-hard problems are solved on memristive networks, and coupled with Cellular Automata (CA)-inspired computational schemes that enable computation within memory. All chapters are written in an accessible manner and are lavishly illustrated. The book constitutes an informative cornerstone for young scientists and a comprehensive reference to the experienced reader, hoping to stimulate further research on memristive devices, circuits, and systems.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
This book considers the design and development of nanoelectronic computing circuits, systems and architectures focusing particularly on memristors, which represent one of today’s latest technology breakthroughs in nanoelectronics. The book studies, explores, and addresses the related challenges and proposes solutions for the smooth transition from conventional circuit technologies to emerging computing memristive nanotechnologies. Its content spans from fundamental device modeling to emerging storage system architectures and novel circuit design methodologies, targeting advanced non-conventional analog/digital massively parallel computational structures. Several new results on memristor modeling, memristive interconnections, logic circuit design, memory circuit architectures, computer arithmetic systems, simulation software tools, and applications of memristors in computing are presented. High-density memristive data storage combined with memristive circuit-design paradigms and computational tools applied to solve NP-hard artificial intelligence problems, as well as memristive arithmetic-logic units, certainly pave the way for a very promising memristive era in future electronic systems. Furthermore, these graph-based NP-hard problems are solved on memristive networks, and coupled with Cellular Automata (CA)-inspired computational schemes that enable computation within memory. All chapters are written in an accessible manner and are lavishly illustrated. The book constitutes an informative cornerstone for young scientists and a comprehensive reference to the experienced reader, hoping to stimulate further research on memristive devices, circuits, and systems.
Sirakoulis G Ch, Adamatzky A (Ed.)
Robots and Lattice Automata Book
1, Springer International Publishing Cham, 2014, ISBN: 978-3-319-10923-7.
@book{sirakoulis2015robots,
title = {Robots and Lattice Automata},
editor = {Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/book/10.1007/978-3-319-10924-4},
doi = {doi.org/10.1007/978-3-319-10924-4},
isbn = {978-3-319-10923-7},
year = {2014},
date = {2014-10-21},
urldate = {2015-01-01},
volume = {13},
pages = {313},
publisher = {Springer International Publishing Cham},
edition = {1},
series = { Emergence, Complexity and Computation},
abstract = {The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word “αυτόματον”) as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours.
In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are written in an accessible manner and lavishly illustrated. The book will help computer and robotic scientists and engineers to understand mechanisms of decentralised functioning of robotic collectives and to design future and emergent reconfigurable, parallel and distributed robotic systems.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word “αυτόματον”) as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours.
In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are written in an accessible manner and lavishly illustrated. The book will help computer and robotic scientists and engineers to understand mechanisms of decentralised functioning of robotic collectives and to design future and emergent reconfigurable, parallel and distributed robotic systems.
In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are written in an accessible manner and lavishly illustrated. The book will help computer and robotic scientists and engineers to understand mechanisms of decentralised functioning of robotic collectives and to design future and emergent reconfigurable, parallel and distributed robotic systems.
Was J, Sirakoulis G Ch, Bandini S
Springer, Cham, 2014, ISBN: 978-3-319-11519-1.
@book{was2014cellular,
title = {Cellular Automata: 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014, Krakow, Poland, September 22-25, 2014, Proceedings},
author = {Jaroslaw Was and Georgios Ch. Sirakoulis and Stefania Bandini},
url = {https://link.springer.com/book/10.1007/978-3-319-11520-7#about},
doi = {doi.org/10.1007/978-3-319-11520-7},
isbn = {978-3-319-11519-1},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
volume = {8751},
pages = {713},
publisher = {Springer, Cham},
abstract = {This book constitutes the proceedings of the 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014, held in Krakow, Poland, in September 2014. The 67 full papers and 7 short papers presented in this volume were carefully reviewed and selected from 125 submissions. They are organized in topical sections named: theoretical results on cellular automata; cellular automata dynamics and synchronization; modeling and simulation with cellular automata; cellular automata-based hardware and computing; cryptography, networks and pattern recognition with cellular automata. The volume also contains contributions from ACRI 2014 workshops on crowds and cellular automata; asynchronous cellular automata; traffic and cellular automata; and agent-based simulation and cellular automata.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
This book constitutes the proceedings of the 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014, held in Krakow, Poland, in September 2014. The 67 full papers and 7 short papers presented in this volume were carefully reviewed and selected from 125 submissions. They are organized in topical sections named: theoretical results on cellular automata; cellular automata dynamics and synchronization; modeling and simulation with cellular automata; cellular automata-based hardware and computing; cryptography, networks and pattern recognition with cellular automata. The volume also contains contributions from ACRI 2014 workshops on crowds and cellular automata; asynchronous cellular automata; traffic and cellular automata; and agent-based simulation and cellular automata.
Sirakoulis G C, Bandini S
1, Springer, 2012, ISBN: 978-3-642-33349-1.
@book{sirakoulis2012cellularb,
title = {Cellular Automata: 10th International Conference on Cellular Automata for Research and Industry, ACRI 2012, Santorini Island, Greece, September 24-27, 2012. Proceedings},
author = {Georgios Ch Sirakoulis and Stefania Bandini},
url = {https://link.springer.com/book/10.1007/978-3-642-33350-7},
doi = {doi.org/10.1007/978-3-642-33350-7},
isbn = {978-3-642-33349-1},
year = {2012},
date = {2012-01-01},
urldate = {2012-01-01},
volume = {7495},
pages = {859},
publisher = {Springer},
edition = {1},
abstract = {This book constitutes the refereed proceedings of the 10th International Conference on Cellular Automata for Research and Industry, ACRI 2012, held in Santorini Island, Greece, in September 2012. The 88 revised papers were carefully selected from numerous submissions. In order to give a perspective in which both theoretical and applicational aspects of cellular automata contribute to the growth of the area, this book mirrors the structure of the conference, grouping the 88 papers into two main parts. The first part collects papers presented as part of the main conference and organized according to six main topics: theoretical results on cellular automata; cellular automata dynamics, control and synchronization; cellular automata and networks; modeling and simulation with cellular automata; cellular automata-based hardware and architectures; codes, pseudorandom number generators and cryptography with cellular automata. The second part of the volume is dedicated to contributions presented during the ACRI 2012 workshops on theoretical advances, specifically asynchronous cellular automata, and challenging application contexts for cellular automata: crowds and CA, traffic and CA, and the satellite Workshop on cellular automata of cancer growth and invasion.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
This book constitutes the refereed proceedings of the 10th International Conference on Cellular Automata for Research and Industry, ACRI 2012, held in Santorini Island, Greece, in September 2012. The 88 revised papers were carefully selected from numerous submissions. In order to give a perspective in which both theoretical and applicational aspects of cellular automata contribute to the growth of the area, this book mirrors the structure of the conference, grouping the 88 papers into two main parts. The first part collects papers presented as part of the main conference and organized according to six main topics: theoretical results on cellular automata; cellular automata dynamics, control and synchronization; cellular automata and networks; modeling and simulation with cellular automata; cellular automata-based hardware and architectures; codes, pseudorandom number generators and cryptography with cellular automata. The second part of the volume is dedicated to contributions presented during the ACRI 2012 workshops on theoretical advances, specifically asynchronous cellular automata, and challenging application contexts for cellular automata: crowds and CA, traffic and CA, and the satellite Workshop on cellular automata of cancer growth and invasion.
Book Chapters
36.
Tsakalos K, Sirakoulis G Ch, Adamatzky A
Unsupervised Learning Approach Using Reinforcement Techniques on Bio-inspired Topologies Book Chapter
In: Handbook of Unconventional Computing: VOLUME 1: Theory, vol. 1, Chapter 17, pp. 507–533, World Scientific, 2021.
@inbook{tsakalos2021unsupervised,
title = {Unsupervised Learning Approach Using Reinforcement Techniques on Bio-inspired Topologies},
author = {Karolos-Alexandros Tsakalos and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://www.worldscientific.com/doi/10.1142/9789811235726_0017},
doi = {doi.org/10.1142/9789811235726_0017},
year = {2021},
date = {2021-10-19},
urldate = {2021-10-19},
booktitle = {Handbook of Unconventional Computing: VOLUME 1: Theory},
volume = {1},
pages = {507--533},
publisher = {World Scientific},
chapter = {17},
abstract = {Modeling complex bio-inspired networks is widely used in the research field of emerging computing, which promises rapid growth in the field of computer science. This work deals with bio-inspired molecular networks which have been studied through neuromorphic computing. This molecular-based structure is adapted to create a complex recurrent neuromorphic network that consists of neurons integrated with the simple Izhikevich neuromorphic model. Therefore molecular atoms are considered as neurons and chemical edges as synapses. More specifically, the molecular-based structure of Verotoxin-1 molecule has been extensively studied. Two Reinforcement excitation techniques inspired from Cellular Automata studies, namely, Game-of-Life (GoL)-rule and Majority-rule, are employed to control the stimulation of each neuron depending its neighbourhood activity. In this work, two different CA-inspired unsupervised learning methods along with the neuro-inspired Hebbian learning have also utilized the local activity to apply self-organization and update the recurrent synaptic weights to highlight complex neuromorphic clusters that are integrated into the existing molecular structure. Finally, by applying the proposed reinforcement excitation techniques along with the unsupervised learning, we investigate the potential of spatio-temporal signals classification through the proposed framework based on the molecular structure. The obtained results showed us this framework ability of of distinguishing high-dimensional signals; in this sense, we further discuss about how these learning approach along with molecular-based structures can be utilized to learn and help us with different complex tasks in a wide range of applications such as the classification of multi-dimensional signals.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Modeling complex bio-inspired networks is widely used in the research field of emerging computing, which promises rapid growth in the field of computer science. This work deals with bio-inspired molecular networks which have been studied through neuromorphic computing. This molecular-based structure is adapted to create a complex recurrent neuromorphic network that consists of neurons integrated with the simple Izhikevich neuromorphic model. Therefore molecular atoms are considered as neurons and chemical edges as synapses. More specifically, the molecular-based structure of Verotoxin-1 molecule has been extensively studied. Two Reinforcement excitation techniques inspired from Cellular Automata studies, namely, Game-of-Life (GoL)-rule and Majority-rule, are employed to control the stimulation of each neuron depending its neighbourhood activity. In this work, two different CA-inspired unsupervised learning methods along with the neuro-inspired Hebbian learning have also utilized the local activity to apply self-organization and update the recurrent synaptic weights to highlight complex neuromorphic clusters that are integrated into the existing molecular structure. Finally, by applying the proposed reinforcement excitation techniques along with the unsupervised learning, we investigate the potential of spatio-temporal signals classification through the proposed framework based on the molecular structure. The obtained results showed us this framework ability of of distinguishing high-dimensional signals; in this sense, we further discuss about how these learning approach along with molecular-based structures can be utilized to learn and help us with different complex tasks in a wide range of applications such as the classification of multi-dimensional signals.
35.
Adamatzky A, Szaciłowski K, Konkoli Z, Werner L C, Przyczyna D, Sirakoulis G Ch
On buildings that compute. A proposal Book Chapter
In: From Astrophysics to Unconventional Computation, pp. 311–335, Springer, Cham, 2020.
@inbook{adamatzky2020buildings,
title = {On buildings that compute. A proposal},
author = {Andrew Adamatzky and Konrad Szaci\lowski and Zoran Konkoli and Liss C Werner and Dawid Przyczyna and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-15792-0_13},
doi = {doi.org/10.1007/978-3-030-15792-0_13},
year = {2020},
date = {2020-04-17},
urldate = {2020-04-17},
booktitle = {From Astrophysics to Unconventional Computation},
pages = {311--335},
publisher = {Springer, Cham},
abstract = {We present ideas aimed at bringing revolutionary changes on architectures and buildings of tomorrow by radically advancing the technology for the building material concrete and hence building components. We propose that by using nanotechnology we could embed computation and sensing directly into the material used for construction. Intelligent concrete blocks and panels advanced with stimuli-responsive smart paints are the core of the proposed architecture. In particular, the photo-responsive paint would sense the buildings internal and external environment while the nano-material-concrete composite material would be capable of sensing the building environment and implement massive-parallel information processing resulting in distributed decision making. A calibration of the proposed materials with in-materio suitable computational methods and corresponding building information modelling, computer-aided design and digital manufacturing tools could be achievedvia models and prototypes of information processing at nano-level. The emergent technology sees a building as high-level massive-parallel computer\textemdashassembled of computing concrete blocks. Based on the generic principles of neuromorphic computation and reservoir computing we envisage a single building or an urban quarter to turn into a large-scale sensing substrate. It could behave as a universal computer, collecting and processing environmental information in situ enabling appropriate data fusion. The broad range of spatio-temporal effects include infrastructural and human mobility, energy, bio-diversity, digital activity, urban management, art and socializing, robustness with regard to damage and noise or real-time monitoring of environmental changes. The proposed intelligent architectures will increase sustainability and viability in digitised urban environments by decreasing information transfer bandwidth by e.g, utilising 5G networks. The emergence of socio-cultural effect will create a cybernetic relationship with our dwellings and cities.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
We present ideas aimed at bringing revolutionary changes on architectures and buildings of tomorrow by radically advancing the technology for the building material concrete and hence building components. We propose that by using nanotechnology we could embed computation and sensing directly into the material used for construction. Intelligent concrete blocks and panels advanced with stimuli-responsive smart paints are the core of the proposed architecture. In particular, the photo-responsive paint would sense the buildings internal and external environment while the nano-material-concrete composite material would be capable of sensing the building environment and implement massive-parallel information processing resulting in distributed decision making. A calibration of the proposed materials with in-materio suitable computational methods and corresponding building information modelling, computer-aided design and digital manufacturing tools could be achievedvia models and prototypes of information processing at nano-level. The emergent technology sees a building as high-level massive-parallel computer—assembled of computing concrete blocks. Based on the generic principles of neuromorphic computation and reservoir computing we envisage a single building or an urban quarter to turn into a large-scale sensing substrate. It could behave as a universal computer, collecting and processing environmental information in situ enabling appropriate data fusion. The broad range of spatio-temporal effects include infrastructural and human mobility, energy, bio-diversity, digital activity, urban management, art and socializing, robustness with regard to damage and noise or real-time monitoring of environmental changes. The proposed intelligent architectures will increase sustainability and viability in digitised urban environments by decreasing information transfer bandwidth by e.g, utilising 5G networks. The emergence of socio-cultural effect will create a cybernetic relationship with our dwellings and cities.
34.
Vourkas I, Sirakoulis G Ch
Modeling Memristor--Based Circuit Networks on Crossbar Architectures Book Chapter
In: Handbook of Memristor Networks, pp. 973–1004, Springer, Cham, 2019.
@inbook{vourkas2019modeling,
title = {Modeling Memristor--Based Circuit Networks on Crossbar Architectures},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007/978-3-319-76375-0_34#aboutcontent},
doi = {doi.org/10.1007/978-3-319-76375-0_34},
year = {2019},
date = {2019-11-08},
urldate = {2019-11-08},
booktitle = {Handbook of Memristor Networks},
pages = {973--1004},
publisher = {Springer, Cham},
abstract = {Almost 50 years have been completed ever since Leon Chua proposed the existence of a new class of passive circuit elements, which he called memristors and memristive devices. Nowadays, the unique electrical characteristics associated with them, concerning nanoscale dimensions, nonvolatility, and CMOS BEOL integration compatibility, along with the advantages of crossbar structures, have the potential to revolutionize computing architectures. Being associated with the totally nonlinear behavior of individual memristive elements, circuits of multiple memristors may work in very complicated way, quite difficult to predict, due to the polarity\textendashdependent nonlinear variation in the memory resistance (memristance) of individual memristors. A well defined and effective memristor model for circuit design combined with a design paradigm which exploits the composite memristance of the resistive switching elements, based on well understood underlying logic design principles, would certainly accelerate research on new computing schemes using nanoscale circuits and systems. Towards this goal, we explore the dynamics of regular network geometries containing only memristive devices and present a memristor crossbar circuit design paradigm in which memristors are modeled using the quantum mechanical phenomenon of tunneling. We use this circuit model to test various logic circuit designs capable of universal computation. Finally, we develop and present a novel CMOS-like design paradigm for memristor\textendashbased crossbar circuits.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Almost 50 years have been completed ever since Leon Chua proposed the existence of a new class of passive circuit elements, which he called memristors and memristive devices. Nowadays, the unique electrical characteristics associated with them, concerning nanoscale dimensions, nonvolatility, and CMOS BEOL integration compatibility, along with the advantages of crossbar structures, have the potential to revolutionize computing architectures. Being associated with the totally nonlinear behavior of individual memristive elements, circuits of multiple memristors may work in very complicated way, quite difficult to predict, due to the polarity–dependent nonlinear variation in the memory resistance (memristance) of individual memristors. A well defined and effective memristor model for circuit design combined with a design paradigm which exploits the composite memristance of the resistive switching elements, based on well understood underlying logic design principles, would certainly accelerate research on new computing schemes using nanoscale circuits and systems. Towards this goal, we explore the dynamics of regular network geometries containing only memristive devices and present a memristor crossbar circuit design paradigm in which memristors are modeled using the quantum mechanical phenomenon of tunneling. We use this circuit model to test various logic circuit designs capable of universal computation. Finally, we develop and present a novel CMOS-like design paradigm for memristor–based crossbar circuits.
33.
Ntinas V, Vourkas I, Sirakoulis G Ch, Adamatzky A
Mimicking Physarum Space Exploration with Networks of Memristive Oscillators Book Chapter
In: Handbook of Memristor Networks, pp. 1241–1274, Springer, 2019.
@inbook{ntinas2019mimicking,
title = {Mimicking Physarum Space Exploration with Networks of Memristive Oscillators},
author = {Vasileios Ntinas and Ioannis Vourkas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://www.springerprofessional.de/en/mimicking-physarum-space-exploration-with-networks-of-memristive/17379822},
doi = {doi.org/10.1007/978-3-319-76375-0_45},
year = {2019},
date = {2019-11-08},
urldate = {2019-11-08},
booktitle = {Handbook of Memristor Networks},
pages = {1241--1274},
publisher = {Springer},
abstract = {Physarum polycephalum’s foraging has been for a long time a real source of inspiration for scientists and researchers as it exhibits intrinsic optimization characteristics. When some sources of nutrients are present, Physarum connects these sources with its protoplasmic vascular network, along shortest path connections. This chapter presents the modeling of Physarum’s learning and adaptivity to periodic environmental changes by a memristor-based passive LC filter, and further demonstrates its computational capabilities through two different electronic approaches. Firstly, a circuit-level model of Physarum’s oscillatory internal motion mechanism is designed to emulate the local signal propagation and the expansion of its vascular network during biological shortest path finding experiments. Furthermore, an extension of this model in a system-level approach is presented, which introduces also the shrinking mechanism that Physarum performs to reduce its power consumption after it has reached every nutrient source within its environment. The proper functioning of both the aforementioned approaches was verified via circuit simulations in SPICE as well as MATLAB. Finally, the effect of environmental noise was integrated to the presented approaches, permitting their evaluation under more realistic circumstances closer to the biological experiments, with very interesting results.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Physarum polycephalum’s foraging has been for a long time a real source of inspiration for scientists and researchers as it exhibits intrinsic optimization characteristics. When some sources of nutrients are present, Physarum connects these sources with its protoplasmic vascular network, along shortest path connections. This chapter presents the modeling of Physarum’s learning and adaptivity to periodic environmental changes by a memristor-based passive LC filter, and further demonstrates its computational capabilities through two different electronic approaches. Firstly, a circuit-level model of Physarum’s oscillatory internal motion mechanism is designed to emulate the local signal propagation and the expansion of its vascular network during biological shortest path finding experiments. Furthermore, an extension of this model in a system-level approach is presented, which introduces also the shrinking mechanism that Physarum performs to reduce its power consumption after it has reached every nutrient source within its environment. The proper functioning of both the aforementioned approaches was verified via circuit simulations in SPICE as well as MATLAB. Finally, the effect of environmental noise was integrated to the presented approaches, permitting their evaluation under more realistic circumstances closer to the biological experiments, with very interesting results.
32.
Bontzorlos T, Sirakoulis G Ch, Seredynski F
Swarm Intelligence for Area Surveillance Using Autonomous Robots Book Chapter
In: From Parallel to Emergent Computing, Chapter 15, pp. 315–344, CRC Press, 2019.
@inbook{bontzorlos2019swarm,
title = {Swarm Intelligence for Area Surveillance Using Autonomous Robots},
author = {Tilemachos Bontzorlos and Georgios Ch. Sirakoulis and Franscizek Seredynski},
url = {https://www.taylorfrancis.com/chapters/edit/10.1201/9781315167084-15/swarm-intelligence-area-surveillance-using-autonomous-robots-tilemachos-bontzorlos-georgios-ch-sirakoulis-franciszek-seredynski},
doi = {doi.org/10.1201/9781315167084},
year = {2019},
date = {2019-02-18},
urldate = {2019-02-18},
booktitle = {From Parallel to Emergent Computing},
pages = {315--344},
publisher = {CRC Press},
chapter = {15},
abstract = {Territorial surveillance plays a constantly increasing role in security. However, completely automatic surveillance systems using autonomous robots are hard to implement and maintain and in many cases they fail to adapt to dynamic environment changes or scale efficiently. This chapter presents a swarm intelligence system that allows indirect communication between the robots, which are considered minimally equipped. It introduces the proposed swarm intelligence system and its underlying bio-inspired algorithm. The chapter also presents results of experiments on the aforementioned system as well as comparison results with some other well-known relevant algorithms. The swarm intelligence system proposed uses a bio-inspired algorithm based on the computational system of the Ant Colony System. Basically, as a first step in the attempt to solve the problem of the area surveillance, the indirect communication of the autonomous robots is proposed, namely without the use of a central control system or direct communication between the robots.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Territorial surveillance plays a constantly increasing role in security. However, completely automatic surveillance systems using autonomous robots are hard to implement and maintain and in many cases they fail to adapt to dynamic environment changes or scale efficiently. This chapter presents a swarm intelligence system that allows indirect communication between the robots, which are considered minimally equipped. It introduces the proposed swarm intelligence system and its underlying bio-inspired algorithm. The chapter also presents results of experiments on the aforementioned system as well as comparison results with some other well-known relevant algorithms. The swarm intelligence system proposed uses a bio-inspired algorithm based on the computational system of the Ant Colony System. Basically, as a first step in the attempt to solve the problem of the area surveillance, the indirect communication of the autonomous robots is proposed, namely without the use of a central control system or direct communication between the robots.
31.
Adamatzky A, Tuszynski J, Pieper J, Nicolau D V, Rinaldi R, Sirakoulis G Ch, Erokhin V, Schnauß J, Smith D M
Towards cytoskeleton computers. A proposal Book Chapter
In: From Parallel to Emergent Computing, Chapter 26, pp. 575–596, CRC Press, 2019.
@inbook{adamatzky2019towards,
title = {Towards cytoskeleton computers. A proposal},
author = {Andrew Adamatzky and Jack Tuszynski and Jӧrg Pieper and Dan V Nicolau and Rosaria Rinaldi and Georgios Ch. Sirakoulis and Victor Erokhin and Jӧrg Schnau\ss and David M Smith},
url = {https://www.taylorfrancis.com/chapters/edit/10.1201/9781315167084-26/towards-cytoskeleton-computers-proposal-andrew-adamatzky-jack-tuszynski-j%D3%A7rg-pieper-dan-nicolau-rosaria-rinaldi-georgios-ch-sirakoulis-victor-erokhin-j%D3%A7rg-schnau%C3%9F-david-smith},
doi = {doi.org/10.1201/9781315167084},
year = {2019},
date = {2019-02-18},
urldate = {2019-02-18},
booktitle = {From Parallel to Emergent Computing},
pages = {575--596},
publisher = {CRC Press},
chapter = {26},
abstract = {Actin and tubulin are key structural elements of Eukaryotes’ cytoskeleton. The networks of actin filaments and tubulin microtubules are substrates for cells’ motility and mechanics, intra-cellular transport and cell-level learning. Ideas of information processing taking place on a cytoskeleton network, especially in neurons, have been proposed by Stuart. Hameroff and Steen. Rasmussen in the late 1980s in their designs of tubulin microtubules automata and a general framework of cytoskeleton automata as sub-cellular information processing networks. The cytoskeleton protein networks propagate signals in the form of ionic solitons, travelling conformation transformations and breathers generated through electrical and mechanical vibrations. A collision-based, or dynamical, computation employs mobile compact finite patterns, mobile self-localised excitations or simply localisations, in an active non-linear medium. These localisations travel in space and perform computation when they collide with each other. Memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device’s terminals and the duration of the voltage’s application.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Actin and tubulin are key structural elements of Eukaryotes’ cytoskeleton. The networks of actin filaments and tubulin microtubules are substrates for cells’ motility and mechanics, intra-cellular transport and cell-level learning. Ideas of information processing taking place on a cytoskeleton network, especially in neurons, have been proposed by Stuart. Hameroff and Steen. Rasmussen in the late 1980s in their designs of tubulin microtubules automata and a general framework of cytoskeleton automata as sub-cellular information processing networks. The cytoskeleton protein networks propagate signals in the form of ionic solitons, travelling conformation transformations and breathers generated through electrical and mechanical vibrations. A collision-based, or dynamical, computation employs mobile compact finite patterns, mobile self-localised excitations or simply localisations, in an active non-linear medium. These localisations travel in space and perform computation when they collide with each other. Memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device’s terminals and the duration of the voltage’s application.
30.
Sirakoulis G Ch
Cellular Automata Hardware Implementation Book Chapter
In: Adamatzky, Andrew (Ed.): Cellular Automata: A Volume in the Encyclopedia of Complexity and Systems Science, Second Edition (Encyclopedia of Complexity and Systems Science Series), pp. 555–582, Springer, New York, NY, 2018.
@inbook{sirakoulis2018cellular,
title = {Cellular Automata Hardware Implementation},
author = {Georgios Ch. Sirakoulis},
editor = {Andrew Adamatzky},
url = {https://link.springer.com/referenceworkentry/10.1007%2F978-1-4939-8700-9_673},
doi = {doi.org/10.1007/978-1-4939-8700-9_673},
year = {2018},
date = {2018-11-28},
urldate = {2018-01-01},
booktitle = {Cellular Automata: A Volume in the Encyclopedia of Complexity and Systems Science, Second Edition (Encyclopedia of Complexity and Systems Science Series)},
pages = {555--582},
publisher = {Springer, New York, NY},
abstract = {Cellular Automata (CAs) have been identified as one of the simplest computational models, yet with well-proven attributes that enable them to contribute successfully in modeling aspects of various complex physical systems and processes. CAs possess two precious virtues that can result to eminently practical computer architectures; these are inherent parallelism and locality. To take full advantage of these prominent features of CA, suitable computer architectures, hardware realizations, and VLSI/FPGA implementations have been intensively investigated over the last decades. However, this kind of research resulted to a twofold approach; starting with the introduction of the cellular automata machine (CAM), CAs have been proposed as a promising VLSI architecture, and as such numerous applications related to modern VLSI design were thoroughly studied. On the other hand, since CAs are also well suited to a variety of physical modeling tasks, a plethora of standalone hardware implementations have been investigated and studied so as to enhance the performance of the corresponding CA models in physics, chemistry, ecology, geology, biology, computer science, and many other research fields. In this chapter, a detailed presentation of the CA hardware is delivered in respect to the aforementioned twofold approach as found in the literature.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Cellular Automata (CAs) have been identified as one of the simplest computational models, yet with well-proven attributes that enable them to contribute successfully in modeling aspects of various complex physical systems and processes. CAs possess two precious virtues that can result to eminently practical computer architectures; these are inherent parallelism and locality. To take full advantage of these prominent features of CA, suitable computer architectures, hardware realizations, and VLSI/FPGA implementations have been intensively investigated over the last decades. However, this kind of research resulted to a twofold approach; starting with the introduction of the cellular automata machine (CAM), CAs have been proposed as a promising VLSI architecture, and as such numerous applications related to modern VLSI design were thoroughly studied. On the other hand, since CAs are also well suited to a variety of physical modeling tasks, a plethora of standalone hardware implementations have been investigated and studied so as to enhance the performance of the corresponding CA models in physics, chemistry, ecology, geology, biology, computer science, and many other research fields. In this chapter, a detailed presentation of the CA hardware is delivered in respect to the aforementioned twofold approach as found in the literature.
29.
Ioannidis K, Sirakoulis G Ch
Cellular Ants Computing Book Chapter
In: Adamatzky, Andrew (Ed.): pp. 565–576, Springer, New York, NY, United States, 2018.
@inbook{ioannidis2018cellular,
title = {Cellular Ants Computing},
author = {Konstantinos Ioannidis and Georgios Ch. Sirakoulis},
editor = {Andrew Adamatzky},
url = {https://link.springer.com/referenceworkentry/10.1007%2F978-1-4939-6883-1_690},
doi = {doi.org/10.1007/978-3-642-27737-5_690-1},
year = {2018},
date = {2018-08-26},
urldate = {2018-08-26},
journal = {Unconventional Computing: A Volume in the Encyclopedia of Complexity and Systems Science, Second Edition},
pages = {565--576},
publisher = {Springer},
address = {New York, NY, United States},
series = {Unconventional Computing: A Volume in the Encyclopedia of Complexity and Systems Science},
abstract = {As the community encounters novel computing environments that offer new opportunities while posing new challenges, it is reasonable to seek inspiration from natural analogues of these environments. Following this research trend, much attention was given to bio-inspired techniques, which have been proven capable of successfully handling complex algorithmic problems. As such, Ant Colony Optimization (ACO) algorithms have been introduced as a metaheuristic optimization technique originating from the swarm intelligence research field. In addition, many decades ago, Cellular Automata (CA) have been proposed as a powerful parallel computational tool aiming at modeling biological systems. Exploiting a CA as a basis and introducing the fundamental principles of ACO, an unconventional computational model results taking advantage of their common prominent features, such as simplicity, locality, and self-organization. Cellular ants have been proposed to overcome many computational and algorithmic issues providing efficient solutions in the fields of clustering and swarm robotics among others.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
As the community encounters novel computing environments that offer new opportunities while posing new challenges, it is reasonable to seek inspiration from natural analogues of these environments. Following this research trend, much attention was given to bio-inspired techniques, which have been proven capable of successfully handling complex algorithmic problems. As such, Ant Colony Optimization (ACO) algorithms have been introduced as a metaheuristic optimization technique originating from the swarm intelligence research field. In addition, many decades ago, Cellular Automata (CA) have been proposed as a powerful parallel computational tool aiming at modeling biological systems. Exploiting a CA as a basis and introducing the fundamental principles of ACO, an unconventional computational model results taking advantage of their common prominent features, such as simplicity, locality, and self-organization. Cellular ants have been proposed to overcome many computational and algorithmic issues providing efficient solutions in the fields of clustering and swarm robotics among others.
28.
Sirakoulis G Ch, Karafyllidis I
Power Consumption in Cellular Automata Book Chapter
In: Adamatzky, Andrew (Ed.): Reversibility and Universality, vol. 30, Chapter 8, pp. 183–198, Springer, 2018.
@inbook{sirakoulis2018power,
title = {Power Consumption in Cellular Automata},
author = {Georgios Ch. Sirakoulis and Ioannis Karafyllidis},
editor = {Andrew Adamatzky},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-73216-9_8},
doi = {doi.org/10.1007/978-3-319-73216-9_8},
year = {2018},
date = {2018-05-06},
urldate = {2018-01-01},
booktitle = {Reversibility and Universality},
volume = {30},
pages = {183--198},
publisher = {Springer},
chapter = {8},
series = { Emergence, Complexity and Computation},
abstract = {Cellular Automata (CAs) have been established as one of the most intriguing and efficient computational tools of our era with unique properties to fit well with the most of the upcoming nanotechnological and parallel computation aspects. Algorithms based on CAs are ideally suited for hardware implementation, due to their discreteness and their simple, regular and modular structure with local interconnections. On the other hand, power dissipation is considered as a rather limiting parameter for the advancement of high performance hardware design . In this chapter the undergoing relationship between CAs and the corresponding power consumption would be exploited as a matter of importance for their hardware design analysis with many promising aspects. First of all in order to establish a clear connection, a power estimation model for combinational logic circuits using CA and focused on glitching estimation will be presented to elucidate the application of CA model to hardware power dissipation measurements. Following that, the power consumption of CA based logic circuits and namely of 1-d CAs rules logic circuits will be analytically investigated. In particular, CMOS power consumption estimation measurements for all the Wolfram 1-d CAs rules as well as entropy variation measurements were conducted for various study cases and different initial conditions and the findings are discussed in detail and in terms of 1-d CAs rules categorization.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Cellular Automata (CAs) have been established as one of the most intriguing and efficient computational tools of our era with unique properties to fit well with the most of the upcoming nanotechnological and parallel computation aspects. Algorithms based on CAs are ideally suited for hardware implementation, due to their discreteness and their simple, regular and modular structure with local interconnections. On the other hand, power dissipation is considered as a rather limiting parameter for the advancement of high performance hardware design . In this chapter the undergoing relationship between CAs and the corresponding power consumption would be exploited as a matter of importance for their hardware design analysis with many promising aspects. First of all in order to establish a clear connection, a power estimation model for combinational logic circuits using CA and focused on glitching estimation will be presented to elucidate the application of CA model to hardware power dissipation measurements. Following that, the power consumption of CA based logic circuits and namely of 1-d CAs rules logic circuits will be analytically investigated. In particular, CMOS power consumption estimation measurements for all the Wolfram 1-d CAs rules as well as entropy variation measurements were conducted for various study cases and different initial conditions and the findings are discussed in detail and in terms of 1-d CAs rules categorization.
27.
Tsompanas M I, Dourvas N I, Ioannidis K, Sirakoulis G Ch, Hoffmann R, Adamatzky A
Cellular Automata Applications in Shortest Path Problem Book Chapter
In: vol. 32, pp. 199, Springer International Publishing, 2018.
@inbook{tsompanas2018cellular,
title = {Cellular Automata Applications in Shortest Path Problem},
author = {Michail-Antisthenis I Tsompanas and Nikolaos I Dourvas and Konstantinos Ioannidis and Georgios Ch. Sirakoulis and Rolf Hoffmann and Andrew Adamatzky},
url = {https://www.springerprofessional.de/en/cellular-automata-applications-in-shortest-path-problem/15721050},
doi = {doi.org/10.1007/978-3-319-77510-4},
year = {2018},
date = {2018-04-26},
urldate = {2018-04-26},
journal = {Shortest Path Solvers. From Software to Wetware},
volume = {32},
pages = {199},
publisher = {Springer International Publishing},
abstract = {Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra’s algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms’ behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum’s behavior, finding the minimum-length path between two points in a labyrinth is given. The CA-based model results are found in very good agreement with the computation results produced by the in-vivo experiments especially when combined with truly parallel implementations of this CA in a Field Programmable Gate Array (FPGA) and on a Graphical Processing Unit (GPU). The presented implementations succeed to take advantage of the CA’s inherit parallelism and significantly improve the performance of the CA algorithm when compared with software in terms of computational speed and power consumption.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra’s algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms’ behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum’s behavior, finding the minimum-length path between two points in a labyrinth is given. The CA-based model results are found in very good agreement with the computation results produced by the in-vivo experiments especially when combined with truly parallel implementations of this CA in a Field Programmable Gate Array (FPGA) and on a Graphical Processing Unit (GPU). The presented implementations succeed to take advantage of the CA’s inherit parallelism and significantly improve the performance of the CA algorithm when compared with software in terms of computational speed and power consumption.
26.
Adamatzky A, Harding S, Erokhin V, Mayne R, Gizzie N, Baluška F, Mancuso S, Sirakoulis G Ch
Computers from Plants We Never Made: Speculations Book Chapter
In: Inspired by Nature, pp. 357–387, Springer International Publishing, 2017.
@inbook{adamatzky2018computers,
title = {Computers from Plants We Never Made: Speculations},
author = {Andrew Adamatzky and Simon Harding and Victor Erokhin and Richard Mayne and Nina Gizzie and Frantisek Balu\v{s}ka and Stefano Mancuso and Georgios Ch. Sirakoulis},
url = {https://www.springerprofessional.de/en/computers-from-plants-we-never-made-speculations/15168140},
doi = {doi.org/10.1007/978-3-319-67997-6_17},
year = {2017},
date = {2017-11-03},
urldate = {2017-11-03},
booktitle = {Inspired by Nature},
pages = {357--387},
publisher = {Springer International Publishing},
abstract = {Plants are highly intelligent organisms. They continuously make distributed processing of sensory information, concurrent decision making and parallel actuation. The plants are efficient green computers per se. Outside in nature, the plants are programmed and hardwired to perform a narrow range of tasks aimed to maximize the plants’ ecological distribution, survival and reproduction. To ‘persuade’ plants to solve tasks outside their usual range of activities, we must either choose problem domains which homomorphic to the plants natural domains or modify biophysical properties of plants to make them organic electronic devices. We discuss possible designs and prototypes of computing systems that could be based on morphological development of roots, interaction of roots, and analog electrical computation with plants, and plant-derived electronic components. In morphological plant processors data are represented by initial configuration of roots and configurations of sources of attractants and repellents; results of computation are represented by topology of the roots’ network. Computation is implemented by the roots following gradients of attractants and repellents, as well as interacting with each other. Problems solvable by plant roots, in principle, include shortest-path, minimum spanning tree, Voronoi diagram, -shapes, convex subdivision of concave polygons. Electrical properties of plants can be modified by loading the plants with functional nanoparticles or coating parts of plants of conductive polymers. Thus, we are in position to make living variable resistors, capacitors, operational amplifiers, multipliers, potentiometers and fixed-function generators. The electrically modified plants can implement summation, integration with respect to time, inversion, multiplication, exponentiation, logarithm, division. Mathematical and engineering problems to be solved can be represented in plant root networks of resistive or reaction elements. Developments in plant-based computing architectures will trigger emergence of a unique community of biologists, electronic engineering and computer scientists working together to produce living electronic devices which future green computers will be made of.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Plants are highly intelligent organisms. They continuously make distributed processing of sensory information, concurrent decision making and parallel actuation. The plants are efficient green computers per se. Outside in nature, the plants are programmed and hardwired to perform a narrow range of tasks aimed to maximize the plants’ ecological distribution, survival and reproduction. To ‘persuade’ plants to solve tasks outside their usual range of activities, we must either choose problem domains which homomorphic to the plants natural domains or modify biophysical properties of plants to make them organic electronic devices. We discuss possible designs and prototypes of computing systems that could be based on morphological development of roots, interaction of roots, and analog electrical computation with plants, and plant-derived electronic components. In morphological plant processors data are represented by initial configuration of roots and configurations of sources of attractants and repellents; results of computation are represented by topology of the roots’ network. Computation is implemented by the roots following gradients of attractants and repellents, as well as interacting with each other. Problems solvable by plant roots, in principle, include shortest-path, minimum spanning tree, Voronoi diagram, -shapes, convex subdivision of concave polygons. Electrical properties of plants can be modified by loading the plants with functional nanoparticles or coating parts of plants of conductive polymers. Thus, we are in position to make living variable resistors, capacitors, operational amplifiers, multipliers, potentiometers and fixed-function generators. The electrically modified plants can implement summation, integration with respect to time, inversion, multiplication, exponentiation, logarithm, division. Mathematical and engineering problems to be solved can be represented in plant root networks of resistive or reaction elements. Developments in plant-based computing architectures will trigger emergence of a unique community of biologists, electronic engineering and computer scientists working together to produce living electronic devices which future green computers will be made of.
25.
Bitsakidis N P, Dourvas N I, Chatzichristofis S A, Sirakoulis G Ch
Cellular Automata Ants Book Chapter
In: Adamatzky, (Ed.): Advances in Unconventional Computing, vol. 23, Chapter 22, pp. 591–614, Springer International Publishing, 2017.
@inbook{bitsakidis2017cellular,
title = {Cellular Automata Ants},
author = {Nikolaos P Bitsakidis and Nikolaos I Dourvas and Savvas A Chatzichristofis and Georgios Ch. Sirakoulis},
editor = {Adamatzky},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-33921-4_22},
doi = {doi.org/10.1007/978-3-319-33921-4_22},
year = {2017},
date = {2017-07-27},
urldate = {2017-01-01},
booktitle = {Advances in Unconventional Computing},
volume = {23},
pages = {591--614},
publisher = {Springer International Publishing},
chapter = {22},
series = {Emergence, Complexity and Computation},
abstract = {During the last decades much attention was given to bio-inspired techniques able to successfully handle really complex algorithmic problems. As such Ant Colony Optimization (ACO) algorithms have been introduced as a metaheuristic optimization technique arriving from the swarm intelligence methods family and applied to several computational and combinatorial optimization problems. However, long before ACO, Cellular Automata (CA) have been proposed as a powerful parallel computational tool where space and time are discrete and interactions are local. It has been proven that CA are ubiquitous: they are mathematical models of computation and computer models of natural systems and their research in interdisciplinary topics leads to new theoretical constructs, novel computational solutions and elegant powerful models. As a result, in this chapter we step forward presenting a combination of CA with ant colonies aiming at the introduction of an unconventional computational model, namely “Cellular Automata Ants”. This rather theoretical approach is stressed in rather competitive field, namely clustering . It is well known that the spread of data for almost all areas of life has rapidly increased during the last decades. Nevertheless, the overall process of discovering true knowledge from data demands more powerful clustering techniques to ensure that some of those data are useful and some are not. In this chapter it is presented that Cellular Automata Ants can provide efficient, robust and low cost solutions to data clustering problems using quite small amount of computational resources.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
During the last decades much attention was given to bio-inspired techniques able to successfully handle really complex algorithmic problems. As such Ant Colony Optimization (ACO) algorithms have been introduced as a metaheuristic optimization technique arriving from the swarm intelligence methods family and applied to several computational and combinatorial optimization problems. However, long before ACO, Cellular Automata (CA) have been proposed as a powerful parallel computational tool where space and time are discrete and interactions are local. It has been proven that CA are ubiquitous: they are mathematical models of computation and computer models of natural systems and their research in interdisciplinary topics leads to new theoretical constructs, novel computational solutions and elegant powerful models. As a result, in this chapter we step forward presenting a combination of CA with ant colonies aiming at the introduction of an unconventional computational model, namely “Cellular Automata Ants”. This rather theoretical approach is stressed in rather competitive field, namely clustering . It is well known that the spread of data for almost all areas of life has rapidly increased during the last decades. Nevertheless, the overall process of discovering true knowledge from data demands more powerful clustering techniques to ensure that some of those data are useful and some are not. In this chapter it is presented that Cellular Automata Ants can provide efficient, robust and low cost solutions to data clustering problems using quite small amount of computational resources.
24.
Gale E, Matthews O, Jones J, Mayne R, Sirakoulis G Ch, Adamatzky A
Physarum Inspired Audio: From Oscillatory Sonification to Memristor Music Book Chapter
In: Miranda, Eduardo Reck (Ed.): Guide to Unconventional Computing for Music, Chapter 7, pp. 181–218, Springer International Publishing, 2017.
@inbook{gale2017physarum,
title = {Physarum Inspired Audio: From Oscillatory Sonification to Memristor Music},
author = {Ella Gale and Oliver Matthews and Jeff Jones and Richard Mayne and Georgios Ch. Sirakoulis and Andrew Adamatzky},
editor = {Eduardo Reck Miranda},
url = {https://www.springerprofessional.de/en/physarum-inspired-audio-from-oscillatory-sonification-to-memrist/12078280},
doi = {doi.org/10.1007/978-3-319-49881-2_7},
year = {2017},
date = {2017-03-01},
urldate = {2017-01-01},
booktitle = {Guide to Unconventional Computing for Music},
pages = {181--218},
publisher = {Springer International Publishing},
chapter = {7},
abstract = {Slime mould Physarum polycephalum is a single-celled amoeboid organism known to possess features of a membrane-bound reaction\textendashdiffusion medium with memristive properties. Studies of oscillatory and memristive dynamics of the organism suggest a role for behaviour interpretation via sonification and, potentially, musical composition. Using a simple particle model, we initially explore how sonification of oscillatory dynamics can allow the audio representation of the different behavioural patterns of Physarum. Physarum shows memristive properties. At a higher level, we undertook a study of the use of a memristor network for music generation, making use of the memristor’s memory to go beyond the Markov hypothesis. Seed transition matrices are created and populated using memristor equations, and which are shown to generate musical melodies and change in style over time as a result of feedback into the transition matrix. The spiking properties of simple memristor networks are demonstrated and discussed with reference to applications of music making.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Slime mould Physarum polycephalum is a single-celled amoeboid organism known to possess features of a membrane-bound reaction–diffusion medium with memristive properties. Studies of oscillatory and memristive dynamics of the organism suggest a role for behaviour interpretation via sonification and, potentially, musical composition. Using a simple particle model, we initially explore how sonification of oscillatory dynamics can allow the audio representation of the different behavioural patterns of Physarum. Physarum shows memristive properties. At a higher level, we undertook a study of the use of a memristor network for music generation, making use of the memristor’s memory to go beyond the Markov hypothesis. Seed transition matrices are created and populated using memristor equations, and which are shown to generate musical melodies and change in style over time as a result of feedback into the transition matrix. The spiking properties of simple memristor networks are demonstrated and discussed with reference to applications of music making.
23.
Ntinas V G, Moutafis B E, Trunfio G A, Sirakoulis G Ch
GPU and FPGA Parallelization of Fuzzy Cellular Automata for the Simulation of Wildfire Spreading Book Chapter
In: Wyrzykowski, Roman; Deelman, E.; Dongarra, Jack; Karczewski, K.; Kitowski, J.; Wiatr, K. (Ed.): Parallel Processing and Applied Mathematics, vol. 9574, Chapter 52, pp. 560–569, Springer International Publishing, 2016.
@inbook{ntinas2016gpu,
title = {GPU and FPGA Parallelization of Fuzzy Cellular Automata for the Simulation of Wildfire Spreading},
author = {Vasileios G Ntinas and Byron E Moutafis and Giuseppe A Trunfio and Georgios Ch. Sirakoulis},
editor = {Roman Wyrzykowski and E. Deelman and Jack Dongarra and K. Karczewski and J. Kitowski and K. Wiatr},
url = {https://link.springer.com/chapter/10.1007/978-3-319-32152-3_52},
doi = {doi.org/10.1007/978-3-319-32152-3_52},
year = {2016},
date = {2016-04-02},
urldate = {2016-01-01},
booktitle = {Parallel Processing and Applied Mathematics},
volume = {9574},
pages = {560--569},
publisher = {Springer International Publishing},
chapter = {52},
series = {Lecture Notes in Computer Science},
abstract = {This paper presents a Fuzzy Cellular Automata (FCA) model with the aim to cope with the computational complexity and data uncertainties that characterize the simulation of wildfire spreading on real landscapes. Moreover, parallel implementations of the proposed FCA model, on both GPU and FPGA, are discussed and investigated. According to the results, the parallel models exhibit significant speedups over the corresponding sequential algorithm. As a possible application, the proposed model could be embedded on a portable electronic system for real-time prediction of fire spread scenarios.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
This paper presents a Fuzzy Cellular Automata (FCA) model with the aim to cope with the computational complexity and data uncertainties that characterize the simulation of wildfire spreading on real landscapes. Moreover, parallel implementations of the proposed FCA model, on both GPU and FPGA, are discussed and investigated. According to the results, the parallel models exhibit significant speedups over the corresponding sequential algorithm. As a possible application, the proposed model could be embedded on a portable electronic system for real-time prediction of fire spread scenarios.
22.
Mayne R, Tsompanas M, Sirakoulis G Ch, Adamatzky A
Towards a Slime Mould-FPGA Interface Book Chapter
In: Advances in Physarum Machines, vol. 21, Chapter 15, pp. 299–309, Springer International Publishing, 2016.
@inbook{mayne2016towards,
title = {Towards a Slime Mould-FPGA Interface},
author = {Richard Mayne and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-26662-6_15},
doi = {10.1007/978-3-319-26662-6_15},
year = {2016},
date = {2016-01-10},
urldate = {2016-01-01},
booktitle = {Advances in Physarum Machines},
volume = {21},
pages = {299--309},
publisher = {Springer International Publishing},
chapter = {15},
series = {Emergence, Complexity and Computation},
abstract = {Through a range of laboratory experiments, we measure plasmodial membrane potential via a non-invasive method and use this signal to interface the organism with a digital system. This digital system was demonstrated to perform predefined basic arithmetic operations and is implemented in a field-programmable gate array (FPGA). These basic arithmetic operations, i.e. counting, addition, multiplying, use data that were derived by digital recognition of membrane potential oscillation and are used here to make basic hybrid biological-artificial sensing devices. We present here a low-cost, energy efficient and highly adaptable platform for developing next-generation machine-organism interfaces. These results are therefore applicable to a wide range of biological/medical and computing/electronics fields.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Through a range of laboratory experiments, we measure plasmodial membrane potential via a non-invasive method and use this signal to interface the organism with a digital system. This digital system was demonstrated to perform predefined basic arithmetic operations and is implemented in a field-programmable gate array (FPGA). These basic arithmetic operations, i.e. counting, addition, multiplying, use data that were derived by digital recognition of membrane potential oscillation and are used here to make basic hybrid biological-artificial sensing devices. We present here a low-cost, energy efficient and highly adaptable platform for developing next-generation machine-organism interfaces. These results are therefore applicable to a wide range of biological/medical and computing/electronics fields.
21.
Dourvas N I, Tsompanas M I, Sirakoulis G Ch
Parallel Acceleration of Slime Mould Discrete Models Book Chapter
In: Advances in Physarum Machines, vol. 21, Chapter 28, pp. 595–617, Springer International Publishing, 2016.
@inbook{dourvas2016parallel,
title = {Parallel Acceleration of Slime Mould Discrete Models},
author = {Nikolaos I Dourvas and Michail-Antisthenis I Tsompanas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-26662-6_28},
doi = {doi.org/10.1007/978-3-319-26662-6_28},
year = {2016},
date = {2016-01-10},
urldate = {2016-01-01},
booktitle = {Advances in Physarum Machines},
volume = {21},
pages = {595--617},
publisher = {Springer International Publishing},
chapter = {28},
series = {Emergence, Complexity and Computation},
abstract = {Biological organisms have become an inspiration for many computer scientists in order to process and analyze complex engineering problems. A well known example of this success story departs from the application of plasmodium of Physarum to solving the shortest path problem as experimentally demonstrated in the case of a labyrinth as well as to other graph related problems. There are many modeling tools trying to mimic the behavior of Physarum. We consider a discrete and parallel model, namely cellular automata (CA) based model implemented in hardware , which attempts to describe and, moreover, mimic the Physarum’s behavior in a maze . In order to take full advantage of the CA inherent parallelism, we implemented the model on a Field Programmable Gate Array (FPGA) . Two implementations were considered in order to accelerate the model’s response and improve the exactness of the experimental results. Their main difference subsists in the precision produced by the numerical representation of CA model parameters. The modeling efficiency of both approaches was compared depending on the resulting error propagation. The presented FPGA implementations accelerate considerably the performance of the CA algorithm when compared with its software based version. Finally, a Graphical Processing Unit (GPU) will exploit the prominent feature of parallelism that CA structures inherently possess in contrast to the serial computers, thus accelerating the response of the proposed model in a more easy to be programmed fashion. As a result, these implementations can also be considered as a preliminary, parallel and accelerated CA-based Physarum Polycephalum hardware virtual lab, which reproduces the characteristics of the biological organism towards its application to the shortest-path problem and thus increases significantly the computational speed.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Biological organisms have become an inspiration for many computer scientists in order to process and analyze complex engineering problems. A well known example of this success story departs from the application of plasmodium of Physarum to solving the shortest path problem as experimentally demonstrated in the case of a labyrinth as well as to other graph related problems. There are many modeling tools trying to mimic the behavior of Physarum. We consider a discrete and parallel model, namely cellular automata (CA) based model implemented in hardware , which attempts to describe and, moreover, mimic the Physarum’s behavior in a maze . In order to take full advantage of the CA inherent parallelism, we implemented the model on a Field Programmable Gate Array (FPGA) . Two implementations were considered in order to accelerate the model’s response and improve the exactness of the experimental results. Their main difference subsists in the precision produced by the numerical representation of CA model parameters. The modeling efficiency of both approaches was compared depending on the resulting error propagation. The presented FPGA implementations accelerate considerably the performance of the CA algorithm when compared with its software based version. Finally, a Graphical Processing Unit (GPU) will exploit the prominent feature of parallelism that CA structures inherently possess in contrast to the serial computers, thus accelerating the response of the proposed model in a more easy to be programmed fashion. As a result, these implementations can also be considered as a preliminary, parallel and accelerated CA-based Physarum Polycephalum hardware virtual lab, which reproduces the characteristics of the biological organism towards its application to the shortest-path problem and thus increases significantly the computational speed.
20.
Evangelidis V, Tsompanas M I, Sirakoulis G Ch, Adamatzky A
Application of Slime Mould Computing on Archaeological Research Book Chapter
In: Advances in Physarum Machines, vol. 21, Chapter 18, pp. 349–372, Springer International Publishing, 2016.
@inbook{evangelidis2016application,
title = {Application of Slime Mould Computing on Archaeological Research},
author = {Vasilis Evangelidis and Michail-Antisthenis I Tsompanas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/chapter/10.1007/978-3-319-26662-6_18},
doi = {doi.org/10.1007/978-3-319-26662-6_18},
year = {2016},
date = {2016-01-09},
urldate = {2016-01-01},
booktitle = {Advances in Physarum Machines},
volume = {21},
pages = {349--372},
publisher = {Springer International Publishing},
chapter = {18},
series = {Emergence, Complexity and Computation},
abstract = {Solving complex optimization problems by using biological computing substances, such as the plasmodium of Physarum polycephalum, is lately a commonly proposed technique. Moreover, as the successful evaluation of modern human-made motorways in several countries has been demonstrated, the same is expected when using that biological computer for transport networks built in historical time periods. To accelerate the computations a Cellular Automata model, proposed previously, that can approximate the computing abilities of the plasmodium has been used. Here the area of Balkans was considered, so as to evaluate the Roman road network built during the imperial period (1st century BC\textendash4th century AD) which was of paramount significance in terms of maintaining the East territories of the Roman Empire under control. The results produced in the laboratory experiments and those delivered by the proposed model successfully approximate segments of the actual Roman road network. Exploring the efficiency of Physarum-based computers and bio-inspired algorithms can lead to an unconventional, interdisciplinary method that will be implemented in the field of archaeological research.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Solving complex optimization problems by using biological computing substances, such as the plasmodium of Physarum polycephalum, is lately a commonly proposed technique. Moreover, as the successful evaluation of modern human-made motorways in several countries has been demonstrated, the same is expected when using that biological computer for transport networks built in historical time periods. To accelerate the computations a Cellular Automata model, proposed previously, that can approximate the computing abilities of the plasmodium has been used. Here the area of Balkans was considered, so as to evaluate the Roman road network built during the imperial period (1st century BC–4th century AD) which was of paramount significance in terms of maintaining the East territories of the Roman Empire under control. The results produced in the laboratory experiments and those delivered by the proposed model successfully approximate segments of the actual Roman road network. Exploring the efficiency of Physarum-based computers and bio-inspired algorithms can lead to an unconventional, interdisciplinary method that will be implemented in the field of archaeological research.
19.
Tsompanas M I, Sirakoulis G Ch, Adamatzky A
Cellular Automata Models Simulating Slime Mould Computing Book Chapter
In: Advances in Physarum Machines, vol. 21, Chapter 27, pp. 563–594, Springer International Publishing, 2016.
@inbook{tsompanas2016cellular,
title = {Cellular Automata Models Simulating Slime Mould Computing},
author = {Michail-Antisthenis I Tsompanas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-26662-6_27},
doi = {doi.org/10.1007/978-3-319-26662-6_27},
year = {2016},
date = {2016-01-09},
urldate = {2016-01-01},
booktitle = {Advances in Physarum Machines},
volume = {21},
pages = {563--594},
publisher = {Springer International Publishing},
chapter = {27},
series = {Emergence, Complexity and Computation},
abstract = {Slime mould computers have been used to solve graph-theoretical problems like mazes and evaluate man-made transport networks. For the laboratory experiments that demonstrate these computing capabilities, slime mould is first starved and then introduced to an area with attractants placed on key positions. The behaviour of slime mould during these laboratory experiments have been simulated by a model based on cellular automata (CAs). The advantages of a software model over the real slime mould are repeatability and faster productions of results. Using CAs can be justified by the emergence of global behaviour from local interactions, a rule that applies also on the real slime mould. The results of the model have been compared to the ones produced during laboratory experiments and found in good agreement both for maze solving and network designing. After thorough examination of the laboratory experiments an updated model was developed, which yielded more efficient networks. As the model was parametrized to produce slightly differentiated results, the effects of these parameters were studied.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Slime mould computers have been used to solve graph-theoretical problems like mazes and evaluate man-made transport networks. For the laboratory experiments that demonstrate these computing capabilities, slime mould is first starved and then introduced to an area with attractants placed on key positions. The behaviour of slime mould during these laboratory experiments have been simulated by a model based on cellular automata (CAs). The advantages of a software model over the real slime mould are repeatability and faster productions of results. Using CAs can be justified by the emergence of global behaviour from local interactions, a rule that applies also on the real slime mould. The results of the model have been compared to the ones produced during laboratory experiments and found in good agreement both for maze solving and network designing. After thorough examination of the laboratory experiments an updated model was developed, which yielded more efficient networks. As the model was parametrized to produce slightly differentiated results, the effects of these parameters were studied.
18.
Mizas C, Sirakoulis G Ch, Mardiris V, Karafyllidis I, Glykos N, Sandaltzopoulos R
DNA Cellular Automata Book Chapter
In: Designing Beauty: The Art of Cellular Automata, vol. 20, Chapter 21, pp. 127–128, Springer, Cham, Springer International Publishing, 2016.
@inbook{mizas2016dna,
title = {DNA Cellular Automata},
author = {Charilaos Mizas and Georgios Ch. Sirakoulis and Vasilios Mardiris and Ioannis Karafyllidis and Nicholas Glykos and Raphael Sandaltzopoulos},
url = {https://link.springer.com/chapter/10.1007/978-3-319-27270-2_21},
doi = {doi.org/10.1007/978-3-319-27270-2_21},
year = {2016},
date = {2016-01-06},
urldate = {2016-01-01},
booktitle = {Designing Beauty: The Art of Cellular Automata},
volume = {20},
pages = {127--128},
publisher = {Springer, Cham},
edition = {Springer International Publishing},
chapter = {21},
series = {Emergence, Complexity and Computation},
abstract = {The elementary cellular automata (CA) evolution rule can be extracted from a given number of CA evolution patterns and this can also be applied to the CAs that model DNA sequences. We map DNA to CA in such manner that sugar-phosphate backbone of a DNA molecule corresponds to the CA lattice and the organic bases to the CA cells. At each position of the lattice one of the four bases A (Adenine), C (Cytosine), T (Thymine) and G (Guanine) of the DNA molecule may be allocated, corresponding to the four possible states of the CA cell.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
The elementary cellular automata (CA) evolution rule can be extracted from a given number of CA evolution patterns and this can also be applied to the CAs that model DNA sequences. We map DNA to CA in such manner that sugar-phosphate backbone of a DNA molecule corresponds to the CA lattice and the organic bases to the CA cells. At each position of the lattice one of the four bases A (Adenine), C (Cytosine), T (Thymine) and G (Guanine) of the DNA molecule may be allocated, corresponding to the four possible states of the CA cell.
17.
Georgoudas I G, Sirakoulis G Ch, Scordilis E M, Andreadis I
Seismic Cellular Automata Book Chapter
In: Designing Beauty: The Art of Cellular Automata, vol. 20, Chapter 20, pp. 125–126, Springer International Publishing, 2016.
@inbook{georgoudas2016seismic,
title = {Seismic Cellular Automata},
author = {Ioakeim G Georgoudas and Georgios Ch. Sirakoulis and Emmanuel M Scordilis and Ioannis Andreadis},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-27270-2_20},
doi = {doi.org/10.1007/978-3-319-27270-2_20},
year = {2016},
date = {2016-01-06},
urldate = {2016-01-01},
booktitle = {Designing Beauty: The Art of Cellular Automata},
volume = {20},
pages = {125--126},
publisher = {Springer International Publishing},
chapter = {20},
series = {Emergence, Complexity and Computation},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
16.
Vourkas I, Sirakoulis G Ch
Memristor Fundamentals Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, vol. 19, Chapter 1, pp. 1–8, Springer International Publishing, 2015.
@inbook{vourkas2016memristorc,
title = {Memristor Fundamentals},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007/978-3-319-22647-7_1},
doi = {doi.org/10.1007/978-3-319-22647-7_1},
year = {2015},
date = {2015-08-26},
urldate = {2015-08-26},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
volume = {19},
pages = {1--8},
publisher = {Springer International Publishing},
chapter = {1},
series = {Emergence, Complexity and Computation },
abstract = {The memristor is considered one of the most promising nano-devices among those currently being studied for possible use in electronic systems of the future. The best performance features which have been demonstrated in published experimental results regarding research device prototypes so far include fast switching speed, high endurance and data retention, low power consumption, high integration density, and (perhaps most importantly) CMOS compatibility. Undoubtedly, the combination of such advantageous characteristics in a single device justifies the phenomenal research interest that resistance-switching devices have generally attracted over the last few years and verify the existing rumors about their potential application in both storage and processing units of future electronic systems. Memristive nano-devices are the focus of this book and this chapter aims to introduce the reader to their fundamental properties on which the presented study is based.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
The memristor is considered one of the most promising nano-devices among those currently being studied for possible use in electronic systems of the future. The best performance features which have been demonstrated in published experimental results regarding research device prototypes so far include fast switching speed, high endurance and data retention, low power consumption, high integration density, and (perhaps most importantly) CMOS compatibility. Undoubtedly, the combination of such advantageous characteristics in a single device justifies the phenomenal research interest that resistance-switching devices have generally attracted over the last few years and verify the existing rumors about their potential application in both storage and processing units of future electronic systems. Memristive nano-devices are the focus of this book and this chapter aims to introduce the reader to their fundamental properties on which the presented study is based.
15.
Vourkas I, Sirakoulis G Ch
Memristor Modeling Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, vol. 19, Chapter 2, pp. 9–28, Springer International Publishing, 2015.
@inbook{vourkas2016memristorb,
title = {Memristor Modeling},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007/978-3-319-22647-7_2},
doi = {doi.org/10.1007/978-3-319-22647-7_2},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
volume = {19},
pages = {9--28},
publisher = {Springer International Publishing},
chapter = {2},
series = { Emergence, Complexity and Computation},
abstract = {This chapter presents a SPICE-compatible device model of a voltage-controlled bipolar memristor which explains memristive behavior while primarily attributing the switching effect to an effective tunneling distance modulation. This model satisfies the desired memristive fingerprints and involves significantly low-complexity operation under an unlimited set of frequencies over a wide range of applied voltages. The SPICE simulation results are found in good qualitative and quantitative agreement with the theoretical formulation of the model. Also, the model represents well the complex switching behavior of memristor when fitted to other widely used published models. Therefore, it can be used to provide accurate enough circuit simulations for a wide range of memristor devices and voltage inputs, while it can be incorporated as a circuit element in any current computer-aided design work.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
This chapter presents a SPICE-compatible device model of a voltage-controlled bipolar memristor which explains memristive behavior while primarily attributing the switching effect to an effective tunneling distance modulation. This model satisfies the desired memristive fingerprints and involves significantly low-complexity operation under an unlimited set of frequencies over a wide range of applied voltages. The SPICE simulation results are found in good qualitative and quantitative agreement with the theoretical formulation of the model. Also, the model represents well the complex switching behavior of memristor when fitted to other widely used published models. Therefore, it can be used to provide accurate enough circuit simulations for a wide range of memristor devices and voltage inputs, while it can be incorporated as a circuit element in any current computer-aided design work.
14.
Vourkas I, Sirakoulis G Ch
Dynamic Response of Multiple Interconnected Memristors Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, Chapter 3, pp. 29–59, Springer International Publishing, 2015.
@inbook{vourkas2016dynamic,
title = {Dynamic Response of Multiple Interconnected Memristors},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://www.springerprofessional.de/en/dynamic-response-of-multiple-interconnected-memristors/2515764},
doi = {10.1007/978-3-319-22647-7_3},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
pages = {29--59},
publisher = {Springer International Publishing},
chapter = {3},
abstract = {This chapter focuses on the architectural perspectives that arise in circuits with multiple interconnected memristors, which demonstrate threshold-dependent switching behavior. We investigate the dynamic switching response and analyze the characteristics of both regular and irregular serial/parallel memristive circuit compositions; i.e. memristive combinations which are structured using either repetitive or non-repetitive interconnection patterns. We show how composite memristive systems can be efficiently built out of individual memristors, presenting different electrical characteristics from their structural elements. Following the proposed generalized synthesis concept, by appropriately selecting and interconnecting the constitutive circuit components, we construct composite memristive systems which exhibit behavior of programmable multi-state conducting elements. We provide several examples of such memristive implementations, combining different polarities and different initial states and/or switching characteristics, thus causing highly nontrivial, composite responses to the applied voltages. Finally, we present a novel approach for the construction of robust fine-resolution pro-grammable memristive switches.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
This chapter focuses on the architectural perspectives that arise in circuits with multiple interconnected memristors, which demonstrate threshold-dependent switching behavior. We investigate the dynamic switching response and analyze the characteristics of both regular and irregular serial/parallel memristive circuit compositions; i.e. memristive combinations which are structured using either repetitive or non-repetitive interconnection patterns. We show how composite memristive systems can be efficiently built out of individual memristors, presenting different electrical characteristics from their structural elements. Following the proposed generalized synthesis concept, by appropriately selecting and interconnecting the constitutive circuit components, we construct composite memristive systems which exhibit behavior of programmable multi-state conducting elements. We provide several examples of such memristive implementations, combining different polarities and different initial states and/or switching characteristics, thus causing highly nontrivial, composite responses to the applied voltages. Finally, we present a novel approach for the construction of robust fine-resolution pro-grammable memristive switches.
13.
Vourkas I, Sirakoulis G Ch
Memristive Crossbar-Based Nonvolatile Memory Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, vol. 19, pp. 101–147, Springer International Publishing, 2015.
@inbook{vourkas2016memristive,
title = {Memristive Crossbar-Based Nonvolatile Memory},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007/978-3-319-22647-7_5},
doi = {doi.org/10.1007/978-3-319-22647-7_5},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
volume = {19},
pages = {101--147},
publisher = {Springer International Publishing},
series = {Emergence, Complexity and Computation},
abstract = {Among several types of emerging memory technologies, memristor-based nonvolatile resistive RAM (ReRAM) is currently being investigated as a promising candidate to potentially replace the popular Flash memories, and even other conventional memories such as SRAM and DRAM. At the architectural level, crossbar cell array structure is considered one of the best ways to implement memristor-based ReRAM. This chapter presents an overview of promising ReRAM technologies, their potential benefits, and the key research challenges, with a focus on reduction/oxidation (Redox)-based RAM. It briefly describes the basic operation principles of memristive memory cells, and presents the memristor-based crossbar memory architecture to finally focus on the serious negative impact of the current sneak-paths. Then, two possible methodologies are explored as means to deal with the sneak-path problem, concerning (i) novel storage cell structures, and (ii) modifications in the memory architecture. More specifically, (i) anti-parallel memristive switches are studied as potential cross-point elements in ReRAM arrays, in comparison with anti-serial (complementary) memristive switches. A comprehensive and comparative presentation between them is provided, while commenting on their overall performance and the most appropriate switching characteristics that the structural memristors should have, in order to better fit to memory applications. Moreover, (ii) five alternative architectures (topologies) for passive crossbar ReRAM are presented, which are based on the introduction of a certain percentage of insulating nodes spread out inside the array according to specific distribution patterns. Both approaches enable crossbar memory arrays without select devices, thus they simplify the array fabrication process and could be well-suited for future data storage applications. Finally, XbarSim, a GUI-based educational simulation tool aiming to serve students/researchers who wish to explore and study the memristive crossbar circuit architecture, is presented.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Among several types of emerging memory technologies, memristor-based nonvolatile resistive RAM (ReRAM) is currently being investigated as a promising candidate to potentially replace the popular Flash memories, and even other conventional memories such as SRAM and DRAM. At the architectural level, crossbar cell array structure is considered one of the best ways to implement memristor-based ReRAM. This chapter presents an overview of promising ReRAM technologies, their potential benefits, and the key research challenges, with a focus on reduction/oxidation (Redox)-based RAM. It briefly describes the basic operation principles of memristive memory cells, and presents the memristor-based crossbar memory architecture to finally focus on the serious negative impact of the current sneak-paths. Then, two possible methodologies are explored as means to deal with the sneak-path problem, concerning (i) novel storage cell structures, and (ii) modifications in the memory architecture. More specifically, (i) anti-parallel memristive switches are studied as potential cross-point elements in ReRAM arrays, in comparison with anti-serial (complementary) memristive switches. A comprehensive and comparative presentation between them is provided, while commenting on their overall performance and the most appropriate switching characteristics that the structural memristors should have, in order to better fit to memory applications. Moreover, (ii) five alternative architectures (topologies) for passive crossbar ReRAM are presented, which are based on the introduction of a certain percentage of insulating nodes spread out inside the array according to specific distribution patterns. Both approaches enable crossbar memory arrays without select devices, thus they simplify the array fabrication process and could be well-suited for future data storage applications. Finally, XbarSim, a GUI-based educational simulation tool aiming to serve students/researchers who wish to explore and study the memristive crossbar circuit architecture, is presented.
12.
Vourkas I, Sirakoulis G Ch
Memristor-Based Logic Circuits Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, vol. 19, Chapter 4, pp. 61–100, Springer International Publishing, 2015.
@inbook{vourkas2016memristord,
title = {Memristor-Based Logic Circuits},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007/978-3-319-22647-7_4},
doi = {doi.org/10.1007/978-3-319-22647-7_4},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
volume = {19},
pages = {61--100},
publisher = {Springer International Publishing},
chapter = {4},
series = {Emergence, Complexity and Computation },
abstract = {Amongst several emergent applications of the memristance switching phenomenon, the implementation of logic circuits is gaining considerable attention. Memristor-based logic circuits open new pathways for the exploration of advanced computing architectures as promising alternatives to conventional integrated circuit technologies. However, up to now no standard logic design methodology exists, since it is not immediately clear what kind of computing architectures would in practice benefit the most from the computing capabilities of memristors. This chapter addresses memristive logic circuit design and computational methodologies, aiming to approach this novel area of research while motivating for further research on innovative design strategies, which comply with emerging technologies. First, a summary of the most recognized memristive logic circuit design concepts is provided. Then two novel logic design paradigms are presented, which aim to address several drawbacks of other existing design concepts in the literature, and to facilitate the incorporation of memristors in currently established logic circuit architectures. Thus they could be promising candidates to be used in future electronic systems design. The proposed design paradigms are validated through SPICE-based simulations for a variety of complex combinational logic circuits.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Amongst several emergent applications of the memristance switching phenomenon, the implementation of logic circuits is gaining considerable attention. Memristor-based logic circuits open new pathways for the exploration of advanced computing architectures as promising alternatives to conventional integrated circuit technologies. However, up to now no standard logic design methodology exists, since it is not immediately clear what kind of computing architectures would in practice benefit the most from the computing capabilities of memristors. This chapter addresses memristive logic circuit design and computational methodologies, aiming to approach this novel area of research while motivating for further research on innovative design strategies, which comply with emerging technologies. First, a summary of the most recognized memristive logic circuit design concepts is provided. Then two novel logic design paradigms are presented, which aim to address several drawbacks of other existing design concepts in the literature, and to facilitate the incorporation of memristors in currently established logic circuit architectures. Thus they could be promising candidates to be used in future electronic systems design. The proposed design paradigms are validated through SPICE-based simulations for a variety of complex combinational logic circuits.
11.
Vourkas I, Sirakoulis G Ch
High-Radix Arithmetic-Logic Unit (ALU) Based on Memristors Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, pp. 149–172, Springer International Publishing, 2015.
@inbook{vourkas2016high,
title = {High-Radix Arithmetic-Logic Unit (ALU) Based on Memristors},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://www.springerprofessional.de/en/high-radix-arithmetic-logic-unit-alu-based-on-memristors/2515772},
doi = {doi.org/10.1007/978-3-319-22647-7_6},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
pages = {149--172},
publisher = {Springer International Publishing},
abstract = {This chapter presents a novel method for implementing crossbar-based multi-level memories, where each cross-point cell stores multiple bits. Furthermore, a conceptual solution for novel CMOS-compatible, memristive, high-radix arithmetic logic units (ALUs) is proposed, for future computing systems. More specifically, a hybrid ALU circuit nano-architecture is described, where: (a) CMOS peripheral circuits are used for binary arithmetic operations; (b) a memristive reconfigurable crossbar-based memory block is used to: (i) allow parallel read/write of data; (ii) facilitate the implementation of efficient arithmetic algorithms (e.g. fast partial product creation for multiplication); and (iii) store information in a compact, high-radix form. Instead of single memristors, the crossbar nodes comprise a type of multi-state composite memristive switches, described in Chap. 3, which permit multi-bit storage in a more robust manner. Radix-4 representation is used because: (i) it balances the offered advantages with the peripheral binary conversion circuitry overhead; and (ii) it provides a good density/reliability trade-off. The fine operation and accuracy of the proposed system architecture is demonstrated through SPICE-level simulations.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
This chapter presents a novel method for implementing crossbar-based multi-level memories, where each cross-point cell stores multiple bits. Furthermore, a conceptual solution for novel CMOS-compatible, memristive, high-radix arithmetic logic units (ALUs) is proposed, for future computing systems. More specifically, a hybrid ALU circuit nano-architecture is described, where: (a) CMOS peripheral circuits are used for binary arithmetic operations; (b) a memristive reconfigurable crossbar-based memory block is used to: (i) allow parallel read/write of data; (ii) facilitate the implementation of efficient arithmetic algorithms (e.g. fast partial product creation for multiplication); and (iii) store information in a compact, high-radix form. Instead of single memristors, the crossbar nodes comprise a type of multi-state composite memristive switches, described in Chap. 3, which permit multi-bit storage in a more robust manner. Radix-4 representation is used because: (i) it balances the offered advantages with the peripheral binary conversion circuitry overhead; and (ii) it provides a good density/reliability trade-off. The fine operation and accuracy of the proposed system architecture is demonstrated through SPICE-level simulations.
10.
Vourkas I, Sirakoulis G Ch
Networks of Memristors and Memristive Components Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, vol. 19, Chapter 7, pp. 173–198, Springer International Publishing, 2015.
@inbook{vourkas2016networks,
title = {Networks of Memristors and Memristive Components},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007/978-3-319-22647-7_7},
doi = {doi.org/10.1007/978-3-319-22647-7_7},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
volume = {19},
pages = {173--198},
publisher = {Springer International Publishing},
chapter = {7},
series = {Emergence, Complexity and Computation},
abstract = {Memristors demonstrate a natural basis for computation that combines information processing and storage in the memory itself. A very powerful and promising memristor-based computing structure, which implements analog parallel computations, is the memristor network. In such structure there is continuous information exchange during calculations which renders a tremendous increase of computational power due to the massively parallel network dynamics. In this chapter we explore this computing concept via numerical and circuit simulations for the purpose of investigating the network dynamics, utilizing the well-documented physics of single devices and known network topologies. We address two of the probably most well-known inherently complex problems, in terms of computation time, i.e. the shortest path and the maze-solving problems, via computations in memristor networks. For these specific problems we further extend already proposed memristor network-based computing approaches by introducing certain modifications in the computing platform. Several scenarios are examined considering also the inclusion of devices with different switching characteristics in the same computation. Additionally, we address the appropriate mapping issue of graph-based computational problems via a novel modeling approach, which is based on specific circuit models describing several types of edges connecting the graph vertices. The emergence of new functionalities opens doors to exciting new computing concepts and encourages the development of parallel memristive computing systems.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Memristors demonstrate a natural basis for computation that combines information processing and storage in the memory itself. A very powerful and promising memristor-based computing structure, which implements analog parallel computations, is the memristor network. In such structure there is continuous information exchange during calculations which renders a tremendous increase of computational power due to the massively parallel network dynamics. In this chapter we explore this computing concept via numerical and circuit simulations for the purpose of investigating the network dynamics, utilizing the well-documented physics of single devices and known network topologies. We address two of the probably most well-known inherently complex problems, in terms of computation time, i.e. the shortest path and the maze-solving problems, via computations in memristor networks. For these specific problems we further extend already proposed memristor network-based computing approaches by introducing certain modifications in the computing platform. Several scenarios are examined considering also the inclusion of devices with different switching characteristics in the same computation. Additionally, we address the appropriate mapping issue of graph-based computational problems via a novel modeling approach, which is based on specific circuit models describing several types of edges connecting the graph vertices. The emergence of new functionalities opens doors to exciting new computing concepts and encourages the development of parallel memristive computing systems.
9.
Vourkas I, Sirakoulis G Ch
Memristive Computing for NP-Hard AI Problems Book Chapter
In: Memristor-Based Nanoelectronic Computing Circuits and Architectures, vol. 19, pp. 199–241, Springer International Publishing, 2015.
@inbook{vourkas2016memristiveb,
title = {Memristive Computing for NP-Hard AI Problems},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-22647-7_8},
doi = {doi.org/10.1007/978-3-319-22647-7_8},
year = {2015},
date = {2015-08-26},
urldate = {2016-01-01},
booktitle = {Memristor-Based Nanoelectronic Computing Circuits and Architectures},
volume = {19},
pages = {199--241},
publisher = {Springer International Publishing},
series = {doi.org/10.1007/978-3-319-22647-7_8},
abstract = {Reported properties of network configurations of memristors, as presented in Chap. 7, showed that composite memristive systems significantly improve the efficiency of logic operations via massive analog parallelism. The sparse nature of such network-based computations, though, resembles certain operational features and computing capabilities of Cellular Automata (CA), a powerful parallel computational model which leads to scalable hardware (HW) architectures with very high device densities. When CA-based models are implemented in HW, the circuit design reduces to the design of a single cell and the overall layout results regular with exclusively local inter-connections. Moreover, the models are executed fast by exploiting the parallelism of the CA structure. This chapter focuses on a circuit-level CA-inspired approach for in-memory computing schemes using memristors and composite memristive components. A generalized CA cell circuit design methodology is described, which facilitates the implementation of CA-based computing algorithms, exploiting the threshold-type resistance switching behavior of memristors and of multi-state memristive components. Several CA cell example structures are designed and employed in array-like circuit geometries, where computations regarding classic NP-hard problems of various areas of artificial intelligence (AI) take place. The main contribution of this methodology consists in the combination of unconventional computing with CA and the unique circuit properties of memristors, aiming to set off parallel computing capabilities and improve CA-based hardware accelerators for NP-hard AI problems.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Reported properties of network configurations of memristors, as presented in Chap. 7, showed that composite memristive systems significantly improve the efficiency of logic operations via massive analog parallelism. The sparse nature of such network-based computations, though, resembles certain operational features and computing capabilities of Cellular Automata (CA), a powerful parallel computational model which leads to scalable hardware (HW) architectures with very high device densities. When CA-based models are implemented in HW, the circuit design reduces to the design of a single cell and the overall layout results regular with exclusively local inter-connections. Moreover, the models are executed fast by exploiting the parallelism of the CA structure. This chapter focuses on a circuit-level CA-inspired approach for in-memory computing schemes using memristors and composite memristive components. A generalized CA cell circuit design methodology is described, which facilitates the implementation of CA-based computing algorithms, exploiting the threshold-type resistance switching behavior of memristors and of multi-state memristive components. Several CA cell example structures are designed and employed in array-like circuit geometries, where computations regarding classic NP-hard problems of various areas of artificial intelligence (AI) take place. The main contribution of this methodology consists in the combination of unconventional computing with CA and the unique circuit properties of memristors, aiming to set off parallel computing capabilities and improve CA-based hardware accelerators for NP-hard AI problems.
8.
Portokalidis D, Georgoudas I G, Gasteratos A, Sirakoulis G Ch
A Full-Scale Hardware Solution for Crowd Evacuation via Multiple Cameras Book Chapter
In: Spagnolo, P.; Mazzeo, P.; Distante, C. (Ed.): Human Behavior Understanding in Networked Sensing, Chapter 6, pp. 127–154, Springer International Publishing, 2014.
@inbook{portokalidis2014full,
title = {A Full-Scale Hardware Solution for Crowd Evacuation via Multiple Cameras},
author = {Dimitrios Portokalidis and Ioakeim G Georgoudas and Antonios Gasteratos and Georgios Ch. Sirakoulis},
editor = {P. Spagnolo and P. Mazzeo and C. Distante},
url = {https://link.springer.com/chapter/10.1007/978-3-319-10807-0_6},
doi = {doi.org/10.1007/978-3-319-10807-0_6},
year = {2014},
date = {2014-11-07},
urldate = {2014-01-01},
booktitle = {Human Behavior Understanding in Networked Sensing},
pages = {127--154},
publisher = {Springer International Publishing},
chapter = {6},
abstract = {Crowd evacuation is thoroughly investigated in recent years. All efforts focus on improving safety standards of such a process. Past and latest life-threatening incidents related to evacuation procedures justify both the growing scientific interest as well as the interdisciplinary character of most research approaches. In this chapter, we describe the hardware implementation of a management system that aims at acting anticipatively against crowd congestion during evacuation. The system consists of two structural components. The first one relies on an elaborated form of the Viola et al. [55] detection and tracking algorithm, which incorporates both appearance and motion in real-time. Being supported by cameras, this algorithm realises the initialisation process. In principal, it consists of simple sum-of-pixel filters that are boosted into a strong classifier. A linear combination of these filters properly set thresholds, thus succeeding detection. The second part consists of a Cellular Automata (CA) based route estimation model. Presumable congestion in front of exits during crowd egress, leads to the prompt activation of sound and optical signals that guide pedestrians towards alternative escaping points. The CA model, as well as the tracking algorithm are implemented by means of Field Programmable Gate Array (FPGA) logic. Hardware accelerates the response of the model by exploiting the distinct feature of parallelism that CA structures inherently possess. Furthermore, implementing the model on an FPGA device takes advantage of their natural parallelism, thus reaching significant speed-ups with respect to software simulation. The incorporation of the design as a fast processing module of an embedded system dedicated to surveillance is also advantageous in terms of compactness, portability and low cost.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Crowd evacuation is thoroughly investigated in recent years. All efforts focus on improving safety standards of such a process. Past and latest life-threatening incidents related to evacuation procedures justify both the growing scientific interest as well as the interdisciplinary character of most research approaches. In this chapter, we describe the hardware implementation of a management system that aims at acting anticipatively against crowd congestion during evacuation. The system consists of two structural components. The first one relies on an elaborated form of the Viola et al. [55] detection and tracking algorithm, which incorporates both appearance and motion in real-time. Being supported by cameras, this algorithm realises the initialisation process. In principal, it consists of simple sum-of-pixel filters that are boosted into a strong classifier. A linear combination of these filters properly set thresholds, thus succeeding detection. The second part consists of a Cellular Automata (CA) based route estimation model. Presumable congestion in front of exits during crowd egress, leads to the prompt activation of sound and optical signals that guide pedestrians towards alternative escaping points. The CA model, as well as the tracking algorithm are implemented by means of Field Programmable Gate Array (FPGA) logic. Hardware accelerates the response of the model by exploiting the distinct feature of parallelism that CA structures inherently possess. Furthermore, implementing the model on an FPGA device takes advantage of their natural parallelism, thus reaching significant speed-ups with respect to software simulation. The incorporation of the design as a fast processing module of an embedded system dedicated to surveillance is also advantageous in terms of compactness, portability and low cost.
7.
Kapoutsis A C, Chatzichristofis S A, Sirakoulis G Ch, Doitsidis L, Kosmatopoulos E B
Employing Cellular Automata for Shaping Accurate Morphology Maps Using Scattered Data from Robotics’ Missions Book Chapter
In: Sirakoulis, Georgios Ch.; Adamatzky, Andrew (Ed.): Robots and Lattice Automata, vol. 13, Chapter 10, pp. 229–246, Springer International Publishing, 2014.
@inbook{kapoutsis2015employing,
title = {Employing Cellular Automata for Shaping Accurate Morphology Maps Using Scattered Data from Robotics’ Missions},
author = {Athanasios Ch Kapoutsis and Savvas A Chatzichristofis and Georgios Ch. Sirakoulis and Lefteris Doitsidis and Elias B Kosmatopoulos},
editor = {Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-10924-4_10},
doi = {doi.org/10.1007/978-3-319-10924-4_10},
year = {2014},
date = {2014-10-14},
urldate = {2015-01-01},
booktitle = {Robots and Lattice Automata},
volume = {13},
pages = {229--246},
publisher = {Springer International Publishing},
chapter = {10},
series = {Emergence, Complexity and Computation},
abstract = {Accurate maps are essential in the case of robot teams, so that they can operate autonomously and accomplish their tasks efficiently. In this work we present an approach which allows the generation of detailed maps, suitable for robot navigation, from a mesh of sparse points using Cellular Automata and simple evolutions rules. The entire map area can be considered as a 2D Cellular Automaton (CA) where the value at each CA cell represents the height of the ground in the corresponding coordinates. The set of measurements form the original state of the CA. The CA rules are responsible for generating the intermediate heights among the real measurements. The proposed method can automatically adjust its rules, so as to encapture local morphological attributes, using a pre-processing procedure in the set of measurements. The main advantage of the proposed approach is the ability to maintain an accurately reconstruction even in cases where the number of measurements are significant reduced. Experiments have been conducted employing data collected from two totally different real-word environments. In the first case the proposed approach is applied, so as to build a detailed map of a large unknown underwater area in Oporto, Portugal. The second case concerns data collected by a team of aerial robots in real experiments in an area near Zurich, Switzerland and is also used for the evaluation of the approach. The data collected, in the two aforementioned cases, are extracted using different kind of sensors and robots, thus demonstrating the applicability of our approach in different kind of devices. The proposed method outperforms the performance of other well-known methods in literature thus enabling its application for real robot navigation.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Accurate maps are essential in the case of robot teams, so that they can operate autonomously and accomplish their tasks efficiently. In this work we present an approach which allows the generation of detailed maps, suitable for robot navigation, from a mesh of sparse points using Cellular Automata and simple evolutions rules. The entire map area can be considered as a 2D Cellular Automaton (CA) where the value at each CA cell represents the height of the ground in the corresponding coordinates. The set of measurements form the original state of the CA. The CA rules are responsible for generating the intermediate heights among the real measurements. The proposed method can automatically adjust its rules, so as to encapture local morphological attributes, using a pre-processing procedure in the set of measurements. The main advantage of the proposed approach is the ability to maintain an accurately reconstruction even in cases where the number of measurements are significant reduced. Experiments have been conducted employing data collected from two totally different real-word environments. In the first case the proposed approach is applied, so as to build a detailed map of a large unknown underwater area in Oporto, Portugal. The second case concerns data collected by a team of aerial robots in real experiments in an area near Zurich, Switzerland and is also used for the evaluation of the approach. The data collected, in the two aforementioned cases, are extracted using different kind of sensors and robots, thus demonstrating the applicability of our approach in different kind of devices. The proposed method outperforms the performance of other well-known methods in literature thus enabling its application for real robot navigation.
6.
Ioannidis K, Sirakoulis G Ch, Andreadis I
Cellular Robotic Ants Synergy Coordination for Path Planning Book Chapter
In: Sirakoulis, Georgios Ch.; Adamatzky, Andrew (Ed.): Robots and Lattice Automata, vol. 13, Chapter 9, pp. 197–228, Springer International Publishing, 2014.
@inbook{ioannidis2015cellular,
title = {Cellular Robotic Ants Synergy Coordination for Path Planning},
author = {Konstantinos Ioannidis and Georgios Ch. Sirakoulis and Ioannis Andreadis},
editor = {Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-10924-4_9},
doi = {doi.org/10.1007/978-3-319-10924-4_9},
year = {2014},
date = {2014-10-12},
urldate = {2015-01-01},
booktitle = {Robots and Lattice Automata},
volume = {13},
pages = {197--228},
publisher = {Springer International Publishing},
chapter = {9},
series = {Emergence, Complexity and Computation},
abstract = {In this chapter, a unified architecture is proposed for a robot team in order to accomplish several tasks based on the application of an enhanced Cellular Automata (CA) path planner. The presented path planner can produce adequate collision-free pathways with minimum hardware resources and low complexity levels. During the course of a robot team to its final destination, dynamic obstacles are detected and avoided in real time as well as coordinated movements are executed by applying cooperations in order to maintain the team’s initial formation. The inherit parallelism and simplicity of CA result in a path planner that requires low computational resources and thus, its implementation in miniature robots is straightforward. Cooperations are limited to a minimum so that further resource reduction can be achieved. For this purpose, the basic fundamentals of another artificial intelligence method, namely Ant Colonies Optimization (ACO) technique, were applied. The entire robot team is divided into equally numbered subgroups and an ACO algorithm is applied to reduce the complexity. As each robot moves towards to its final position, it creates a trail of an evaporated substance, called “pheromone”. The “pheromone” and its quantity are detected by the following robots and thus, every robot is absolved by the necessity of continuous communication with its neighbors. The total complexity of the presented architecture results to a possible implementation using a team of miniature robots where all available resources are exploited.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
In this chapter, a unified architecture is proposed for a robot team in order to accomplish several tasks based on the application of an enhanced Cellular Automata (CA) path planner. The presented path planner can produce adequate collision-free pathways with minimum hardware resources and low complexity levels. During the course of a robot team to its final destination, dynamic obstacles are detected and avoided in real time as well as coordinated movements are executed by applying cooperations in order to maintain the team’s initial formation. The inherit parallelism and simplicity of CA result in a path planner that requires low computational resources and thus, its implementation in miniature robots is straightforward. Cooperations are limited to a minimum so that further resource reduction can be achieved. For this purpose, the basic fundamentals of another artificial intelligence method, namely Ant Colonies Optimization (ACO) technique, were applied. The entire robot team is divided into equally numbered subgroups and an ACO algorithm is applied to reduce the complexity. As each robot moves towards to its final position, it creates a trail of an evaporated substance, called “pheromone”. The “pheromone” and its quantity are detected by the following robots and thus, every robot is absolved by the necessity of continuous communication with its neighbors. The total complexity of the presented architecture results to a possible implementation using a team of miniature robots where all available resources are exploited.
5.
Ioannidis K, Sirakoulis G Ch, Andreadis I
Cellular Automata for Image Resizing Book Chapter
In: Cellular Automata in Image Processing and Geometry, vol. 10, Chapter 2, pp. 25–45, Springer, 2014.
@inbook{ioannidis2014cellular,
title = {Cellular Automata for Image Resizing},
author = {Konstantinos Ioannidis and Georgios Ch. Sirakoulis and Ioannis Andreadis},
url = {https://link.springer.com/chapter/10.1007/978-3-319-06431-4_2},
doi = {doi.org/10.1007/978-3-319-06431-4_2},
year = {2014},
date = {2014-06-13},
urldate = {2014-01-01},
booktitle = {Cellular Automata in Image Processing and Geometry},
volume = {10},
pages = {25--45},
publisher = {Springer},
chapter = {2},
series = { Emergence, Complexity and Computation},
abstract = {During the last years, several methods have been applied to tackle the image resizing problem. Most of these methods are derived from image interpolation techniques for image enlargement. Among them, the edge-directed interpolation methods succeed to preserve the edges of the low resolution image and produce crisper results compared to the space invariantmodels. In this chapter, we present an edge-directed method which exploits the simplicity and the inherent parallelism of the Cellular Automata (CA) computational tool to generate high resolution images from low resolution acquired images. This task is accomplished with the help of the Canny Edge Detector so as to discriminate the edge regions from the homogenous ones. Moreover, appropriate CA states and transition rules were designed to evolve the CA, which, eventually, attempt to enhance the quality of the edge areas. The orientation of the edge cells are considered in order to preserve effectively the edges of the initial image. The presented experimental results in terms of PSNR values and processing time demonstrate the effectiveness of the proposed method when compared to well-known methods as well as its suitability, especially for systems with low requirements specifications when further image processing is required.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
During the last years, several methods have been applied to tackle the image resizing problem. Most of these methods are derived from image interpolation techniques for image enlargement. Among them, the edge-directed interpolation methods succeed to preserve the edges of the low resolution image and produce crisper results compared to the space invariantmodels. In this chapter, we present an edge-directed method which exploits the simplicity and the inherent parallelism of the Cellular Automata (CA) computational tool to generate high resolution images from low resolution acquired images. This task is accomplished with the help of the Canny Edge Detector so as to discriminate the edge regions from the homogenous ones. Moreover, appropriate CA states and transition rules were designed to evolve the CA, which, eventually, attempt to enhance the quality of the edge areas. The orientation of the edge cells are considered in order to preserve effectively the edges of the initial image. The presented experimental results in terms of PSNR values and processing time demonstrate the effectiveness of the proposed method when compared to well-known methods as well as its suitability, especially for systems with low requirements specifications when further image processing is required.
4.
Kalogeiton V S, Papadopoulos D P, Georgilas I P, Sirakoulis G Ch, Adamatzky A I
Biomimicry of Crowd Evacuation with a Slime Mould Cellular Automaton Model Book Chapter
In: Pancerz, K.; Zaitseva, E. (Ed.): Computational Intelligence, Medicine and Biology, vol. 600, Chapter 7, pp. 123–151, Springer International Publishing, 2014.
@inbook{kalogeiton2015biomimicry,
title = {Biomimicry of Crowd Evacuation with a Slime Mould Cellular Automaton Model},
author = {Vicky S Kalogeiton and Dim P Papadopoulos and Ioannis P Georgilas and Georgios Ch. Sirakoulis and Andrew I Adamatzky},
editor = {K. Pancerz and E. Zaitseva},
url = {https://link.springer.com/chapter/10.1007%2F978-3-319-16844-9_7},
doi = {doi.org/10.1007/978-3-319-16844-9_7},
year = {2014},
date = {2014-04-23},
urldate = {2015-01-01},
booktitle = {Computational Intelligence, Medicine and Biology},
volume = {600},
pages = {123--151},
publisher = {Springer International Publishing},
chapter = {7},
series = {Studies in Computational Intelligence},
abstract = {Evacuation is an imminent movement of people away from sources of danger. Evacuation in highly structured environments, e.g. building, requires advance planning and large-scale control. Finding a shortest path towards exit is a key for the prompt successful evacuation. Slime mould Physarum polycephalum is proven to be an efficient path solver: the living slime mould calculates optimal paths towards sources of attractants yet maximizes distances from repellents. The search strategy implemented by the slime mould is straightforward yet efficient. The slime mould develops may active traveling zones, or pseudopodia, which propagates along different, alternative, routes the pseudopodia close to the target loci became dominating and the pseudopodia propagating along less optimal routes decease. We adopt the slime mould’s strategy in a Cellular-Automaton (CA) model of a crowd evacuation. CA are massive-parallel computation tool capable for mimicking the Physarum’s behaviour. The model accounts for Physarum foraging process, the food diffusion, the organism’s growth, the creation of tubes for each organism, the selection of optimum path for each human and imitation movement of all humans at each time step towards near exit. To test the efficiency and robustness of the proposed CA model, several simulation scenarios were proposed proving that the model succeeds to reproduce sufficiently the Physarum’s inspiring behaviour.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Evacuation is an imminent movement of people away from sources of danger. Evacuation in highly structured environments, e.g. building, requires advance planning and large-scale control. Finding a shortest path towards exit is a key for the prompt successful evacuation. Slime mould Physarum polycephalum is proven to be an efficient path solver: the living slime mould calculates optimal paths towards sources of attractants yet maximizes distances from repellents. The search strategy implemented by the slime mould is straightforward yet efficient. The slime mould develops may active traveling zones, or pseudopodia, which propagates along different, alternative, routes the pseudopodia close to the target loci became dominating and the pseudopodia propagating along less optimal routes decease. We adopt the slime mould’s strategy in a Cellular-Automaton (CA) model of a crowd evacuation. CA are massive-parallel computation tool capable for mimicking the Physarum’s behaviour. The model accounts for Physarum foraging process, the food diffusion, the organism’s growth, the creation of tubes for each organism, the selection of optimum path for each human and imitation movement of all humans at each time step towards near exit. To test the efficiency and robustness of the proposed CA model, several simulation scenarios were proposed proving that the model succeeds to reproduce sufficiently the Physarum’s inspiring behaviour.
3.
Vourkas I, Sirakoulis G Ch
Modeling Memristor-Based Circuit Networks on Crossbar Architectures Book Chapter
In: Adamatzky, Andrew; Chua, Leon (Ed.): Memristor Networks, Chapter 23, pp. 505–535, Springer, 2013.
@inbook{vourkas2014modeling,
title = {Modeling Memristor-Based Circuit Networks on Crossbar Architectures},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
editor = {Andrew Adamatzky and Leon Chua},
url = {https://link.springer.com/chapter/10.1007/978-3-319-02630-5_23},
doi = {https://doi.org/10.1007/978-3-319-02630-5_23},
year = {2013},
date = {2013-12-18},
urldate = {2014-01-01},
booktitle = {Memristor Networks},
pages = {505--535},
publisher = {Springer},
chapter = {23},
abstract = {Over 30 years ago Leon Chua proposed the existence of a new class of passive circuit elements, which he called memristors and memristive devices. The unique electrical characteristics associated with them, along with the advantages of crossbar structures, have the potential to revolutionize computing architectures. Being associated with the totally nonlinear behavior of individual memristive elements, circuits of multiple memristors may work in very complicated way, quite difficult to predict, due to the polarity-dependent nonlinear variation in the memory resistance (memristance) of individual memristors. A well defined and effective memristor model for circuit design combined with a design paradigm which exploits the composite behavior of memristive elements, based on well understood underlying logic design principles, would certainly accelerate research on nanoscale circuits and systems. Towards this goal, we explore the dynamics of regular network geometries containing only memristive devices and present a memristor crossbar circuit design paradigm in which memristors are modeled using the quantum mechanical phenomenon of tunneling. We use this circuit model to test various logic circuit designs capable of universal computation, and finally, we develop and present a novel design paradigm for memristor-based crossbar circuits.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Over 30 years ago Leon Chua proposed the existence of a new class of passive circuit elements, which he called memristors and memristive devices. The unique electrical characteristics associated with them, along with the advantages of crossbar structures, have the potential to revolutionize computing architectures. Being associated with the totally nonlinear behavior of individual memristive elements, circuits of multiple memristors may work in very complicated way, quite difficult to predict, due to the polarity-dependent nonlinear variation in the memory resistance (memristance) of individual memristors. A well defined and effective memristor model for circuit design combined with a design paradigm which exploits the composite behavior of memristive elements, based on well understood underlying logic design principles, would certainly accelerate research on nanoscale circuits and systems. Towards this goal, we explore the dynamics of regular network geometries containing only memristive devices and present a memristor crossbar circuit design paradigm in which memristors are modeled using the quantum mechanical phenomenon of tunneling. We use this circuit model to test various logic circuit designs capable of universal computation, and finally, we develop and present a novel design paradigm for memristor-based crossbar circuits.
2.
Georgoudas I G, Sirakoulis G C, Andreadis I T
Hardware Implementation of a Crowd Evacuation Model Based on Cellular Automata Book Chapter
In: Pedestrian and Evacuation Dynamics 2008, pp. 451–463, Springer, 2010.
@inbook{georgoudas2010hardware,
title = {Hardware Implementation of a Crowd Evacuation Model Based on Cellular Automata},
author = {Ioakeim G Georgoudas and Georgios C Sirakoulis and Ioannis T Andreadis},
year = {2010},
date = {2010-01-01},
urldate = {2010-01-01},
booktitle = {Pedestrian and Evacuation Dynamics 2008},
pages = {451--463},
publisher = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
1.
Konstantinidis K, Sirakoulis G C, Andreadis I
Ant Colony Optimization for Use in Content Based Image Retrieval Book Chapter
In: Handbook of Research on Artificial Immune Systems and Natural Computing: Applying Complex Adaptive Technologies, pp. 384–404, IGI Global, 2009.
@inbook{konstantinidis2009ant,
title = {Ant Colony Optimization for Use in Content Based Image Retrieval},
author = {Konstantinos Konstantinidis and Georgios Ch Sirakoulis and Ioannis Andreadis},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
booktitle = {Handbook of Research on Artificial Immune Systems and Natural Computing: Applying Complex Adaptive Technologies},
pages = {384--404},
publisher = {IGI Global},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Editorials
12.
Spataro W, Trunfio G A, Sirakoulis G Ch
Editorial on the Special Issue on Parallel Computing in Modelling and Simulation Miscellaneous
2019.
@misc{spataro2019editorial,
title = {Editorial on the Special Issue on Parallel Computing in Modelling and Simulation},
author = {William Spataro and Giuseppe A Trunfio and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0743731519306173?via%3Dihub},
doi = {doi.org/10.1016/j.jpdc.2019.09.002},
year = {2019},
date = {2019-09-30},
urldate = {2019-01-01},
journal = {Journal of Parallel and Distributed Computing},
volume = {134},
pages = {233--235},
publisher = {Elsevier},
abstract = {Model development for the simulation of the evolution of artificial and natural systems is essential for the advancement of Science. Recently, the increasing power of computers has allowed to considerably extending the application of parallel computing methodologies in research and industry, but also to the quantitative study of complex phenomena. This has permitted a broad application of numerical methods for differential equation systems (e.g., FEM, FDM, etc.) on one hand, and the application of alternative computational paradigms, such as Cellular Automata, Genetic Algorithms, Neural networks, Swarm Intelligence, etc., on the other. These latter have demonstrated their effectiveness for modelling purposes when traditional simulation methodologies have proven to be impracticable.
This Special issue aims to provide a platform for a multidisciplinary community composed of scholars, researchers, developers, educators, practitioners and experts from world leading Universities, Institutions, Agencies and Companies in Computational Science, and thus in the Parallel Computing for Modelling and Simulation field. The intent is to offer an opportunity to express and confront views on trends, challenges, and state-of-the art in diverse application fields, such as engineering, physics, chemistry, biology, geology, medicine, ecology, sociology, traffic control, economy, etc.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Model development for the simulation of the evolution of artificial and natural systems is essential for the advancement of Science. Recently, the increasing power of computers has allowed to considerably extending the application of parallel computing methodologies in research and industry, but also to the quantitative study of complex phenomena. This has permitted a broad application of numerical methods for differential equation systems (e.g., FEM, FDM, etc.) on one hand, and the application of alternative computational paradigms, such as Cellular Automata, Genetic Algorithms, Neural networks, Swarm Intelligence, etc., on the other. These latter have demonstrated their effectiveness for modelling purposes when traditional simulation methodologies have proven to be impracticable.
This Special issue aims to provide a platform for a multidisciplinary community composed of scholars, researchers, developers, educators, practitioners and experts from world leading Universities, Institutions, Agencies and Companies in Computational Science, and thus in the Parallel Computing for Modelling and Simulation field. The intent is to offer an opportunity to express and confront views on trends, challenges, and state-of-the art in diverse application fields, such as engineering, physics, chemistry, biology, geology, medicine, ecology, sociology, traffic control, economy, etc.
This Special issue aims to provide a platform for a multidisciplinary community composed of scholars, researchers, developers, educators, practitioners and experts from world leading Universities, Institutions, Agencies and Companies in Computational Science, and thus in the Parallel Computing for Modelling and Simulation field. The intent is to offer an opportunity to express and confront views on trends, challenges, and state-of-the art in diverse application fields, such as engineering, physics, chemistry, biology, geology, medicine, ecology, sociology, traffic control, economy, etc.
11.
Vourkas I, Sirakoulis G Ch
Special issue on ‘Advances in Memristive Networks’ Miscellaneous
2018.
@misc{vourkas2018special,
title = {Special issue on ‘Advances in Memristive Networks’},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
doi = {doi.org/10.1080/17445760.2018.1450874},
year = {2018},
date = {2018-06-27},
urldate = {2018-01-01},
journal = {International Journal of Parallel, Emergent and Distributed Systems},
volume = {33},
number = {4},
pages = {347--349},
publisher = {Taylor \& Francis},
abstract = {The existence of the fourth fundamental circuit element, the ‘memristor’, was postulated by Chua in 1971 [1]. Chua mathematically explored the properties of this new nonlinear circuit element and found that it was essentially a resistor with memory, so he called it memristor. The memristor is a two-terminal circuit element characterised by a nonlinear relation between the time integrals of the current and the voltage applied to its terminals. However, nowadays the term memristor may refer to any resistive switching device that complies with a set of certain properties known as fingerprints of memristors [2]. Unprecedented attention on this device technology has been drawn ever since 2008 and the first demonstration of the well-known -based memristor by a team of Hewlett Packard researchers led by Williams [3], who managed to connect the nature of such devices with Chua’s 1971 theory (although the hysteretic resistive switching property of oxides sandwiched between metal electrodes had been noticed during the ’60s [4])....},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
The existence of the fourth fundamental circuit element, the ‘memristor’, was postulated by Chua in 1971 [1]. Chua mathematically explored the properties of this new nonlinear circuit element and found that it was essentially a resistor with memory, so he called it memristor. The memristor is a two-terminal circuit element characterised by a nonlinear relation between the time integrals of the current and the voltage applied to its terminals. However, nowadays the term memristor may refer to any resistive switching device that complies with a set of certain properties known as fingerprints of memristors [2]. Unprecedented attention on this device technology has been drawn ever since 2008 and the first demonstration of the well-known -based memristor by a team of Hewlett Packard researchers led by Williams [3], who managed to connect the nature of such devices with Chua’s 1971 theory (although the hysteretic resistive switching property of oxides sandwiched between metal electrodes had been noticed during the ’60s [4])....
10.
Vourkas I, Sirakoulis G Ch
Meet the editors Miscellaneous
2018.
@misc{vourkas2018meet,
title = {Meet the editors},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://www.tandfonline.com/doi/abs/10.1080/17445760.2018.1488897},
doi = {doi.org/10.1080/17445760.2018.1488897},
year = {2018},
date = {2018-06-27},
urldate = {2018-01-01},
journal = {International Journal of Parallel, Emergent and Distributed Systems},
volume = {33},
number = {4},
pages = {445--447},
publisher = {Taylor \& Francis},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
9.
Trunfio G A, Spataro W, Sirakoulis G Ch
Special issue on high performance computing in modeling and simulation Miscellaneous
2018.
@misc{trunfio2018special,
title = {Special issue on high performance computing in modeling and simulation},
author = {Giuseppe A Trunfio and William Spataro and Georgios Ch. Sirakoulis},
url = {https://onlinelibrary.wiley.com/doi/10.1002/cpe.4427},
doi = {doi.org/10.1002/cpe.4427},
year = {2018},
date = {2018-01-24},
urldate = {2018-01-01},
journal = {Concurrency and Computation: Practice and Experience},
volume = {30},
number = {7},
pages = {e4427},
abstract = {In the pure technological era we are living, the need for appropriate tools, methods, and approaches that could boost and skyrocket real world various applications is of paramount importance even for daily life. Toward this direction, in the up-to-date literature, several computational tools are offered, new advanced nearly real-time performing techniques are introduced, almost every day, and powerful computing approaches are promising to tackle the issues of performance, energy efficiency, and computational burden, with many different fruitful ways. Nevertheless, most of these demands, trends, and perspectives would have never met the expected outcome without the help of modern high performance computing systems able to model and simulate computationally intensive scientific applications in the most efficient and appropriate way. Consequently, numerous and various high performance computing approaches like multi-/manycore systems, accelerators, compute clusters, and massively parallel machines, when combined with efficient numerical methods for differential equation systems and native computational paradigms, enable scientists and researchers worldwide to significantly advance the application of computing methodologies in research and industry applications, both in qualitative but mainly in quantitative way.
In this aspect, this Special Issue aimed to offer both scientists and engineers in academy and industry an opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems in High Performance Computing for Modeling and Simulation. Moreover, it was highly related to the corresponding Special Session on High Performance Computing in Modeling and Simulation (HPCMS), within the 23rd Euromicro International Conference on Parallel, Distributed and network-based Processing (PDP), held in Turku, Finland on March 4-6, 2015, and its relevant topics. Eventually, a major part of these topics is covered by the content of the fore-coming Special Issue of Concurrency and Computation: Practice and Experience through eight (8) finally selected papers, all thoroughly reviewed and revised properly as a detailed major extension of their conference papers earlier published in the PDP 2015 proceedings.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
In the pure technological era we are living, the need for appropriate tools, methods, and approaches that could boost and skyrocket real world various applications is of paramount importance even for daily life. Toward this direction, in the up-to-date literature, several computational tools are offered, new advanced nearly real-time performing techniques are introduced, almost every day, and powerful computing approaches are promising to tackle the issues of performance, energy efficiency, and computational burden, with many different fruitful ways. Nevertheless, most of these demands, trends, and perspectives would have never met the expected outcome without the help of modern high performance computing systems able to model and simulate computationally intensive scientific applications in the most efficient and appropriate way. Consequently, numerous and various high performance computing approaches like multi-/manycore systems, accelerators, compute clusters, and massively parallel machines, when combined with efficient numerical methods for differential equation systems and native computational paradigms, enable scientists and researchers worldwide to significantly advance the application of computing methodologies in research and industry applications, both in qualitative but mainly in quantitative way.
In this aspect, this Special Issue aimed to offer both scientists and engineers in academy and industry an opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems in High Performance Computing for Modeling and Simulation. Moreover, it was highly related to the corresponding Special Session on High Performance Computing in Modeling and Simulation (HPCMS), within the 23rd Euromicro International Conference on Parallel, Distributed and network-based Processing (PDP), held in Turku, Finland on March 4-6, 2015, and its relevant topics. Eventually, a major part of these topics is covered by the content of the fore-coming Special Issue of Concurrency and Computation: Practice and Experience through eight (8) finally selected papers, all thoroughly reviewed and revised properly as a detailed major extension of their conference papers earlier published in the PDP 2015 proceedings.
In this aspect, this Special Issue aimed to offer both scientists and engineers in academy and industry an opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems in High Performance Computing for Modeling and Simulation. Moreover, it was highly related to the corresponding Special Session on High Performance Computing in Modeling and Simulation (HPCMS), within the 23rd Euromicro International Conference on Parallel, Distributed and network-based Processing (PDP), held in Turku, Finland on March 4-6, 2015, and its relevant topics. Eventually, a major part of these topics is covered by the content of the fore-coming Special Issue of Concurrency and Computation: Practice and Experience through eight (8) finally selected papers, all thoroughly reviewed and revised properly as a detailed major extension of their conference papers earlier published in the PDP 2015 proceedings.
8.
Sirakoulis G Ch, Hamdioui S
Editorial Note on Memristor Models, Circuits and Architectures Miscellaneous
2016.
@misc{sirakoulis2016editorialb,
title = {Editorial Note on Memristor Models, Circuits and Architectures},
author = {Georgios Ch. Sirakoulis and Said Hamdioui},
url = {http://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-12-number-4-2016/},
year = {2016},
date = {2016-08-01},
urldate = {2016-08-01},
journal = {International Journal of Unconventional Computing},
volume = {12},
number = {4},
pages = {247--250},
publisher = {Old City Publishing Inc},
abstract = {On January 2014, in Vienna, Austria, the 1st Workshop on Memristor Technology, Design, Automation and Computing, namely MemTDAC, affiliated with the HiPEAC’14 conference took place. In the quickly advancing field of memristor, the aforementioned workshop tried to provide a European forum to discuss memristor technology and its potential applications. The memristor is an emerging technology, which is triggering intense interdisciplinary activity and has the potential of providing many benefits, such as energy efficiency, density, reconfigurability, nonvolatile memory, novel computational structures and approaches, massive parallelism, etc. These characteristics may force to deeply revise existing computing and storage paradigms. In this context, MemTDAC aimed at creating an European network of competence and experts in all aspects of memristor technology including new memristive device technologies, device modeling and characterization, novel circuit concepts using memristors, memristor-based implication logic, memristor-based storage, neuro-inspired computing, system architectures using memristors, etc.
On October 2014, in the context of Computing Systems Week (CSW) Athens, the Thematic Session on Memristive Computing Architectures: Emergent and Future Challenges took place in Athens, Greece. Having in mind that this specific domain is gaining a continuously increasing interest by the European scientific community working on the design and development of memristor-based circuits and architectures, as was already expressed in the 1st MemTDAC workshop held within HiPEAC 2014 Conference, a series of keynote presenters were invited from a set of representative Universities and Institutes leading different key initiatives. The aim of this thematic session was to pursue the active discussion between key experts about the future perspectives and challenges that are emerging in the very timely research field of memristive computing architectures and memory systems, especially towards high performance computing.
Both events, through their programs provided insights into the current state of memristor research with inspiring invited talks and technical presentations from well known experts in the field. The events promoted lively discussion and inspiration to learn more about memristor technology, models, design, automation and computing as well as the challenges and barriers researchers face in achieving all aspects of memristor technology. Consequently, the final feeling about these events was that they really succeeded in gathering several people in Europe working on memristors across different design and application domains, and in reaching an agreement on the current and future challenges for the development of this field. The events also served as networking events as thorough technical discussions prompted after the events concluded.
In the view of the foregoing, we are delighted to bring to your attention this Special Issue of five papers dealing with memristor models, circuits, architectures and applications that were invited to be part of a volume of about one hundred pages. The submitted papers were thoroughly reviewed and meticulously revised as a detailed major extension of their previously presented abstracts in the context of MemTDAC 2014 and the Thematic Session on Athens CSW 2014, all organized under the umbrella of HiPEAC network.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
On January 2014, in Vienna, Austria, the 1st Workshop on Memristor Technology, Design, Automation and Computing, namely MemTDAC, affiliated with the HiPEAC’14 conference took place. In the quickly advancing field of memristor, the aforementioned workshop tried to provide a European forum to discuss memristor technology and its potential applications. The memristor is an emerging technology, which is triggering intense interdisciplinary activity and has the potential of providing many benefits, such as energy efficiency, density, reconfigurability, nonvolatile memory, novel computational structures and approaches, massive parallelism, etc. These characteristics may force to deeply revise existing computing and storage paradigms. In this context, MemTDAC aimed at creating an European network of competence and experts in all aspects of memristor technology including new memristive device technologies, device modeling and characterization, novel circuit concepts using memristors, memristor-based implication logic, memristor-based storage, neuro-inspired computing, system architectures using memristors, etc.
On October 2014, in the context of Computing Systems Week (CSW) Athens, the Thematic Session on Memristive Computing Architectures: Emergent and Future Challenges took place in Athens, Greece. Having in mind that this specific domain is gaining a continuously increasing interest by the European scientific community working on the design and development of memristor-based circuits and architectures, as was already expressed in the 1st MemTDAC workshop held within HiPEAC 2014 Conference, a series of keynote presenters were invited from a set of representative Universities and Institutes leading different key initiatives. The aim of this thematic session was to pursue the active discussion between key experts about the future perspectives and challenges that are emerging in the very timely research field of memristive computing architectures and memory systems, especially towards high performance computing.
Both events, through their programs provided insights into the current state of memristor research with inspiring invited talks and technical presentations from well known experts in the field. The events promoted lively discussion and inspiration to learn more about memristor technology, models, design, automation and computing as well as the challenges and barriers researchers face in achieving all aspects of memristor technology. Consequently, the final feeling about these events was that they really succeeded in gathering several people in Europe working on memristors across different design and application domains, and in reaching an agreement on the current and future challenges for the development of this field. The events also served as networking events as thorough technical discussions prompted after the events concluded.
In the view of the foregoing, we are delighted to bring to your attention this Special Issue of five papers dealing with memristor models, circuits, architectures and applications that were invited to be part of a volume of about one hundred pages. The submitted papers were thoroughly reviewed and meticulously revised as a detailed major extension of their previously presented abstracts in the context of MemTDAC 2014 and the Thematic Session on Athens CSW 2014, all organized under the umbrella of HiPEAC network.
On October 2014, in the context of Computing Systems Week (CSW) Athens, the Thematic Session on Memristive Computing Architectures: Emergent and Future Challenges took place in Athens, Greece. Having in mind that this specific domain is gaining a continuously increasing interest by the European scientific community working on the design and development of memristor-based circuits and architectures, as was already expressed in the 1st MemTDAC workshop held within HiPEAC 2014 Conference, a series of keynote presenters were invited from a set of representative Universities and Institutes leading different key initiatives. The aim of this thematic session was to pursue the active discussion between key experts about the future perspectives and challenges that are emerging in the very timely research field of memristive computing architectures and memory systems, especially towards high performance computing.
Both events, through their programs provided insights into the current state of memristor research with inspiring invited talks and technical presentations from well known experts in the field. The events promoted lively discussion and inspiration to learn more about memristor technology, models, design, automation and computing as well as the challenges and barriers researchers face in achieving all aspects of memristor technology. Consequently, the final feeling about these events was that they really succeeded in gathering several people in Europe working on memristors across different design and application domains, and in reaching an agreement on the current and future challenges for the development of this field. The events also served as networking events as thorough technical discussions prompted after the events concluded.
In the view of the foregoing, we are delighted to bring to your attention this Special Issue of five papers dealing with memristor models, circuits, architectures and applications that were invited to be part of a volume of about one hundred pages. The submitted papers were thoroughly reviewed and meticulously revised as a detailed major extension of their previously presented abstracts in the context of MemTDAC 2014 and the Thematic Session on Athens CSW 2014, all organized under the umbrella of HiPEAC network.
7.
Sirakoulis G Ch, Was J, Wainer G A
Discrete Modeling and Simulation [Guest editors' introduction] Miscellaneous
2016.
@misc{sirakoulis2016discrete,
title = {Discrete Modeling and Simulation [Guest editors' introduction]},
author = {Georgios Ch. Sirakoulis and Jaroslaw Was and Gabriel A Wainer},
url = {https://ieeexplore.ieee.org/document/7499792},
doi = {10.1109/MCSE.2016.68},
year = {2016},
date = {2016-06-24},
urldate = {2016-06-24},
journal = {Computing in Science \& Engineering},
volume = {18},
number = {4},
pages = {8--10},
publisher = {IEEE},
abstract = {This special issue of CiSE magazine deals with the application of discrete modeling and simulation tools to problems from different fields, including physics, engineering, environment science, social science, and life sciences. Many of the authors highlighted here examine the computing abilities and principles of discrete models with a focus on their expressive dynamics, their emergent computation, and their inherent parallelism, making them suitable for high-performance computing. Such models can also successfully tackle the computational bottleneck in terms of the complexity inherent in so many mesh-based and analytical numerical simulations.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This special issue of CiSE magazine deals with the application of discrete modeling and simulation tools to problems from different fields, including physics, engineering, environment science, social science, and life sciences. Many of the authors highlighted here examine the computing abilities and principles of discrete models with a focus on their expressive dynamics, their emergent computation, and their inherent parallelism, making them suitable for high-performance computing. Such models can also successfully tackle the computational bottleneck in terms of the complexity inherent in so many mesh-based and analytical numerical simulations.
6.
Sirakoulis G Ch, Was J
Editorial Note on Cellular Automata in Theoretical Computer Science Miscellaneous
2016.
@misc{sirakoulis2016editorial,
title = {Editorial Note on Cellular Automata in Theoretical Computer Science},
author = {Georgios Ch. Sirakoulis and Jaroslaw Was},
url = {https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-12-number-1-2-2016/jca-12-1-2-p-1-5/},
year = {2016},
date = {2016-03-01},
urldate = {2016-01-01},
journal = {Journal of Cellular Automata},
volume = {12},
number = {1-2},
pages = {1--5},
publisher = {Old City Publishing Inc},
abstract = {Cellular Automata (CA) during the last decades have been awarded with a lot of attention, not only because they have been considered as a ubiquitous modeling and simulation computational tool for numerous physical phenomena, systems and processes, but in general as powerful theoretical and practical computational systems. CA, proposed more than half a century ago by the father of modern computer science von Neumann [1] and his colleague Ulam [2], have been claimed as powerful computational engines, as discrete dynamical system simulators, as conceptual vehicles for studying pattern formation and complexity and as original models of fundamental physics [3]. As Turing-machine like systems, CA are able to perform computation in an abstract and discrete manner. It is clear that CA computational approach can be considered universal so easily applied to numerous different and interdisciplinary fields like the ones of computer science, physics, biology, chemistry, medicine, arts, engineering, communication, cultural heritage, ecology, economy, geology, sociology, just to name a few of their potential application fields.
It the view of the foregoing, ACRI (Cellular Automata for Research and Industry) Conference, the most prestigious and well established conference of the CA community has attracted the interest of scientists practitioners and engineers both from academies and industries. Starting back from 1994, ACRI has successfully managed to refer and interact with an ever-growing community and has raised the knowledge and interest in the study of CA to broader audience. In such a sense, the 11th edition of ACRI 2014 Conference, organized by AGH University of Science and Technology, took place in Krakow, Poland on September 24-27 2014, and was the eleventh in a series of successful ACRI conferences inaugurated in 1994 in Rende, Italy, and followed by ACRI 1996 in Milan (Italy), ACRI 1998 in Trieste (Italy), ACRI 2000 in Karlsruhe (Germany), ACRI 2002 in Geneva (Switzerland), ACRI 2004 in Amsterdam (The Netherlands), ACRI 2006 in Perpignan (France), ACRI 2008 in Yokohama (Japan) and ACRI 2010 in Ascoli Piceno (Italy) and ACRI 2012 in Santorini Island, Greece. As before, the main goal of the ACRI 2014 Conference was to provide the broader scientific community with the opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems with the help of CA concept.
In this Special Issue, eight papers dealing with CA and computer science were selected and invited to be part of a volume of about one hundred and fifty five pages. All the submitted papers were thoroughly reviewed and meticulously revised as a detailed major extension of their conference papers published earlier in the ACRI 2014 proceedings [4].},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Cellular Automata (CA) during the last decades have been awarded with a lot of attention, not only because they have been considered as a ubiquitous modeling and simulation computational tool for numerous physical phenomena, systems and processes, but in general as powerful theoretical and practical computational systems. CA, proposed more than half a century ago by the father of modern computer science von Neumann [1] and his colleague Ulam [2], have been claimed as powerful computational engines, as discrete dynamical system simulators, as conceptual vehicles for studying pattern formation and complexity and as original models of fundamental physics [3]. As Turing-machine like systems, CA are able to perform computation in an abstract and discrete manner. It is clear that CA computational approach can be considered universal so easily applied to numerous different and interdisciplinary fields like the ones of computer science, physics, biology, chemistry, medicine, arts, engineering, communication, cultural heritage, ecology, economy, geology, sociology, just to name a few of their potential application fields.
It the view of the foregoing, ACRI (Cellular Automata for Research and Industry) Conference, the most prestigious and well established conference of the CA community has attracted the interest of scientists practitioners and engineers both from academies and industries. Starting back from 1994, ACRI has successfully managed to refer and interact with an ever-growing community and has raised the knowledge and interest in the study of CA to broader audience. In such a sense, the 11th edition of ACRI 2014 Conference, organized by AGH University of Science and Technology, took place in Krakow, Poland on September 24-27 2014, and was the eleventh in a series of successful ACRI conferences inaugurated in 1994 in Rende, Italy, and followed by ACRI 1996 in Milan (Italy), ACRI 1998 in Trieste (Italy), ACRI 2000 in Karlsruhe (Germany), ACRI 2002 in Geneva (Switzerland), ACRI 2004 in Amsterdam (The Netherlands), ACRI 2006 in Perpignan (France), ACRI 2008 in Yokohama (Japan) and ACRI 2010 in Ascoli Piceno (Italy) and ACRI 2012 in Santorini Island, Greece. As before, the main goal of the ACRI 2014 Conference was to provide the broader scientific community with the opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems with the help of CA concept.
In this Special Issue, eight papers dealing with CA and computer science were selected and invited to be part of a volume of about one hundred and fifty five pages. All the submitted papers were thoroughly reviewed and meticulously revised as a detailed major extension of their conference papers published earlier in the ACRI 2014 proceedings [4].
It the view of the foregoing, ACRI (Cellular Automata for Research and Industry) Conference, the most prestigious and well established conference of the CA community has attracted the interest of scientists practitioners and engineers both from academies and industries. Starting back from 1994, ACRI has successfully managed to refer and interact with an ever-growing community and has raised the knowledge and interest in the study of CA to broader audience. In such a sense, the 11th edition of ACRI 2014 Conference, organized by AGH University of Science and Technology, took place in Krakow, Poland on September 24-27 2014, and was the eleventh in a series of successful ACRI conferences inaugurated in 1994 in Rende, Italy, and followed by ACRI 1996 in Milan (Italy), ACRI 1998 in Trieste (Italy), ACRI 2000 in Karlsruhe (Germany), ACRI 2002 in Geneva (Switzerland), ACRI 2004 in Amsterdam (The Netherlands), ACRI 2006 in Perpignan (France), ACRI 2008 in Yokohama (Japan) and ACRI 2010 in Ascoli Piceno (Italy) and ACRI 2012 in Santorini Island, Greece. As before, the main goal of the ACRI 2014 Conference was to provide the broader scientific community with the opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems with the help of CA concept.
In this Special Issue, eight papers dealing with CA and computer science were selected and invited to be part of a volume of about one hundred and fifty five pages. All the submitted papers were thoroughly reviewed and meticulously revised as a detailed major extension of their conference papers published earlier in the ACRI 2014 proceedings [4].
5.
Wąs J, Sirakoulis G Ch
Special issue on Simulation with Cellular Automata Miscellaneous
2016.
@misc{wkas2016special,
title = {Special issue on Simulation with Cellular Automata},
author = {Jaros\law W\k{a}s and Georgios Ch. Sirakoulis},
url = {https://journals.sagepub.com/doi/full/10.1177/0037549716629473},
doi = {doi.org/10.1177/0037549716629473},
year = {2016},
date = {2016-02-08},
urldate = {2016-02-08},
journal = {Simulation},
volume = {92},
number = {2},
pages = {99--100},
publisher = {SAGE Publications},
abstract = {Cellular Automata (CA) are discrete dynamical systems. The definition of relatively simple, local interactions results in complex global behaviors of the whole system. This makes it possible to create and study models of many complex systems in different fields such as physics, engineering, environment science, social science, and life sciences.
Such an approach is very promising, and during the past few decades CA-based modeling has attracted a growing number of researchers and practitioners interested in studying models of complex phenomena. In this special issue entitled “Simulation with Cellular Automata,” we have proceeded with an open-call announcement targeting novel simulation CA-based studies as well as revised and extended papers presented during the 11th International Conference on Cellular Automata for Research and Industry, held at AGH University of Science and Technology in September 2014. After a thorough and meticulous review process, we finally came up with seven (7) accepted papers dealing with various and, in most cases, interdisciplinary topics under the umbrella of CA-based simulation.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Cellular Automata (CA) are discrete dynamical systems. The definition of relatively simple, local interactions results in complex global behaviors of the whole system. This makes it possible to create and study models of many complex systems in different fields such as physics, engineering, environment science, social science, and life sciences.
Such an approach is very promising, and during the past few decades CA-based modeling has attracted a growing number of researchers and practitioners interested in studying models of complex phenomena. In this special issue entitled “Simulation with Cellular Automata,” we have proceeded with an open-call announcement targeting novel simulation CA-based studies as well as revised and extended papers presented during the 11th International Conference on Cellular Automata for Research and Industry, held at AGH University of Science and Technology in September 2014. After a thorough and meticulous review process, we finally came up with seven (7) accepted papers dealing with various and, in most cases, interdisciplinary topics under the umbrella of CA-based simulation.
Such an approach is very promising, and during the past few decades CA-based modeling has attracted a growing number of researchers and practitioners interested in studying models of complex phenomena. In this special issue entitled “Simulation with Cellular Automata,” we have proceeded with an open-call announcement targeting novel simulation CA-based studies as well as revised and extended papers presented during the 11th International Conference on Cellular Automata for Research and Industry, held at AGH University of Science and Technology in September 2014. After a thorough and meticulous review process, we finally came up with seven (7) accepted papers dealing with various and, in most cases, interdisciplinary topics under the umbrella of CA-based simulation.
4.
Bandini S, Sirakoulis G Ch, Vizzari G
Guests Editors’ Editorial Note on Special Issue of Advances in Cellular Automata Modeling Miscellaneous
2016.
@misc{bandini2016guests,
title = {Guests Editors’ Editorial Note on Special Issue of Advances in Cellular Automata Modeling},
author = {Stefania Bandini and Georgios Ch. Sirakoulis and Giuseppe Vizzari},
url = {https://dl.acm.org/doi/10.1145/2856511},
doi = {doi.org/10.1145/2856511},
year = {2016},
date = {2016-01-13},
urldate = {2016-01-01},
journal = {ACM Transactions on Modeling and Computer Simulation (TOMACS)},
volume = {26},
number = {3},
pages = {17},
publisher = {ACM},
abstract = {Starting from the previous century up to today, various modeling prototypes with unique features, special characteristics, and well-established computation abilities have been introduced to the scientific society as tentative computation alternatives to differential and partial differential equations used to describe physical systems and processes. Among them, a model originally conceived by famous John von Neumann, namely Cellular Automata (CA), due to its inherent impressive abilities managed to provide scientists and practitioners with an efficient modeling framework for a variety
of applications, very often of interdisciplinary nature. Indeed, although the CA field is considered to be a relatively old and established one, these simple but powerful systems and their most recent variations that simulate macroscopic processes from numerous elementary and local interactions continue to attract the interest of researchers after their original introduction. Using the words of Nobelist Richard Feynman, “CA are very effective in simulating physical systems and solving scientific problems, because they can capture the essential features of systems where global behaviour arises from the collective effect of simple components which interact locally.”
In this context, in the last decades, the International Conference on Cellular Automata for Research and Industry (ACRI) series of conferences has been an internationally renowned forum for all those interested in the theory and applications of CA, including CA tools and computational sciences. It is also concerned with applications and solutions of problems from the fields of arts, biology, chemistry, communication, cultural heritage, ecology, economy, geology, engineering, computer science, medicine, physics, sociology, and so on, allowing scholars coming from different studies and experience in CA to discuss and merge their competencies and results, to identify new issues, and to enlarge the research fields of CA. Taking the initiation from the 10th edition of the ACRI 2012 Conference that took place in Santorini Island, Greece, in September 2012, an open call was announced for the submission of papers either related with the CA papers of the ACRI 2012 Conference or unpublished high-quality works strongly related to the modeling aspects of CA in any field of physics, engineering, environment science, social science, and life science. As a result, we finally ended with four intriguing and mostly CA-based papers that constitute this Special Issue of Advances in Cellular Automata Modeling in ACM TOMACS.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Starting from the previous century up to today, various modeling prototypes with unique features, special characteristics, and well-established computation abilities have been introduced to the scientific society as tentative computation alternatives to differential and partial differential equations used to describe physical systems and processes. Among them, a model originally conceived by famous John von Neumann, namely Cellular Automata (CA), due to its inherent impressive abilities managed to provide scientists and practitioners with an efficient modeling framework for a variety
of applications, very often of interdisciplinary nature. Indeed, although the CA field is considered to be a relatively old and established one, these simple but powerful systems and their most recent variations that simulate macroscopic processes from numerous elementary and local interactions continue to attract the interest of researchers after their original introduction. Using the words of Nobelist Richard Feynman, “CA are very effective in simulating physical systems and solving scientific problems, because they can capture the essential features of systems where global behaviour arises from the collective effect of simple components which interact locally.”
In this context, in the last decades, the International Conference on Cellular Automata for Research and Industry (ACRI) series of conferences has been an internationally renowned forum for all those interested in the theory and applications of CA, including CA tools and computational sciences. It is also concerned with applications and solutions of problems from the fields of arts, biology, chemistry, communication, cultural heritage, ecology, economy, geology, engineering, computer science, medicine, physics, sociology, and so on, allowing scholars coming from different studies and experience in CA to discuss and merge their competencies and results, to identify new issues, and to enlarge the research fields of CA. Taking the initiation from the 10th edition of the ACRI 2012 Conference that took place in Santorini Island, Greece, in September 2012, an open call was announced for the submission of papers either related with the CA papers of the ACRI 2012 Conference or unpublished high-quality works strongly related to the modeling aspects of CA in any field of physics, engineering, environment science, social science, and life science. As a result, we finally ended with four intriguing and mostly CA-based papers that constitute this Special Issue of Advances in Cellular Automata Modeling in ACM TOMACS.
of applications, very often of interdisciplinary nature. Indeed, although the CA field is considered to be a relatively old and established one, these simple but powerful systems and their most recent variations that simulate macroscopic processes from numerous elementary and local interactions continue to attract the interest of researchers after their original introduction. Using the words of Nobelist Richard Feynman, “CA are very effective in simulating physical systems and solving scientific problems, because they can capture the essential features of systems where global behaviour arises from the collective effect of simple components which interact locally.”
In this context, in the last decades, the International Conference on Cellular Automata for Research and Industry (ACRI) series of conferences has been an internationally renowned forum for all those interested in the theory and applications of CA, including CA tools and computational sciences. It is also concerned with applications and solutions of problems from the fields of arts, biology, chemistry, communication, cultural heritage, ecology, economy, geology, engineering, computer science, medicine, physics, sociology, and so on, allowing scholars coming from different studies and experience in CA to discuss and merge their competencies and results, to identify new issues, and to enlarge the research fields of CA. Taking the initiation from the 10th edition of the ACRI 2012 Conference that took place in Santorini Island, Greece, in September 2012, an open call was announced for the submission of papers either related with the CA papers of the ACRI 2012 Conference or unpublished high-quality works strongly related to the modeling aspects of CA in any field of physics, engineering, environment science, social science, and life science. As a result, we finally ended with four intriguing and mostly CA-based papers that constitute this Special Issue of Advances in Cellular Automata Modeling in ACM TOMACS.
3.
Wąs J, Sirakoulis G Ch
Cellular Automata Applications for Research and Industry Miscellaneous
2015.
@misc{wkas2015cellular,
title = {Cellular Automata Applications for Research and Industry},
author = {Jaros\law W\k{a}s and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/pii/S1877750315001313?via%3Dihub},
doi = {doi.org/10.1016/j.jocs.2015.10.005},
year = {2015},
date = {2015-12-17},
urldate = {2015-12-17},
journal = {Journal of Computational Science},
volume = {11},
pages = {223--225},
publisher = {Elsevier},
abstract = {For several decades the Cellular Automata (CA) modeling approach has been proven to be self-sufficient to inspire modelers and practitioners on how to apply successfully their ideas on modern computational platforms by using their inherent parallelism enabling high performance computing and modeling. One can easily describe CA as a mature parallel computational system robust enough to evolve or better say to adapt itself to the new computing paradigms of multiprocessors and graphical processing units with noteworthy efficacy and admirable modeling results. This Special Section is exactly dedicated to the application of CA paradigm to research and industry containing extended versions of papers originally published in proceedings of 11th International Conference on Cellular Automata for Research and Industry (ACRI 2014), a biannual conference dedicated to CA theory and applications, including also papers submitted in reference to the corresponding open Call for Papers in the context of Journal of Computational Science.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
For several decades the Cellular Automata (CA) modeling approach has been proven to be self-sufficient to inspire modelers and practitioners on how to apply successfully their ideas on modern computational platforms by using their inherent parallelism enabling high performance computing and modeling. One can easily describe CA as a mature parallel computational system robust enough to evolve or better say to adapt itself to the new computing paradigms of multiprocessors and graphical processing units with noteworthy efficacy and admirable modeling results. This Special Section is exactly dedicated to the application of CA paradigm to research and industry containing extended versions of papers originally published in proceedings of 11th International Conference on Cellular Automata for Research and Industry (ACRI 2014), a biannual conference dedicated to CA theory and applications, including also papers submitted in reference to the corresponding open Call for Papers in the context of Journal of Computational Science.
2.
Sirakoulis G Ch, Lehtonen E
Computational structures and methods with memristive devices and systems Miscellaneous
2014.
@misc{sirakoulis2014computational,
title = {Computational structures and methods with memristive devices and systems},
author = {Georgios Ch. Sirakoulis and Eero Lehtonen},
url = {https://www.sciencedirect.com/science/article/pii/S0026269214002985},
doi = {doi.org/10.1016/j.mejo.2014.10.006},
year = {2014},
date = {2014-12-03},
urldate = {2014-01-01},
journal = {Microelectronics Journal},
volume = {45},
number = {11},
pages = {1361--1362},
publisher = {Elsevier Science Publishers BV},
abstract = {Outline of the Special Issue.
This Microelectronics Journal׳s special issue addresses computational structures and methodologies that use the memristor as a fundamental computational primitive. Emerging chip technologies that utilize novel devices and materials are becoming attractive alternatives to the conventional CMOS technology, which is challenged by technological and physical limits. Moving beyond today׳s silicon integrated chip technology requires the shrinking of circuits to the scale of a few nanometers. Novel devices and architectures \textendash such as the ones described in this special issue \textendash will be needed to satisfy the growing demands for high performance electronic applications.
As defined in Ref. [13], we consider all two-terminal non-volatile resistive memory devices as memristors. This emerging technology allows for efficient realization of circuits that have been considered inefficient using conventional CMOS approach. For example, memristor technology allows for an efficient programmable communications network to be formed on top of CMOS circuitry in so-called CMOL architectures [14]. Proposed memristive computing systems range from memory and reconfigurable logic to neuromorphic engineering. Being nonvolatile nanoscale memory devices, memristors can be used to improve the performance of existing computational structures, but also to facilitate new computational paradigms and methods that exploit the unique features of these novel electronic devices.
As a sequel to the ICECS 2013 Special Session on Memristor Devices and Logic, held in Abu Dhabi, UAE on December 8\textendash12, our goal in organizing this Microelectronic Journal׳s special issue was to gather publications advancing memristor research from both a theoretical and application point of view. We are pleased to say that this goal was achieved by the 10 excellent contributions presented in this issue, briefly summarized in the following.
The first three papers present circuit theoretical considerations of memristors, memcapacitors, and networks of memristors, respectively. The next three papers are experimental and consider foldable memristors, organic memristors, and emergent spiking activity in memristors. The subsequent three papers discuss digital logic computing with memristors, and finally, the last paper describes a novel neuro-fuzzy clustering method and its memristive implementation. As noted above, neuromorphic engineering is one of the application areas of memristor technology; this topic is considered in fourth, sixth and tenth papers [4], [6], [10] of this special issue. In the following, we describe each of the papers in the order they are presented:
The first paper by Georgiou et al. [1] provides a theoretical analysis on memristor ideality and reciprocity. Reciprocality in this context means that if the output of a memristor is used to drive another memristor, the output of the second memristor exactly reproduces the waveform used to drive the first device. The authors show that this reciprocity condition holds for two ideal and identical memristors with the same initial memristance, and then consider the effect of nonidealities on reciprocality. Encryption is proposed as a possible application of the considered phenomenon.
The second paper by Fouda and Radwan [2] presents a mathematical analysis of memcapacitor using a linear dopant model. They investigate responses of the memcapacitor under DC step and periodic signals. Furthermore, series and parallel memcapacitive circuits are analyzed. Closed-form mathematical expressions of the analyzed cases are presented and compared with SPICE simulations.
Composite networks of threshold-type memristive devices are investigated in the third paper by Vourkas and Sirakoulis [3]. The authors present a general design methodology for the creation of composite memristive systems, and for understanding the rich current\textendashvoltage dynamics originating from these systems. Moreover, composite networks of memristors for computational applications, such as a multi-level memristive switch that could be used in memristive DAC circuits, are discussed.
Gnoheim et al. present the fabrication of foldable memristive devices on bulk mono-crystalline silicon using standard CMOS processes in the fourth paper [4]. The presented methodology is interesting for example in the context of neuromorphic systems, as it enables the fabrication of flexible and folded structures required to match cerebral cortex׳s topological pattern. The results show that the basic memristive current\textendashvoltage characteristics of these foldable devices match their bulk counterparts.
The experiment-based paper, i.e. the fifth paper by Dimonte et al. [5] presents measurements on organic memristors formed as a heterojunction of polyaniline and polyethylene oxide doped with lithium salt. In these measurements, electronic and ionic hysteresis current curves are determined with respect to different time delays in the input voltage signal. Moreover, cross-talk between two serially connected organic memristors is investigated.
In the sixth paper, Gale et al. [6] investigate the emergence of spiking activity in memristive circuits. Titanium dioxide-based devices are fabricated and wired up as circuits containing anti-series and anti-parallel interactions. The authors consider emerging spiking dynamics in the measured circuits, and analyze these dynamics with statistical methods and by introducing the concept of compositional complexity of memristive circuits. Different mechanisms for the measured spiking activity are discussed.
Comparison of two sequential memristive logic approaches \textendash the so-called stateful logic approach of Ref. [12], and the complementary switch-based concept originally presented in Ref. [15] \textendash is performed in the seventh paper by Ferch et al. [7]. Crucial requirements for these methods for example in terms of allowable line resistances, voltage schemes, and the need for additional selector devices are determined. A dynamical SPICE model of the considered electrochemical metallization memristor is presented, and the use of the considered logic operations in passive crossbar arrays is discussed.
In the eighth paper, Levy et al. [8] present a memristive realization of the Akers logic array [11], which can realize any Boolean function. The resulting computational structure is non-von Neumann-type, and the memristive realization significantly reduces the area, and yields power and memory bandwidth improvements, as compared to realizations with conventional CMOS technology. SPICE simulations of the considered circuit structure are performed, and implementations of a two-input XOR and a four-bit sorting function are presented as computational examples.
Memristive logic array computing is also considered in the ninth paper by Lehtonen et al., [9] in which a novel cellular CMOL logic computing architecture is presented. The proposed architecture allows performing vectorized stateful logic operations on rows or columns of memristors. It consists of a multitude of small memristive crossbars, which can be logically combined into larger structures by using CMOS circuitry. Such configurable granularity allows for mixed local and global computations to be performed in the array, and as an example of this the implementation of a content-addressable memory is described.
Finally, a spiking neuro-fuzzy clustering system and its memristive implementation is described in the tenth paper by Bavandpour et al. [10]. The proposed system maps the concept of distance in multidimensional analog spaces to the concept of dissimilarity in binary vector spaces, and is implemented using spike-based computing and an appropriate learning algorithm. The effectiveness of the proposed clustering system is assessed in various clustering tasks, and a CMOL-type memristive realization is presented.
As a conclusion, we note that the above summarized contributions provide interesting and useful insight into various aspects of memristor research. We would like to thank the authors for their contributions, and all of the reviewers for helping us to assemble such a high quality selection of articles.
References
[1]
Panayiotis, S. Georgiou, Mauricio Barahona, Sophia N. Yaliraki, Emmanuel M. Drakakis, On memristor ideality and reciprocity, Microelectron J. 45 1363\textendash1371
Google Scholar
[2]
Mohamed E. Fouda, Ahmed G. Radwan, Memcapacitor response under step and sinusoidal voltage excitations, Microelectron J. 45 1372\textendash1379
Google Scholar
[3]
Ioannis Vourkas, Georgios Ch. Sirakoulis, On the generalization of composite memristive network structures for computational analog/digital circuits and systems, Microelectron J. 45 1380\textendash1391
Google Scholar
[4]
T. Ghoneim, Mohammed A. Zidan, Khaled N. Salama, Muhammad M.Hussain, Towards neuromorphic electronics: memristors on foldable silicon fabric, Microelectron J. 45 1392\textendash1395
Google Scholar
[5]
Dr. Alice Dimonte, Tatiana Berzina , Maura Pavesi, Victor Erokhin, Hysteresis loop and cross-talk of organic memristive devices, Microelectron J. 45 1396\textendash1400
Google Scholar
[6]
Dr. Ella Gale, Bende Lacy Costello, Andrew Adamatzky, Emergent spiking in non-ideal memristor networks, Microelectron J. 45 1401\textendash1415
Google Scholar
[7]
S. Ferch, E.Linn, R.Waser, S.Menzel, Simulation and comparison of two sequential logic-in-memory approaches using a dynamic electrochemical metallization cell model, Microelectron J. 45 1416\textendash1428
Google Scholar
[8]
Yifat Levy, Jehoshua Bruck, Yuval Cassuto, Eby G. Friedman, Avinoam Kolodny, Eitan Yaakobi, Shahar Kvatinsky, Logic operations in memory using a memristive akers array, Microelectron J. 45 1429\textendash1437
Google Scholar
[9]
Eero Lehtonen, Jari Tissari, Jussi Poikonen, Mika Laiho, Lauri Koskinen, A cellular computing architecture for parallel memristive stateful logic, Microelectron J. 45 1438\textendash1449
Google Scholar
[10]
Mohammad Bavandpour, Saeed Bagheri-Shouraki, Hamid Soleimani, Arash Ahmadi, Bernab\'{e} Linares-Barranco, Spiking neuro-fuzzy clustering system and its memristor crossbar based implementation, Microelectron J. 45 1450\textendash1462
Google Scholar
[11]
S.B. Akers Jr.
A rectangular logic array
IEEE Trans. Comput., C-21 (8) (1972), pp. 848-857
View Record in ScopusGoogle Scholar
[12]
J. Borghetti, G.S. Snider, P.J. Kuekes, J.J. Yang, D.R. Stewart, R.S. Williams
Memristive switches enable stateful logic operations via material implication
Nature, 464 (2010), pp. 873-876
CrossRefView Record in ScopusGoogle Scholar
[13]
L. Chua
Resistance switching memories are memristors
Appl. Phys. A, 102 (4) (2011), pp. 765-783
CrossRefView Record in ScopusGoogle Scholar
[14]
K.K. Likharev, D.B. Strukov
CMOL: devices, circuits, and architectures
G. Cuniberti, G. Fagas, K. Richter (Eds.), Introducing Molecular Electronics, Springer, Berlin (2005), pp. 447-478
Google Scholar
[15]
E. Linn, R. Rosezin, S. Tappertzhofen, U. Bttger, R. Waser
Beyond von Neumann \textendash logic operations in passive crossbar arrays alongside memory operations
Nanotechnology, 23 (30) (2012)
6 pp
Google Scholar},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Outline of the Special Issue.
This Microelectronics Journal׳s special issue addresses computational structures and methodologies that use the memristor as a fundamental computational primitive. Emerging chip technologies that utilize novel devices and materials are becoming attractive alternatives to the conventional CMOS technology, which is challenged by technological and physical limits. Moving beyond today׳s silicon integrated chip technology requires the shrinking of circuits to the scale of a few nanometers. Novel devices and architectures – such as the ones described in this special issue – will be needed to satisfy the growing demands for high performance electronic applications.
As defined in Ref. [13], we consider all two-terminal non-volatile resistive memory devices as memristors. This emerging technology allows for efficient realization of circuits that have been considered inefficient using conventional CMOS approach. For example, memristor technology allows for an efficient programmable communications network to be formed on top of CMOS circuitry in so-called CMOL architectures [14]. Proposed memristive computing systems range from memory and reconfigurable logic to neuromorphic engineering. Being nonvolatile nanoscale memory devices, memristors can be used to improve the performance of existing computational structures, but also to facilitate new computational paradigms and methods that exploit the unique features of these novel electronic devices.
As a sequel to the ICECS 2013 Special Session on Memristor Devices and Logic, held in Abu Dhabi, UAE on December 8–12, our goal in organizing this Microelectronic Journal׳s special issue was to gather publications advancing memristor research from both a theoretical and application point of view. We are pleased to say that this goal was achieved by the 10 excellent contributions presented in this issue, briefly summarized in the following.
The first three papers present circuit theoretical considerations of memristors, memcapacitors, and networks of memristors, respectively. The next three papers are experimental and consider foldable memristors, organic memristors, and emergent spiking activity in memristors. The subsequent three papers discuss digital logic computing with memristors, and finally, the last paper describes a novel neuro-fuzzy clustering method and its memristive implementation. As noted above, neuromorphic engineering is one of the application areas of memristor technology; this topic is considered in fourth, sixth and tenth papers [4], [6], [10] of this special issue. In the following, we describe each of the papers in the order they are presented:
The first paper by Georgiou et al. [1] provides a theoretical analysis on memristor ideality and reciprocity. Reciprocality in this context means that if the output of a memristor is used to drive another memristor, the output of the second memristor exactly reproduces the waveform used to drive the first device. The authors show that this reciprocity condition holds for two ideal and identical memristors with the same initial memristance, and then consider the effect of nonidealities on reciprocality. Encryption is proposed as a possible application of the considered phenomenon.
The second paper by Fouda and Radwan [2] presents a mathematical analysis of memcapacitor using a linear dopant model. They investigate responses of the memcapacitor under DC step and periodic signals. Furthermore, series and parallel memcapacitive circuits are analyzed. Closed-form mathematical expressions of the analyzed cases are presented and compared with SPICE simulations.
Composite networks of threshold-type memristive devices are investigated in the third paper by Vourkas and Sirakoulis [3]. The authors present a general design methodology for the creation of composite memristive systems, and for understanding the rich current–voltage dynamics originating from these systems. Moreover, composite networks of memristors for computational applications, such as a multi-level memristive switch that could be used in memristive DAC circuits, are discussed.
Gnoheim et al. present the fabrication of foldable memristive devices on bulk mono-crystalline silicon using standard CMOS processes in the fourth paper [4]. The presented methodology is interesting for example in the context of neuromorphic systems, as it enables the fabrication of flexible and folded structures required to match cerebral cortex׳s topological pattern. The results show that the basic memristive current–voltage characteristics of these foldable devices match their bulk counterparts.
The experiment-based paper, i.e. the fifth paper by Dimonte et al. [5] presents measurements on organic memristors formed as a heterojunction of polyaniline and polyethylene oxide doped with lithium salt. In these measurements, electronic and ionic hysteresis current curves are determined with respect to different time delays in the input voltage signal. Moreover, cross-talk between two serially connected organic memristors is investigated.
In the sixth paper, Gale et al. [6] investigate the emergence of spiking activity in memristive circuits. Titanium dioxide-based devices are fabricated and wired up as circuits containing anti-series and anti-parallel interactions. The authors consider emerging spiking dynamics in the measured circuits, and analyze these dynamics with statistical methods and by introducing the concept of compositional complexity of memristive circuits. Different mechanisms for the measured spiking activity are discussed.
Comparison of two sequential memristive logic approaches – the so-called stateful logic approach of Ref. [12], and the complementary switch-based concept originally presented in Ref. [15] – is performed in the seventh paper by Ferch et al. [7]. Crucial requirements for these methods for example in terms of allowable line resistances, voltage schemes, and the need for additional selector devices are determined. A dynamical SPICE model of the considered electrochemical metallization memristor is presented, and the use of the considered logic operations in passive crossbar arrays is discussed.
In the eighth paper, Levy et al. [8] present a memristive realization of the Akers logic array [11], which can realize any Boolean function. The resulting computational structure is non-von Neumann-type, and the memristive realization significantly reduces the area, and yields power and memory bandwidth improvements, as compared to realizations with conventional CMOS technology. SPICE simulations of the considered circuit structure are performed, and implementations of a two-input XOR and a four-bit sorting function are presented as computational examples.
Memristive logic array computing is also considered in the ninth paper by Lehtonen et al., [9] in which a novel cellular CMOL logic computing architecture is presented. The proposed architecture allows performing vectorized stateful logic operations on rows or columns of memristors. It consists of a multitude of small memristive crossbars, which can be logically combined into larger structures by using CMOS circuitry. Such configurable granularity allows for mixed local and global computations to be performed in the array, and as an example of this the implementation of a content-addressable memory is described.
Finally, a spiking neuro-fuzzy clustering system and its memristive implementation is described in the tenth paper by Bavandpour et al. [10]. The proposed system maps the concept of distance in multidimensional analog spaces to the concept of dissimilarity in binary vector spaces, and is implemented using spike-based computing and an appropriate learning algorithm. The effectiveness of the proposed clustering system is assessed in various clustering tasks, and a CMOL-type memristive realization is presented.
As a conclusion, we note that the above summarized contributions provide interesting and useful insight into various aspects of memristor research. We would like to thank the authors for their contributions, and all of the reviewers for helping us to assemble such a high quality selection of articles.
References
[1]
Panayiotis, S. Georgiou, Mauricio Barahona, Sophia N. Yaliraki, Emmanuel M. Drakakis, On memristor ideality and reciprocity, Microelectron J. 45 1363–1371
Google Scholar
[2]
Mohamed E. Fouda, Ahmed G. Radwan, Memcapacitor response under step and sinusoidal voltage excitations, Microelectron J. 45 1372–1379
Google Scholar
[3]
Ioannis Vourkas, Georgios Ch. Sirakoulis, On the generalization of composite memristive network structures for computational analog/digital circuits and systems, Microelectron J. 45 1380–1391
Google Scholar
[4]
T. Ghoneim, Mohammed A. Zidan, Khaled N. Salama, Muhammad M.Hussain, Towards neuromorphic electronics: memristors on foldable silicon fabric, Microelectron J. 45 1392–1395
Google Scholar
[5]
Dr. Alice Dimonte, Tatiana Berzina , Maura Pavesi, Victor Erokhin, Hysteresis loop and cross-talk of organic memristive devices, Microelectron J. 45 1396–1400
Google Scholar
[6]
Dr. Ella Gale, Bende Lacy Costello, Andrew Adamatzky, Emergent spiking in non-ideal memristor networks, Microelectron J. 45 1401–1415
Google Scholar
[7]
S. Ferch, E.Linn, R.Waser, S.Menzel, Simulation and comparison of two sequential logic-in-memory approaches using a dynamic electrochemical metallization cell model, Microelectron J. 45 1416–1428
Google Scholar
[8]
Yifat Levy, Jehoshua Bruck, Yuval Cassuto, Eby G. Friedman, Avinoam Kolodny, Eitan Yaakobi, Shahar Kvatinsky, Logic operations in memory using a memristive akers array, Microelectron J. 45 1429–1437
Google Scholar
[9]
Eero Lehtonen, Jari Tissari, Jussi Poikonen, Mika Laiho, Lauri Koskinen, A cellular computing architecture for parallel memristive stateful logic, Microelectron J. 45 1438–1449
Google Scholar
[10]
Mohammad Bavandpour, Saeed Bagheri-Shouraki, Hamid Soleimani, Arash Ahmadi, Bernabé Linares-Barranco, Spiking neuro-fuzzy clustering system and its memristor crossbar based implementation, Microelectron J. 45 1450–1462
Google Scholar
[11]
S.B. Akers Jr.
A rectangular logic array
IEEE Trans. Comput., C-21 (8) (1972), pp. 848-857
View Record in ScopusGoogle Scholar
[12]
J. Borghetti, G.S. Snider, P.J. Kuekes, J.J. Yang, D.R. Stewart, R.S. Williams
Memristive switches enable stateful logic operations via material implication
Nature, 464 (2010), pp. 873-876
CrossRefView Record in ScopusGoogle Scholar
[13]
L. Chua
Resistance switching memories are memristors
Appl. Phys. A, 102 (4) (2011), pp. 765-783
CrossRefView Record in ScopusGoogle Scholar
[14]
K.K. Likharev, D.B. Strukov
CMOL: devices, circuits, and architectures
G. Cuniberti, G. Fagas, K. Richter (Eds.), Introducing Molecular Electronics, Springer, Berlin (2005), pp. 447-478
Google Scholar
[15]
E. Linn, R. Rosezin, S. Tappertzhofen, U. Bttger, R. Waser
Beyond von Neumann – logic operations in passive crossbar arrays alongside memory operations
Nanotechnology, 23 (30) (2012)
6 pp
Google Scholar
This Microelectronics Journal׳s special issue addresses computational structures and methodologies that use the memristor as a fundamental computational primitive. Emerging chip technologies that utilize novel devices and materials are becoming attractive alternatives to the conventional CMOS technology, which is challenged by technological and physical limits. Moving beyond today׳s silicon integrated chip technology requires the shrinking of circuits to the scale of a few nanometers. Novel devices and architectures – such as the ones described in this special issue – will be needed to satisfy the growing demands for high performance electronic applications.
As defined in Ref. [13], we consider all two-terminal non-volatile resistive memory devices as memristors. This emerging technology allows for efficient realization of circuits that have been considered inefficient using conventional CMOS approach. For example, memristor technology allows for an efficient programmable communications network to be formed on top of CMOS circuitry in so-called CMOL architectures [14]. Proposed memristive computing systems range from memory and reconfigurable logic to neuromorphic engineering. Being nonvolatile nanoscale memory devices, memristors can be used to improve the performance of existing computational structures, but also to facilitate new computational paradigms and methods that exploit the unique features of these novel electronic devices.
As a sequel to the ICECS 2013 Special Session on Memristor Devices and Logic, held in Abu Dhabi, UAE on December 8–12, our goal in organizing this Microelectronic Journal׳s special issue was to gather publications advancing memristor research from both a theoretical and application point of view. We are pleased to say that this goal was achieved by the 10 excellent contributions presented in this issue, briefly summarized in the following.
The first three papers present circuit theoretical considerations of memristors, memcapacitors, and networks of memristors, respectively. The next three papers are experimental and consider foldable memristors, organic memristors, and emergent spiking activity in memristors. The subsequent three papers discuss digital logic computing with memristors, and finally, the last paper describes a novel neuro-fuzzy clustering method and its memristive implementation. As noted above, neuromorphic engineering is one of the application areas of memristor technology; this topic is considered in fourth, sixth and tenth papers [4], [6], [10] of this special issue. In the following, we describe each of the papers in the order they are presented:
The first paper by Georgiou et al. [1] provides a theoretical analysis on memristor ideality and reciprocity. Reciprocality in this context means that if the output of a memristor is used to drive another memristor, the output of the second memristor exactly reproduces the waveform used to drive the first device. The authors show that this reciprocity condition holds for two ideal and identical memristors with the same initial memristance, and then consider the effect of nonidealities on reciprocality. Encryption is proposed as a possible application of the considered phenomenon.
The second paper by Fouda and Radwan [2] presents a mathematical analysis of memcapacitor using a linear dopant model. They investigate responses of the memcapacitor under DC step and periodic signals. Furthermore, series and parallel memcapacitive circuits are analyzed. Closed-form mathematical expressions of the analyzed cases are presented and compared with SPICE simulations.
Composite networks of threshold-type memristive devices are investigated in the third paper by Vourkas and Sirakoulis [3]. The authors present a general design methodology for the creation of composite memristive systems, and for understanding the rich current–voltage dynamics originating from these systems. Moreover, composite networks of memristors for computational applications, such as a multi-level memristive switch that could be used in memristive DAC circuits, are discussed.
Gnoheim et al. present the fabrication of foldable memristive devices on bulk mono-crystalline silicon using standard CMOS processes in the fourth paper [4]. The presented methodology is interesting for example in the context of neuromorphic systems, as it enables the fabrication of flexible and folded structures required to match cerebral cortex׳s topological pattern. The results show that the basic memristive current–voltage characteristics of these foldable devices match their bulk counterparts.
The experiment-based paper, i.e. the fifth paper by Dimonte et al. [5] presents measurements on organic memristors formed as a heterojunction of polyaniline and polyethylene oxide doped with lithium salt. In these measurements, electronic and ionic hysteresis current curves are determined with respect to different time delays in the input voltage signal. Moreover, cross-talk between two serially connected organic memristors is investigated.
In the sixth paper, Gale et al. [6] investigate the emergence of spiking activity in memristive circuits. Titanium dioxide-based devices are fabricated and wired up as circuits containing anti-series and anti-parallel interactions. The authors consider emerging spiking dynamics in the measured circuits, and analyze these dynamics with statistical methods and by introducing the concept of compositional complexity of memristive circuits. Different mechanisms for the measured spiking activity are discussed.
Comparison of two sequential memristive logic approaches – the so-called stateful logic approach of Ref. [12], and the complementary switch-based concept originally presented in Ref. [15] – is performed in the seventh paper by Ferch et al. [7]. Crucial requirements for these methods for example in terms of allowable line resistances, voltage schemes, and the need for additional selector devices are determined. A dynamical SPICE model of the considered electrochemical metallization memristor is presented, and the use of the considered logic operations in passive crossbar arrays is discussed.
In the eighth paper, Levy et al. [8] present a memristive realization of the Akers logic array [11], which can realize any Boolean function. The resulting computational structure is non-von Neumann-type, and the memristive realization significantly reduces the area, and yields power and memory bandwidth improvements, as compared to realizations with conventional CMOS technology. SPICE simulations of the considered circuit structure are performed, and implementations of a two-input XOR and a four-bit sorting function are presented as computational examples.
Memristive logic array computing is also considered in the ninth paper by Lehtonen et al., [9] in which a novel cellular CMOL logic computing architecture is presented. The proposed architecture allows performing vectorized stateful logic operations on rows or columns of memristors. It consists of a multitude of small memristive crossbars, which can be logically combined into larger structures by using CMOS circuitry. Such configurable granularity allows for mixed local and global computations to be performed in the array, and as an example of this the implementation of a content-addressable memory is described.
Finally, a spiking neuro-fuzzy clustering system and its memristive implementation is described in the tenth paper by Bavandpour et al. [10]. The proposed system maps the concept of distance in multidimensional analog spaces to the concept of dissimilarity in binary vector spaces, and is implemented using spike-based computing and an appropriate learning algorithm. The effectiveness of the proposed clustering system is assessed in various clustering tasks, and a CMOL-type memristive realization is presented.
As a conclusion, we note that the above summarized contributions provide interesting and useful insight into various aspects of memristor research. We would like to thank the authors for their contributions, and all of the reviewers for helping us to assemble such a high quality selection of articles.
References
[1]
Panayiotis, S. Georgiou, Mauricio Barahona, Sophia N. Yaliraki, Emmanuel M. Drakakis, On memristor ideality and reciprocity, Microelectron J. 45 1363–1371
Google Scholar
[2]
Mohamed E. Fouda, Ahmed G. Radwan, Memcapacitor response under step and sinusoidal voltage excitations, Microelectron J. 45 1372–1379
Google Scholar
[3]
Ioannis Vourkas, Georgios Ch. Sirakoulis, On the generalization of composite memristive network structures for computational analog/digital circuits and systems, Microelectron J. 45 1380–1391
Google Scholar
[4]
T. Ghoneim, Mohammed A. Zidan, Khaled N. Salama, Muhammad M.Hussain, Towards neuromorphic electronics: memristors on foldable silicon fabric, Microelectron J. 45 1392–1395
Google Scholar
[5]
Dr. Alice Dimonte, Tatiana Berzina , Maura Pavesi, Victor Erokhin, Hysteresis loop and cross-talk of organic memristive devices, Microelectron J. 45 1396–1400
Google Scholar
[6]
Dr. Ella Gale, Bende Lacy Costello, Andrew Adamatzky, Emergent spiking in non-ideal memristor networks, Microelectron J. 45 1401–1415
Google Scholar
[7]
S. Ferch, E.Linn, R.Waser, S.Menzel, Simulation and comparison of two sequential logic-in-memory approaches using a dynamic electrochemical metallization cell model, Microelectron J. 45 1416–1428
Google Scholar
[8]
Yifat Levy, Jehoshua Bruck, Yuval Cassuto, Eby G. Friedman, Avinoam Kolodny, Eitan Yaakobi, Shahar Kvatinsky, Logic operations in memory using a memristive akers array, Microelectron J. 45 1429–1437
Google Scholar
[9]
Eero Lehtonen, Jari Tissari, Jussi Poikonen, Mika Laiho, Lauri Koskinen, A cellular computing architecture for parallel memristive stateful logic, Microelectron J. 45 1438–1449
Google Scholar
[10]
Mohammad Bavandpour, Saeed Bagheri-Shouraki, Hamid Soleimani, Arash Ahmadi, Bernabé Linares-Barranco, Spiking neuro-fuzzy clustering system and its memristor crossbar based implementation, Microelectron J. 45 1450–1462
Google Scholar
[11]
S.B. Akers Jr.
A rectangular logic array
IEEE Trans. Comput., C-21 (8) (1972), pp. 848-857
View Record in ScopusGoogle Scholar
[12]
J. Borghetti, G.S. Snider, P.J. Kuekes, J.J. Yang, D.R. Stewart, R.S. Williams
Memristive switches enable stateful logic operations via material implication
Nature, 464 (2010), pp. 873-876
CrossRefView Record in ScopusGoogle Scholar
[13]
L. Chua
Resistance switching memories are memristors
Appl. Phys. A, 102 (4) (2011), pp. 765-783
CrossRefView Record in ScopusGoogle Scholar
[14]
K.K. Likharev, D.B. Strukov
CMOL: devices, circuits, and architectures
G. Cuniberti, G. Fagas, K. Richter (Eds.), Introducing Molecular Electronics, Springer, Berlin (2005), pp. 447-478
Google Scholar
[15]
E. Linn, R. Rosezin, S. Tappertzhofen, U. Bttger, R. Waser
Beyond von Neumann – logic operations in passive crossbar arrays alongside memory operations
Nanotechnology, 23 (30) (2012)
6 pp
Google Scholar
1.
Sirakoulis G Ch, Bandini S
Cellular Automata Applications for Research and Industry Miscellaneous
2014.
@misc{sirakoulis2014cellular,
title = {Cellular Automata Applications for Research and Industry},
author = {Georgios Ch. Sirakoulis and Stefania Bandini},
url = {http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-9-number-2-3-2014/jca-9-2-3-p-89-93/},
year = {2014},
date = {2014-04-14},
urldate = {2014-01-01},
journal = {Journal of Cellular Automata},
volume = {9},
number = {2-3},
pages = {89--93},
publisher = {OLD CITY PUBLISHING INC},
abstract = {Cellular automata (CA) present a very powerful approach to the study of spatio-temporal complex systems allowing to simulate complex global behaviors by using very primitive rules based on local interactions. CA account for real phenomena or solutions of problems, whose high complexity could unlikely be formalized in different contexts, and promote advanced computational models to be developed and analyzed in order to design future generations of scientific and technological scenarios. Furthermore, parallelism and locality features of CA allow a straightforward and extremely easy parallelization, therefore an immediate implementation on parallel and distributed computing resources, directly fitting the technological
trends. These characteristics of the CA research resulted in the formation of interdisciplinary research teams, involving cross-fertilization studies and perspectives, producing remarkable research results, and attracting scientists from different disciplines.
In these aspects, ACRI (Cellular Automata for Research and Industry) Conference, as the oldest conference in CA, has been traditionally focused on challenging problems and new research not only in theoretical but application aspects of CA, including CA tools and computational sciences. It is also concerned with applications and solutions of problems from the fields of physics, engineering, environment science, social science and life sciences, allowing scholars coming from different studies and experience in CA to discuss and merge their competencies and results, to identify new issues and to enlarge the research fields of CA. Since its inception in 1994, the ACRI conference has attracted an ever-growing community and has raised knowledge and interest in the study of CA for both new entrants into the field as well as researchers already working on particular aspects of CA. The 10th edition of ACRI 2012 Conference, organized by Democritus University of Thrace, took place in Santorini Island, Greece on September 24-27 2012, and was the tenth in a series of conferences inaugurated in 1994 in Rende, Italy, and followed by ACRI 1996 in Milan, Italy, ACRI 1998 in Trieste, Italy, ACRI 2000 in Karlsruhe, Germany, ACRI 2002 in Geneva, Switzerland, ACRI 2004 in Amsterdam, The Netherlands, ACRI 2006 in Perpignan, France, ACRI 2008 in Yokohama, Japan and ACRI 2010 in Ascoli Piceno, Italy.
The main goal of the ACRI 2012 Conference was to offer both scientists and engineers in academies and industries an opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems. As it already became apparent, CA approach is universal so easily applied to numerous different and interdisciplinary fields like the ones of arts, biology, chemistry, communication, cultural heritage, ecology, economy, geology, engineering, computer science, medicine, physics, sociology, etc.
A major part of these topics is covered by the content of this special issue. Twelve papers, all related with many different applications from small scale to large scale systems related with biology, ecology, project management, image processing, cryptography, pseudorandom number generation, robotics and urban geography, all modeled with CA were selected to constitute a volume of about one hundred and eighty pages. They were all thoroughly reviewed and revised properly as a detailed major extension of their conference papers published in the ACRI 2012 proceedings.
In more details, Landman, Bindman and Newgreen propose CA modeling of enteric nervous system (ENS) colonization, determining the key mechanisms to determine success or failure, and present new modeling results on the stochastic competition of individual neural crest (NC) cell progeny, by determining clonal contributions.
Hirabayashi, Kinoshita, Tanaka, Honda, Kojima and Oiwa present a CA approach for characterizing of DNA tile computing and investigate a cryptosystem using a DNA motif called a triple crossover (TX) tile with the help of a CA model.
Chatzichristofis, Bampis, Marques, Lux and Boutalis, propose a lossless visual multimedia content encryption CA approach employing the recursive attributes of the eXclusive-OR (XOR) filter and accelerating them by the Summed Area Tables (SAT) approach. This method is a symmetric-key based one and appears to be able to withstand brute force attacks.
Vlassopoulos and Girau introduce a new composite fitness metric to evolve two-dimensional CA using Genetic Algorithms and Markov Chain Monte-Carlo approach so as to successfully pass specific tests from Pseudorandom Number Generators (PRNGs) batteries of tests.
Das and Rowchowdhury introduce a CA based high-speed, secure stream cipher with 128 bits Key and 128 bits Initial Vector (IV), namely CASTREAM, suitable for both hardware and software. The CASTREAM is extensible in terms of Key size and provides configurable security and vendor specific implementation option better than the existing standards.
Di Stefano and Navarra propose a very simple game called Scintillae, which, like in a domino game, provides the player with limited basic pieces that can be placed over a chessboard-like area. Nevertheless, many interesting aspects arrive from the evolution of this game and combinatorial circuit and cryptography case studies of Scintillae evolution are presented.
Zagoris and Pratikakis propose CA for text detection in Natural Images. Initially, an edge map is calculated and binarized and then, by taking advantage of the CA memory notion, the transition rules of these hybrid CA are applied in different consecutive steps proving the method’s efficiency when compared with others methods for ICDAR 2011 Robust Reading Competition dataset.
Charalampous, Kostavelis, Amanatiadis and Gasteratos present a CA based method suitable for path planning in dynamically changing environments, assuring a collision-free cost efficient path to target with optimal computational cost and, moreover, apply it successfully to indoor and outdoor real world planar environments.
Avolio, Di Gregorio and Trunfio propose a wildfire simulator, based on CA, in which a local randomization of the spread directions and different size of neighborhood are introduced to improve the accuracy of fire spread simulations based on a standard center-to-center ignition scheme.
Ben Belgacem, Chopard, Latt and Parmigiani investigate optimal management of network of irrigation canals by numerical modeling of Complex Cellular Automata (CxA), Lattice Boltzmann (LB) method and Multiscale Modeling Language (MML) on a distributed grid infrastructure aiming at coupling simple 1D model of canal sections with 3D complex ones.
Blecic, Cecchini, Trunfio and Verigos propose an operational approach to incorporate complex urban geographies into urban land-use CA models. They furthermore present few toy experiments and a real-world application of the model to the city of Heraklion in Crete, Greece.
Shimura and Nishinari present a stochastic CA model for project management providing the estimation of various tempo properties relevant to the project such as project duration, critical path and slack time in terms of the realization probability.
Finally, we would like to thank and acknowledge the members of ACRI Conference Program Committee who kindly accepted to assist us and provided us with their valuable comments during the review process of the aforementioned Conference and Special Issue papers:
Andrew Adamatzky (University of the West of England \textendash UK)
Ioannis Andreadis (Democritus University of Thrace \textendash Greece)
Franco Bagnoli (University of Florence \textendash Italy)
Stefania Bandini (University of Milano-Bicocca \textendash Italy)
Olga Bandman (Moscow Energetic Institute \textendash Russia)
Belgacem Ben Youssef (Fraser University Surey \textendash Canada)
Bastien Chopard (University of Geneva \textendash Switzerland)
Alberto Dennunzio (University of Milano-Bicocca \textendash Italy)
Andreas Deutsch (Dresden University of Technology \textendash Germany)
Salvatore Di Gregorio (University of Calabria \textendash Italy)
Pedro de Oliveira (Universidade Presbiteriana Mackenzie \textendash Brazil)
Michel Droz (University of Geneva \textendash Switzerland)
Samira El Yacoubi (University of Perpignan \textendash France)
Nazim Fat`es (INRIA Nancy \textendash Grand Est \textendash France)
Teijiro Isokawa (University of Hyogo \textendash Japan)
Francisco Jim´enez (University of Santa Clara \textendash Spain)
Ioannis Karafyllidis (Democritus University of Thrace \textendash Greece)
Toshihiko Komatsuzaki (Kanazawa University \textendash Japan)
Martin Kutrib (Institut f¨ur Informatik Universit¨at Gie\ssen \textendash Germany)
Anna T. Lawniczak (University of Guelph \textendash Canada)
Jia Lee (Chongqing University \textendash China)
Joseph Lizier (Max Planck Institute for Mathematics in the Sciences \textendash Germany)
Danuta Makowiec (Gdansk University \textendash Poland)
Sara Manzoni (University of Milano-Bicocca \textendash Italy)
Maurice Margenstern (Universit´e Paul Verlaine \textendash METZ \textendash France)
Genaro J. Mart´ınez (University of the West of England \textendash Mexico)
Nobuyuki Matsui (University of Hyogo \textendash Japan)
Giancarlo Mauri (University of Milano-Bicocca \textendash Italy)
Mohamma Reza Meybodi (Amirkabir University of Technology \textendash Iran)
Michael Meyer-Hermann (Helmholtz Centre for Infection Research Braunschweig \textendash Germany)
Angelo Mingarelli (Carleton University \textendash Canada)
Shin Morishita (Yokohama National University \textendash Japan)
Katsuhiro Nishinari (University of Tokyo \textendash Japan)
Hidenosuke Nishio (University of Kyoto \textendash Japan)
Ferdinand Peper (National Institute of Information and Communications Technology \textendash Japan)
Franciszek Seredynski (Institute of Computer Science Polish Academy of Sciences \textendash Poland)
Roberto Serra (University of Modena and Reggio Emilia \textendash Italy)
Biplab K. Sikdar (Bengal Engineering and Science University \textendash India)
Georgios Sirakoulis (Democritus University of Thrace \textendash Greece)
Furio Suggi Liverani (University of Trieste \textendash Italy)
Domenico Talia (University of Calabria \textendash Italy)
Marco Tomassini (University of Lausanne \textendash Switzerland)
Leen Torenvliet (University of Amsterdam \textendash The Netherlands)
Hiroshi Umeo (University of Osaka Electro-Communication \textendash Japan)
Giuseppe Vizzari (University of Milano-Bicocca \textendash Italy)
Burton Voorhees (University of Athabasca \textendash Canada)
Thomas Worsch (University of Karlsruhe \textendash Germany)
April 14, 2014
Georgios Ch. Sirakoulis (Democritus University of Thrace, Greece)
Stefania Bandini (University of Milano-Bicocca \textendash Italy)},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Cellular automata (CA) present a very powerful approach to the study of spatio-temporal complex systems allowing to simulate complex global behaviors by using very primitive rules based on local interactions. CA account for real phenomena or solutions of problems, whose high complexity could unlikely be formalized in different contexts, and promote advanced computational models to be developed and analyzed in order to design future generations of scientific and technological scenarios. Furthermore, parallelism and locality features of CA allow a straightforward and extremely easy parallelization, therefore an immediate implementation on parallel and distributed computing resources, directly fitting the technological
trends. These characteristics of the CA research resulted in the formation of interdisciplinary research teams, involving cross-fertilization studies and perspectives, producing remarkable research results, and attracting scientists from different disciplines.
In these aspects, ACRI (Cellular Automata for Research and Industry) Conference, as the oldest conference in CA, has been traditionally focused on challenging problems and new research not only in theoretical but application aspects of CA, including CA tools and computational sciences. It is also concerned with applications and solutions of problems from the fields of physics, engineering, environment science, social science and life sciences, allowing scholars coming from different studies and experience in CA to discuss and merge their competencies and results, to identify new issues and to enlarge the research fields of CA. Since its inception in 1994, the ACRI conference has attracted an ever-growing community and has raised knowledge and interest in the study of CA for both new entrants into the field as well as researchers already working on particular aspects of CA. The 10th edition of ACRI 2012 Conference, organized by Democritus University of Thrace, took place in Santorini Island, Greece on September 24-27 2012, and was the tenth in a series of conferences inaugurated in 1994 in Rende, Italy, and followed by ACRI 1996 in Milan, Italy, ACRI 1998 in Trieste, Italy, ACRI 2000 in Karlsruhe, Germany, ACRI 2002 in Geneva, Switzerland, ACRI 2004 in Amsterdam, The Netherlands, ACRI 2006 in Perpignan, France, ACRI 2008 in Yokohama, Japan and ACRI 2010 in Ascoli Piceno, Italy.
The main goal of the ACRI 2012 Conference was to offer both scientists and engineers in academies and industries an opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems. As it already became apparent, CA approach is universal so easily applied to numerous different and interdisciplinary fields like the ones of arts, biology, chemistry, communication, cultural heritage, ecology, economy, geology, engineering, computer science, medicine, physics, sociology, etc.
A major part of these topics is covered by the content of this special issue. Twelve papers, all related with many different applications from small scale to large scale systems related with biology, ecology, project management, image processing, cryptography, pseudorandom number generation, robotics and urban geography, all modeled with CA were selected to constitute a volume of about one hundred and eighty pages. They were all thoroughly reviewed and revised properly as a detailed major extension of their conference papers published in the ACRI 2012 proceedings.
In more details, Landman, Bindman and Newgreen propose CA modeling of enteric nervous system (ENS) colonization, determining the key mechanisms to determine success or failure, and present new modeling results on the stochastic competition of individual neural crest (NC) cell progeny, by determining clonal contributions.
Hirabayashi, Kinoshita, Tanaka, Honda, Kojima and Oiwa present a CA approach for characterizing of DNA tile computing and investigate a cryptosystem using a DNA motif called a triple crossover (TX) tile with the help of a CA model.
Chatzichristofis, Bampis, Marques, Lux and Boutalis, propose a lossless visual multimedia content encryption CA approach employing the recursive attributes of the eXclusive-OR (XOR) filter and accelerating them by the Summed Area Tables (SAT) approach. This method is a symmetric-key based one and appears to be able to withstand brute force attacks.
Vlassopoulos and Girau introduce a new composite fitness metric to evolve two-dimensional CA using Genetic Algorithms and Markov Chain Monte-Carlo approach so as to successfully pass specific tests from Pseudorandom Number Generators (PRNGs) batteries of tests.
Das and Rowchowdhury introduce a CA based high-speed, secure stream cipher with 128 bits Key and 128 bits Initial Vector (IV), namely CASTREAM, suitable for both hardware and software. The CASTREAM is extensible in terms of Key size and provides configurable security and vendor specific implementation option better than the existing standards.
Di Stefano and Navarra propose a very simple game called Scintillae, which, like in a domino game, provides the player with limited basic pieces that can be placed over a chessboard-like area. Nevertheless, many interesting aspects arrive from the evolution of this game and combinatorial circuit and cryptography case studies of Scintillae evolution are presented.
Zagoris and Pratikakis propose CA for text detection in Natural Images. Initially, an edge map is calculated and binarized and then, by taking advantage of the CA memory notion, the transition rules of these hybrid CA are applied in different consecutive steps proving the method’s efficiency when compared with others methods for ICDAR 2011 Robust Reading Competition dataset.
Charalampous, Kostavelis, Amanatiadis and Gasteratos present a CA based method suitable for path planning in dynamically changing environments, assuring a collision-free cost efficient path to target with optimal computational cost and, moreover, apply it successfully to indoor and outdoor real world planar environments.
Avolio, Di Gregorio and Trunfio propose a wildfire simulator, based on CA, in which a local randomization of the spread directions and different size of neighborhood are introduced to improve the accuracy of fire spread simulations based on a standard center-to-center ignition scheme.
Ben Belgacem, Chopard, Latt and Parmigiani investigate optimal management of network of irrigation canals by numerical modeling of Complex Cellular Automata (CxA), Lattice Boltzmann (LB) method and Multiscale Modeling Language (MML) on a distributed grid infrastructure aiming at coupling simple 1D model of canal sections with 3D complex ones.
Blecic, Cecchini, Trunfio and Verigos propose an operational approach to incorporate complex urban geographies into urban land-use CA models. They furthermore present few toy experiments and a real-world application of the model to the city of Heraklion in Crete, Greece.
Shimura and Nishinari present a stochastic CA model for project management providing the estimation of various tempo properties relevant to the project such as project duration, critical path and slack time in terms of the realization probability.
Finally, we would like to thank and acknowledge the members of ACRI Conference Program Committee who kindly accepted to assist us and provided us with their valuable comments during the review process of the aforementioned Conference and Special Issue papers:
Andrew Adamatzky (University of the West of England – UK)
Ioannis Andreadis (Democritus University of Thrace – Greece)
Franco Bagnoli (University of Florence – Italy)
Stefania Bandini (University of Milano-Bicocca – Italy)
Olga Bandman (Moscow Energetic Institute – Russia)
Belgacem Ben Youssef (Fraser University Surey – Canada)
Bastien Chopard (University of Geneva – Switzerland)
Alberto Dennunzio (University of Milano-Bicocca – Italy)
Andreas Deutsch (Dresden University of Technology – Germany)
Salvatore Di Gregorio (University of Calabria – Italy)
Pedro de Oliveira (Universidade Presbiteriana Mackenzie – Brazil)
Michel Droz (University of Geneva – Switzerland)
Samira El Yacoubi (University of Perpignan – France)
Nazim Fat`es (INRIA Nancy – Grand Est – France)
Teijiro Isokawa (University of Hyogo – Japan)
Francisco Jim´enez (University of Santa Clara – Spain)
Ioannis Karafyllidis (Democritus University of Thrace – Greece)
Toshihiko Komatsuzaki (Kanazawa University – Japan)
Martin Kutrib (Institut f¨ur Informatik Universit¨at Gießen – Germany)
Anna T. Lawniczak (University of Guelph – Canada)
Jia Lee (Chongqing University – China)
Joseph Lizier (Max Planck Institute for Mathematics in the Sciences – Germany)
Danuta Makowiec (Gdansk University – Poland)
Sara Manzoni (University of Milano-Bicocca – Italy)
Maurice Margenstern (Universit´e Paul Verlaine – METZ – France)
Genaro J. Mart´ınez (University of the West of England – Mexico)
Nobuyuki Matsui (University of Hyogo – Japan)
Giancarlo Mauri (University of Milano-Bicocca – Italy)
Mohamma Reza Meybodi (Amirkabir University of Technology – Iran)
Michael Meyer-Hermann (Helmholtz Centre for Infection Research Braunschweig – Germany)
Angelo Mingarelli (Carleton University – Canada)
Shin Morishita (Yokohama National University – Japan)
Katsuhiro Nishinari (University of Tokyo – Japan)
Hidenosuke Nishio (University of Kyoto – Japan)
Ferdinand Peper (National Institute of Information and Communications Technology – Japan)
Franciszek Seredynski (Institute of Computer Science Polish Academy of Sciences – Poland)
Roberto Serra (University of Modena and Reggio Emilia – Italy)
Biplab K. Sikdar (Bengal Engineering and Science University – India)
Georgios Sirakoulis (Democritus University of Thrace – Greece)
Furio Suggi Liverani (University of Trieste – Italy)
Domenico Talia (University of Calabria – Italy)
Marco Tomassini (University of Lausanne – Switzerland)
Leen Torenvliet (University of Amsterdam – The Netherlands)
Hiroshi Umeo (University of Osaka Electro-Communication – Japan)
Giuseppe Vizzari (University of Milano-Bicocca – Italy)
Burton Voorhees (University of Athabasca – Canada)
Thomas Worsch (University of Karlsruhe – Germany)
April 14, 2014
Georgios Ch. Sirakoulis (Democritus University of Thrace, Greece)
Stefania Bandini (University of Milano-Bicocca – Italy)
trends. These characteristics of the CA research resulted in the formation of interdisciplinary research teams, involving cross-fertilization studies and perspectives, producing remarkable research results, and attracting scientists from different disciplines.
In these aspects, ACRI (Cellular Automata for Research and Industry) Conference, as the oldest conference in CA, has been traditionally focused on challenging problems and new research not only in theoretical but application aspects of CA, including CA tools and computational sciences. It is also concerned with applications and solutions of problems from the fields of physics, engineering, environment science, social science and life sciences, allowing scholars coming from different studies and experience in CA to discuss and merge their competencies and results, to identify new issues and to enlarge the research fields of CA. Since its inception in 1994, the ACRI conference has attracted an ever-growing community and has raised knowledge and interest in the study of CA for both new entrants into the field as well as researchers already working on particular aspects of CA. The 10th edition of ACRI 2012 Conference, organized by Democritus University of Thrace, took place in Santorini Island, Greece on September 24-27 2012, and was the tenth in a series of conferences inaugurated in 1994 in Rende, Italy, and followed by ACRI 1996 in Milan, Italy, ACRI 1998 in Trieste, Italy, ACRI 2000 in Karlsruhe, Germany, ACRI 2002 in Geneva, Switzerland, ACRI 2004 in Amsterdam, The Netherlands, ACRI 2006 in Perpignan, France, ACRI 2008 in Yokohama, Japan and ACRI 2010 in Ascoli Piceno, Italy.
The main goal of the ACRI 2012 Conference was to offer both scientists and engineers in academies and industries an opportunity to express and discuss their views on current trends, challenges, and state-of-the art solutions to various problems. As it already became apparent, CA approach is universal so easily applied to numerous different and interdisciplinary fields like the ones of arts, biology, chemistry, communication, cultural heritage, ecology, economy, geology, engineering, computer science, medicine, physics, sociology, etc.
A major part of these topics is covered by the content of this special issue. Twelve papers, all related with many different applications from small scale to large scale systems related with biology, ecology, project management, image processing, cryptography, pseudorandom number generation, robotics and urban geography, all modeled with CA were selected to constitute a volume of about one hundred and eighty pages. They were all thoroughly reviewed and revised properly as a detailed major extension of their conference papers published in the ACRI 2012 proceedings.
In more details, Landman, Bindman and Newgreen propose CA modeling of enteric nervous system (ENS) colonization, determining the key mechanisms to determine success or failure, and present new modeling results on the stochastic competition of individual neural crest (NC) cell progeny, by determining clonal contributions.
Hirabayashi, Kinoshita, Tanaka, Honda, Kojima and Oiwa present a CA approach for characterizing of DNA tile computing and investigate a cryptosystem using a DNA motif called a triple crossover (TX) tile with the help of a CA model.
Chatzichristofis, Bampis, Marques, Lux and Boutalis, propose a lossless visual multimedia content encryption CA approach employing the recursive attributes of the eXclusive-OR (XOR) filter and accelerating them by the Summed Area Tables (SAT) approach. This method is a symmetric-key based one and appears to be able to withstand brute force attacks.
Vlassopoulos and Girau introduce a new composite fitness metric to evolve two-dimensional CA using Genetic Algorithms and Markov Chain Monte-Carlo approach so as to successfully pass specific tests from Pseudorandom Number Generators (PRNGs) batteries of tests.
Das and Rowchowdhury introduce a CA based high-speed, secure stream cipher with 128 bits Key and 128 bits Initial Vector (IV), namely CASTREAM, suitable for both hardware and software. The CASTREAM is extensible in terms of Key size and provides configurable security and vendor specific implementation option better than the existing standards.
Di Stefano and Navarra propose a very simple game called Scintillae, which, like in a domino game, provides the player with limited basic pieces that can be placed over a chessboard-like area. Nevertheless, many interesting aspects arrive from the evolution of this game and combinatorial circuit and cryptography case studies of Scintillae evolution are presented.
Zagoris and Pratikakis propose CA for text detection in Natural Images. Initially, an edge map is calculated and binarized and then, by taking advantage of the CA memory notion, the transition rules of these hybrid CA are applied in different consecutive steps proving the method’s efficiency when compared with others methods for ICDAR 2011 Robust Reading Competition dataset.
Charalampous, Kostavelis, Amanatiadis and Gasteratos present a CA based method suitable for path planning in dynamically changing environments, assuring a collision-free cost efficient path to target with optimal computational cost and, moreover, apply it successfully to indoor and outdoor real world planar environments.
Avolio, Di Gregorio and Trunfio propose a wildfire simulator, based on CA, in which a local randomization of the spread directions and different size of neighborhood are introduced to improve the accuracy of fire spread simulations based on a standard center-to-center ignition scheme.
Ben Belgacem, Chopard, Latt and Parmigiani investigate optimal management of network of irrigation canals by numerical modeling of Complex Cellular Automata (CxA), Lattice Boltzmann (LB) method and Multiscale Modeling Language (MML) on a distributed grid infrastructure aiming at coupling simple 1D model of canal sections with 3D complex ones.
Blecic, Cecchini, Trunfio and Verigos propose an operational approach to incorporate complex urban geographies into urban land-use CA models. They furthermore present few toy experiments and a real-world application of the model to the city of Heraklion in Crete, Greece.
Shimura and Nishinari present a stochastic CA model for project management providing the estimation of various tempo properties relevant to the project such as project duration, critical path and slack time in terms of the realization probability.
Finally, we would like to thank and acknowledge the members of ACRI Conference Program Committee who kindly accepted to assist us and provided us with their valuable comments during the review process of the aforementioned Conference and Special Issue papers:
Andrew Adamatzky (University of the West of England – UK)
Ioannis Andreadis (Democritus University of Thrace – Greece)
Franco Bagnoli (University of Florence – Italy)
Stefania Bandini (University of Milano-Bicocca – Italy)
Olga Bandman (Moscow Energetic Institute – Russia)
Belgacem Ben Youssef (Fraser University Surey – Canada)
Bastien Chopard (University of Geneva – Switzerland)
Alberto Dennunzio (University of Milano-Bicocca – Italy)
Andreas Deutsch (Dresden University of Technology – Germany)
Salvatore Di Gregorio (University of Calabria – Italy)
Pedro de Oliveira (Universidade Presbiteriana Mackenzie – Brazil)
Michel Droz (University of Geneva – Switzerland)
Samira El Yacoubi (University of Perpignan – France)
Nazim Fat`es (INRIA Nancy – Grand Est – France)
Teijiro Isokawa (University of Hyogo – Japan)
Francisco Jim´enez (University of Santa Clara – Spain)
Ioannis Karafyllidis (Democritus University of Thrace – Greece)
Toshihiko Komatsuzaki (Kanazawa University – Japan)
Martin Kutrib (Institut f¨ur Informatik Universit¨at Gießen – Germany)
Anna T. Lawniczak (University of Guelph – Canada)
Jia Lee (Chongqing University – China)
Joseph Lizier (Max Planck Institute for Mathematics in the Sciences – Germany)
Danuta Makowiec (Gdansk University – Poland)
Sara Manzoni (University of Milano-Bicocca – Italy)
Maurice Margenstern (Universit´e Paul Verlaine – METZ – France)
Genaro J. Mart´ınez (University of the West of England – Mexico)
Nobuyuki Matsui (University of Hyogo – Japan)
Giancarlo Mauri (University of Milano-Bicocca – Italy)
Mohamma Reza Meybodi (Amirkabir University of Technology – Iran)
Michael Meyer-Hermann (Helmholtz Centre for Infection Research Braunschweig – Germany)
Angelo Mingarelli (Carleton University – Canada)
Shin Morishita (Yokohama National University – Japan)
Katsuhiro Nishinari (University of Tokyo – Japan)
Hidenosuke Nishio (University of Kyoto – Japan)
Ferdinand Peper (National Institute of Information and Communications Technology – Japan)
Franciszek Seredynski (Institute of Computer Science Polish Academy of Sciences – Poland)
Roberto Serra (University of Modena and Reggio Emilia – Italy)
Biplab K. Sikdar (Bengal Engineering and Science University – India)
Georgios Sirakoulis (Democritus University of Thrace – Greece)
Furio Suggi Liverani (University of Trieste – Italy)
Domenico Talia (University of Calabria – Italy)
Marco Tomassini (University of Lausanne – Switzerland)
Leen Torenvliet (University of Amsterdam – The Netherlands)
Hiroshi Umeo (University of Osaka Electro-Communication – Japan)
Giuseppe Vizzari (University of Milano-Bicocca – Italy)
Burton Voorhees (University of Athabasca – Canada)
Thomas Worsch (University of Karlsruhe – Germany)
April 14, 2014
Georgios Ch. Sirakoulis (Democritus University of Thrace, Greece)
Stefania Bandini (University of Milano-Bicocca – Italy)
Journals
156.
Tsakalos K, Sirakoulis G Ch, Adamatzky A, Smith J
Protein Structured Reservoir computing for Spike-based Pattern Recognition Journal Article
In: IEEE Transactions on Parallel and Distributed Systems, vol. 33, no. 2, pp. 322–331, 2022.
@article{tsakalos2021protein,
title = {Protein Structured Reservoir computing for Spike-based Pattern Recognition},
author = {Karolos-Alexandros Tsakalos and Georgios Ch. Sirakoulis and Andy Adamatzky and Jim Smith},
url = {https://www.computer.org/csdl/journal/td/2022/02/09387584/1smD8QlWRji},
doi = {10.1109/TPDS.2021.3068826},
year = {2022},
date = {2022-02-01},
urldate = {2022-02-01},
journal = {IEEE Transactions on Parallel and Distributed Systems},
volume = {33},
number = {2},
pages = {322--331},
publisher = {IEEE},
abstract = {Nowadays we witness a miniaturisation trend in the semiconductor industry backed up by groundbreaking discoveries and designs in nanoscale characterisation and fabrication. To facilitate the trend and produce ever smaller, faster and cheaper computing devices, the size of nanoelectronic devices is now reaching the scale of atoms or molecules - a technical goal undoubtedly demanding for novel devices. Following the trend, we explore an unconventional route of implementing reservoir computing on a single protein molecule and introduce neuromorphic connectivity with a small-world networking property. We have chosen Izhikevich spiking neurons as elementary processors, corresponding to the atoms of verotoxin protein, and its molecule as a `hardware' architecture of the communication networks connecting the processors. We apply on a single readout layer, various training methods in a supervised fashion to investigate whether the molecular structured Reservoir Computing (RC) system is capable to deal with machine learning benchmarks. We start with the Remote Supervised Method, based on Spike-Timing-Dependent-Plasticity, and carry on with linear regression and scaled conjugate gradient back-propagation training methods. The RC network is evaluated as a proof-of-concept on the handwritten digit images from the standard MNIST and the extended MNIST datasets and demonstrates acceptable classification accuracies in comparison with other similar approaches},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Nowadays we witness a miniaturisation trend in the semiconductor industry backed up by groundbreaking discoveries and designs in nanoscale characterisation and fabrication. To facilitate the trend and produce ever smaller, faster and cheaper computing devices, the size of nanoelectronic devices is now reaching the scale of atoms or molecules - a technical goal undoubtedly demanding for novel devices. Following the trend, we explore an unconventional route of implementing reservoir computing on a single protein molecule and introduce neuromorphic connectivity with a small-world networking property. We have chosen Izhikevich spiking neurons as elementary processors, corresponding to the atoms of verotoxin protein, and its molecule as a `hardware' architecture of the communication networks connecting the processors. We apply on a single readout layer, various training methods in a supervised fashion to investigate whether the molecular structured Reservoir Computing (RC) system is capable to deal with machine learning benchmarks. We start with the Remote Supervised Method, based on Spike-Timing-Dependent-Plasticity, and carry on with linear regression and scaled conjugate gradient back-propagation training methods. The RC network is evaluated as a proof-of-concept on the handwritten digit images from the standard MNIST and the extended MNIST datasets and demonstrates acceptable classification accuracies in comparison with other similar approaches
155.
Vasileiadis N, Ntinas V, Karakolis P, Dimitrakis P, Sirakoulis G C
On Edge Image Processing Acceleration with Low Power Neuro-Memristive Segmented Crossbar Array Architecture. Journal Article
In: International Journal of Unconventional Computing, vol. 17, no. 3, 2022.
@article{vasileiadis2022edge,
title = {On Edge Image Processing Acceleration with Low Power Neuro-Memristive Segmented Crossbar Array Architecture.},
author = {Nikolaos Vasileiadis and Vasileios Ntinas and Panagiotis Karakolis and Panagiotis Dimitrakis and Georgios Ch Sirakoulis},
year = {2022},
date = {2022-01-01},
journal = {International Journal of Unconventional Computing},
volume = {17},
number = {3},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
154.
Chatzinikolaou T P, Fyrigos I, Ntinas V, Kitsios S, Tsompanas M, Bousoulas P, Tsoukalas D, Adamatzky A, Sirakoulis G C
Chemical Wave Computing from Labware to Electrical Systems Journal Article
In: Electronics, vol. 11, no. 11, pp. 1683, 2022.
@article{chatzinikolaou2022chemical,
title = {Chemical Wave Computing from Labware to Electrical Systems},
author = {Theodoros Panagiotis Chatzinikolaou and Iosif-Angelos Fyrigos and Vasileios Ntinas and Stavros Kitsios and Michail-Antisthenis Tsompanas and Panagiotis Bousoulas and Dimitris Tsoukalas and Andrew Adamatzky and Georgios Ch Sirakoulis},
year = {2022},
date = {2022-01-01},
journal = {Electronics},
volume = {11},
number = {11},
pages = {1683},
publisher = {MDPI},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
153.
Bousoulas P, Kitsios S, Chatzinikolaou T P, Fyrigos I, Ntinas V, Tsompanas M, Sirakoulis G C, Tsoukalas D
Material design strategies for emulating neuromorphic functionalities with resistive switching memories Journal Article
In: Japanese Journal of Applied Physics, 2022.
@article{bousoulas2022material,
title = {Material design strategies for emulating neuromorphic functionalities with resistive switching memories},
author = {Panagiotis Bousoulas and Stavros Kitsios and Theodoros Panagiotis Chatzinikolaou and Iosif-Angelos Fyrigos and Vasileios Ntinas and Michail-Antisthenis Tsompanas and Georgios Ch Sirakoulis and Dimitrios Tsoukalas},
year = {2022},
date = {2022-01-01},
journal = {Japanese Journal of Applied Physics},
publisher = {IOP Publishing},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
152.
Kyriakou C, Georgoudas I G, Papanikolaou N P, Sirakoulis G C
A GIS-aided cellular automata system for monitoring and estimating graph-based spread of epidemics Journal Article
In: Natural Computing, pp. 1–18, 2022.
@article{kyriakou2022gis,
title = {A GIS-aided cellular automata system for monitoring and estimating graph-based spread of epidemics},
author = {Charilaos Kyriakou and Ioakeim G Georgoudas and Nick P Papanikolaou and Georgios Ch Sirakoulis},
year = {2022},
date = {2022-01-01},
journal = {Natural Computing},
pages = {1--18},
publisher = {Springer},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
151.
Mavropoulis A, Vasileiadis N, Theodorou C, Sygellou L, Normand P, Sirakoulis G C, Dimitrakis P
Effect of SOI substrate on silicon nitride resistance switching using MIS structure Journal Article
In: Solid-State Electronics, vol. 194, pp. 108375, 2022.
@article{mavropoulis2022effect,
title = {Effect of SOI substrate on silicon nitride resistance switching using MIS structure},
author = {A Mavropoulis and N Vasileiadis and C Theodorou and L Sygellou and P Normand and G Ch Sirakoulis and P Dimitrakis},
year = {2022},
date = {2022-01-01},
journal = {Solid-State Electronics},
volume = {194},
pages = {108375},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
150.
Varsamis G D, Karafyllidis I G, Sirakoulis G C
Hitting times of quantum and classical random walks in potential spaces Journal Article
In: Physica A: Statistical Mechanics and its Applications, pp. 128119, 2022.
@article{varsamis2022hitting,
title = {Hitting times of quantum and classical random walks in potential spaces},
author = {Georgios D Varsamis and Ioannis G Karafyllidis and Georgios Ch Sirakoulis},
year = {2022},
date = {2022-01-01},
journal = {Physica A: Statistical Mechanics and its Applications},
pages = {128119},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
149.
Tsakalos K, Dragkola P, Karamani R, Tsompanas M, Provata A, Dimitrakis P, Adamatzky A I, Sirakoulis G C
Chimera States in Neuro-Inspired Area-Efficient Asynchronous Cellular Automata Networks Journal Article
In: IEEE Transactions on Circuits and Systems I: Regular Papers, 2022.
@article{tsakalos2022chimera,
title = {Chimera States in Neuro-Inspired Area-Efficient Asynchronous Cellular Automata Networks},
author = {Karolos-Alexandros Tsakalos and Paraskevi Dragkola and Rafailia-Eleni Karamani and Michail-Antisthenis Tsompanas and Astero Provata and Panagiotis Dimitrakis and Andrew I Adamatzky and Georgios Ch Sirakoulis},
year = {2022},
date = {2022-01-01},
journal = {IEEE Transactions on Circuits and Systems I: Regular Papers},
publisher = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
148.
Fyrigos I, Ntinas V, Vasileiadis N, Sirakoulis G Ch, Dimitrakis P, Zhang Y, Karafyllidis I G
Memristor Crossbar Arrays Performing Quantum Algorithms Journal Article Forthcoming
In: IEEE Transactions on Circuits and Systems I: Regular Papers, pp. 1-12, Forthcoming.
@article{fyrigos2021memristorb,
title = {Memristor Crossbar Arrays Performing Quantum Algorithms},
author = {Iosif-Angelos Fyrigos and Vasileios Ntinas and Nikolaos Vasileiadis and Georgios Ch. Sirakoulis and Panagiotis Dimitrakis and Yue Zhang and Ioannis G Karafyllidis},
url = {https://ieeexplore.ieee.org/document/9610620},
doi = {10.1109/TCSI.2021.3123575},
year = {2021},
date = {2021-11-13},
urldate = {2021-11-13},
journal = {IEEE Transactions on Circuits and Systems I: Regular Papers},
pages = {1-12},
publisher = {IEEE},
abstract = {There is a growing interest in quantum computers and quantum algorithm development. It has been proved that ideal quantum computers, with zero error rates and large decoherence times, can solve problems that are intractable for today's classical computers. Quantum computers use two resources, superposition and entanglement, that have no classical analog. Since quantum computer platforms that are currently available comprise only a few dozen of qubits, the use of quantum simulators is essential in developing and testing new quantum algorithms. We present a novel quantum simulator based on memristor crossbar circuits and use them to simulate well-known quantum algorithms, namely the Deutsch and Grover quantum algorithms. In quantum computing the dominant algebraic operations are matrix-vector multiplications. The execution time grows exponentially with the simulated number of qubits, causing an exponential slowdown in quantum algorithm execution using classical computers. In this work, we show that the inherent characteristics of memristor arrays can be used to overcome this problem and that memristor arrays can be used not only as independent quantum simulators but also as a part of a quantum computer stack where classical computers accelerators are connected. Our memristive crossbar circuits are re-configurable and can be programmed to simulate any quantum algorithm.},
keywords = {},
pubstate = {forthcoming},
tppubtype = {article}
}
There is a growing interest in quantum computers and quantum algorithm development. It has been proved that ideal quantum computers, with zero error rates and large decoherence times, can solve problems that are intractable for today's classical computers. Quantum computers use two resources, superposition and entanglement, that have no classical analog. Since quantum computer platforms that are currently available comprise only a few dozen of qubits, the use of quantum simulators is essential in developing and testing new quantum algorithms. We present a novel quantum simulator based on memristor crossbar circuits and use them to simulate well-known quantum algorithms, namely the Deutsch and Grover quantum algorithms. In quantum computing the dominant algebraic operations are matrix-vector multiplications. The execution time grows exponentially with the simulated number of qubits, causing an exponential slowdown in quantum algorithm execution using classical computers. In this work, we show that the inherent characteristics of memristor arrays can be used to overcome this problem and that memristor arrays can be used not only as independent quantum simulators but also as a part of a quantum computer stack where classical computers accelerators are connected. Our memristive crossbar circuits are re-configurable and can be programmed to simulate any quantum algorithm.
147.
Vasileiadis N, Loukas P, Karakolis P, Ioannou-Sougleridis V, Normand P, Ntinas V, Fyrigos I, Karafyllidis I, Sirakoulis G Ch, Dimitrakis P
Multi-level resistance switching and random telegraph noise analysis of nitride based memristors Journal Article
In: Chaos, Solitons & Fractals, vol. 153, no. 1, pp. 11153, 2021.
@article{vasileiadis2021multi,
title = {Multi-level resistance switching and random telegraph noise analysis of nitride based memristors},
author = {Nikolaos Vasileiadis and Panagiotis Loukas and Panagiotis Karakolis and Vassilios Ioannou-Sougleridis and Pascal Normand and Vasileios Ntinas and Iosif-Angelos Fyrigos and Ioannis Karafyllidis and Georgios Ch. Sirakoulis and Panagiotis Dimitrakis},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0960077921008870},
doi = {doi.org/10.1016/j.chaos.2021.111533},
year = {2021},
date = {2021-11-11},
urldate = {2021-01-01},
journal = {Chaos, Solitons \& Fractals},
volume = {153},
number = {1},
pages = {11153},
publisher = {Elsevier},
abstract = {Resistance switching devices are of special importance because of their application in resistive memories (RRAM) which are promising candidates for replacing current nonvolatile memories and realize storage class memories. These devices exhibit usually memristive properties with many discrete resistance levels and implement artificial synapses. The last years, researchers have demonstrated memristive chips as accelerators in computing, following new in-memory and neuromorphic computational approaches. Many different metal oxides have been used as resistance switching materials in MIM or MIS structures. Understanding of the mechanism and the dynamics of resistance switching is very critical for the modeling and use of memristors in different applications. Here, we demonstrate the bipolar resistance switching of silicon nitride thin films using heavily doped Si and Cu as bottom and top-electrodes, respectively. Analysis of the current-voltage characteristics reveal that under space-charge limited conditions and appropriate current compliance setting, multi-level resistance operation can be achieved. Furthermore, a flexible tuning protocol for multi-level resistance switching was developed applying appropriate SET/RESET pulse sequences. Retention and random telegraph noise measurements performed at different resistance levels. The present results reveal the attractive properties of the examined devices.
},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Resistance switching devices are of special importance because of their application in resistive memories (RRAM) which are promising candidates for replacing current nonvolatile memories and realize storage class memories. These devices exhibit usually memristive properties with many discrete resistance levels and implement artificial synapses. The last years, researchers have demonstrated memristive chips as accelerators in computing, following new in-memory and neuromorphic computational approaches. Many different metal oxides have been used as resistance switching materials in MIM or MIS structures. Understanding of the mechanism and the dynamics of resistance switching is very critical for the modeling and use of memristors in different applications. Here, we demonstrate the bipolar resistance switching of silicon nitride thin films using heavily doped Si and Cu as bottom and top-electrodes, respectively. Analysis of the current-voltage characteristics reveal that under space-charge limited conditions and appropriate current compliance setting, multi-level resistance operation can be achieved. Furthermore, a flexible tuning protocol for multi-level resistance switching was developed applying appropriate SET/RESET pulse sequences. Retention and random telegraph noise measurements performed at different resistance levels. The present results reveal the attractive properties of the examined devices.
146.
Nikiforidis I, Karafyllidis I G, Dimitrakis P, Sirakoulis G Ch
Design and simulation of graphene logic gates using graphene p--n junctions as building blocks Journal Article
In: Graphene and 2D Materials Technologies, vol. 6, no. 3, pp. 35–47, 2021.
@article{nikiforidis2021design,
title = {Design and simulation of graphene logic gates using graphene p--n junctions as building blocks},
author = {Ioannis Nikiforidis and Ioannis G Karafyllidis and Panagiotis Dimitrakis and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/article/10.1007/s41127-021-00043-7},
doi = {doi.org/10.1007/s41127-021-00043-7},
year = {2021},
date = {2021-10-19},
urldate = {2021-10-19},
journal = {Graphene and 2D Materials Technologies},
volume = {6},
number = {3},
pages = {35--47},
publisher = {Springer International Publishing},
abstract = {Electrostatically doped graphene p\textendashn junctions can modulate graphene nanoribbon conductance and can be indispensable parts of nanoelectronic graphene circuits. Much research has been conducted on such devices with one rectangular top gate and one back gate with very encouraging results. Recently, graphene p\textendashn junctions with two rectangular top gates have been proposed and their study revealed a rich behaviour that allows their use in both analogue and digital nanoelectronic circuits. Here we study graphene p\textendashn junctions with two trapezoid top gates and a common back gate with special focus to the effect of the angle and the distance between the two top gates. Furthermore, trapezoid top gates with angles of 45° make use of the Veselago lens effect, allowing an effective control by tuning density of states and carrier density. We simulated these devises using the non-equilibrium Green’s function method combined with tight-binding Hamiltonians in the ballistic transport limit. Our results show that the conductance of these graphene p\textendashn junctions can be successfully controlled by various combinations of different parameters that allows for realisation of carbon-based logic gates. We also present the design and simulation a universal set Boolean gates, namely NOT, NAND and NOR.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Electrostatically doped graphene p–n junctions can modulate graphene nanoribbon conductance and can be indispensable parts of nanoelectronic graphene circuits. Much research has been conducted on such devices with one rectangular top gate and one back gate with very encouraging results. Recently, graphene p–n junctions with two rectangular top gates have been proposed and their study revealed a rich behaviour that allows their use in both analogue and digital nanoelectronic circuits. Here we study graphene p–n junctions with two trapezoid top gates and a common back gate with special focus to the effect of the angle and the distance between the two top gates. Furthermore, trapezoid top gates with angles of 45° make use of the Veselago lens effect, allowing an effective control by tuning density of states and carrier density. We simulated these devises using the non-equilibrium Green’s function method combined with tight-binding Hamiltonians in the ballistic transport limit. Our results show that the conductance of these graphene p–n junctions can be successfully controlled by various combinations of different parameters that allows for realisation of carbon-based logic gates. We also present the design and simulation a universal set Boolean gates, namely NOT, NAND and NOR.
145.
Vasileiadis N, Ntinas V, Sirakoulis G Ch, Dimitrakis P
In-Memory-Computing Realization with a Photodiode/Memristor Based Vision Sensor Journal Article
In: Materials, vol. 14, no. 18, pp. 5223, 2021.
@article{vasileiadis2021memory,
title = {In-Memory-Computing Realization with a Photodiode/Memristor Based Vision Sensor},
author = {Nikolaos Vasileiadis and Vasileios Ntinas and Georgios Ch. Sirakoulis and Panagiotis Dimitrakis},
url = {https://www.mdpi.com/1996-1944/14/18/5223},
doi = {doi.org/10.3390/ma14185223},
year = {2021},
date = {2021-09-10},
urldate = {2021-09-10},
journal = {Materials},
volume = {14},
number = {18},
pages = {5223},
publisher = {Multidisciplinary Digital Publishing Institute},
abstract = {State-of-the-art IoT technologies request novel design solutions in edge computing, resulting in even more portable and energy-efficient hardware for in-the-field processing tasks. Vision sensors, processors, and hardware accelerators are among the most demanding IoT applications. Resistance switching (RS) two-terminal devices are suitable for resistive RAMs (RRAM), a promising technology to realize storage class memories. Furthermore, due to their memristive nature, RRAMs are appropriate candidates for in-memory computing architectures. Recently, we demonstrated a CMOS compatible silicon nitride (SiNx) MIS RS device with memristive properties. In this paper, a report on a new photodiode-based vision sensor architecture with in-memory computing capability, relying on memristive device, is disclosed. In this context, the resistance switching dynamics of our memristive device were measured and a data-fitted behavioral model was extracted. SPICE simulations were made highlighting the in-memory computing capabilities of the proposed photodiode-one memristor pixel vision sensor. Finally, an integration and manufacturing perspective was discussed.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
State-of-the-art IoT technologies request novel design solutions in edge computing, resulting in even more portable and energy-efficient hardware for in-the-field processing tasks. Vision sensors, processors, and hardware accelerators are among the most demanding IoT applications. Resistance switching (RS) two-terminal devices are suitable for resistive RAMs (RRAM), a promising technology to realize storage class memories. Furthermore, due to their memristive nature, RRAMs are appropriate candidates for in-memory computing architectures. Recently, we demonstrated a CMOS compatible silicon nitride (SiNx) MIS RS device with memristive properties. In this paper, a report on a new photodiode-based vision sensor architecture with in-memory computing capability, relying on memristive device, is disclosed. In this context, the resistance switching dynamics of our memristive device were measured and a data-fitted behavioral model was extracted. SPICE simulations were made highlighting the in-memory computing capabilities of the proposed photodiode-one memristor pixel vision sensor. Finally, an integration and manufacturing perspective was discussed.
144.
Tsompanas M, Fyrigos I, Ntinas A V, Sirakoulis G Ch
Cellular automata implementation of Oregonator simulating light-sensitive Belousov--Zhabotinsky medium Journal Article
In: Nonlinear Dynamics, vol. 104, pp. 4103–4115, 2021.
@article{tsompanas2021cellular,
title = {Cellular automata implementation of Oregonator simulating light-sensitive Belousov--Zhabotinsky medium},
author = {Michail-Antisthenis Tsompanas and Iosif-Angelos Fyrigos and Adamatzky Vasileios Ntinas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/article/10.1007/s11071-021-06521-0},
doi = {doi.org/10.1007/s11071-021-06521-0},
year = {2021},
date = {2021-05-16},
urldate = {2021-01-01},
journal = {Nonlinear Dynamics},
volume = {104},
pages = {4103--4115},
publisher = {Springer},
abstract = {Cellular automata (CA) have been used to simulate a variety of different chemical, biological and physical phenomena. Their ability to emulate complex dynamics, emerging from simple local interactions of their elementary cells, made them a strong candidate for mimicking these phenomena, especially when accelerated computation through parallelization is required. Belousov\textendashZhabotinsky (BZ) is a class of chemical reactions that due to their potential as nonlinear chemical oscillators, have inspired scientists to use them as chemical computers. The Oregonator equations, which approximate the dynamics of BZ reactions, were implemented here using CA methods. This new modelling approach (CA-based Oregonator) was tested in terms of accuracy and efficiency against previous models and laboratory-based experimental results, while the benefits of this method were outlined. It was observed that the results from the CA-based Oregonator are in good agreement with both modelled and laboratory experiments. The main advantage of this method can be summarized as the acceleration achieved in current implementations (serial computers), but also towards potential future implementations in massively parallel computational systems (like field-programmable gate array hardware and nano-neuromorphic circuits) that have been proved to be good substrates for accelerating the implemented CA models.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Cellular automata (CA) have been used to simulate a variety of different chemical, biological and physical phenomena. Their ability to emulate complex dynamics, emerging from simple local interactions of their elementary cells, made them a strong candidate for mimicking these phenomena, especially when accelerated computation through parallelization is required. Belousov–Zhabotinsky (BZ) is a class of chemical reactions that due to their potential as nonlinear chemical oscillators, have inspired scientists to use them as chemical computers. The Oregonator equations, which approximate the dynamics of BZ reactions, were implemented here using CA methods. This new modelling approach (CA-based Oregonator) was tested in terms of accuracy and efficiency against previous models and laboratory-based experimental results, while the benefits of this method were outlined. It was observed that the results from the CA-based Oregonator are in good agreement with both modelled and laboratory experiments. The main advantage of this method can be summarized as the acceleration achieved in current implementations (serial computers), but also towards potential future implementations in massively parallel computational systems (like field-programmable gate array hardware and nano-neuromorphic circuits) that have been proved to be good substrates for accelerating the implemented CA models.
143.
Vasileiadis N, Karakolis P, Mandylas P, Ioannou-Sougleridis V, Normand P, Perego M, Komninou P, Ntinas V, Fyrigos I, Karafyllidis I, Sirakoulis G Ch, Dimitrakis P
Understanding the role of defects in silicon nitride-based resistive switching memories through oxygen doping Journal Article
In: IEEE Transactions on Nanotechnology, vol. 20, pp. 356–364, 2021.
@article{vasileiadis2021understanding,
title = {Understanding the role of defects in silicon nitride-based resistive switching memories through oxygen doping},
author = {Nikolaos Vasileiadis and Panagiotis Karakolis and Panagiotis Mandylas and Vassilios Ioannou-Sougleridis and Pascal Normand and Michele Perego and Philomela Komninou and Vasileios Ntinas and Iosif-Angelos Fyrigos and Ioannis Karafyllidis and Georgios Ch. Sirakoulis and Panagiotis Dimitrakis},
url = {https://ieeexplore.ieee.org/document/9403953},
doi = {10.1109/TNANO.2021.3072974},
year = {2021},
date = {2021-04-13},
urldate = {2021-01-01},
journal = {IEEE Transactions on Nanotechnology},
volume = {20},
pages = {356--364},
publisher = {IEEE},
abstract = {Resistive memories are promising candidates for replacing current nonvolatile memories and realize storage class memories. Moreover, they have memristive properties, with many discrete resistance levels and implement artificial synapses. The last years researchers have demonstrated RRAM chips used as accelerators in computing, following the new in-memory and neuromorphic computational approaches. Many different metal oxides have been used as resistance switching materials in MIM structures. Understanding of the switching mechanism is very critical for the modeling and the use of memristors in different applications. Here, we demonstrate the bipolar resistance switching of silicon nitride thin films using heavily doped Si and Cu as bottom and top-electrodes respectively. Next, we dope nitride with oxygen in order to introduce and modify the intrinsic nitride defects. Analysis of the current-voltage characteristics reveal that under space-charge limited conditions and by setting the appropriate current compliance, the operation condition of the RRAM cells can be tuned. Furthermore, resistance change can be obtained using appropriate SET/RESET pulsing sequences allowing the use of the devices in computing acceleration application. Impedance spectroscopy measurements clarify the presence of different mechanisms during SET and RESET. We prove through a customized measurement set-up and the appropriate control software that the initial charge-storage in the intrinsic nitride traps governs the resistance change.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Resistive memories are promising candidates for replacing current nonvolatile memories and realize storage class memories. Moreover, they have memristive properties, with many discrete resistance levels and implement artificial synapses. The last years researchers have demonstrated RRAM chips used as accelerators in computing, following the new in-memory and neuromorphic computational approaches. Many different metal oxides have been used as resistance switching materials in MIM structures. Understanding of the switching mechanism is very critical for the modeling and the use of memristors in different applications. Here, we demonstrate the bipolar resistance switching of silicon nitride thin films using heavily doped Si and Cu as bottom and top-electrodes respectively. Next, we dope nitride with oxygen in order to introduce and modify the intrinsic nitride defects. Analysis of the current-voltage characteristics reveal that under space-charge limited conditions and by setting the appropriate current compliance, the operation condition of the RRAM cells can be tuned. Furthermore, resistance change can be obtained using appropriate SET/RESET pulsing sequences allowing the use of the devices in computing acceleration application. Impedance spectroscopy measurements clarify the presence of different mechanisms during SET and RESET. We prove through a customized measurement set-up and the appropriate control software that the initial charge-storage in the intrinsic nitride traps governs the resistance change.
142.
Tsompanas M, Fyrigos I, Ntinas V, Adamatzky A, Sirakoulis G Ch
Light sensitive Belousov--Zhabotinsky medium accommodates multiple logic gates Journal Article
In: Biosystems, vol. 206, pp. 104447, 2021.
@article{tsompanas2021light,
title = {Light sensitive Belousov--Zhabotinsky medium accommodates multiple logic gates},
author = {Michail-Antisthenis Tsompanas and Iosif-Angelos Fyrigos and Vasileios Ntinas and Andrew Adamatzky and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0303264721001015?via%3Dihub},
doi = {doi.org/10.1016/j.biosystems.2021.104447},
year = {2021},
date = {2021-03-24},
urldate = {2021-03-24},
journal = {Biosystems},
volume = {206},
pages = {104447},
publisher = {Elsevier},
abstract = {Computational functionality has been implemented successfully on chemical reactions in living systems. In the case of Belousov\textendashZhabotinsky (BZ) reaction, this was achieved by using collision-based techniques and by exploiting the light sensitivity of BZ. In order to unveil the computational capacity of the light sensitive BZ medium and the possibility to implement re-configurable logic, the design of multiple logic gates in a fixed BZ reservoir was investigated. The three basic logic gates (namely NOT, OR and AND) were studied to prove the Turing completeness of the architecture. Namely, all possible Boolean functions can be implemented as a combination of these logic gates. Nonetheless, a more complicated logic function was investigated, aiming to illustrate further capabilities of a fixed size BZ reservoir. The experiments executed within this study were implemented with a Cellular Automata (CA)-based model of the Oregonator equations that simulate excitation and wave propagation on a light sensitive BZ thin film. Given that conventional or von Neumann architecture computations is proved possible on the proposed configuration, the next step would be the realization of unconventional types of computation, such as neuromorphic and fuzzy computations, where the chemical substrate may prove more efficient than silicon.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Computational functionality has been implemented successfully on chemical reactions in living systems. In the case of Belousov–Zhabotinsky (BZ) reaction, this was achieved by using collision-based techniques and by exploiting the light sensitivity of BZ. In order to unveil the computational capacity of the light sensitive BZ medium and the possibility to implement re-configurable logic, the design of multiple logic gates in a fixed BZ reservoir was investigated. The three basic logic gates (namely NOT, OR and AND) were studied to prove the Turing completeness of the architecture. Namely, all possible Boolean functions can be implemented as a combination of these logic gates. Nonetheless, a more complicated logic function was investigated, aiming to illustrate further capabilities of a fixed size BZ reservoir. The experiments executed within this study were implemented with a Cellular Automata (CA)-based model of the Oregonator equations that simulate excitation and wave propagation on a light sensitive BZ thin film. Given that conventional or von Neumann architecture computations is proved possible on the proposed configuration, the next step would be the realization of unconventional types of computation, such as neuromorphic and fuzzy computations, where the chemical substrate may prove more efficient than silicon.
141.
Bousoulas P, Papakonstantinopoulos C, Kitsios S, Moustakas K, Sirakoulis G Ch, Tsoukalas D
Emulating Artificial Synaptic Plasticity Characteristics from SiO2-Based Conductive Bridge Memories with Pt Nanoparticles Journal Article
In: Micromachines, vol. 12, no. 3, pp. 306, 2021.
@article{bousoulas2021emulating,
title = {Emulating Artificial Synaptic Plasticity Characteristics from SiO2-Based Conductive Bridge Memories with Pt Nanoparticles},
author = {Panagiotis Bousoulas and Charalampos Papakonstantinopoulos and Stavros Kitsios and Konstantinos Moustakas and Georgios Ch. Sirakoulis and Dimitris Tsoukalas},
url = {https://www.mdpi.com/2072-666X/12/3/306},
doi = {doi.org/10.3390/mi12030306},
year = {2021},
date = {2021-03-15},
urldate = {2021-03-15},
journal = {Micromachines},
volume = {12},
number = {3},
pages = {306},
publisher = {Multidisciplinary Digital Publishing Institute},
abstract = {The quick growth of information technology has necessitated the need for developing novel electronic devices capable of performing novel neuromorphic computations with low power consumption and a high degree of accuracy. In order to achieve this goal, it is of vital importance to devise artificial neural networks with inherent capabilities of emulating various synaptic properties that play a key role in the learning procedures. Along these lines, we report here the direct impact of a dense layer of Pt nanoparticles that plays the role of the bottom electrode, on the manifestation of the bipolar switching effect within SiO2-based conductive bridge memories. Valuable insights regarding the influence of the thermal conductivity value of the bottom electrode on the conducting filament growth mechanism are provided through the application of a numerical model. The implementation of an intermediate switching transition slope during the SET transition permits the emulation of various artificial synaptic functionalities, such as short-term plasticity, including paired-pulsed facilitation and paired-pulse depression, long-term plasticity and four different types of spike-dependent plasticity. Our approach provides valuable insights toward the development of multifunctional synaptic elements that operate with low power consumption and exhibit biological-like behavior. },
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The quick growth of information technology has necessitated the need for developing novel electronic devices capable of performing novel neuromorphic computations with low power consumption and a high degree of accuracy. In order to achieve this goal, it is of vital importance to devise artificial neural networks with inherent capabilities of emulating various synaptic properties that play a key role in the learning procedures. Along these lines, we report here the direct impact of a dense layer of Pt nanoparticles that plays the role of the bottom electrode, on the manifestation of the bipolar switching effect within SiO2-based conductive bridge memories. Valuable insights regarding the influence of the thermal conductivity value of the bottom electrode on the conducting filament growth mechanism are provided through the application of a numerical model. The implementation of an intermediate switching transition slope during the SET transition permits the emulation of various artificial synaptic functionalities, such as short-term plasticity, including paired-pulsed facilitation and paired-pulse depression, long-term plasticity and four different types of spike-dependent plasticity. Our approach provides valuable insights toward the development of multifunctional synaptic elements that operate with low power consumption and exhibit biological-like behavior.
140.
Karamani R, Fyrigos I, Tsakalos K, Ntinas V, Tsompanas M, Sirakoulis G Ch
Memristive learning cellular automata for edge detection Journal Article
In: Chaos, Solitons & Fractals, vol. 145, pp. 110700, 2021.
@article{karamani2021memristive,
title = {Memristive learning cellular automata for edge detection},
author = {Rafailia-Eleni Karamani and Iosif-Angelos Fyrigos and Karolos-Alexandros Tsakalos and Vasileios Ntinas and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0960077921000539},
doi = {doi.org/10.1016/j.chaos.2021.110700},
year = {2021},
date = {2021-02-25},
urldate = {2021-02-25},
journal = {Chaos, Solitons \& Fractals},
volume = {145},
pages = {110700},
publisher = {Elsevier},
abstract = {Memristors have been utilized as an unconventional computational substrate and gained interest as a medium to implement neuromorphic computations. A mathematical model that also proved its potential is Learning Cellular Automata, that is an amalgam of Cellular Automata and Learning Automata. The realization of the common characteristics of memristive circuits and Learning Cellular Automata can only lead to their combination. Namely, both manage to blend storage and processing capabilities in their basic entity. This study involves the definition of memristive circuits that realize the computing behavior of Learning Cellular Automata. An example of this methodology is provided with the description of the implementation of edge detection for image processing.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Memristors have been utilized as an unconventional computational substrate and gained interest as a medium to implement neuromorphic computations. A mathematical model that also proved its potential is Learning Cellular Automata, that is an amalgam of Cellular Automata and Learning Automata. The realization of the common characteristics of memristive circuits and Learning Cellular Automata can only lead to their combination. Namely, both manage to blend storage and processing capabilities in their basic entity. This study involves the definition of memristive circuits that realize the computing behavior of Learning Cellular Automata. An example of this methodology is provided with the description of the implementation of edge detection for image processing.
139.
Zhang Y, Wang J, Lian C, Bai Y, Wang G, Zhang Z, Zheng Z, Chen L, Zhang K, Sirakoulis G Ch, Zhang Y
Time-Domain Computing in Memory Using Spintronics for Energy-Efficient Convolutional Neural Network Journal Article
In: IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 68, no. 3, pp. 1193–1205, 2021.
@article{zhang2021time,
title = {Time-Domain Computing in Memory Using Spintronics for Energy-Efficient Convolutional Neural Network},
author = {Yue Zhang and Jinkai Wang and Chenyu Lian and Yining Bai and Guanda Wang and Zhizhong Zhang and Zhenyi Zheng and Lei Chen and Kun Zhang and Georgios Ch. Sirakoulis and Youguang Zhang},
url = {https://ieeexplore.ieee.org/document/9345759},
doi = {10.1109/TCSI.2021.3055830},
year = {2021},
date = {2021-02-03},
urldate = {2021-02-03},
journal = {IEEE Transactions on Circuits and Systems I: Regular Papers},
volume = {68},
number = {3},
pages = {1193--1205},
publisher = {IEEE},
abstract = {The data transfer bottleneck in Von Neumann architecture owing to the separation between processor and memory hinders the development of high-performance computing. The computing in memory (CIM) concept is widely considered as a promising solution for overcoming this issue. In this article, we present a time-domain CIM (TD-CIM) scheme using spintronics, which can be applied to construct the energy-efficient convolutional neural network (CNN). Basic Boolean logic operations are implemented through recording the bit-line output at different moments. A multi-addend addition mechanism is then introduced based on the TD-CIM circuit, which can eliminate the cascaded full adders. To further optimize the compatibility of TD-CIM circuit for CNN, we also propose a quantization method that transforms floating-point parameters of pre-trained CNN models into fixed-point parameters. Finally, we build a TD-CIM architecture integrating with a highly reconfigurable array of field-free spin-orbit torque magnetic random access memory (SOT-MRAM) and evaluate its benefits for the quantized CNN. By performing digit recognition with the MNIST dataset, we find that the delay and energy are respectively reduced by 1.22.7 times and 2.4×10^3 -1.1×10^4 times compared with STT-CIM and CRAM based on spintronic memory. Finally, the recognition accuracy can reach 98.65% and 91.11% on MNIST and CIFAR10, respectively.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The data transfer bottleneck in Von Neumann architecture owing to the separation between processor and memory hinders the development of high-performance computing. The computing in memory (CIM) concept is widely considered as a promising solution for overcoming this issue. In this article, we present a time-domain CIM (TD-CIM) scheme using spintronics, which can be applied to construct the energy-efficient convolutional neural network (CNN). Basic Boolean logic operations are implemented through recording the bit-line output at different moments. A multi-addend addition mechanism is then introduced based on the TD-CIM circuit, which can eliminate the cascaded full adders. To further optimize the compatibility of TD-CIM circuit for CNN, we also propose a quantization method that transforms floating-point parameters of pre-trained CNN models into fixed-point parameters. Finally, we build a TD-CIM architecture integrating with a highly reconfigurable array of field-free spin-orbit torque magnetic random access memory (SOT-MRAM) and evaluate its benefits for the quantized CNN. By performing digit recognition with the MNIST dataset, we find that the delay and energy are respectively reduced by 1.22.7 times and 2.4×10^3 -1.1×10^4 times compared with STT-CIM and CRAM based on spintronic memory. Finally, the recognition accuracy can reach 98.65% and 91.11% on MNIST and CIFAR10, respectively.
138.
Rallis K, Dimitrakis P, Karafyllidis I G, Rubio A, Sirakoulis G Ch
Electronic Properties of Graphene Nanoribbons With Defects Journal Article
In: IEEE Transactions on Nanotechnology, vol. 20, pp. 151–160, 2021.
@article{rallis2021electronic,
title = {Electronic Properties of Graphene Nanoribbons With Defects},
author = {Konstantinos Rallis and Panagiotis Dimitrakis and Ioannis G Karafyllidis and Antonio Rubio and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/9337210},
doi = {10.1109/TNANO.2021.3055135},
year = {2021},
date = {2021-01-27},
urldate = {2021-01-27},
journal = {IEEE Transactions on Nanotechnology},
volume = {20},
pages = {151--160},
publisher = {IEEE},
abstract = {Graphene nanoribbons (GNRs) are the most important emerging Graphene structures for nanoelectronic and sensor applications. GNRs with perfect lattices have been extensively studied, but fabricated GNRs contain lattice defects the effect of which on their electronic properties has not been studied extensively enough. In this paper, we apply the Non-Equilibrium Green's function (NEGF) method combined with tight-binding Hamiltonians to investigate the effect of lattice defects on the conductance of GNRs. We specifically study, butterfly shaped GNRs, which operate effectively as switches, and have been used in CMOS-like architectures. The cases of the most usual defects, namely the single and double vacancy have been analytically examined. The effect of these vacancies was computed by placing them in different regions and with various numbers on GNR nano-devices, namely edges, main body, contacts and narrow regions. The computation results are presented in the form of energy dispersion diagrams as well as diagrams of maximum conductance as a function of the number of lattice defects. We also present results on the defect tolerance of the butterfly shaped GNR devices.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Graphene nanoribbons (GNRs) are the most important emerging Graphene structures for nanoelectronic and sensor applications. GNRs with perfect lattices have been extensively studied, but fabricated GNRs contain lattice defects the effect of which on their electronic properties has not been studied extensively enough. In this paper, we apply the Non-Equilibrium Green's function (NEGF) method combined with tight-binding Hamiltonians to investigate the effect of lattice defects on the conductance of GNRs. We specifically study, butterfly shaped GNRs, which operate effectively as switches, and have been used in CMOS-like architectures. The cases of the most usual defects, namely the single and double vacancy have been analytically examined. The effect of these vacancies was computed by placing them in different regions and with various numbers on GNR nano-devices, namely edges, main body, contacts and narrow regions. The computation results are presented in the form of energy dispersion diagrams as well as diagrams of maximum conductance as a function of the number of lattice defects. We also present results on the defect tolerance of the butterfly shaped GNR devices.
137.
Adamatzky A, Chiolerio A, Sirakoulis G Ch
Electrical Resistive Spiking of Fungi Journal Article
In: Biophysical Reviews and Letters, vol. 16, no. 01, pp. 1–7, 2021.
@article{adamatzky2021electrical,
title = {Electrical Resistive Spiking of Fungi},
author = {Andrew Adamatzky and Alessandro Chiolerio and Georgios Ch. Sirakoulis},
url = {https://www.worldscientific.com/doi/abs/10.1142/S1793048021500016},
doi = {doi.org/10.1142/S1793048021500016},
year = {2021},
date = {2021-01-21},
urldate = {2021-01-21},
journal = {Biophysical Reviews and Letters},
volume = {16},
number = {01},
pages = {1--7},
publisher = {World Scientific},
abstract = {We study long-term electrical resistance dynamics in mycelium and fruit bodies of oyster fungi P. ostreatus. A nearly homogeneous sheet of mycelium on the surface of a growth substrate exhibits trains of resistance spikes. The average width of spikes is c. 23min and the average amplitude is c. 1kΩ. The distance between neighboring spikes in a train of spikes is c. 30min. Typically, there are 4\textendash6 spikes in a train of spikes. Two types of electrical resistance spikes trains are found in fruit bodies: low frequency and high amplitude (28min spike width, 1.6kΩ amplitude, 57min distance between spikes) and high frequency and low amplitude (10min width, 0.6kΩ amplitude, 44min distance between spikes). The findings could be applied in monitoring of physiological states of fungi and future development of living electronic devices and sensors.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We study long-term electrical resistance dynamics in mycelium and fruit bodies of oyster fungi P. ostreatus. A nearly homogeneous sheet of mycelium on the surface of a growth substrate exhibits trains of resistance spikes. The average width of spikes is c. 23min and the average amplitude is c. 1kΩ. The distance between neighboring spikes in a train of spikes is c. 30min. Typically, there are 4–6 spikes in a train of spikes. Two types of electrical resistance spikes trains are found in fruit bodies: low frequency and high amplitude (28min spike width, 1.6kΩ amplitude, 57min distance between spikes) and high frequency and low amplitude (10min width, 0.6kΩ amplitude, 44min distance between spikes). The findings could be applied in monitoring of physiological states of fungi and future development of living electronic devices and sensors.
136.
Fyrigos I, Ntinas V, Sirakoulis G Ch, Dimitrakis P, Karafyllidis I
Quantum Mechanical Model for Filament Formation in Metal-Insulator-Metal Memristors Journal Article
In: IEEE Transactions on Nanotechnology, vol. 106, pp. 113–122, 2021.
@article{fyrigos2021quantum,
title = {Quantum Mechanical Model for Filament Formation in Metal-Insulator-Metal Memristors},
author = {Iosif-Angelos Fyrigos and Vasileios Ntinas and Georgios. Ch. Sirakoulis and Panagiotis Dimitrakis and Ioannis Karafyllidis},
url = {https://ieeexplore.ieee.org/document/9316152},
doi = {10.1109/TNANO.2021.3049632},
year = {2021},
date = {2021-01-06},
urldate = {2021-01-01},
journal = {IEEE Transactions on Nanotechnology},
volume = {106},
pages = {113--122},
publisher = {IEEE},
abstract = {Metal-Insulator-Metal type memristors as emergent nano-electronic devices have been successfully fabricated and used in non-conventional and neuromorphic computing systems in the last years. Several behavioral or physical based models have been developed to explain their operation and to optimize their fabrication parameters. Among them, the resistance switching of the insulating layer due to the formation of conductive filaments is the most well respected and experimentally proven. All existing memristor models are trade-offs between accuracy, universality and realism, but, to the best of our knowledge, none of them is purely characterized as quantum mechanical, despite the fact that quantum mechanical processes are a major part of the memristor operation. In this paper, we employ quantum mechanical methods to develop a complete and accurate filamentary model for the resistance variation during memristor's operating cycle. More specifically, we apply quantum walks to model and compute the motion of atoms forming the filament, tight-binding Hamiltonians to capture the filament structure and the Non-Equilibrium Green's Function (NEGF) method to compute the conductance of the device. Furthermore, we proceeded with the parallelization of the overall model through Graphical Processing Units (GPUs) to accelerate our computations and enhance the model's performance adequately. Our simulation results successfully reproduce the resistive switching characteristics of memristors devices, match with existing fabricated devices experimental data, prove the efficacy and robustness of the proposed model in terms of multi-parameterization, and provide a new and useful insight into its operation.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Metal-Insulator-Metal type memristors as emergent nano-electronic devices have been successfully fabricated and used in non-conventional and neuromorphic computing systems in the last years. Several behavioral or physical based models have been developed to explain their operation and to optimize their fabrication parameters. Among them, the resistance switching of the insulating layer due to the formation of conductive filaments is the most well respected and experimentally proven. All existing memristor models are trade-offs between accuracy, universality and realism, but, to the best of our knowledge, none of them is purely characterized as quantum mechanical, despite the fact that quantum mechanical processes are a major part of the memristor operation. In this paper, we employ quantum mechanical methods to develop a complete and accurate filamentary model for the resistance variation during memristor's operating cycle. More specifically, we apply quantum walks to model and compute the motion of atoms forming the filament, tight-binding Hamiltonians to capture the filament structure and the Non-Equilibrium Green's Function (NEGF) method to compute the conductance of the device. Furthermore, we proceeded with the parallelization of the overall model through Graphical Processing Units (GPUs) to accelerate our computations and enhance the model's performance adequately. Our simulation results successfully reproduce the resistive switching characteristics of memristors devices, match with existing fabricated devices experimental data, prove the efficacy and robustness of the proposed model in terms of multi-parameterization, and provide a new and useful insight into its operation.
135.
Liolis O, Sirakoulis G Ch, Adamatzky A
Conway's Game of Life in Quantum-dot Cellular Automata Journal Article
In: Microelectronics Journal, vol. 109, pp. 104972, 2021.
@article{liolis2021conway,
title = {Conway's Game of Life in Quantum-dot Cellular Automata},
author = {Orestis Liolis and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://www.sciencedirect.com/science/article/pii/S0026269220305711},
doi = {doi.org/10.1016/j.mejo.2020.104972},
year = {2021},
date = {2021-01-05},
urldate = {2021-01-05},
journal = {Microelectronics Journal},
volume = {109},
pages = {104972},
publisher = {Elsevier},
abstract = {Quantum-dot Cellular Automata (QCA) technology has been considered as one promising solution to deal with the beyond Moore's law and after von Neumann's computing architecture issues, bringing advantages such as high performance and low energy consumption. In this paper, we focus on the implementation in QCA technology of one of the most well-known Cellular Automaton (CA), namely the Game of Life (GoL). GoL introduced by John Conway is one of the most interesting CA, due to the abilities of self-production and computational universality. In this work, a novel fault-tolerant implementation of GoL in programmable crossbar architecture is proposed delivering the computation universality of the GoL in a plausible way. For the provided design, fault-tolerant majority and inverter gates are also presented in a programmable crossbar architecture. Such an implementation provides the QCA circuits designers with an almost endless library of ready-to-use applications, in various scientific fields. Extensive performance evaluation coupled with appropriate simulation results validate the efficacy of the proposed QCA design depicting appropriately the inherent complexity of the GoL rules and structures.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Quantum-dot Cellular Automata (QCA) technology has been considered as one promising solution to deal with the beyond Moore's law and after von Neumann's computing architecture issues, bringing advantages such as high performance and low energy consumption. In this paper, we focus on the implementation in QCA technology of one of the most well-known Cellular Automaton (CA), namely the Game of Life (GoL). GoL introduced by John Conway is one of the most interesting CA, due to the abilities of self-production and computational universality. In this work, a novel fault-tolerant implementation of GoL in programmable crossbar architecture is proposed delivering the computation universality of the GoL in a plausible way. For the provided design, fault-tolerant majority and inverter gates are also presented in a programmable crossbar architecture. Such an implementation provides the QCA circuits designers with an almost endless library of ready-to-use applications, in various scientific fields. Extensive performance evaluation coupled with appropriate simulation results validate the efficacy of the proposed QCA design depicting appropriately the inherent complexity of the GoL rules and structures.
134.
Ntinas V, Rubio A, Sirakoulis G Ch
Probabilistic Resistive Switching Device Modeling Based on Markov Jump Processes Journal Article
In: IEEE Access, vol. 9, pp. 983–988, 2020.
@article{ntinas2020probabilistic,
title = {Probabilistic Resistive Switching Device Modeling Based on Markov Jump Processes},
author = {Vasileios Ntinas and Antonio Rubio and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/9276482},
doi = {10.1109/ACCESS.2020.3042012},
year = {2020},
date = {2020-12-02},
urldate = {2020-12-02},
journal = {IEEE Access},
volume = {9},
pages = {983--988},
publisher = {IEEE},
abstract = {In this work, a versatile mathematical framework for multi-state probabilistic modeling of Resistive Switching (RS) devices is proposed for the first time. The mathematical formulation of memristor and Markov jump processes are combined and, by using the notion of master equations for finite-states, the inherent probabilistic time-evolution of RS devices is sufficiently modeled. In particular, the methodology is generic enough and can be applied for N states; as a proof of concept, the proposed framework is further stressed for both a two-state RS paradigm, namely N = 2, and a multi-state device, namely N = 4. The presented I-V results demonstrate in a qualitative and quantitative manner, adequate matching with other modeling approaches.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this work, a versatile mathematical framework for multi-state probabilistic modeling of Resistive Switching (RS) devices is proposed for the first time. The mathematical formulation of memristor and Markov jump processes are combined and, by using the notion of master equations for finite-states, the inherent probabilistic time-evolution of RS devices is sufficiently modeled. In particular, the methodology is generic enough and can be applied for N states; as a proof of concept, the proposed framework is further stressed for both a two-state RS paradigm, namely N = 2, and a multi-state device, namely N = 4. The presented I-V results demonstrate in a qualitative and quantitative manner, adequate matching with other modeling approaches.
133.
Liolis O, Mardiris V A, Sirakoulis G Ch, Karafyllidis I G
Synchronization in Quantum-Dot Cellular Automata Circuits and Systems Journal Article
In: IEEE Open Journal of Nanotechnology, vol. 1, pp. 145–156, 2020.
@article{liolis2020synchronization,
title = {Synchronization in Quantum-Dot Cellular Automata Circuits and Systems},
author = {Orestis Liolis and Vassilios A Mardiris and Georgios Ch. Sirakoulis and Ioannis G Karafyllidis},
url = {https://ieeexplore.ieee.org/document/9273228},
doi = {10.1109/OJNANO.2020.3041399},
year = {2020},
date = {2020-11-30},
urldate = {2020-11-30},
journal = {IEEE Open Journal of Nanotechnology},
volume = {1},
pages = {145--156},
publisher = {IEEE},
abstract = {Signal synchronization of large scale Quantum-dot Cellular Automata (QCA) circuits is one of the most complex QCA design challenges. More specifically, the QCA circuits synchronization problem, especially in the large circuits, is characterized as rather complex due to technology constraints. In this paper, by extensively analyzing the most important properties of the signal synchronization problem in QCA circuits, we propose an efficient design methodology to tackle the problem, based on the well-known from computer science, Firing Squad Synchronization Problem (FSSP). Comparing FSSP with the QCA circuits synchronization problem many similarities can be found. Among the numerous FSSP's algorithmic solutions in literature, the Mazoyer algorithm has proven to be the most efficient one. In this paper, a novel design and implementation in QCA technology of this algorithm is presented. Moreover, by the appropriate modification of the Mazoyer algorithm, we are able to propose a generic synchronization design methodology for QCA circuits and systems. This method is enhanced by a novel freezing technique, that makes it applicable to any QCA circuit and system as manifested by our corresponding simulation results. The proposed synchronization methodology is a universal design tool, that can be applied to exiting designs without increasing the complexity.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Signal synchronization of large scale Quantum-dot Cellular Automata (QCA) circuits is one of the most complex QCA design challenges. More specifically, the QCA circuits synchronization problem, especially in the large circuits, is characterized as rather complex due to technology constraints. In this paper, by extensively analyzing the most important properties of the signal synchronization problem in QCA circuits, we propose an efficient design methodology to tackle the problem, based on the well-known from computer science, Firing Squad Synchronization Problem (FSSP). Comparing FSSP with the QCA circuits synchronization problem many similarities can be found. Among the numerous FSSP's algorithmic solutions in literature, the Mazoyer algorithm has proven to be the most efficient one. In this paper, a novel design and implementation in QCA technology of this algorithm is presented. Moreover, by the appropriate modification of the Mazoyer algorithm, we are able to propose a generic synchronization design methodology for QCA circuits and systems. This method is enhanced by a novel freezing technique, that makes it applicable to any QCA circuit and system as manifested by our corresponding simulation results. The proposed synchronization methodology is a universal design tool, that can be applied to exiting designs without increasing the complexity.
132.
Ntinas V, Rubio A, Sirakoulis G Ch, Aguilera E S, Pedro M, Crespo-Yepes A, Martin-Martinez J, Rodriguez R, Nafria M
Power-Efficient Noise-Induced Reduction of ReRAM Cell’s Temporal Variability Effects Journal Article
In: IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 68, no. 4, pp. 1378–1382, 2020.
@article{ntinas2020power,
title = {Power-Efficient Noise-Induced Reduction of ReRAM Cell’s Temporal Variability Effects},
author = {Vasileios Ntinas and Antonio Rubio and Georgios Ch. Sirakoulis and Emili Salvador Aguilera and Marta Pedro and Albert Crespo-Yepes and Javier Martin-Martinez and Rosana Rodriguez and Montserrat Nafria},
url = {https://ieeexplore.ieee.org/abstract/document/9205867},
doi = {10.1109/TCSII.2020.3026950},
year = {2020},
date = {2020-09-25},
urldate = {2020-09-25},
journal = {IEEE Transactions on Circuits and Systems II: Express Briefs},
volume = {68},
number = {4},
pages = {1378--1382},
publisher = {IEEE},
abstract = {Resistive Random Access Memory (ReRAM) is a promising novel memory technology for non-volatile storing, with low-power operation and ultra-high area density. However, ReRAM memories still face issues through commercialization, mainly owing to the fact that the high fabrication variations and the stochastic switching of the manufactured ReRAM devices cause high Bit Error Rate (BER). Given that ReRAM devices are nonlinear elements, the nonlinear phenomenon of Stochastic Resonance (SR), which defines that an input disturbance with specific characteristics can improve the total performance of the nonlinear system, is used to reduce the ReRAM cell's BER. Thus, in this brief, the BER of a single ReRAM cell is explored, using the Stanford PKU model, and is improved after the application of specific additive input noise. The power dissipation of the proposed approach is also evaluated and compared with the consideration of higher amplitude writing pulses in the lack of noise, showing that the proposed noise-induced technique can decrease the BER without the excessive increase of the power dissipation. As a first step, towards the experimental verification of the proposed method, noise-induced measurements on a single fabricated ReRAM device are also performed. Overall, the presented results of the BER reduction with low power dissipation, reaching up to 3.26× less power consumption considering 100 ns writing pulses, are encouraging for ReRAM designers, delivering a circuit-level solution against the device-level problem.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Resistive Random Access Memory (ReRAM) is a promising novel memory technology for non-volatile storing, with low-power operation and ultra-high area density. However, ReRAM memories still face issues through commercialization, mainly owing to the fact that the high fabrication variations and the stochastic switching of the manufactured ReRAM devices cause high Bit Error Rate (BER). Given that ReRAM devices are nonlinear elements, the nonlinear phenomenon of Stochastic Resonance (SR), which defines that an input disturbance with specific characteristics can improve the total performance of the nonlinear system, is used to reduce the ReRAM cell's BER. Thus, in this brief, the BER of a single ReRAM cell is explored, using the Stanford PKU model, and is improved after the application of specific additive input noise. The power dissipation of the proposed approach is also evaluated and compared with the consideration of higher amplitude writing pulses in the lack of noise, showing that the proposed noise-induced technique can decrease the BER without the excessive increase of the power dissipation. As a first step, towards the experimental verification of the proposed method, noise-induced measurements on a single fabricated ReRAM device are also performed. Overall, the presented results of the BER reduction with low power dissipation, reaching up to 3.26× less power consumption considering 100 ns writing pulses, are encouraging for ReRAM designers, delivering a circuit-level solution against the device-level problem.
131.
Floros T, Tsakalos K, Dourvas N, Tsompanas M, Sirakoulis G Ch
Unconventional Bio-Inspired Model for Design of Logic Gates Journal Article
In: International Journal of Unconventional Computing, vol. 15, no. 3, pp. 141–156, 2020.
@article{floros2020unconventional,
title = {Unconventional Bio-Inspired Model for Design of Logic Gates},
author = {Theofanis Floros and Karolos-Alexandros Tsakalos and Nikolaos Dourvas and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis},
url = {https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-15-number-3-2020/ijuc-15-3-p-141-156/},
year = {2020},
date = {2020-08-01},
urldate = {2020-01-01},
journal = {International Journal of Unconventional Computing},
volume = {15},
number = {3},
pages = {141--156},
publisher = {Old City Publishing},
abstract = {During the last years, a well studied biological substrate, namely Physarum polycephalum, has been proven efficient on finding appropriate and efficient solutions in hard to solve complex mathematical problems. The plasmodium of P. polycephalum is a single-cell that serves as a prosperous bio-computational example. Consequently, it has been successfully utilized in the past to solve a variety of path problems in graphs and combinatorial problems. In this work, this interesting behaviour is mimicked by a robust unconventional computational model, drawing inspiration from the notion of Cellular and Learning Automata. Namely, we employ principles of Cellular Automata (CAs) enriched with learning capabilities to develop a robust computational model, able of modelling appropriately the aforementioned biological substrate and, thus, capturing its computational capabilities. CAs are very efficient in modelling biological systems and solving scientific problems, owing to their ability of incarnating essential properties of a system where global behaviour arises as an effect of simple components, interacting locally. The resulting computational tool, after combining CAs with learning capabilities, should be appropriate for modelling the behaviour of living organisms. Thus, the inherent abilities and computational characteristics of the proposed bio-inspired model are stressed towards the experimental verification of Physarum’s ability to model Logic Gates, while trying to find minimal paths in properly configured mazes with food sources. The presented simulation results for various Logic Gates are found in good agreement, both qualitatively and quantitatively, with the corresponding experimental results, proving the efficacy of this unconventional bio-inspired model and providing useful insights for its enhanced usage in various computing applications.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
During the last years, a well studied biological substrate, namely Physarum polycephalum, has been proven efficient on finding appropriate and efficient solutions in hard to solve complex mathematical problems. The plasmodium of P. polycephalum is a single-cell that serves as a prosperous bio-computational example. Consequently, it has been successfully utilized in the past to solve a variety of path problems in graphs and combinatorial problems. In this work, this interesting behaviour is mimicked by a robust unconventional computational model, drawing inspiration from the notion of Cellular and Learning Automata. Namely, we employ principles of Cellular Automata (CAs) enriched with learning capabilities to develop a robust computational model, able of modelling appropriately the aforementioned biological substrate and, thus, capturing its computational capabilities. CAs are very efficient in modelling biological systems and solving scientific problems, owing to their ability of incarnating essential properties of a system where global behaviour arises as an effect of simple components, interacting locally. The resulting computational tool, after combining CAs with learning capabilities, should be appropriate for modelling the behaviour of living organisms. Thus, the inherent abilities and computational characteristics of the proposed bio-inspired model are stressed towards the experimental verification of Physarum’s ability to model Logic Gates, while trying to find minimal paths in properly configured mazes with food sources. The presented simulation results for various Logic Gates are found in good agreement, both qualitatively and quantitatively, with the corresponding experimental results, proving the efficacy of this unconventional bio-inspired model and providing useful insights for its enhanced usage in various computing applications.
130.
Christodoulou K, Chatzichristofis S A, Sirakoulis G Ch, Christodoulou P
RandomBlocks: A Transparent, Verifiable Blockchain-based System for Random Numbers Journal Article
In: Journal of Cellular Automata, vol. 14, no. 5-6, pp. 335–349, 2019.
@article{christodoulou2019randomblocks,
title = {RandomBlocks: A Transparent, Verifiable Blockchain-based System for Random Numbers},
author = {Klitos Christodoulou and Savvas A. Chatzichristofis and Georgios Ch. Sirakoulis and Panayiotis Christodoulou},
url = {https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-14-number-5-6-2019/jca-14-5-6-p-335-349/},
year = {2019},
date = {2019-12-01},
urldate = {2019-01-01},
journal = {Journal of Cellular Automata},
volume = {14},
number = {5-6},
pages = {335--349},
publisher = {Old City Publishing},
abstract = {Games-of-chance require high-levels of trust between participants that is often uncertain and difficult to enforce. The unique characteristics introduced by the blockchain technology can be leveraged to inform a verifiable but transparent pseudo-random generation process that at the same time eliminates the need of an external trustee service or oracle to guarantee the fair execution of the process. We propose a process that builds on a one-dimensional Cellular Automaton (CA) where the evolution of the CA aligns to the evolution of a blockchain. Given an initial seed defined as the point in time where the evolution of the CA is triggered, the set of transition rules, along with the finite number of evolution steps, any external oracle is able to verify and backtrack (but not predict) the outcome of the process. The effectiveness of the implemented system is confirmed by the use of various statistical testing suites that confirm the existence of a set of statistical properties required to produce sufficient pseudo-random number sequences.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Games-of-chance require high-levels of trust between participants that is often uncertain and difficult to enforce. The unique characteristics introduced by the blockchain technology can be leveraged to inform a verifiable but transparent pseudo-random generation process that at the same time eliminates the need of an external trustee service or oracle to guarantee the fair execution of the process. We propose a process that builds on a one-dimensional Cellular Automaton (CA) where the evolution of the CA aligns to the evolution of a blockchain. Given an initial seed defined as the point in time where the evolution of the CA is triggered, the set of transition rules, along with the finite number of evolution steps, any external oracle is able to verify and backtrack (but not predict) the outcome of the process. The effectiveness of the implemented system is confirmed by the use of various statistical testing suites that confirm the existence of a set of statistical properties required to produce sufficient pseudo-random number sequences.
129.
Karafyllidis I, Sirakoulis G Ch, Dimitrakis P
Memristive Quantum Computing Simulator Journal Article
In: IEEE Transactions on Nanotechnology, vol. 18, pp. 1015–1022, 2019.
@article{karafyllidis2019memristive,
title = {Memristive Quantum Computing Simulator},
author = {Ioannis Karafyllidis and Georgios Ch. Sirakoulis and Panagiotis Dimitrakis},
url = {https://ieeexplore.ieee.org/document/8846603},
doi = {10.1109/TNANO.2019.2941763},
year = {2019},
date = {2019-09-23},
urldate = {2019-01-01},
journal = {IEEE Transactions on Nanotechnology},
volume = {18},
pages = {1015--1022},
publisher = {IEEE},
abstract = {One of the most promising and powerful candidates for future computing is the notion of universal quantum computer. A vital advance towards this direction is the development of quantum simulators and their possible implementation either as standalone quantum systems or as compatible software for classical computers with pros and cons. On the other hand, memristive computing has been proposed recently as a tentative unconventional computing scheme promoting the idea of information storage and processing in the same nanoelectronic device. In this paper we present a memristive quantum computing simulator by coupling quantum simulation principles with memristor aspects and enabling us to tackle the existing difficulties on qubit representation in conventional computing systems. For doing so, we utilize the memristances of identical memristors to represent in 3D the qubit state while its corresponding evolution is defined by the memristors input voltages. In particular, we introduce an appropriate correspondence among the aforementioned memristor voltages and the general qubit state rotation, i.e., the one-qubit quantum gates, and as such we reproduce the rotations imposed by the action of quantum gates in the 3D memristance space. Moreover, we also define the action of the CNOT two-qubit gate and simulate entanglement between two qubits paving the way towards the establishment of a universal set for quantum computing. Our results show that, memristor circuits can simulate effectively quantum computations.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
One of the most promising and powerful candidates for future computing is the notion of universal quantum computer. A vital advance towards this direction is the development of quantum simulators and their possible implementation either as standalone quantum systems or as compatible software for classical computers with pros and cons. On the other hand, memristive computing has been proposed recently as a tentative unconventional computing scheme promoting the idea of information storage and processing in the same nanoelectronic device. In this paper we present a memristive quantum computing simulator by coupling quantum simulation principles with memristor aspects and enabling us to tackle the existing difficulties on qubit representation in conventional computing systems. For doing so, we utilize the memristances of identical memristors to represent in 3D the qubit state while its corresponding evolution is defined by the memristors input voltages. In particular, we introduce an appropriate correspondence among the aforementioned memristor voltages and the general qubit state rotation, i.e., the one-qubit quantum gates, and as such we reproduce the rotations imposed by the action of quantum gates in the 3D memristance space. Moreover, we also define the action of the CNOT two-qubit gate and simulate entanglement between two qubits paving the way towards the establishment of a universal set for quantum computing. Our results show that, memristor circuits can simulate effectively quantum computations.
128.
Dourvas N, Sirakoulis G Ch, Adamatzky A I
Parallel Accelerated Virtual Physarum Lab Based on Cellular Automata Agents Journal Article
In: IEEE Access, vol. 7, no. 1, pp. 98306–98318, 2019.
@article{dourvas2019parallel,
title = {Parallel Accelerated Virtual Physarum Lab Based on Cellular Automata Agents},
author = {Nikolaos Dourvas and Georgios Ch. Sirakoulis and Andrew I. Adamatzky},
url = {https://ieeexplore.ieee.org/document/8758416},
doi = {10.1109/ACCESS.2019.2927815},
year = {2019},
date = {2019-07-09},
urldate = {2019-01-01},
journal = {IEEE Access},
volume = {7},
number = {1},
pages = {98306--98318},
publisher = {IEEE},
abstract = {Self-aware and self-expressive physical systems are inspiring new methodologies for engineering solutions of complex computing problems. Among many other examples, the slime mold Physarum Polycephalum exhibits self-awareness and self-expressiveness while adapting to changes in its dynamical environment and solving resource-consuming problems like shortest path, proximity graphs or optimization of transport networks. As such, the modeling of the slime mold's behavior is essential when designing bio-inspired algorithms and hardware prototypes. The goal of this paper is to combine one of the powerful parallel computational tools, cellular automata (CA) with the adaptive potential of Physarum slime mold. Namely, we propose a CA model and multi-agent approach to imitate the behavior of the plasmodium. We then test the efficacy of the proposed model on graph problems such as the maze problem or the traveling salesman problem (TSP). Finally, the virtual Physarum model is evaluated on a data set for pattern recognition purposes and achieves to form very effectively the letters of the alphabet, especially when compared with real experiments performed to prove the efficacy of the proposed model. Furthermore, to exploit the CA's inherent parallelism and make the model's responses faster, both GPU and hardware implementations are proposed and compared. As a result, an accelerated virtual lab is developed which uses a multi-agent CA model to describe the behavior of plasmodium and can be used as an intelligent, autonomous, self-adaptive system in various heterogeneous and unknown environments spanning from different types of graph problems up to real life-time applications.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Self-aware and self-expressive physical systems are inspiring new methodologies for engineering solutions of complex computing problems. Among many other examples, the slime mold Physarum Polycephalum exhibits self-awareness and self-expressiveness while adapting to changes in its dynamical environment and solving resource-consuming problems like shortest path, proximity graphs or optimization of transport networks. As such, the modeling of the slime mold's behavior is essential when designing bio-inspired algorithms and hardware prototypes. The goal of this paper is to combine one of the powerful parallel computational tools, cellular automata (CA) with the adaptive potential of Physarum slime mold. Namely, we propose a CA model and multi-agent approach to imitate the behavior of the plasmodium. We then test the efficacy of the proposed model on graph problems such as the maze problem or the traveling salesman problem (TSP). Finally, the virtual Physarum model is evaluated on a data set for pattern recognition purposes and achieves to form very effectively the letters of the alphabet, especially when compared with real experiments performed to prove the efficacy of the proposed model. Furthermore, to exploit the CA's inherent parallelism and make the model's responses faster, both GPU and hardware implementations are proposed and compared. As a result, an accelerated virtual lab is developed which uses a multi-agent CA model to describe the behavior of plasmodium and can be used as an intelligent, autonomous, self-adaptive system in various heterogeneous and unknown environments spanning from different types of graph problems up to real life-time applications.
127.
Gomez J, Vourkas I, Abusleme A, Sirakoulis G Ch, Rubio A
Voltage divider for self-limited analog state programing of memristors Journal Article
In: IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 67, no. 4, pp. 620–624, 2019.
@article{gomez2019voltage,
title = {Voltage divider for self-limited analog state programing of memristors},
author = {Jorge Gomez and Ioannis Vourkas and Angel Abusleme and Georgios Ch. Sirakoulis and Antonio Rubio},
url = {https://ieeexplore.ieee.org/abstract/document/8740908},
doi = {10.1109/TCSII.2019.2923716},
year = {2019},
date = {2019-06-19},
urldate = {2019-06-19},
journal = {IEEE Transactions on Circuits and Systems II: Express Briefs},
volume = {67},
number = {4},
pages = {620--624},
publisher = {IEEE},
abstract = {Resistive switching devices-memristors-present a tunable, incremental switching behavior. Tuning their state accurately, repeatedly and in a wide range, makes memristors well-suited for multi-level (ML) resistive memory cells and analog computing applications. In this brief, the tuning approach based on a memristor-resistor voltage divider (VD) is validated experimentally using commercial memristors from Knowm Inc. and a custom circuit. Rapid and controllable multi-state SET tuning is shown with an appreciable range of different resistance values obtained as a function of the amplitude of the applied voltage pulse. The efficiency of the VD is finally compared against an adaptive pulse-based tuning protocol, in terms of circuit overhead, tuning precision, tuning time, and energy consumption, qualifying as a simple hardware solution for fast, reliable, and energy-efficient ML resistance tuning.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Resistive switching devices-memristors-present a tunable, incremental switching behavior. Tuning their state accurately, repeatedly and in a wide range, makes memristors well-suited for multi-level (ML) resistive memory cells and analog computing applications. In this brief, the tuning approach based on a memristor-resistor voltage divider (VD) is validated experimentally using commercial memristors from Knowm Inc. and a custom circuit. Rapid and controllable multi-state SET tuning is shown with an appreciable range of different resistance values obtained as a function of the amplitude of the applied voltage pulse. The efficiency of the VD is finally compared against an adaptive pulse-based tuning protocol, in terms of circuit overhead, tuning precision, tuning time, and energy consumption, qualifying as a simple hardware solution for fast, reliable, and energy-efficient ML resistance tuning.
126.
Kalogeiton V S, Ioannidis K, Sirakoulis G Ch, Kosmatopoulos E B
Real-Time Active SLAM and Obstacle Avoidance for an Autonomous Robot Based on Stereo Vision Journal Article
In: Cybernetics and Systems, vol. 50, no. 3, pp. 239–260, 2019.
@article{kalogeiton2019real,
title = {Real-Time Active SLAM and Obstacle Avoidance for an Autonomous Robot Based on Stereo Vision},
author = {Vicky S Kalogeiton and Konstantinos Ioannidis and Georgios Ch. Sirakoulis and Elias B Kosmatopoulos},
url = {https://www.tandfonline.com/doi/full/10.1080/01969722.2018.1541599},
doi = {doi.org/10.1080/01969722.2018.1541599},
year = {2019},
date = {2019-03-11},
urldate = {2019-03-11},
journal = {Cybernetics and Systems},
volume = {50},
number = {3},
pages = {239--260},
publisher = {Taylor \& Francis},
abstract = {In this article, the problem of real-time robot exploration and map building (active SLAM) is considered. A single stereo vision camera is exploited by a fully autonomous robot to navigate, localize itself, define its surroundings, and avoid any possible obstacle in the aim of maximizing the mapped region following the optimal route. A modified version of the so-called cognitive-based adaptive optimization algorithm is introduced for the robot to successfully complete its tasks in real time and avoid any local minima entrapment. The method’s effectiveness and performance were tested under various simulation environments as well as real unknown areas with the use of properly equipped robots.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this article, the problem of real-time robot exploration and map building (active SLAM) is considered. A single stereo vision camera is exploited by a fully autonomous robot to navigate, localize itself, define its surroundings, and avoid any possible obstacle in the aim of maximizing the mapped region following the optimal route. A modified version of the so-called cognitive-based adaptive optimization algorithm is introduced for the robot to successfully complete its tasks in real time and avoid any local minima entrapment. The method’s effectiveness and performance were tested under various simulation environments as well as real unknown areas with the use of properly equipped robots.
125.
Adamatzky A, Vallverd'u J, Sirakoulis G Ch
Chemical Excitable Medium in Barcelona Street Network as a Method for Panicked Crowds Behavior Analysis Journal Article
In: Complex Systems, vol. 28, no. 1, pp. 41–57, 2019.
@article{adamatzky2019chemical,
title = {Chemical Excitable Medium in Barcelona Street Network as a Method for Panicked Crowds Behavior Analysis},
author = {Andrew Adamatzky and Jordi Vallverd'u and Georgios Ch. Sirakoulis},
url = {https://www.complex-systems.com/abstracts/v28_i01_a02/},
doi = {doi.org/10.25088/ComplexSystems.28.1.41},
year = {2019},
date = {2019-03-01},
urldate = {2019-03-01},
journal = {Complex Systems},
volume = {28},
number = {1},
pages = {41--57},
publisher = {Complex Systems Publications, Inc.},
abstract = {Spacetime dynamics of crowds are proved to be like dynamics of perturbation waves propagating in an excitable nonlinear medium. This analogy is developed further by studying the propagation of excitation\textemdashas represented by the two-variable Oregonator model of the Belousov\textendashZhabotinsky medium\textemdashand by then providing a thorough explanatory application study of the dynamics of excitation on Barcelona street networks considering crowd movement. In more detail, two characteristic areas of Barcelona\textemdashGr\`{a}cia and Raval\textemdashrecently in the spotlight due to emerging situations, are analyzed in the context of the proposed study. The computer experiments performed show how an excitability of the medium affects the propagation dynamics. It is demonstrated that with decreasing excitability, the spanning of the street networks by an excitation wavefront shows evidence of pruning toward wider and ballistically plausible pathways.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Spacetime dynamics of crowds are proved to be like dynamics of perturbation waves propagating in an excitable nonlinear medium. This analogy is developed further by studying the propagation of excitation—as represented by the two-variable Oregonator model of the Belousov–Zhabotinsky medium—and by then providing a thorough explanatory application study of the dynamics of excitation on Barcelona street networks considering crowd movement. In more detail, two characteristic areas of Barcelona—Gràcia and Raval—recently in the spotlight due to emerging situations, are analyzed in the context of the proposed study. The computer experiments performed show how an excitability of the medium affects the propagation dynamics. It is demonstrated that with decreasing excitability, the spanning of the street networks by an excitation wavefront shows evidence of pruning toward wider and ballistically plausible pathways.
124.
Gerakakis I, Gavriilidis P, Dourvas N I, Georgoudas I G, Trunfio G A, Sirakoulis G Ch
Accelerating fuzzy cellular automata for modeling crowd dynamics Journal Article
In: Journal of Computational Science, vol. 32, pp. 125–140, 2018.
@article{gerakakis2019accelerating,
title = {Accelerating fuzzy cellular automata for modeling crowd dynamics},
author = {Ioannis Gerakakis and Prodromos Gavriilidis and Nikolaos I Dourvas and Ioakeim G Georgoudas and Giuseppe A Trunfio and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/pii/S1877750318304022},
doi = {doi.org/10.1016/j.jocs.2018.10.007},
year = {2018},
date = {2018-11-03},
urldate = {2018-11-03},
journal = {Journal of Computational Science},
volume = {32},
pages = {125--140},
publisher = {Elsevier},
abstract = {Pedestrian and crowd dynamics are physical phenomena that are fundamentally characterized by non-linear complexity. In the same time, the need of modern way of living seeks for such dynamics real time modeling also enabling computationally efficient and affordable solutions for sake of safety and easiness of people located in gathering places all over the world. Towards this direction, Cellular Automata (CAs), a parallel computational model combining macro- and microscopic inherent attributes that could severely help with adequate modeling of the aforementioned dynamics, are one of the best compromises among different competing computational techniques. In order to overcome CAs deterministic nature, in this paper the incorporation of fuzzy logic principles in a CA model that simulates crowd dynamics and crowd evacuation processes, with the usage of a Mamdani type fuzzy inference system, is proposed. More specifically, basic concepts of fuzzy logic such as linguistic variables and if-then rules are attributed to the proposed CA model to preserve fuzzy consequents and fuzzy antecedents thus resulting in a realistic and rather efficient modeling approach. Furthermore, in the paper the implementation of fuzziness in CA dynamics is tackled with the acceleration of the proposed model through fully parallel execution on Graphics Processing Units (GPU). The GPU implementation of the fuzzy CA model is analyzed in full detail and stressed against CPU corresponding implementation resulting to an important speed up of fuzzy CA execution. This is further explored through the GPU applications of the fuzzy CA model in a real building, namely the museum `CONSTANTIN XENAKIS', in Serres, Greece.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Pedestrian and crowd dynamics are physical phenomena that are fundamentally characterized by non-linear complexity. In the same time, the need of modern way of living seeks for such dynamics real time modeling also enabling computationally efficient and affordable solutions for sake of safety and easiness of people located in gathering places all over the world. Towards this direction, Cellular Automata (CAs), a parallel computational model combining macro- and microscopic inherent attributes that could severely help with adequate modeling of the aforementioned dynamics, are one of the best compromises among different competing computational techniques. In order to overcome CAs deterministic nature, in this paper the incorporation of fuzzy logic principles in a CA model that simulates crowd dynamics and crowd evacuation processes, with the usage of a Mamdani type fuzzy inference system, is proposed. More specifically, basic concepts of fuzzy logic such as linguistic variables and if-then rules are attributed to the proposed CA model to preserve fuzzy consequents and fuzzy antecedents thus resulting in a realistic and rather efficient modeling approach. Furthermore, in the paper the implementation of fuzziness in CA dynamics is tackled with the acceleration of the proposed model through fully parallel execution on Graphics Processing Units (GPU). The GPU implementation of the fuzzy CA model is analyzed in full detail and stressed against CPU corresponding implementation resulting to an important speed up of fuzzy CA execution. This is further explored through the GPU applications of the fuzzy CA model in a real building, namely the museum `CONSTANTIN XENAKIS', in Serres, Greece.
123.
Mitsopoulou M, Dourvas N I, Sirakoulis G Ch, Nishinari K
Spatial games and memory effects on crowd evacuation behavior with Cellular Automata Journal Article
In: Journal of Computational Science, vol. 32, pp. 87–98, 2018.
@article{mitsopoulou2019spatial,
title = {Spatial games and memory effects on crowd evacuation behavior with Cellular Automata},
author = {Martha Mitsopoulou and Nikolaos I Dourvas and Georgios Ch. Sirakoulis and Katsuhiro Nishinari},
url = {https://www.sciencedirect.com/science/article/pii/S1877750318303272},
doi = {doi.org/10.1016/j.jocs.2018.09.003},
year = {2018},
date = {2018-09-25},
urldate = {2018-09-25},
journal = {Journal of Computational Science},
volume = {32},
pages = {87--98},
publisher = {Elsevier},
abstract = {When it comes to emergency evacuations of a big number of individuals from a certain room or a building, it is crucial that they should be able to exit the under study place in a quick and safe manner. Nevertheless, crowd behavior can be affected from various factors, among which are the distance from the exit, the visibility of the exit, the density of the crowd and how uncomfortable the conditions are inside the room for the crowd. In this study, we propose an evacuation model, in order to achieve a computationally enhanced simulation, based on Cellular Automata modeling, coupled with a Spatial Game to solve conflict situations among the anxious crowd. Additionally, aiming to a more realistic model, we added not only topological, but also behavioral characteristics coupled with the incorporation of different moving velocities and memory features to the evacuees.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
When it comes to emergency evacuations of a big number of individuals from a certain room or a building, it is crucial that they should be able to exit the under study place in a quick and safe manner. Nevertheless, crowd behavior can be affected from various factors, among which are the distance from the exit, the visibility of the exit, the density of the crowd and how uncomfortable the conditions are inside the room for the crowd. In this study, we propose an evacuation model, in order to achieve a computationally enhanced simulation, based on Cellular Automata modeling, coupled with a Spatial Game to solve conflict situations among the anxious crowd. Additionally, aiming to a more realistic model, we added not only topological, but also behavioral characteristics coupled with the incorporation of different moving velocities and memory features to the evacuees.
122.
Ntinas V, Ascoli A, Tetzlaff R, Sirakoulis G Ch
A complete analytical solution for the on and off dynamic equations of a TaO memristor Journal Article
In: IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 4, pp. 682–686, 2018.
@article{ntinas2018complete,
title = {A complete analytical solution for the on and off dynamic equations of a TaO memristor},
author = {V Ntinas and Alon Ascoli and Ronald Tetzlaff and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/8463511},
doi = {10.1109/TCSII.2018.2869920},
year = {2018},
date = {2018-09-24},
urldate = {2018-09-24},
journal = {IEEE Transactions on Circuits and Systems II: Express Briefs},
volume = {66},
number = {4},
pages = {682--686},
publisher = {IEEE},
abstract = {In this brief we provide a complete analytical model for the time evolution of the state of a real-world memristor under any dc stimulus and for all initial conditions. The analytical dc model is derived through the application of mathematical techniques to Strachan's accurate mathematical description of a tantalum oxide nano-device from Hewlett Packard Labs. Under positive dc inputs the state equation of the Strachan model can be solved analytically, providing a closed-form expression for the device memory state response. However, to the best of our knowledge, the analytical integration of the state equation of the Strachan model under dc inputs of negative polarity is an unsolved mathematical problem. In order to bypass this issue, the state evolution function is first expanded in a series of Lagrange polynomials, which reproduces accurately the original model predictions on the device off-switching kinetics. The solution to the resulting state equation approximation may then be computed analytically by applying methods from the field of mathematics. Our full analytical model matches both qualitatively and quantitatively the tantalum oxide memristor response captured by the original differential algebraic equation set to typical stimuli of interest such as symmetric and asymmetric pulse excitations. It is further insensitive to the convergence issues that typically arise in the numerical integration of the original model, and may be easily integrated into software programs for circuit synthesis, providing designers with a reliable tool for exploratory studies on the capability of a certain circuit topology to satisfy given design specifications.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this brief we provide a complete analytical model for the time evolution of the state of a real-world memristor under any dc stimulus and for all initial conditions. The analytical dc model is derived through the application of mathematical techniques to Strachan's accurate mathematical description of a tantalum oxide nano-device from Hewlett Packard Labs. Under positive dc inputs the state equation of the Strachan model can be solved analytically, providing a closed-form expression for the device memory state response. However, to the best of our knowledge, the analytical integration of the state equation of the Strachan model under dc inputs of negative polarity is an unsolved mathematical problem. In order to bypass this issue, the state evolution function is first expanded in a series of Lagrange polynomials, which reproduces accurately the original model predictions on the device off-switching kinetics. The solution to the resulting state equation approximation may then be computed analytically by applying methods from the field of mathematics. Our full analytical model matches both qualitatively and quantitatively the tantalum oxide memristor response captured by the original differential algebraic equation set to typical stimuli of interest such as symmetric and asymmetric pulse excitations. It is further insensitive to the convergence issues that typically arise in the numerical integration of the original model, and may be easily integrated into software programs for circuit synthesis, providing designers with a reliable tool for exploratory studies on the capability of a certain circuit topology to satisfy given design specifications.
121.
Adamatzky A, Phillips N, Weerasekera R, Tsompanas M, Sirakoulis G Ch
Street map analysis with excitable chemical medium Journal Article
In: Physical Review E, vol. 98, no. 1, pp. 012306, 2018.
@article{adamatzky2018street,
title = {Street map analysis with excitable chemical medium},
author = {Andrew Adamatzky and Neil Phillips and Roshan Weerasekera and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis},
url = {https://journals.aps.org/pre/abstract/10.1103/PhysRevE.98.012306},
doi = {doi.org/10.1103/PhysRevE.98.012306},
year = {2018},
date = {2018-07-13},
urldate = {2018-01-01},
journal = {Physical Review E},
volume = {98},
number = {1},
pages = {012306},
publisher = {American Physical Society},
abstract = {Belousov-Zhabotinsky (BZ) thin layer solution is a fruitful substrate for designing unconventional computing devices. A range of logical circuits, wet electronic devices, and neuromorphic prototypes have been constructed. Information processing in BZ computing devices is based on interaction of oxidation (excitation) wave fronts. Dynamics of the wave fronts propagation is programed by geometrical constraints and interaction of colliding wave fronts is tuned by illumination. We apply the principles of BZ computing to explore a geometry of street networks. We use two-variable Oregonator equations, the most widely accepted and verified in laboratory experiments BZ models, to study propagation of excitation wave fronts for a range of excitability parameters, with gradual transition from excitable to subexcitable to nonexcitable. We demonstrate a pruning strategy adopted by the medium with decreasing excitability when wider and ballistically appropriate streets are selected. We explain mechanics of streets selection and pruning. The results of the paper will be used in future studies of studying dynamics of cities and characterizing geometry of street networks.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Belousov-Zhabotinsky (BZ) thin layer solution is a fruitful substrate for designing unconventional computing devices. A range of logical circuits, wet electronic devices, and neuromorphic prototypes have been constructed. Information processing in BZ computing devices is based on interaction of oxidation (excitation) wave fronts. Dynamics of the wave fronts propagation is programed by geometrical constraints and interaction of colliding wave fronts is tuned by illumination. We apply the principles of BZ computing to explore a geometry of street networks. We use two-variable Oregonator equations, the most widely accepted and verified in laboratory experiments BZ models, to study propagation of excitation wave fronts for a range of excitability parameters, with gradual transition from excitable to subexcitable to nonexcitable. We demonstrate a pruning strategy adopted by the medium with decreasing excitability when wider and ballistically appropriate streets are selected. We explain mechanics of streets selection and pruning. The results of the paper will be used in future studies of studying dynamics of cities and characterizing geometry of street networks.
120.
Tsompanas M, Adamatzky A, Ieropoulos I, Phillips N W, Sirakoulis G Ch, Greenman J
Modelling microbial fuel cells using Lattice Boltzmann methods Journal Article
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 16, no. 6, pp. 2035–2045, 2018.
@article{tsompanas2018modelling,
title = {Modelling microbial fuel cells using Lattice Boltzmann methods},
author = {Michail-Antisthenis Tsompanas and Andrew Adamatzky and Ioannis Ieropoulos and Neil William Phillips and Georgios Ch. Sirakoulis and John Greenman},
url = {https://ieeexplore.ieee.org/document/8352747},
doi = {10.1109/TCBB.2018.2831223},
year = {2018},
date = {2018-04-30},
urldate = {2018-01-01},
journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
volume = {16},
number = {6},
pages = {2035--2045},
publisher = {IEEE},
abstract = {An accurate modelling of bio-electrochemical processes that govern Microbial Fuel Cells (MFCs) and mapping their behavior according to several parameters will enhance the development of MFC technology and enable their successful implementation in well defined applications. The geometry of the electrodes is among key parameters determining efficiency of MFCs due to the formation of a biofilm of anodophilic bacteria on the anode electrode, which is a decisive factor for the functionality of the device. We simulate the bio-electrochemical processes in an MFC while taking into account the geometry of the electrodes. Namely, lattice Boltzmann methods are used to simulate the fluid dynamics and the advection-diffusion phenomena in the anode compartment. The model is verified on voltage and current outputs of a single MFC derived from laboratory experiments under continuous flow. Conclusions can be obtained from a parametric analysis of the model concerning the design of the geometry of the anode compartment, the positioning and microstructure of the anode electrode, in order to achieve more efficient overall performance of the system. An example of such a parametric analysis is presented here, taking into account the positioning of the electrode in the anode compartment.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
An accurate modelling of bio-electrochemical processes that govern Microbial Fuel Cells (MFCs) and mapping their behavior according to several parameters will enhance the development of MFC technology and enable their successful implementation in well defined applications. The geometry of the electrodes is among key parameters determining efficiency of MFCs due to the formation of a biofilm of anodophilic bacteria on the anode electrode, which is a decisive factor for the functionality of the device. We simulate the bio-electrochemical processes in an MFC while taking into account the geometry of the electrodes. Namely, lattice Boltzmann methods are used to simulate the fluid dynamics and the advection-diffusion phenomena in the anode compartment. The model is verified on voltage and current outputs of a single MFC derived from laboratory experiments under continuous flow. Conclusions can be obtained from a parametric analysis of the model concerning the design of the geometry of the anode compartment, the positioning and microstructure of the anode electrode, in order to achieve more efficient overall performance of the system. An example of such a parametric analysis is presented here, taking into account the positioning of the electrode in the anode compartment.
119.
Adamatzky A, Phillips N, Weerasekera R, Tsompanas M, Sirakoulis G Ch
Excitable London: Street map analysis with Oregonator model Journal Article
In: arXiv preprint arXiv:1803.01632, 2018.
@article{adamatzky2018excitable,
title = {Excitable London: Street map analysis with Oregonator model},
author = {Andrew Adamatzky and Neil Phillips and Roshan Weerasekera and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis},
url = {https://arxiv.org/abs/1803.01632},
doi = {10.1103/PhysRevE.98.012306},
year = {2018},
date = {2018-03-06},
urldate = {2018-01-01},
journal = {arXiv preprint arXiv:1803.01632},
abstract = {We explore geometry of London's streets using computational mode of an excitable chemical system, Belousov-Zhabotinsky (BZ) medium. We virtually fill in the streets with a BZ medium and study propagation of excitation waves for a range of excitability parameters, gradual transition from excitable to sub-excitable to non-excitable. We demonstrate a pruning strategy adopted by the medium with decreasing excitability when wider and ballistically appropriate streets are selected. We explain mechanics of streets selection and pruning. The results of the paper will be used in future studies of studying dynamics of cities with living excitable substrates.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We explore geometry of London's streets using computational mode of an excitable chemical system, Belousov-Zhabotinsky (BZ) medium. We virtually fill in the streets with a BZ medium and study propagation of excitation waves for a range of excitability parameters, gradual transition from excitable to sub-excitable to non-excitable. We demonstrate a pruning strategy adopted by the medium with decreasing excitability when wider and ballistically appropriate streets are selected. We explain mechanics of streets selection and pruning. The results of the paper will be used in future studies of studying dynamics of cities with living excitable substrates.
118.
Tourtounis D, Mitianoudis N, Sirakoulis G Ch
Salt-n-pepper noise filtering using Cellular Automata Journal Article
In: Journal of Cellular Automata, vol. 13, no. 1-2, pp. 103–119, 2018.
@article{tourtounis2018salt,
title = {Salt-n-pepper noise filtering using Cellular Automata},
author = {Dimitrios Tourtounis and Nikolaos Mitianoudis and Georgios Ch. Sirakoulis},
url = {http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-13-number-1-2-2018/jca-13-1-2-p-81-101/},
year = {2018},
date = {2018-03-01},
urldate = {2018-01-01},
journal = {Journal of Cellular Automata},
volume = {13},
number = {1-2},
pages = {103--119},
publisher = {Old City Publishing},
abstract = {Cellular Automata (CA) have been considered one of the most pronounced parallel computational tools in the recent era of nature and bio-inspired computing. Taking advantage of their local connectivity, the simplicity of their design and their inherent parallelism, CA can be effectively applied to many image processing tasks. In this paper, a CA approach for efficient salt-n-pepper noise filtering in grayscale images is presented. Using a 2D Moore neighborhood, the classified “noisy” cells are corrected by averaging the non-noisy neighboring cells. While keeping the computational burden really low, the proposed approach succeeds in removing high-noise levels from various images and yields promising qualitative and quantitative results, compared to state-of-the-art techniques.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Cellular Automata (CA) have been considered one of the most pronounced parallel computational tools in the recent era of nature and bio-inspired computing. Taking advantage of their local connectivity, the simplicity of their design and their inherent parallelism, CA can be effectively applied to many image processing tasks. In this paper, a CA approach for efficient salt-n-pepper noise filtering in grayscale images is presented. Using a 2D Moore neighborhood, the classified “noisy” cells are corrected by averaging the non-noisy neighboring cells. While keeping the computational burden really low, the proposed approach succeeds in removing high-noise levels from various images and yields promising qualitative and quantitative results, compared to state-of-the-art techniques.
117.
Ntinas V, Vourkas I, Abusleme A, Sirakoulis G Ch, Rubio A
Experimental Study of Artificial Neural Networks Using a Digital Memristor Simulator Journal Article
In: IEEE Transactions on Neural Networks and Learning Systems, vol. 29, no. 10, pp. 5098–5110, 2018.
@article{ntinas2018experimental,
title = {Experimental Study of Artificial Neural Networks Using a Digital Memristor Simulator},
author = {Vasileios Ntinas and Ioannis Vourkas and Angel Abusleme and Georgios Ch. Sirakoulis and Antonio Rubio},
url = {https://ieeexplore.ieee.org/document/8278839},
doi = {10.1109/TNNLS.2018.2791458},
year = {2018},
date = {2018-02-01},
urldate = {2018-01-01},
journal = {IEEE Transactions on Neural Networks and Learning Systems},
volume = {29},
number = {10},
pages = {5098--5110},
publisher = {IEEE},
abstract = {This paper presents a fully digital implementation of a memristor hardware (HW) simulator, as the core of an emulator, based on a behavioral model of voltage-controlled threshold-type bipolar memristors. Compared to other analog solutions, the proposed digital design is compact, easily reconfigurable, demonstrates very good matching with the mathematical model on which it is based, and complies with all the required features for memristor emulators. We validated its functionality using Altera Quartus II and ModelSim tools targeting low-cost yet powerful field-programmable gate array families. We tested its suitability for complex memristive circuits as well as its synapse functioning in artificial neural networks, implementing examples of associative memory and unsupervised learning of spatiotemporal correlations in parallel input streams using a simplified spike-timing-dependent plasticity. We provide the full circuit schematics of all our digital circuit designs and comment on the required HW resources and their scaling trends, thus presenting a design framework for applications based on our HW simulator.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper presents a fully digital implementation of a memristor hardware (HW) simulator, as the core of an emulator, based on a behavioral model of voltage-controlled threshold-type bipolar memristors. Compared to other analog solutions, the proposed digital design is compact, easily reconfigurable, demonstrates very good matching with the mathematical model on which it is based, and complies with all the required features for memristor emulators. We validated its functionality using Altera Quartus II and ModelSim tools targeting low-cost yet powerful field-programmable gate array families. We tested its suitability for complex memristive circuits as well as its synapse functioning in artificial neural networks, implementing examples of associative memory and unsupervised learning of spatiotemporal correlations in parallel input streams using a simplified spike-timing-dependent plasticity. We provide the full circuit schematics of all our digital circuit designs and comment on the required HW resources and their scaling trends, thus presenting a design framework for applications based on our HW simulator.
116.
Dourvas N, Sirakoulis G Ch
A Inhibitor Sensitive, Collision Based Switching Like Transistor Element Using Periodic Traveling Waves and Cellular Automata Journal Article
In: International Journal of Unconventional Computing, vol. 13, no. 4-5, pp. 377–397, 2018.
@article{dourvas2018inhibitor,
title = {A Inhibitor Sensitive, Collision Based Switching Like Transistor Element Using Periodic Traveling Waves and Cellular Automata},
author = {Nikolaos Dourvas and Georgios Ch. Sirakoulis},
url = {https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-13-number-4-5-2018/ijuc-13-4-5-p-377-397/},
year = {2018},
date = {2018-01-11},
urldate = {2018-01-11},
journal = {International Journal of Unconventional Computing},
volume = {13},
number = {4-5},
pages = {377--397},
publisher = {Old City Publishing Inc},
abstract = {The reaction-diffusion (RD) models describe the change in the behavior of one or more chemical substances through space and time. The RD interaction can create waves of chemical concentration when the chemical systems used are far from equilibrium. The velocity and direction of those waves can be controlled and altered using excitable media or inhibitors. In particular, excitable media are spatially distributed systems characterized by their ability to propagate signals undamped over long distances, while inhibitors are used to reduce the propagation of those signals. The behavior of chemical oscillators are based on such media. The concept of this article is the proposal of a Cellular Automaton (CA) model which exploits the wave propagation characteristics on an excitable medium using inhibitors to create a switching element which is capable of distinguishing two binary states and present a form of amplification, like a basic transistor. In such a sense an unconventional chemical made device with properties similar to the conventional basic element of today’s electronics, namely CMOS transistor is conceived. Furthermore, and in order to properly explore the potential of the proposed device, we design a combination of two of those transistors to prove that they can reproduce Boolean algebra by creating two of the most well known and important component, i.e. the inverter NOT logic gate and the universal logic gate NAND.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The reaction-diffusion (RD) models describe the change in the behavior of one or more chemical substances through space and time. The RD interaction can create waves of chemical concentration when the chemical systems used are far from equilibrium. The velocity and direction of those waves can be controlled and altered using excitable media or inhibitors. In particular, excitable media are spatially distributed systems characterized by their ability to propagate signals undamped over long distances, while inhibitors are used to reduce the propagation of those signals. The behavior of chemical oscillators are based on such media. The concept of this article is the proposal of a Cellular Automaton (CA) model which exploits the wave propagation characteristics on an excitable medium using inhibitors to create a switching element which is capable of distinguishing two binary states and present a form of amplification, like a basic transistor. In such a sense an unconventional chemical made device with properties similar to the conventional basic element of today’s electronics, namely CMOS transistor is conceived. Furthermore, and in order to properly explore the potential of the proposed device, we design a combination of two of those transistors to prove that they can reproduce Boolean algebra by creating two of the most well known and important component, i.e. the inverter NOT logic gate and the universal logic gate NAND.
115.
Tsiftsis A, Sirakoulis G Ch, Lygouras J
FPGA Processor with GPS for Modelling Railway Traffic Flow. Journal Article
In: Journal of Cellular Automata, vol. 12, no. 5, pp. 381–400, 2017.
@article{tsiftsis2017fpga,
title = {FPGA Processor with GPS for Modelling Railway Traffic Flow.},
author = {Anastasios Tsiftsis and Georgios Ch. Sirakoulis and John Lygouras},
url = {http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-12-number-5-2017/jca-12-5-p-381-400/},
year = {2017},
date = {2017-12-01},
urldate = {2017-01-01},
journal = {Journal of Cellular Automata},
volume = {12},
number = {5},
pages = {381--400},
publisher = {Old City Publishing Inc.},
abstract = {In this paper, an automated electronic system able to reproduce the complex dynamic behaviors of the train movement is presented. In specific, a Cellular Automaton (CA) model was developed in order to provide efficient control of the railway traffic flow under different complicated situations such as trains of greater and different speed and length, priority at level crossings, more than one station platforms, different and probably longer station dwell times, possible deceleration for sudden cause, i.e. railway blockage, etc. Furthermore, in order to take full advantage of the inherent parallelism and fundamental features of the CAs, the proposed model was implemented on Field Programmable Gate Array (FPGA). The FPGA design which results from the automatically produced synthesizable VHDL code of the CA model is considered as basic component of a portable, low total cost electronic system. The latter also includes a high performance Global Positioning System (GPS) wireless communication module for the monitoring of train activity in the under study railway. This module in conjunction with the proposed fully automatically programmable FPGA device minimizes the design burden offering the chance of real-time train control operation based on the CA model. Finally, some real case experiments took place in the railway network of Eastern Macedonia-Thrace of Greece and the experimental results validate the calibration of the CA model as well as of the proposed electronic system and their ability to control train movement.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, an automated electronic system able to reproduce the complex dynamic behaviors of the train movement is presented. In specific, a Cellular Automaton (CA) model was developed in order to provide efficient control of the railway traffic flow under different complicated situations such as trains of greater and different speed and length, priority at level crossings, more than one station platforms, different and probably longer station dwell times, possible deceleration for sudden cause, i.e. railway blockage, etc. Furthermore, in order to take full advantage of the inherent parallelism and fundamental features of the CAs, the proposed model was implemented on Field Programmable Gate Array (FPGA). The FPGA design which results from the automatically produced synthesizable VHDL code of the CA model is considered as basic component of a portable, low total cost electronic system. The latter also includes a high performance Global Positioning System (GPS) wireless communication module for the monitoring of train activity in the under study railway. This module in conjunction with the proposed fully automatically programmable FPGA device minimizes the design burden offering the chance of real-time train control operation based on the CA model. Finally, some real case experiments took place in the railway network of Eastern Macedonia-Thrace of Greece and the experimental results validate the calibration of the CA model as well as of the proposed electronic system and their ability to control train movement.
114.
Adamatzky A, Akl S, Burgin M, Calude C S, Costa J F, Dehshibi M M, Gunji Y, Konkoli Z, MacLennan B, Marchal B, Margenstern M, Martínez G J, Mayne R, Morita K, Schumann A, Sergeyev Y D, Sirakoulis G Ch, Stepney S, Svozil K, HectorZenil
East-West paths to unconventional computing Journal Article
In: Progress in Biophysics and Molecular Biology, vol. 131, pp. 469–493, 2017.
@article{adamatzky2017east,
title = {East-West paths to unconventional computing},
author = {Andrew Adamatzky and Selim Akl and Mark Burgin and Cristian S Calude and Jos\'{e} F\'{e}lix Costa and Mohammad Mahdi Dehshibi and Yukio-Pegio Gunji and Zoran Konkoli and Bruce MacLennan and Bruno Marchal and Maurice Margenstern and Genaro J. Mart\'{i}nez and Richard Mayne and Kenichi Morita and Andrew Schumann and Yaroslav D. Sergeyev and Georgios Ch. Sirakoulis and Susan Stepney and Karl Svozil and HectorZenil},
url = {https://www.sciencedirect.com/science/article/pii/S0079610717301177?via%3Dihub},
doi = {doi.org/10.1016/j.pbiomolbio.2017.08.004},
year = {2017},
date = {2017-08-14},
urldate = {2017-01-01},
journal = {Progress in Biophysics and Molecular Biology},
volume = {131},
pages = {469--493},
publisher = {Pergamon},
abstract = {Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing. Unconventional computing encourages a new style of thinking while practical applications are obtained from uncovering and exploiting principles and mechanisms of information processing in and functional properties of, physical, chemical and living systems; in particular, efficient algorithms are developed, (almost) optimal architectures are designed and working prototypes of future computing devices are manufactured. This article includes idiosyncratic accounts of ‘unconventional computing’ scientists reflecting on their personal experiences, what attracted them to the field, their inspirations and discoveries.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing. Unconventional computing encourages a new style of thinking while practical applications are obtained from uncovering and exploiting principles and mechanisms of information processing in and functional properties of, physical, chemical and living systems; in particular, efficient algorithms are developed, (almost) optimal architectures are designed and working prototypes of future computing devices are manufactured. This article includes idiosyncratic accounts of ‘unconventional computing’ scientists reflecting on their personal experiences, what attracted them to the field, their inspirations and discoveries.
113.
Ascoli A, Ntinas V, Tetzlaff R, Sirakoulis G Ch
Closed-form analytical solution for on-switching dynamics in a TaO memristor Journal Article
In: Electronics Letters, vol. 53, no. 16, pp. 1125–1126, 2017.
@article{ascoli2017closed,
title = {Closed-form analytical solution for on-switching dynamics in a TaO memristor},
author = {Alon Ascoli and Vasileios Ntinas and Ronald Tetzlaff and Georgios Ch. Sirakoulis},
url = {https://digital-library.theiet.org/content/journals/10.1049/el.2017.1622},
doi = {10.1049/el.2017.1622},
year = {2017},
date = {2017-08-03},
urldate = {2017-01-01},
journal = {Electronics Letters},
volume = {53},
number = {16},
pages = {1125--1126},
publisher = {IET Digital Library},
abstract = {For the first time, the model of a physical nano-scale memristor is integrated analytically. A closed-form expression for the time evolution of the device memristance during the turn-on process is mathematically derived. The complexity of the inverse imaginary error function-based analytical formula clearly reflects the high degree of nonlinearity in the nano-device switching kinetics, which may typically span several orders of magnitude and is critically dependent on input and initial condition. The excellent agreement between the analytical solution and numerical simulation results clearly demonstrates the correctness of the theoretical derivation. The introduction of this formula represents the first step towards a systematic approach to circuit design with memristors.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
For the first time, the model of a physical nano-scale memristor is integrated analytically. A closed-form expression for the time evolution of the device memristance during the turn-on process is mathematically derived. The complexity of the inverse imaginary error function-based analytical formula clearly reflects the high degree of nonlinearity in the nano-device switching kinetics, which may typically span several orders of magnitude and is critically dependent on input and initial condition. The excellent agreement between the analytical solution and numerical simulation results clearly demonstrates the correctness of the theoretical derivation. The introduction of this formula represents the first step towards a systematic approach to circuit design with memristors.
112.
Evangelidis V, Jones J, Dourvas N, Tsompanas M, Sirakoulis G Ch, Adamatzky A
Physarum machines imitating a Roman road network: the 3D approach Journal Article
In: Scientific Reports, vol. 7, no. 1, pp. 7010, 2017.
@article{evangelidis2017physarum,
title = {Physarum machines imitating a Roman road network: the 3D approach},
author = {Vasilis Evangelidis and Jeff Jones and Nikolaos Dourvas and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://www.nature.com/articles/s41598-017-06961-y},
doi = {doi.org/10.1038/s41598-017-06961-y},
year = {2017},
date = {2017-08-01},
urldate = {2017-01-01},
journal = {Scientific Reports},
volume = {7},
number = {1},
pages = {7010},
publisher = {Nature Publishing Group},
abstract = {Physarum Polycephalum is a single cell visible by unaided eye. This is a plasmodial, vegetative stage of acellular slime mould. This single cell has myriad of nuclei which contribute to a network of bio-chemical oscillators responsible for the slime mould’s distributed sensing, concurrent information processing and decision making, and parallel actuation. When presented with a spatial configuration of sources of nutrients, the slime mould spans the sources with networks of its protoplasmic tube. These networks belong to a family of planar proximity graphs. The protoplasmic networks also show a degree of similarity to vehicular transport networks. Previously, we have shown that the foraging behaviour of the slime mould can be applied in archaeological research to complement and enhance conventional geographic information system tools. The results produced suffered from limitation of a flat substrate: transport routes imitated by the slime mould did not reflect patterns of elevations. To overcome the limitation of the ‘flat world’ we constructed a three-dimensional model of Balkans. In laboratory experiments and computer modelling we uncovered patterns of the foraging behaviour that might shed a light onto development of Roman roads in the Balkans during the imperial period (1st century BC \textendash 4th century AD).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Physarum Polycephalum is a single cell visible by unaided eye. This is a plasmodial, vegetative stage of acellular slime mould. This single cell has myriad of nuclei which contribute to a network of bio-chemical oscillators responsible for the slime mould’s distributed sensing, concurrent information processing and decision making, and parallel actuation. When presented with a spatial configuration of sources of nutrients, the slime mould spans the sources with networks of its protoplasmic tube. These networks belong to a family of planar proximity graphs. The protoplasmic networks also show a degree of similarity to vehicular transport networks. Previously, we have shown that the foraging behaviour of the slime mould can be applied in archaeological research to complement and enhance conventional geographic information system tools. The results produced suffered from limitation of a flat substrate: transport routes imitated by the slime mould did not reflect patterns of elevations. To overcome the limitation of the ‘flat world’ we constructed a three-dimensional model of Balkans. In laboratory experiments and computer modelling we uncovered patterns of the foraging behaviour that might shed a light onto development of Roman roads in the Balkans during the imperial period (1st century BC – 4th century AD).
111.
Dimitriadis A, Kutrib M, Sirakoulis G Ch
Revisiting the cutting of the firing squad synchronization Journal Article
In: Natural Computing, vol. 17, no. 3, pp. 455–465, 2017.
@article{dimitriadis2018revisiting,
title = {Revisiting the cutting of the firing squad synchronization},
author = {Antonios Dimitriadis and Martin Kutrib and Georgios Ch. Sirakoulis},
url = {https://www.springerprofessional.de/revisiting-the-cutting-of-the-firing-squad-synchronization/13336938},
doi = {doi.org/10.1007/s11047-017-9628-z},
year = {2017},
date = {2017-07-28},
urldate = {2018-01-01},
journal = {Natural Computing},
volume = {17},
number = {3},
pages = {455--465},
publisher = {Springer Netherlands},
abstract = {Various synchronization algorithms have been introduced in literature during the last decades to deal with the firing squad synchronization problem on cellular automata (CA). Among others defective CA algorithms, where the CA cell is able to transmit information without previous processing, have been also presented. In our case, originating from the classical Mazoyer’s paper, where a minimum-time solution is presented with 6 states, a one-dimensional CA where one cell may permanently fail is presented. In the proposed algorithm, the defective cell can neither process nor transmit information any longer, while it is considered that such dynamic defects may become apparent in any time step of computation. A thorough analysis of the synchronization, in terms of location and time at which cell fails, for the cells found in both sides of defective cell is delivered to decipher the corresponding maximal possible number of synchronized cells in each part of the cut, due to defect, CA array. The proposed algorithm is properly extended to consider more than one defective cells that may occur in the under study one-dimensional CA. Based on the aforementioned analysis, we provide the generalization of synchronization with multiple totally defective cells, while application examples of the generalized CA algorithm in case of two defective cells are also presented. Finally, another intriguing aspect refers to handling of states that could be tentatively characterized as unknown, in a confrontation similar to the previous defective state but also different, since now this(these) cell(s) are not stated as faulty but unknown. As a result, a new one-dimensional CA with less states, compared to the previous CA defective algorithms, able to synchronize the maximal possible number of cells in each part occurs.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Various synchronization algorithms have been introduced in literature during the last decades to deal with the firing squad synchronization problem on cellular automata (CA). Among others defective CA algorithms, where the CA cell is able to transmit information without previous processing, have been also presented. In our case, originating from the classical Mazoyer’s paper, where a minimum-time solution is presented with 6 states, a one-dimensional CA where one cell may permanently fail is presented. In the proposed algorithm, the defective cell can neither process nor transmit information any longer, while it is considered that such dynamic defects may become apparent in any time step of computation. A thorough analysis of the synchronization, in terms of location and time at which cell fails, for the cells found in both sides of defective cell is delivered to decipher the corresponding maximal possible number of synchronized cells in each part of the cut, due to defect, CA array. The proposed algorithm is properly extended to consider more than one defective cells that may occur in the under study one-dimensional CA. Based on the aforementioned analysis, we provide the generalization of synchronization with multiple totally defective cells, while application examples of the generalized CA algorithm in case of two defective cells are also presented. Finally, another intriguing aspect refers to handling of states that could be tentatively characterized as unknown, in a confrontation similar to the previous defective state but also different, since now this(these) cell(s) are not stated as faulty but unknown. As a result, a new one-dimensional CA with less states, compared to the previous CA defective algorithms, able to synchronize the maximal possible number of cells in each part occurs.
110.
Tsompanas M I, Adamatzky A, Sirakoulis G Ch, Greenman J, Ieropoulos I
Towards implementation of cellular automata in Microbial Fuel Cells Journal Article
In: PloS one, vol. 12, no. 5, pp. e0177528, 2017.
@article{tsompanas2017towards,
title = {Towards implementation of cellular automata in Microbial Fuel Cells},
author = {Michail-Antisthenis I Tsompanas and Andrew Adamatzky and Georgios Ch. Sirakoulis and John Greenman and Ioannis Ieropoulos},
url = {https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0177528},
doi = {doi.org/10.1371/journal.pone.0177528},
year = {2017},
date = {2017-05-12},
urldate = {2017-01-01},
journal = {PloS one},
volume = {12},
number = {5},
pages = {e0177528},
publisher = {Public Library of Science},
abstract = {The Microbial Fuel Cell (MFC) is a bio-electrochemical transducer converting waste products into electricity using microbial communities. Cellular Automaton (CA) is a uniform array of finite-state machines that update their states in discrete time depending on states of their closest neighbors by the same rule. Arrays of MFCs could, in principle, act as massive-parallel computing devices with local connectivity between elementary processors. We provide a theoretical design of such a parallel processor by implementing CA in MFCs. We have chosen Conway’s Game of Life as the ‘benchmark’ CA because this is the most popular CA which also exhibits an enormously rich spectrum of patterns. Each cell of the Game of Life CA is realized using two MFCs. The MFCs are linked electrically and hydraulically. The model is verified via simulation of an electrical circuit demonstrating equivalent behaviours. The design is a first step towards future implementations of fully autonomous biological computing devices with massive parallelism. The energy independence of such devices counteracts their somewhat slow transitions\textemdashcompared to silicon circuitry\textemdashbetween the different states during computation.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The Microbial Fuel Cell (MFC) is a bio-electrochemical transducer converting waste products into electricity using microbial communities. Cellular Automaton (CA) is a uniform array of finite-state machines that update their states in discrete time depending on states of their closest neighbors by the same rule. Arrays of MFCs could, in principle, act as massive-parallel computing devices with local connectivity between elementary processors. We provide a theoretical design of such a parallel processor by implementing CA in MFCs. We have chosen Conway’s Game of Life as the ‘benchmark’ CA because this is the most popular CA which also exhibits an enormously rich spectrum of patterns. Each cell of the Game of Life CA is realized using two MFCs. The MFCs are linked electrically and hydraulically. The model is verified via simulation of an electrical circuit demonstrating equivalent behaviours. The design is a first step towards future implementations of fully autonomous biological computing devices with massive parallelism. The energy independence of such devices counteracts their somewhat slow transitions—compared to silicon circuitry—between the different states during computation.
109.
Gambuzza L V, Frasca M, Fortuna L, Ntinas V, Vourkas I, Sirakoulis G Ch
Memristor Crossbar for Adaptive Synchronization Journal Article
In: IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 64, no. 8, pp. 2124–2133, 2017.
@article{gambuzza2017memristor,
title = {Memristor Crossbar for Adaptive Synchronization},
author = {Lucia Valentina Gambuzza and Mattia Frasca and Luigi Fortuna and Vasileios Ntinas and Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/abstract/document/7911226},
doi = {10.1109/TCSI.2017.2692519},
year = {2017},
date = {2017-04-25},
urldate = {2017-01-01},
journal = {IEEE Transactions on Circuits and Systems I: Regular Papers},
volume = {64},
number = {8},
pages = {2124--2133},
publisher = {IEEE},
abstract = {Nonlinear circuits may be synchronized with interconnections that evolve in time incorporating mechanisms of adaptation found in many biological systems. Such dynamics in the links is efficiently implemented in electronic devices by using memristors. However, the approach requires a massive amount of interconnections (of the order of N2, where N is the number of nonlinear circuits to be synchronized). This issue is solved in this paper by adopting a memristor crossbar architecture for adaptive synchronization. The functionality of the structure is demonstrated, with respect to different switching characteristics, via a simulation-based evaluation using a behavioral threshold-type model of voltage-controlled bipolar memristor. In addition, we show that the architecture is robust to device variability and faults: quite surprisingly, when faults are localized, the performance of the approach may also improve as adaptation becomes more significant.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Nonlinear circuits may be synchronized with interconnections that evolve in time incorporating mechanisms of adaptation found in many biological systems. Such dynamics in the links is efficiently implemented in electronic devices by using memristors. However, the approach requires a massive amount of interconnections (of the order of N2, where N is the number of nonlinear circuits to be synchronized). This issue is solved in this paper by adopting a memristor crossbar architecture for adaptive synchronization. The functionality of the structure is demonstrated, with respect to different switching characteristics, via a simulation-based evaluation using a behavioral threshold-type model of voltage-controlled bipolar memristor. In addition, we show that the architecture is robust to device variability and faults: quite surprisingly, when faults are localized, the performance of the approach may also improve as adaptation becomes more significant.
108.
Adamatzky A, Sirakoulis G Ch, Martinez G J, Baluška F, Mancuso S
On plant roots logical gates Journal Article
In: Biosystems, vol. 156, pp. 40–45, 2017.
@article{adamatzky2017plant,
title = {On plant roots logical gates},
author = {Andrew Adamatzky and Georgios Ch. Sirakoulis and Genaro J Martinez and Frantisek Balu\v{s}ka and Stefano Mancuso},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0303264716302374},
doi = {doi.org/10.1016/j.biosystems.2017.04.002},
year = {2017},
date = {2017-04-17},
urldate = {2017-04-17},
journal = {Biosystems},
volume = {156},
pages = {40--45},
publisher = {Elsevier},
abstract = {Theoretical constructs of logical gates implemented with plant roots are morphological computing asynchronous devices. Values of Boolean variables are represented by plant roots. A presence of a plant root at a given site symbolises the logical True, an absence the logical False. Logical functions are calculated via interaction between roots. Two types of two-inputs\textendashtwo-outputs gates are proposed: a gate 〈x, y〉 → 〈xy, x + y〉 where root apexes are guided by gravity and a gate where root apexes are guided by humidity. We propose a design of binary half-adder based on the gates.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Theoretical constructs of logical gates implemented with plant roots are morphological computing asynchronous devices. Values of Boolean variables are represented by plant roots. A presence of a plant root at a given site symbolises the logical True, an absence the logical False. Logical functions are calculated via interaction between roots. Two types of two-inputs–two-outputs gates are proposed: a gate 〈x, y〉 → 〈xy, x + y〉 where root apexes are guided by gravity and a gate where root apexes are guided by humidity. We propose a design of binary half-adder based on the gates.
107.
Tsompanas M, Adamatzky A, Ieropoulos I, Phillips N, Sirakoulis G Ch, Greenman J
Cellular non-linear network model of microbial fuel cell Journal Article
In: Biosystems, vol. 156, pp. 53–62, 2017.
@article{tsompanas2017cellular,
title = {Cellular non-linear network model of microbial fuel cell},
author = {Michail-Antisthenis Tsompanas and Andrew Adamatzky and Ioannis Ieropoulos and Neil Phillips and Georgios Ch. Sirakoulis and John Greenman},
url = {https://www.sciencedirect.com/science/article/pii/S0303264717300758},
doi = {doi.org/10.1016/j.biosystems.2017.04.003},
year = {2017},
date = {2017-04-17},
urldate = {2017-01-01},
journal = {Biosystems},
volume = {156},
pages = {53--62},
publisher = {Elsevier},
abstract = {A cellular non-linear network (CNN) is a uniform regular array of locally connected continuous-state machines, or nodes, which update their states simultaneously in discrete time. A microbial fuel cell (MFC) is an electro-chemical reactor using the metabolism of bacteria to drive an electrical current. In a CNN model of the MFC, each node takes a vector of states which represent geometrical characteristics of the cell, like the electrodes or impermeable borders, and quantify measurable properties like bacterial population, charges produced and hydrogen ion concentrations. The model allows the study of integral reaction of the MFC, including temporal outputs, to spatial disturbances of the bacterial population and supply of nutrients. The model can also be used to evaluate inhomogeneous configurations of bacterial populations attached on the electrode biofilms.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
A cellular non-linear network (CNN) is a uniform regular array of locally connected continuous-state machines, or nodes, which update their states simultaneously in discrete time. A microbial fuel cell (MFC) is an electro-chemical reactor using the metabolism of bacteria to drive an electrical current. In a CNN model of the MFC, each node takes a vector of states which represent geometrical characteristics of the cell, like the electrodes or impermeable borders, and quantify measurable properties like bacterial population, charges produced and hydrogen ion concentrations. The model allows the study of integral reaction of the MFC, including temporal outputs, to spatial disturbances of the bacterial population and supply of nutrients. The model can also be used to evaluate inhomogeneous configurations of bacterial populations attached on the electrode biofilms.
106.
Papandroulidakis G, Vourkas I, Abusleme A, Sirakoulis G Ch, Rubio A
Crossbar-Based Memristive Logic-In-Memory Architecture Journal Article
In: IEEE Transactions on Nanotechnology, vol. 16, no. 3, pp. 491–501, 2017.
@article{papandroulidakis2017crossbar,
title = {Crossbar-Based Memristive Logic-In-Memory Architecture},
author = {Georgios Papandroulidakis and Ioannis Vourkas and Angel Abusleme and Georgios Ch. Sirakoulis and Antonio Rubio},
url = {https://ieeexplore.ieee.org/document/7893787},
doi = {10.1109/TNANO.2017.2691713},
year = {2017},
date = {2017-04-06},
urldate = {2017-01-01},
journal = {IEEE Transactions on Nanotechnology},
volume = {16},
number = {3},
pages = {491--501},
publisher = {IEEE},
abstract = {The use of memristors and resistive random access memory (ReRAM) technology to perform logic computations, has drawn considerable attention from researchers in recent years. However, the topological aspects of the underlying ReRAM architecture and its organization have received less attention, as the focus has mainly been on device-specific properties for functionally complete logic gates through conditional switching in ReRAM circuits. A careful investigation and optimization of the target geometry is thus highly desirable for the implementation of logic-in-memory architectures. In this paper, we propose a crossbar-based in-memory parallel processing system in which, through the heterogeneity of the resistive cross-point devices, we achieve local information processing in a state-of-the-art ReRAM crossbar architecture with vertical group-accessed transistors as cross-point selector devices. We primarily focus on the array organization, information storage, and processing flow, while proposing a novel geometry for the cross-point selection lines to mitigate current sneak-paths during an arbitrary number of possible parallel logic computations. We prove the proper functioning and potential capabilities of the proposed architecture through SPICE-level circuit simulations of half-adder and sum-of-products logic functions. We compare certain features of the proposed logic-in-memory approach with another work of the literature, and present an analysis of circuit resources, integration density, and logic computation parallelism.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The use of memristors and resistive random access memory (ReRAM) technology to perform logic computations, has drawn considerable attention from researchers in recent years. However, the topological aspects of the underlying ReRAM architecture and its organization have received less attention, as the focus has mainly been on device-specific properties for functionally complete logic gates through conditional switching in ReRAM circuits. A careful investigation and optimization of the target geometry is thus highly desirable for the implementation of logic-in-memory architectures. In this paper, we propose a crossbar-based in-memory parallel processing system in which, through the heterogeneity of the resistive cross-point devices, we achieve local information processing in a state-of-the-art ReRAM crossbar architecture with vertical group-accessed transistors as cross-point selector devices. We primarily focus on the array organization, information storage, and processing flow, while proposing a novel geometry for the cross-point selection lines to mitigate current sneak-paths during an arbitrary number of possible parallel logic computations. We prove the proper functioning and potential capabilities of the proposed architecture through SPICE-level circuit simulations of half-adder and sum-of-products logic functions. We compare certain features of the proposed logic-in-memory approach with another work of the literature, and present an analysis of circuit resources, integration density, and logic computation parallelism.
105.
Ntinas V, Vourkas I, Sirakoulis G Ch, Adamatzky A I
Modeling Physarum space exploration using memristors Journal Article
In: Journal of Physics D: Applied Physics, vol. 50, no. 17, pp. 174004, 2017.
@article{ntinas2017modeling,
title = {Modeling Physarum space exploration using memristors},
author = {Vasilios Ntinas and Ioannis Vourkas and Georgios Ch. Sirakoulis and Andrew I Adamatzky},
url = {https://iopscience.iop.org/article/10.1088/1361-6463/aa614d},
doi = {doi.org/10.1088/1361-6463/aa614d},
year = {2017},
date = {2017-03-31},
urldate = {2017-01-01},
journal = {Journal of Physics D: Applied Physics},
volume = {50},
number = {17},
pages = {174004},
publisher = {IOP Publishing},
abstract = {Slime mold Physarum polycephalum optimizes its foraging behaviour by minimizing the distances between the sources of nutrients it spans. When two sources of nutrients are present, the slime mold connects the sources, with its protoplasmic tubes, along the shortest path. We present a two-dimensional mesh grid memristor based model as an approach to emulate Physarum's foraging strategy, which includes space exploration and reinforcement of the optimally formed interconnection network in the presence of multiple aliment sources. The proposed algorithmic approach utilizes memristors and LC contours and is tested in two of the most popular computational challenges for Physarum, namely maze and transportation networks. Furthermore, the presented model is enriched with the notion of noise presence, which positively contributes to a collective behavior and enables us to move from deterministic to robust results. Consequently, the corresponding simulation results manage to reproduce, in a much better qualitative way, the expected transportation networks.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Slime mold Physarum polycephalum optimizes its foraging behaviour by minimizing the distances between the sources of nutrients it spans. When two sources of nutrients are present, the slime mold connects the sources, with its protoplasmic tubes, along the shortest path. We present a two-dimensional mesh grid memristor based model as an approach to emulate Physarum's foraging strategy, which includes space exploration and reinforcement of the optimally formed interconnection network in the presence of multiple aliment sources. The proposed algorithmic approach utilizes memristors and LC contours and is tested in two of the most popular computational challenges for Physarum, namely maze and transportation networks. Furthermore, the presented model is enriched with the notion of noise presence, which positively contributes to a collective behavior and enables us to move from deterministic to robust results. Consequently, the corresponding simulation results manage to reproduce, in a much better qualitative way, the expected transportation networks.
104.
Amanatiadis A, Bampis L, Karakasis E G, Gasteratos A, Sirakoulis G Ch
Real-time surveillance detection system for medium-altitude long-endurance unmanned aerial vehicles Journal Article
In: Concurrency and Computation: Practice and Experience, vol. 30, no. 7, pp. e4145, 2017.
@article{amanatiadis2017real,
title = {Real-time surveillance detection system for medium-altitude long-endurance unmanned aerial vehicles},
author = {Angelos Amanatiadis and Loukas Bampis and Evangelos G Karakasis and Antonios Gasteratos and Georgios Ch. Sirakoulis},
url = {https://onlinelibrary.wiley.com/doi/10.1002/cpe.4145},
doi = {doi.org/10.1002/cpe.4145},
year = {2017},
date = {2017-03-28},
urldate = {2017-03-28},
journal = {Concurrency and Computation: Practice and Experience},
volume = {30},
number = {7},
pages = {e4145},
publisher = {Wiley},
abstract = {The detection of ambiguous objects, although challenging, is of great importance for any surveillance system and especially for an unmanned aerial vehicle, where the measurements are affected by the great observing distance. Wildfire outbursts and illegal migration are only some of the examples that such a system should distinguish and report to the appropriate authorities. More specifically, Southern European countries commonly suffer from those problems due to the mountainous terrain and thick forests that contain. Unmanned aerial vehicles like the “Hellenic Civil Unmanned Air Vehicle” project have been designed to address high-altitude detection tasks and patrol the borders and woodlands for any ambiguous activity. In this paper, a moment-based blob detection approach is proposed that uses the thermal footprint obtained from single infrared images and distinguishes human- or fire-sized and shaped figures. Our method is specifically designed so as to be appropriately integrated into hardware acceleration devices, such as General Purpose Computation on Graphics Processing Units (GPGPUs) and field programmable gate arrays, and takes full advantage of their respective parallelization capabilities succeeding real-time performances and energy efficiency. The timing evaluation of the proposed hardware accelerated algorithm's adaptations shows an achieved speedup of up to 7 times, as compared to a highly optimized CPU-only based version.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The detection of ambiguous objects, although challenging, is of great importance for any surveillance system and especially for an unmanned aerial vehicle, where the measurements are affected by the great observing distance. Wildfire outbursts and illegal migration are only some of the examples that such a system should distinguish and report to the appropriate authorities. More specifically, Southern European countries commonly suffer from those problems due to the mountainous terrain and thick forests that contain. Unmanned aerial vehicles like the “Hellenic Civil Unmanned Air Vehicle” project have been designed to address high-altitude detection tasks and patrol the borders and woodlands for any ambiguous activity. In this paper, a moment-based blob detection approach is proposed that uses the thermal footprint obtained from single infrared images and distinguishes human- or fire-sized and shaped figures. Our method is specifically designed so as to be appropriately integrated into hardware acceleration devices, such as General Purpose Computation on Graphics Processing Units (GPGPUs) and field programmable gate arrays, and takes full advantage of their respective parallelization capabilities succeeding real-time performances and energy efficiency. The timing evaluation of the proposed hardware accelerated algorithm's adaptations shows an achieved speedup of up to 7 times, as compared to a highly optimized CPU-only based version.
103.
Ntinas V, Vourkas I, Sirakoulis G Ch, Adamatzky A I
Oscillation-Based Slime Mould Electronic Circuit Model for Maze-Solving Computations Journal Article
In: IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 64, no. 6, pp. 1552–1563, 2017.
@article{ntinas2017oscillation,
title = {Oscillation-Based Slime Mould Electronic Circuit Model for Maze-Solving Computations},
author = {Vasileios Ntinas and Ioannis Vourkas and Georgios Ch. Sirakoulis and Andrew I Adamatzky},
url = {https://ieeexplore.ieee.org/document/7534815},
doi = {10.1109/TCSI.2016.2566278},
year = {2017},
date = {2017-03-23},
urldate = {2017-03-23},
journal = {IEEE Transactions on Circuits and Systems I: Regular Papers},
volume = {64},
number = {6},
pages = {1552--1563},
publisher = {IEEE},
abstract = {The ability of slime mould to learn and adapt to periodic changes in its environment inspired scientists to develop behavioral memristor-based circuit models of its memory organization. The computing abilities of slime mould Physarum polycephalum have been used in several applications, including to solve mazes. This work presents a circuit-level bio-inspired maze-solving approach via an electronic model of the oscillatory internal motion mechanism of slime mould, which emulates the local signal propagation and the expansion of its vascular network. Our implementation takes into account the inherent noise existent in the equivalent biological circuit, so that its behavior becomes closer to the non-deterministic behavior of the real organism. The efficiency and generality of the proposed electronic computing medium was validated through SPICE-level circuit simulations and compared with data from two cardinally different biological experiments, concerning 1) enhancing of Physarum's protoplasmic tubes along shortest path and 2) chemo-tactic growth by diffusing chemo-attractants.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The ability of slime mould to learn and adapt to periodic changes in its environment inspired scientists to develop behavioral memristor-based circuit models of its memory organization. The computing abilities of slime mould Physarum polycephalum have been used in several applications, including to solve mazes. This work presents a circuit-level bio-inspired maze-solving approach via an electronic model of the oscillatory internal motion mechanism of slime mould, which emulates the local signal propagation and the expansion of its vascular network. Our implementation takes into account the inherent noise existent in the equivalent biological circuit, so that its behavior becomes closer to the non-deterministic behavior of the real organism. The efficiency and generality of the proposed electronic computing medium was validated through SPICE-level circuit simulations and compared with data from two cardinally different biological experiments, concerning 1) enhancing of Physarum's protoplasmic tubes along shortest path and 2) chemo-tactic growth by diffusing chemo-attractants.
102.
Dourvas N I, Sirakoulis G Ch, Adamatzky A
Cellular Automaton Belousov--Zhabotinsky Model for Binary Full Adder Journal Article
In: International Journal of Bifurcation and Chaos, vol. 27, no. 06, pp. 1750089, 2017.
@article{dourvas2017cellular,
title = {Cellular Automaton Belousov--Zhabotinsky Model for Binary Full Adder},
author = {Nikolaos I Dourvas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://www.worldscientific.com/doi/abs/10.1142/S0218127417500894},
doi = {10.1142/S0218127417500894},
year = {2017},
date = {2017-02-18},
urldate = {2017-01-01},
journal = {International Journal of Bifurcation and Chaos},
volume = {27},
number = {06},
pages = {1750089},
publisher = {World Scientific Publishing Company},
abstract = {The continuous increment in the performance of classical computers has been driven to its limit. New ways are studied to avoid this oncoming bottleneck and many answers can be found. An example is the Belousov\textendashZhabotinsky (BZ) reaction which includes some fundamental and essential characteristics that attract chemists, biologists, and computer scientists. Interaction of excitation wave-fronts in BZ system, can be interpreted in terms of logical gates and applied in the design of unconventional hardware components. Logic gates and other more complicated components have been already proposed using different topologies and particular characteristics. In this study, the inherent parallelism and simplicity of Cellular Automata (CAs) modeling is combined with an Oregonator model of light-sensitive version of BZ reaction. The resulting parallel and computationally-inexpensive model has the ability to simulate a topology that can be considered as a one-bit full adder digital component towards the design of an Arithmetic Logic Unit (ALU).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The continuous increment in the performance of classical computers has been driven to its limit. New ways are studied to avoid this oncoming bottleneck and many answers can be found. An example is the Belousov–Zhabotinsky (BZ) reaction which includes some fundamental and essential characteristics that attract chemists, biologists, and computer scientists. Interaction of excitation wave-fronts in BZ system, can be interpreted in terms of logical gates and applied in the design of unconventional hardware components. Logic gates and other more complicated components have been already proposed using different topologies and particular characteristics. In this study, the inherent parallelism and simplicity of Cellular Automata (CAs) modeling is combined with an Oregonator model of light-sensitive version of BZ reaction. The resulting parallel and computationally-inexpensive model has the ability to simulate a topology that can be considered as a one-bit full adder digital component towards the design of an Arithmetic Logic Unit (ALU).
101.
Kalogeiton V S, Papadopoulos D P, Liolis O, Mardiris V A, Sirakoulis G Ch, Karafyllidis I G
Programmable crossbar quantum-dot cellular automata circuits Journal Article
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 36, no. 8, pp. 1367–1380, 2016.
@article{kalogeiton2017programmable,
title = {Programmable crossbar quantum-dot cellular automata circuits},
author = {Vicky S Kalogeiton and Dim P Papadopoulos and Orestis Liolis and Vassilios A Mardiris and Georgios Ch. Sirakoulis and Ioannis G Karafyllidis},
url = {https://ieeexplore.ieee.org/document/7600454},
doi = {10.1109/TCAD.2016.2618869},
year = {2016},
date = {2016-10-20},
urldate = {2017-01-01},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
volume = {36},
number = {8},
pages = {1367--1380},
publisher = {IEEE},
abstract = {Quantum-dot fabrication and characterization is a well-established technology, which is used in photonics, quantum optics, and nanoelectronics. Four quantum-dots placed at the corners of a square form a unit cell, which can hold a bit of information and serve as a basis for quantum-dot cellular automata (QCA) nanoelectronic circuits. Although several basic QCA circuits have been designed, fabricated, and tested, proving that quantum-dots can form functional, fast and low-power nanoelectronic circuits, QCA nanoelectronics still remain at its infancy. One of the reasons for this is the lack of design automation tools, which will facilitate the systematic design of large QCA circuits that contemporary applications demand. Here we present novel, programmable QCA circuits, which are based on crossbar architecture. These circuits can be programmed to implement any Boolean function in analogy to CMOS field-programmable gate arrays and open the road that will lead to full design automation of QCA nanoelectronic circuits. Using this architecture we designed and simulated QCA circuits that proved to be area efficient, stable, and reliable.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Quantum-dot fabrication and characterization is a well-established technology, which is used in photonics, quantum optics, and nanoelectronics. Four quantum-dots placed at the corners of a square form a unit cell, which can hold a bit of information and serve as a basis for quantum-dot cellular automata (QCA) nanoelectronic circuits. Although several basic QCA circuits have been designed, fabricated, and tested, proving that quantum-dots can form functional, fast and low-power nanoelectronic circuits, QCA nanoelectronics still remain at its infancy. One of the reasons for this is the lack of design automation tools, which will facilitate the systematic design of large QCA circuits that contemporary applications demand. Here we present novel, programmable QCA circuits, which are based on crossbar architecture. These circuits can be programmed to implement any Boolean function in analogy to CMOS field-programmable gate arrays and open the road that will lead to full design automation of QCA nanoelectronic circuits. Using this architecture we designed and simulated QCA circuits that proved to be area efficient, stable, and reliable.
100.
Giitsidis T, Sirakoulis G Ch
Modeling passengers boarding in aircraft using cellular automata Journal Article
In: IEEE/CAA Journal of Automatica Sinica, vol. 3, no. 4, pp. 365–384, 2016.
@article{giitsidis2016modeling,
title = {Modeling passengers boarding in aircraft using cellular automata},
author = {Themistoklis Giitsidis and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/7589483},
doi = {10.1109/JAS.2016.7510076},
year = {2016},
date = {2016-10-13},
urldate = {2016-01-01},
journal = {IEEE/CAA Journal of Automatica Sinica},
volume = {3},
number = {4},
pages = {365--384},
abstract = {Aircraft are profitable to their owners as long as they are in the air transporting passengers to their destinations; therefore it is vital to minimize as much as possible their preparation time on the ground. In this paper we simulate different boarding strategies with the help of a model based on cellular automata parallel computational tool, attempting to find the most efficient way to deliver each passenger to her or his assigned seat. Two seat arrangements are used, a small one based on Airbus A320 U+002F Boeing 737 and a larger one based on Airbus A380 U+002F Boeing 777-300. A wide variety of parameters, including time delay for luggage storing, the frequency by which the passengers enter the plane, different walking speeds of passengers depending on sex, age and height, and the possibility of walking past their seat, are simulated in order to achieve realistic results, as well as monitor their effects on boarding time. The simulation results indicate that the boarding time can be significantly reduced by the simple grouping and prioritizing of passengers. In accordance with previous papers and the examined strategies, the outside-in and reverse pyramid boarding methods outperform all the others for both the small and large airplane seat layout. In the latter, the examined strategies are introduced for first time in an analogous way to the initial small seat arrangement of Airbus A320 U+002F Boeing 737 aircraft family. Moreover, since in real world scenarios, the compliance of all the passengers to the suggested group division and boarding strategy cannot be guaranteed, further simulations were conducted. It is clear that as the number of passengers disregarding the priority of the boarding groups increases, the time needed for the boarding to complete tends towards that of the random boarding strategy, thus minimizing the possible advantages gained by the proposed boarding strategies.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Aircraft are profitable to their owners as long as they are in the air transporting passengers to their destinations; therefore it is vital to minimize as much as possible their preparation time on the ground. In this paper we simulate different boarding strategies with the help of a model based on cellular automata parallel computational tool, attempting to find the most efficient way to deliver each passenger to her or his assigned seat. Two seat arrangements are used, a small one based on Airbus A320 U+002F Boeing 737 and a larger one based on Airbus A380 U+002F Boeing 777-300. A wide variety of parameters, including time delay for luggage storing, the frequency by which the passengers enter the plane, different walking speeds of passengers depending on sex, age and height, and the possibility of walking past their seat, are simulated in order to achieve realistic results, as well as monitor their effects on boarding time. The simulation results indicate that the boarding time can be significantly reduced by the simple grouping and prioritizing of passengers. In accordance with previous papers and the examined strategies, the outside-in and reverse pyramid boarding methods outperform all the others for both the small and large airplane seat layout. In the latter, the examined strategies are introduced for first time in an analogous way to the initial small seat arrangement of Airbus A320 U+002F Boeing 737 aircraft family. Moreover, since in real world scenarios, the compliance of all the passengers to the suggested group division and boarding strategy cannot be guaranteed, further simulations were conducted. It is clear that as the number of passengers disregarding the priority of the boarding groups increases, the time needed for the boarding to complete tends towards that of the random boarding strategy, thus minimizing the possible advantages gained by the proposed boarding strategies.
99.
Kechaidou M G, Sirakoulis G Ch
Game of Life variations for image scrambling Journal Article
In: Journal of Computational Science, vol. 21, pp. 432–447, 2016.
@article{kechaidou2017game,
title = {Game of Life variations for image scrambling},
author = {Marina G. Kechaidou and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/pii/S1877750316301442},
doi = {doi.org/10.1016/j.jocs.2016.09.002},
year = {2016},
date = {2016-09-16},
urldate = {2017-09-16},
journal = {Journal of Computational Science},
volume = {21},
pages = {432--447},
publisher = {Elsevier},
abstract = {The rapid development of multimedia and Internet technology has given more and more people the opportunity to exchange information via the Internet. There are many cases in which images containing trivial information are transmitted, but most of the time images will contain private data and therefore must be protected. Consequently, the security and confidentiality of digital data during storage and transmission have become an important and critical issue. Digital image scrambling is often used for image encryption and its aim is to transform a meaningful image into a meaningless one to enhance the ability to resist invalid attack and in turn improve security. In this paper, a new scheme is presented for digital gray image scrambling based on variants of the famous Game of Life (GoL) Cellular Automaton (CA). More specifically, two of those variations, namely asynchrony and enlarged neighborhood are taken into account. They are further enhanced to implement suitable GoL variations for efficient digital grey image scrambling while the presented simulation results prove that the modified variations can provide high security by scrambling pixel locations. It is shown that the resulting scrambling effect is influenced by the employed variation of GoL as well as by the dimensions of the image. Finally, in terms of Gray Difference Degree (GDD) the proposed digital image scrambling method, which is based on the aforementioned GoL variations, outperforms the existing techniques and produces an effective image encryption technique which enables excellent confidentiality.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The rapid development of multimedia and Internet technology has given more and more people the opportunity to exchange information via the Internet. There are many cases in which images containing trivial information are transmitted, but most of the time images will contain private data and therefore must be protected. Consequently, the security and confidentiality of digital data during storage and transmission have become an important and critical issue. Digital image scrambling is often used for image encryption and its aim is to transform a meaningful image into a meaningless one to enhance the ability to resist invalid attack and in turn improve security. In this paper, a new scheme is presented for digital gray image scrambling based on variants of the famous Game of Life (GoL) Cellular Automaton (CA). More specifically, two of those variations, namely asynchrony and enlarged neighborhood are taken into account. They are further enhanced to implement suitable GoL variations for efficient digital grey image scrambling while the presented simulation results prove that the modified variations can provide high security by scrambling pixel locations. It is shown that the resulting scrambling effect is influenced by the employed variation of GoL as well as by the dimensions of the image. Finally, in terms of Gray Difference Degree (GDD) the proposed digital image scrambling method, which is based on the aforementioned GoL variations, outperforms the existing techniques and produces an effective image encryption technique which enables excellent confidentiality.
98.
Ntinas V G, Moutafis B E, Trunfio G A, Sirakoulis G Ch
Parallel fuzzy cellular automata for data-driven simulation of wildfire spreading Journal Article
In: Journal of Computational Science, vol. 21, pp. 469–485, 2016.
@article{ntinas2017parallel,
title = {Parallel fuzzy cellular automata for data-driven simulation of wildfire spreading},
author = {Vasileios G Ntinas and Byron E Moutafis and Giuseppe A Trunfio and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/pii/S1877750316301260},
doi = {doi.org/10.1016/j.jocs.2016.08.003},
year = {2016},
date = {2016-08-24},
urldate = {2017-01-01},
journal = {Journal of Computational Science},
volume = {21},
pages = {469--485},
publisher = {Elsevier},
abstract = {Cellular Automata (CA) have been introduced many decades ago as one of the most efficient parallel computational models able to simulate various physical processes and systems where the interactions are local. In this paper, we are trying to advance the application of CA in modeling wildfires by accounting for the fuzziness intrinsic to the numerous environmental variables and mechanisms engaged with the emergence of the phenomenon itself. The proposed Fuzzy CA (FCA) model adopts a data-driven approach, based on evolutionary optimization, which allows incorporating knowledge from real wildfires in order to enhance its accuracy. The main difficulty for doing so arrives from the computational complexity of the proposed framework and the burden of computational resources needed for its application, which would prevent the real-time prediction of fire spread scenarios. In order to tackle the aforementioned difficulties, we propose model's fully parallel implementations in Graphical Processing Units (GPUs) and Field Programmable Gate Arrays (FPGAs) hardware. In the article, we first investigate the speedup achieved by the developed parallel implementations. Then, we present and discuss two applications to heterogeneous landscapes through comparisons with observed wildfires. Moreover, we compare the proposed framework with two different modelling approaches and results found are really promising.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Cellular Automata (CA) have been introduced many decades ago as one of the most efficient parallel computational models able to simulate various physical processes and systems where the interactions are local. In this paper, we are trying to advance the application of CA in modeling wildfires by accounting for the fuzziness intrinsic to the numerous environmental variables and mechanisms engaged with the emergence of the phenomenon itself. The proposed Fuzzy CA (FCA) model adopts a data-driven approach, based on evolutionary optimization, which allows incorporating knowledge from real wildfires in order to enhance its accuracy. The main difficulty for doing so arrives from the computational complexity of the proposed framework and the burden of computational resources needed for its application, which would prevent the real-time prediction of fire spread scenarios. In order to tackle the aforementioned difficulties, we propose model's fully parallel implementations in Graphical Processing Units (GPUs) and Field Programmable Gate Arrays (FPGAs) hardware. In the article, we first investigate the speedup achieved by the developed parallel implementations. Then, we present and discuss two applications to heterogeneous landscapes through comparisons with observed wildfires. Moreover, we compare the proposed framework with two different modelling approaches and results found are really promising.
97.
Vourkas I, Sirakoulis G Ch
Emerging Memristor-Based Logic Circuit Design Approaches: A Review Journal Article
In: IEEE Circuits and Systems Magazine, vol. 16, no. 3, pp. 15–30, 2016.
@article{vourkas2016emerging,
title = {Emerging Memristor-Based Logic Circuit Design Approaches: A Review},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/7548085},
doi = {10.1109/MCAS.2016.2583673},
year = {2016},
date = {2016-08-19},
urldate = {2016-01-01},
journal = {IEEE Circuits and Systems Magazine},
volume = {16},
number = {3},
pages = {15--30},
publisher = {IEEE},
abstract = {This article is a comprehensive review of the state-of-theart of memristor-based logic circuit design concepts of the recent literature. Amongst all the identified circuit design approaches, those discussed here are all based on collective memristive dynamics and share a number of common characteristics which facilitate their comparison. The focus is on the evolution of the memristor-based logic circuit design strategies from the early proposed sequential stateful logic up to most recently published design schemes which support parallel processing of the applied input signals. The main operational properties of all the selected computational concepts are presented in an accessible manner, aiming to serve as an informative cornerstone for students and scientists who wish to get involved in emerging memristive logic circuit research and development.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This article is a comprehensive review of the state-of-theart of memristor-based logic circuit design concepts of the recent literature. Amongst all the identified circuit design approaches, those discussed here are all based on collective memristive dynamics and share a number of common characteristics which facilitate their comparison. The focus is on the evolution of the memristor-based logic circuit design strategies from the early proposed sequential stateful logic up to most recently published design schemes which support parallel processing of the applied input signals. The main operational properties of all the selected computational concepts are presented in an accessible manner, aiming to serve as an informative cornerstone for students and scientists who wish to get involved in emerging memristive logic circuit research and development.
96.
Vourkas I, Papandroulidakis G, Sirakoulis G Ch, Abusleme A
2T1M-Based Double Memristive Crossbar Architecture for In-Memory Computing. Journal Article
In: International Journal of Unconventional Computing, vol. 12, no. 4, pp. 265–280, 2016.
@article{vourkas20162t1m,
title = {2T1M-Based Double Memristive Crossbar Architecture for In-Memory Computing.},
author = {Ioannis Vourkas and Georgios Papandroulidakis and Georgios Ch. Sirakoulis and Angel Abusleme},
url = {https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-12-number-4-2016/ijuc-12-4-p-265-280/},
year = {2016},
date = {2016-08-01},
urldate = {2016-01-01},
journal = {International Journal of Unconventional Computing},
volume = {12},
number = {4},
pages = {265--280},
publisher = {Old City Publishing Inc},
abstract = {The recent discovery of the memristor has renewed the interest for fast arithmetic operations via high-radix numeric systems. In this direction, a conceptual solution for high-radix memristive arithmetic logic units (ALUs) was recently published. The latter combines CMOS circuitry for data processing and a reconfigurable “segmented” crossbar memory block. In this paper we build upon such a conceptual design and propose a 3D extension of the classic crossbar topology via 2T1M cross-points which still permits the parallel creation of partial products for faster multiplication with lower circuit complexity. Furthermore, we present a binary to high-radix data conversion circuit to complement the state-programming module of the previous work. A simulation-based validation of read/write multi-level memory operations from/to the 2T1M 3D memristive crossbar was performed using SPICE and a threshold-type switching model of a bipolar voltage-controlled memristor. Such realization of in-memory computations could lead to faster arithmetic algorithms in future memristive ALUs.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The recent discovery of the memristor has renewed the interest for fast arithmetic operations via high-radix numeric systems. In this direction, a conceptual solution for high-radix memristive arithmetic logic units (ALUs) was recently published. The latter combines CMOS circuitry for data processing and a reconfigurable “segmented” crossbar memory block. In this paper we build upon such a conceptual design and propose a 3D extension of the classic crossbar topology via 2T1M cross-points which still permits the parallel creation of partial products for faster multiplication with lower circuit complexity. Furthermore, we present a binary to high-radix data conversion circuit to complement the state-programming module of the previous work. A simulation-based validation of read/write multi-level memory operations from/to the 2T1M 3D memristive crossbar was performed using SPICE and a threshold-type switching model of a bipolar voltage-controlled memristor. Such realization of in-memory computations could lead to faster arithmetic algorithms in future memristive ALUs.
95.
Bontzorlos T, Sirakoulis G Ch
Bioinspired algorithm for area surveillance using autonomous robots Journal Article
In: International Journal of Parallel, Emergent and Distributed Systems, vol. 32, no. 4, pp. 368–385, 2016.
@article{bontzorlos2017bioinspired,
title = {Bioinspired algorithm for area surveillance using autonomous robots},
author = {Tilemachos Bontzorlos and Georgios Ch. Sirakoulis},
url = {https://www.tandfonline.com/doi/abs/10.1080/17445760.2016.1184269},
doi = {doi.org/10.1080/17445760.2016.1184269},
year = {2016},
date = {2016-06-10},
urldate = {2017-01-01},
journal = {International Journal of Parallel, Emergent and Distributed Systems},
volume = {32},
number = {4},
pages = {368--385},
publisher = {Taylor \& Francis},
abstract = {Territorial surveillance plays a constantly increasing role in security. However, completely automatic surveillance using autonomous robots is hard to implement and maintain. Current methods described in literature propose systems that include direct communication of the robots or the use of a centralised system to coordinate the robots. These systems are prone to equipment failure and/or malicious attacks to the centralised system. In this paper, we propose a bioinspired algorithm that allows indirect communication between the robots that are considered minimally equipped. This is achieved by applying a parallel and distributed technique inspired by the emergent behaviour of social insects, namely ant colonies. In particular, the development of a collective memory for robots and areas covered is achieved subsequently through self-organisation of the autonomous robots to a continuous dynamic coverage of the test space. The algorithm is shown to have a robust behaviour and competitive performance. Several simulations run for various space sizes, different number of robots, different pheromone evaporation rates as well various percentages of space covered by obstacles. In all cases the efficacy of the proposed algorithm has been successfully proven when compared with other well known techniques.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Territorial surveillance plays a constantly increasing role in security. However, completely automatic surveillance using autonomous robots is hard to implement and maintain. Current methods described in literature propose systems that include direct communication of the robots or the use of a centralised system to coordinate the robots. These systems are prone to equipment failure and/or malicious attacks to the centralised system. In this paper, we propose a bioinspired algorithm that allows indirect communication between the robots that are considered minimally equipped. This is achieved by applying a parallel and distributed technique inspired by the emergent behaviour of social insects, namely ant colonies. In particular, the development of a collective memory for robots and areas covered is achieved subsequently through self-organisation of the autonomous robots to a continuous dynamic coverage of the test space. The algorithm is shown to have a robust behaviour and competitive performance. Several simulations run for various space sizes, different number of robots, different pheromone evaporation rates as well various percentages of space covered by obstacles. In all cases the efficacy of the proposed algorithm has been successfully proven when compared with other well known techniques.
94.
Sirakoulis G Ch
Parallel Application of Hybrid DNA Cellular Automata for Pseudorandom Number Generation. Journal Article
In: Journal of Cellular Automata, vol. 11, no. 1, pp. 63–89, 2016.
@article{sirakoulis2016parallel,
title = {Parallel Application of Hybrid DNA Cellular Automata for Pseudorandom Number Generation.},
author = {Georgios Ch. Sirakoulis},
url = {http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-11-number-1-2016/jca-11-1-p-63-89/},
year = {2016},
date = {2016-03-01},
urldate = {2016-01-01},
journal = {Journal of Cellular Automata},
volume = {11},
number = {1},
pages = {63--89},
publisher = {Old City Publishing Inc},
abstract = {With the advent of massively parallel scientific computation, the parallel generation of pseudorandom numbers has become essential. During the last decades several researchers have successfully implemented Cellular Automata (CA) as Pseudorandom Number Generators (PRNGs). On the other hand, recently Autonomous DNA Turing Machines and DNA Cellular Automata were proposed as cellular computing devices that can serve as reusable, compact computing devices to perform (universal) computation. In this paper, we introduce a methodology for the design of one-dimensional (1-d) Hybrid Autonomous DNA Cellular Automata (HADCA), able to run in parallel, different CA rules with certain modifications on their molecular implementation and information flow compared to their origins. In this aspect, an easy to use HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. As a result, the proposed 1-d HADCAs are used to generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness, proving their suitability as PRNGs.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
With the advent of massively parallel scientific computation, the parallel generation of pseudorandom numbers has become essential. During the last decades several researchers have successfully implemented Cellular Automata (CA) as Pseudorandom Number Generators (PRNGs). On the other hand, recently Autonomous DNA Turing Machines and DNA Cellular Automata were proposed as cellular computing devices that can serve as reusable, compact computing devices to perform (universal) computation. In this paper, we introduce a methodology for the design of one-dimensional (1-d) Hybrid Autonomous DNA Cellular Automata (HADCA), able to run in parallel, different CA rules with certain modifications on their molecular implementation and information flow compared to their origins. In this aspect, an easy to use HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. As a result, the proposed 1-d HADCAs are used to generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness, proving their suitability as PRNGs.
93.
Kachris C, Diamantopoulos D, Sirakoulis G Ch, Soudris D
An FPGA-based Integrated MapReduce Accelerator Platform. Journal Article
In: Journal of Signal Processing Systems, vol. 87, no. 3, pp. 357–369, 2016.
@article{kachris2017fpga,
title = {An FPGA-based Integrated MapReduce Accelerator Platform.},
author = {Christoforos Kachris and Dionysios Diamantopoulos and Georgios Ch. Sirakoulis and Dimitrios Soudris},
url = {https://link.springer.com/article/10.1007/s11265-016-1108-7},
doi = {doi.org/10.1007/s11265-016-1108-7},
year = {2016},
date = {2016-02-23},
urldate = {2017-01-01},
journal = {Journal of Signal Processing Systems},
volume = {87},
number = {3},
pages = {357--369},
publisher = {Springer},
abstract = {MapReduce is a programming framework for distributed systems that is used to automatically parallelize and schedule the tasks to distributed resources. MapReduce is widely used in data centers to process enterprise databases and Big Data. This paper presents a novel MapReduce accelerator platform based on FPGAs that can be used to speedup the processing of the MapReduce data. The proposed platform consists of specialized hardware accelerators for the Map tasks and a shared configurable accelerator for the Reduce tasks. The hardware accelerators for the Map tasks are developed using a modified source-to-source High-level Synthesis (HLS) tool while the Reduce accelerator is based on a novel hashing scheme. The proposed scheme is implemented, mapped and evaluated to a Virtex 7 FGPA. The performance evaluation is based on a benchmark suite that represent typical MapReduce applications and it shows that the proposed scheme can achieve up to 2 orders of magnitude energy reduction compared to General Purpose Processors (GPPs).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
MapReduce is a programming framework for distributed systems that is used to automatically parallelize and schedule the tasks to distributed resources. MapReduce is widely used in data centers to process enterprise databases and Big Data. This paper presents a novel MapReduce accelerator platform based on FPGAs that can be used to speedup the processing of the MapReduce data. The proposed platform consists of specialized hardware accelerators for the Map tasks and a shared configurable accelerator for the Reduce tasks. The hardware accelerators for the Map tasks are developed using a modified source-to-source High-level Synthesis (HLS) tool while the Reduce accelerator is based on a novel hashing scheme. The proposed scheme is implemented, mapped and evaluated to a Virtex 7 FGPA. The performance evaluation is based on a benchmark suite that represent typical MapReduce applications and it shows that the proposed scheme can achieve up to 2 orders of magnitude energy reduction compared to General Purpose Processors (GPPs).
92.
Chatziagorakis P, Ziogou C, Elmasides C, Sirakoulis G Ch, Karafyllidis I, Andreadis I, Georgoulas N, Giaouris D, Papadopoulos A I, Ipsakis D, Papadopoulou S, Seferlis P, Sergiopoulos F, Voutetakis S
Enhancement of hybrid renewable energy systems control with neural networks applied to weather forecasting: the case of Olvio Journal Article
In: Neural Computing and Applications, vol. 27, no. 5, pp. 1093–1118, 2016.
@article{chatziagorakis2016enhancement,
title = {Enhancement of hybrid renewable energy systems control with neural networks applied to weather forecasting: the case of Olvio},
author = {Prodromos Chatziagorakis and Chrysovalantou Ziogou and Constantinos Elmasides and Georgios Ch. Sirakoulis and Ioannis Karafyllidis and Ioannis Andreadis and Nikolaos Georgoulas and Damianos Giaouris and Athanasios I Papadopoulos and Dimitris Ipsakis and Semira Papadopoulou and Panos Seferlis and Fotios Sergiopoulos and Spiros Voutetakis},
url = {https://link.springer.com/article/10.1007/s00521-015-2175-6},
doi = {doi.org/10.1007/s00521-015-2175-6},
year = {2016},
date = {2016-01-21},
urldate = {2016-01-01},
journal = {Neural Computing and Applications},
volume = {27},
number = {5},
pages = {1093--1118},
publisher = {Springer London},
abstract = {In this paper, an intelligent forecasting model, a recurrent neural network (RNN) with nonlinear autoregressive architecture, for daily and hourly solar radiation and wind speed prediction is proposed for the enhancement of the power management strategies (PMSs) of hybrid renewable energy systems (HYRES). The presented model (RNN) is applicable to an autonomous HYRES, where its estimations can be used by a central control unit in order to create in real time the proper PMSs for the efficient subsystems’ utilization and overall process optimization. For this purpose, a flexible network-based design of the HYRES is used and, moreover, applied to a specific system located on Olvio, near Xanthi, Greece, as part of Systems Sunlight S.A. facilities. The simulation results indicated that RNN is capable of assimilating the given information and delivering some satisfactory future estimation achieving regression coefficient from 0.93 up to 0.99 that can be used to safely calculate the available green energy. Moreover, it has some sufficient for the specific problem computational power, as it can deliver the final results in just a few seconds. As a result, the RNN framework, trained with local meteorological data, successfully manages to enhance and optimize the PMS based on the provided solar radiation and wind speed prediction and make the specific HYRES suitable for use as a stand-alone remote energy plant.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, an intelligent forecasting model, a recurrent neural network (RNN) with nonlinear autoregressive architecture, for daily and hourly solar radiation and wind speed prediction is proposed for the enhancement of the power management strategies (PMSs) of hybrid renewable energy systems (HYRES). The presented model (RNN) is applicable to an autonomous HYRES, where its estimations can be used by a central control unit in order to create in real time the proper PMSs for the efficient subsystems’ utilization and overall process optimization. For this purpose, a flexible network-based design of the HYRES is used and, moreover, applied to a specific system located on Olvio, near Xanthi, Greece, as part of Systems Sunlight S.A. facilities. The simulation results indicated that RNN is capable of assimilating the given information and delivering some satisfactory future estimation achieving regression coefficient from 0.93 up to 0.99 that can be used to safely calculate the available green energy. Moreover, it has some sufficient for the specific problem computational power, as it can deliver the final results in just a few seconds. As a result, the RNN framework, trained with local meteorological data, successfully manages to enhance and optimize the PMS based on the provided solar radiation and wind speed prediction and make the specific HYRES suitable for use as a stand-alone remote energy plant.
91.
Dourvas N I, Sirakoulis G Ch, Tsalides P
A GPGPU Physarum Cellular Automaton Model Journal Article
In: Applied Mathematics and Information Sciences, vol. 10, no. 6, pp. 2055–2069, 2016.
@article{dourvas2016gpgpu,
title = {A GPGPU Physarum Cellular Automaton Model},
author = {Nikolaos I Dourvas and Georgios Ch. Sirakoulis and Philippos Tsalides},
url = {https://dc.naturalspublishing.com/amis/vol10/iss6/7/},
doi = {dx.doi.org/10.18576/amis/100607},
year = {2016},
date = {2016-01-11},
urldate = {2016-01-11},
journal = {Applied Mathematics and Information Sciences},
volume = {10},
number = {6},
pages = {2055--2069},
abstract = {Scientists have been gaining inspiration from several natural processes and systems to find fine solutions in many complex hard to solve engineering problems for many years now. Nevertheless, most of these natural systems suffer from great amount of time to perform; thus, scientists are seeking for computational tools and methods that could encapsulate in a conscious way nature’s genius, dealing at the same moment with time complexity. In this conquest, Cellular Automata (CA) proposed long time ago by John von Neumann, can be considered as a promising candidate. CA have the ability to capture the essential features of systems in which global complicated behavior emerges from the collective effect of simple components, which interact locally. These characteristics are immanent in many natural systems; namely Physarum polycephalum,an amoeba, is such a system. This simple organism presents the intelligence of finding effective solutions to demanding engineering problems such as shortest path(s) problems, various graph problems, evaluation of transport networks or even robotic control. In this paper, we move forward by taking advantage of a Graphical Processing Unit (GPU) and the Compute Unified Device Architecture (CUDA) programming model, to make use of the CA inherit parallelism when biomimicking the behavior of P. polycephalum in maze, providing the ability to find the minimum path between two spots. In this way we are able to produce a virtual easy-to-access lab speeding up significantly the biological paradigm when modeled by CA implemented in General Purpose computing on Graphics Processing Units (GPGPU) environment.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Scientists have been gaining inspiration from several natural processes and systems to find fine solutions in many complex hard to solve engineering problems for many years now. Nevertheless, most of these natural systems suffer from great amount of time to perform; thus, scientists are seeking for computational tools and methods that could encapsulate in a conscious way nature’s genius, dealing at the same moment with time complexity. In this conquest, Cellular Automata (CA) proposed long time ago by John von Neumann, can be considered as a promising candidate. CA have the ability to capture the essential features of systems in which global complicated behavior emerges from the collective effect of simple components, which interact locally. These characteristics are immanent in many natural systems; namely Physarum polycephalum,an amoeba, is such a system. This simple organism presents the intelligence of finding effective solutions to demanding engineering problems such as shortest path(s) problems, various graph problems, evaluation of transport networks or even robotic control. In this paper, we move forward by taking advantage of a Graphical Processing Unit (GPU) and the Compute Unified Device Architecture (CUDA) programming model, to make use of the CA inherit parallelism when biomimicking the behavior of P. polycephalum in maze, providing the ability to find the minimum path between two spots. In this way we are able to produce a virtual easy-to-access lab speeding up significantly the biological paradigm when modeled by CA implemented in General Purpose computing on Graphics Processing Units (GPGPU) environment.
90.
Tsompanas M I, Kachris C, Sirakoulis G Ch
Modeling cache memory utilization on multicore using common pool resource game on cellular automata Journal Article
In: ACM Transactions on Modeling and Computer Simulation (TOMACS), vol. 26, no. 3, pp. 1–22, 2016.
@article{tsompanas2016modeling,
title = {Modeling cache memory utilization on multicore using common pool resource game on cellular automata},
author = {Michail-Antisthenis I Tsompanas and Christoforos Kachris and Georgios Ch. Sirakoulis},
url = {https://dl.acm.org/doi/10.1145/2812808},
doi = {doi.org/10.1145/2812808},
year = {2016},
date = {2016-01-09},
urldate = {2016-01-01},
journal = {ACM Transactions on Modeling and Computer Simulation (TOMACS)},
volume = {26},
number = {3},
pages = {1--22},
publisher = {ACM New York, NY, USA},
abstract = {Recent computing architectures are implemented by shared memory technologies to alleviate the high latency experienced by off-chip memory transfers, but the high architectural complexity of modern multicore processors has presented many questions. To tackle the design of efficient algorithms scheduling workloads over available cores, this article presents a parallel bioinspired model that simulates the utilization of shared memory on multicore systems. The proposed model is based on cellular automata (CA) and coupled with game theory principles. CA are selected due to their inherent parallelism and especially their ability to incorporate inhomogeneities. Furthermore, the novelty of the model is realized on the fact that multilevel CA are used to simulate the different levels of cache memory usually found in multicore processors. These characteristics make the model able to cope with the increasing diversity of cache memory hierarchies on modern and future processors. Nonetheless, by acquiring data from hardware performance counters and processing them with the proposed model online, the performance of the system can be calculated and a better scheduling strategy can be adopted in real time. The CA-based model was verified on the behavior of a real multicore system running a multithreaded application, and it successfully simulated the acceleration achieved by an increased number of cores available for the execution of the workload. More specifically, the example of common pool resource from game theory was used with two variations: a static and a variable initial endowment. The static variation of the model approximates slightly better the acceleration of a workload when the number of available processor cores increases, whereas the dynamic variation simulates better the moderate differences due to operation system’s scheduler alternations on the same amount of cores.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Recent computing architectures are implemented by shared memory technologies to alleviate the high latency experienced by off-chip memory transfers, but the high architectural complexity of modern multicore processors has presented many questions. To tackle the design of efficient algorithms scheduling workloads over available cores, this article presents a parallel bioinspired model that simulates the utilization of shared memory on multicore systems. The proposed model is based on cellular automata (CA) and coupled with game theory principles. CA are selected due to their inherent parallelism and especially their ability to incorporate inhomogeneities. Furthermore, the novelty of the model is realized on the fact that multilevel CA are used to simulate the different levels of cache memory usually found in multicore processors. These characteristics make the model able to cope with the increasing diversity of cache memory hierarchies on modern and future processors. Nonetheless, by acquiring data from hardware performance counters and processing them with the proposed model online, the performance of the system can be calculated and a better scheduling strategy can be adopted in real time. The CA-based model was verified on the behavior of a real multicore system running a multithreaded application, and it successfully simulated the acceleration achieved by an increased number of cores available for the execution of the workload. More specifically, the example of common pool resource from game theory was used with two variations: a static and a variable initial endowment. The static variation of the model approximates slightly better the acceleration of a workload when the number of available processor cores increases, whereas the dynamic variation simulates better the moderate differences due to operation system’s scheduler alternations on the same amount of cores.
89.
Spartalis E, Georgoudas I G, Sirakoulis G Ch
A CA-Based Model with Virtual Field for Guided Evacuation of People with Motion Difficulties. Journal Article
In: Journal of Cellular Automata, vol. 11, no. 4, pp. 311–326, 2016.
@article{spartalis2016based,
title = {A CA-Based Model with Virtual Field for Guided Evacuation of People with Motion Difficulties.},
author = {Eleftherios Spartalis and Ioakeim G. Georgoudas and Georgios Ch. Sirakoulis},
url = {http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-11-number-4-2016/jca-11-4-p-311-326/},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
journal = {Journal of Cellular Automata},
volume = {11},
number = {4},
pages = {311--326},
abstract = {This paper presents a Cellular Automata (CA) based model that simulates movement of pedestrians with motion difficulties, such as elderly people and further focuses on how such groups can be guided within specific areas, as for example a nursing home. The model is originated by a virtual potential field. The aim of the model is to provide valuable information regarding the dynamics of their motion and to propose advanced layout settings of the corresponding places, in order to optimize the safety levels. Various scenarios are studied that include different layouts, presence of obstacles, group categorisation, crowd guiding and fire spreading. Simulation results confirm that the model can be proven a helpful tool, in order spatial parameters that affect evacuation time to be defined as well as personnel to be trained in guiding weak people.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper presents a Cellular Automata (CA) based model that simulates movement of pedestrians with motion difficulties, such as elderly people and further focuses on how such groups can be guided within specific areas, as for example a nursing home. The model is originated by a virtual potential field. The aim of the model is to provide valuable information regarding the dynamics of their motion and to propose advanced layout settings of the corresponding places, in order to optimize the safety levels. Various scenarios are studied that include different layouts, presence of obstacles, group categorisation, crowd guiding and fire spreading. Simulation results confirm that the model can be proven a helpful tool, in order spatial parameters that affect evacuation time to be defined as well as personnel to be trained in guiding weak people.
88.
Tsompanas M I, Sirakoulis G Ch, Adamatzky A I
Evolving transport networks with cellular automata models inspired by slime mould Journal Article
In: IEEE Transactions on Cybernetics, vol. 45, no. 9, pp. 1887–1899, 2015.
@article{tsompanas2015evolving,
title = {Evolving transport networks with cellular automata models inspired by slime mould},
author = {Michail-Antisthenis I Tsompanas and Georgios Ch. Sirakoulis and Andrew I Adamatzky},
url = {https://ieeexplore.ieee.org/document/6966774},
doi = {10.1109/TCYB.2014.2361731},
year = {2015},
date = {2015-11-25},
urldate = {2015-01-01},
journal = {IEEE Transactions on Cybernetics},
volume = {45},
number = {9},
pages = {1887--1899},
publisher = {IEEE},
abstract = {Man-made transport networks and their design are closely related to the shortest path problem and considered amongst the most debated problems of computational intelligence. Apart from using conventional or bio-inspired computer algorithms, many researchers tried to solve this kind of problem using biological computing substrates, gas-discharge solvers, prototypes of a mobile droplet, and hot ice computers. In this aspect, another example of biological computer is the plasmodium of a cellular slime mould Physarum polycephalum (P. polycephalum), which is a large single cell visible by an unaided eye and has been proven as a reliable living substrate for implementing biological computing devices for computational geometry, graph-theoretical problems, and optimization and imitation of transport networks. Although P. polycephalum is easy to experiment with, computing devices built with the living slime mould are extremely slow; it takes slime mould days to execute a computation. Consequently, mapping key computing mechanisms of the slime mould onto silicon would allow us to produce efficient bio-inspired computing devices to tackle with hard to solve computational intelligence problems like the aforementioned. Toward this direction, a cellular automaton (CA)-based, Physarum-inspired, network designing model is proposed. This novel CA-based model is inspired by the propagating strategy, the formation of tubular networks, and the computing abilities of the plasmodium of P. polycephalum. The results delivered by the CA model demonstrate a good match with several previously published results of experimental laboratory studies on imitation of man-made transport networks with P. polycephalum. Consequently, the proposed CA model can be used as a virtual, easy-to-access, and biomimicking laboratory emulator that will economize large time periods needed for biological experiments while producing networks almost identical to the tubular networks of the real-slime mould.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Man-made transport networks and their design are closely related to the shortest path problem and considered amongst the most debated problems of computational intelligence. Apart from using conventional or bio-inspired computer algorithms, many researchers tried to solve this kind of problem using biological computing substrates, gas-discharge solvers, prototypes of a mobile droplet, and hot ice computers. In this aspect, another example of biological computer is the plasmodium of a cellular slime mould Physarum polycephalum (P. polycephalum), which is a large single cell visible by an unaided eye and has been proven as a reliable living substrate for implementing biological computing devices for computational geometry, graph-theoretical problems, and optimization and imitation of transport networks. Although P. polycephalum is easy to experiment with, computing devices built with the living slime mould are extremely slow; it takes slime mould days to execute a computation. Consequently, mapping key computing mechanisms of the slime mould onto silicon would allow us to produce efficient bio-inspired computing devices to tackle with hard to solve computational intelligence problems like the aforementioned. Toward this direction, a cellular automaton (CA)-based, Physarum-inspired, network designing model is proposed. This novel CA-based model is inspired by the propagating strategy, the formation of tubular networks, and the computing abilities of the plasmodium of P. polycephalum. The results delivered by the CA model demonstrate a good match with several previously published results of experimental laboratory studies on imitation of man-made transport networks with P. polycephalum. Consequently, the proposed CA model can be used as a virtual, easy-to-access, and biomimicking laboratory emulator that will economize large time periods needed for biological experiments while producing networks almost identical to the tubular networks of the real-slime mould.
87.
Sirakoulis G Ch
The Computational Paradigm of Cellular Automata in Crowd Evacuation Journal Article
In: International Journal of Foundations of Computer Science, vol. 26, no. 7, pp. 851–872, 2015.
@article{sirakoulis2015computational,
title = {The Computational Paradigm of Cellular Automata in Crowd Evacuation},
author = {Georgios Ch. Sirakoulis},
url = {https://www.worldscientific.com/doi/10.1142/S0129054115400031},
doi = {doi.org/10.1142/S0129054115400031},
year = {2015},
date = {2015-09-10},
urldate = {2015-01-01},
journal = {International Journal of Foundations of Computer Science},
volume = {26},
number = {7},
pages = {851--872},
publisher = {World Scientific Publishing Company},
abstract = {During last decades, Cellular Automata (CAs) as bio-inspired parallel computational tools have been proven rather efficient and robust on modeling and simulating many different physical processes and systems and solving scientific problems, in which global behavior arises from the collective effect of simple components that interact locally. Among others of most renowned and well established CA applications, crowd evacuation and pedestrian dynamics are considered ones of the most timely and lively topics. Numerous models and computational paradigms of CAs either as standalone models or coupled with other theoretical and practical modeling approaches have been introduced in literature. All these crowd models are taking advantage of the fact that CA show evidence of a macroscopic nature with microscopic extensions, i.e. they provide adequate details in the description of human behavior and interaction, whilst they retain the computational cost at low levels. In this aspect, several CA models for crowd evacuation focusing on different modeling principles, like potential fields techniques, obstacle avoidance, follow the leader principles, grouping and queuing theory, long memory effects, etc. are presented in this paper. Moreover, having in mind the inherent parallelism of CA and their straightforward implementation in hardware, some anticipative crowd management systems based on CAs are also shown when operating on medium density crowd evacuation for indoor and outdoor environments. Real world cases and different environments were examined proving the efficiency of the proposed CA based anticipative systems. The proposed hardware implementation of the CAs-based crowd simulation models is advantageous in terms of low-cost, high-speed, compactness and portability features. Finally, robot guided evacuation with the help of CAs is also presented. The proposed framework relies on the well established CAs simulation models, while it employs a real-world evacuation implementation assisted by a mobile robotic guide, which in turn guides people towards a less congestive exit at a time.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
During last decades, Cellular Automata (CAs) as bio-inspired parallel computational tools have been proven rather efficient and robust on modeling and simulating many different physical processes and systems and solving scientific problems, in which global behavior arises from the collective effect of simple components that interact locally. Among others of most renowned and well established CA applications, crowd evacuation and pedestrian dynamics are considered ones of the most timely and lively topics. Numerous models and computational paradigms of CAs either as standalone models or coupled with other theoretical and practical modeling approaches have been introduced in literature. All these crowd models are taking advantage of the fact that CA show evidence of a macroscopic nature with microscopic extensions, i.e. they provide adequate details in the description of human behavior and interaction, whilst they retain the computational cost at low levels. In this aspect, several CA models for crowd evacuation focusing on different modeling principles, like potential fields techniques, obstacle avoidance, follow the leader principles, grouping and queuing theory, long memory effects, etc. are presented in this paper. Moreover, having in mind the inherent parallelism of CA and their straightforward implementation in hardware, some anticipative crowd management systems based on CAs are also shown when operating on medium density crowd evacuation for indoor and outdoor environments. Real world cases and different environments were examined proving the efficiency of the proposed CA based anticipative systems. The proposed hardware implementation of the CAs-based crowd simulation models is advantageous in terms of low-cost, high-speed, compactness and portability features. Finally, robot guided evacuation with the help of CAs is also presented. The proposed framework relies on the well established CAs simulation models, while it employs a real-world evacuation implementation assisted by a mobile robotic guide, which in turn guides people towards a less congestive exit at a time.
86.
Kachris C, Sirakoulis G Ch, Soudris D
A MapReduce scratchpad memory for multi-core cloud computing applications Journal Article
In: Microprocessors and Microsystems, vol. 39, no. 8, pp. 599–608, 2015.
@article{kachris2015mapreduce,
title = {A MapReduce scratchpad memory for multi-core cloud computing applications},
author = {Christoforos Kachris and Georgios Ch. Sirakoulis and Dimitrios Soudris},
url = {https://www.sciencedirect.com/science/article/pii/S0141933115001209},
doi = {doi.org/10.1016/j.micpro.2015.08.007},
year = {2015},
date = {2015-09-08},
urldate = {2015-01-01},
journal = {Microprocessors and Microsystems},
volume = {39},
number = {8},
pages = {599--608},
publisher = {Elsevier},
abstract = {Phoenix MapReduce is a multi-core programming framework that is used to automatically parallelize and schedule programs. This paper presents a novel scratchpad memory architecture that is used accelerate MapReduce applications by indexing and processing the key/value pairs. The proposed scratchpad memory scheme can be mapped onto programmable logic or multi-core processors chips as a coprocessor to accelerate MapReduce applications. The proposed architecture has been implemented in a Zynq FPGA with two embedded ARM cores. The performance evaluation shows that the proposed scheme can reduce up to 2.3 the execution time and up to 1.7 the energy consumption.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Phoenix MapReduce is a multi-core programming framework that is used to automatically parallelize and schedule programs. This paper presents a novel scratchpad memory architecture that is used accelerate MapReduce applications by indexing and processing the key/value pairs. The proposed scratchpad memory scheme can be mapped onto programmable logic or multi-core processors chips as a coprocessor to accelerate MapReduce applications. The proposed architecture has been implemented in a Zynq FPGA with two embedded ARM cores. The performance evaluation shows that the proposed scheme can reduce up to 2.3 the execution time and up to 1.7 the energy consumption.
85.
Chatziagorakis P, Sirakoulis G Ch
Cellular automata simulation of saltwater intrusion in coastal aquifer Journal Article
In: International Journal of Parallel, Emergent and Distributed Systems, vol. 31, no. 6, pp. 1–12, 2015.
@article{chatziagorakis2015cellular,
title = {Cellular automata simulation of saltwater intrusion in coastal aquifer},
author = {Prodromos Chatziagorakis and Georgios Ch. Sirakoulis},
url = {https://www.tandfonline.com/doi/abs/10.1080/17445760.2015.1077523?journalCode=gpaa20},
doi = {https://doi.org/10.1080/17445760.2015.1077523},
year = {2015},
date = {2015-09-01},
urldate = {2015-01-01},
journal = {International Journal of Parallel, Emergent and Distributed Systems},
volume = {31},
number = {6},
pages = {1--12},
publisher = {Taylor \& Francis},
abstract = {The wasteful consumption of freshwater in heavily populated coastal areas usually consist the basic reason for the intrusion of saltwater into the coastal aquifers. In order to avoid such catastrophic scenarios, their prediction is of utter significance. Underground water systems are highly complex and the water flow is extremely dynamic, thus making the prediction of this phenomenon a difficult task. For this reason, a two dimensional Cellular Automaton (CA) was designed enabling both the qualitative and quantitative simulation and illustration of the saltwater intrusion into an unconfined coastal aquifer. The presented results ensure the robustness of the proposed CA model taking full advantage of its inherent parallelism and local connectivity.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The wasteful consumption of freshwater in heavily populated coastal areas usually consist the basic reason for the intrusion of saltwater into the coastal aquifers. In order to avoid such catastrophic scenarios, their prediction is of utter significance. Underground water systems are highly complex and the water flow is extremely dynamic, thus making the prediction of this phenomenon a difficult task. For this reason, a two dimensional Cellular Automaton (CA) was designed enabling both the qualitative and quantitative simulation and illustration of the saltwater intrusion into an unconfined coastal aquifer. The presented results ensure the robustness of the proposed CA model taking full advantage of its inherent parallelism and local connectivity.
84.
Adamatzky A, Sirakoulis G Ch
Building exploration with leeches Hirudo verbana Journal Article
In: Biosystems, vol. 134, pp. 48–55, 2015.
@article{adamatzky2015building,
title = {Building exploration with leeches Hirudo verbana},
author = {Andrew Adamatzky and Georgios Ch. Sirakoulis},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0303264715000878},
doi = {doi.org/10.1016/j.biosystems.2015.06.004},
year = {2015},
date = {2015-07-03},
urldate = {2015-01-01},
journal = {Biosystems},
volume = {134},
pages = {48--55},
publisher = {Elsevier},
abstract = {Safe evacuation of people from building and outdoor environments, and search and rescue operations, always will remain actual in course of all socio-technological developments. Modern facilities offer a range of automated systems to guide residents towards emergency exists. The systems are assumed to be infallible. But what if they fail? How occupants not familiar with a building layout will be looking for exits in case of very limited visibility where tactile sensing is the only way to assess the environment? Analogous models of human behaviour, and socio-dynamics in general, are provided to be fruitful ways to explore alternative, or would-be scenarios. Crowd, or a single person, dynamics could be imitated using particle systems, reaction\textendashdiffusion chemical medium, electro-magnetic fields, or social insects. Each type of analogous model offer unique insights on behavioural patterns of natural systems in constrained geometries. In this particular paper we have chosen leeches to analyse patterns of exploration. Reasons are two-fold. First, when deprived from other stimuli leeches change their behavioural modes in an automated regime in response to mechanical stimulation. Therefore leeches can give us invaluable information on how human beings might behave under stress and limited visibility. Second, leeches are ideal blueprints of future soft-bodied rescue robots. Leeches have modular nervous circuitry with a rich behavioral spectrum. Leeches are multi-functional, fault-tolerant with autonomous inter-segment coordination and adaptive decision-making. We aim to answer the question: how efficiently a real building can be explored and whether there any dependencies on the pathways of exploration and geometrical complexity of the building. In our case studies we use templates made on the floor plan of real building.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Safe evacuation of people from building and outdoor environments, and search and rescue operations, always will remain actual in course of all socio-technological developments. Modern facilities offer a range of automated systems to guide residents towards emergency exists. The systems are assumed to be infallible. But what if they fail? How occupants not familiar with a building layout will be looking for exits in case of very limited visibility where tactile sensing is the only way to assess the environment? Analogous models of human behaviour, and socio-dynamics in general, are provided to be fruitful ways to explore alternative, or would-be scenarios. Crowd, or a single person, dynamics could be imitated using particle systems, reaction–diffusion chemical medium, electro-magnetic fields, or social insects. Each type of analogous model offer unique insights on behavioural patterns of natural systems in constrained geometries. In this particular paper we have chosen leeches to analyse patterns of exploration. Reasons are two-fold. First, when deprived from other stimuli leeches change their behavioural modes in an automated regime in response to mechanical stimulation. Therefore leeches can give us invaluable information on how human beings might behave under stress and limited visibility. Second, leeches are ideal blueprints of future soft-bodied rescue robots. Leeches have modular nervous circuitry with a rich behavioral spectrum. Leeches are multi-functional, fault-tolerant with autonomous inter-segment coordination and adaptive decision-making. We aim to answer the question: how efficiently a real building can be explored and whether there any dependencies on the pathways of exploration and geometrical complexity of the building. In our case studies we use templates made on the floor plan of real building.
83.
Giitsidis T, Dourvas N I, Sirakoulis G Ch
Parallel implementation of aircraft disembarking and emergency evacuation based on cellular automata Journal Article
In: The International Journal of High Performance Computing Applications, vol. 31, no. 2, pp. 134–151, 2015.
@article{giitsidis2017parallel,
title = {Parallel implementation of aircraft disembarking and emergency evacuation based on cellular automata},
author = {Themistoklis Giitsidis and Nikolaos I Dourvas and Georgios Ch. Sirakoulis},
url = {https://journals.sagepub.com/doi/full/10.1177/1094342015584533},
doi = {doi.org/10.1177/1094342015584533},
year = {2015},
date = {2015-06-15},
urldate = {2017-01-01},
journal = {The International Journal of High Performance Computing Applications},
volume = {31},
number = {2},
pages = {134--151},
publisher = {SAGE Publications Sage UK: London, England},
abstract = {In this paper we present a model based on the parallel computational tool of cellular automata (CA) capable of simulating the process of disembarking in a small airplane seat layout, corresponding to Airbus A320/ Boeing 737 layout, in search of ways to make it faster and safer under normal evacuation conditions, as well as emergency scenarios. The proposed model is highly customizable, with the number of exits, the walking speed of passengers, depending on their sex, age and height, and the effects of retrieving and carrying luggage. Additionally, the presence of obstacles in the aisles as well as the emergence of panic being parameters whose values can be varied in order to enlighten the disembarking and emergency evacuation processes are considered in detail. The simulation results were compared to existing aircraft disembarking and evacuation times and indicate the efficacy of the proposed model in investigating and revealing passenger attributes during these processes in all the examined cases. Moreover, we parallelized our code in order to run on a graphics processing unit (GPU) using the CUDA programming language, speeding up the simulation process. Finally, in order to present a fully dynamical anticipative real-time system helpful for decision-making we implemented the proposed CA model in a field programmable gate array (FPGA) device, and recreated the results given by the software simulations in a fraction of the time. We then compared and exported the performance results among a sequential software implementation, the implementation running on a GPU, and a hardware implementation, proving the consequent acceleration that results from the parallel CA implementation in specific hardware.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper we present a model based on the parallel computational tool of cellular automata (CA) capable of simulating the process of disembarking in a small airplane seat layout, corresponding to Airbus A320/ Boeing 737 layout, in search of ways to make it faster and safer under normal evacuation conditions, as well as emergency scenarios. The proposed model is highly customizable, with the number of exits, the walking speed of passengers, depending on their sex, age and height, and the effects of retrieving and carrying luggage. Additionally, the presence of obstacles in the aisles as well as the emergence of panic being parameters whose values can be varied in order to enlighten the disembarking and emergency evacuation processes are considered in detail. The simulation results were compared to existing aircraft disembarking and evacuation times and indicate the efficacy of the proposed model in investigating and revealing passenger attributes during these processes in all the examined cases. Moreover, we parallelized our code in order to run on a graphics processing unit (GPU) using the CUDA programming language, speeding up the simulation process. Finally, in order to present a fully dynamical anticipative real-time system helpful for decision-making we implemented the proposed CA model in a field programmable gate array (FPGA) device, and recreated the results given by the software simulations in a fraction of the time. We then compared and exported the performance results among a sequential software implementation, the implementation running on a GPU, and a hardware implementation, proving the consequent acceleration that results from the parallel CA implementation in specific hardware.
82.
Pouiklis G, Sirakoulis G Ch
Clock gating methodologies and tools: a survey Journal Article
In: International Journal of Circuit Theory and Applications, vol. 44, no. 4, pp. 798–816, 2015.
@article{pouiklis2016clock,
title = {Clock gating methodologies and tools: a survey},
author = {Georgios Pouiklis and Georgios Ch. Sirakoulis},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/cta.2107},
doi = {doi.org/10.1002/cta.2107},
year = {2015},
date = {2015-06-15},
urldate = {2016-01-01},
journal = {International Journal of Circuit Theory and Applications},
volume = {44},
number = {4},
pages = {798--816},
abstract = {Clock gating (CG) is a widely used design method for reducing the dynamic power consumption in digital circuits. Although it is a mature technique, theoretical work and tools for its application are still evolving and considered a matter of ongoing research, due to its significant effect in the overall power of the designs under study. This paper introduces a detailed review of the spectrum of CG approaches, theoretical and practical, from an architectural and register transfer level to synthesis, place and route, and testing issues. Furthermore, tools availability, limitations, and requirements concerning CG are examined for each design flow step. Conclusively, an evaluation of the presented techniques and literature is provided, estimating their usefulness and identifying areas for future research, exploration, and automation.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Clock gating (CG) is a widely used design method for reducing the dynamic power consumption in digital circuits. Although it is a mature technique, theoretical work and tools for its application are still evolving and considered a matter of ongoing research, due to its significant effect in the overall power of the designs under study. This paper introduces a detailed review of the spectrum of CG approaches, theoretical and practical, from an architectural and register transfer level to synthesis, place and route, and testing issues. Furthermore, tools availability, limitations, and requirements concerning CG are examined for each design flow step. Conclusively, an evaluation of the presented techniques and literature is provided, estimating their usefulness and identifying areas for future research, exploration, and automation.
81.
Tsompanas M I, Mayne R, Sirakoulis G Ch, Adamatzky A I
A Cellular Automata Bioinspired Algorithm Designing Data Trees in Wireless Sensor Networks Journal Article
In: International Journal of Distributed Sensor Networks, vol. 501, pp. 471045, 2015.
@article{tsompanas2015cellular,
title = {A Cellular Automata Bioinspired Algorithm Designing Data Trees in Wireless Sensor Networks},
author = {Michail-Antisthenis I Tsompanas and Richard Mayne and Georgios Ch. Sirakoulis and Andrew I Adamatzky},
url = {https://journals.sagepub.com/doi/full/10.1155/2015/471045},
doi = {doi.org/10.1155/2015/471045},
year = {2015},
date = {2015-06-07},
urldate = {2015-01-01},
journal = {International Journal of Distributed Sensor Networks},
volume = {501},
pages = {471045},
publisher = {Hindawi Publishing Corporation},
abstract = {Several studies present methods to economize energy in wireless sensor networks (WSNs) which is one of the most confining resources in these systems. This paper presents a bioinspired, cellular automata (CA) based model for constructing data trees that connect all nodes with a sink node. Nonetheless, the proposed model takes into consideration not only the proximity between two nodes but also their remaining available energy. Consequently, by avoiding nodes with nearly depleted energy sources, the life time of the network can be prolonged. The plasmodium of Physarum polycephalum is the inspiration for the proposed model, as it has proved its robustness in graphically expressed problems. Moreover, CAs are able to encapsulate the parallel dynamics of the model and, thus, achieve a very fast execution.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Several studies present methods to economize energy in wireless sensor networks (WSNs) which is one of the most confining resources in these systems. This paper presents a bioinspired, cellular automata (CA) based model for constructing data trees that connect all nodes with a sink node. Nonetheless, the proposed model takes into consideration not only the proximity between two nodes but also their remaining available energy. Consequently, by avoiding nodes with nearly depleted energy sources, the life time of the network can be prolonged. The plasmodium of Physarum polycephalum is the inspiration for the proposed model, as it has proved its robustness in graphically expressed problems. Moreover, CAs are able to encapsulate the parallel dynamics of the model and, thus, achieve a very fast execution.
80.
Zhang X, Adamatzky A, Chan F T, Deng Y, Yang H, Yang X, Tsompanas M I, Sirakoulis G Ch, Mahadevan S
A biologically inspired network design model Journal Article
In: Scientific reports, vol. 5, pp. 10794, 2015.
@article{zhang2015biologically,
title = {A biologically inspired network design model},
author = {Xiaoge Zhang and Andrew Adamatzky and Felix TS Chan and Yong Deng and Hai Yang and Xin-She Yang and Michail-Antisthenis I Tsompanas and Georgios Ch. Sirakoulis and Sankaran Mahadevan},
url = {https://www.nature.com/articles/srep10794},
doi = {doi.org/10.1038/srep10794},
year = {2015},
date = {2015-06-04},
urldate = {2015-01-01},
journal = {Scientific reports},
volume = {5},
pages = {10794},
publisher = {Nature Publishing Group},
abstract = {A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach.
79.
Bitsakidis N P, Chatzichristofis S A, Sirakoulis G Ch
Hybrid Cellular Ants for Clustering Problems. Journal Article
In: International Journal of Unconventional Computing, vol. 11, no. 2, 2015.
@article{bitsakidis2015hybrid,
title = {Hybrid Cellular Ants for Clustering Problems.},
author = {Nikolaos P Bitsakidis and Savvas A Chatzichristofis and Georgios Ch. Sirakoulis},
url = {https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-11-number-2-2015/ijuc-11-2-p-103-130/},
year = {2015},
date = {2015-06-01},
urldate = {2015-06-01},
journal = {International Journal of Unconventional Computing},
volume = {11},
number = {2},
abstract = {In the last decade the amount of the stored data related to almost all areas of life has rapidly increased. However, the overall process of discovering knowledge from data demands more powerful clustering techniques to ensure that this knowledge is useful. In this paper, two nature inspired computation techniques, Cellular Automata (CA) and Ant Colonies are combined by taking advantage of their common prominent features, such as simplicity, locality and self organization. Inspired by the cellular ants algorithm of Vande Moere and Clayden which has designed for clustering purposes, a corresponding cellular ants model was developed in order to overcome some of the previous model limitations and to provide new insights in cellular ants based clustering. The presented simulation results prove the clustering efficiency of the proposed model in both qualitative and quantitative terms.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In the last decade the amount of the stored data related to almost all areas of life has rapidly increased. However, the overall process of discovering knowledge from data demands more powerful clustering techniques to ensure that this knowledge is useful. In this paper, two nature inspired computation techniques, Cellular Automata (CA) and Ant Colonies are combined by taking advantage of their common prominent features, such as simplicity, locality and self organization. Inspired by the cellular ants algorithm of Vande Moere and Clayden which has designed for clustering purposes, a corresponding cellular ants model was developed in order to overcome some of the previous model limitations and to provide new insights in cellular ants based clustering. The presented simulation results prove the clustering efficiency of the proposed model in both qualitative and quantitative terms.
78.
Mayne R, Tsompanas M, Sirakoulis G Ch, Adamatzky A
Towards a slime Mould-FPGA interface Journal Article
In: Biomedical Engineering Letters, vol. 5, no. 1, pp. 51–57, 2015.
@article{mayne2015towards,
title = {Towards a slime Mould-FPGA interface},
author = {Richard Mayne and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://link.springer.com/article/10.1007%2Fs13534-015-0173-3},
doi = {doi.org/10.1007/s13534-015-0173-3},
year = {2015},
date = {2015-04-12},
urldate = {2015-01-01},
journal = {Biomedical Engineering Letters},
volume = {5},
number = {1},
pages = {51--57},
publisher = {The Korean Society of Medical and Biological Engineering},
abstract = {Purpose
The plasmodium of slime mould
Physarum polycephalum
is a multinucleate single celled organism which behaves as a living amorphous unconventional computing substrate. As an excitable, memristive cell that typically assumes a branching or stellate morphology, slime mould is a unique model organism that shares many key properties of mammalian neurons. There are numerous studies that reveal the computing abilities of the plasmodium realized by the formation of tubular networks connecting points of interest. Recent research demonstrating typical responses in electrical behaviour of the plasmodium to certain chemical and physical stimuli has generated interest in creating an interface between
P. polycephalum
and digital logic, with the aim to perform computational tasks with the resulting device.
Methods
Through a range of laboratory experiments, wemeasure plasmodial membrane potential via a non-invasive method and use this signal to interface the organism with a digital system.
Results
This digital system was demonstrated to perform predefined basic arithmetic operations and is implemented in a field-programmable gate array (FPGA). These basic arithmetic operations, i.e. counting, addition, multiplying, use data that were derived by digital recognition of membrane potential oscillation and are used here to make basic hybrid biologicalartificial sensing devices.
Conclusions
We present here a low-cost, energy efficient and highly adaptable platform for developing next-generation machine-organism interfaces. These results are therefore applicable to a wide range of biological/medical and computing/electronics fields.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Purpose
The plasmodium of slime mould
Physarum polycephalum
is a multinucleate single celled organism which behaves as a living amorphous unconventional computing substrate. As an excitable, memristive cell that typically assumes a branching or stellate morphology, slime mould is a unique model organism that shares many key properties of mammalian neurons. There are numerous studies that reveal the computing abilities of the plasmodium realized by the formation of tubular networks connecting points of interest. Recent research demonstrating typical responses in electrical behaviour of the plasmodium to certain chemical and physical stimuli has generated interest in creating an interface between
P. polycephalum
and digital logic, with the aim to perform computational tasks with the resulting device.
Methods
Through a range of laboratory experiments, wemeasure plasmodial membrane potential via a non-invasive method and use this signal to interface the organism with a digital system.
Results
This digital system was demonstrated to perform predefined basic arithmetic operations and is implemented in a field-programmable gate array (FPGA). These basic arithmetic operations, i.e. counting, addition, multiplying, use data that were derived by digital recognition of membrane potential oscillation and are used here to make basic hybrid biologicalartificial sensing devices.
Conclusions
We present here a low-cost, energy efficient and highly adaptable platform for developing next-generation machine-organism interfaces. These results are therefore applicable to a wide range of biological/medical and computing/electronics fields.
The plasmodium of slime mould
Physarum polycephalum
is a multinucleate single celled organism which behaves as a living amorphous unconventional computing substrate. As an excitable, memristive cell that typically assumes a branching or stellate morphology, slime mould is a unique model organism that shares many key properties of mammalian neurons. There are numerous studies that reveal the computing abilities of the plasmodium realized by the formation of tubular networks connecting points of interest. Recent research demonstrating typical responses in electrical behaviour of the plasmodium to certain chemical and physical stimuli has generated interest in creating an interface between
P. polycephalum
and digital logic, with the aim to perform computational tasks with the resulting device.
Methods
Through a range of laboratory experiments, wemeasure plasmodial membrane potential via a non-invasive method and use this signal to interface the organism with a digital system.
Results
This digital system was demonstrated to perform predefined basic arithmetic operations and is implemented in a field-programmable gate array (FPGA). These basic arithmetic operations, i.e. counting, addition, multiplying, use data that were derived by digital recognition of membrane potential oscillation and are used here to make basic hybrid biologicalartificial sensing devices.
Conclusions
We present here a low-cost, energy efficient and highly adaptable platform for developing next-generation machine-organism interfaces. These results are therefore applicable to a wide range of biological/medical and computing/electronics fields.
77.
Vourkas I, Stathis D, Sirakoulis G Ch
Massively parallel analog computing: Ariadne’s thread was made of memristors Journal Article
In: IEEE Transactions on Emerging Topics in Computing, vol. 6, no. 1, pp. 145–155, 2015.
@article{vourkas2018massively,
title = {Massively parallel analog computing: Ariadne’s thread was made of memristors},
author = {Ioannis Vourkas and Dimitrios Stathis and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/7080907},
doi = {10.1109/TETC.2015.2420353},
year = {2015},
date = {2015-04-06},
urldate = {2018-01-01},
journal = {IEEE Transactions on Emerging Topics in Computing},
volume = {6},
number = {1},
pages = {145--155},
publisher = {IEEE},
abstract = {This paper explores memristive grids where emergent computation arises through collective device interactions. Computing efficiency of the grids is studied in several scenarios and new composite memristive structures are utilized in shortest path and maze-solving computations. The dependence of the computing medium behavior on the symmetry of both the underlying geometry and the employed devices, is validated through SPICE-level circuit simulations, which highlight important computing inefficiencies. Particular circuit-models of memristive connections enable precise mapping of the target application on the computing medium. Extraordinary functionalities emerge when novel memristive computing components, comprising different electrical characteristics from their structural elements, are introduced in the grid. Applying assisted-computation, by incorporating the concept of Ariadne's thread, leaded to better computing results, which could find application in routing and path computing problems.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper explores memristive grids where emergent computation arises through collective device interactions. Computing efficiency of the grids is studied in several scenarios and new composite memristive structures are utilized in shortest path and maze-solving computations. The dependence of the computing medium behavior on the symmetry of both the underlying geometry and the employed devices, is validated through SPICE-level circuit simulations, which highlight important computing inefficiencies. Particular circuit-models of memristive connections enable precise mapping of the target application on the computing medium. Extraordinary functionalities emerge when novel memristive computing components, comprising different electrical characteristics from their structural elements, are introduced in the grid. Applying assisted-computation, by incorporating the concept of Ariadne's thread, leaded to better computing results, which could find application in routing and path computing problems.
76.
Dourvas N, Tsompanas M, Sirakoulis G Ch, Tsalides P
Hardware acceleration of cellular automata Physarum polycephalum model Journal Article
In: Parallel Processing Letters, vol. 25, no. 01, pp. 1540006, 2015.
@article{dourvas2015hardware,
title = {Hardware acceleration of cellular automata Physarum polycephalum model},
author = {Nikolaos Dourvas and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis and Philippos Tsalides},
url = {https://www.worldscientific.com/doi/abs/10.1142/S012962641540006X},
doi = {doi.org/10.1142/S012962641540006X},
year = {2015},
date = {2015-03-31},
urldate = {2015-01-01},
journal = {Parallel Processing Letters},
volume = {25},
number = {01},
pages = {1540006},
publisher = {World Scientific Publishing Company},
abstract = {During the past decades, computer science experts were inspired from the study of biological organisms. Moreover, bio-inspired algorithms were produced that many times can give excellent solutions with low computational cost in complex engineering problems. In our case, the plasmodium of Physarum polycephalum is capable of finding the shortest path solution between two points in a labyrinth. In this study, we implement a Cellular Automata (CA) model in hardware, which attempts to describe and, moreover, mimic the behavior of the plasmodium in a maze. Beyond the successful implementation of the CA-based Physarum model in software, in order to take full advantage of the inherent parallelism of CA, we focus on a Field Programmable Gate Array (FPGA) implementation of the proposed model. Namely, two different implementations were considered here. Their difference is on the desired precision produced by the numerical representation of CA model parameters. Based on the corresponding results of the shortest path in the labyrinth,the modeling efficiency of both approaches was compared depending on the resulting error propagation. The presented FPGA implementations succeed to take advantage of the CA's inherit parallelism and improve the performance of the CA algorithm when compared with software in terms of computational speed and power consumption. As a result, the implementations presented here, can also be considered as a preliminary CA-based Physarum polycephalum IP core which produces a biological inspired solution to the shortest-path problem.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
During the past decades, computer science experts were inspired from the study of biological organisms. Moreover, bio-inspired algorithms were produced that many times can give excellent solutions with low computational cost in complex engineering problems. In our case, the plasmodium of Physarum polycephalum is capable of finding the shortest path solution between two points in a labyrinth. In this study, we implement a Cellular Automata (CA) model in hardware, which attempts to describe and, moreover, mimic the behavior of the plasmodium in a maze. Beyond the successful implementation of the CA-based Physarum model in software, in order to take full advantage of the inherent parallelism of CA, we focus on a Field Programmable Gate Array (FPGA) implementation of the proposed model. Namely, two different implementations were considered here. Their difference is on the desired precision produced by the numerical representation of CA model parameters. Based on the corresponding results of the shortest path in the labyrinth,the modeling efficiency of both approaches was compared depending on the resulting error propagation. The presented FPGA implementations succeed to take advantage of the CA's inherit parallelism and improve the performance of the CA algorithm when compared with software in terms of computational speed and power consumption. As a result, the implementations presented here, can also be considered as a preliminary CA-based Physarum polycephalum IP core which produces a biological inspired solution to the shortest-path problem.
75.
Kalogeiton V S, Papadopoulos D P, Georgilas I P, Sirakoulis G Ch, Adamatzky A I
Cellular automaton model of crowd evacuation inspired by slime mould Journal Article
In: International Journal of General Systems, vol. 44, no. 3, pp. 354–391, 2015.
@article{kalogeiton2015cellular,
title = {Cellular automaton model of crowd evacuation inspired by slime mould},
author = {Vicky S Kalogeiton and Dim P Papadopoulos and Ioannis P Georgilas and Georgios Ch. Sirakoulis and Andrew I Adamatzky},
url = {https://www.tandfonline.com/doi/full/10.1080/03081079.2014.997527},
doi = {doi.org/10.1080/03081079.2014.997527},
year = {2015},
date = {2015-03-12},
urldate = {2015-01-01},
journal = {International Journal of General Systems},
volume = {44},
number = {3},
pages = {354--391},
publisher = {Taylor \& Francis},
abstract = {In all the living organisms, the self-preservation behaviour is almost universal. Even the most simple of living organisms, like slime mould, is typically under intense selective pressure to evolve a response to ensure their evolution and safety in the best possible way. On the other hand, evacuation of a place can be easily characterized as one of the most stressful situations for the individuals taking part on it. Taking inspiration from the slime mould behaviour, we are introducing a computational bio-inspired model crowd evacuation model. Cellular Automata (CA) were selected as a fully parallel advanced computation tool able to mimic the Physarum’s behaviour. In particular, the proposed CA model takes into account while mimicking the Physarum foraging process, the food diffusion, the organism’s growth, the creation of tubes for each organism, the selection of optimum tube for each human in correspondence to the crowd evacuation under study and finally, the movement of all humans at each time step towards near exit. To test the model’s efficiency and robustness, several simulation scenarios were proposed both in virtual and real-life indoor environments (namely, the first floor of office building B of the Department of Electrical and Computer Engineering of Democritus University of Thrace). The proposed model is further evaluated in a purely quantitative way by comparing the simulation results with the corresponding ones from the bibliography taken by real data. The examined fundamental diagrams of velocity\textendashdensity and flow\textendashdensity are found in full agreement with many of the already published corresponding results proving the adequacy, the fitness and the resulting dynamics of the model. Finally, several real Physarum experiments were conducted in an archetype of the aforementioned real-life environment proving at last that the proposed model succeeded in reproducing sufficiently the Physarum’s recorded behaviour derived from observation of the aforementioned biological laboratory experiments.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In all the living organisms, the self-preservation behaviour is almost universal. Even the most simple of living organisms, like slime mould, is typically under intense selective pressure to evolve a response to ensure their evolution and safety in the best possible way. On the other hand, evacuation of a place can be easily characterized as one of the most stressful situations for the individuals taking part on it. Taking inspiration from the slime mould behaviour, we are introducing a computational bio-inspired model crowd evacuation model. Cellular Automata (CA) were selected as a fully parallel advanced computation tool able to mimic the Physarum’s behaviour. In particular, the proposed CA model takes into account while mimicking the Physarum foraging process, the food diffusion, the organism’s growth, the creation of tubes for each organism, the selection of optimum tube for each human in correspondence to the crowd evacuation under study and finally, the movement of all humans at each time step towards near exit. To test the model’s efficiency and robustness, several simulation scenarios were proposed both in virtual and real-life indoor environments (namely, the first floor of office building B of the Department of Electrical and Computer Engineering of Democritus University of Thrace). The proposed model is further evaluated in a purely quantitative way by comparing the simulation results with the corresponding ones from the bibliography taken by real data. The examined fundamental diagrams of velocity–density and flow–density are found in full agreement with many of the already published corresponding results proving the adequacy, the fitness and the resulting dynamics of the model. Finally, several real Physarum experiments were conducted in an archetype of the aforementioned real-life environment proving at last that the proposed model succeeded in reproducing sufficiently the Physarum’s recorded behaviour derived from observation of the aforementioned biological laboratory experiments.
74.
Evangelidis V, Tsompanas M, Sirakoulis G Ch, Adamatzky A
Slime mould imitates development of Roman roads in the Balkans Journal Article
In: Journal of Archaeological Science: Reports, vol. 2, pp. 264–281, 2015.
@article{evangelidis2015slime,
title = {Slime mould imitates development of Roman roads in the Balkans},
author = {Vasilis Evangelidis and Michail-Antisthenis Tsompanas and Georgios Ch. Sirakoulis and Andrew Adamatzky},
url = {https://www.sciencedirect.com/science/article/pii/S2352409X1500019X?via%3Dihub},
doi = {doi.org/10.1016/j.jasrep.2015.02.005},
year = {2015},
date = {2015-02-18},
urldate = {2015-02-18},
journal = {Journal of Archaeological Science: Reports},
volume = {2},
pages = {264--281},
publisher = {Elsevier},
abstract = {Due to its unexpected computing abilities, Physarum polycephalum, a vegetative stage of acellular slime, has been repeatedly used during the last decade in order to reproduce transport networks. After conducting a series of biological experiments and with the help of a Cellular Automata (CA) model we try to explore the ability of the slime in order to imitate the Roman road network in the Balkans, an area which was of great strategic importance for the stability of the Roman Empire in the East. The application of Physarum machines hopes to offer a first step towards a new interdisciplinary, almost unconventional, approach to archaeology.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Due to its unexpected computing abilities, Physarum polycephalum, a vegetative stage of acellular slime, has been repeatedly used during the last decade in order to reproduce transport networks. After conducting a series of biological experiments and with the help of a Cellular Automata (CA) model we try to explore the ability of the slime in order to imitate the Roman road network in the Balkans, an area which was of great strategic importance for the stability of the Roman Empire in the East. The application of Physarum machines hopes to offer a first step towards a new interdisciplinary, almost unconventional, approach to archaeology.
73.
Vourkas I, Stathis D, Sirakoulis G Ch, Hamdioui S
Alternative architectures toward reliable memristive crossbar memories Journal Article
In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 24, no. 1, pp. 206–217, 2015.
@article{vourkas2016alternative,
title = {Alternative architectures toward reliable memristive crossbar memories},
author = {Ioannis Vourkas and Dimitrios Stathis and Georgios Ch. Sirakoulis and Said Hamdioui},
url = {https://ieeexplore.ieee.org/document/7024182},
doi = {10.1109/TVLSI.2015.2388587},
year = {2015},
date = {2015-01-27},
urldate = {2016-01-01},
journal = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
volume = {24},
number = {1},
pages = {206--217},
publisher = {IEEE},
abstract = {Resistive random access memory (ReRAM), referred to as memristor, is an emerging memory technology to potentially replace conventional memories, which will soon be facing serious design challenges related to continued scaling. Memristor-based crossbar architecture has been shown to be the best implementation for ReRAM. However, it faces a major challenge related to the sneak current (current sneak paths) flowing through unselected memory cells, which significantly reduces the voltage read margins. In this paper, five alternative architectures (topologies) are applied to minimize the impact of sneak current; the architectures are based on the introduction of insulating junctions within the crossbar. Simulations that were performed while considering different memory accessing aspects, such as bit reading versus word reading, stored data background distribution, crossbar dimensions, etc., showed that read margins can be increased significantly (up to 4×) as compared with standard crossbar architectures. In addition, the proposed architectures eliminate the requirement for extra select devices at each cross point and have no operational complexity overhead.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Resistive random access memory (ReRAM), referred to as memristor, is an emerging memory technology to potentially replace conventional memories, which will soon be facing serious design challenges related to continued scaling. Memristor-based crossbar architecture has been shown to be the best implementation for ReRAM. However, it faces a major challenge related to the sneak current (current sneak paths) flowing through unselected memory cells, which significantly reduces the voltage read margins. In this paper, five alternative architectures (topologies) are applied to minimize the impact of sneak current; the architectures are based on the introduction of insulating junctions within the crossbar. Simulations that were performed while considering different memory accessing aspects, such as bit reading versus word reading, stored data background distribution, crossbar dimensions, etc., showed that read margins can be increased significantly (up to 4×) as compared with standard crossbar architectures. In addition, the proposed architectures eliminate the requirement for extra select devices at each cross point and have no operational complexity overhead.
72.
Tsiftsis A, Georgoudas I G, Sirakoulis G Ch
Real data evaluation of a crowd supervising system for stadium evacuation and its hardware implementation Journal Article
In: IEEE Systems Journal, vol. 10, no. 2, pp. 649–660, 2015.
@article{tsiftsis2016real,
title = {Real data evaluation of a crowd supervising system for stadium evacuation and its hardware implementation},
author = {Anastasios Tsiftsis and Ioakeim G Georgoudas and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/7005403},
doi = {10.1109/JSYST.2014.2370455},
year = {2015},
date = {2015-01-09},
urldate = {2015-01-09},
journal = {IEEE Systems Journal},
volume = {10},
number = {2},
pages = {649--660},
publisher = {IEEE},
abstract = {The aim of this paper is to develop an integrated electronic system that allows the dynamical management of congestion and provides the fast evaluation of dynamical circumstances. Thus, a cellular-automata-based model is proposed that estimates the movement of individuals. The presented system incorporates a process that allows the efficient camera-based initialization of the model, without any special prerequirements. The efficiency of the model has been thoroughly validated. Specifically, simulation-derived diagrams that depict the relationship of flow and speed of people as a function of crowd density have been compared with corresponding diagrams from the literature. Furthermore, the system has been evaluated with the use of real data. In particular, simulation results have been compared with real video recordings that depict the crowd evacuation process from a football stadium. Results prove that the proposed management system can estimate fast possible routes of people for the very near future, evaluating all possible exit alternatives. Finally, the proposed model has been implemented in hardware with a field-programmable gate array, enabling its incorporation into an integrated electronic system that estimates crowd movement and prevents congestion in exits almost in real time. The proposed electronic system is advantageous in terms of easy incorporation and portability as well as performance when compared with its analogous graphical-processing-unit implementation.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The aim of this paper is to develop an integrated electronic system that allows the dynamical management of congestion and provides the fast evaluation of dynamical circumstances. Thus, a cellular-automata-based model is proposed that estimates the movement of individuals. The presented system incorporates a process that allows the efficient camera-based initialization of the model, without any special prerequirements. The efficiency of the model has been thoroughly validated. Specifically, simulation-derived diagrams that depict the relationship of flow and speed of people as a function of crowd density have been compared with corresponding diagrams from the literature. Furthermore, the system has been evaluated with the use of real data. In particular, simulation results have been compared with real video recordings that depict the crowd evacuation process from a football stadium. Results prove that the proposed management system can estimate fast possible routes of people for the very near future, evaluating all possible exit alternatives. Finally, the proposed model has been implemented in hardware with a field-programmable gate array, enabling its incorporation into an integrated electronic system that estimates crowd movement and prevents congestion in exits almost in real time. The proposed electronic system is advantageous in terms of easy incorporation and portability as well as performance when compared with its analogous graphical-processing-unit implementation.
71.
Arabnia H R, D'Alotto L, Ishii H, Ito M, Joe K, Nishikawa H, Sirakoulis G, Spataro W, Trunfio G A, Gravvanis G A, others
Parallel and Distributed Processing Techniques and Applications Journal Article
In: 2015.
@article{arabnia2015parallel,
title = {Parallel and Distributed Processing Techniques and Applications},
author = {Hamid R Arabnia and Lou D'Alotto and Hiroshi Ishii and Minoru Ito and Kazuki Joe and Hiroaki Nishikawa and Georgios Sirakoulis and William Spataro and Giuseppe A Trunfio and George A Gravvanis and others},
year = {2015},
date = {2015-01-01},
publisher = {CSREA Press},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
70.
Vourkas I, Sirakoulis G Ch
Employing threshold-based behavior and network dynamics for the creation of memristive logic circuits and architectures Journal Article
In: Physica Status Solidi (c), vol. 12, no. 1-2, pp. 168–174, 2014.
@article{vourkas2015employing,
title = {Employing threshold-based behavior and network dynamics for the creation of memristive logic circuits and architectures},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://onlinelibrary.wiley.com/doi/10.1002/pssc.201400161},
doi = {doi.org/10.1002/pssc.201400161},
year = {2014},
date = {2014-11-20},
urldate = {2015-01-01},
journal = {Physica Status Solidi (c)},
volume = {12},
number = {1-2},
pages = {168--174},
publisher = {WILEY-VCH Verlag},
abstract = {Memristors demonstrate a natural basis for computation that is different from familiar paradigms. Innovative computational architectures and methods that exploit the unique features of memristors have been developed recently. However, most concepts require new circuit design methodologies and operational principles in order to synthesize Boolean logic functions. Therefore, up to now it is not clear what kind of computing architectures would in practice benefit the most from the computing capability offered by memristors. Analysis of the dynamic behavior of network architectures based on memristors has gained considerable attention lately. In this context, this work focuses on the creation of logic circuits by employing the collective dynamics of assembles of reciprocal memristors. A novel circuit design methodology is discussed where the computing systems comprise active CMOS circuitry interfaced with passive memristors, working under already known logic circuit design principles from the CMOS VLSI technology. The accuracy and completeness of this straightforward methodology is demonstrated through SPICE simulations which are based on a device model for memristors that exhibits threshold-based behavior; thus its response is closer to that of most experimental memristor realizations. This work contributes to the creation of relevant tools and proper methodologies which will enable the development of efficient design flows for circuits and architectures comprising memristors.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Memristors demonstrate a natural basis for computation that is different from familiar paradigms. Innovative computational architectures and methods that exploit the unique features of memristors have been developed recently. However, most concepts require new circuit design methodologies and operational principles in order to synthesize Boolean logic functions. Therefore, up to now it is not clear what kind of computing architectures would in practice benefit the most from the computing capability offered by memristors. Analysis of the dynamic behavior of network architectures based on memristors has gained considerable attention lately. In this context, this work focuses on the creation of logic circuits by employing the collective dynamics of assembles of reciprocal memristors. A novel circuit design methodology is discussed where the computing systems comprise active CMOS circuitry interfaced with passive memristors, working under already known logic circuit design principles from the CMOS VLSI technology. The accuracy and completeness of this straightforward methodology is demonstrated through SPICE simulations which are based on a device model for memristors that exhibits threshold-based behavior; thus its response is closer to that of most experimental memristor realizations. This work contributes to the creation of relevant tools and proper methodologies which will enable the development of efficient design flows for circuits and architectures comprising memristors.
69.
Mardiris V A, Sirakoulis G Ch, Karafyllidis I G
Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata Journal Article
In: IEEE Transactions on Computers, vol. 64, no. 9, pp. 2476–2489, 2014.
@article{mardiris2015automated,
title = {Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata},
author = {Vassilios A Mardiris and Georgios Ch. Sirakoulis and Ioannis G Karafyllidis},
url = {https://ieeexplore.ieee.org/document/6945867},
doi = {10.1109/TC.2014.2366745},
year = {2014},
date = {2014-11-04},
urldate = {2015-01-01},
journal = {IEEE Transactions on Computers},
volume = {64},
number = {9},
pages = {2476--2489},
publisher = {IEEE},
abstract = {Cellular automata (CAs) have been widely used to model and simulate physical systems and processes. CAs have also been successfully used as a VLSI architecture that proved to be very efficient at least in terms of silicon-area utilization and clock-speed maximization. Quantum cellular automata (QCAs) as one of the promising emerging technologies for nanoscale and quantum computing circuit implementation, provides very high scale integration, very high switching frequency and extremely low power characteristics. In this paper we present a new automated design architecture and a tool, namely DATICAQ (Design Automation Tool of 1-D CAs using QCAs), that builds a bridge between 1-D CAs as models of physical systems and processes and 1-D QCAs as nanoelectronic architecture. The QCA implementation of CAs not only drives the already developed CAs circuits to the nanoelectronics era but improves their performance significantly. The inputs of the proposed architecture are CA dimensionality, size, local rule, and initial and boundary conditions imposed by the particular problem. DATICAQ produces as output the layout of the QCA implementation of the particular 1-D CA model. Simulations of CA models for zero and periodic boundary conditions and the corresponding QCA circuits showed that the CA models have been successfully implemented.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Cellular automata (CAs) have been widely used to model and simulate physical systems and processes. CAs have also been successfully used as a VLSI architecture that proved to be very efficient at least in terms of silicon-area utilization and clock-speed maximization. Quantum cellular automata (QCAs) as one of the promising emerging technologies for nanoscale and quantum computing circuit implementation, provides very high scale integration, very high switching frequency and extremely low power characteristics. In this paper we present a new automated design architecture and a tool, namely DATICAQ (Design Automation Tool of 1-D CAs using QCAs), that builds a bridge between 1-D CAs as models of physical systems and processes and 1-D QCAs as nanoelectronic architecture. The QCA implementation of CAs not only drives the already developed CAs circuits to the nanoelectronics era but improves their performance significantly. The inputs of the proposed architecture are CA dimensionality, size, local rule, and initial and boundary conditions imposed by the particular problem. DATICAQ produces as output the layout of the QCA implementation of the particular 1-D CA model. Simulations of CA models for zero and periodic boundary conditions and the corresponding QCA circuits showed that the CA models have been successfully implemented.
68.
Vourkas I, Stathis D, Sirakoulis G Ch
Memristor-based parallel sorting approach using one-dimensional cellular automata Journal Article
In: Electronics Letters IET, vol. 50, no. 24, pp. 1819–1821, 2014.
@article{vourkas2014memristorb,
title = {Memristor-based parallel sorting approach using one-dimensional cellular automata},
author = {Ioannis Vourkas and Dimitrios Stathis and Georgios Ch. Sirakoulis},
url = {https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/el.2014.2912},
doi = {doi.org/10.1049/el.2014.2912},
year = {2014},
date = {2014-11-01},
urldate = {2014-01-01},
journal = {Electronics Letters IET},
volume = {50},
number = {24},
pages = {1819--1821},
publisher = {IET Digital Library},
abstract = {A novel memristor-based circuit-level cellular automata (CA)-inspired approach to the solution of the classic sorting problem of n Keys in a linear array is presented. The presented system utilises the structural simplicity of CA combined with the threshold-type switching behaviour of memristors and composite memristive components; the latter is used for both information encoding and computation. The focus is on a threshold-type model for memristors for the implementation of the fundamental CA cell and the overall CA operation is verified via simulations.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
A novel memristor-based circuit-level cellular automata (CA)-inspired approach to the solution of the classic sorting problem of n Keys in a linear array is presented. The presented system utilises the structural simplicity of CA combined with the threshold-type switching behaviour of memristors and composite memristive components; the latter is used for both information encoding and computation. The focus is on a threshold-type model for memristors for the implementation of the fundamental CA cell and the overall CA operation is verified via simulations.
67.
Tsompanas M I, Sirakoulis G Ch, Adamatzky A I
Physarum in silicon: the Greek motorways study Journal Article
In: Natural Computing, vol. 15, no. 2, pp. 279–295, 2014.
@article{tsompanas2016physarum,
title = {Physarum in silicon: the Greek motorways study},
author = {Michail-Antisthenis I Tsompanas and Georgios Ch. Sirakoulis and Andrew I Adamatzky},
url = {https://link.springer.com/article/10.1007/s11047-014-9459-0},
doi = {doi.org/10.1007/s11047-014-9459-0},
year = {2014},
date = {2014-10-07},
urldate = {2016-01-01},
journal = {Natural Computing},
volume = {15},
number = {2},
pages = {279--295},
publisher = {Springer Netherlands},
abstract = {Physarum polycephalum has repeatedly, during the last decade, demonstrated that has unexpected computing abilities. While the plasmodium of P. polycephalum can effectively solve several geographical described problems, like evaluating human\textendashmade transport networks, a disadvantage of a biological computer, like the aforementioned is directly apparent; the great amount of time needed to provide results. Thus, the main focus of this paper is the enhancement of the time efficiency of the biological computer by using conventional computers or even digital circuitry. Cellular automata (CA) as a powerful computational tool has been selected to tackle with these difficulties and a software (Matlab) CA model is used to produce results in shorter time periods. While the duration of a laboratory experiment is occasionally from 3 to 5 days, the CA model, for a specific configuration, needs around 40 s. In order to achieve a further acceleration of the computation, a hardware implementation of the corresponding CA software based model is proposed here, taking full advantage of the CA inherent parallelism, uniformity and the locality of interconnections. Consequently, the digital circuit designed can be used as a massively parallel nature inspired computer for real\textendashtime applications. The hardware implementation of the model needs six orders of magnitude less time than the software representation. In this paper, in order to develop a proof of concept and depict the applicability of the proposed hardware oriented CA approach, the topology of Greece is used as an input of the biological computer. The network formed by the in vitro experiments, along with the one designed by the CA model and implemented in hardware are compared with the real motorways and the proximity graphs of the topology.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Physarum polycephalum has repeatedly, during the last decade, demonstrated that has unexpected computing abilities. While the plasmodium of P. polycephalum can effectively solve several geographical described problems, like evaluating human–made transport networks, a disadvantage of a biological computer, like the aforementioned is directly apparent; the great amount of time needed to provide results. Thus, the main focus of this paper is the enhancement of the time efficiency of the biological computer by using conventional computers or even digital circuitry. Cellular automata (CA) as a powerful computational tool has been selected to tackle with these difficulties and a software (Matlab) CA model is used to produce results in shorter time periods. While the duration of a laboratory experiment is occasionally from 3 to 5 days, the CA model, for a specific configuration, needs around 40 s. In order to achieve a further acceleration of the computation, a hardware implementation of the corresponding CA software based model is proposed here, taking full advantage of the CA inherent parallelism, uniformity and the locality of interconnections. Consequently, the digital circuit designed can be used as a massively parallel nature inspired computer for real–time applications. The hardware implementation of the model needs six orders of magnitude less time than the software representation. In this paper, in order to develop a proof of concept and depict the applicability of the proposed hardware oriented CA approach, the topology of Greece is used as an input of the biological computer. The network formed by the in vitro experiments, along with the one designed by the CA model and implemented in hardware are compared with the real motorways and the proximity graphs of the topology.
66.
Papandroulidakis G, Vourkas I, Vasileiadis N, Sirakoulis G Ch
Boolean Logic Operations and Computing Circuits Based on Memristors Journal Article
In: IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 61, no. 12, pp. 972–975, 2014.
@article{papandroulidakis2014boolean,
title = {Boolean Logic Operations and Computing Circuits Based on Memristors},
author = {Georgios Papandroulidakis and Ioannis Vourkas and Nikolaos Vasileiadis and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/6895305},
doi = {10.1109/TCSII.2014.2357351},
year = {2014},
date = {2014-09-11},
urldate = {2014-01-01},
journal = {IEEE Transactions on Circuits and Systems II: Express Briefs},
volume = {61},
number = {12},
pages = {972--975},
publisher = {IEEE},
abstract = {This brief contributes to the design of computational and reconfigurable structures that exploit unique threshold-dependent switching response of single memristors and their compositions. A new logic circuit design paradigm, which assumes parallel processing of input signals, is proposed, along with a methodology for the construction of robust programmable composite memristive switches of variable precision. This methodology is applied to the design of memristive computing circuits. A SPICE simulation-based validation of the proposed circuits and systems is provided.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This brief contributes to the design of computational and reconfigurable structures that exploit unique threshold-dependent switching response of single memristors and their compositions. A new logic circuit design paradigm, which assumes parallel processing of input signals, is proposed, along with a methodology for the construction of robust programmable composite memristive switches of variable precision. This methodology is applied to the design of memristive computing circuits. A SPICE simulation-based validation of the proposed circuits and systems is provided.
65.
Vourkas I, Sirakoulis G Ch
On the generalization of composite memristive network structures for computational analog/digital circuits and systems Journal Article
In: Microelectronics Journal, vol. 45, no. 11, pp. 1380–1391, 2014.
@article{vourkas2014generalization,
title = {On the generalization of composite memristive network structures for computational analog/digital circuits and systems},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0026269214002341},
doi = {https://doi.org/10.1016/j.mejo.2014.08.004},
year = {2014},
date = {2014-09-04},
urldate = {2014-01-01},
journal = {Microelectronics Journal},
volume = {45},
number = {11},
pages = {1380--1391},
publisher = {Elsevier},
abstract = {The unique adaptive properties of memory resistors (memristors) are ideal for use in computational architectures. Multiple interconnected memristors demonstrate complicated overall behavior which significantly improves the efficiency of logic operations via massive parallelism. Nowadays, within an ever-growing variety of memristive systems, most of the research has so far focused on the properties of the individual devices; little is known about the extraordinary features of complex memristive networks and their application prospects. The composite characteristics of regular and irregular memristive networks are explored in this work. A generalized concept for the construction of composite memristive systems, efficiently built out of individual memristive devices, is presented. A new type of threshold-dependent programmable memristive switches, presenting different electrical characteristics from their structural elements, is proposed. As an example of the introduced approach, a SPICE simulation-based evaluation of several programmable analog circuits is presented. The proposed circuit design approach constitutes a step forward towards novel memristor-based nanoelectronic computational systems and architectures.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The unique adaptive properties of memory resistors (memristors) are ideal for use in computational architectures. Multiple interconnected memristors demonstrate complicated overall behavior which significantly improves the efficiency of logic operations via massive parallelism. Nowadays, within an ever-growing variety of memristive systems, most of the research has so far focused on the properties of the individual devices; little is known about the extraordinary features of complex memristive networks and their application prospects. The composite characteristics of regular and irregular memristive networks are explored in this work. A generalized concept for the construction of composite memristive systems, efficiently built out of individual memristive devices, is presented. A new type of threshold-dependent programmable memristive switches, presenting different electrical characteristics from their structural elements, is proposed. As an example of the introduced approach, a SPICE simulation-based evaluation of several programmable analog circuits is presented. The proposed circuit design approach constitutes a step forward towards novel memristor-based nanoelectronic computational systems and architectures.
64.
Kalogeiton V S, Papadopoulos D P, Sirakoulis G Ch
Hey Physarum! Can you Perform SLAM? Journal Article
In: International Journal of Unconventional Computing, vol. 10, no. 4, pp. 271–293, 2014.
@article{kalogeiton2014hey,
title = {Hey Physarum! Can you Perform SLAM?},
author = {Vicky S Kalogeiton and Dim P Papadopoulos and Georgios Ch. Sirakoulis},
url = {https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-10-number-4-2014/ijuc-10-4-p-271-293/},
year = {2014},
date = {2014-09-01},
urldate = {2014-01-01},
journal = {International Journal of Unconventional Computing},
volume = {10},
number = {4},
pages = {271--293},
publisher = {Old City Publishing Inc},
abstract = {In this paper, an innovative bio-inspired unconventional approach to tackle with the Simultaneous Localization and Mapping (SLAM) task is presented. The proposed method draws inspiration from the slime mold Physarum polycephalum by utilizing the computational tool of Cellular Automata (CA). In particular, a fully autonomous robot, equipped only with an omni-directional camera, explores and maps successfully an indoor unknown terrain by adopting the behaviour of the microorganism Physarum polycephalum, namely its olfaction, its propagation and foraging process. The Physarum’s sense of olfaction corresponds to the robots unique sensor, namely an omni-directional camera and the foraging as well as the movement procedure of the organism in terms of robots SLAM is matched with the detection and mapping of an unknown space and the movement strategy, respectively. Moreover, the diffusion field of the plasmodium corresponds to the robots field of view. In order to evaluate the proposed approach several experiments are drawn, that indicate the ability of the presented model to effectively and efficiently achieve its goals. The obtained results were compared to the corresponding ones produced by the random movement algorithm as well as by an exhaustive search algorithm. In all the examined cases, the presented simulation results reveal the strength and the superiority of the proposed method.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, an innovative bio-inspired unconventional approach to tackle with the Simultaneous Localization and Mapping (SLAM) task is presented. The proposed method draws inspiration from the slime mold Physarum polycephalum by utilizing the computational tool of Cellular Automata (CA). In particular, a fully autonomous robot, equipped only with an omni-directional camera, explores and maps successfully an indoor unknown terrain by adopting the behaviour of the microorganism Physarum polycephalum, namely its olfaction, its propagation and foraging process. The Physarum’s sense of olfaction corresponds to the robots unique sensor, namely an omni-directional camera and the foraging as well as the movement procedure of the organism in terms of robots SLAM is matched with the detection and mapping of an unknown space and the movement strategy, respectively. Moreover, the diffusion field of the plasmodium corresponds to the robots field of view. In order to evaluate the proposed approach several experiments are drawn, that indicate the ability of the presented model to effectively and efficiently achieve its goals. The obtained results were compared to the corresponding ones produced by the random movement algorithm as well as by an exhaustive search algorithm. In all the examined cases, the presented simulation results reveal the strength and the superiority of the proposed method.
63.
Adamatzky A, Armstrong R, Costello B P D L, Deng Y, Jones J, Mayne R, Schubert T, Sirakoulis G Ch, Zhang X
Slime Mould Analogue Models of Space Exploration and Planet Colonisation Journal Article
In: Journal of the British Interplanetary Society, vol. 67, no. 7, pp. 290–304, 2014.
@article{adamatzky2014slime,
title = {Slime Mould Analogue Models of Space Exploration and Planet Colonisation},
author = {Andrew Adamatzky and Rachel Armstrong and Benjamin Paul De Lacy Costello and Yong Deng and Jeff Jones and Richard Mayne and Theresa Schubert and Georgios Ch. Sirakoulis and Xiaoge Zhang},
url = {https://research.polyu.edu.hk/en/publications/slime-mould-analogue-models-of-space-exploration-and-planet-colon},
year = {2014},
date = {2014-07-01},
urldate = {2014-01-01},
journal = {Journal of the British Interplanetary Society},
volume = {67},
number = {7},
pages = {290--304},
abstract = {Slime mould Physarum polycephalum is a single cell that is visible by the unaided eye. When spanning sources of nutrients the slime mould builds a network of protoplasmic tubes which is sometimes considered to be optimal in terms of the minimization of metabolite transportation time and distance away from repellents. Previously we have shown that the slime mould is efficient in imitating the formation of man-made road networks in major countries, where major urban areas are sources of nutrients. We used a similar approach to grow slime mould on a three-dimensional template of the Moon to speculate on potential colonisation scenarios. The slime mould imitated the propagation of colonisation in an exploratory mode, i.e. without any definite targets. Additional transportation hubs/targets were added after the initial network was formed, to imitate the development of colonies in parallel with slime mould growth. We provide analyses of proximity graphs representing colonisation networks and support the findings with Physarum-inspired algorithms to inform supply chain design. We speculate on how living Physarum, or its incorporation into a polymer hybrid material, can be used as a wearable smart wetware based on laboratory experiments interacting with chemical components.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Slime mould Physarum polycephalum is a single cell that is visible by the unaided eye. When spanning sources of nutrients the slime mould builds a network of protoplasmic tubes which is sometimes considered to be optimal in terms of the minimization of metabolite transportation time and distance away from repellents. Previously we have shown that the slime mould is efficient in imitating the formation of man-made road networks in major countries, where major urban areas are sources of nutrients. We used a similar approach to grow slime mould on a three-dimensional template of the Moon to speculate on potential colonisation scenarios. The slime mould imitated the propagation of colonisation in an exploratory mode, i.e. without any definite targets. Additional transportation hubs/targets were added after the initial network was formed, to imitate the development of colonies in parallel with slime mould growth. We provide analyses of proximity graphs representing colonisation networks and support the findings with Physarum-inspired algorithms to inform supply chain design. We speculate on how living Physarum, or its incorporation into a polymer hybrid material, can be used as a wearable smart wetware based on laboratory experiments interacting with chemical components.
62.
Boukas E, Kostavelis I, Gasteratos A, Sirakoulis G Ch
Robot guided crowd evacuation Journal Article
In: IEEE Transactions on Automation Science and Engineering, vol. 12, no. 2, pp. 739–751, 2014.
@article{boukas2015robot,
title = {Robot guided crowd evacuation},
author = {Evangelos Boukas and Ioannis Kostavelis and Antonios Gasteratos and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/6824875},
doi = {10.1109/TASE.2014.2323175},
year = {2014},
date = {2014-06-03},
urldate = {2015-01-01},
journal = {IEEE Transactions on Automation Science and Engineering},
volume = {12},
number = {2},
pages = {739--751},
publisher = {IEEE},
abstract = {The congregation of crowd undoubtedly constitutes an important risk factor, which may endanger the safety of the gathered people. The solution reported against this significant threat to citizens safety is to consider careful planning and measures. Thereupon, in this paper, we address the crowd evacuation problem by suggesting an innovative technological solution, namely, the use of mobile robot agents. The contribution of the proposed evacuation system is twofold: (i) it proposes an accurate Cellular Automaton simulation model capable of assessing the human behavior during emergency situations and (ii) it takes advantage of the simulation output to provide sufficient information to the mobile robotic guide, which in turn approaches and redirects a group of people towards a less congestive exit at a time. A custom-made mobile robotic platform was accordingly designed and developed. Last, the performance of the proposed robot guided evacuation model has been examined in real-world scenarios exhibiting significant performance improvement during the crucial first response time window.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The congregation of crowd undoubtedly constitutes an important risk factor, which may endanger the safety of the gathered people. The solution reported against this significant threat to citizens safety is to consider careful planning and measures. Thereupon, in this paper, we address the crowd evacuation problem by suggesting an innovative technological solution, namely, the use of mobile robot agents. The contribution of the proposed evacuation system is twofold: (i) it proposes an accurate Cellular Automaton simulation model capable of assessing the human behavior during emergency situations and (ii) it takes advantage of the simulation output to provide sufficient information to the mobile robotic guide, which in turn approaches and redirects a group of people towards a less congestive exit at a time. A custom-made mobile robotic platform was accordingly designed and developed. Last, the performance of the proposed robot guided evacuation model has been examined in real-world scenarios exhibiting significant performance improvement during the crucial first response time window.
61.
Kachris C, Sirakoulis G Ch, Soudris D
Network Function Virtualization based on FPGAs: A Framework for all-Programmable network devices Journal Article
In: arXiv preprint arXiv:1406.0309, 2014.
@article{kachris2014network,
title = {Network Function Virtualization based on FPGAs: A Framework for all-Programmable network devices},
author = {Christoforos Kachris and Georgios Ch. Sirakoulis and Dimitrios Soudris},
url = {https://arxiv.org/abs/1406.0309},
year = {2014},
date = {2014-06-02},
urldate = {2014-01-01},
journal = {arXiv preprint arXiv:1406.0309},
abstract = {Network Function Virtualization (NFV) refers to the use of commodity hardware resources as the basic platform to perform specialized network functions as opposed to specialized hardware devices. Currently, NFV is mainly implemented based on general purpose processors, or general purpose network processors. In this paper we propose the use of FPGAs as an ideal platform for NFV that can be used to provide both the flexibility of virtualizations and the high performance of the specialized hardware. We present the early attempts of using FPGAs dynamic reconfiguration in network processing applications to provide flexible network functions and we present the opportunities for an FPGA-based NFV platform.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Network Function Virtualization (NFV) refers to the use of commodity hardware resources as the basic platform to perform specialized network functions as opposed to specialized hardware devices. Currently, NFV is mainly implemented based on general purpose processors, or general purpose network processors. In this paper we propose the use of FPGAs as an ideal platform for NFV that can be used to provide both the flexibility of virtualizations and the high performance of the specialized hardware. We present the early attempts of using FPGAs dynamic reconfiguration in network processing applications to provide flexible network functions and we present the opportunities for an FPGA-based NFV platform.
60.
Bitsakidis N P, Chatzichristofis S A, Sirakoulis G Ch
Hybrid Cellular Ants for Clustering Problems Journal Article
In: International Journal of Unconventional Computing, vol. 11, no. 2, pp. 103–130, 2014.
@article{sirakoulis2014hybrid,
title = {Hybrid Cellular Ants for Clustering Problems},
author = {Nikolaos P. Bitsakidis and Savvas A. Chatzichristofis and Georgios Ch. Sirakoulis},
url = {https://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-11-number-2-2015/ijuc-11-2-p-103-130/},
year = {2014},
date = {2014-06-01},
urldate = {2014-01-01},
journal = {International Journal of Unconventional Computing},
volume = {11},
number = {2},
pages = {103--130},
publisher = {Old City Publishing},
abstract = {In the last decade the amount of the stored data related to almost all areas of life has rapidly increased. However, the overall process of discovering knowledge from data demands more powerful clustering techniques to ensure that this knowledge is useful. In this paper, two nature inspired computation techniques, Cellular Automata (CA) and Ant Colonies are combined by taking advantage of their common prominent features, such as simplicity, locality and self organization. Inspired by the cellular ants algorithm of Vande Moere and Clayden which has designed for clustering purposes, a corresponding cellular ants model was developed in order to overcome some of the previous model limitations and to provide new insights in cellular ants based clustering. The presented simulation results prove the clustering efficiency of the proposed model in both qualitative and quantitative terms.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In the last decade the amount of the stored data related to almost all areas of life has rapidly increased. However, the overall process of discovering knowledge from data demands more powerful clustering techniques to ensure that this knowledge is useful. In this paper, two nature inspired computation techniques, Cellular Automata (CA) and Ant Colonies are combined by taking advantage of their common prominent features, such as simplicity, locality and self organization. Inspired by the cellular ants algorithm of Vande Moere and Clayden which has designed for clustering purposes, a corresponding cellular ants model was developed in order to overcome some of the previous model limitations and to provide new insights in cellular ants based clustering. The presented simulation results prove the clustering efficiency of the proposed model in both qualitative and quantitative terms.
59.
Saravakos P, Sirakoulis G Ch
Modeling employees behavior in workplace dynamics Journal Article
In: Journal of Computational Science, vol. 5, no. 5, pp. 821–833, 2014.
@article{saravakos2014modeling,
title = {Modeling employees behavior in workplace dynamics},
author = {Petros Saravakos and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/pii/S1877750314000672},
doi = {doi.org/10.1016/j.jocs.2014.05.001},
year = {2014},
date = {2014-05-13},
urldate = {2014-05-13},
journal = {Journal of Computational Science},
volume = {5},
number = {5},
pages = {821--833},
publisher = {Elsevier},
abstract = {During the past years, Cellular Automata (CAs) have been extensively used for modeling of many complex systems and processes with great success. In this paper, we study a Cellular Automaton (CA) model for the influence of employees’ behavior in a parameterized workplace environment taking into account different behavioral characteristics. In specific, we model employees’ interactions based on their influence radius, the degree of their willingness on adaption of organizational norms and the employee's attitude in general in the under study workplace. The proposed CA model is taking into account employee loyalty, a combined statistic of the employee behavior and her/his insistence and company policies applied to the employees so as to restrain unwanted or impose desirable behavioral patterns in correspondence to the organization norms. Conclusively, the CA model facilitates the presentation and simulation of a workplace with a variety of employee behavioral characteristics and under adaptable company policies. Different workplaces were used to illustrate the simulation of employee behavior with CA model. As a result, the proposed model was practically used on two levels, firstly to estimate the workplace robustness and secondly to illustrate workspace dynamics. Finally, the CA model has been utilized to simulate behavioral patterns at a small enterprise in Greece. In specific, based on the employees answers to detailed surveys the CA model was initialized and then applied to describe the behavioral traits of the under study company employees. Finally, the proposed model, in all the examined cases can be utilized in conjunction with applied employee management techniques to facilitate managerial decisions and forecast the impact of employee behavioral changes and company decisions.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
During the past years, Cellular Automata (CAs) have been extensively used for modeling of many complex systems and processes with great success. In this paper, we study a Cellular Automaton (CA) model for the influence of employees’ behavior in a parameterized workplace environment taking into account different behavioral characteristics. In specific, we model employees’ interactions based on their influence radius, the degree of their willingness on adaption of organizational norms and the employee's attitude in general in the under study workplace. The proposed CA model is taking into account employee loyalty, a combined statistic of the employee behavior and her/his insistence and company policies applied to the employees so as to restrain unwanted or impose desirable behavioral patterns in correspondence to the organization norms. Conclusively, the CA model facilitates the presentation and simulation of a workplace with a variety of employee behavioral characteristics and under adaptable company policies. Different workplaces were used to illustrate the simulation of employee behavior with CA model. As a result, the proposed model was practically used on two levels, firstly to estimate the workplace robustness and secondly to illustrate workspace dynamics. Finally, the CA model has been utilized to simulate behavioral patterns at a small enterprise in Greece. In specific, based on the employees answers to detailed surveys the CA model was initialized and then applied to describe the behavioral traits of the under study company employees. Finally, the proposed model, in all the examined cases can be utilized in conjunction with applied employee management techniques to facilitate managerial decisions and forecast the impact of employee behavioral changes and company decisions.
58.
Vourkas I, Sirakoulis G Ch
Nano-Crossbar Memories Comprising Parallel/Serial Complementary Memristive Switches Journal Article
In: BioNanoScience, vol. 4, no. 2, pp. 166–179, 2014.
@article{vourkas2014nano,
title = {Nano-Crossbar Memories Comprising Parallel/Serial Complementary Memristive Switches},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://link.springer.com/article/10.1007/s12668-014-0132-y},
doi = {https://doi.org/10.1007/s12668-014-0132-y},
year = {2014},
date = {2014-03-13},
urldate = {2014-01-01},
journal = {BioNanoScience},
volume = {4},
number = {2},
pages = {166--179},
publisher = {Springer},
abstract = {This work explores anti-serial (anti-parallel) memristive switches\textemdashASMs (APMs)\textemdashas potential cross-point elements in nano-crossbar resistive random access memory arrays. The memory operation principles for both device combinations are shown in detail. The effectiveness of these memristive structures to the solution of the parasitic conducting (current sneak paths) problem is presented via an analytical approach which is based on the basic setup of resistive crossbar memories. Simulation results of crossbars of up to 4,096 elements, arranged in quadratic configurations, are conducted. The provided results supplement this comprehensive analysis of APMs and ASMs, outlining their overall performance characteristics and commenting on their applicability to the practical realization of large crossbar memory systems. Finally, a special array topology is applied to an ASM-based crossbar memory. Its performance is compared to the performance of the pure ASM-based memory. The conducted simulations reveal significantly improved read-out voltage margins which further contribute to addressing the parasitic current paths which prevent the reliable operation of memristive crossbar circuit topologies.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This work explores anti-serial (anti-parallel) memristive switches—ASMs (APMs)—as potential cross-point elements in nano-crossbar resistive random access memory arrays. The memory operation principles for both device combinations are shown in detail. The effectiveness of these memristive structures to the solution of the parasitic conducting (current sneak paths) problem is presented via an analytical approach which is based on the basic setup of resistive crossbar memories. Simulation results of crossbars of up to 4,096 elements, arranged in quadratic configurations, are conducted. The provided results supplement this comprehensive analysis of APMs and ASMs, outlining their overall performance characteristics and commenting on their applicability to the practical realization of large crossbar memory systems. Finally, a special array topology is applied to an ASM-based crossbar memory. Its performance is compared to the performance of the pure ASM-based memory. The conducted simulations reveal significantly improved read-out voltage margins which further contribute to addressing the parasitic current paths which prevent the reliable operation of memristive crossbar circuit topologies.
57.
Vourkas I, Sirakoulis G Ch
Study of Memristive Elements Networks Journal Article
In: Journal of Nano Research, vol. 27, pp. 5–14, 2014.
@article{vourkas2014study,
title = {Study of Memristive Elements Networks},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://www.scientific.net/JNanoR.27.5},
doi = {https://doi.org/10.4028/www.scientific.net/JNanoR.27.5},
year = {2014},
date = {2014-03-01},
urldate = {2014-03-01},
journal = {Journal of Nano Research},
volume = {27},
pages = {5--14},
publisher = {Trans Tech Publ},
abstract = {The existence of the fourth fundamental circuit element, the memristor, was first postulated over 30 years ago by Leon Chua. The implementation of the first modern memristor prototype by Hewlett Packard Laboratories in 2008 initiated a great scientific interest for these unique nanoelectronic devices and currently, there is a growing variety of systems that exhibit memristive behavior. However, most of the research has focused on the properties of the single devices, therefore very little is known about their response when these devices are organized into networks. In this work, the composite characteristics of memristive elements connected in network configurations are studied and the relationships among the single devices are investigated. We finally show how the threshold-dependent nonlinear memristive behavior could be elaborated to make possible the development of novel and sophisticated digital/analog memristive nanosystems.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The existence of the fourth fundamental circuit element, the memristor, was first postulated over 30 years ago by Leon Chua. The implementation of the first modern memristor prototype by Hewlett Packard Laboratories in 2008 initiated a great scientific interest for these unique nanoelectronic devices and currently, there is a growing variety of systems that exhibit memristive behavior. However, most of the research has focused on the properties of the single devices, therefore very little is known about their response when these devices are organized into networks. In this work, the composite characteristics of memristive elements connected in network configurations are studied and the relationships among the single devices are investigated. We finally show how the threshold-dependent nonlinear memristive behavior could be elaborated to make possible the development of novel and sophisticated digital/analog memristive nanosystems.
56.
Chrysostomou D, Sirakoulis G Ch, Gasteratos A
A bio-inspired multi-camera system for dynamic crowd analysis Journal Article
In: Pattern Recognition Letters, vol. 44, pp. 141–151, 2013.
@article{chrysostomou2014bio,
title = {A bio-inspired multi-camera system for dynamic crowd analysis},
author = {Dimitrios Chrysostomou and Georgios Ch. Sirakoulis and Antonios Gasteratos},
url = {https://www.sciencedirect.com/science/article/pii/S0167865513004650?via%3Dihub},
doi = {doi.org/10.1016/j.patrec.2013.11.020},
year = {2013},
date = {2013-12-08},
urldate = {2013-12-08},
journal = {Pattern Recognition Letters},
volume = {44},
pages = {141--151},
publisher = {Elsevier},
abstract = {Analysis of crowd density has emerged nowadays as a hot topic issue related to the crowd safety and comfort and directly depended on the design and the operation of the crowded places under study. Usually multiple camera networks are employed to cover, monitor and improve the safety of people in large multifunctional crowded buildings. On the other hand, the art gallery problem is a computational geometry approach to a classical real-world visibility challenge. In a nutshell, it concerns the minimization of the free moving guards required to observe the entire gallery. In this paper we attempt to approach this problem from a novel perspective. To begin with, the number of guards are replaced by multiple cameras whose number should be minimized. At the same time, the observability of the camera network in the available space should be dynamically maximized, so as to observe the evolving density of the crowded areas adequately. In order to achieve this objective a twofold bio-inspired method is described and implemented, based on the emergent computation of swarms to come up with solutions in complex mathematical problems. More specifically, the observations on bumblebee colonies lead us firstly to the definition of artificial bumblebee agents used to determine the number of cameras needed to maximize the observability of a space given the safety specifications emerged from the crowd analysis. Secondly, the way the spiders wave their webs was used as a source of inspiration to determine the exact positions of the cameras in the given space by artificial spider agents. The feedback of the algorithm is then used to cover the areas with significant crowd density in a dynamic fashion. Experimental results show that the algorithm is capable of producing promising results where the areas with the maximum crowd density are continuously detected and covered in a dynamic way.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Analysis of crowd density has emerged nowadays as a hot topic issue related to the crowd safety and comfort and directly depended on the design and the operation of the crowded places under study. Usually multiple camera networks are employed to cover, monitor and improve the safety of people in large multifunctional crowded buildings. On the other hand, the art gallery problem is a computational geometry approach to a classical real-world visibility challenge. In a nutshell, it concerns the minimization of the free moving guards required to observe the entire gallery. In this paper we attempt to approach this problem from a novel perspective. To begin with, the number of guards are replaced by multiple cameras whose number should be minimized. At the same time, the observability of the camera network in the available space should be dynamically maximized, so as to observe the evolving density of the crowded areas adequately. In order to achieve this objective a twofold bio-inspired method is described and implemented, based on the emergent computation of swarms to come up with solutions in complex mathematical problems. More specifically, the observations on bumblebee colonies lead us firstly to the definition of artificial bumblebee agents used to determine the number of cameras needed to maximize the observability of a space given the safety specifications emerged from the crowd analysis. Secondly, the way the spiders wave their webs was used as a source of inspiration to determine the exact positions of the cameras in the given space by artificial spider agents. The feedback of the algorithm is then used to cover the areas with significant crowd density in a dynamic fashion. Experimental results show that the algorithm is capable of producing promising results where the areas with the maximum crowd density are continuously detected and covered in a dynamic way.
55.
Vourkas I, Sirakoulis G Ch
Memristor-based combinational circuits: A design methodology for encoders/decoders Journal Article
In: Microelectronics Journal, vol. 45, no. 1, pp. 59–70, 2013.
@article{vourkas2014memristor,
title = {Memristor-based combinational circuits: A design methodology for encoders/decoders},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/pii/S0026269213002280},
doi = {doi.org/10.1016/j.mejo.2013.10.001},
year = {2013},
date = {2013-11-20},
urldate = {2014-01-01},
journal = {Microelectronics Journal},
volume = {45},
number = {1},
pages = {59--70},
publisher = {Elsevier},
abstract = {The crossbar architecture is viewed as the most likely path towards novel nanotechnologies which are expected to continue the technological revolution. Memristor-based crossbars for integrating memory units have received considerable attention, though little work has been done concerning the implementation of logic. In this work we focus on memristor-based complex combinational circuits. Particularly, we present a design methodology for encoder and decoder circuits. Digital encoders are found in a variety of electronics multi-input combinational circuits (e.g. keyboards) nowadays, converting the logic level ‘1’ data at their inputs into an equivalent binary code at the output. Their counterparts, digital decoders, constitute critical components for nanoelectronics, mainly in peripheral/interface circuitry of nanoelectronic circuits and memory structures. The proposed methodology follows a CMOS-like design scheme which can be used for the efficient design and mapping of any 2n×n (n×2n) encoder (decoder) onto the memristor-based crossbar geometry. For their implementation, a hybrid nano/CMOS crossbar type with memristive cross-point structures and available transistors is elaborated, which is a promising solution to the interference between neighboring cross-point devices during access operation. Circuit functionality of the presented encoder/decoder circuits is exhibited with simulations conducted using a simulator environment which incorporates a versatile memristor device model. The proposed design and implementation paradigm constitutes a step towards novel computational architectures exploiting memristor-based logic circuits, and facilitating the design and integration of memristor-based encoder/decoder circuits with nanoelectronics applications of the near future.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The crossbar architecture is viewed as the most likely path towards novel nanotechnologies which are expected to continue the technological revolution. Memristor-based crossbars for integrating memory units have received considerable attention, though little work has been done concerning the implementation of logic. In this work we focus on memristor-based complex combinational circuits. Particularly, we present a design methodology for encoder and decoder circuits. Digital encoders are found in a variety of electronics multi-input combinational circuits (e.g. keyboards) nowadays, converting the logic level ‘1’ data at their inputs into an equivalent binary code at the output. Their counterparts, digital decoders, constitute critical components for nanoelectronics, mainly in peripheral/interface circuitry of nanoelectronic circuits and memory structures. The proposed methodology follows a CMOS-like design scheme which can be used for the efficient design and mapping of any 2n×n (n×2n) encoder (decoder) onto the memristor-based crossbar geometry. For their implementation, a hybrid nano/CMOS crossbar type with memristive cross-point structures and available transistors is elaborated, which is a promising solution to the interference between neighboring cross-point devices during access operation. Circuit functionality of the presented encoder/decoder circuits is exhibited with simulations conducted using a simulator environment which incorporates a versatile memristor device model. The proposed design and implementation paradigm constitutes a step towards novel computational architectures exploiting memristor-based logic circuits, and facilitating the design and integration of memristor-based encoder/decoder circuits with nanoelectronics applications of the near future.
54.
Kechaidou M G, Sirakoulis G Ch, Scordilis E M
Modelling real earthquake activity with reverse engineering based on evolutionary computation methods Journal Article
In: Georisk: Assessment and Management of Risk for Engineered Systems and Geohazards, vol. 7, no. 4, pp. 275–288, 2013.
@article{kechaidou2013modelling,
title = {Modelling real earthquake activity with reverse engineering based on evolutionary computation methods},
author = {Marina G Kechaidou and Georgios Ch. Sirakoulis and Emmanouil M Scordilis},
url = {https://www.tandfonline.com/doi/abs/10.1080/17499518.2013.797823},
doi = {https://doi.org/10.1080/17499518.2013.797823},
year = {2013},
date = {2013-10-31},
urldate = {2013-10-31},
journal = {Georisk: Assessment and Management of Risk for Engineered Systems and Geohazards},
volume = {7},
number = {4},
pages = {275--288},
publisher = {Taylor \& Francis},
abstract = {Hazard assessment of dangerous natural phenomena is critical because of their evident results concerning loss of human life and property, especially in dense populated areas. Earthquakes are probably the most devastating phenomenon since their immediate and long-term consequences are severe. This study is focused on the earthquake data analysis in different regions of Greece, characterised by different seismicity levels. In specific, a novel model is proposed based on evolutionary computation methods, such as symbolic regression by genetic programming and genetic algorithms in order to elucidate preliminary hidden mathematical relations and patterns found in the seismological signals under study. Furthermore, the model is calibrated using reverse engineering and closes the loop from the data collection to initial hypothesis. In this way, the model formation is achieved. The presented simulation results qualitatively and quantitatively reveal some of the fundamental characteristics of each studied geographical region located in Greece that stem from its geodynamic properties.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Hazard assessment of dangerous natural phenomena is critical because of their evident results concerning loss of human life and property, especially in dense populated areas. Earthquakes are probably the most devastating phenomenon since their immediate and long-term consequences are severe. This study is focused on the earthquake data analysis in different regions of Greece, characterised by different seismicity levels. In specific, a novel model is proposed based on evolutionary computation methods, such as symbolic regression by genetic programming and genetic algorithms in order to elucidate preliminary hidden mathematical relations and patterns found in the seismological signals under study. Furthermore, the model is calibrated using reverse engineering and closes the loop from the data collection to initial hypothesis. In this way, the model formation is achieved. The presented simulation results qualitatively and quantitatively reveal some of the fundamental characteristics of each studied geographical region located in Greece that stem from its geodynamic properties.
53.
Vourkas I, Batsos A, Sirakoulis G Ch
SPICE modeling of nonlinear memristive behavior Journal Article
In: International Journal of Circuit Theory and Applications, vol. 43, no. 5, pp. 553–565, 2013.
@article{vourkas2015spice,
title = {SPICE modeling of nonlinear memristive behavior},
author = {Ioannis Vourkas and Athanasios Batsos and Georgios Ch. Sirakoulis},
url = {https://onlinelibrary.wiley.com/doi/10.1002/cta.1957},
doi = {doi.org/10.1002/cta.1957},
year = {2013},
date = {2013-10-22},
urldate = {2015-01-01},
journal = {International Journal of Circuit Theory and Applications},
volume = {43},
number = {5},
pages = {553--565},
abstract = {The recent discovery of the ‘modern’ memristor has drawn great attention of both academia and industry. Given their favorable performance merits, memristors are expected to play a fundamental role in electronic industry. Modeling of memristive devices is essential for circuit design, and a number of Simulation Program with Integrated Circuit Emphasis (SPICE) models have already been introduced. The common problem in most models is that there is no threshold consideration; hence, only a few address the nonlinear nature of the device. This paper aims to present a SPICE implementation of a threshold-type switching model of a voltage-controlled memristive device that attributes the switching effect to a tunneling distance modulation. Threshold-type switching is closer to the actual behavior of most experimentally realizable memristive systems, and our modeling approach addresses the issue of programming thresholds. Both the netlist and the simple schematic are provided, thus making it easy to comprehend and ready to be used. Compared with other modeling solutions, it involves significantly low-complexity operation under an unlimited set of frequencies, and its simulation results are in good qualitative and quantitative agreement with the theoretical formulation. The proposed model is used to simulate an antiserial memristive switch, proving that it can be efficiently introduced in complex memristive circuits.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The recent discovery of the ‘modern’ memristor has drawn great attention of both academia and industry. Given their favorable performance merits, memristors are expected to play a fundamental role in electronic industry. Modeling of memristive devices is essential for circuit design, and a number of Simulation Program with Integrated Circuit Emphasis (SPICE) models have already been introduced. The common problem in most models is that there is no threshold consideration; hence, only a few address the nonlinear nature of the device. This paper aims to present a SPICE implementation of a threshold-type switching model of a voltage-controlled memristive device that attributes the switching effect to a tunneling distance modulation. Threshold-type switching is closer to the actual behavior of most experimentally realizable memristive systems, and our modeling approach addresses the issue of programming thresholds. Both the netlist and the simple schematic are provided, thus making it easy to comprehend and ready to be used. Compared with other modeling solutions, it involves significantly low-complexity operation under an unlimited set of frequencies, and its simulation results are in good qualitative and quantitative agreement with the theoretical formulation. The proposed model is used to simulate an antiserial memristive switch, proving that it can be efficiently introduced in complex memristive circuits.
52.
Vihas C, Georgoudas I G, Sirakoulis G Ch
Cellular Automata Incorporating Follow-the-Leader Principles to Model Crowd Dynamics. Journal Article
In: Journal of Cellular Automata, vol. 8, no. 5-6, pp. 333–346, 2013.
@article{vihas2013cellular,
title = {Cellular Automata Incorporating Follow-the-Leader Principles to Model Crowd Dynamics.},
author = {Christos Vihas and Ioakeim G Georgoudas and Georgios Ch. Sirakoulis},
url = {http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-8-number-5-6-2013/jca-8-5-6-p-333-346/},
year = {2013},
date = {2013-10-01},
urldate = {2013-01-01},
journal = {Journal of Cellular Automata},
volume = {8},
number = {5-6},
pages = {333--346},
abstract = {Following the leader is a bio\textendashinspired technique that is intuitively adopted by living organisms when moving together. Trying to emulate physical processes, the proposed here Cellular Automaton (CA) model aims at crowd movement simulation by embedding the follow\textendashthe\textendashleader technique as its fundamental driving mechanism. Prominent characteristics of the collective motion of biological organisms are apparent to the simulation process. Macroscopically, the study focuses on the emergence of qualitative attributes of crowd behaviour, such as collective effects, random to coherent motion due to a common purpose and transition to incoordination (arching) due to clogging. Microscopically, all configurations of the CA model are triggered by simple rules applied locally to each of the group members. These CA rules are enhanced with memory capacity to gain back model’s reversibility and prevent group members from self\textendashentrapment. The inherent attributes of CA allowed the development of a micro\textendashoperating model that presents macro\textendashfeatures. Different simulation scenarios validate the response of the presented model.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Following the leader is a bio–inspired technique that is intuitively adopted by living organisms when moving together. Trying to emulate physical processes, the proposed here Cellular Automaton (CA) model aims at crowd movement simulation by embedding the follow–the–leader technique as its fundamental driving mechanism. Prominent characteristics of the collective motion of biological organisms are apparent to the simulation process. Macroscopically, the study focuses on the emergence of qualitative attributes of crowd behaviour, such as collective effects, random to coherent motion due to a common purpose and transition to incoordination (arching) due to clogging. Microscopically, all configurations of the CA model are triggered by simple rules applied locally to each of the group members. These CA rules are enhanced with memory capacity to gain back model’s reversibility and prevent group members from self–entrapment. The inherent attributes of CA allowed the development of a micro–operating model that presents macro–features. Different simulation scenarios validate the response of the presented model.
51.
Kalogeropoulos G, Sirakoulis G Ch, Karafyllidis I
Cellular automata on FPGA for real-time urban traffic signals control Journal Article
In: The Journal of Supercomputing, vol. 65, no. 2, pp. 664–681, 2013.
@article{kalogeropoulos2013cellular,
title = {Cellular automata on FPGA for real-time urban traffic signals control},
author = {Georgios Kalogeropoulos and Georgios Ch. Sirakoulis and Ioannis Karafyllidis},
url = {https://link.springer.com/article/10.1007/s11227-013-0952-5},
doi = {https://doi.org/10.1007/s11227-013-0952-5},
year = {2013},
date = {2013-05-04},
urldate = {2013-05-04},
journal = {The Journal of Supercomputing},
volume = {65},
number = {2},
pages = {664--681},
publisher = {Springer},
abstract = {Among different traffic features, the urban traffic has received a lot of attention due to the ongoing traffic congestion as a result of increased car usage, population growth, and changes in population density. In urban networks, the vehicles flow differs when compared with highways flow because of the freeway’s low speed limit but mostly because of the traffic lights control. In this paper, a real-time hardware implemented bio-inspired model for traffic lights control is presented. The proposed model arrives from Cellular Automata (CAs), which have been proven very flexible and powerful computational traffic models, in that they are able to capture all previously mentioned basic phenomena that occur in traffic flows. The resulting CA model was hardware implemented on FPGA to take full advantage of the inherent parallelism of the CAs and to support the function of an advanced electronic system able to provide real-time adaptive control of traffic lights designed to consider traffic conditions for the whole intersections. The analytical results, obtained by application of the aforementioned FPGA CA processor are found in excellent agreement with the numerical simulations.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Among different traffic features, the urban traffic has received a lot of attention due to the ongoing traffic congestion as a result of increased car usage, population growth, and changes in population density. In urban networks, the vehicles flow differs when compared with highways flow because of the freeway’s low speed limit but mostly because of the traffic lights control. In this paper, a real-time hardware implemented bio-inspired model for traffic lights control is presented. The proposed model arrives from Cellular Automata (CAs), which have been proven very flexible and powerful computational traffic models, in that they are able to capture all previously mentioned basic phenomena that occur in traffic flows. The resulting CA model was hardware implemented on FPGA to take full advantage of the inherent parallelism of the CAs and to support the function of an advanced electronic system able to provide real-time adaptive control of traffic lights designed to consider traffic conditions for the whole intersections. The analytical results, obtained by application of the aforementioned FPGA CA processor are found in excellent agreement with the numerical simulations.
50.
Ioannidis K, Sirakoulis G Ch, Andreadis I
Cellular Automata-based Architecture for Cooperative Miniature Robots. Journal Article
In: Journal of Cellular Automata, vol. 8, no. 1-2, pp. 91–111, 2013.
@article{ioannidis2013cellular,
title = {Cellular Automata-based Architecture for Cooperative Miniature Robots.},
author = {Konstantinos Ioannidis and Georgios Ch. Sirakoulis and Ioannis Andreadis},
url = {https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-8-number-1-2-2013/jca-8-1-2-p-91-111/},
year = {2013},
date = {2013-03-01},
urldate = {2013-01-01},
journal = {Journal of Cellular Automata},
volume = {8},
number = {1-2},
pages = {91--111},
abstract = {The creation of collision-free paths for mobile robots, also known as the path planning problem, is a vibrant research field of robotics. Most related approaches for robotic teams display an increment of their total complexity due to the cooperative tasks that must be simultaneously achieved such as forming specific patterns. In addition, these methods extensively bind resources of the system in order to be fully functional and thus, no further tasks could be performed. In this paper, a path planning approach based on Cellular Automata (CA) is introduced. The proposed method assumes that a predefined distance must be covered by a team of robots while preserving their initial formation through cooperations. Due to its simplicity, the resulted computational burden permits the implementation of different methods in the same system in order to accomplish further tasks including image processing techniques. The usage of multiple digital cameras is one of the most interesting aspects of the image processing research area; nevertheless, in mobile robotics, miniature robots are equipped with low resolution cameras constraining the range of image processing applications. In order to preserve the total computational burden and produce higher resolution images, a CA-based image resizing method is inserted in the same cooperative robot system. Higher resolution images could be further processed to attain area measurements, panoramic images etc. Exploiting the inherit parallelism of the CA, both approaches could be executed concurrently. Results indicate that the total CA architecture outcomes low computational cost leading to an appropriate scheme for miniature robots functionality while both paths are properly created and the resolution of the captured images is sufficiently increased.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The creation of collision-free paths for mobile robots, also known as the path planning problem, is a vibrant research field of robotics. Most related approaches for robotic teams display an increment of their total complexity due to the cooperative tasks that must be simultaneously achieved such as forming specific patterns. In addition, these methods extensively bind resources of the system in order to be fully functional and thus, no further tasks could be performed. In this paper, a path planning approach based on Cellular Automata (CA) is introduced. The proposed method assumes that a predefined distance must be covered by a team of robots while preserving their initial formation through cooperations. Due to its simplicity, the resulted computational burden permits the implementation of different methods in the same system in order to accomplish further tasks including image processing techniques. The usage of multiple digital cameras is one of the most interesting aspects of the image processing research area; nevertheless, in mobile robotics, miniature robots are equipped with low resolution cameras constraining the range of image processing applications. In order to preserve the total computational burden and produce higher resolution images, a CA-based image resizing method is inserted in the same cooperative robot system. Higher resolution images could be further processed to attain area measurements, panoramic images etc. Exploiting the inherit parallelism of the CA, both approaches could be executed concurrently. Results indicate that the total CA architecture outcomes low computational cost leading to an appropriate scheme for miniature robots functionality while both paths are properly created and the resolution of the captured images is sufficiently increased.
49.
Adamatzky A, Appert-Rolland C, Bandini S, Batty M, Bauer D, Evans M, Federici M L, Fuks H, Kikuchi M, Klugl F, others
SPECIAL ISSUE Application of Cellular Automata to Crowds and Traffic Dynamics Journal Article
In: Journal of Cellular Automata, vol. 8, no. 5-6, pp. 317–320, 2013.
@article{adamatzky2013special,
title = {SPECIAL ISSUE Application of Cellular Automata to Crowds and Traffic Dynamics},
author = {Andrew Adamatzky and Cecile Appert-Rolland and Stefania Bandini and Michael Batty and Dietmar Bauer and Martin Evans and Mizar Luca Federici and Henryk Fuks and Makoto Kikuchi and Franziska Klugl and others},
year = {2013},
date = {2013-01-01},
journal = {Journal of Cellular Automata},
volume = {8},
number = {5-6},
pages = {317--320},
publisher = {Old City Publishing Inc},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
48.
Vourkas I, Sirakoulis G Ch
Recent progress and patents on computational structures and methods with memristive devices Journal Article
In: Recent Patents on Electrical & Electronic Engineering (Formerly Recent Patents on Electrical Engineering), vol. 6, no. 2, pp. 101–116, 2013.
@article{vourkas2013recent,
title = {Recent progress and patents on computational structures and methods with memristive devices},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
year = {2013},
date = {2013-01-01},
journal = {Recent Patents on Electrical \& Electronic Engineering (Formerly Recent Patents on Electrical Engineering)},
volume = {6},
number = {2},
pages = {101--116},
publisher = {Bentham Science Publishers},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
47.
Progias P, Sirakoulis G Ch
An FPGA processor for modelling wildfire spreading Journal Article
In: Mathematical and Computer Modelling, vol. 57, no. 5-6, pp. 1436–1452, 2012.
@article{progias2013fpga,
title = {An FPGA processor for modelling wildfire spreading},
author = {Pavlos Progias and Georgios Ch. Sirakoulis},
url = {https://www.sciencedirect.com/science/article/pii/S0895717712003494},
doi = {https://doi.org/10.1016/j.mcm.2012.12.005},
year = {2012},
date = {2012-12-20},
urldate = {2013-01-01},
journal = {Mathematical and Computer Modelling},
volume = {57},
number = {5-6},
pages = {1436--1452},
publisher = {Pergamon},
abstract = {In this paper, a model based on Cellular Automata (CAs) for predicting wildfire spreading is presented. The proposed model is inspired by existing fire spread models, but also includes a number of changes and additions, compared to them. Primary goal of the paper is to design and implement a software-based model as well as a corresponding hardware-based one that will sufficiently describe real fires, but will also have less stringent requirements on computational resources and computational power for execution. Therefore, an effort has been made to minimize the complexity of the model and the resulting computational burden aiming at an implementation that will have a practical significance in predicting the evolution of a fire. The proposed model is implemented on an Altera®Stratix IV®FPGA (Field-Programmable Gate Array), designed to execute in a parallel way in order to produce valuable information in real time that can be used to optimize response to a fire crisis. The FPGA design results from the automatically produced synthesizable VHDL code of the CA model and is advantageous in terms of low-cost, high speed and portability. The resulting implementation sufficiently depicts the natural phenomenon of wildfire spreading and provides short calculation times. Finally, the presented FPGA implementation of the proposed CA model offers the possibility a portable system to be designed, connected with GPS as well as GIS and/or wind monitoring systems able to provide real-time information concerning the wildfire propagation on the under test area.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, a model based on Cellular Automata (CAs) for predicting wildfire spreading is presented. The proposed model is inspired by existing fire spread models, but also includes a number of changes and additions, compared to them. Primary goal of the paper is to design and implement a software-based model as well as a corresponding hardware-based one that will sufficiently describe real fires, but will also have less stringent requirements on computational resources and computational power for execution. Therefore, an effort has been made to minimize the complexity of the model and the resulting computational burden aiming at an implementation that will have a practical significance in predicting the evolution of a fire. The proposed model is implemented on an Altera®Stratix IV®FPGA (Field-Programmable Gate Array), designed to execute in a parallel way in order to produce valuable information in real time that can be used to optimize response to a fire crisis. The FPGA design results from the automatically produced synthesizable VHDL code of the CA model and is advantageous in terms of low-cost, high speed and portability. The resulting implementation sufficiently depicts the natural phenomenon of wildfire spreading and provides short calculation times. Finally, the presented FPGA implementation of the proposed CA model offers the possibility a portable system to be designed, connected with GPS as well as GIS and/or wind monitoring systems able to provide real-time information concerning the wildfire propagation on the under test area.
46.
Vourkas I, Sirakoulis G Ch
A novel design and modeling paradigm for memristor-based crossbar circuits Journal Article
In: IEEE Transactions on Nanotechnology, vol. 11, no. 6, pp. 1151–1159, 2012.
@article{vourkas2012novel,
title = {A novel design and modeling paradigm for memristor-based crossbar circuits},
author = {Ioannis Vourkas and Georgios Ch. Sirakoulis},
url = {https://ieeexplore.ieee.org/document/6294451},
doi = {10.1109/TNANO.2012.2217153},
year = {2012},
date = {2012-09-04},
urldate = {2012-01-01},
journal = {IEEE Transactions on Nanotechnology},
volume = {11},
number = {6},
pages = {1151--1159},
publisher = {IEEE},
abstract = {Over 30 years ago L. Chua proposed the existence of a new class of passive circuit elements, which he called memristors and memristive devices. The unique electrical characteristics associated with them, along with the advantages of crossbar structures, have the potential to revolutionize computing architectures. A well-defined and effective memristor model for circuit design combined with a design paradigm based on well-understood underlying logic design principles would certainly accelerate research on nanoscale circuits and systems. Toward this goal, we propose a memristor crossbar circuit design paradigm in which memristors are modeled using the quantum mechanical phenomenon of tunneling. We use this circuit model to design and simulate various logic circuit designs capable of universal computation. Finally, we develop and present a new design paradigm for memristor-based crossbar circuits.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Over 30 years ago L. Chua proposed the existence of a new class of passive circuit elements, which he called memristors and memristive devices. The unique electrical characteristics associated with them, along with the advantages of crossbar structures, have the potential to revolutionize computing architectures. A well-defined and effective memristor model for circuit design combined with a design paradigm based on well-understood underlying logic design principles would certainly accelerate research on nanoscale circuits and systems. Toward this goal, we propose a memristor crossbar circuit design paradigm in which memristors are modeled using the quantum mechanical phenomenon of tunneling. We use this circuit model to design and simulate various logic circuit designs capable of universal computation. Finally, we develop and present a new design paradigm for memristor-based crossbar circuits.
45.
Sirakoulis G C, Karafyllidis I G
Cooperation in a power-aware embedded-system changing environment: Public goods games with variable multiplication factors Journal Article
In: IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, vol. 42, no. 3, pp. 596–603, 2012.
@article{sirakoulis2012cooperation,
title = {Cooperation in a power-aware embedded-system changing environment: Public goods games with variable multiplication factors},
author = {Georgios Ch Sirakoulis and Ioannis G Karafyllidis},
year = {2012},
date = {2012-01-01},
journal = {IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans},
volume = {42},
number = {3},
pages = {596--603},
publisher = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
44.
Chrysostomou D, Gasteratos A, Nalpantidis L, Sirakoulis G C
Multi-view 3D scene reconstruction using ant colony optimization techniques Journal Article
In: Measurement Science and Technology, vol. 23, no. 11, pp. 114002, 2012.
@article{chrysostomou2012multi,
title = {Multi-view 3D scene reconstruction using ant colony optimization techniques},
author = {Dimitrios Chrysostomou and Antonios Gasteratos and Lazaros Nalpantidis and Georgios C Sirakoulis},
year = {2012},
date = {2012-01-01},
journal = {Measurement Science and Technology},
volume = {23},
number = {11},
pages = {114002},
publisher = {IOP Publishing},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
43.
Tsoutsouras V, Sirakoulis G C, Pavlos G P, Iliopoulos A C
Simulation of healthy and epileptiform brain activity using cellular automata Journal Article
In: International Journal of Bifurcation and Chaos, vol. 22, no. 09, pp. 1250229, 2012.
@article{tsoutsouras2012simulation,
title = {Simulation of healthy and epileptiform brain activity using cellular automata},
author = {Vassilios Tsoutsouras and Georgios Ch Sirakoulis and Georgios P Pavlos and Aggelos C Iliopoulos},
year = {2012},
date = {2012-01-01},
journal = {International Journal of Bifurcation and Chaos},
volume = {22},
number = {09},
pages = {1250229},
publisher = {World Scientific Publishing Company},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
42.
Sirakoulis G C, Karafyllidis I
Cellular Automata and Power Consumption. Journal Article
In: Journal of Cellular Automata, vol. 7, no. 1, pp. 67–80, 2012.
@article{sirakoulis2012cellular,
title = {Cellular Automata and Power Consumption.},
author = {Georgios Ch Sirakoulis and Ioannis Karafyllidis},
year = {2012},
date = {2012-01-01},
journal = {Journal of Cellular Automata},
volume = {7},
number = {1},
pages = {67--80},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
41.
Tsompanas M I, Sirakoulis G C
Modeling and hardware implementation of an amoeba-like cellular automaton Journal Article
In: Bioinspiration & Biomimetics, vol. 7, no. 3, pp. 036013, 2012.
@article{tsompanas2012modeling,
title = {Modeling and hardware implementation of an amoeba-like cellular automaton},
author = {Michail-Antisthenis I Tsompanas and Georgios Ch Sirakoulis},
year = {2012},
date = {2012-01-01},
journal = {Bioinspiration \& Biomimetics},
volume = {7},
number = {3},
pages = {036013},
publisher = {IOP Publishing},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
40.
Pavlou L, Georgoudas I, Sirakoulis G C, Scordilis E, Andreadis I
An event-driven model simulating fundamental seismic characteristics with the use of cellular automata Journal Article
In: Physics and Chemistry of the Earth, Parts A/B/C, vol. 49, pp. 64–78, 2012.
@article{pavlou2012event,
title = {An event-driven model simulating fundamental seismic characteristics with the use of cellular automata},
author = {L Pavlou and IG Georgoudas and G Ch Sirakoulis and EM Scordilis and I Andreadis},
year = {2012},
date = {2012-01-01},
journal = {Physics and Chemistry of the Earth, Parts A/B/C},
volume = {49},
pages = {64--78},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
39.
Chatziagorakis P, Sirakoulis G Ch, Lygouras J N
Design automation of cellular neural networks for data fusion applications Journal Article
In: Microprocessors and Microsystems, vol. 36, no. 1, pp. 33–44, 2011.
@article{chatziagorakis2012design,
title = {Design automation of cellular neural networks for data fusion applications},
author = {Prodromos Chatziagorakis and Georgios Ch. Sirakoulis and John N Lygouras},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0141933111000913},
doi = {https://doi.org/10.1016/j.micpro.2011.08.001},
year = {2011},
date = {2011-08-16},
urldate = {2012-01-01},
journal = {Microprocessors and Microsystems},
volume = {36},
number = {1},
pages = {33--44},
publisher = {Elsevier},
abstract = {In this study, a novel methodology for the design automation of cellular neural networks (CNNs) for different applications is proposed. In particular, an evolvable algorithm has been developed providing the ability to generate the netlist of the requested CNN in any desired dimension through a very simple procedure, which greatly simplifies the network design process, without the requirement of any relative design knowledge. Furthermore, the user is also granted with control over the selection of the overall function of the network, in order to make it suitable for a variety of data fusion applications. Moreover, the generated netlist can be imported in the SPICE Cad System, resulting in the automated generation of the network schematic, which can be used for the circuit hardware implementation. More specifically, a tutorial 10 × 10 CNN model is generated via the proposed methodology for use in a data fusion and control application. The produced model is tested by its application to a real distributed temperature sensor network for an application involving the attainment and the conservation of the thermal stability of a system. The data transmission is implied through the use of a set of wireless transmitters\textendashreceivers. Finally, a series of experimental results on real world conditions are presented, proving the effectiveness and the robustness of the generated CNN and respectively of the proposed methodology.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this study, a novel methodology for the design automation of cellular neural networks (CNNs) for different applications is proposed. In particular, an evolvable algorithm has been developed providing the ability to generate the netlist of the requested CNN in any desired dimension through a very simple procedure, which greatly simplifies the network design process, without the requirement of any relative design knowledge. Furthermore, the user is also granted with control over the selection of the overall function of the network, in order to make it suitable for a variety of data fusion applications. Moreover, the generated netlist can be imported in the SPICE Cad System, resulting in the automated generation of the network schematic, which can be used for the circuit hardware implementation. More specifically, a tutorial 10 × 10 CNN model is generated via the proposed methodology for use in a data fusion and control application. The produced model is tested by its application to a real distributed temperature sensor network for an application involving the attainment and the conservation of the thermal stability of a system. The data transmission is implied through the use of a set of wireless transmitters–receivers. Finally, a series of experimental results on real world conditions are presented, proving the effectiveness and the robustness of the generated CNN and respectively of the proposed methodology.
38.
Nalpantidis L, Sirakoulis G C, Gasteratos A
Non-probabilistic cellular automata-enhanced stereo vision simultaneous localization and mapping Journal Article
In: Measurement Science and Technology, vol. 22, no. 11, pp. 114027, 2011.
@article{nalpantidis2011non,
title = {Non-probabilistic cellular automata-enhanced stereo vision simultaneous localization and mapping},
author = {Lazaros Nalpantidis and Georgios Ch Sirakoulis and Antonios Gasteratos},
year = {2011},
date = {2011-01-01},
journal = {Measurement Science and Technology},
volume = {22},
number = {11},
pages = {114027},
publisher = {IOP Publishing},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
37.
Georgoudas I G, Sirakoulis G C, Andreadis I T
An anticipative crowd management system preventing clogging in exits during pedestrian evacuation processes Journal Article
In: IEEE Systems Journal, vol. 5, no. 1, pp. 129–141, 2011.
@article{georgoudas2011anticipative,
title = {An anticipative crowd management system preventing clogging in exits during pedestrian evacuation processes},
author = {Ioakeim G Georgoudas and Georgios Ch Sirakoulis and Ioannis Th Andreadis},
year = {2011},
date = {2011-01-01},
journal = {IEEE Systems Journal},
volume = {5},
number = {1},
pages = {129--141},
publisher = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
36.
Ioannidis K, Sirakoulis G C, Andreadis I
Cellular ants: a method to create collision free trajectories for a cooperative robot team Journal Article
In: Robotics and Autonomous Systems, vol. 59, no. 2, pp. 113–127, 2011.
@article{ioannidis2011cellular,
title = {Cellular ants: a method to create collision free trajectories for a cooperative robot team},
author = {Konstantinos Ioannidis and G Ch Sirakoulis and Ioannis Andreadis},
year = {2011},
date = {2011-01-01},
journal = {Robotics and Autonomous Systems},
volume = {59},
number = {2},
pages = {113--127},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
35.
Ioannidis K, Sirakoulis G C, Andreadis I
A path planning method based on cellular automata for cooperative robots Journal Article
In: Applied Artificial Intelligence, vol. 25, <