Investigation of vertical cavity surface emitting laser dynamics for neuromorphic photonic systems

We report an approach based upon vertical cavity surface emitting lasers (VCSELs) to reproduce optically different behaviors exhibited by biological neurons but on a much faster timescale. The technique proposed is based on the polarization switching and nonlinear dynamics induced in a single VCSEL under polarized optical injection. The particular attributes of VCSELs and the simple experimental configuration used in this work offer prospects of fast, reconfigurable processing elements with excellent fan-out and scaling potentials for use in future computational paradigms and artificial neural networks. © 2012 American Institute of Physics

Extended SNP Systems with States

We consider (extended) spiking neural P systems with states, where the applicability of rules in a neuron not only depends on the presence of su ciently many spikes (yet in contrast to the standard de nition, no regular checking sets are used), but also on the current state of the neuron. Moreover, a spiking rule not only sends spikes, but also state information to the connected neurons. We prove that this variant of the original model of extended spiking neural P systems can simulate register machines with only two states, even in the basic non-extended variant

Controllable spiking patterns in long-wavelength VCSELs for neuromorphic photonics systems

Multiple controllable spiking patterns are obtained in a 1310 nm Vertical Cavity Surface Emitting Laser (VCSEL) in response to induced perturbations and for two different cases of polarized optical injection, namely parallel and orthogonal. Achievement of reproducible spiking responses in VCSELs operating at the telecom wavelengths offers great promise for future uses of these devices in ultrafast neuromorphic photonic systems for non-traditional computing applications.Comment: 10 pages, 6 figures, journal submissio

Solving SAT with Antimatter in Membrane Computing

The set of NP-complete problems is split into weakly and strongly NP- complete ones. The di erence consists in the in uence of the encoding scheme of the input. In the case of weakly NP-complete problems, the intractability depends on the encoding scheme, whereas in the case of strongly NP-complete problems the problem is intractable even if all data are encoded in a unary way. The reference for strongly NP-complete problems is the Satis ability Problem (the SAT problem). In this paper, we provide a uniform family of P systems with active membranes which solves SAT { without polarizations, without dissolution, with division for elementary membranes and with matter/antimatter annihilation. To the best of our knowledge, it is the rst solution to a strongly NP-complete problem in this P system model.Ministerio de Economía y Competitividad TIN2012-3743

Some Open Problems Collected During 7th BWMC

A few open problems and research topics collected during the 7th Brain- storming Week on Membrane Computing are briefly presented; further details can be found in the papers included in the volume.Junta de Andalucía P08 – TIC 0420

Proceedings of the Workshop on Membrane Computing, WMC 2016.

yesThis Workshop on Membrane Computing, at the Conference of Unconventional Computation and Natural Computation (UCNC), 12th July 2016, Manchester, UK, is the second event of this type after the Workshop at UCNC 2015 in Auckland, New Zealand*. Following the tradition of the 2015 Workshop the Proceedings are published as technical report. The Workshop consisted of one invited talk and six contributed presentations (three full papers and three extended abstracts) covering a broad spectrum of topics in Membrane Computing, from computational and complexity theory to formal verification, simulation and applications in robotics. All these papers – see below, but the last extended abstract, are included in this volume. The invited talk given by Rudolf Freund, “P SystemsWorking in Set Modes”, presented a general overview on basic topics in the theory of Membrane Computing as well as new developments and future research directions in this area. Radu Nicolescu in “Distributed and Parallel Dynamic Programming Algorithms Modelled on cP Systems” presented an interesting dynamic programming algorithm in a distributed and parallel setting based on P systems enriched with adequate data structure and programming concepts representation. Omar Belingheri, Antonio E. Porreca and Claudio Zandron showed in “P Systems with Hybrid Sets” that P systems with negative multiplicities of objects are less powerful than Turing machines. Artiom Alhazov, Rudolf Freund and Sergiu Ivanov presented in “Extended Spiking Neural P Systems with States” new results regading the newly introduced topic of spiking neural P systems where states are considered. “Selection Criteria for Statistical Model Checker”, by Mehmet E. Bakir and Mike Stannett, presented some early experiments in selecting adequate statistical model checkers for biological systems modelled with P systems. In “Towards Agent-Based Simulation of Kernel P Systems using FLAME and FLAME GPU”, Raluca Lefticaru, Luis F. Macías-Ramos, Ionuţ M. Niculescu, Laurenţiu Mierlă presented some of the advatages of implementing kernel P systems simulations in FLAME. Andrei G. Florea and Cătălin Buiu, in “An Efficient Implementation and Integration of a P Colony Simulator for Swarm Robotics Applications" presented an interesting and efficient implementation based on P colonies for swarms of Kilobot robots. *http://ucnc15.wordpress.fos.auckland.ac.nz/workshop-on-membrane-computingwmc- at-the-conference-on-unconventional-computation-natural-computation

Chaotic Phase Synchronization in Bursting-neuron Models Driven by a Weak Periodic Force

We investigate the entrainment of a neuron model exhibiting a chaotic spiking-bursting behavior in response to a weak periodic force. This model exhibits two types of oscillations with different characteristic time scales, namely, long and short time scales. Several types of phase synchronization are observed, such as 1 : 1 phase locking between a single spike and one period of the force and 1 : l phase locking between the period of slow oscillation underlying bursts and l periods of the force. Moreover, spiking-bursting oscillations with chaotic firing patterns can be synchronized with the periodic force. Such a type of phase synchronization is detected from the position of a set of points on a unit circle, which is determined by the phase of the periodic force at each spiking time. We show that this detection method is effective for a system with multiple time scales. Owing to the existence of both the short and the long time scales, two characteristic phenomena are found around the transition point to chaotic phase synchronization. One phenomenon shows that the average time interval between successive phase slips exhibits a power-law scaling against the driving force strength and that the scaling exponent has an unsmooth dependence on the changes in the driving force strength. The other phenomenon shows that Kuramoto's order parameter before the transition exhibits stepwise behavior as a function of the driving force strength, contrary to the smooth transition in a model with a single time scale