scholarly journals A Bio-Inspired Model of Picture Array Generating P System with Restricted Insertion Rules

2020 ◽  
Vol 10 (22) ◽  
pp. 8306
Author(s):  
Gexiang Zhang ◽  
G. Samdanielthompson ◽  
N. Gnanamalar David ◽  
Atulya K. Nagar ◽  
K.G. Subramanian
Keyword(s):  
Design Patterns ◽  
Language Theory ◽  
P System ◽  
Generative Power ◽  
Computing Model ◽  
Application Problem ◽  
Finite Set ◽  
Restricted Type ◽  
Year 2000 ◽  
Rewriting Rules

In the bio-inspired area of membrane computing, a novel computing model with a generic name of P system was introduced around the year 2000. Among its several variants, string or array language generating P systems involving rewriting rules have been considered. A new picture array model of array generating P system with a restricted type of picture insertion rules and picture array objects in its regions, is introduced here. The generative power of such a system is investigated by comparing with the generative power of certain related picture array grammar models introduced and studied in two-dimensional picture language theory. It is shown that this new model of array P system can generate picture array languages which cannot be generated by many other array grammar models. The theoretical model developed is for handling the application problem of generation of patterns encoded as picture arrays over a finite set of symbols. As an application, certain floor-design patterns are generated using such an array P system.

scholarly journals Chain Code P System using Cycle Grammar

2019 ◽  
Vol 8 (2) ◽  
pp. 327-330
Keyword(s):  
Distributed Computing ◽  
P System ◽  
Chain Code ◽  
Computing Model ◽  
System A ◽  
Frame Work ◽  
Picture Languages ◽  
String Rewriting ◽  
Rewriting Rules

P system is a bio-inspired distributed computing model to generate string languages [4], arrays [7] and tessellation patterns [2]. Chain Code P System is a string rewriting computing model to generate chain code picture languages in the frame work of P system. A variant of chain code P system is introduced in this paper, namely Cycle Rewriting Chain Code P system, where the string rewriting rules uses cycle grammar to construct cycle picture languages. We consider the problem of constructing chain code picture languages with even number of chains, kites, Von Koch quadric 8 segment like curves and Von Koch-like curves

PUZZLE GRAMMARS AND CONTEXT-FREE ARRAY GRAMMARS

1991 ◽  
Vol 05 (05) ◽  
pp. 663-676 ◽  
Author(s):  
M. NIVAT ◽  
A. SAOUDI ◽  
K. G. SUBRAMANIAN ◽  
R. SIROMONEY ◽  
V. R. DARE
Keyword(s):  
Membership Problem ◽  
Generative Power ◽  
New Model ◽  
Regular Control ◽  
Emptiness Problem ◽  
Np Complete ◽  
Context Free ◽  
Rewriting Rules

We introduce a new model for generating finite, digitized, connected pictures called puzzle grammars and study its generative power by comparison with array grammars. We note how this model generalizes the classical Chomskian grammars and study the effect of direction-independent rewriting rules. We prove that regular control does not increase the power of basic puzzle grammars. We show that for basic and context-free puzzle grammars, the membership problem is NP-complete and the emptiness problem is undecidable.

scholarly journals A Complex Chained P System Based on Evolutionary Mechanism for Image Segmentation

2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Xiyu Liu ◽  
Lin Wang ◽  
Jianhua Qu ◽  
Ning Wang
Keyword(s):  
Image Segmentation ◽  
Real Life ◽  
Membrane System ◽  
Global Search ◽  
P System ◽  
Evolutionary Mechanism ◽  
Modified Particle Swarm Optimization ◽  
Computing Model ◽  
Distributed Parallel Computing ◽  
Clustering Problems

A new clustering membrane system using a complex chained P system (CCP) based on evolutionary mechanism is designed, developed, implemented, and tested. The purpose of CCP is to solve clustering problems. In CCP, two kinds of evolution rules in different chained membranes are used to enhance the global search ability. The first kind of evolution rules using traditional and modified particle swarm optimization (PSO) clustering techniques are used to evolve the objects. Another based on differential evolution (DE) is introduced to further improve the global search ability. The communication rules are adopted to accelerate the convergence and avoid prematurity. Under the control of evolution-communication mechanism, the CCP can effectively search for the optimal partitioning and improve the clustering performance with the help of the distributed parallel computing model. This proposed CCP is compared with four existing PSO clustering approaches on eight real-life datasets to verify the validity. The computational results on tested images also clearly show the effectiveness of CCP in solving image segmentation problems.

scholarly journals Dynamic Threshold Neural P Systems with Multiple Channels and Inhibitory Rules

Processes ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1281
Author(s):  
Xiu Yin ◽  
Xiyu Liu
Keyword(s):  
Neural Networks ◽  
Parallel Computing ◽  
Ion Channels ◽  
Inhibitory Synapses ◽  
Dynamic Threshold ◽  
P System ◽  
Excitatory Synapses ◽  
Multiple Channels ◽  
Computing Model ◽  
Distributed Parallel Computing

In biological neural networks, neurons transmit chemical signals through synapses, and there are multiple ion channels during transmission. Moreover, synapses are divided into inhibitory synapses and excitatory synapses. The firing mechanism of previous spiking neural P (SNP) systems and their variants is basically the same as excitatory synapses, but the function of inhibitory synapses is rarely reflected in these systems. In order to more fully simulate the characteristics of neurons communicating through synapses, this paper proposes a dynamic threshold neural P system with inhibitory rules and multiple channels (DTNP-MCIR systems). DTNP-MCIR systems represent a distributed parallel computing model. We prove that DTNP-MCIR systems are Turing universal as number generating/accepting devices. In addition, we design a small universal DTNP-MCIR system with 73 neurons as function computing devices.

A Novel Membrane Clustering Algorithm Based on Tissue-like P System

2016 ◽  
Vol 2 (2) ◽  
pp. 409
Author(s):  
Yan Huaning ◽  
Xiang Laisheng ◽  
Liu Xiyu ◽  
Xue Jie
Keyword(s):  
Clustering Algorithm ◽  
Membrane Computing ◽  
P System ◽  
Data Sets ◽  
Turing Machines ◽  
Computing Systems ◽  
Swarm Optimization ◽  
Computing Model ◽  
Clustering Quality ◽  
Data Points

<span lang="EN-US">Clustering is a process of partitioning data points into different clusters due to their similarity, as a powerful technique of data mining, clustering is widely used in many fields. Membrane computing is a computing model abstracting from the biological area, </span><span lang="EN-US">these computing systems are proved to be so powerful that they are equivalent with Turing machines. In this paper, a modified inversion particle swarm optimization was proposed, this method and the mutational mechanism of genetics algorithm were used to combine with the tissue-like P system, through these evolutionary algorithms and the P system, the idea of a novel membrane clustering algorithm could come true. Experiments were tested on six data sets, by comparing the clustering quality with the GA-K-means, PSO-K-means and K-means proved the superiority of our method.</span>

scholarly journals Simulating multi-level dynamics of antimicrobial resistance in a membrane computing model

2018 ◽  
Author(s):  
Marcelino Campos ◽  
Rafael Capilla ◽  
Fernando Naya ◽  
Ricardo Futami ◽  
Teresa Coque ◽  
...  
Keyword(s):  
Antibiotic Resistance ◽  
Evolutionary Biology ◽  
Membrane Computing ◽  
Patient Flow ◽  
P System ◽  
Biological Organization ◽  
Computing Model ◽  
Computing Paradigm ◽  
Cross Transmission ◽  
Multi Level

AbstractMembrane Computing is a bio-inspired computing paradigm, whose devices are the so-called membrane systems or P systems. The P system designed in this work reproduces complex biological landscapes in the computer world. It uses nested “membrane-surrounded entities” able to divide, propagate and die, be transferred into other membranes, exchange informative material according to flexible rules, mutate and being selected by external agents. This allows the exploration of hierarchical interactive dynamics resulting from the probabilistic interaction of genes (phenotypes), clones, species, hosts, environments, and antibiotic challenges. Our model facilitates analysis of several aspects of the rules that govern the multi-level evolutionary biology of antibiotic resistance. We examine a number of selected landscapes where we predict the effects of different rates of patient flow from hospital to the community and viceversa, cross-transmission rates between patients with bacterial propagules of different sizes, the proportion of patients treated with antibiotics, antibiotics and dosing in opening spaces in the microbiota where resistant phenotypes multiply. We can also evaluate the selective strength of some drugs and the influence of the time-0 resistance composition of the species and bacterial clones in the evolution of resistance phenotypes. In summary, we provide case studies analyzing the hierarchical dynamics of antibiotic resistance using a novel computing model with reciprocity within and between levels of biological organization, a type of approach that may be expanded in the multi-level analysis of complex microbial landscapes.

ON THE AMBIGUITY OF INSERTION SYSTEMS

2011 ◽  
Vol 22 (07) ◽  
pp. 1747-1758
Author(s):  
LAKSHMANAN KUPPUSAMY ◽  
ANAND MAHENDRAN ◽  
KAMALA KRITHIVASAN
Keyword(s):  
Rna Editing ◽  
Formal Language ◽  
Formal Language Theory ◽  
Language Theory ◽  
Gene Insertion ◽  
Computing Model ◽  
Insertion And Deletion ◽  
Dna Processing

Gene insertion and deletion are the operations that occur commonly in DNA processing and RNA editing. Based on these evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. In this paper, we study about the ambiguity issues of insertion systems. First, we define six levels of ambiguity for insertion systems based on the components used in the derivation such as axiom, contexts and strings. Next, we show that there are inherently i-ambiguous insertion languages which are j-unambiguous for the combinations (i, j) ∈ {(5,0), (5,4), (4,3), (4,2), (3,1),(2,1), (1,0), (0,1)}. Finally, we prove an important result that the ambiguity problem of insertion systems is undecidable.

scholarly journals An Improved Eclat Algorithm Based on Tissue-Like P System with Active Membranes

Processes ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 555
Author(s):  
Linlin Jia ◽  
Laisheng Xiang ◽  
Xiyu Liu
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Experimental Results ◽  
Frequent Pattern ◽  
P System ◽  
Vertical Data ◽  
Active Membranes ◽  
Pruning Strategy ◽  
Mining Algorithms ◽  
Rewriting Rules

The Eclat algorithm is a typical frequent pattern mining algorithm using vertical data. This study proposes an improved Eclat algorithm called ETPAM, based on the tissue-like P system with active membranes. The active membranes are used to run evolution rules, i.e., object rewriting rules, in parallel. Moreover, ETPAM utilizes subsume indices and an early pruning strategy to reduce the number of frequent pattern candidates and subsumes. The time complexity of ETPAM is decreased from O(t2) to O(t) as compared with the original Eclat algorithm through the parallelism of the P system. The experimental results using two databases indicate that ETPAM performs very well in mining frequent patterns, and the experimental results using four databases prove that ETPAM is computationally very efficient as compared with three other existing frequent pattern mining algorithms.

scholarly journals Parallel Communicating String - Graph P System

2011 ◽  
Vol 10 (2) ◽  
pp. 63-74
Author(s):  
Meena Parvathy Sankar ◽  
N.G. David
Keyword(s):  
P Systems ◽  
P System ◽  
Generative Power ◽  
Grammar System ◽  
Graph Language ◽  
String Graph ◽  
Language L ◽  
Grammar Systems ◽  
Parallel Communicating Grammar Systems

The concept of parallel communicating grammar systems generating string languages is extended to string-graph P systems and their generative power is studied. It is also established that for every language L generated by a parallel communicating grammar system there exists an equivalent parallel communicating string-graph P system generating the string-graph language corresponding to L.

Sign in / Sign up

Export Citation Format

Share Document