Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2006, Article ID 81503, 12 pages
http://dx.doi.org/10.1155/DDNS/2006/81503

Detection of the permutation symmetry in pattern sets

1Department of Physics, Xiamen University, Xiamen, Fujian 361005, China
2National Key Lab for Radar Signal Processing, Xidian University, Xi'an, Shaanxi 710071, China
3School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi 710071, China

Received 19 February 2006; Accepted 1 May 2006

Copyright © 2006 Dong Ji-Yang and Zhang Jun-Ying. 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. P. Baldi, “Symmetries and learning in neural network models,” Physical Review Letters, vol. 59, no. 17, pp. 1976–1978, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  2. D. M. Bishop, Group Theory and Chemistry, Clarendon Press, Oxford, 1973.
  3. J. Q. Chen, Group Representation Theory for Physicists, World Scientific, New Jersey, 1989. View at Zentralblatt MATH · View at MathSciNet
  4. J.-Y. Dong, S. Xu, and B. Wu, “Symmetry in classification scheme of DHNN with even classification,” Journal of Xiamen University (Natural Science), vol. 39, no. 3, pp. 329–335, 2000. View at Google Scholar
  5. J.-Y. Dong, S. Xu, and B. Wu, “The symmetry of the structure of DHNN with even classification,” Journal of Xiamen University (Natural Science), vol. 39, no. 1, pp. 46–51, 2000. View at Google Scholar
  6. J. P. Elliott and P. G. Dawber, Symmetry in Physics, Macmillan Press, London, 1979. View at MathSciNet
  7. L. J. Eshelman, “The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination,” in Foundations of Genetic Algorithms-1, G. J. E. Rawlins, Ed., pp. 265–283, Morgan Kaufmann, California, 1991. View at Google Scholar
  8. D. Goldberg and R. Lingle, “Alleles, loci and the traveling salesman problem,” in Proceedings of the 1st International Conference on Genetic Algorithms, pp. 154–159, Lawrence Erlbaum Associates, New Jersey, 1985.
  9. B. Gruber and I. Iachello, Symmetries in Science, Plenum Press, New York, 1988.
  10. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Michigan, 1975. View at MathSciNet
  11. A. Homaifar, S. Guan, and G. E. Liepins, “A new approach on the traveling salesman problem by genetic algorithms,” in Proceedings of the 5th International Conference on Genetic Algorithms, pp. 460–466, Morgan Kaufmann, California, 1993.
  12. L. Jiao and L. Wang, “A novel genetic algorithm based on immunity,” IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, vol. 30, no. 5, pp. 552–561, 2000. View at Publisher · View at Google Scholar
  13. P. Jog, J. Y. Suh, and D. Van Gucht, “The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem,” in Proceedings of 3rd International Conference on Genetic Algorithms, J. D. Schaffer, Ed., pp. 110–115, Morgan Kaufmann, California, 1989.
  14. S. J. Louis and G. Li, “Genetic algorithms with memory for traveling salesman problems,” in Proceedings of the 1st International Conference on Genetic Algorithms (ICGA '85), pp. 160–168, Pennsylvania, July 1985.
  15. H. Muhlenbein, M. Gorges-Schleuter, and O. Kramer, “Evolution algorithms in combinatorial optimization,” Parallel Computing, vol. 7, no. 1, pp. 65–85, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. Y. Nagata and S. Kobayashi, “Edge assembly crossover: a high-power genetic algorithms for the traveling salesman problem,” in Proceedings of the 7th International Conference on Genetic Algorithms (ICGA '97), T. Back, Ed., pp. 450–457, Morgan Kaufmann, California, 1997.
  17. S. Reimann, “Symmetry and network structure,” Neural Processing Letters, vol. 6, no. 1-2, pp. 1–10, 1997. View at Publisher · View at Google Scholar
  18. S. Reimann, “On the design of artificial auto-associative neuronal networks,” Neural Network, vol. 11, no. 4, pp. 611–621, 1998. View at Publisher · View at Google Scholar
  19. P. Ruján, “Searching for optimal configurations by simulated tunneling,” Zeitschrift für Physik. B. Condensed Matter, vol. 73, no. 3, pp. 391–416, 1988. View at Google Scholar · View at MathSciNet
  20. D. R. Simon, “On the power of quantum computation,” in Proceedings of 35th Annual Symposium on Foundations of Computer Science (Santa Fe, NM, 1994), pp. 116–123, IEEE Comput. Soc. Press, California, 1994. View at MathSciNet
  21. C. Tianren, “Group theory method in artificial neural networks designing,” Discovery of Nature, vol. 27, no. 1, pp. 21–29, 1989. View at Google Scholar
  22. H. Zabrodsky, S. Peleg, and D. Avnir, “Symmetry as a continuous feature,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 12, pp. 1154–1166, 1995. View at Publisher · View at Google Scholar
  23. S. Zickenheiner, T. Nicolaou, A. Bleck, and K. Waldschmidt, “Genetic processing of the traveling salesman problem with the associative architecture AM3,” in Proceedings of the 20th EUROMICRO Conference on System Architecture and Integration (EUROMICRO '94), pp. 111–116, Liverpool, September 1994.