Modelling enterprises include two essential tasks:data modelling for static properties and behaviours modelling for dynamic properties.Traditionally,the data modelling and behaviours modelling are separated in differe...Modelling enterprises include two essential tasks:data modelling for static properties and behaviours modelling for dynamic properties.Traditionally,the data modelling and behaviours modelling are separated in different phases and also in different description forms,e.g.the former is modelled in entity-relationship diagrams(ERDs),and the latter is modelled in data flow diagrams (DFDs).The separation could result in an incorrect description of the relationships between da- ta and behaviours,so that the enterprise model couldn't reflect the actual conditions and demands of the enterprise.In this paper an object-oriented approach integrating data with behaviours in a model for the Enterprises Management Information Systems(in short,EMISs)is proposed.As an isomorphic mapping of enterprises an object-oriented model can,in a natural form,exactly describe the dynamic and static properties of enterprises in an integrated model.Therefore it can be easily used by the end-users(e.g.the experts in accounting,financial reporting,and business managers) to specify their demands and communicate with the system analysts and designers.Based on the model an EMIS can be prototyped quickly,and then be conveniently evolved with inheritance mechanism to an adaptive application system according to the actual demands of the enterprise.展开更多
A graph is called traceable if it contains a Hamilton path, i.e., a path passing through all the vertices. Let G be a graph on n vertices. G is called claw-o-1-heavy if every induced claw(K_(1,3)) of G has a pair of n...A graph is called traceable if it contains a Hamilton path, i.e., a path passing through all the vertices. Let G be a graph on n vertices. G is called claw-o-1-heavy if every induced claw(K_(1,3)) of G has a pair of nonadjacent vertices with degree sum at least n-1 in G. In this paper we show that a claw-o-1-heavy graph G is traceable if we impose certain additional conditions on G involving forbidden induced subgraphs.展开更多
文摘Modelling enterprises include two essential tasks:data modelling for static properties and behaviours modelling for dynamic properties.Traditionally,the data modelling and behaviours modelling are separated in different phases and also in different description forms,e.g.the former is modelled in entity-relationship diagrams(ERDs),and the latter is modelled in data flow diagrams (DFDs).The separation could result in an incorrect description of the relationships between da- ta and behaviours,so that the enterprise model couldn't reflect the actual conditions and demands of the enterprise.In this paper an object-oriented approach integrating data with behaviours in a model for the Enterprises Management Information Systems(in short,EMISs)is proposed.As an isomorphic mapping of enterprises an object-oriented model can,in a natural form,exactly describe the dynamic and static properties of enterprises in an integrated model.Therefore it can be easily used by the end-users(e.g.the experts in accounting,financial reporting,and business managers) to specify their demands and communicate with the system analysts and designers.Based on the model an EMIS can be prototyped quickly,and then be conveniently evolved with inheritance mechanism to an adaptive application system according to the actual demands of the enterprise.
基金Supported by the National Natural Science Foundation of China(No.11601429,11671320 and U1803263)the Fundamental Research Funds for the Central Universities(No.3102018zy035)
文摘A graph is called traceable if it contains a Hamilton path, i.e., a path passing through all the vertices. Let G be a graph on n vertices. G is called claw-o-1-heavy if every induced claw(K_(1,3)) of G has a pair of nonadjacent vertices with degree sum at least n-1 in G. In this paper we show that a claw-o-1-heavy graph G is traceable if we impose certain additional conditions on G involving forbidden induced subgraphs.
