|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Spiking neural P systems with neuron division and budding显示文摘Spiking neural P systems are a class of distributed and parallel computing models inspired by spiking neurons.In this work,the features of neuron division and neuron budding are introduced into the framework of spiking neural P systems,which are processes inspired by neural stem cell division. With neuron division and neuron budding,a spiking neural P system can generate exponential work space in polynomial time as the case for P systems with active membranes.In this way,spiking neural P systems can efficiently solve computationally hard problems by means of a space-time tradeoff,which is illustrated with an efficient solution to SAT problem. | PAN LinQiang PAUN Gheorghe PEREZ-JIMENEZ Mario J. | 2011 | Science China(Information Sciences)2011，54，8： | 17 |
| 2 | A new approach based on PSO algorithm to find good computational encoding sequences显示文摘Computational encoding DNA sequence design is one of the most important steps in molecular computation. A lot of research work has been done to design reliable sequence library. A revised method based on the support system developed by Tanaka et al. is proposed here with different criteria to construct fitness function. Then we adapt particle swarm optimization (PSO) algorithm to our encoding problem. By using the new algorithm, a set of sequences with good quality is generated. The result also shows that our PSO-based approach could rapidly converge at the minimum level for an output of the simulation model. The celerity of the algorithm fits our requirements. | Cui Guangzhao Niu Yunyun Wang Yanfeng Zhang Xuncai Pan Linqiang | 2007 | Progress in Natural Science:Materials International2007，17，6： | 11 |
| 3 | Improved taboo search algorithm for designing DNA sequences显示文摘The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improve the method for the systematic design of equal-length DNA sequences, which can satisfy certain combinatorial and thermodynamic constraints. Using taboo search algorithm, our method can avoid trapping into local optimization and can nd a set of good DNA sequences satisfying required constraints. | Kai Zhang Jin Xu Xiutang Geng Jianhua Xiao Linqiang Pan | 2008 | Progress in Natural Science:Materials International2008，18，5： | 8 |
| 4 | Tissue P systems with cell separation: attacking the partition problem显示文摘Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for effciently solving a well-known NP-complete problem, the partition problem. | ZHANG XingYi WANG Shuo NIU YunYun PAN LinQiang | 2011 | Science China(Information Sciences)2011，54，2： | 6 |
| 5 | A global heuristically search algorithm for DNA encoding显示文摘A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed. | Zhang Kai Pan Linqiang Xu Jin | 2007 | Progress in Natural Science:Materials International2007，17，6： | 4 |
| 6 | Small universal simple spiking neural P systems with weights显示文摘Spiking neural P systems with weights(WSN P systems,for short)are a new variant of spiking neural P systems,where the rules of a neuron are enabled when the potential of that neuron equals a given value.It is known that WSN P systems are universal by simulating register machines.However,in these universal systems,no bound is considered on the number of neurons and rules.In this work,a restricted variant of WSN P systems is considered,called simple WSN P systems,where each neuron has only one rule.The complexity parameter,the number of neurons,to construct a universal simple WSN P system is investigated.It is proved that there is a universal simple WSN P system with 48 neurons for computing functions;as generator of sets of numbers,there is an almost simple(that is,each neuron has only one rule except that one neuron has two rules)and universal WSN P system with 45 neurons. | ZENG XiangXiang PAN LinQiang PREZ-JIMNEZ Mario J. | 2014 | Science China(Information Sciences)2014，57，9： | 2 |
| 7 | Universal enzymatic numerical P systems with small number of enzymatic variables显示文摘Numerical P systems(for short, NP systems) are distributed and parallel computing models inspired from the structure of living cells and economics. Enzymatic numerical P systems(for short, ENP systems) are a variant of NP systems, which have been successfully applied in designing and implementing controllers for mobile robots. Since ENP systems were proved to be Turing universal, there has been much work to simplify the universal systems, where the complexity parameters considered are the number of membranes, the degrees of polynomial production functions or the number of variables used in the systems.Yet the number of enzymatic variables, which is essential for ENP systems to reach universality, has not been investigated. Here we consider the problem of searching for the smallest number of enzymatic variables needed for universal ENP systems. We prove that for ENP systems as number acceptors working in the all-parallel or one-parallel mode, one enzymatic variable is sufficient to reach universality; while for the one-parallel ENP systems as number generators, two enzymatic variables are sufficient to reach universality.These results improve the best known results that the numbers of enzymatic variables are 13 and 52 for the all-parallel and one-parallel systems, respectively. | Zhiqiang ZHANG Tingfang WU ANDrei PAUN Linqiang PAN | 2018 | Science China(Information Sciences)2018，61，9： | 2 |
| 8 | A surface based DNA algorithm for the maximal clique problem 显示文摘 | Pan Linqiang Xu Jin Liu Yachun | 2002 | Chinese Journal of Electronics2002，11，4： | 1 |
| 9 | A note on hypertournaments显示文摘It is proved that for given integer k≥2, almost all k-hypertournaments are strong and in almost all k-hypertournaments, every pair of vertices lies on a 3-cycle. | Linqiang Pan Guofei Zhou Kemin Zhang | 1999 | Chinese Science Bulletin1999，44，16： | 1 |
| 10 | Solving multidimensional 0-1knapsack problem by P system with input and active mem-branes显示文摘 | Pan Linqiang Carlos M V | 2005 | Journal of Parallel and Distributed Computing2005，65，12： | 1 |
| 11 | Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design显示文摘DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method. | Xiao Jianhua Xu Jin Geng Xiutang Pan Linqiang | 2007 | Progress in Natural Science:Materials International2007，17，12： | 1 |
| 12 | Structural characterization and bioactivity evaluation of an acidic proteoglycan extract from Ganoderma lucidum fruiting bodies for PTP1B inhibition and anti‐diabetes显示文摘 | Deng Pan Linqiang Wang Bingwen Hu Ping Zhou | 2014 | Biopolymers2014，，6： | 1 |
| 13 | Structure characterization of a novel neutral polysaccharide isolated from Ganoderma Lucidum fruiting bodies显示文摘 | Deng Pan Linqiang Wang Congheng Chen | 2012 | Food Chemistry2012，135，： | 1 |
| 14 | Computational complexity of tissue-like P systems显示文摘 | Linqiang Pan Mario J. Pérez-Jiménez | 2010 | Journal of Complexity2010，，3： | 1 |
| 15 | Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources显示文摘 | Tseren-Onolt Ishdorj Alberto Leporati Linqiang Pan Xiangxiang Zeng Xingyi Zhang | 2010 | Theoretical Computer Science2010，，25： | 1 |
| 16 | Semirigid analysis of extended end plate connections based on correlation and sensitivity显示文摘 | Pan Jianrong Wang Zhan Zheng Linqiang | 2012 | Journal of Shanghai Jiaotong University(Science)2012，17，59： | 1 |
| 17 | Time-free solution to SAT problem using P systems with active membranes显示文摘 | Tao Song Luis F. Macías-Ramos Linqiang Pan Mario J. Pérez-Jiménez | 2013 | Theoretical Computer Science2013，，： | 1 |
| 18 | Solving HPP and SAT by P Systems with Active Membranes and Separation Rules显示文摘 | Linqiang Pan Artiom Alhazov | 2006 | Acta Informatica2006，，2： | 1 |
| 19 | Trading polarizations for labels in P systems with active membranes显示文摘 | Artiom Alhazov Linqiang Pan Gheorghe P?un | 2004 | Acta Informatica2004，，2： | 1 |
| 20 | A surface-based DNA algorithm for the maximal clique problem 显示文摘 | Pan Linqiang Xu Jin Liu Yachun | 2002 | Chinese Journal of Electronics2002，11，4： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员