Optimization of Object-Based Knowledge Mesh Structure Based on Time Performance

Abstract:

To optimize the structure of enterprise information systems, this paper deals with a new approach to optimize the structure of object-based knowledge mesh (OKM) based on time performance, which is the formal representation of enterprise information systems. Firstly, the relationships between knowledge points are discussed, and time performance of knowledge point relationships is discussed. Then, the representation of knowledge point construction based on the binary tree is proposed, which solves the coding problem of optimization. And then, based on the improved immune genetic algorithm, the structure of OKM is optimized. Finally, the new approach is exemplified and verified, and the optimized the structure of OKM is obtained, which lays the foundation for performance optimization of enterprise information systems.

• Periodical: Applied Mechanics and Materials (Volumes 380-384)
• Pages: 2761-2764
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.380-384.2761
• Online since: August 2013
• Authors: Hui Pan, Tao Wang
• Keywords: Binary Tree, Improved Immune Genetic Algorithm, Object-Based Knowledge Mesh, Structure Optimization, Time Performance

References

[1] Yan H S. A new complicated-knowledge representation approach based on knowledge meshes [J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(1): 47-62.

DOI: 10.1109/tkde.2006.2

[2] Xue C G, Cao H W, Dong L L. Study on Time Property of Enterprise Information System Based on Formal Representation: The 8th IEEE International Conference on Control & Automation, 2010 [C]. Xiamen, China: IEEE Computer Society, 2010: 1678-1682.

DOI: 10.1109/icca.2010.5524388

[3] Liu A J, Yang Y, Liang X D et al. Improved immune genetic algorithm based on hybrid chaotic maps and its application [J]. Journal of Convergence Information Technology, 2012, 7(1): 422-432.

DOI: 10.4156/jcit.vol7.issue1.50

[4] Xue C G, Dong L L, Li G H. An Improved Immune Genetic Algorithm for the Optimization of Enterprise Information System based on Time Property [J]. Journal of Software, 2011, 6(3): 436-443.

DOI: 10.4304/jsw.6.3.436-443

[5] Liu Zhi-xiong. Solving scheduling problem of theparticle swarm algorithm coding method [J]. Journal of wuhan university of science and technology. 2010 (02), 33-1.

[6] Clerc, M. Discrete particle swarm optimization[A]. OnwuboluGC, Babu BV. New Optimization Techniques in Engineering[ C] . Springer-Verlag, 2004, 219- 240.

[7] Corce F D, Tadei R, Volta G. A genetic algorithm for the Job Shop problem[J]. Computers and Operations Research, 1995, 22(1): 15-24.

DOI: 10.1016/0305-0548(93)e0015-l

[8] LAARHOVEN P V, AARTS E, L ENSTRA J K. Job Shop scheduling by simulated annealing [J]. Operations Research, 1992, 40 (1): 1132125.

DOI: 10.1287/opre.40.1.113

[9] Chen Nan and so on. For the field of industrial and highly interconnected, TI launched a new Sitara ARM9 microprocessor. [J]. Global Electronics, 2010 (5) 86-87.

[10] Jonghoon ZMP Park, Youngil Youm. General ZMP Control for Bipedal Walking. IEEE International Conference on Robotics and Automation. (2007).

DOI: 10.1109/robot.2007.363870