• DocumentCode
    2116519
  • Title

    Automatic generation algorithms of network models for complex systems

  • Author

    Guo, Xinjun ; Xiao, Haihong ; Han, Zhong

  • Author_Institution
    Dept. electrical engineering, Henan Institute of engineering, Zhengzhou 451191, China
  • fYear
    2010
  • fDate
    4-6 Dec. 2010
  • Firstpage
    1044
  • Lastpage
    1047
  • Abstract
    Presently, lots of theory achievements have been gotten on the modeling of complex systems. However, it is necessary that theory achievements are applied into practice. In addition, it is difficult that models of complex systems are automatically constructed. So, a novel “draw-net” algorithm based on a structure space is presented to realize automatic network model graph generation for complex systems. The structure space is designed with a special data structure, which is used to save the basic information of the network model. Then different spaces are defined to manage the classified information according to certain operating sequence. The generation model is based on classification spaces, and these works contain the computing and the drawing of graphic objects. In the generation process, the iterative calculation is used; the whole model is produced with nodes, relationships, and parameters eventually. Finally, an example on making network models is used to illustrate the proposed algorithm. It shows this algorithm is feasible, and can satisfy realistic requirements. Simultaneously, it is discovered that the auto-generation arithmetic has a good universality, and can be widely extended in the practices.
  • Keywords
    Algorithm design and analysis; Analytical models; Computational modeling; Computer network reliability; Reliability; Safety; “draw-net” algorithm; complex system; network model; structure space;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Science and Engineering (ICISE), 2010 2nd International Conference on
  • Conference_Location
    Hangzhou, China
  • Print_ISBN
    978-1-4244-7616-9
  • Type

    conf

  • DOI
    10.1109/ICISE.2010.5689983
  • Filename
    5689983