Lingyun Situ, Yu Wang, Fengjuan Gao, Linzhang Wang, Lei Bu, Jianhua Zhao, Xuandong Li
Existing CSP model checkers are incapable of verifying multiple properties concurrently in one run of a model checker, and when trying to alleviate state space explosion problem, most of reduction work are usually done after rather than before the complete state space was produced. Thus, A new CSP model checking tool named ACSPChecker was developed based on answer set programming, which is a declarative logic programming paradigm for solving combinational search problems with the feature of completely free of sequential dependencies, to verifying multiple properties concurrently in one run of a model checker. Additionally, It integrated an abstraction method, which could be used to alleviate the state space explosion before the complete state space was produced. Furthermore, a preprocessing technique of properties was proposed to improve the verification efficiency by reducing the expense spending on replicated verification of the same sub formulas. The feasibility and efficiency of ACSPChecker are illustrated by the experiments with a classic concurrency problem - dining philosophers problem.
{"title":"ACSPChecker: an ASP based CSP model checking tool","authors":"Lingyun Situ, Yu Wang, Fengjuan Gao, Linzhang Wang, Lei Bu, Jianhua Zhao, Xuandong Li","doi":"10.1145/2993717.2993730","DOIUrl":"https://doi.org/10.1145/2993717.2993730","url":null,"abstract":"Existing CSP model checkers are incapable of verifying multiple properties concurrently in one run of a model checker, and when trying to alleviate state space explosion problem, most of reduction work are usually done after rather than before the complete state space was produced. Thus, A new CSP model checking tool named ACSPChecker was developed based on answer set programming, which is a declarative logic programming paradigm for solving combinational search problems with the feature of completely free of sequential dependencies, to verifying multiple properties concurrently in one run of a model checker. Additionally, It integrated an abstraction method, which could be used to alleviate the state space explosion before the complete state space was produced. Furthermore, a preprocessing technique of properties was proposed to improve the verification efficiency by reducing the expense spending on replicated verification of the same sub formulas. The feasibility and efficiency of ACSPChecker are illustrated by the experiments with a classic concurrency problem - dining philosophers problem.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83609337","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}
Chengcheng Wan, Zece Zhu, Yuchen Zhang, Yuting Chen
Change impact analysis plays an important role in software maintenance and evolution. However existing researches mostly focus on one single artifact. Software development is usually accompanied by various types of software artifacts, such as requirement documents, software architectures, test cases, source code, etc., requiring a much more comprehensive change impact analysis. This paper presents a novel approach to multi-perspective change impact analysis that is able to address heterogeneous software artifacts. The essential idea of the novel approach is (1) to adopt semantic web to construct automatically ontology based software engineering linked data, which links requirements, classes, code, bug reports, commits, developers, test cases and others, (2) to build a weighted change impact matrix/graph using the dependency features extracted from linked data, and (3) to follow a change impact propagation algorithm to analyze the overall change impacts. We have conducted experiments on two open source projects (HtmlUnit and OpenRocket) to evaluate our approach. The experimental results show that our approach achieves better F-measure and stability than existing multi-perspective change impact analysis approaches.
{"title":"Multi-perspective change impact analysis using linked data of software engineering","authors":"Chengcheng Wan, Zece Zhu, Yuchen Zhang, Yuting Chen","doi":"10.1145/2993717.2993729","DOIUrl":"https://doi.org/10.1145/2993717.2993729","url":null,"abstract":"Change impact analysis plays an important role in software maintenance and evolution. However existing researches mostly focus on one single artifact. Software development is usually accompanied by various types of software artifacts, such as requirement documents, software architectures, test cases, source code, etc., requiring a much more comprehensive change impact analysis. This paper presents a novel approach to multi-perspective change impact analysis that is able to address heterogeneous software artifacts. The essential idea of the novel approach is (1) to adopt semantic web to construct automatically ontology based software engineering linked data, which links requirements, classes, code, bug reports, commits, developers, test cases and others, (2) to build a weighted change impact matrix/graph using the dependency features extracted from linked data, and (3) to follow a change impact propagation algorithm to analyze the overall change impacts. We have conducted experiments on two open source projects (HtmlUnit and OpenRocket) to evaluate our approach. The experimental results show that our approach achieves better F-measure and stability than existing multi-perspective change impact analysis approaches.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82661979","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}
Failures in data center networks sometimes can lead to user-perceived service interruptions. Automated failure detection is needed to maintain the reliability of data centers. However, researches rarely identify quality of service (QoS) multiplicity for failure detection in data center networks. In this paper, to tackle this problem, we first divide network devices into two categories: imperative devices whose failures need to be detected in realtime, and non-imperative ones. Consequently, we leverage a co-detection approach named K-detectors and a data mining based approach to detect failures of these two kinds of devices respectively. We evaluated our approach on a simulated network built by ns-3. The experimental results show that for servers, query accuracy probability improves 4.62% with detection time increasing slightly; for links, discrimination improves significantly (nearly 86%).
{"title":"A failure detection solution for multiple QoS in data center networks","authors":"Kai Shen, R. Wu, Haojie Zhou, Haibo Yu, Hao Zhong","doi":"10.1145/2993717.2993728","DOIUrl":"https://doi.org/10.1145/2993717.2993728","url":null,"abstract":"Failures in data center networks sometimes can lead to user-perceived service interruptions. Automated failure detection is needed to maintain the reliability of data centers. However, researches rarely identify quality of service (QoS) multiplicity for failure detection in data center networks. In this paper, to tackle this problem, we first divide network devices into two categories: imperative devices whose failures need to be detected in realtime, and non-imperative ones. Consequently, we leverage a co-detection approach named K-detectors and a data mining based approach to detect failures of these two kinds of devices respectively. We evaluated our approach on a simulated network built by ns-3. The experimental results show that for servers, query accuracy probability improves 4.62% with detection time increasing slightly; for links, discrimination improves significantly (nearly 86%).","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84799070","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}
Zhixing Li, Tao Wang, Yang Zhang, Y. Zhan, Gang Yin
The Internet-scale open source software (OSS) production in various communities are generating abundant reusable resources for software developers. However, how to retrieve and reuse the desired and mature software from huge amounts of candidates is a great challenge: there are usually big gaps between the user application contexts (that often used as queries) and the OSS key words (that often used to match the queries). In this paper, we define the scenario-based query problem for OSS retrieval, and then we propose a novel approach to reformulate the raw query by leveraging the crowd wisdom from millions of developers to improve the retrieval results. We build a software-specific domain lexical database based on the knowledge in open source communities, by which we can expand and optimize the input queries. The experiment results show that, our approach can reformulate the initial query effectively and outperforms other existing search engines significantly at finding mature software.
{"title":"Query reformulation by leveraging crowd wisdom for scenario-based software search","authors":"Zhixing Li, Tao Wang, Yang Zhang, Y. Zhan, Gang Yin","doi":"10.1145/2993717.2993723","DOIUrl":"https://doi.org/10.1145/2993717.2993723","url":null,"abstract":"The Internet-scale open source software (OSS) production in various communities are generating abundant reusable resources for software developers. However, how to retrieve and reuse the desired and mature software from huge amounts of candidates is a great challenge: there are usually big gaps between the user application contexts (that often used as queries) and the OSS key words (that often used to match the queries). In this paper, we define the scenario-based query problem for OSS retrieval, and then we propose a novel approach to reformulate the raw query by leveraging the crowd wisdom from millions of developers to improve the retrieval results. We build a software-specific domain lexical database based on the knowledge in open source communities, by which we can expand and optimize the input queries. The experiment results show that, our approach can reformulate the initial query effectively and outperforms other existing search engines significantly at finding mature software.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83809854","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}
Multicast denotes an idea of sending data to numbers of receivers from one source in one transmission. It has been widely applied in group communication (e.g., media streaming, multi-point video conferencing). Multicast routing tree (MRT) is usually built to keep the right paths to transmit data, where data copies are created in parent nodes and then forwarded to child nodes. However, constructing an MRT is usually difficult for a given network topology; finding an optimal multicast routing tree with the minimal cost is a proven NP-complete problem. Moreover, multicast applications usually run in local or small networks due to the limitations in flexibility, scalability, and security. In this paper, we solve a sequenced packet transmission problem of building MRT in Software-Defined Networking (SDN). In sequenced packet transmission, nodes only send the next packet when the previous packet is received by the node on the other side of link. We found this scenario in a popular open source network simulator ns-3 when looking into the runtime behavior of OpenFlow switches simulated by ns-3. We also found this problem is not limited to the ns-3 scenario. We prove that a routing path with less path cost does not correspond to less time cost when it is used to transmit multiple packets sequentially. We extend Dijkstra's shortest path algorithm with our new cost models. We construct the MRT as a sequenced packet shortest-path tree (SPSPT). Simulation results show that our SPSPT can save at least 10% of the multicast time for sequenced packet transmission.
{"title":"Multicast routing tree for sequenced packet transmission in software-defined networks","authors":"YU Peng, R. Wu, Haojie Zhou, Haibo Yu, Yuting Chen, Hao Zhong","doi":"10.1145/2993717.2993721","DOIUrl":"https://doi.org/10.1145/2993717.2993721","url":null,"abstract":"Multicast denotes an idea of sending data to numbers of receivers from one source in one transmission. It has been widely applied in group communication (e.g., media streaming, multi-point video conferencing). Multicast routing tree (MRT) is usually built to keep the right paths to transmit data, where data copies are created in parent nodes and then forwarded to child nodes. However, constructing an MRT is usually difficult for a given network topology; finding an optimal multicast routing tree with the minimal cost is a proven NP-complete problem. Moreover, multicast applications usually run in local or small networks due to the limitations in flexibility, scalability, and security. In this paper, we solve a sequenced packet transmission problem of building MRT in Software-Defined Networking (SDN). In sequenced packet transmission, nodes only send the next packet when the previous packet is received by the node on the other side of link. We found this scenario in a popular open source network simulator ns-3 when looking into the runtime behavior of OpenFlow switches simulated by ns-3. We also found this problem is not limited to the ns-3 scenario. We prove that a routing path with less path cost does not correspond to less time cost when it is used to transmit multiple packets sequentially. We extend Dijkstra's shortest path algorithm with our new cost models. We construct the MRT as a sequenced packet shortest-path tree (SPSPT). Simulation results show that our SPSPT can save at least 10% of the multicast time for sequenced packet transmission.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85486100","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}
Yizhou Wang, Aipeng Li, Xing Chen, Ying Zhang, Gang Huang
Cloud computing has emerged as a new paradigm for services delivering over the Internet. In this growing market, PaaS (Platform-as-a-Service) cloud has been an important model allowing a simple and flexible deployment of applications, without the need for dedicated networks, servers, storage and other services. Many PaaS services have been provided in the past few years and it is required to use hybrid PaaS services in order to satisfy management requirements such as legacy system integration and dynamic resource scaling. However, there are various management interfaces and different management mechanisms among PaaS clouds, which cause great difficulty and high complexity to application deployment in a hybrid cloud. In this paper, we present a runtime model based approach to using hybrid PaaS services. First, the manageability of PaaS services is abstracted as runtime models that are automatically connected with the corresponding systems. Second, we provide a unified model of PaaS services, according to the domain knowledge of current PaaS clouds. Third, the synchronization between the unified model and runtime models is ensured through model transformation. Thus, administrators are able to use hybrid PaaS services in a unified manner and management logic can be also carried out by executing programs on the unified model, which decreases the difficulty and complexity of hybrid cloud management.
{"title":"Runtime model based approach to using hybrid PaaS services","authors":"Yizhou Wang, Aipeng Li, Xing Chen, Ying Zhang, Gang Huang","doi":"10.1145/2993717.2993719","DOIUrl":"https://doi.org/10.1145/2993717.2993719","url":null,"abstract":"Cloud computing has emerged as a new paradigm for services delivering over the Internet. In this growing market, PaaS (Platform-as-a-Service) cloud has been an important model allowing a simple and flexible deployment of applications, without the need for dedicated networks, servers, storage and other services. Many PaaS services have been provided in the past few years and it is required to use hybrid PaaS services in order to satisfy management requirements such as legacy system integration and dynamic resource scaling. However, there are various management interfaces and different management mechanisms among PaaS clouds, which cause great difficulty and high complexity to application deployment in a hybrid cloud. In this paper, we present a runtime model based approach to using hybrid PaaS services. First, the manageability of PaaS services is abstracted as runtime models that are automatically connected with the corresponding systems. Second, we provide a unified model of PaaS services, according to the domain knowledge of current PaaS clouds. Third, the synchronization between the unified model and runtime models is ensured through model transformation. Thus, administrators are able to use hybrid PaaS services in a unified manner and management logic can be also carried out by executing programs on the unified model, which decreases the difficulty and complexity of hybrid cloud management.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85788270","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}
Software paradigm is a driving force for the evolution of software technology. With the continuous improvement in the current cloud computing and the Internet environment, software will develop further into Cloudware, which is emerging as a new software paradigm. This paper defines the concept of Cloudware, and discusses it in the context of software paradigm. Then, based on a loosely coupled von Neumann computing model, we propose a new method of constructing a Cloudware PaaS system which can directly deploy software into the cloud without any modification. By using micro-service architecture, we can achieve high performance, scalable deployment, faults tolerance and flexible configuration. Finally, we evaluate this method by carrying out an interactive delay experiment that directly focuses on users' experience, which shows the effectiveness of our method.
{"title":"Cloudware: an emerging software paradigm for cloud computing","authors":"Dong-Yu Guo, Wei Wang, Jingxuan Zhang, Qiao Xiang, Chenxi Huang, Jinda Chang, Liqing Zhang","doi":"10.1145/2993717.2993718","DOIUrl":"https://doi.org/10.1145/2993717.2993718","url":null,"abstract":"Software paradigm is a driving force for the evolution of software technology. With the continuous improvement in the current cloud computing and the Internet environment, software will develop further into Cloudware, which is emerging as a new software paradigm. This paper defines the concept of Cloudware, and discusses it in the context of software paradigm. Then, based on a loosely coupled von Neumann computing model, we propose a new method of constructing a Cloudware PaaS system which can directly deploy software into the cloud without any modification. By using micro-service architecture, we can achieve high performance, scalable deployment, faults tolerance and flexible configuration. Finally, we evaluate this method by carrying out an interactive delay experiment that directly focuses on users' experience, which shows the effectiveness of our method.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87159019","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}
Software size estimation is a crucial step in project management. According to the Standish Chaos Report, 65% of software projects are over budget or deadline; therefore, a good size estimation method is very important. However, existing estimation methods are complicated and human-effort consuming. In many industrial projects, project technical leads (PTLs) do not use these methods but just give a rough estimation based on their experience. To decrease human effort, we propose an early software size estimation (ESSE) method, which can extract semantic features from natural language requirements automatically, and build size estimation models for project. Firstly, ESSE makes a two-level semantic analysis of requirements specification documents by information extraction and activation spreading. Then, complexity-related features are extracted from the results of semantic analysis. Finally, a size estimation model is trained to predict size of new projects by regression algorithms. Experiments in real industrial datasets show that our method is effective and can be applied to real industrial projects.
{"title":"ESSE: an early software size estimation method based on auto-extracted requirements features","authors":"Cheng Zhang, Shensi Tong, Wenkai Mo, Yang Zhou, Yong Xia, Beijun Shen","doi":"10.1145/2993717.2993733","DOIUrl":"https://doi.org/10.1145/2993717.2993733","url":null,"abstract":"Software size estimation is a crucial step in project management. According to the Standish Chaos Report, 65% of software projects are over budget or deadline; therefore, a good size estimation method is very important. However, existing estimation methods are complicated and human-effort consuming. In many industrial projects, project technical leads (PTLs) do not use these methods but just give a rough estimation based on their experience. To decrease human effort, we propose an early software size estimation (ESSE) method, which can extract semantic features from natural language requirements automatically, and build size estimation models for project. Firstly, ESSE makes a two-level semantic analysis of requirements specification documents by information extraction and activation spreading. Then, complexity-related features are extracted from the results of semantic analysis. Finally, a size estimation model is trained to predict size of new projects by regression algorithms. Experiments in real industrial datasets show that our method is effective and can be applied to real industrial projects.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89870871","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}
Active random testing is a powerful technique to find concurrency bugs through predicting the potential buggy inter-leaves. It helps improve the effectiveness of random testing such that the buggy scenarios are selected actively from trivial ones. However, applying active random testing to find null pointer dereference (NPD) still faces a strong challenge in that these NPDS are usually caused by the nontrivial data races, and therefore it is insufficient to adopt a general dynamic prediction approach to find them. In this paper, we propose a race-driven active random testing approach, RADIATE, to detect NPDs. The essential idea of RADIATE is to perform a race-driven prediction of the original trace for obtaining the potential NPD scenarios, and then use active random testing technique to actively control the thread schedules for exposing the real NPDs. We have implemented our RADIATE approach, and evaluated it over 7 benchmark programs. The evaluation results show that RADIATE can effectively find the indiscoverable NPDs.
{"title":"Race-driven active random testing of null-pointer dereferences","authors":"Jianxin Xue, Xiaoning Chang","doi":"10.1145/2993717.2993722","DOIUrl":"https://doi.org/10.1145/2993717.2993722","url":null,"abstract":"Active random testing is a powerful technique to find concurrency bugs through predicting the potential buggy inter-leaves. It helps improve the effectiveness of random testing such that the buggy scenarios are selected actively from trivial ones. However, applying active random testing to find null pointer dereference (NPD) still faces a strong challenge in that these NPDS are usually caused by the nontrivial data races, and therefore it is insufficient to adopt a general dynamic prediction approach to find them. In this paper, we propose a race-driven active random testing approach, RADIATE, to detect NPDs. The essential idea of RADIATE is to perform a race-driven prediction of the original trace for obtaining the potential NPD scenarios, and then use active random testing technique to actively control the thread schedules for exposing the real NPDs. We have implemented our RADIATE approach, and evaluated it over 7 benchmark programs. The evaluation results show that RADIATE can effectively find the indiscoverable NPDs.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86307149","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}
{"title":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","authors":"","doi":"10.1145/2993717","DOIUrl":"https://doi.org/10.1145/2993717","url":null,"abstract":"","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80850399","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
扫码关注我们
求助内容：
应助结果提醒方式：