Pub Date : 1996-08-19DOI: 10.1109/CMPSAC.1996.544164
Y. Adachi, K. Anzai, K. Tsuchida, T. Yaku
The hierarchical program diagram editor is a tool for visual program environments. We propose a model of a syntax-directed diagram editor using an attribute graph grammar We formalize and define editor commands by using productions of the attribute graph grammar which defines the hierarchical program diagram. This guarantees that any diagram that is grammatically correct can be generated and that there will be no syntax errors in the program generation and editing processes with the editor. We have implemented our editor based on the editor command definitions. The system is the first practical program diagram editor supporting complete syntax-directed commands and efficient automatic layouts by using attribute graph grammars. The methods should be applicable to development environments for various tree-structured diagrams.
{"title":"Hierarchical program diagram editor based on attribute graph grammar","authors":"Y. Adachi, K. Anzai, K. Tsuchida, T. Yaku","doi":"10.1109/CMPSAC.1996.544164","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544164","url":null,"abstract":"The hierarchical program diagram editor is a tool for visual program environments. We propose a model of a syntax-directed diagram editor using an attribute graph grammar We formalize and define editor commands by using productions of the attribute graph grammar which defines the hierarchical program diagram. This guarantees that any diagram that is grammatically correct can be generated and that there will be no syntax errors in the program generation and editing processes with the editor. We have implemented our editor based on the editor command definitions. The system is the first practical program diagram editor supporting complete syntax-directed commands and efficient automatic layouts by using attribute graph grammars. The methods should be applicable to development environments for various tree-structured diagrams.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129043574","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544616
Myeongho Kang, Taekyoung Kwon, Changyong Yang, Joo-Seok Song
We design a feature interaction manager (FIM) used in the AIN switching system. By analyzing the interactions between features that have been the major obstacle of introducing the AIN service, it is shown that most of the interactions are caused by sharing limited resources, and on the basis of this knowledge, an interaction testing and handling logic is designed. Compared with other methods, the FIM has advantages such as a simple process logic, small memory space requirements, and runtime processing, and it is independent of new features. The FIM is designed using Z schema. This paper also shows the testing and handling process of interactions using the set relation of Z schema.
{"title":"The design and verification of service feature interaction manager on AIN using Z schema","authors":"Myeongho Kang, Taekyoung Kwon, Changyong Yang, Joo-Seok Song","doi":"10.1109/CMPSAC.1996.544616","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544616","url":null,"abstract":"We design a feature interaction manager (FIM) used in the AIN switching system. By analyzing the interactions between features that have been the major obstacle of introducing the AIN service, it is shown that most of the interactions are caused by sharing limited resources, and on the basis of this knowledge, an interaction testing and handling logic is designed. Compared with other methods, the FIM has advantages such as a simple process logic, small memory space requirements, and runtime processing, and it is independent of new features. The FIM is designed using Z schema. This paper also shows the testing and handling process of interactions using the set relation of Z schema.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127455717","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.542425
G. A. Papadopoulos, F. Arbab
The paper combines work done in the areas of asynchronous timed computations and coordination models in order to derive a framework able to express real-time coordination without adhering to special architectures or real-time programming languages. In particular, it is shown how the coordination language MANIFOLD can be used to support coordinators with bounded response time. The only assumption made about the coordinated components is that they adhere to some constraints as imposed by timed asynchronous computational models derived for concurrent constraint languages. The model can be used as a basis for building complex software and hardware systems with the distinct advantage of enhancing reusability of existing components. Indeed, it is already being used in a project aiming to develop distributed multimedia applications.
{"title":"Coordination of systems with real-time properties in manifold","authors":"G. A. Papadopoulos, F. Arbab","doi":"10.1109/CMPSAC.1996.542425","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542425","url":null,"abstract":"The paper combines work done in the areas of asynchronous timed computations and coordination models in order to derive a framework able to express real-time coordination without adhering to special architectures or real-time programming languages. In particular, it is shown how the coordination language MANIFOLD can be used to support coordinators with bounded response time. The only assumption made about the coordinated components is that they adhere to some constraints as imposed by timed asynchronous computational models derived for concurrent constraint languages. The model can be used as a basis for building complex software and hardware systems with the distinct advantage of enhancing reusability of existing components. Indeed, it is already being used in a project aiming to develop distributed multimedia applications.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"33 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124939152","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.542433
Eun Mi Kim, S. Kusumoto, T. Kikuno, Ok-Bae Chang
We proposed new metrics for computing the program complexity of object oriented programs (E.M. Kim et al., 1994). In these metrics, we examined program complexity from three dimensional viewpoints in object oriented paradigm: syntax dimension, inheritance dimension and interaction dimension. We have defined attributes to evaluate three viewpoints quantitatively. We present some heuristics for computing actual values of the attributes, for which we have given only definitions in a previous paper. Then, we analytically evaluate the new metrics with regard to E.J. Weyuker's (1988) measurement principles. As a result, it is found that our metrics satisfy essential properties which any measure must have. Finally, we develop the tool to compute the values of the attributes automatically.
我们提出了计算面向对象程序复杂性的新指标(E.M. Kim et al.， 1994)。在这些度量中，我们从面向对象范式的三个维度考察了程序复杂性:语法维度、继承维度和交互维度。我们已经定义了属性来定量地评估三个视点。我们提出了一些计算属性实际值的启发式方法，我们在以前的文章中只给出了定义。然后，我们根据E.J. Weyuker(1988)的测量原则对新指标进行分析评价。结果发现，我们的度量满足任何度量必须具备的基本属性。最后，我们开发了自动计算属性值的工具。
{"title":"Heuristics for computing attribute values of C++ program complexity metrics","authors":"Eun Mi Kim, S. Kusumoto, T. Kikuno, Ok-Bae Chang","doi":"10.1109/CMPSAC.1996.542433","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.542433","url":null,"abstract":"We proposed new metrics for computing the program complexity of object oriented programs (E.M. Kim et al., 1994). In these metrics, we examined program complexity from three dimensional viewpoints in object oriented paradigm: syntax dimension, inheritance dimension and interaction dimension. We have defined attributes to evaluate three viewpoints quantitatively. We present some heuristics for computing actual values of the attributes, for which we have given only definitions in a previous paper. Then, we analytically evaluate the new metrics with regard to E.J. Weyuker's (1988) measurement principles. As a result, it is found that our metrics satisfy essential properties which any measure must have. Finally, we develop the tool to compute the values of the attributes automatically.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122667172","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544615
C. Perkins
Continuing advances in wireless communications and feature integration into laptop computers are creating the need to allow nomadic users to make network connections to the Internet and with each other with no loss of functionality. This requires new advances in routing protocols and application interfaces. We use Mobile-IP as the basis for providing mobility for nomadic users, and extend it to facilitate additional services for nomadic users both at the network layer and above. As an example of how Mobile-IP can be useful with other protocols at the network layer, we show how Mobile-IP can naturally extend the usefulness of ad-hoc networking. For higher level protocols, we show that, by offering a callback service, Mobile-IP can enable applications to be responsive to changing network conditions. As an example of this technique, we show how service location can benefit from interaction with Mobile-IP. We also mention some other nomadic services which will similarly benefit from a callback service from Mobile-IP.
{"title":"Mobile-IP, ad-hoc networking, and nomadicity","authors":"C. Perkins","doi":"10.1109/CMPSAC.1996.544615","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544615","url":null,"abstract":"Continuing advances in wireless communications and feature integration into laptop computers are creating the need to allow nomadic users to make network connections to the Internet and with each other with no loss of functionality. This requires new advances in routing protocols and application interfaces. We use Mobile-IP as the basis for providing mobility for nomadic users, and extend it to facilitate additional services for nomadic users both at the network layer and above. As an example of how Mobile-IP can be useful with other protocols at the network layer, we show how Mobile-IP can naturally extend the usefulness of ad-hoc networking. For higher level protocols, we show that, by offering a callback service, Mobile-IP can enable applications to be responsive to changing network conditions. As an example of this technique, we show how service location can benefit from interaction with Mobile-IP. We also mention some other nomadic services which will similarly benefit from a callback service from Mobile-IP.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013336","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544600
Hakgene Shin, Jae-Woo Chang
As a result of the wide acceptance of object oriented database systems, some implementation issues such as query processing and indexing become a crucial factor in the success of object oriented database systems. To tackle the issues, we propose an s-signature scheme, which is an efficient access method to nested objects for query processing, especially, when the path dictionary is used. We also compare the s-signature scheme with other indexing techniques such as path index, path signature, and path dictionary. Finally, we present that the proposed method shows significant improvements in the retrieval operation, while at the same time producing lower storage overhead than the path index.
{"title":"A new signature scheme for query processing in object-oriented database","authors":"Hakgene Shin, Jae-Woo Chang","doi":"10.1109/CMPSAC.1996.544600","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544600","url":null,"abstract":"As a result of the wide acceptance of object oriented database systems, some implementation issues such as query processing and indexing become a crucial factor in the success of object oriented database systems. To tackle the issues, we propose an s-signature scheme, which is an efficient access method to nested objects for query processing, especially, when the path dictionary is used. We also compare the s-signature scheme with other indexing techniques such as path index, path signature, and path dictionary. Finally, we present that the proposed method shows significant improvements in the retrieval operation, while at the same time producing lower storage overhead than the path index.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129771379","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544171
Thomas R. Cain, E. Park
The problem of determining whether two programs compute the same function is undecidable. We restrict the class of functions that a program can compute to be a finite dimensional vector space, enabling the problem to become tractable. We prove a theorem showing that the number of test points needed to distinguish any such programs is equal to the dimension of the vector space of functions which they compute, thus generalizing previous results of Howden. Our result unifies certain existing software testing theory and explains the successes and failures of one existing method for selecting test data called perturbation testing. We apply the theorem to obtain three results on the number of test points required to test in vector spaces of Boolean functions and polynomials. First, the Vandermonde matrix used together with our theorem yields the classical result that a polynomial of degree at most n is determined by n+1 points. Second, in vector spaces of Boolean functions we obtain useful results when the degree of the Boolean function is less than the number of inputs to the function. Third, we apply our theorem to describe a technique for testing nonpolynomial, real valued functions.
{"title":"Algebraic software testing in vector spaces of functions","authors":"Thomas R. Cain, E. Park","doi":"10.1109/CMPSAC.1996.544171","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544171","url":null,"abstract":"The problem of determining whether two programs compute the same function is undecidable. We restrict the class of functions that a program can compute to be a finite dimensional vector space, enabling the problem to become tractable. We prove a theorem showing that the number of test points needed to distinguish any such programs is equal to the dimension of the vector space of functions which they compute, thus generalizing previous results of Howden. Our result unifies certain existing software testing theory and explains the successes and failures of one existing method for selecting test data called perturbation testing. We apply the theorem to obtain three results on the number of test points required to test in vector spaces of Boolean functions and polynomials. First, the Vandermonde matrix used together with our theorem yields the classical result that a polynomial of degree at most n is determined by n+1 points. Second, in vector spaces of Boolean functions we obtain useful results when the degree of the Boolean function is less than the number of inputs to the function. Third, we apply our theorem to describe a technique for testing nonpolynomial, real valued functions.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"116 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133970595","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544181
Mauricio J. V. Silva, C. Carlson
Active object-oriented database systems (AOODBSs) are based on the object-oriented paradigm and provide an event driven behavior for implementing time critical reactions by integrating event-condition-action (ECA) rules to the database. We focus on the modeling aspects of AOODBSs. We propose an integrated approach, called A/OODBMT (Active Object-Oriented Database Modeling Technique), which integrates and extends the Object Modeling Technique (OMT) method for conceptually designing active object-oriented database applications. A/OODBMT models database applications by defining and integrating four new types of models, namely the nested object model (NOM), the behavior model (BM), the nested rule model (NRM), and the nested event model (NEM).
{"title":"Modeling active object-oriented database applications using multi-level diagrams","authors":"Mauricio J. V. Silva, C. Carlson","doi":"10.1109/CMPSAC.1996.544181","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544181","url":null,"abstract":"Active object-oriented database systems (AOODBSs) are based on the object-oriented paradigm and provide an event driven behavior for implementing time critical reactions by integrating event-condition-action (ECA) rules to the database. We focus on the modeling aspects of AOODBSs. We propose an integrated approach, called A/OODBMT (Active Object-Oriented Database Modeling Technique), which integrates and extends the Object Modeling Technique (OMT) method for conceptually designing active object-oriented database applications. A/OODBMT models database applications by defining and integrating four new types of models, namely the nested object model (NOM), the behavior model (BM), the nested rule model (NRM), and the nested event model (NEM).","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133823840","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544172
C. Chiang, J. E. Urban
Rapid prototyping via software transformations provides a potentially economical way to construct a prototype both quickly and cheaply. User requirements and specifications can be incrementally elicited and formalized through rapid prototyping via software transformations. A formal specification language called TUG (Tree Unified with Grammar) is used not only as a language for specification but also as a language for rapid prototyping via software transformations. The abstract execution capability of the language allows specifiers to formalize the user requirements incrementally. A framework for rapid prototyping via software transformations is proposed to explain how a prototype for evolution is constructed and managed. A mechanism using change request scripts (CRSs) is used to keep track of the specification changes and make timely updates to the prototype. A telegram analysis problem, as a case study, is given to illustrate how an incomplete and inexact specification is refined successively into a more complete and precise one using the approach.
{"title":"Incremental elicitation and formalization of user requirements through rapid prototyping via software transformations","authors":"C. Chiang, J. E. Urban","doi":"10.1109/CMPSAC.1996.544172","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544172","url":null,"abstract":"Rapid prototyping via software transformations provides a potentially economical way to construct a prototype both quickly and cheaply. User requirements and specifications can be incrementally elicited and formalized through rapid prototyping via software transformations. A formal specification language called TUG (Tree Unified with Grammar) is used not only as a language for specification but also as a language for rapid prototyping via software transformations. The abstract execution capability of the language allows specifiers to formalize the user requirements incrementally. A framework for rapid prototyping via software transformations is proposed to explain how a prototype for evolution is constructed and managed. A mechanism using change request scripts (CRSs) is used to keep track of the specification changes and make timely updates to the prototype. A telegram analysis problem, as a case study, is given to illustrate how an incomplete and inexact specification is refined successively into a more complete and precise one using the approach.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478106","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 : 1996-08-19DOI: 10.1109/CMPSAC.1996.544182
Jianjun Zhao, Jingde Cheng, K. Ushijima
Program slicing has many applications such as program debugging, testing, maintenance, and complexity measurement. This paper concerns the problem of slicing concurrent object-oriented programs that has not been addressed in the literatures until now. To solve this problem, we propose a new program dependence representation named the system dependence net (SDN), which extends previous program dependence representations to represent concurrent object-oriented programs. An SDN of a concurrent object-oriented program consists of a collection of procedure dependence nets each representing a main procedure, a free standing procedure, or a method in a class of the program, and some additional arcs to represent direct dependences between a call and the called procedure/method and transitive interprocedural data dependences. We construct the SDN to represent not only object-oriented features but also concurrency issues in a concurrent object-oriented program. Once a concurrent object-oriented program is represented by its SDN, the slices of the program can be computed based on the SDN as a simple vertex reachability problem in the net.
{"title":"Static slicing of concurrent object-oriented programs","authors":"Jianjun Zhao, Jingde Cheng, K. Ushijima","doi":"10.1109/CMPSAC.1996.544182","DOIUrl":"https://doi.org/10.1109/CMPSAC.1996.544182","url":null,"abstract":"Program slicing has many applications such as program debugging, testing, maintenance, and complexity measurement. This paper concerns the problem of slicing concurrent object-oriented programs that has not been addressed in the literatures until now. To solve this problem, we propose a new program dependence representation named the system dependence net (SDN), which extends previous program dependence representations to represent concurrent object-oriented programs. An SDN of a concurrent object-oriented program consists of a collection of procedure dependence nets each representing a main procedure, a free standing procedure, or a method in a class of the program, and some additional arcs to represent direct dependences between a call and the called procedure/method and transitive interprocedural data dependences. We construct the SDN to represent not only object-oriented features but also concurrency issues in a concurrent object-oriented program. Once a concurrent object-oriented program is represented by its SDN, the slices of the program can be computed based on the SDN as a simple vertex reachability problem in the net.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134484296","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
扫码关注我们
求助内容：
应助结果提醒方式：