19 results on '"Linqiang Pan"'
Search Results
2. On String Languages Generated by Sequential Numerical P Systems
- Author
-
Tingfang Wu, Linqiang Pan, and Zhiqiang Zhang
- Subjects
Empty string ,Algebra and Number Theory ,Programming language ,Computer science ,Null-terminated string ,Object language ,String (computer science) ,String interpolation ,0102 computer and information sciences ,computer.software_genre ,01 natural sciences ,010305 fluids & plasmas ,Theoretical Computer Science ,Language primitive ,Computational Theory and Mathematics ,String operations ,010201 computation theory & mathematics ,0103 physical sciences ,Formal language ,computer ,Information Systems - Published
- 2016
3. On the Universality of Colored One-Catalyst P Systems
- Author
-
Gheorghe Paun, Linqiang Pan, Tingfang Wu, and Zhiqiang Zhang
- Subjects
Discrete mathematics ,Algebra and Number Theory ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Theoretical Computer Science ,Universality (dynamical systems) ,Catalysis ,Computational Theory and Mathematics ,Colored ,010201 computation theory & mathematics ,0202 electrical engineering, electronic engineering, information engineering ,Turing universality ,020201 artificial intelligence & image processing ,Membrane computing ,P system ,Information Systems ,Mathematics - Abstract
A control strategy on the computations in a one-catalyst P system is provided: the rules are assumed "colored" and in each step only rules of the same "color" are used. Such control leads to Turing universality for one-catalyst P systems with one membrane. Turing universality is also reached for purely catalytic P systems with two catalysts, and for purely catalytic P systems with only one catalyst and cooperating rules working in the so-called terminal mode.
- Published
- 2016
4. Preface
- Author
-
Linqiang Pan, Mario de Jesús Pérez Jiménez, and Gexiang Zhang
- Subjects
Algebra and Number Theory ,Computational Theory and Mathematics ,business.industry ,Artificial intelligence ,Bio-inspired computing ,business ,Information Systems ,Theoretical Computer Science - Published
- 2019
5. A P_Lingua Based Simulator for P Systems with Symport/Antiport Rules
- Author
-
Mario J. Pérez-Jiménez, Linqiang Pan, Tao Song, Luis F. Macías-Ramos, Luis Valencia-Cabrera, and Bosheng Song
- Subjects
Algebra and Number Theory ,Theoretical computer science ,Computation ,Workspace ,Division (mathematics) ,Theoretical Computer Science ,Computational Theory and Mathematics ,Membrane fission ,Bio-inspired computing ,Time complexity ,Membrane computing ,Simulation ,P system ,Information Systems ,Mathematics - Abstract
Inspired by mitosis process and membrane fission processes, cell-like P systems with symport/antiport rules and membrane division rules or membrane separation rules have been introduced, respectively. These computation systems have two key features: the ability to have infinite copies of some objects (within an active environment) and to generate an exponential workspace in polynomial time. In this work, we extend the P-Lingua framework for simulating that kind of P systems taking into account these two features. Consequently, a new simulator has been developed and included in pLinguaCore library. The functioning of the simulator has been checked by simulating efficient solutions to SAT problem using a family of cell-like P systems with symport/antiport rules and membrane division rules or membrane separation rules. The corresponding MeCoSim based application is also provided. ∗Address for correspondence: Huazhong University of Science and Technology, Wuhan 430074, Hubei, China. Received February 2015; revised April 2015. 212 L.F. Macias-Ramos et al. / P–Lingua Simulator for P Systems with Symport/Antiport Rules
- Published
- 2015
6. Extending Simulation of Asynchronous Spiking Neural P Systems in P–Lingua
- Author
-
Linqiang Pan, Luis F. Macías-Ramos, Mario J. Pérez-Jiménez, and Tao Song
- Subjects
Class (computer programming) ,Algebra and Number Theory ,Parsing ,Theoretical computer science ,Computer science ,Structure (category theory) ,Parallel computing ,computer.software_genre ,Synchronization ,Theoretical Computer Science ,Computational Theory and Mathematics ,Cover (topology) ,Asynchronous communication ,Membrane computing ,computer ,Information Systems - Abstract
Spiking neural P systems (SN P systems for short) are a class of neural-like computing models in the framework of membrane computing. Inspired by the neurophysiological structure of the brain, SN P systems have been extended in various ways. PLingua is a standard language for the definition of P systems, where pLinguaCore library provides particular implementations of parsers and simulators for the models specified in PLingua. A support for simulating SN P systems in PLingua was introduced recently and soon expanded to cover further features of these systems. In this paper, we present an extension of PLingua related to asynchronous SN P systems, in order to incorporate simulation capabilities for limited asynchronous SN P systems and asynchronous SN P systems with local synchronization.
- Published
- 2015
7. Weighted Spiking Neural P Systems with Rules on Synapses
- Author
-
Xingyi Zhang, Xiangxiaing Zeng, and Linqiang Pan
- Subjects
Algebra and Number Theory ,Computer science ,business.industry ,New variant ,Topology ,Theoretical Computer Science ,Synapse ,medicine.anatomical_structure ,Computational Theory and Mathematics ,Feature (machine learning) ,medicine ,Neuron ,Artificial intelligence ,business ,Membrane computing ,Finite set ,Information Systems - Abstract
Spiking neural P systems (SN P systems, for short) with rules on synapses are a new variant of SN P systems, where the spiking and forgetting rules are placed on synapses instead of in neurons. Recent studies illustrated that this variant of SN P systems is universal working in the way that the synapses starting from the same neuron work in parallel (i.e., all synapses starting from the same neuron should apply their rules if they have rules to be applied). In this work, we consider SN P systems with rules on synapses working in another way: the synapses starting from the same neuron are restricted to work in a sequential way (i.e., at each step at most one synapse starting from the same neuron applies its rule). It is proved that the computational power of SN P systems with rules on synapses working in this way is reduced; specifically, they can only generate finite sets of numbers. Such SN P systems with rules on synapses are proved to be universal, if synapses are allowed to have weight at most 2 (if a rule which can generate n spikes is applied on a synapse with weight k, then the neuron linking to this synapse will receive totally nk spikes). Two small universal SN P systems with rules on synapses for computing functions are also constructed: a universal system with 26 neurons when using extended rules and each synapse having weight at most 2, and a universal system with 26 neurons when using standard rules and each synapse having weight at most 12. These results illustrate that the weight is an important feature for the computational power of SN P systems.
- Published
- 2014
8. Limited Asynchronous Spiking Neural P Systems
- Author
-
Linqiang Pan, Jun Wang, and Hendrik Jan Hoogeboom
- Subjects
Algebra and Number Theory ,Computer science ,Computation ,Mode (statistics) ,Interval (mathematics) ,Theoretical Computer Science ,Power (physics) ,Computational Theory and Mathematics ,Asynchronous communication ,Bounded function ,Algorithm ,Membrane computing ,P system ,Information Systems - Abstract
In a biological system, if a long enough time interval is given, an enabled chemical reaction will finish its reaction in the given time interval. With this motivation, it is natural to impose a bound on the time interval when an enabled spiking rule in a spiking neural P system (SN P system, for short) remains unused. In this work, a new working mode of SN P systems is defined, which is called limited asynchronous mode. In an SN P system working in limited asynchronous mode, if a rule is enabled at some step, this rule is not obligatorily used. From this step on, if the unused rule may be used later, it should be used in the given time interval. If further spikes make the rule non-applicable, then the computation continues in the new circumstances. The computation result of a computation in an SN P system working in limited asynchronous mode is defined as the total number of spikes sent into the environment by the system. It is proved that limited asynchronous SN P systems with standard spiking rules are universal. If the number of spikes present in each neuron of a limited asynchronous SN P system with standard spiking rules is bounded during a computation, then the power of a limited asynchronous SN P system with standard spiking rules falls drastically, and we get a characterization of semilinear sets of numbers.
- Published
- 2011
9. A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem
- Author
-
Mario J. Pérez-Jiménez, Miquel Rius Font, Linqiang Pan, Yunyun Niu, Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial, Universidad de Sevilla. TIC193: Computación Natural, Ministerio de Educación y Ciencia (MEC). España, and Junta de Andalucía
- Subjects
Algebra and Number Theory ,Theoretical computer science ,Cell division ,Matching (graph theory) ,Open problem ,Membrane Computing ,Topology ,Theoretical Computer Science ,Exponential function ,Computational Theory and Mathematics ,Tissue P Systems ,Tripartite Matching Problem ,Time complexity ,Membrane computing ,P system ,Information Systems ,Mathematics - Abstract
A tissue P system with cell division is a computing model which has two basic features: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. In this work we present an efficient solution to the tripartite matching problem by a family of such devices. This solution leads to an interesting open problem whether tissue P systems with cell division and communication rules of length 2 can solve NP-complete problems. An answer to this open problem will provide a borderline between efficiency and non-efficiency in terms of the lengths of communication rules Ministerio de Educación y Ciencia TIN2009-13192 Junta de Andalucía P08-TIC-04200
- Published
- 2011
10. Homogeneous Spiking Neural P Systems
- Author
-
Xingyi Zhang, Xiangxiang Zeng, and Linqiang Pan
- Subjects
Spiking neural network ,Algebra and Number Theory ,Theoretical computer science ,Quantitative Biology::Neurons and Cognition ,Computer science ,Computer Science::Neural and Evolutionary Computation ,Topology ,Random neural network ,Theoretical Computer Science ,Universality (dynamical systems) ,symbols.namesake ,Computer Science::Emerging Technologies ,Computational Theory and Mathematics ,Turing completeness ,CoDi ,symbols ,Membrane computing ,P system ,Information Systems ,Register machine - Abstract
Spiking neural P systems are a class of distributed parallel computing models inspired from the way the neurons communicate with each other by means of electrical impulses (called "spikes"). In this paper, we consider a restricted variant of spiking neural P systems, called homogeneous spiking neural P systems, where each neuron has the same set of rules. The universality of homogeneous spiking neural P systems is investigated. One of universality results is that it is sufficient for homogeneous spiking neural P system to have only one neuron that behaves nondeterministically in order to achieve Turing completeness.
- Published
- 2009
11. Preface
- Author
-
Linqiang Pan, Gheorghe Păun, and Mario J. Pérez-Jiménez
- Subjects
Algebra and Number Theory ,Computational Theory and Mathematics ,Information Systems ,Theoretical Computer Science - Published
- 2015
12. On String Languages Generated by Sequential Numerical P Systems.
- Author
-
Zhiqiang Zhang, Tingfang Wu, and Linqiang Pan
- Subjects
COMPUTER simulation ,SEQUENTIAL circuits ,PROGRAMMING languages ,RECURSIVELY enumerable sets ,FORMAL languages - Abstract
Numerical P systems are a class of P systems inspired both from the structure of living cells and from economics. In this work, we further investigate the generative capacity of numerical P systems as language generators. The families of languages generated by non-enzymatic, by enzymatic, and by purely enzymatic (all programs are enzymatic) numerical P systems working in the sequential mode are compared with the language families in the Chomsky hierarchy. Especially, a characterization of recursively enumerable languages is obtained by using purely enzymatic numerical P systems working in the sequential mode. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
13. On the Universality of Colored One-Catalyst P Systems.
- Author
-
Tingfang Wu, Zhiqiang Zhang, Păun, Gheorghe, and Linqiang Pan
- Subjects
TURING machines ,MACHINE theory ,MATHEMATICAL research ,CATALYSTS ,COMPUTER science research - Abstract
A control strategy on the computations in a one-catalyst P system is provided: the rules are assumed "colored" and in each step only rules of the same "color" are used. Such control leads to Turing universality for one-catalyst P systems with one membrane. Turing universality is also reached for purely catalytic P systems with two catalysts, and for purely catalytic P systems with only one catalyst and cooperating rules working in the so-called terminal mode. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
14. Tissue P Systems with Protein on Cells.
- Author
-
Bosheng Song, Linqiang Pan, and Pérez-Jiménez, Mario J.
- Subjects
- *
PARALLEL computers , *DISTRIBUTED computing , *TISSUE analysis , *MEMBRANE proteins , *CELL membranes , *CELL division - Abstract
Tissue P systems are a class of distributed parallel computing devices inspired by biochemical interactions between cells in a tissue-like arrangement, where objects can be exchanged by means of communication channels. In this work, inspired by the biological facts that the movement of most objects through communication channels is controlled by proteins and proteins can move through lipid bilayers between cells (if these cells are fused), we present a new class of variant tissue P systems, called tissue P systems with protein on cells, where multisets of objects (maybe empty), together with proteins between cells are exchanged. The computational power of such P systems is studied. Specifically, an efficient (uniform) solution to the SAT problem by using such P systems with cell division is presented. We also prove that any Turing computable set of numbers can be generated by a tissue P system with protein on cells. Both of these two results are obtained by such P systems with communication rules of length at most 4 (the length of a communication rule is the total number of objects and proteins involved in that rule). [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
15. A P-Lingua Based Simulator for P Systems with Symport/Antiport Rules.
- Author
-
Macías-Ramos, Luis F., Valencia-Cabrera, Luis, Bosheng Song, Tao Song, Linqiang Pan, and Pérez-Jiménez, Mario J.
- Subjects
MITOSIS ,MEMBRANE separation ,INFINITY (Mathematics) ,POLYNOMIAL time algorithms ,COMPUTER simulation - Abstract
Inspired by mitosis process and membrane fission processes, cell-like P systems with symport/antiport rules and membrane division rules or membrane separation rules have been introduced, respectively. These computation systems have two key features: the ability to have infinite copies of some objects (within an active environment) and to generate an exponential workspace in polynomial time. In this work, we extend the P-Lingua framework for simulating that kind of P systems taking into account these two features. Consequently, a new simulator has been developed and included in pLinguaCore library. The functioning of the simulator has been checked by simulating efficient solutions to SAT problem using a family of cell-like P systems with symport/antiport rules and membrane division rules or membrane separation rules. The corresponding MeCoSim based application is also provided. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
16. Homogeneous Spiking Neural P Systems.
- Author
-
Xiangxiang Zeng, Xingyi Zhang, and Linqiang Pan
- Subjects
TURING (Computer program language) ,NEURAL computers ,PARALLEL computers ,COMPUTER simulation ,TURING test - Abstract
Spiking neural P systems are a class of distributed parallel computing models inspired from the way the neurons communicate with each other by means of electrical impulses (called "spikes"). In this paper, we consider a restricted variant of spiking neural P systems, called homogeneous spiking neural P systems, where each neuron has the same set of rules. The universality of homogeneous spiking neural P systems is investigated. One of universality results is that it is sufficient for homogeneous spiking neural P system to have only one neuron that behaves nondeterministically in order to achieve Turing completeness. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
17. Smaller Universal Spiking Neural P Systems.
- Author
-
Xingyi Zhang, Xiangxiang Zeng, and Linqiang Pan
- Subjects
ARTIFICIAL neural networks ,COMPUTER systems ,NEURONS ,CARDINAL numbers ,ARTIFICIAL intelligence - Abstract
The problem of finding small universal spiking neural P systems was recently investigated by Andrei Păun and Gheorghe Păun, for spiking neural P systems used as devices computing functions and as devices generating sets of numbers. For the first case, a universal spiking neural P system was produced by using 84 neurons for standard rules and using 49 neurons for extended rules. For spiking neural P systems used as generators of sets of numbers, a universal system with standard rules having 76 neurons, and one with extended rules having 50 neurons were obtained. In this paper, we continue the study of small universal spiking neural P systems and we improve in the number of neurons as follows. The small universal spiking neural P systems use 67 neurons for standard rules and 41 neurons for extended rules in the case of computing functions, and 63 neurons for standard rules and 41 neurons for extended rules in the case of generating sets of numbers. [ABSTRACT FROM AUTHOR]
- Published
- 2008
18. Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes.
- Author
-
Alhazov, Artiom, Linqiang Pan, and Martín-Vide, Carlos
- Subjects
- *
MOLECULAR computers , *PARALLEL computers , *COMPUTERS , *LINEAR systems , *CELL membranes - Abstract
P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures. Recently, Petr Sosík has shown that a semi-uniform family of P systems with active membranes and 2-division is able to solve the PSPACE-complete problem QBF-SAT in linear time; he has also conjectured that the membrane dissolving rules of the (d) type may be omitted, but probably not the (f) type rules for non-elementary membrane division. In this paper, we partially confirm the conjecture proving that dissolving rules are not necessary. Moreover, the construction is now uniform. It still remains open whether or not non-elementary membrane division is needed. [ABSTRACT FROM AUTHOR]
- Published
- 2003
19. Bio-Inspired Computing: Theories and Applications (BIC-TA 2017).
- Author
-
Linqiang Pan, Pérez-Jiménez, Mario J., and Gexiang Zhang
- Subjects
- *
BIOLOGICALLY inspired computing , *NATURAL computation , *EVOLUTIONARY computation , *COMPUTER algorithms , *PROBLEM solving - Published
- 2019
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.