<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OJBM</journal-id><journal-title-group><journal-title>Open Journal of Business and Management</journal-title></journal-title-group><issn pub-type="epub">2329-3284</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ojbm.2015.32013</article-id><article-id pub-id-type="publisher-id">OJBM-54981</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Business&amp;Economics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Methods of Importance Evaluation for Information Subsystems in Manufacturing Enterprises Based on Centrality
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>hiting</surname><given-names>Song</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Yanming</surname><given-names>Sun</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Jingrong</surname><given-names>Yi</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Li</surname><given-names>Ni</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>School of Business Administration, South China University of Technology, Guangzhou, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>szt05_scut@163.com(HS)</email>;<email>meymsun@scut.edu.cn(YS)</email>;<email>jryi@scut.edu.cn(JY)</email>;<email>riskll@qq.com(LN)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>25</day><month>03</month><year>2015</year></pub-date><volume>03</volume><issue>02</issue><fpage>125</fpage><lpage>134</lpage><history><date date-type="received"><day>10</day>	<month>February</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>23</month>	<year>March</year>	</date><date date-type="accepted"><day>25</day>	<month>March</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Determining the importance of information subsystems is critical to the construction and maintenance of the information systems in manufacturing companies. From the perspective of the interactions among subsystems, several centrality models are developed to assess the importance of subsystems by using software called Code Blocks. A case study is done to test the methods. The results can provide an objective basis for decision making in management activities of an information system, such as information system planning and maintenance, resource allocation and utilization in manufacturing enterprises. The proposed methods will provide new approaches to the quantitative evaluation of the importance of information subsystems.
 
</p></abstract><kwd-group><kwd>Importance Evaluation</kwd><kwd> Information Subsystems</kwd><kwd> Manufacturing Enterprises</kwd><kwd> Centrality</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Manufacturing companies often cannot scientifically determine the priorities of information subsystems in ma- nagement activities such as information system planning, resource allocation and utilization or information system maintenance. As a result of these limitations, phenomena such as low customer satisfaction, low productivity and systematic failures frequently appear in enterprises [<xref ref-type="bibr" rid="scirp.54981-ref1">1</xref>] . Therefore, the evaluation of information subsystems is essential to be considered as an important management activity for manufacturing companies.</p><p>Most studies of an information system focus on internal structures and properties of approximation spaces [<xref ref-type="bibr" rid="scirp.54981-ref2">2</xref>] - [<xref ref-type="bibr" rid="scirp.54981-ref11">11</xref>] . Missing from the traditional information system, relevant research on the importance of information subsystems is neglected from previous literature. The evaluation in other domains relies mainly on a series of indexes to reflect the importance of objects. The index values are derived from expert evaluations or sample data. Based on expert evaluations, AHP, Delphi, fuzzy comprehensive evaluation and integrated models of them have rapidly penetrated into and are widely applied to many fields of engineering, economy and finance, transportation, ecosphere, energy and etc. [<xref ref-type="bibr" rid="scirp.54981-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.54981-ref12">12</xref>] - [<xref ref-type="bibr" rid="scirp.54981-ref21">21</xref>] . Given the prevalence of expert evaluations, an interesting question becomes whether or not other methods can objectively assess the importance of subjects. The regression model is one of the approaches in point, which is tested effectively to evaluate the importance of variables in theory and demonstrated its feasibility in practice [<xref ref-type="bibr" rid="scirp.54981-ref22">22</xref>] - [<xref ref-type="bibr" rid="scirp.54981-ref24">24</xref>] . Based on sample data, other evaluative methods including principal component analysis, grey relational analysis, entropy evaluation methods and factor analysis are available and widely used in the manufacturing, agricultural, communications and tourism industries [<xref ref-type="bibr" rid="scirp.54981-ref25">25</xref>] - [<xref ref-type="bibr" rid="scirp.54981-ref32">32</xref>] .</p><p>However, the evaluation methods of experts are subjective while the evaluation methods based on sample data are ex-post. These methods are difficult to objectively evaluate objects in advance. Centrality based evaluation methods take the nodes in systems or networks as evaluative subjects, and evaluate importance of the nodes by the real interactions between nodes. These centrality based methods provide new approaches for importance evaluation of information subsystems.</p><p>Centrality based evaluation methods are derived from social networks [<xref ref-type="bibr" rid="scirp.54981-ref33">33</xref>] . Until now, these methods have already extended to fields of physics, psychology, transportation, economy and finance, and etc. [<xref ref-type="bibr" rid="scirp.54981-ref34">34</xref>] . Some scholars have also demonstrated practicability and effectiveness of centrality in those fields [<xref ref-type="bibr" rid="scirp.54981-ref35">35</xref>] - [<xref ref-type="bibr" rid="scirp.54981-ref42">42</xref>] . Nevertheless, centrality based methods have not been applied to the information systems of firms. The information systems of manufacturing enterprises are composed of many subsystems and the interactions between all of the adjacent subsystems. Considering information subsystems as nodes or vertexes and interactions as edges between the nodes, the structures of information systems are then transformed into network structures. From the perspective of interactions, the centrality models are applied to determine the importance of each information subsystem. We will discuss the implementation of our model that uses the example of an elevator enterprise. Results can supply theoretical direction for specific practices in management activities of an information system.</p><p>The paper is organized as follows. The structure for a manufacturing enterprise information system is presented in Section 2. Centrality models that are used to evaluate the importance of information subsystems are shown in Section 3. The implementation of centrality based models for an elevator enterprise is shown in Section 4. Finally it is conclusions, acknowledgements.</p></sec><sec id="s2"><title>2. Structure for Information Systems in Manufacturing Companies</title><p>Information systems in different manufacturing companies are varied. To facilitate our research, the article puts forward a typical and functional structure for the purpose of representing diverse information systems. The division standard of the proposed structure of the information system is in accord with the functions that are covered by the commercial software in current time. Its scope limits to the information system in applied layer, excluding operating system, security management system etc. ERP (Enterprise Resource Planning) System does not contain the systems of CRM (Customer Relationship Management) System, SCM (Supply Chain Management) System, HR (Human Resource) System, etc. As is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>, the combination of a line and an arrow stands for interaction between two subsystems. Arrow is the direction that information flows. Thus, the double- headed arrow means the information transmission between the two subsystems is bidirectional while the single arrow means unidirectional.</p><p>The networks include nodes and edges, in which nodes are subjects and edges are relations between subjects. In the network structure of the information system, nodes on behalf of subsystems while edges stand for information flow relationship between subsystems. <xref ref-type="fig" rid="fig2">Figure 2</xref> shows the network structure of the information system. Nodes are adjacent if they are connected by an edge. The nodes arrows pointing to are downstream nodes, otherwise upstream nodes. There are two edges between nodes if a line has two arrows.</p><p><xref ref-type="fig" rid="fig2">Figure 2</xref> displays that some nodes have some obvious characteristics of strongly gathering or radioing information, and being close to others. All these apparent features indicate the importance of nodes. However, these visual features still cannot multi-dimensionally reflect the importance of nodes. From interactions perspective, the paper proposes centrality based methods to evaluate the importance of subsystems multi-dimensionally.</p></sec><sec id="s3"><title>3. Centrality Models for Information Subsystems</title><p>Information systems are heterogeneous systems [<xref ref-type="bibr" rid="scirp.54981-ref43">43</xref>] [<xref ref-type="bibr" rid="scirp.54981-ref44">44</xref>] . The functions of each system are diverse. Conse-</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> The functional structure of the information system in the manufacturing enterprise</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1530151x5.png"/></fig><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> The network structure of the information system presented in <xref ref-type="fig" rid="fig1">Figure 1</xref></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1530151x6.png"/></fig><p>quently, their importance for enterprise is not the same. The network structures of enterprise information systems are real network, and edges between subsystems are determined when enterprises planning their information systems. Hence, nodes are connected by defined laws, and the network structures of information systems are certain. Centrality is widely employed to analyze the properties in various networks, and different measures of centrality capture aspects of what it means for a node to be important to the network. Therefore, the paper applies several centrality models evaluate the importance of subsystems. In order to objectively evaluate the importance of subsystems before put into use, centrality models are established.</p><sec id="s3_1"><title>3.1. Model Assumptions</title><p>1) The route that information follows is path;</p><p>2) When information passing v<sub>i</sub>, it can stop at v<sub>i</sub> and also can flow to its downstream nodes;</p><p>3) The possibilities that information stop at v<sub>i</sub> or flow to each of its downstream nodes are the same;</p><p>4) The distance between any two adjacent nodes is 1;</p><p>5) The information capacity between any two adjacent nodes is infinite.</p></sec><sec id="s3_2"><title>3.2. Model Establishment</title><p>The centrality models are constructed in the perspectives of the ability to gather or radio information to their neighborhood, the ability to control information, the ability to affect system function, information transmission efficiency and the amount of information. Among the diverse measures of centrality, degree centrality and semi- local centrality reflect the ability of a node to influence its surrounding nodes. Besides, betweenness centrality and flow betweenness centrality depict the ability of nodes to control information while closeness centrality shows information transmission efficiency of nodes. Finally, entropy centrality measures the amount of information of each node, and residual closeness centrality shows the influence of each node to system function.</p><sec id="s3_2_1"><title>3.2.1. The Ability to Influence Surrounding Nodes</title><p>1) Out-degree centrality and in-degree centrality</p><p>For directed network, degree centrality usually refers to out-degree centrality and in-degree centrality. Out- degree centrality and in-degree centrality of a vertex v<sub>i</sub> are respectively marked as C<sup>d+</sup>(v<sub>i</sub>) and C<sup>d−</sup>(v<sub>i</sub>). C<sup>d+</sup>(v<sub>i</sub>) and C<sup>d−</sup>(v<sub>i</sub>) indicate the number of downstream nodes and upstream nodes that directly influenced by vertex v<sub>i</sub>. The vertex v<sub>i</sub> with bigger values of C<sup>d+</sup>(v<sub>i</sub>) and C<sup>d−</sup>(v<sub>i</sub>) can influence more vertexes in its neighborhood. Therefore, the vertex v<sub>i</sub> is more important. On reference [<xref ref-type="bibr" rid="scirp.54981-ref45">45</xref>] , the expression of C<sup>d+</sup>(v<sub>i</sub>) and C<sup>d−</sup>(v<sub>i</sub>) are written as</p><disp-formula id="scirp.54981-formula55"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x7.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.54981-formula56"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x8.png"  xlink:type="simple"/></disp-formula><p>d<sup>+</sup>(v<sub>i</sub>) and d<sup>−</sup>(v<sub>i</sub>) denote the out-degree and in-degree of a vertex v<sub>i</sub>.<sub> </sub></p><p>2) Semi-local centrality</p><p>To nodes with the same out-degree and in-degree, we cannot pick out which is more critical just through degree centrality method. In such a case, semi-local centrality is a valid approach. This method reflects the ability of a node to affect other nodes in its indirect neighborhood [<xref ref-type="bibr" rid="scirp.54981-ref46">46</xref>] . The node with bigger value of semi-local centrality is more important. The expression of semi-local centrality for each node is described by the equation</p><disp-formula id="scirp.54981-formula57"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x9.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.54981-formula58"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x10.png"  xlink:type="simple"/></disp-formula><p>c(v<sub>i</sub>) is the clustering coefficient of a vertex v<sub>i</sub>. Let e<sub>jk</sub> as the edge between vertex v<sub>j</sub> and vertex v<sub>k</sub>, and information flows from vertex v<sub>j</sub> to vertex v<sub>k</sub>. V<sup>f</sup>(v<sub>i</sub>) is the set of downstream vertexes of vertex v<sub>i</sub>, and N{e<sub>jk</sub>|v<sub>j</sub>,v<sub>k</sub> ∈ V<sup>f</sup>(v<sub>i</sub>), j ≠ k} is the number of the edges that are composed by the downstream nodes of vertex v<sub>i</sub>. Let c(v<sub>i</sub>) = 0 if d<sup>+</sup>(v<sub>i</sub>) ≤ 1.</p></sec><sec id="s3_2_2"><title>3.2.2. The Ability to Control and Transfer Information</title><p>1) Betweenness centrality</p><p>A vertex v<sub>i</sub> can control information to a great extent if there are many geodesics passing through it. Under the circumstances, the vertex v<sub>i</sub> has a big value of betweenness centrality. What’s more, the node with high value of betweenness is important [<xref ref-type="bibr" rid="scirp.54981-ref47">47</xref>] . Betweenness centrality calculates the number of geodesics passing by each node, and is denoted by C<sup>b</sup>(v<sub>i</sub>). We need appropriately weight if there are multiple geodesics [<xref ref-type="bibr" rid="scirp.54981-ref48">48</xref>] . For example, from vertex v<sub>1</sub> to vertex v<sub>3</sub>, there are two geodesics, they are geodesic g<sub>1</sub>(v<sub>1</sub>,v<sub>3</sub>) = {v<sub>1</sub>,e<sub>12</sub>, v<sub>2</sub>,e<sub>23</sub>, v<sub>3</sub>} and geodesic g<sub>2</sub>(v<sub>1</sub>,v<sub>3</sub>) = {v<sub>1</sub>,e<sub>14</sub>, v<sub>4</sub>,e<sub>43</sub>, v<sub>3</sub>}. However, geodesic g<sub>1</sub>(v<sub>1</sub>,v<sub>3</sub>) is the only geodesic via vertex v<sub>2</sub>, so C<sup>b</sup>(v<sub>2</sub>) = 0.5.</p><p>2) Flow betweenness centrality</p><p>Betweenness centrality merely considers the ability to control information of each node in geodesics. However, information is not always transferring by geodesics [<xref ref-type="bibr" rid="scirp.54981-ref49">49</xref>] . Flow betweenness centrality counts the number of paths via each node [<xref ref-type="bibr" rid="scirp.54981-ref50">50</xref>] . The high value of flow betweenness centrality of a vertex v<sub>i</sub> means that vertex v<sub>i</sub> can strongly control information. The flow betweenness centrality of a vertex v<sub>i</sub> in directed network is expressed by following equations</p><disp-formula id="scirp.54981-formula59"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x11.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.54981-formula60"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x12.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.54981-formula61"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x13.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1530151x14.png" xlink:type="simple"/></inline-formula>is the number of paths that passing through vertex v<sub>i</sub>, and N is the total number of paths in the directed network.</p><p>3) Closeness centrality</p><p>Closeness centrality measures the efficiency of information transmission for each node. The closeness centrality of a vertex v<sub>i</sub> counts the total distance from vertex v<sub>i</sub> to the remaining vertexes in the network [<xref ref-type="bibr" rid="scirp.54981-ref45">45</xref>] . The vertex with short distance can transmit information efficiently. Closeness centrality in directed networks is defined as</p><disp-formula id="scirp.54981-formula62"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x15.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1530151x16.png" xlink:type="simple"/></inline-formula>is the geodesic starting at vertex v<sub>t</sub>, ending at vertex v<sub>j</sub> and passing by v<sub>i</sub>. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1530151x17.png" xlink:type="simple"/></inline-formula>is the length of the geodesic<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1530151x18.png" xlink:type="simple"/></inline-formula>.</p></sec><sec id="s3_2_3"><title>3.2.3. The Amount of Information and the Effect to System Function</title><p>1) Entropy centrality</p><p>In general, there are N(v<sub>i</sub>,v<sub>j</sub>) paths from vertex v<sub>i </sub>to vertex v<sub>j</sub>. Let g<sub>k</sub>(v<sub>i</sub>,v<sub>j</sub>) be such a path, and its length is L(g<sub>k</sub>(v<sub>i</sub>,v<sub>j</sub>)). The probability that a vertex v<sub>t</sub> transfers information to its downstream vertexes is given by:</p><disp-formula id="scirp.54981-formula63"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x19.png"  xlink:type="simple"/></disp-formula><p>and the probability that information stops at vertex v<sub>t</sub> is</p><disp-formula id="scirp.54981-formula64"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x20.png"  xlink:type="simple"/></disp-formula><p>The vertexes between vertex v<sub>i </sub>and vertex v<sub>j</sub>, and travelling along the path g<sub>k</sub> (v<sub>i</sub>,v<sub>j</sub>) are v<sub>i</sub>=v<sub>0</sub>, v<sub>1</sub>, …, v (L(g<sub>k</sub>(v<sub>i</sub>,v<sub>j</sub>))) = v<sub>j</sub>. The information transfer probability from vertex v<sub>i </sub>to vertex v<sub>j</sub> in the path g<sub>k</sub>(v<sub>i</sub>,v<sub>j</sub>) is</p><disp-formula id="scirp.54981-formula65"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x21.png"  xlink:type="simple"/></disp-formula><p>For all the paths from vertex v<sub>i</sub> and vertex v<sub>j</sub>, the ending and transfer probabilities of vertex v<sub>j</sub> are the same. Therefore, the transfer probabilities from vertex v<sub>i</sub> to vertex v<sub>j</sub> are summed as</p><disp-formula id="scirp.54981-formula66"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x22.png"  xlink:type="simple"/></disp-formula><p>Finally, entropy centrality of a vertex v<sub>i</sub> is</p><disp-formula id="scirp.54981-formula67"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x23.png"  xlink:type="simple"/></disp-formula><p>Entropy centrality [<xref ref-type="bibr" rid="scirp.54981-ref48">48</xref>] shows the quantity of information that each node contains, and the node with more information is more vital.</p><p>2) Residual closeness centrality</p><p>Residual closeness centrality reflects the significance of each node to the function of the information system. The node will be more important if removing this node leads the system more vulnerable [<xref ref-type="bibr" rid="scirp.54981-ref51">51</xref>] . Specifically, after the removal, the node with smaller value of residual closeness centrality can influence the system function more greatly and thus it is more important. The residual closeness centrality of a vertex v<sub>i</sub> in the directed networks is described as</p><disp-formula id="scirp.54981-formula68"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1530151x24.png"  xlink:type="simple"/></disp-formula><p>After removing the vertex v<sub>i</sub>, g(v<sub>t</sub>, v<sub>j</sub>) is one of the geodesics between vertex v<sub>t</sub> and vertex v<sub>j</sub>, and its length is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1530151x25.png" xlink:type="simple"/></inline-formula>. Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1530151x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1530151x26.png" xlink:type="simple"/></inline-formula> if there is no path from vertex v<sub>i</sub> to vertex v<sub>j</sub>.</p></sec></sec></sec><sec id="s4"><title>4. Case Study: Application to an Elevator Manufacturing Enterprise</title><p>This section presents an application of the proposed methods in an elevator manufacturing enterprise. We use the elevator manufacturing enterprise as an example because: 1) it has a relatively long history of 30 years and it is the biggest elevator manufacturing enterprise in southern China; 2) driven by the advanced technology and dynamic requirements, the enterprise is going through a transformation; 3) the company spends a lot on constructing and perfecting its information system for its development highly relies on information system. However, with the relatively well-developed information system, some problems remain appear.</p><sec id="s4_1"><title>4.1. Problems Description</title><p>Since it set up, the enterprise has implemented a series of information subsystems, such as ERP System, Manufacturing Execution System (MES) and Knowledge Management (KM) System. In response to requirements, the enterprise devotes itself to developing new systems and improving the old systems. Now information systems have been widely applied in the company. <xref ref-type="fig" rid="fig1">Figure 1</xref> shows the function structure of the information system in the enterprise. Although the function structure was relatively perfect, some unfavorable phenomena were still very serious. For example, the consumer satisfaction was still low in accordance with the report from the marketing department; the productivity was poor and the failures of the information system had not been improved. Under this situation, the enterprise thoroughly analyzed all the problems. They found that: 1) the implementation order of subsystems cannot meet the business requirements well, for the needed subsystems had not been well implemented while the running systems were not required much; 2) the resource distribution to subsystems was unreasonable when function structure of the information system was relatively completed, for example some subsystems occupied large number of resources of which other subsystems needed extremely; 3) in addition, when maintaining the information system, IT department treated subsystems equally so that the subsystems with bugs occurred frequently received insufficient attention before bugs occurred.</p></sec><sec id="s4_2"><title>4.2. Results Analysis</title><p>The centrality models in the paper can be used to find out the vital subsystems. Results provide decision basis for management activities of information system, such as the step-by-step implementation, resource distribution and maintenance of the subsystems. As is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>, there may be more than one geodesics or paths between nodes for the directed relationships between subsystems, and it is difficult to find out all the geodesics or paths artificially. Therefore, software called Code Blocks is used to aid the computation of centrality for each node. Tables 1-3 show the centrality values and ranks of each node.</p><p>1) As is shown in Tables 1-3, the capability of ERP System (vertex v<sub>6</sub>) to influence its surrounding subsystems is strong. Moreover, its transmission efficiency of information, controlling ability of information and influence on system function all rank first. Besides, ERP System contains much information. ERP System shows the optimal combination for information since it integrates the information on main resources of purchase, production, inventory, distribution, finance and human resources etc. Thus, it contains abundant information and</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Statistics for the ability to influence surrounding nodes</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  colspan="2"  >Vertex</th><th align="center" valign="middle" >v<sub>1</sub></th><th align="center" valign="middle" >v<sub>2</sub></th><th align="center" valign="middle" >v<sub>3</sub></th><th align="center" valign="middle" >v<sub>4</sub></th><th align="center" valign="middle" >v<sub>5</sub></th><th align="center" valign="middle" >v<sub>6</sub></th><th align="center" valign="middle" >v<sub>7</sub></th><th align="center" valign="middle" >v<sub>8</sub></th><th align="center" valign="middle" >v<sub>9</sub></th><th align="center" valign="middle" >v<sub>10</sub></th><th align="center" valign="middle" >v<sub>11</sub></th></tr></thead><tr><td align="center" valign="middle"  rowspan="3"  >Value</td><td align="center" valign="middle" >C<sup>d+</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >6</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >7</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >4</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >3</td></tr><tr><td align="center" valign="middle" >C<sup>d−</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >6</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >6</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >9</td></tr><tr><td align="center" valign="middle" >C<sup>sl</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >12.16</td><td align="center" valign="middle" >11.00</td><td align="center" valign="middle" >2.81</td><td align="center" valign="middle" >2.81</td><td align="center" valign="middle" >4.28</td><td align="center" valign="middle" >14.50</td><td align="center" valign="middle" >3.79</td><td align="center" valign="middle" >1.10</td><td align="center" valign="middle" >7.22</td><td align="center" valign="middle" >2.85</td><td align="center" valign="middle" >0.01</td></tr><tr><td align="center" valign="middle" >Rank</td><td align="center" valign="middle" >C<sup>d+</sup>(v<sub>i</sub>) C<sup>d−</sup>(v<sub>i</sub>) C<sup>sl</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >2 2 - 3 2</td><td align="center" valign="middle" >8 - 11 7 - 8 3</td><td align="center" valign="middle" >4 - 7 4 - 6 8 - 9</td><td align="center" valign="middle" >4 - 7 4 - 6 8 - 9</td><td align="center" valign="middle" >4 - 7 4 - 6 5</td><td align="center" valign="middle" >1 2 - 3 1</td><td align="center" valign="middle" >8 - 11 9 - 11 6</td><td align="center" valign="middle" >8 - 11 9 - 11 10</td><td align="center" valign="middle" >3 7 - 8 4</td><td align="center" valign="middle" >8 - 11 9 - 11 7</td><td align="center" valign="middle" >4 - 7 1 11</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Statistics for the ability to control and transfer information</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  colspan="2"  >Vertex</th><th align="center" valign="middle" >v<sub>1</sub></th><th align="center" valign="middle" >v<sub>2</sub></th><th align="center" valign="middle" >v<sub>3</sub></th><th align="center" valign="middle" >v<sub>4</sub></th><th align="center" valign="middle" >v<sub>5</sub></th><th align="center" valign="middle" >v<sub>6</sub></th><th align="center" valign="middle" >v<sub>7</sub></th><th align="center" valign="middle" >v<sub>8</sub></th><th align="center" valign="middle" >v<sub>9</sub></th><th align="center" valign="middle" >v<sub>10</sub></th><th align="center" valign="middle" >v<sub>11</sub></th></tr></thead><tr><td align="center" valign="middle"  rowspan="3"  >Value</td><td align="center" valign="middle" >C<sup>b</sup>(v<sub>2</sub>)</td><td align="center" valign="middle" >27.67</td><td align="center" valign="middle" >1.92</td><td align="center" valign="middle" >1.57</td><td align="center" valign="middle" >1.57</td><td align="center" valign="middle" >4.83</td><td align="center" valign="middle" >36.75</td><td align="center" valign="middle" >0.00</td><td align="center" valign="middle" >0.00</td><td align="center" valign="middle" >12.50</td><td align="center" valign="middle" >0.00</td><td align="center" valign="middle" >12.17</td></tr><tr><td align="center" valign="middle" >C<sup>fb</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >0.18</td><td align="center" valign="middle" >0.06</td><td align="center" valign="middle" >0.09</td><td align="center" valign="middle" >0.09</td><td align="center" valign="middle" >0.10</td><td align="center" valign="middle" >0.19</td><td align="center" valign="middle" >0.02</td><td align="center" valign="middle" >0.01</td><td align="center" valign="middle" >0.08</td><td align="center" valign="middle" >0.02</td><td align="center" valign="middle" >0.17</td></tr><tr><td align="center" valign="middle" >C<sup>c</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >15</td><td align="center" valign="middle" >22</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >19</td><td align="center" valign="middle" >13</td><td align="center" valign="middle" >21</td><td align="center" valign="middle" >23</td><td align="center" valign="middle" >17</td><td align="center" valign="middle" >21</td><td align="center" valign="middle" >22</td></tr><tr><td align="center" valign="middle" >Rank</td><td align="center" valign="middle" >C<sup>b</sup>(v<sub>2</sub>) C<sup>fb</sup>(v<sub>i</sub>) C<sup>c</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >2 2 2</td><td align="center" valign="middle" >6 8 9 - 10</td><td align="center" valign="middle" >7 - 8 5 - 6 4 - 5</td><td align="center" valign="middle" >7 - 8 5 - 6 4 - 5</td><td align="center" valign="middle" >5 4 6</td><td align="center" valign="middle" >1 1 1</td><td align="center" valign="middle" >9 - 11 9 - 10 7 - 8</td><td align="center" valign="middle" >9 - 11 11 11</td><td align="center" valign="middle" >3 7 3</td><td align="center" valign="middle" >9 - 11 9 - 10 7 - 8</td><td align="center" valign="middle" >4 3 9 - 10</td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Statistics for the amount of information and the effect to system function</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  colspan="2"  >Vertex</th><th align="center" valign="middle" >v<sub>1</sub></th><th align="center" valign="middle" >v<sub>2</sub></th><th align="center" valign="middle" >v<sub>3</sub></th><th align="center" valign="middle" >v<sub>4</sub></th><th align="center" valign="middle" >v<sub>5</sub></th><th align="center" valign="middle" >v<sub>6</sub></th><th align="center" valign="middle" >v<sub>7</sub></th><th align="center" valign="middle" >v<sub>8</sub></th><th align="center" valign="middle" >v<sub>9</sub></th><th align="center" valign="middle" >v<sub>10</sub></th><th align="center" valign="middle" >v<sub>11</sub></th></tr></thead><tr><td align="center" valign="middle"  rowspan="2"  >Value</td><td align="center" valign="middle" >C<sup>e</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >2.03</td><td align="center" valign="middle" >1.94</td><td align="center" valign="middle" >1.95</td><td align="center" valign="middle" >1.95</td><td align="center" valign="middle" >2.08</td><td align="center" valign="middle" >2.16</td><td align="center" valign="middle" >2.02</td><td align="center" valign="middle" >1.93</td><td align="center" valign="middle" >2.37</td><td align="center" valign="middle" >2.10</td><td align="center" valign="middle" >1.86</td></tr><tr><td align="center" valign="middle" >C<sup>rs</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >20.31</td><td align="center" valign="middle" >25.63</td><td align="center" valign="middle" >25.19</td><td align="center" valign="middle" >25.19</td><td align="center" valign="middle" >24.06</td><td align="center" valign="middle" >16.84</td><td align="center" valign="middle" >26.56</td><td align="center" valign="middle" >27.75</td><td align="center" valign="middle" >23.25</td><td align="center" valign="middle" >27.38</td><td align="center" valign="middle" >23.50</td></tr><tr><td align="center" valign="middle" >Rank</td><td align="center" valign="middle" >C<sup>e</sup>(v<sub>i</sub>) C<sup>rs</sup>(v<sub>i</sub>)</td><td align="center" valign="middle" >5 2</td><td align="center" valign="middle" >9 8</td><td align="center" valign="middle" >7 - 8 6 - 7</td><td align="center" valign="middle" >7 - 8 6 - 7</td><td align="center" valign="middle" >4 5</td><td align="center" valign="middle" >2 1</td><td align="center" valign="middle" >6 9</td><td align="center" valign="middle" >10 11</td><td align="center" valign="middle" >1 3</td><td align="center" valign="middle" >3 10</td><td align="center" valign="middle" >11 4</td></tr></tbody></table></table-wrap><p>can strongly control information. In order to efficiently combine resources and roundly reflect its status, EPR System should strongly gather and radio information on a large scale. Furthermore, ERP System needs quickly transmit the integrated information to make timely decisions.</p><p>2) The E-commerce platform (vertex v<sub>1</sub>) has prominent influence on the information system function although it contains little information. It can efficiently transmit and strongly control, gather and radio the information. For businesses, E-commerce platforms play an important role in presenting enterprise image, advertising the product and increasing its trade opportunities. So the platform needs to interact with other subsystems as much as possible to promote the mutual understanding between consumers and enterprises themselves. Meanwhile, it should accurately transmit the external information to other internal subsystems in time to facilitate the lateral interaction and information sharing among subsystems. In fact, the E-commerce platform is a dynamic system which frequently transfers information to other systems in small batches. This transferring mode of information enables the enterprise to respond to requirements quickly and timely. E-commerce platform is the system with small amount of information, and it is the feature that makes it possible to accept the outside information. E-commerce platform is critical to system function for it is the most direct system to make profits.</p><p>3) MES (vertex v<sub>9</sub>) has the relatively strong ability to gather and radio information, to influence system function and to transmit information efficiently. The most notable is that MES contains the largest amount of information. As a workshop-oriented management information system, MES covers all the information involved in production activities, includes numerous models of resource distribution, status management, operation, assignment of production cells and control of file etc. The products output by MES are the profitable carriers for an enterprise. MES is the basic and special subsystem of the manufacturing enterprise, and other subsystems exist by assisting it to complete production. Therefore, MES must possess relatively strong ability to radio and transfer information. Only in this way can it be better to interact with other systems, then to guarantee the order of productive activities. In addition, due to its own features, KM System (vertex v<sub>11</sub>) is the most capable to collect information from its neighborhood. As the electronic library of an enterprise, KM System holds and manages the knowledge assets from other systems.</p><p>In conclusion, ERP System in the manufacturing company has the largest values of centrality in accordance with the case, and it is the core of the information system. The new features of consumer participation and network collaboration in supply chain in manufacturing enterprises attribute to the relatively high values of centrality for E-commerce platform. Besides, MES still possesses relatively high values of centrality when service accounts for a large proportion in the manufacturing enterprise. The importance of E-commerce platform and MES is only next to ERP System.</p><p>After distinguishing the key information subsystems, the enterprise gave preference to the critical subsystems in the subsequent activities of resource allocation, system improvement and maintenance. After the improvement, the information system operates more smoothly and the relationships between subsystems become more coordinated. From visual perspective, system failures strikingly decrease, productivity improves, and so does the customer satisfaction.</p></sec></sec><sec id="s5"><title>5. Conclusions</title><p>We construct centrality models to evaluate the importance of information subsystems mainly from three aspects. The paper uses an elevator manufacturing enterprise in Guangzhou as an example. Our analysis yields a number of managerial insights pertaining to the research questions posed in the introduction. First and foremost, the priorities of subsystems in manufacturing companies are not the same. In our study of a typical manufacturing enterprise, the importance of the 11 subsystems varies. Moreover, ERP System, E-commerce platform and MES are the top 3 subsystems in manufacturing enterprises. Second, when manufacturing firms are greatly influenced by the dynamic requirements and the rapid development of the Internet, E-commerce platform is increasingly critical to them. Therefore, manufacturing enterprises should pay special attention to the E-commerce platform in the management activities of information systems. Third, service is increasingly vital to manufacturing enterprises. Consequently, the status of MES has declined but it is still an important part of the information systems. Finally, let the key information subsystems be the decision basis in the activities of planning and maintenance, resource allocation and utilization etc for the information systems can reduce systematic failures, enhance productivity and increase customer satisfaction.</p><p>The proposed centrality based evaluation methods can objectively evaluate the importance of information subsystems in advance. The application of Code Blocks makes the calculation more scientific, accurate and rigor. Methods proposed can avoid numerous data collection, eliminate the influence of subjective factors and avert irremediable consequence that feedback control usually cannot make up for. The approaches applied are applicable for complex systems of enterprise information systems, transportation systems, management systems.</p></sec><sec id="s6"><title>Acknowledgements</title><p>Authors would like to acknowledge the financial support from the National Natural Science Foundation of China (No. 50675069).</p></sec></body><back><ref-list><title>References</title><ref id="scirp.54981-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Yang, J. (2014) Study on Emotion Spaces with Centrality Measure. New Ideas in Psychology, 35, 11-17.  
http://dx.doi.org/10.1016/j.newideapsych.2014.06.001</mixed-citation></ref><ref id="scirp.54981-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Wang, F., Antipova, A. and Porta, S. (2011) Street Centrality and Land Use Intensity in Baton Rouge, Louisiana. Journal of Transport Geography, 19, 285-293. http://dx.doi.org/10.1016/j.jtrangeo.2010.01.004</mixed-citation></ref><ref id="scirp.54981-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Kim, H., Tang, J., Anderson, R. and Mascolo, C. (2012) Centrality Prediction in Dynamic Human Contact Networks. Computer Networks, 56, 983-996. http://dx.doi.org/10.1016/j.comnet.2011.10.022</mixed-citation></ref><ref id="scirp.54981-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Dang, Y. and Peng, L. (2012) Hierarchy of Air Freight Transportation Network Based on Centrality Measure of Complex Networks. Journal of Transportation Systems Engineering and Information Technology, 12, 109-114.  
http://dx.doi.org/10.1016/S1570-6672(11)60207-9</mixed-citation></ref><ref id="scirp.54981-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Goncalves, J.A.M., Portugal, L.D.S. and Nassi, C.D. (2009) Centrality Indicators as an Instrument to Evaluate the Integration of Urban Equipment in the Area of Influence of a Rail Corridor. Transportation Research Part A: Policy and Practice, 43, 13-25. http://dx.doi.org/10.1016/j.tra.2008.06.010</mixed-citation></ref><ref id="scirp.54981-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Kettinger, W.J., Zhang, C. and Chang, K. (2013) A View from the Top: Integrated Information Delivery and Effective Information Use from the Senior Executive’s Perspective. Information Systems Research, 24, 842-860.  
http://dx.doi.org/10.1287/isre.1120.0473</mixed-citation></ref><ref id="scirp.54981-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Systems, H.I., Rantzau, R., Constantinescu, C., Heinkel, U. and Meinecke, H. (2002) Champagne: Data Change Propagation for Heterogeneous Information Systems. In: Proceedings of the International Conference on Very Large Databases (VLDB), Demonstration Paper, Hong Kong, 20-23 August 2002, 1099-1102.</mixed-citation></ref><ref id="scirp.54981-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Freeman, L.C. (1979) Centrality in Social Networks Conceptual Clarification. Social Networks, 1, 215-239.  
http://dx.doi.org/10.1016/0378-8733(78)90021-7</mixed-citation></ref><ref id="scirp.54981-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Chen, D.B., Gao, H., Lü, L.Y. and Zhou, T. (2013) Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering. PLoS ONE, 8, e77455.</mixed-citation></ref><ref id="scirp.54981-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Freeman, L.C. (1977) A Set of Measures of Centrality Based on Betweenness. Sociometry, 40, 35-41.  
http://dx.doi.org/10.2307/3033543</mixed-citation></ref><ref id="scirp.54981-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Tutzauer, F. (2007) Entropy as a Measure of Centrality in Networks Characterized by Path-Transfer Flow. Social Networks, 29, 249-265. http://dx.doi.org/10.1016/j.socnet.2006.10.001</mixed-citation></ref><ref id="scirp.54981-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Yan, G., Zhou, T., Hu, B., Fu, Z.Q. and Wang, B.H. (2006) Efficient Routing on Complex Networks. Physical Review E, 73, Article ID: 046108. http://dx.doi.org/10.1103/PhysRevE.73.046108</mixed-citation></ref><ref id="scirp.54981-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Freeman, L.C., Borgatti, S.P. and White, D.R. (1991) Centrality in Valued Graphs: A Measure of Betweenness Based on Network Flow. Social Networks, 13, 141-154. http://dx.doi.org/10.1016/0378-8733(91)90017-N</mixed-citation></ref><ref id="scirp.54981-ref14"><label>14</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Dangalchev</surname><given-names> C. </given-names></name>,<etal>et al</etal>. (<year>2006</year>)<article-title>Residual Closeness in Networks</article-title><source> Physica A: Statistical Mechanics and Its Applications</source><volume> 365</volume>,<fpage> 556</fpage>-<lpage>564</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.54981-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Hossain, L. (2009) Effect of Organizational Position and Network Centrality on Project Coordination. International Journal of Project Management, 27, 680-689. http://dx.doi.org/10.1016/j.ijproman.2008.11.004</mixed-citation></ref><ref id="scirp.54981-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Kuzubas, T.U., Omercikoglu, I. and Saltoglu, B. (2014) Network Centrality Measures and Systemic Risk: An Application to the Turkish Financial Crisis. Physica A: Statistical Mechanics and Its Applications, 405, 203-215.</mixed-citation></ref><ref id="scirp.54981-ref17"><label>17</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Grassi</surname><given-names> R. </given-names></name>,<etal>et al</etal>. (<year>2010</year>)<article-title>Vertex Centrality as a Measure of Information Flow in Italian Corporate Board Networks</article-title><source> Physica A: Statistical Mechanics and Its Applications</source><volume> 389</volume>,<fpage> 2455</fpage>-<lpage>2464</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.54981-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Stefani, S. and Torriero, A. (2014) Networks, Topology and Dynamics. Quality &amp; Quantity, 48, 1817-1819.  
http://dx.doi.org/10.1007/s11135-014-0017-8</mixed-citation></ref><ref id="scirp.54981-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Bonacich, P. (1987) Power and Centrality: A Family of Measures. American Journal of Sociology, 92, 1170-1182.  
http://dx.doi.org/10.1086/228631</mixed-citation></ref><ref id="scirp.54981-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Guo, L., Zhang, Y. and Li, Z.J. (2008) Evaluating the Efficiency of Listed Tourism Companies by Data Reduction Factor and DEA Model. Chinese Journal of Management, 5, 258-262.</mixed-citation></ref><ref id="scirp.54981-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Ma, Q.H., Li, Y.H., Liang, L.S., Li, Q., Wang, H., Xu, Y.F., Sun, Y.B. and Wang, G.X. (2010) Factor Analysis and Synthetical Evaluation of the Fruit Quality of Dongzao Advanced Selections. Scientia Agricultura Sinica, 43, 2491- 2499.</mixed-citation></ref><ref id="scirp.54981-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Geng, J.H., Gao, Q.S. and Zhang, S.Y. (2007) Community Satisfaction Evaluation System’s Research Based on AHP and Factor Analysis. Journal of Systems &amp; Management, 16, 673-677.</mixed-citation></ref><ref id="scirp.54981-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Li, L., Liu, F. and Li, C.B. (2014) Customer Satisfaction Evaluation Method for Customized Product Development Using Entropy Weight and Analytic Hierarchy Process. Computers &amp; Industrial Engineering, 77, 80-87.  
http://dx.doi.org/10.1016/j.cie.2014.09.009</mixed-citation></ref><ref id="scirp.54981-ref24"><label>24</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Guo</surname><given-names> X.G. </given-names></name>,<etal>et al</etal>. (<year>1998</year>)<article-title>Application of Improved Entropy Method in Evaluation of Economic Results</article-title><source> Systems Engineering- Theory &amp; Practice</source><volume> 18</volume>,<fpage> 98</fpage>-<lpage>102</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.54981-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Li, J. and Yu, W. (2013) An Improved Grey Incidence Analysis Method Based on TOPSIS Thinking and Its Applications. Mathematics in Practice and Theory, 43, 76-80.</mixed-citation></ref><ref id="scirp.54981-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Morchid, M., Dufour, R., Bousquet, P., Linarès, G. and Torres-Moreno, J. (2014) Feature Selection Using Principal Component Analysis for Massive Retweet Detection. Pattern Recognition Letters, 49, 33-39.  
http://dx.doi.org/10.1016/j.patrec.2014.05.020</mixed-citation></ref><ref id="scirp.54981-ref27"><label>27</label><mixed-citation publication-type="other" xlink:type="simple">Petroni, A. and Braglia, M. (2000) Vendor Selection Using Principal Component Analysis. Journal of Supply Chain Management, 36, 63-69. http://dx.doi.org/10.1111/j.1745-493X.2000.tb00078.x</mixed-citation></ref><ref id="scirp.54981-ref28"><label>28</label><mixed-citation publication-type="other" xlink:type="simple">Tonidandel, S. and LeBreton, J.M. (2010) Determining the Relative Importance of Predictors in Logistic Regression: An Extension of Relative Weights Analysis. Organizational Research Methods, 13, 767-781.  
http://dx.doi.org/10.1177/1094428109341993</mixed-citation></ref><ref id="scirp.54981-ref29"><label>29</label><mixed-citation publication-type="other" xlink:type="simple">Johnson, J.W. and LeBreton, J.M. (2004) History and Use of Relative Importance Indices in Organizational Research. Organizational Research Methods, 7, 238-257. http://dx.doi.org/10.1177/1094428104266510</mixed-citation></ref><ref id="scirp.54981-ref30"><label>30</label><mixed-citation publication-type="other" xlink:type="simple">Johnson, J.W. (2000) A Heuristic Method for Estimating the Relative Weight of Predictor Variables in Multiple Regression. Multivariate Behavioral Research, 35, 1-19. http://dx.doi.org/10.1207/S15327906MBR3501_1</mixed-citation></ref><ref id="scirp.54981-ref31"><label>31</label><mixed-citation publication-type="other" xlink:type="simple">Chen, C. and Liu, Y. (2007) A Methodology for Evaluation and Classification of Rock Mass Quality on Tunnel Engineering. Tunnelling and Underground Space Technology, 22, 377-387. http://dx.doi.org/10.1016/j.tust.2006.10.003</mixed-citation></ref><ref id="scirp.54981-ref32"><label>32</label><mixed-citation publication-type="other" xlink:type="simple">Orencio, P.M. and Fujii, M. (2013) A Localized Disaster-Resilience Index to Assess Coastal Communities Based on an Analytic Hierarchy Process (AHP). International Journal of Disaster Risk Reduction, 3, 62-75.  
http://dx.doi.org/10.1016/j.ijdrr.2012.11.006</mixed-citation></ref><ref id="scirp.54981-ref33"><label>33</label><mixed-citation publication-type="other" xlink:type="simple">Joshi, R., Banwet, D.K. and Shankar, R. (2011) A Delphi-AHP-TOPSIS Based Benchmarking Framework for Performance Improvement of a Cold Chain. Expert Systems with Applications, 38, 10170-10182.  
http://dx.doi.org/10.1016/j.eswa.2011.02.072</mixed-citation></ref><ref id="scirp.54981-ref34"><label>34</label><mixed-citation publication-type="other" xlink:type="simple">Ma, Z.L., Shao, C.F., Ma, S.Q. and Ye, Z. (2011) Constructing Road Safety Performance Indicators Using Fuzzy Delphi Method and Grey Delphi Method. Expert Systems with Applications, 38, 1509-1514.  
http://dx.doi.org/10.1016/j.eswa.2010.07.062</mixed-citation></ref><ref id="scirp.54981-ref35"><label>35</label><mixed-citation publication-type="other" xlink:type="simple">Ma, D., Chang, C.C. and Hung, S.W. (2013) The Selection of Technology for Late-Starters: A Case Study of the Energy-Smart Photovoltaic Industry. Economic Modelling, 35, 10-20.  
http://dx.doi.org/10.1016/j.econmod.2013.06.030</mixed-citation></ref><ref id="scirp.54981-ref36"><label>36</label><mixed-citation publication-type="other" xlink:type="simple">Tang, Y., Sun, H.H., Yao, Q. and Wang, Y.B. (2014) The Selection of Key Technologies by the Silicon Photovoltaic Industry Based on the Delphi Method and AHP (Analytic Hierarchy Process): Case Study of China. Energy, 75, 474- 482.</mixed-citation></ref><ref id="scirp.54981-ref37"><label>37</label><mixed-citation publication-type="other" xlink:type="simple">Kim, M., Jang, Y. and Lee, S. (2013) Application of Delphi-AHP Methods to Select the Priorities of WEEE for Recycling in a Waste Management Decision-Making Tool. Journal of Environmental Management, 128, 941-948.  
http://dx.doi.org/10.1016/j.jenvman.2013.06.049</mixed-citation></ref><ref id="scirp.54981-ref38"><label>38</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, R., Zhang, H. and Liu, B. (2012) Selection of Reverse-Logistics Servicer for Electronic Products with Fuzzy Comprehensive Evaluation Method. Grey Systems: Theory and Application, 2, 207-216.</mixed-citation></ref><ref id="scirp.54981-ref39"><label>39</label><mixed-citation publication-type="other" xlink:type="simple">Keil, M., Lee, H.K. and Deng, T. (2013) Understanding the Most Critical Skills for Managing IT Projects: A Delphi Study of IT Project Managers. Information &amp; Management, 50, 398-414. http://dx.doi.org/10.1016/j.im.2013.05.005</mixed-citation></ref><ref id="scirp.54981-ref40"><label>40</label><mixed-citation publication-type="other" xlink:type="simple">Amer, M. and Daim, T.U. (2011) Selection of Renewable Energy Technologies for a Developing County: A Case of Pakistan. Energy for Sustainable Development, 15, 420-435. http://dx.doi.org/10.1016/j.esd.2011.09.001</mixed-citation></ref><ref id="scirp.54981-ref41"><label>41</label><mixed-citation publication-type="other" xlink:type="simple">Dai, J.H. and Tian, H.W. (2013) Entropy Measures and Granularity Measures for Set-Valued Information Systems. Information Sciences, 240, 72-82.</mixed-citation></ref><ref id="scirp.54981-ref42"><label>42</label><mixed-citation publication-type="other" xlink:type="simple">Zhu, W. and Wang, F.Y. (2012) The Fourth Type of Covering-Based Rough Sets. Information Sciences, 201, 80-92.  
http://dx.doi.org/10.1016/j.ins.2012.01.026</mixed-citation></ref><ref id="scirp.54981-ref43"><label>43</label><mixed-citation publication-type="other" xlink:type="simple">Wei, W., Liang, J.Y. and Qian, Y.H. (2012) A Comparative Study of Rough Sets for Hybrid Data. Information Sciences, 190, 1-16. http://dx.doi.org/10.1016/j.ins.2011.12.006</mixed-citation></ref><ref id="scirp.54981-ref44"><label>44</label><mixed-citation publication-type="other" xlink:type="simple">Hu, Q.H., Yu, D. and Guo, M.Z. (2010) Fuzzy Preference Based Rough Sets. Information Sciences, 180, 2003-2022.  
http://dx.doi.org/10.1016/j.ins.2010.01.015</mixed-citation></ref><ref id="scirp.54981-ref45"><label>45</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, H.Y., Zhang, W.X. and Wu, W.Z. (2009) On Characterization of Generalized Interval-Valued Fuzzy Rough Sets on Two Universes of Discourse. International Journal of Approximate Reasoning, 51, 56-70.  
http://dx.doi.org/10.1016/j.ijar.2009.07.002</mixed-citation></ref><ref id="scirp.54981-ref46"><label>46</label><mixed-citation publication-type="other" xlink:type="simple">Chen, D.G., Wang, C.Z. and Hu, Q.H. (2007) A New Approach to Attribute Reduction of Consistent and Inconsistent Covering Decision Systems with Covering Rough Sets. Information Sciences, 117, 3500-3518.  
http://dx.doi.org/10.1016/j.ins.2007.02.041</mixed-citation></ref><ref id="scirp.54981-ref47"><label>47</label><mixed-citation publication-type="other" xlink:type="simple">Yaoa, Y.Y. (2006) Neighborhood Systems and Approximate Retrieval. Information Sciences, 176, 3431-3452.  
http://dx.doi.org/10.1016/j.ins.2006.02.002</mixed-citation></ref><ref id="scirp.54981-ref48"><label>48</label><mixed-citation publication-type="other" xlink:type="simple">Miao, D.Q. and Hou, L.S. (2004) A Comparison of Rough Set Methods and Representative Inductive Learning Algorithms. Fundamenta Informaticae, 59, 203-219.</mixed-citation></ref><ref id="scirp.54981-ref49"><label>49</label><mixed-citation publication-type="other" xlink:type="simple">Skowron, A. and Polkowski, L. (1998) Rough Mereological Foundations for Design, Analysis, Synthesis and Control in Distributed Systems. Information Sciences, 104, 129-156. http://dx.doi.org/10.1016/S0020-0255(97)00078-9</mixed-citation></ref><ref id="scirp.54981-ref50"><label>50</label><mixed-citation publication-type="other" xlink:type="simple">Yao, Y.Y. (1998) Relational Interpretations of Neighborhood Operators and Rough Set Approximation Operators. Information Sciences, 111, 239-259. http://dx.doi.org/10.1016/S0020-0255(98)10006-3</mixed-citation></ref><ref id="scirp.54981-ref51"><label>51</label><mixed-citation publication-type="other" xlink:type="simple">Yau, C. and Davis, T. (1993) Using Analytic Hierarchy Process (AHP) to Prioritize Auditing Tasks for Large-Scale Software Systems. Journal of Systems Management, 44, 26-31.</mixed-citation></ref></ref-list></back></article>