doi: 10.4304/jsw.7.4.798-803
Optimization of Enterprise Information System based on Object-based Knowledge Mesh and Binary Tree with Maximum User Satisfaction
2Department of Management Engineering, Zhengzhou University, Zhengzhou, China
Abstract—This paper deals with an approach to the optimization of enterprise information system(EIS) based on the object-based knowledge mesh (OKM) and binary tree. Firstly, to explore the optimization of EIS by the user’s function requirements, an OKM expression representation based on the user’s satisfaction and binary tree is proposed. Secondly, based on the definitions of the fuzzy function-satisfaction degree relationships on the OKM functions, the optimization model is constructed. Thirdly, the OKM multiple set operation expression is optimized by the immune genetic algorithm and binary tree, with the steps of the OKM optimization presented in detail as well. Finally, the optimization of EIS is illustrated by an example to verify the proposed approaches.
Index Terms—enterprise information system, optimization, user satisfaction degree, object-based knowledge mesh, binary tree
Cite: Haiwang Cao and Chaogai Xue, "Optimization of Enterprise Information System based on Object-based Knowledge Mesh and Binary Tree with Maximum User Satisfaction," Journal of Software vol. 7, no. 4, pp. 798-803, 2012.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]