scholarly journals Delayed Spiking Neural P Systems with Scheduled Rules

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Qianqian Ren ◽  
Xiyu Liu

Due to the inevitable delay phenomenon in the process of signal conversion and transmission, time delay is bound to occur between neurons. Therefore, it is necessary to introduce the concept of time delay into the membrane computing models. Spiking neural P systems (SN P systems), as an attractive type of neural-like P systems in membrane computing, are widely followed. Inspired by the phenomenon of time delay, in our work, a new variant of spiking neural P systems called delayed spiking neural P systems (DSN P systems) is proposed. Compared with normal spiking neural P systems, the proposed systems achieve time control by setting the schedule on spiking rules and forgetting rules, and the schedule is also used to realize the system delay. A schedule indicates the time difference between receiving and outputting spikes, and it also makes the system work in a certain time, which means that a rule can only be used within a specified time range. We specify that each rule is performed only in the continuous schedule, during which the neuron is locked and cannot send or receive spikes. If the neuron is not available at a given time, it will not receive or send spikes due to the lack of a schedule for this period of time. Moreover, the universality of DSN P systems in both generating and accepting modes is proved. And a universal DSN P system having 81 neurons for computing functions is also proved.

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Haina Rong ◽  
Kang Yi ◽  
Gexiang Zhang ◽  
Jianping Dong ◽  
Prithwineel Paul ◽  
...  

As an important variant of membrane computing models, fuzzy reasoning spiking neural P systems (FRSN P systems) were introduced to build a link between P systems and fault diagnosis applications. An FRSN P system offers an intuitive illustration based on a strictly mathematical expression, a good fault-tolerant capacity, a good description for the relationships between protective devices and faults, and an understandable diagnosis model-building process. However, the implementation of FRSN P systems is still at a manual process, which is a time-consuming and hard labor work, especially impossible to perform on large-scale complex power systems. This manual process seriously limits the use of FRSN P systems to diagnose faults in large-scale complex power systems and has always been a challenging and ongoing task for many years. In this work we develop an automatic implementation method for automatically fulfilling the hard task, named membrane computing fault diagnosis (MCFD) method. This is a very significant attempt in the development of FRSN P systems and even of the membrane computing applications. MCFD is realized by automating input and output, and diagnosis processes consists of network topology analysis, suspicious fault component analysis, construction of FRSN P systems for suspicious fault components, and fuzzy inference. Also, the feasibility of the FRSN P system is verified on the IEEE14, IEEE 39, and IEEE 118 node systems.


2018 ◽  
Vol 28 (08) ◽  
pp. 1850013 ◽  
Author(s):  
Tingfang Wu ◽  
Florin-Daniel Bîlbîe ◽  
Andrei Păun ◽  
Linqiang Pan ◽  
Ferrante Neri

Spiking neural P systems are a class of third generation neural networks belonging to the framework of membrane computing. Spiking neural P systems with communication on request (SNQ P systems) are a type of spiking neural P system where the spikes are requested from neighboring neurons. SNQ P systems have previously been proved to be universal (computationally equivalent to Turing machines) when two types of spikes are considered. This paper studies a simplified version of SNQ P systems, i.e. SNQ P systems with one type of spike. It is proved that one type of spike is enough to guarantee the Turing universality of SNQ P systems. Theoretical results are shown in the cases of the SNQ P system used in both generating and accepting modes. Furthermore, the influence of the number of unbounded neurons (the number of spikes in a neuron is not bounded) on the computation power of SNQ P systems with one type of spike is investigated. It is found that SNQ P systems functioning as number generating devices with one type of spike and four unbounded neurons are Turing universal.


Processes ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 549
Author(s):  
Xiu Yin ◽  
Xiyu Liu ◽  
Minghe Sun ◽  
Qianqian Ren

A novel variant of NSN P systems, called numerical spiking neural P systems with a variable consumption strategy (NSNVC P systems), is proposed. Like the spiking rules consuming spikes in spiking neural P systems, NSNVC P systems introduce a variable consumption strategy by modifying the form of the production functions used in NSN P systems. Similar to the delay feature of the spiking rules, NSNVC P systems introduce a postponement feature into the production functions. The execution of the production functions in NSNVC P systems is controlled by two, i.e., polarization and threshold, conditions. Multiple synaptic channels are used to transmit the charges and the production values in NSNVC P systems. The proposed NSNVC P systems are a type of distributed parallel computing models with a directed graphical structure. The Turing universality of the proposed NSNVC P systems is proved as number generating/accepting devices. Detailed descriptions are provided for NSNVC P systems as number generating/accepting devices. In addition, a universal NSNVC P system with 66 neurons is constructed as a function computing device.


Processes ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1132
Author(s):  
Deting Kong ◽  
Yuan Wang ◽  
Xinyan Wu ◽  
Xiyu Liu ◽  
Jianhua Qu ◽  
...  

In this paper, we propose a novel clustering approach based on P systems and grid- density strategy. We present grid-density based approach for clustering high dimensional data, which first projects the data patterns on a two-dimensional space to overcome the curse of dimensionality problem. Then, through meshing the plane with grid lines and deleting sparse grids, clusters are found out. In particular, we present weighted spiking neural P systems with anti-spikes and astrocyte (WSNPA2 in short) to implement grid-density based approach in parallel. Each neuron in weighted SN P system contains a spike, which can be expressed by a computable real number. Spikes and anti-spikes are inspired by neurons communicating through excitatory and inhibitory impulses. Astrocytes have excitatory and inhibitory influence on synapses. Experimental results on multiple real-world datasets demonstrate the effectiveness and efficiency of our approach.


2012 ◽  
Vol 505 ◽  
pp. 378-385 ◽  
Author(s):  
Xian Wu Peng ◽  
Xiao Ping Fan ◽  
Jian Xun Liu

Spiking neural P systems are a class of distributed and parallel computing models inspired by P systems and spiking neural networks.Spiking neural P system with anti-spikes can encode the balanced ternary three digits in a natural way using three states called anti-spikes, no-input and spikes. In this paper we use this variant of SN P system to simulate universal balanced ternary logic gates including AND,OR and NOT gate and to perform some basic balanced ternary arithmetic operations like addition and subtraction on balanced ternary integers. This paper provides an applicational answer to an open problem formulated by L.Pan and Gh. Păun.


2020 ◽  
Vol 30 (10) ◽  
pp. 2050008 ◽  
Author(s):  
Hong Peng ◽  
Zeqiong Lv ◽  
Bo Li ◽  
Xiaohui Luo ◽  
Jun Wang ◽  
...  

This paper proposes a new variant of spiking neural P systems (in short, SNP systems), nonlinear spiking neural P systems (in short, NSNP systems). In NSNP systems, the state of each neuron is denoted by a real number, and a real configuration vector is used to characterize the state of the whole system. A new type of spiking rules, nonlinear spiking rules, is introduced to handle the neuron’s firing, where the consumed and generated amounts of spikes are often expressed by the nonlinear functions of the state of the neuron. NSNP systems are a class of distributed parallel and nondeterministic computing systems. The computational power of NSNP systems is discussed. Specifically, it is proved that NSNP systems as number-generating/accepting devices are Turing-universal. Moreover, we establish two small universal NSNP systems for function computing and number generator, containing 117 neurons and 164 neurons, respectively.


2007 ◽  
Vol 18 (03) ◽  
pp. 435-455 ◽  
Author(s):  
GHEORGHE PĂUN ◽  
MARIO J. PÉREZ-JIMÉNEZ ◽  
ARTO SALOMAA

Spiking neural P systems were introduced in the end of the year 2005, in the aim of incorporating in membrane computing the idea of working with unique objects ("spikes"), encoding the information in the time elapsed between consecutive spikes sent from a cell/neuron to another cell/neuron. More than one dozen of papers where written in the meantime, clarifying many of the basic properties of these devices, especially related to their computing power. The present paper quickly surveys the basic ideas and the basic results, presenting a complete to-date bibliography, and also giving a completing result related to the normal forms possible for spiking neural P systems: we prove that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness. A series of research topics and open problems are formulated.


2018 ◽  
Vol 29 (5) ◽  
pp. 663-680 ◽  
Author(s):  
YUEGUO LUO ◽  
HAIJUN TAN ◽  
YING ZHANG ◽  
YUN JIANG

P systems with active membranes are a class of bioinspired computing models, where the rules are used in the non-deterministic maximally parallel manner. In this paper, first, a new variant of timed P systems with active membranes is proposed, where the application of rules can be regulated by promoters with only two polarizations. Next, we prove that any Turing computable set of numbers can be generated by such a P system in the time-free way. Moreover, we construct a uniform solution to the$\mathcal{SAT}$problem in the framework of such recognizer timed P systems in polynomial time, and the feasibility and effectiveness of the proposed system is demonstrated by an instance. Compared with the existing methods, the P systems constructed in our work require fewer necessary resources and RS-steps, which show that the solution is effective toNP-complete problem.


Author(s):  
Tao Wang ◽  
Gexiang Zhang ◽  
Mario J. Pérez-Jiménez

<p>Fuzzy membrane computing is a newly developed and promising research direction in the area of membrane computing that aims at exploring the complex in- teraction between membrane computing and fuzzy theory. This paper provides a comprehensive survey of theoretical developments and various applications of fuzzy membrane computing, and sketches future research lines. The theoretical develop- ments are reviewed from the aspects of uncertainty processing in P systems, fuzzifica- tion of P systems and fuzzy knowledge representation and reasoning. The applications of fuzzy membrane computing are mainly focused on fuzzy knowledge representation and fault diagnosis. An overview of different types of fuzzy P systems, differences between spiking neural P systems and fuzzy reasoning spiking neural P systems and newly obtained results on these P systems are presented.</p>


Sign in / Sign up

Export Citation Format

Share Document