Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2012, Article ID 415242, 17 pages
http://dx.doi.org/10.1155/2012/415242
Research Article

Communication P Systems on Simplicial Complexes with Applications in Cluster Analysis

School of Management Science and Engineering, Shandong Normal University, Jinan 250014, China

Received 14 February 2012; Revised 16 April 2012; Accepted 17 April 2012

Academic Editor: M. De la Sen

Copyright © 2012 Xiyu Liu and Alice Xue. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. Păun, G. Rozenberg, and A. Salomaa, Membrane Computing, Oxford University Press, New York, NY, USA, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. L. M. Adleman, “Molecular computation of solutions to combinatorial problems,” Science, vol. 266, no. 5187, pp. 1021–1024, 1994. View at Publisher · View at Google Scholar · View at Scopus
  3. R. J. Lipton, “DNA solution of hard computational problems,” Science, vol. 268, no. 5210, pp. 542–545, 1995. View at Publisher · View at Google Scholar · View at Scopus
  4. G. Păun, G. Rozenberg, and A. Salomaa, DNA Computing, New Computing Paradigms, Springer, Berlin, Germany, 2010.
  5. T.-O. Ishdorj, A. Leporati, L. Pan, X. Zeng, and X. Zhang, “Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources,” Theoretical Computer Science, vol. 411, no. 25, pp. 2345–2358, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. P. Linqiang 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. P. Linqiang and C. Mart´ın-Vide, “Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes,” Journal of Parallel and Distributed Computing, vol. 65, no. 12, pp. 1578–1584, 2005. View at Google Scholar
  8. T.-O Ishdorj, A. Leporati, P. Linqiang, and J. Wang, “Solving NP-Complete problems by spiking neural p systems with budding rules,” in Proceedings of the 10th International Conference on Membrane Computing, pp. 335–353, 2009.
  9. P. Linqiang, X. Zeng, X. Zhang, and Y. Jiang, “Spiking neural P systems with weighted synapses,” Neural Processing Letters, vol. 35, no. 1, pp. 13–27, 2012. View at Publisher · View at Google Scholar
  10. G. Păun, “A quick introduction to membrane computing,” The Journal of Logic and Algebraic Programming, vol. 79, no. 6, pp. 291–294, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. F. Robin, “Morse theory for cell complexes,” Advances in Mathematics, vol. 134, no. 1, pp. 90–145, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. F. Robin, “Users guide to discrete Morse theory,” Séminaire Lotharingien de Combinatoire, vol. 48, article B48c, pp. 1–35, 2002. View at Google Scholar · View at Zentralblatt MATH
  13. J. Han and M. Kamber, Data Mining, Concepts and Techniques, Morgan Kaufmann Publishers, Higher Education Press, Beijing, China, 2002.
  14. L. Zhang and H. Jiang, “Impulsive cluster anticonsensus of discrete multiagent linear dynamic systems,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 857561, 11 pages, 2012. View at Publisher · View at Google Scholar
  15. J. Feng, J. Wang, C. Xu, and F. Austin, “Cluster synchronization of nonlinearly coupled complex networks via pinning control,” Discrete Dynamics in Nature and Society, vol. 2011, Article ID 262349, 23 pages, 2011. View at Publisher · View at Google Scholar
  16. W. Zou, Y. Zhu, H. Chen, and X. Sui, “A clustering approach using cooperative artificial bee colony algorithm,” Discrete Dynamics in Nature and Society, vol. 2010, Article ID 459796, 16 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. X. Liu, L. Xiang, X. Wang et al., “Spatial cluster analysis by the adleman-lipton DNA computing model and flexible grids,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 894207, 32 pages, 2012. View at Publisher · View at Google Scholar
  18. C. Mónica, M. Angels Colomer, M. J. Pérez-Jiménez, and A. Zaragoza, “Hierarchical clustering with membrane computing,” Computing and Informatics, vol. 27, no. 3+, pp. 497–513, 2008. View at Google Scholar
  19. R. Ceterchi and C. Martin-Vide, “P systems with communication for static sorting,” GRLMC Report 26, Rovira I Virgili University, 2003, M. Cavaliere, C. Mart´ın-Vide, and Gh. Paun, eds. View at Google Scholar
  20. R. B. Abu Bakar, J. Watada, and W. Pedrycz, “DNA approach to solve clustering problem based on a mutual order,” BioSystems, vol. 91, pp. 1–12, 2008. View at Publisher · View at Google Scholar
  21. V. Natarajan and H. Edelsbrunner, “Simplication of three-dimensional density maps,” IEEE Transactions on Visualization and Computer Graphics, vol. 10, pp. 587–597, 2004. View at Publisher · View at Google Scholar