The conception of a conceptual model is differently defined in Computer Science and Engineeringas well as in other sciences. There is no common notion of this conception yet. The same is valid for the understanding of the notion of model. One notion is: A model is a well-formed, adequate, and dependable instrument thatrepresents origins and functions in some utilisation scenario. The conceptual model of an information system consists of a conceptual schema and of a collection of conceptual views that are associated (in most cases tightly by a mapping facility) to the conceptual schema. In a nutshell, a conceptual model is an enhancement of a model by concepts from a concept(ion) space. The variety of notions for conceptual model is rather broad. We analyse some of the notions, systematise these notions, and discuss essential ingredients of conceptual models. This discussion allows to derive a research program in our area.
{"title":"Conceptual Model Notions - A Matter of Controversy: Conceptual Modelling and its Lacunas","authors":"B. Thalheim","doi":"10.18417/emisa.si.hcm.1","DOIUrl":"https://doi.org/10.18417/emisa.si.hcm.1","url":null,"abstract":"The conception of a conceptual model is differently defined in Computer Science and Engineeringas well as in other sciences. There is no common notion of this conception yet. The same is valid for the understanding of the notion of model. One notion is: A model is a well-formed, adequate, and dependable instrument thatrepresents origins and functions in some utilisation scenario. The conceptual model of an information system consists of a conceptual schema and of a collection of conceptual views that are associated (in most cases tightly by a mapping facility) to the conceptual schema. In a nutshell, a conceptual model is an enhancement of a model by concepts from a concept(ion) space. The variety of notions for conceptual model is rather broad. We analyse some of the notions, systematise these notions, and discuss essential ingredients of conceptual models. This discussion allows to derive a research program in our area.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126956754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-27DOI: 10.18417/emisa.si.hcm.23
Faiz Currim, S. Ram
Modeling organizational rules during conceptual design provides a more accurate picture of the underlying domain and helps enforce data integrity. In a database development context, there are many advantages to explicitly representing rules during conceptual design. Early modeling ensures they are visible to designers and users, thus improving requirements and validation. The rules can then be semiautomatically translated into logical design code. One limitation to widespread adoption of such modeling is variance in standards and semantics of rules. We consider cardinality constraints—a useful and integral part of conceptual database design. Many papers discussing classification frameworks for cardinality exist. Completeness of such schemes has always been in question since well-defined criteria do not exist to evaluate them. We suggest a “reverse engineering” approach, i. e., one of defining conceptual modeling constraint completeness based on mappings from the relational model. We develop a correspondence from relational algebra operator combinations to existing semantic constraint types. In doing so, we also come up with a new category of set-level cardinality constraints not previously examined in literature. We believe our work demonstrates a unique approach to establishing conceptual framework completeness and enables standardization of rule semantics which in turn allows for semantics-based (as opposed to procedural-based) representation. On the implementation side, it supports developing automated mechanisms for translating constraints to improve developer productivity.
{"title":"Understanding Semantic Completeness in Rule Frameworks for Modeling Cardinality Constraints","authors":"Faiz Currim, S. Ram","doi":"10.18417/emisa.si.hcm.23","DOIUrl":"https://doi.org/10.18417/emisa.si.hcm.23","url":null,"abstract":"Modeling organizational rules during conceptual design provides a more accurate picture of the underlying domain and helps enforce data integrity. In a database development context, there are many advantages to explicitly representing rules during conceptual design. Early modeling ensures they are visible to designers and users, thus improving requirements and validation. The rules can then be semiautomatically translated into logical design code. One limitation to widespread adoption of such modeling is variance in standards and semantics of rules. We consider cardinality constraints—a useful and integral part of conceptual database design. Many papers discussing classification frameworks for cardinality exist. Completeness of such schemes has always been in question since well-defined criteria do not exist to evaluate them. We suggest a “reverse engineering” approach, i. e., one of defining conceptual modeling constraint completeness based on mappings from the relational model. We develop a correspondence from relational algebra operator combinations to existing semantic constraint types. In doing so, we also come up with a new category of set-level cardinality constraints not previously examined in literature. We believe our work demonstrates a unique approach to establishing conceptual framework completeness and enables standardization of rule semantics which in turn allows for semantics-based (as opposed to procedural-based) representation. On the implementation side, it supports developing automated mechanisms for translating constraints to improve developer productivity.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116582023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-27DOI: 10.18417/EMISA.SI.HCM.20
Adrian Hernandez-Mendez, Felix Michel, F. Matthes
This article provides a condensed overview of a layered and model-driven system architecture that empowers domain experts to set up and customize collaborative information systems without programming based on layered business-oriented conceptual models. This architecture emerged from a decade of iterative research, design, development, and technology transfer projects which focused on individual modelling and system construction activities. This paper puts these results and publications into a larger architectural perspective, explains the rationale behind this architecture, and argues to consider it as a reference architecture for model-based collaborative information systems in general.
{"title":"A Practice-Proven Reference Architecture for Model-Based Collaborative Information Systems","authors":"Adrian Hernandez-Mendez, Felix Michel, F. Matthes","doi":"10.18417/EMISA.SI.HCM.20","DOIUrl":"https://doi.org/10.18417/EMISA.SI.HCM.20","url":null,"abstract":"This article provides a condensed overview of a layered and model-driven system architecture that empowers domain experts to set up and customize collaborative information systems without programming based on layered business-oriented conceptual models. This architecture emerged from a decade of iterative research, design, development, and technology transfer projects which focused on individual modelling and system construction activities. This paper puts these results and publications into a larger architectural perspective, explains the rationale behind this architecture, and argues to consider it as a reference architecture for model-based collaborative information systems in general.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125265611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-27DOI: 10.18417/EMISA.SI.HCM.14
M. Tkachuk, R. Gamzayev, I. Martinkus, Volodymyr Sokol, Oleh Tovstokorenko
Domain-driven design (DDD) and especially the usage of domain modelling methods (DMM) are modern approaches to improve software quality, and a way to develop software product lines (SPL). To emphasize advantages of DDD and DMM usage, a 3-level design scheme is proposed, which reflects also variability issues in the framework. According to this metaphor the main attention is paid to the phases of logical domain modelling and physical modelling, with usage of two alternative DMM-methods: JODA and ODM approaches. The algorithmic model for an efficiency coefficient estimation of alternative DMM usage is proposed, which utilizes structured data resources, expert methods and metrics used in SPL development processes. A feasibility study for the proposed approach is provided and the obtained experimental results are discussed, which allow to make positive conclusions about this research and to outline its further steps to be done.
{"title":"Towards Effectiveness Assessment of Domain Modelling Methods and Tools in Software Product Lines Development","authors":"M. Tkachuk, R. Gamzayev, I. Martinkus, Volodymyr Sokol, Oleh Tovstokorenko","doi":"10.18417/EMISA.SI.HCM.14","DOIUrl":"https://doi.org/10.18417/EMISA.SI.HCM.14","url":null,"abstract":"Domain-driven design (DDD) and especially the usage of domain modelling methods (DMM) are modern approaches to improve software quality, and a way to develop software product lines (SPL). To emphasize advantages of DDD and DMM usage, a 3-level design scheme is proposed, which reflects also variability issues in the framework. According to this metaphor the main attention is paid to the phases of logical domain modelling and physical modelling, with usage of two alternative DMM-methods: JODA and ODM approaches. The algorithmic model for an efficiency coefficient estimation of alternative DMM usage is proposed, which utilizes structured data resources, expert methods and metrics used in SPL development processes. A feasibility study for the proposed approach is provided and the obtained experimental results are discussed, which allow to make positive conclusions about this research and to outline its further steps to be done.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115975003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-27DOI: 10.18417/EMISA.SI.HCM.18
Josefina Guerrero García, J. González-Calleros
Scenario Textual Descriptions (STD) are general-purpose natural language descriptions of a narrative scenario of end users, real or potential, using an existing or a future interactive system. STDs may take many forms: use cases, structured scenarios, user stories, and natural language expressions of user actions. As such, these STDs contain useful information for initiating the development life cycle of a user interface of this interactive system. On the one hand, when the end user expresses some interaction through these STDs, user interface requirements can be elicited by deriving model fragments from them: user model, task model, domain model, process model, etc. On the other hand, when the end user refers to any previously used system to feed the requirements, usability problems can be derived from user interfaces critiques: usability problems by interaction object, by dialogue box or window, by entire application. Both approaches feed a bidirectional approach where requirements and usability problems co-exist in the same STD. This article presents how FlowiXML supports the entire approach based on a real-world case studyfor a distributed system for managing teaching students.
{"title":"Eliciting User Interface Requirements and Deriving Usability Problems from Scenario Textual Descriptions","authors":"Josefina Guerrero García, J. González-Calleros","doi":"10.18417/EMISA.SI.HCM.18","DOIUrl":"https://doi.org/10.18417/EMISA.SI.HCM.18","url":null,"abstract":"Scenario Textual Descriptions (STD) are general-purpose natural language descriptions of a narrative scenario of end users, real or potential, using an existing or a future interactive system. STDs may take many forms: use cases, structured scenarios, user stories, and natural language expressions of user actions. As such, these STDs contain useful information for initiating the development life cycle of a user interface of this interactive system. On the one hand, when the end user expresses some interaction through these STDs, user interface requirements can be elicited by deriving model fragments from them: user model, task model, domain model, process model, etc. On the other hand, when the end user refers to any previously used system to feed the requirements, usability problems can be derived from user interfaces critiques: usability problems by interaction object, by dialogue box or window, by entire application. Both approaches feed a bidirectional approach where requirements and usability problems co-exist in the same STD. This article presents how FlowiXML supports the entire approach based on a real-world case studyfor a distributed system for managing teaching students.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-27DOI: 10.18417/EMISA.SI.HCM.19
Sabine Wolny, Alexandra Mazak, M. Wimmer, Rafael Konlechner, G. Kappel
Tackling the challenge of managing the full life-cycle of systems requires a well-defined mix of approaches. While in the early phases model-driven approaches are frequently used to design systems, in the later phases data-driven approaches are used to reason on different key performance indicators of systems under operation. This immediately poses the question how operational data can be mapped back to design models to evaluate existing designs and to reason about future re-designs. In this paper, we present a novel approach for harmonizing model-driven and data-driven approaches. In particular, we introduce an architecture for time-series data management to analyse runtime properties of systems which is derived from design models. Having this systematic generation of time-series data management opens the door to analyse data through design models. We show how such data analytics is specified for modelling languages using standard metamodelling techniques and technologies.
{"title":"Model-Driven Time-Series Analytics","authors":"Sabine Wolny, Alexandra Mazak, M. Wimmer, Rafael Konlechner, G. Kappel","doi":"10.18417/EMISA.SI.HCM.19","DOIUrl":"https://doi.org/10.18417/EMISA.SI.HCM.19","url":null,"abstract":"Tackling the challenge of managing the full life-cycle of systems requires a well-defined mix of approaches. While in the early phases model-driven approaches are frequently used to design systems, in the later phases data-driven approaches are used to reason on different key performance indicators of systems under operation. This immediately poses the question how operational data can be mapped back to design models to evaluate existing designs and to reason about future re-designs. In this paper, we present a novel approach for harmonizing model-driven and data-driven approaches. In particular, we introduce an architecture for time-series data management to analyse runtime properties of systems which is derived from design models. Having this systematic generation of time-series data management opens the door to analyse data through design models. We show how such data analytics is specified for modelling languages using standard metamodelling techniques and technologies.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124560759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
During the last 30 years Petri nets have shown a continuous popularity and durability as process modelling language. While some process modelling languages were crossed with others or even disappeared, Petri nets are continuously used as modelling language addressing various purposes in the context of business processes. In this paper, we refer to the success of Petri nets and describe business process modelling extensions as well as approaches for process modelling, simulation, execution and evaluation relying on Petri nets. The variety of Petri net-based extensions shows that Petri nets can be adapted to changing requirements for which these extensions, modifications or variants have been proposed.
{"title":"A Petri net-based View on the Business Process Life-Cycle","authors":"A. Koschmider, A. Oberweis, W. Stucky","doi":"10.18417/EMISA.SI.HCM.4","DOIUrl":"https://doi.org/10.18417/EMISA.SI.HCM.4","url":null,"abstract":"During the last 30 years Petri nets have shown a continuous popularity and durability as process modelling language. While some process modelling languages were crossed with others or even disappeared, Petri nets are continuously used as modelling language addressing various purposes in the context of business processes. In this paper, we refer to the success of Petri nets and describe business process modelling extensions as well as approaches for process modelling, simulation, execution and evaluation relying on Petri nets. The variety of Petri net-based extensions shows that Petri nets can be adapted to changing requirements for which these extensions, modifications or variants have been proposed.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128477185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Process Warehouses are a well-established means for analysing the execution of business processes and the computation of key performance indicators. We propose a new model for process warehouses which is better suited to cope with business processes which have many variants. We present a meta-model of processes with a notion of generic activities which then is used to automatically generate a generalisation hierarchy for process variants along which OLAP operations can be performed.
{"title":"A Process Warehouse Model Capturing Process Variants","authors":"Lisana Berberi, Johann Eder, Christian Koncilia","doi":"10.18417/EMISA.SI.HCM.8","DOIUrl":"https://doi.org/10.18417/EMISA.SI.HCM.8","url":null,"abstract":"Process Warehouses are a well-established means for analysing the execution of business processes and the computation of key performance indicators. We propose a new model for process warehouses which is better suited to cope with business processes which have many variants. We present a meta-model of processes with a notion of generic activities which then is used to automatically generate a generalisation hierarchy for process variants along which OLAP operations can be performed.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122498009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-27DOI: 10.18417/EMISA.SI.HCM.10
Antoni Olivé
One of the main problems in building data integration systems is that of semantic integration. It has been acknowledged that the problem would not exist if all systems were developed using the same global schema, but so far, such global schema has been considered unfeasible in practice. However, in our previous work, we have argued that given the current state-of-the-art, a global schema may be feasible now, and we have put forward a vision of a Universal Ontology (UO) that may be desirable, feasible, and viable. One of the reasons why the UO may be desirable is that it might solve the semantic integration problem. The objective of this paper is to show that indeed the UO could solve, or at least greatly alleviate, the semantic integration problem. We do so by presenting an approach to semantic integration based on the UO that requires much less effort than other approaches.
{"title":"A Universal Ontology-based Approach to Data Integration","authors":"Antoni Olivé","doi":"10.18417/EMISA.SI.HCM.10","DOIUrl":"https://doi.org/10.18417/EMISA.SI.HCM.10","url":null,"abstract":"One of the main problems in building data integration systems is that of semantic integration. It has been acknowledged that the problem would not exist if all systems were developed using the same global schema, but so far, such global schema has been considered unfeasible in practice. However, in our previous work, we have argued that given the current state-of-the-art, a global schema may be feasible now, and we have put forward a vision of a Universal Ontology (UO) that may be desirable, feasible, and viable. One of the reasons why the UO may be desirable is that it might solve the semantic integration problem. The objective of this paper is to show that indeed the UO could solve, or at least greatly alleviate, the semantic integration problem. We do so by presenting an approach to semantic integration based on the UO that requires much less effort than other approaches.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123131689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-27DOI: 10.18417/emisa.si.hcm.11
Elisabeth Métais, F. Ghorbel, F. Hamdi, N. Ellouze, Noura Herradi, Assia Soukane
Representing and reasoning on imprecise temporal information is a common requirement in the field of Semantic Web. Many works exist to represent and reason on precise temporal information in OWL; however, to the best of our knowledge, none of these works is devoted to imprecise temporal time intervals. To address this problem, we propose two approaches: a crisp-based approach and a fuzzy-based approach. (1) The first approach uses only crisp standards and tools and is modelled in OWL 2. We extend the 4D-fluents model, with new crisp components, to represent imprecise time intervals and qualitative crisp interval relations. Then, we extend the Allen’s interval algebra to compare imprecise time intervals in a crisp way and inferences are done via a set of SWRL rules. (2) The second approach is based on fuzzy sets theory and fuzzy tools and is modelled in Fuzzy-OWL 2. The 4D-fluents approach is extended, with new fuzzy components, in order to represent imprecise time intervals and qualitative fuzzy interval relations. The Allen’s interval algebra is extended in order to compare imprecise time intervals in a fuzzy gradual personalized way. Inferences are done via a set of Mamdani IF-THEN rules.
{"title":"Representing Imprecise Time Intervals in OWL 2","authors":"Elisabeth Métais, F. Ghorbel, F. Hamdi, N. Ellouze, Noura Herradi, Assia Soukane","doi":"10.18417/emisa.si.hcm.11","DOIUrl":"https://doi.org/10.18417/emisa.si.hcm.11","url":null,"abstract":"Representing and reasoning on imprecise temporal information is a common requirement in the field of Semantic Web. Many works exist to represent and reason on precise temporal information in OWL; however, to the best of our knowledge, none of these works is devoted to imprecise temporal time intervals. To address this problem, we propose two approaches: a crisp-based approach and a fuzzy-based approach. (1) The first approach uses only crisp standards and tools and is modelled in OWL 2. We extend the 4D-fluents model, with new crisp components, to represent imprecise time intervals and qualitative crisp interval relations. Then, we extend the Allen’s interval algebra to compare imprecise time intervals in a crisp way and inferences are done via a set of SWRL rules. (2) The second approach is based on fuzzy sets theory and fuzzy tools and is modelled in Fuzzy-OWL 2. The 4D-fluents approach is extended, with new fuzzy components, in order to represent imprecise time intervals and qualitative fuzzy interval relations. The Allen’s interval algebra is extended in order to compare imprecise time intervals in a fuzzy gradual personalized way. Inferences are done via a set of Mamdani IF-THEN rules.","PeriodicalId":186216,"journal":{"name":"Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model.","volume":"476 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122188055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：