Journal of Computer Science and Technology

, Volume 10, Issue 2, pp 124–133 | Cite as

High-order two-dimension cluster competitive activation mechanisms used for performing symbolic logic algorithms of problem solving

  • Shuai Dianxun 
Regular Papers


This paper presents a neural network approach, based on high-order two-dimension temporal and dynamically clustering competitive activation mechanisms, to implement parallel searching algorithm and many other symbolic logic algorithms. This approach is superior in many respects to both the common sequential algorithms of symbolic logic and the common neural network used for optimization problems. Simulations of problem solving examples prove the effectiveness of the approach.


High-order temporal network competitive activation symbolic logic algorithm dynamic clustering optimization problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Fahner G. An algorithm-structured neural net for the shortest-path problem. InProc. of IJCNN'91, I: 153–158.Google Scholar
  2. [2]
    Fahner G. A high order unit that performs arbitrary Boolean function. InProc. of IJCNN'90, III: 193–197.Google Scholar
  3. [3]
    Benain M, Samuelides M. Dynamic properties of neural nets using competitive activation mechanism. InProc. of IJCNN'90, III: 541–546.Google Scholar
  4. [4]
    Shuai Dianxun. A new algorithm and its extension on the LCS problem.Chinese Journal of Computers, 1983, 6(5): 381–392.MathSciNetGoogle Scholar
  5. [5]
    Shuai Dianxun. A new microprocessor for fast parallelly solving the LCS problem.Chinese Journal of Computers, 1985, 8(3): 223–236.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1995

Authors and Affiliations

  • Shuai Dianxun 
    • 1
  1. 1.Department of Computer ScienceUniversity of Xi'an Electronics Science and TechnologyXi'an

Personalised recommendations