Pub Date : 1999-03-24DOI: 10.1109/ASSET.1999.756766
C. Hoover, P. Khosla, D. Siewiorek
Transforming software requirements into a software design involves the iterative partition of a solution into software components. The partition process starts with the identification of basic high-level design components and concludes with the definition of low-level design elements such as modules, packages, and library specifications. The process is human-intensive and does not guarantee that design objectives such as reusability, evolvability, and adaptable performance are satisfied. This paper overviews our analytical approach for partitioning basic elements of a software solution into reusable and evolvable software components. We discuss the process of generating basic components for an embedded control application using a representative object-oriented design technique. Then we outline our analytical approach and demonstrate its application to a class of search techniques which can be embedded into applications requiring polynomial-time search of a solution-space. Lastly, we discuss future research directions.
{"title":"Analytical design of reusable software components for evolvable, embedded applications","authors":"C. Hoover, P. Khosla, D. Siewiorek","doi":"10.1109/ASSET.1999.756766","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756766","url":null,"abstract":"Transforming software requirements into a software design involves the iterative partition of a solution into software components. The partition process starts with the identification of basic high-level design components and concludes with the definition of low-level design elements such as modules, packages, and library specifications. The process is human-intensive and does not guarantee that design objectives such as reusability, evolvability, and adaptable performance are satisfied. This paper overviews our analytical approach for partitioning basic elements of a software solution into reusable and evolvable software components. We discuss the process of generating basic components for an embedded control application using a representative object-oriented design technique. Then we outline our analytical approach and demonstrate its application to a class of search techniques which can be embedded into applications requiring polynomial-time search of a solution-space. Lastly, we discuss future research directions.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124914748","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756777
Hee Lee, S. Djoko, Hua Jiang, S. Subramanian, K. Basu
Each wireless network system has its own unique operating conditions. The geographical characteristics, RF conditions, call traffic and subscriber mobility of one network are different from others. In order to achieve maximum capacity and optimal performance of a network, the system parameters of the network must be engineered to fit the network's operating conditions. However, because of the complexity of wireless network system engineering, there has not been much success in developing effective engineering rules that are applicable to all systems. This lack of accurate universal engineering rules makes the process of wireless network engineering laborious, expensive and customized. A self engineering engine presented in this paper overcomes the difficulties in the current wireless network engineering practice. The adoption of the self engineering engine in the wireless network system will enable the system to monitor and engineer itself with the goal of achieving maximum capacity and optimal performance.
{"title":"Wireless networks self engineering engine","authors":"Hee Lee, S. Djoko, Hua Jiang, S. Subramanian, K. Basu","doi":"10.1109/ASSET.1999.756777","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756777","url":null,"abstract":"Each wireless network system has its own unique operating conditions. The geographical characteristics, RF conditions, call traffic and subscriber mobility of one network are different from others. In order to achieve maximum capacity and optimal performance of a network, the system parameters of the network must be engineered to fit the network's operating conditions. However, because of the complexity of wireless network system engineering, there has not been much success in developing effective engineering rules that are applicable to all systems. This lack of accurate universal engineering rules makes the process of wireless network engineering laborious, expensive and customized. A self engineering engine presented in this paper overcomes the difficulties in the current wireless network engineering practice. The adoption of the self engineering engine in the wireless network system will enable the system to monitor and engineer itself with the goal of achieving maximum capacity and optimal performance.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129711453","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756775
J.C. Huang, T. Leng
It is well known that to optimize a program for speedup efforts should be focused on the regions where the payoff will be greatest. Loop constructs in a program represent such regions. In the literature, it has been shown that a certain degree of speedup can be achieved by loop unrolling. The technique published so far, however, appears to be applicable to FOR-loops only. This paper presents a generalized loop-unrolling method that can be applied to any type of loop construct. Possible complications in its applications, together with some experimental results, are discussed in detail.
{"title":"Generalized loop-unrolling: a method for program speedup","authors":"J.C. Huang, T. Leng","doi":"10.1109/ASSET.1999.756775","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756775","url":null,"abstract":"It is well known that to optimize a program for speedup efforts should be focused on the regions where the payoff will be greatest. Loop constructs in a program represent such regions. In the literature, it has been shown that a certain degree of speedup can be achieved by loop unrolling. The technique published so far, however, appears to be applicable to FOR-loops only. This paper presents a generalized loop-unrolling method that can be applied to any type of loop construct. Possible complications in its applications, together with some experimental results, are discussed in detail.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128740202","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756774
J. Ryoo, J. Stach, E. Park
The number of use cases produced for any non-trivial system can be large. These use cases may contain redundancies resulting from multilevel stakeholder communities, natural language ambiguity, terminology differences, and common data and behaviours. In order to prepare use cases for formal requirements modeling, some structure is needed to classify the use cases into partitions that are meaningful to the object modeler. This paper extends Jacobson's (1992) use cases with a refinement called system oriented use cases. The extensions are then partitioned according to the strength of their similarity: behavioural, intentional, and environmental. The partitioning is exhaustive and produces a hierarchy. The hierarchy is a useful input to bound the requirements modeling activity that follows the elicitation phase.
{"title":"Extension and partitioning of use cases in support of formal object modeling","authors":"J. Ryoo, J. Stach, E. Park","doi":"10.1109/ASSET.1999.756774","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756774","url":null,"abstract":"The number of use cases produced for any non-trivial system can be large. These use cases may contain redundancies resulting from multilevel stakeholder communities, natural language ambiguity, terminology differences, and common data and behaviours. In order to prepare use cases for formal requirements modeling, some structure is needed to classify the use cases into partitions that are meaningful to the object modeler. This paper extends Jacobson's (1992) use cases with a refinement called system oriented use cases. The extensions are then partitioned according to the strength of their similarity: behavioural, intentional, and environmental. The partitioning is exhaustive and produces a hierarchy. The hierarchy is a useful input to bound the requirements modeling activity that follows the elicitation phase.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125016762","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756768
T. Khoshgoftaar, E. B. Allen, Wai Hong Tang, C. Michael, J. Voas
Our goal is to identify software modules that have some locations which do not propagate errors induced by a suite of test cases. This paper focuses on whether or not data state errors can propagate from a location in the code to the outputs or observable data state during random testing with inputs drawn from an operational distribution. If a code-location's probability of propagation is estimated to be zero, then a fault in that location could escape defection during testing. Because testing is never exhaustive, there is a risk that failures due to such latent faults could occur during operations. Fault injection is a technique for directly measuring the probability of propagation. However, measurement for every location in the code of a full-scale program is often prohibitively computation-intensive. Our objective is a practical, useful alternative to direct measurement. We present empirical evidence that static software product metrics can be useful for identifying software modules where the effects of a fault in that module are not observable. A case study of an intricate computer game program revealed a useful empirical relationship between static software product metrics and propagation of errors. The case study program was an order of magnitude larger than previously reported studies.
{"title":"Identifying modules which do not propagate errors","authors":"T. Khoshgoftaar, E. B. Allen, Wai Hong Tang, C. Michael, J. Voas","doi":"10.1109/ASSET.1999.756768","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756768","url":null,"abstract":"Our goal is to identify software modules that have some locations which do not propagate errors induced by a suite of test cases. This paper focuses on whether or not data state errors can propagate from a location in the code to the outputs or observable data state during random testing with inputs drawn from an operational distribution. If a code-location's probability of propagation is estimated to be zero, then a fault in that location could escape defection during testing. Because testing is never exhaustive, there is a risk that failures due to such latent faults could occur during operations. Fault injection is a technique for directly measuring the probability of propagation. However, measurement for every location in the code of a full-scale program is often prohibitively computation-intensive. Our objective is a practical, useful alternative to direct measurement. We present empirical evidence that static software product metrics can be useful for identifying software modules where the effects of a fault in that module are not observable. A case study of an intricate computer game program revealed a useful empirical relationship between static software product metrics and propagation of errors. The case study program was an order of magnitude larger than previously reported studies.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116573731","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756783
G. Damm, S. Giorcelli, G. Fouquet
This paper presents an integrated simulation environment to help dimensioning distributed systems in the field of telecommunication network management, and to be a guideline for software design of such systems. Dimensioning concerns sales persons, who have to quickly optimise configurations in terms of cost and efficiency in order to meet customer requirements. Software designers can use this tool to make and validate architectural choices, as well as to exhaustively test the performance and limits of the system. The proposed tool focuses on management traffic. To improve the assessment efficiency, simulation studies should be performed by the same teams who design or market the products; available simulation tools require specific skills. As a consequence, we developed a tool which provides an intuitive, user-friendly graphical interface, and gives easy access to the underlying models of the objects composing the network.
{"title":"A simulation environment for dimensioning telecommunication management systems","authors":"G. Damm, S. Giorcelli, G. Fouquet","doi":"10.1109/ASSET.1999.756783","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756783","url":null,"abstract":"This paper presents an integrated simulation environment to help dimensioning distributed systems in the field of telecommunication network management, and to be a guideline for software design of such systems. Dimensioning concerns sales persons, who have to quickly optimise configurations in terms of cost and efficiency in order to meet customer requirements. Software designers can use this tool to make and validate architectural choices, as well as to exhaustively test the performance and limits of the system. The proposed tool focuses on management traffic. To improve the assessment efficiency, simulation studies should be performed by the same teams who design or market the products; available simulation tools require specific skills. As a consequence, we developed a tool which provides an intuitive, user-friendly graphical interface, and gives easy access to the underlying models of the objects composing the network.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129313102","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756754
S. Bhattacharya, R. Paul
Accountability (aka non-repudiation, or NRP) is a key component of information systems security, and it is a stated need in the Orange Book guidelines for security level classifications. This paper presents a framework of the "accountability" needs of a message communication system. In particular, we demonstrate that the traditional approach of digital signature (DS) based solutions to the accountability needs of a message communication system is only one part of the overall problem. In a multihop message delivery system (where the hops could be physically separated routers. Or logically distinct multiple software modules), there can be other aspects of accountability that may not be addressed using DS techniques. We identify a specific problem, namely the sender's ambiguity problem (SAP), that remains to be solved if a comprehensive treatment to accountability could be developed. The primary focus of this paper is to identify the SAP problem (and, hence, raise a point that DS alone cannot completely solve the accountability problem). Then we present an outline of our research in SAP framework. The framework includes NRP categories, NRP types of services, NRP levels of certification. Finally, we present a set of metrics that can potentially be used to assess the SAP problem, and its existence severance, in a networked or distributed system. Follow on research is required to elaborate the SAP framework.
{"title":"Accountability issues in multihop message communication","authors":"S. Bhattacharya, R. Paul","doi":"10.1109/ASSET.1999.756754","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756754","url":null,"abstract":"Accountability (aka non-repudiation, or NRP) is a key component of information systems security, and it is a stated need in the Orange Book guidelines for security level classifications. This paper presents a framework of the \"accountability\" needs of a message communication system. In particular, we demonstrate that the traditional approach of digital signature (DS) based solutions to the accountability needs of a message communication system is only one part of the overall problem. In a multihop message delivery system (where the hops could be physically separated routers. Or logically distinct multiple software modules), there can be other aspects of accountability that may not be addressed using DS techniques. We identify a specific problem, namely the sender's ambiguity problem (SAP), that remains to be solved if a comprehensive treatment to accountability could be developed. The primary focus of this paper is to identify the SAP problem (and, hence, raise a point that DS alone cannot completely solve the accountability problem). Then we present an outline of our research in SAP framework. The framework includes NRP categories, NRP types of services, NRP levels of certification. Finally, we present a set of metrics that can potentially be used to assess the SAP problem, and its existence severance, in a networked or distributed system. Follow on research is required to elaborate the SAP framework.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123490344","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756767
J. Voas
Software fault injection is a process that discovers how "badly" software can behave after its state gets corrupted. Fault injection results are sometimes viewed suspiciously since state corruption is hypothetically-based. In response to this suspicion, this paper explores the potential return-on-investment when artificial state corruptions are used. We will primarily focus on fault injection's unique ability to reveal hazards that were inadvertently overlooked during software requirements and design. To our knowledge, this application of fault injection has never been exploited.
{"title":"Software hazard mining","authors":"J. Voas","doi":"10.1109/ASSET.1999.756767","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756767","url":null,"abstract":"Software fault injection is a process that discovers how \"badly\" software can behave after its state gets corrupted. Fault injection results are sometimes viewed suspiciously since state corruption is hypothetically-based. In response to this suspicion, this paper explores the potential return-on-investment when artificial state corruptions are used. We will primarily focus on fault injection's unique ability to reveal hazards that were inadvertently overlooked during software requirements and design. To our knowledge, this application of fault injection has never been exploited.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124032030","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756756
E. Shokri, Kane Kim
Object-oriented analysis and design methodologies have become popular in development of non-real-time business data processing applications. However conventional object-oriented techniques have had minimal impact on development of real-time applications mainly because these techniques do not explicitly address key characteristics of real-time systems, in particular, timing requirements. Time-triggered message-triggered object (TMO) structuring is in our view the most natural extension of the object-oriented design and implementation techniques which allows the system designer to explicitly specify timing characteristics of data and function components of an object. To facilitate TMO-based design of real-time systems in the most cost-effective manner, we have developed middleware (named TMOSM/ORB) providing TMO execution support mechanisms on top of the Windows NT operating system and a CORBA compliant object request broker. In order to evaluate the effectiveness of CORBA-compliant TMO based system development, a defense command-control application was ported into the TMOSM/ORB environment. In this paper, first the basics of the CORBA-compliant TMO structuring scheme are presented. We then report the porting experience and its findings regarding the effectiveness of the CORBA-compliant TMO based programming in developing real-time applications.
{"title":"TMO-based programming in COTS software/hardware platforms: a case study","authors":"E. Shokri, Kane Kim","doi":"10.1109/ASSET.1999.756756","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756756","url":null,"abstract":"Object-oriented analysis and design methodologies have become popular in development of non-real-time business data processing applications. However conventional object-oriented techniques have had minimal impact on development of real-time applications mainly because these techniques do not explicitly address key characteristics of real-time systems, in particular, timing requirements. Time-triggered message-triggered object (TMO) structuring is in our view the most natural extension of the object-oriented design and implementation techniques which allows the system designer to explicitly specify timing characteristics of data and function components of an object. To facilitate TMO-based design of real-time systems in the most cost-effective manner, we have developed middleware (named TMOSM/ORB) providing TMO execution support mechanisms on top of the Windows NT operating system and a CORBA compliant object request broker. In order to evaluate the effectiveness of CORBA-compliant TMO based system development, a defense command-control application was ported into the TMOSM/ORB environment. In this paper, first the basics of the CORBA-compliant TMO structuring scheme are presented. We then report the porting experience and its findings regarding the effectiveness of the CORBA-compliant TMO based programming in developing real-time applications.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129152484","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 : 1999-03-24DOI: 10.1109/ASSET.1999.756762
J. Zachary, S. Iyengar
The ability to organize and retrieve visual information such as images and video is becoming a crucial problem for specialists and general computer users alike. Because processing visual information requires perceptual abilities not yet known to exist in computational form, the ability to retrieve visual information without human assistance is a rich, complex, and interesting problem. This paper presents the problem from the point of view of real-world system construction, discusses the main feature extraction methods used in modern CBIR systems, and outlines several CBIR system implementations.
{"title":"Content based image retrieval systems","authors":"J. Zachary, S. Iyengar","doi":"10.1109/ASSET.1999.756762","DOIUrl":"https://doi.org/10.1109/ASSET.1999.756762","url":null,"abstract":"The ability to organize and retrieve visual information such as images and video is becoming a crucial problem for specialists and general computer users alike. Because processing visual information requires perceptual abilities not yet known to exist in computational form, the ability to retrieve visual information without human assistance is a rich, complex, and interesting problem. This paper presents the problem from the point of view of real-world system construction, discusses the main feature extraction methods used in modern CBIR systems, and outlines several CBIR system implementations.","PeriodicalId":340666,"journal":{"name":"Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116654371","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
扫码关注我们
求助内容：
应助结果提醒方式：