P系统运算操作若干问题.pptxVIP

基于膜系统的运算模型公开问题;目 录;;;好的类细胞P系统;对象越少越好 自然编码 位置编码 非位置编码 混合编码 [1，2];Decimal;;规则类型[11];膜结构越简单越好 膜的数量 膜的嵌套 膜的标号 ……;问题 嵌套与并列的实现代价比较 标号、极性、厚度那种更合适（代价小）;;;膜间信息交换越少越好 溶解 通信 复制 分裂 ……;问题 信息交流量 通信开销 评估模型;进化算法实现的问题 ;膜计算提供了一种计算思想 计算=工具+方法 手工计算=石子+计数 机械计算=齿轮+计数转换 冯式计算=电子计算机+算法 DNA计算=DNA链溶液+生化操作 膜 计 算=膜物质（对象）+规则;遗传算法;遗传算法的P系统实现;蚁群算法;蚁群算法的P系统实现;参考文献;Song, T., Pan, L.Q., A normal form of spiking neural P systems with structural lasticity. Int. J. of Swarm Intelligence, 1(4), p.344-357, 2015. Pˇ aun, G., Suzuki, Y., Tanaka, H., On the power of membrane division in P systems. The- oretical Computer Science, 324(1), p.61-85, 2004. Xingyi Zhang, Yanjun Liu, Bin Luo，Computational power of tissue P systems for generating control languages. Information Sciences, 2014, 278(10)：285-297. Pˇ aun, G.,膜计算导论, 华中科技大学出版社，2012. 潘林强等译. Artiom Alhazov, Sergey Verlan, Minimization strategies for maximally parallel multiset rewriting systems, Theoretical Computer Science, vol. 412, no. 17, pp. 1581-1591, 2011. Luis Valencia-Cabrera, Bosheng Song, Luis F. Macias-Ramos, Linqiang Pan, Agustin Riscos-Nunez, and Mario J. Perez-Jimenez, Minimal Cooperation in P Systems with Symport/Antiport: A Complexity Approach, Proceedings of the 13th Brainstorming Week on Membrane Computing, 2015. L.Q. Pan and A. Alhazov, Solving HPP and SAT by P systems with active membranes and separation rules, Acta Informatica, Vol.43, No.2, pp. 131-145, 2006. Z. Gazdag, G. Kolonits, A new approach for solving SAT by p systems with active membranes, Proc. of the Thirteenth International Conference on Membrane Computing, pp. 211-220, 2012. Ping Guo, Jian Zhu, Mingqiang Zhou, A Family of Uniform P Systems for All-Satisfiability Problem, Journal of Computational and Theoretical Nanoscience, Accepted.;Michael J. Dinneen,· Yun-Bum Kim,·Radu Nicolescu, Faster synchronization in P systems, Nat Comput (2012) 11:107–115. Gabriel Ciobanu, Linqiang Pan, Gheorghe P?un, Mario J. Pérez-Jiménez, P systems with minimal parallelism, Theoretic Compu