Interdisciplinární vzdělávání v ICT s jazykovou kompetencí, reg.č.: CZ.1.07/2.2.00/28.0014

Přednáška - 7.11. 2013

přidáno 07.11.2013

Přednáška zahraničního hosta

Ve čtvrtek 7. 11. 2013 ve 14.00 se koná v knihovně Ústavu informatiky přednáška zahraničního hosta: Venkata Padmavathi Metta, téma:Spiking neural P systems with anti-spikes.

Abstrakt:

Spiking Neural P Systems with anti-spikes

Spiking neural P systems (in short, SN P systems) are computational models inspired by the spiking activity of neurons in the brain. An SN P system is represented as a directed graph where nodes correspond to the neurons having spiking and forgetting rules. The rules involve the spikes present in the neuron in the form of occurrences of a symbol a. SN P system operates in a locally sequential and globally maximal manner using a global clock. That is, in each neuron, at each step, if more than one rule is enabled, then only one of them is applied non-deterministically. All neurons fire in parallel at the system level. An SN P system is used as a computing device in various ways - acceptor, transducer and language generator.

Spiking neural P system with anti-spikes (in short, SN PA system) works in the same way as standard SN P system but deals with two types of objects called spikes  and anti-spikes. Because of the use of two types of objects, the system can encode binary digits in a natural way and hence can represent the formal models more efficiently and naturally than the SN P systems. This seminar first introduces these computational models then discusses the use SN PA systems for simulating the different parallel programming language constructs.

In spiking neural P systems with anti-spikes, integers can be represented as number of spikes/anti-spikes present in a neuron. Thus it is possible to represent increment, decrement, relational operations and assignment statements using spiking neural P systems. With these basic structures, it is also possible to represent programming language constructs like conditional construct, iteration construct and different types of execution constructs which are used in parallel programming language.