Pub Date : 1998-08-20DOI: 10.1109/COOPIS.1998.706283
Keiko Hiramatsu, Ken-ichi Okada, Y. Matsushita, H. Hayami
Nowadays in many enterprises, for the purpose of efficiency improvement and the automation of the business, the workflow management system of the business process is coming into wide use. However, an individual workflow management system is introduced into each organization so the workflow system is effective as a business support inside a single organization, but it is difficult to apply this management system to coordinate business among more than two organizations. We propose Interworkflow system which coordinates each workflow system among multiple organizations. The Interworkflow system consists of three sub-systems and has a user friendly interface. We report on the fact that we have constructed an actual Interworkflow system that coordinates multiple workflow systems and confirm that it functioned effectively.
{"title":"Interworkflow system: coordination of each workflow system among multiple organizations","authors":"Keiko Hiramatsu, Ken-ichi Okada, Y. Matsushita, H. Hayami","doi":"10.1109/COOPIS.1998.706283","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706283","url":null,"abstract":"Nowadays in many enterprises, for the purpose of efficiency improvement and the automation of the business, the workflow management system of the business process is coming into wide use. However, an individual workflow management system is introduced into each organization so the workflow system is effective as a business support inside a single organization, but it is difficult to apply this management system to coordinate business among more than two organizations. We propose Interworkflow system which coordinates each workflow system among multiple organizations. The Interworkflow system consists of three sub-systems and has a user friendly interface. We report on the fact that we have constructed an actual Interworkflow system that coordinates multiple workflow systems and confirm that it functioned effectively.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125874231","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706276
I. Schmitt, G. Saake
Merging inheritance hierarchies with overlapping class extensions and types is an essential task in database design. In the context of view integration and schema integration for federated databases and multidatabases conflicting inheritance hierarchies have to be merged. Inheritance hierarchies often occur explicitly in object-oriented databases as well as implicitly in relational databases. Since a concept lattice can be regarded as an inheritance hierarchy we propose to apply the theory of concept analysis to the problem of merging inheritance hierarchies. After investigating the power and complexity of concept analysis algorithms we provide a new algorithm tailored to our problem. The new algorithm has polynomial complexity and helps to optimize the resulting hierarchy with respect to certain quality criteria, e.g. number of classes and null values. An example demonstrates the practicability of our approach to merge conflicting inheritance hierarchies.
{"title":"Merging inheritance hierarchies for database integration","authors":"I. Schmitt, G. Saake","doi":"10.1109/COOPIS.1998.706276","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706276","url":null,"abstract":"Merging inheritance hierarchies with overlapping class extensions and types is an essential task in database design. In the context of view integration and schema integration for federated databases and multidatabases conflicting inheritance hierarchies have to be merged. Inheritance hierarchies often occur explicitly in object-oriented databases as well as implicitly in relational databases. Since a concept lattice can be regarded as an inheritance hierarchy we propose to apply the theory of concept analysis to the problem of merging inheritance hierarchies. After investigating the power and complexity of concept analysis algorithms we provide a new algorithm tailored to our problem. The new algorithm has polynomial complexity and helps to optimize the resulting hierarchy with respect to certain quality criteria, e.g. number of classes and null values. An example demonstrates the practicability of our approach to merge conflicting inheritance hierarchies.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"1108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116058163","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706187
T. Tesch, K. Aberer
With the emergence of fast and standardized communication infrastructures over which separately designed agents of different organizations can interact in real-time, there is an increasing demand for cooperation mechanisms that allow to carry out inter-organizational cooperations in a safe way. The lack of external control over an agent's decisions, resources and actions hamper the usage of traditional transaction and workflow technology to make self-interested agents cooperate, i.e., agents cannot not be forced from a mediating cooperation instance to continue a cooperation. The challenge is, therefore, to design a cooperation mechanism that motivates cooperating agents to carry out a specified contract and, in case of unilateral defection, ensures that none of the cooperators can benefit from the situation. In this paper we present a domain independent framework how non-enforceable cooperations can be made safe against unilateral defection. We have developed a utility-based scheduling algorithm that keeps a cooperation in equilibrium and that motivates agents to continue a cooperation as long as it is for all participants beneficial.
{"title":"Scheduling non-enforceable contracts among autonomous agents","authors":"T. Tesch, K. Aberer","doi":"10.1109/COOPIS.1998.706187","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706187","url":null,"abstract":"With the emergence of fast and standardized communication infrastructures over which separately designed agents of different organizations can interact in real-time, there is an increasing demand for cooperation mechanisms that allow to carry out inter-organizational cooperations in a safe way. The lack of external control over an agent's decisions, resources and actions hamper the usage of traditional transaction and workflow technology to make self-interested agents cooperate, i.e., agents cannot not be forced from a mediating cooperation instance to continue a cooperation. The challenge is, therefore, to design a cooperation mechanism that motivates cooperating agents to carry out a specified contract and, in case of unilateral defection, ensures that none of the cooperators can benefit from the situation. In this paper we present a domain independent framework how non-enforceable cooperations can be made safe against unilateral defection. We have developed a utility-based scheduling algorithm that keeps a cooperation in equilibrium and that motivates agents to continue a cooperation as long as it is for all participants beneficial.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130341415","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706226
Manos Theodorakis, A. Analyti, P. Constantopoulos, N. Spyratos
Although semantic data models provide expressive conceptual modeling mechanisms, they do not support context, i.e. providing controlled partial information on conceptual entities by viewing them from different viewpoints or in different situations. The authors present a model for representing contexts in information bases along with a set of operations for manipulating contexts. These operations support creating, updating, combining, and comparing contexts. The model contributes to the efficient handling of information, especially in distributed, cooperative environments, as it enables (i) representing (possibly overlapping) partitions of an information base; (ii) partial representations of objects, (iii) flexible naming (e.g. relative names, synonyms and homonyms), (iv) focusing attention, and (v) combining and comparing different partial representations. The work advances towards the development of a formal framework intended to clarify several theoretical and practical issues related to the notion of context. The use of context in a cooperative environment is illustrated through a detailed example.
{"title":"Context in information bases","authors":"Manos Theodorakis, A. Analyti, P. Constantopoulos, N. Spyratos","doi":"10.1109/COOPIS.1998.706226","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706226","url":null,"abstract":"Although semantic data models provide expressive conceptual modeling mechanisms, they do not support context, i.e. providing controlled partial information on conceptual entities by viewing them from different viewpoints or in different situations. The authors present a model for representing contexts in information bases along with a set of operations for manipulating contexts. These operations support creating, updating, combining, and comparing contexts. The model contributes to the efficient handling of information, especially in distributed, cooperative environments, as it enables (i) representing (possibly overlapping) partitions of an information base; (ii) partial representations of objects, (iii) flexible naming (e.g. relative names, synonyms and homonyms), (iv) focusing attention, and (v) combining and comparing different partial representations. The work advances towards the development of a formal framework intended to clarify several theoretical and practical issues related to the notion of context. The use of context in a cooperative environment is illustrated through a detailed example.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121567243","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706195
T. Critchlow, M. Ganesh, R. Musick
Mediators are a critical component of any data warehouse; they transform data from source formats to the warehouse representation while resolving semantic and syntactic conflicts. The close relationship between mediators and databases requires a mediator to be updated whenever an associated schema is modified. Failure to quickly perform these updates significantly reduces the reliability of the warehouse because queries do not have access to the most current data. This may result in incorrect or misleading responses, and reduce user confidence in the warehouse. Unfortunately, this maintenance may be a significant undertaking if a warehouse integrates several dynamic data sources. This paper describes a meta-data framework, and associated software, designed to automate a significant portion of the mediator generation task and thereby reduce the effort involved in adapting to schema changes. By allowing the DBA to concentrate on identifying the modifications at a high level, instead of reprogramming the mediator, turnaround time is reduced and warehouse reliability is improved.
{"title":"Meta-data based mediator generation","authors":"T. Critchlow, M. Ganesh, R. Musick","doi":"10.1109/COOPIS.1998.706195","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706195","url":null,"abstract":"Mediators are a critical component of any data warehouse; they transform data from source formats to the warehouse representation while resolving semantic and syntactic conflicts. The close relationship between mediators and databases requires a mediator to be updated whenever an associated schema is modified. Failure to quickly perform these updates significantly reduces the reliability of the warehouse because queries do not have access to the most current data. This may result in incorrect or misleading responses, and reduce user confidence in the warehouse. Unfortunately, this maintenance may be a significant undertaking if a warehouse integrates several dynamic data sources. This paper describes a meta-data framework, and associated software, designed to automate a significant portion of the mediator generation task and thereby reduce the effort involved in adapting to schema changes. By allowing the DBA to concentrate on identifying the modifications at a high level, instead of reprogramming the mediator, turnaround time is reduced and warehouse reliability is improved.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131407221","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706198
K. Park, H. Kang
Previous research on the client-server DBMS has focused on the client data caching schemes in the LAN-based client-server architectures. We investigate the issue of client data caching in the WAN environment. In the WAN environment, it is common that many clients are clustered in some local area, connected to each other over a LAN, and often request the same data to the same remote server. To take advantage of such a characteristic, we considered a client group-server DBMS architecture, in which the clients connected over a LAN in each local area form a client group and communicate with the server via a broker, a special client that belongs to the group and maintains cache consistency in its group on behalf of the server. We propose the data caching scheme called ICCC (Inter-Client Communication Caching) that fits the client group-server DBMS architecture. In ICCC, cached data can be shared among clients within the group through inter-client communication under the intervention of their broker. We conducted simulation experiments to evaluate the performance of ICCC. The results showed that ICCC considerably outperformed the standard callback locking scheme employed in the WAN environment.
{"title":"A client group-server DBMS architecture and inter-client communication caching schemes in the WAN environment","authors":"K. Park, H. Kang","doi":"10.1109/COOPIS.1998.706198","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706198","url":null,"abstract":"Previous research on the client-server DBMS has focused on the client data caching schemes in the LAN-based client-server architectures. We investigate the issue of client data caching in the WAN environment. In the WAN environment, it is common that many clients are clustered in some local area, connected to each other over a LAN, and often request the same data to the same remote server. To take advantage of such a characteristic, we considered a client group-server DBMS architecture, in which the clients connected over a LAN in each local area form a client group and communicate with the server via a broker, a special client that belongs to the group and maintains cache consistency in its group on behalf of the server. We propose the data caching scheme called ICCC (Inter-Client Communication Caching) that fits the client group-server DBMS architecture. In ICCC, cached data can be shared among clients within the group through inter-client communication under the intervention of their broker. We conducted simulation experiments to evaluate the performance of ICCC. The results showed that ICCC considerably outperformed the standard callback locking scheme employed in the WAN environment.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134640633","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706189
S. Au, J. Liang, N. Parameswaran
In hostile and dynamic worlds, resource limited agents for problem solving will have to be both reactive and deliberative. However, for complex worlds, deliberative activities (which typically involve world modeling, goal generation, planning, negotiation, etc.) are not only time consuming, but also require greater expertise on the agent. There are several real world scenarios where an expert (a specialist agent) supplies the necessary knowledge to a resource-limited agent (a general agent) to solve its problem. We suggest that this knowledge be in the form of a recipe. We propose a recipe structure to encode the actions required to be executed through explicit planning, and the behaviors to be exhibited in time critical situations. The general agent translates the recipe into plans (as mental attributes) incrementally, and executes them. We also present the details of an implementation of this execution strategy, where we translate the recipe incrementally into a progressively abstract plan structure in a fire world.
{"title":"A recipe structure for plan execution in dynamic worlds","authors":"S. Au, J. Liang, N. Parameswaran","doi":"10.1109/COOPIS.1998.706189","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706189","url":null,"abstract":"In hostile and dynamic worlds, resource limited agents for problem solving will have to be both reactive and deliberative. However, for complex worlds, deliberative activities (which typically involve world modeling, goal generation, planning, negotiation, etc.) are not only time consuming, but also require greater expertise on the agent. There are several real world scenarios where an expert (a specialist agent) supplies the necessary knowledge to a resource-limited agent (a general agent) to solve its problem. We suggest that this knowledge be in the form of a recipe. We propose a recipe structure to encode the actions required to be executed through explicit planning, and the behaviors to be exhibited in time critical situations. The general agent translates the recipe into plans (as mental attributes) incrementally, and executes them. We also present the details of an implementation of this execution strategy, where we translate the recipe incrementally into a progressively abstract plan structure in a fire world.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125364606","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706274
S. Carlsen
Workflow technology is a particular kind of IT for supporting work by enacting explicitly modeled and represented business processes. Thus, conceptual models of business and work processes are essential for process design as well as for process support in the form of workflow enactment. The author describes the APM (Action Port Model) workflow modeling language which builds upon existing IS conceptual modeling languages. Even if based on traditional languages, APM is intended to be the basis for a flexible workflow support environment supporting ad hoc workflow, conform to ideas of workflow models as plans for situated action.
{"title":"Action Port Model: a mixed paradigm conceptual workflow modeling language","authors":"S. Carlsen","doi":"10.1109/COOPIS.1998.706274","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706274","url":null,"abstract":"Workflow technology is a particular kind of IT for supporting work by enacting explicitly modeled and represented business processes. Thus, conceptual models of business and work processes are essential for process design as well as for process support in the form of workflow enactment. The author describes the APM (Action Port Model) workflow modeling language which builds upon existing IS conceptual modeling languages. Even if based on traditional languages, APM is intended to be the basis for a flexible workflow support environment supporting ad hoc workflow, conform to ideas of workflow models as plans for situated action.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129849849","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706190
H. Vogler, A. Buchmann
Agent systems are well suited for applications requiring great flexibility. We propose a mechanism that uses multiple mobile agents to implement distributed transactions in a wide area network. Of special interest are applications in which resources change over time. By using multiple, mobile and autonomous agents in our model we are able to monitor resources in a distributed system and to react to changes in a very flexible manner. Each agent is responsible for a single resource and corresponds with the Object Transaction Service (OTS) for the coordination of the global transaction. For the management and the control of the agents we propose X-TRA, our extensible trusted agent system which offers a trust service for agent identification and control with exactly once semantics for agent migration, controlled agent termination, grouping of agents, and a bank service.
{"title":"Using multiple mobile agents for distributed transactions","authors":"H. Vogler, A. Buchmann","doi":"10.1109/COOPIS.1998.706190","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706190","url":null,"abstract":"Agent systems are well suited for applications requiring great flexibility. We propose a mechanism that uses multiple mobile agents to implement distributed transactions in a wide area network. Of special interest are applications in which resources change over time. By using multiple, mobile and autonomous agents in our model we are able to monitor resources in a distributed system and to react to changes in a very flexible manner. Each agent is responsible for a single resource and corresponds with the Object Transaction Service (OTS) for the coordination of the global transaction. For the management and the control of the agents we propose X-TRA, our extensible trusted agent system which offers a trust service for agent identification and control with exactly once semantics for agent migration, controlled agent termination, grouping of agents, and a bank service.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133804357","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 : 1998-08-20DOI: 10.1109/COOPIS.1998.706183
Yangjun Chen, W. Benn
In this paper, we consider the query evaluation problem in relational multidatabases and develop a method for generating optimal plans for queries submitted to such a system. Two aspects will be discussed: join tree balance and node allocation. For the first problem, we extend the approach for balancing a join tree proposed by Du et al, so that more balanced join trees can be obtained, when, we present the concepts of dynamic time tables and constrained topological order to do the node allocation so that both the current load states of local database systems and load changes during the join operations can be handled. In this way, the deficiency of Evrendilek's method can be removed.
{"title":"Query evaluation for distributed heterogeneous relational databases","authors":"Yangjun Chen, W. Benn","doi":"10.1109/COOPIS.1998.706183","DOIUrl":"https://doi.org/10.1109/COOPIS.1998.706183","url":null,"abstract":"In this paper, we consider the query evaluation problem in relational multidatabases and develop a method for generating optimal plans for queries submitted to such a system. Two aspects will be discussed: join tree balance and node allocation. For the first problem, we extend the approach for balancing a join tree proposed by Du et al, so that more balanced join trees can be obtained, when, we present the concepts of dynamic time tables and constrained topological order to do the node allocation so that both the current load states of local database systems and load changes during the join operations can be handled. In this way, the deficiency of Evrendilek's method can be removed.","PeriodicalId":106219,"journal":{"name":"Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117221829","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
扫码关注我们
求助内容：
应助结果提醒方式：