Weighted spiking neural P systems with polarizations and anti-spikes

Liu, Yuping; Zhao, Yuzhen

doi:10.1007/s41965-022-00112-7

Cited by 5 publications

(2 citation statements)

References 67 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SN P systems with delays on synapses were proposed by considering the length of axons [14], where postsynaptic neurons get spikes at different times. By introducing astrocytes, a kind of special cell in neuron systems, the spike transmission in synapses can be controlled [15] [16], and SN P systems with weights have been proposed for multiple connections between two neurons, [17] [18]. We use the weight w to denote w synapses between neurons.…”

Section: E a A D mentioning

confidence: 99%

On the Universality of Spiking Neural P Systems With Multiple Channels and Autapses

Ning,

Yang,

Sun

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Spiking neural P systems (SN P systems) abstract the structure and function of neurons and nervous systems. By adopting some biological observations or mathematical considerations in SN P systems, many variants have been proposed. In this work, through combining two interesting variants, SN P systems with multiple channels (SNP-MC systems) and SN P systems with autapses (SNP-AU systems), we propose SN P systems with multiple channels and autapses (SNP-MCA systems) and research their universality. SNP-MCA systems are proved to be universal in the generation of numbers. For computing functions, a universal SNP-MCA system with 25 neurons is constructed, which requires fewer neurons than the two variants.

show abstract

Section: E a A D mentioning

confidence: 99%

On the Universality of Spiking Neural P Systems With Multiple Channels and Autapses

Ning,

Yang,

Sun

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Membrane computing has been intensively studied. Some of the most recent papers refer to theoretical developments [6][7][8][9][10][11] and applications [12][13][14][15][16]. The possibility of generating exponential space in polynomial (more often linear) time, is a key feature of these models and represents the main element in solving NP-complete problems [17][18][19].…”

Section: Introductionmentioning

confidence: 99%

Breaking RSA Encryption Protocol with Kernel P Systems

Vasile

Gheorghe

Niculescu

2023

Preprint

View full text Add to dashboard Cite

The prime factorisation problem is intractable, i.e., no efficient algorithm is known. In cryptography there are some well-known approaches based on the computational hardness of this problem, including Rivest-Shamir-Adleman (RSA) encryption protocol. Several attemps to break RSA have been investigated, some of them based on the massive parallelism of membrane systems.In this paper a new approach, based on kernel P system formalism, aimed at reassessing the space-time tradeoff, usually involved in membrane computing solutions, is investigated. Two models are introduced and assessed in order to find the potential benefits of each of them for solving the above problem, revealing also their limitations and providing hints for further improvements.

show abstract

On maximal parallel application of rules in rewriting P systems

Zandron

2023

J Membr Comput

View full text Add to dashboard Cite

In rewriting P systems, that is P systems using structured strings instead of atomic symbols, rules can be applied in parallel on all strings, but a single rule at a time can be applied on each string. Nonetheless, parallel application of rules also on each string has been considered in various works. This leads to possible application of rules with conflicting target indications on the same string, and different strategies have been considered to face this problem; relations among different classes of languages generated in this way have been investigated in the literature. We continue the investigation on this subject, by highlighting some relations among different classes of maximally parallel rewriting P systems by means of direct simulations. The advantages of such simulations are highlighted, by showing how theoretical results concerning one such type of systems can immediately be adapted to the corresponding simulating systems.

show abstract

Weighted spiking neural P systems with polarizations and anti-spikes

Cited by 5 publications

References 67 publications

On the Universality of Spiking Neural P Systems With Multiple Channels and Autapses

On the Universality of Spiking Neural P Systems With Multiple Channels and Autapses

Breaking RSA Encryption Protocol with Kernel P Systems

On maximal parallel application of rules in rewriting P systems

Contact Info

Product

Resources

About