Cloud computing and cloud forensics are probably the two most popular and debated IT topics in recent years, implying relevant technological and economic opportunities, the former, and open issues such as the ability to perform digital investigations in the cloud, the latter. In cloud forensics, the distributed nature of data processing in the cloud and the lack of physical access to digital artifacts on the server side represent, indeed, a serious concern for investigators and stakeholders, as traditional approaches to evidence collection and recovery may be no longer applicable. In this paper we discuss technical aspects of digital forensics in cloud computing environments and present results of a case study about user-cloud interaction, aimed at assessing whether existing digital forensics techniques are still applicable to cloud investigations. We conclude proposing a new methodology for automatic cloud-based artifact categorization as a future work.
{"title":"A Case Study on Digital Forensics in the Cloud","authors":"F. Marturana, G. Me, S. Tacconi","doi":"10.1109/CyberC.2012.26","DOIUrl":"https://doi.org/10.1109/CyberC.2012.26","url":null,"abstract":"Cloud computing and cloud forensics are probably the two most popular and debated IT topics in recent years, implying relevant technological and economic opportunities, the former, and open issues such as the ability to perform digital investigations in the cloud, the latter. In cloud forensics, the distributed nature of data processing in the cloud and the lack of physical access to digital artifacts on the server side represent, indeed, a serious concern for investigators and stakeholders, as traditional approaches to evidence collection and recovery may be no longer applicable. In this paper we discuss technical aspects of digital forensics in cloud computing environments and present results of a case study about user-cloud interaction, aimed at assessing whether existing digital forensics techniques are still applicable to cloud investigations. We conclude proposing a new methodology for automatic cloud-based artifact categorization as a future work.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126034705","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}
The efficiency and flexibility of current state-of-the-art memory compilers are often limited due to the heavy dependence on specific circuit structure, which leads to the high recurring design cost and long design cycle. To address these issues systematically, a set of novel design schemes have been proposed in this paper, including a general, scalable memory architecture that is suitable for various memories, an highly efficient layout tiling method based on overlap-distance, an automatic and easy-to-use template expansion scheme using an ASP-style tag language, and a general and accurate timing and power prediction technique based on a piecewise polynomial interpolation algorithm. To verify the effectiveness of these schemes proposed in this paper, a single-port SRAM compiler with the maximum capacity of 1Mb has been developed and taped out successfully in SMIC 65nm process.
{"title":"An Efficient and Flexible Embedded Memory IP Compiler","authors":"Ming Chen, B. Na","doi":"10.1109/CyberC.2012.52","DOIUrl":"https://doi.org/10.1109/CyberC.2012.52","url":null,"abstract":"The efficiency and flexibility of current state-of-the-art memory compilers are often limited due to the heavy dependence on specific circuit structure, which leads to the high recurring design cost and long design cycle. To address these issues systematically, a set of novel design schemes have been proposed in this paper, including a general, scalable memory architecture that is suitable for various memories, an highly efficient layout tiling method based on overlap-distance, an automatic and easy-to-use template expansion scheme using an ASP-style tag language, and a general and accurate timing and power prediction technique based on a piecewise polynomial interpolation algorithm. To verify the effectiveness of these schemes proposed in this paper, a single-port SRAM compiler with the maximum capacity of 1Mb has been developed and taped out successfully in SMIC 65nm process.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128420120","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}
Cloud computing services (CCS) is a modern blend of provisioning technologies and management of resources formed on limited requirements such as accessibility, hypotheses of elasticity and massive deployment. This paradigm offers on-demand IT resources such as applications, networks, services, data, servers and storage that are readily accessible through the Internet. Need for globalisation and collaboration is currently driving the adoption/rollout of cloud technology. Therefore, the current provision of CCS is focused and segmented, addressing explicit concerns according to these needs. This presents challenges for integrated services such as the missing interfaces concerning the diverse attributes of CCS, the required techniques and dependencies for efficient rollout/adoption. This paper proposes 6-view angles necessary for offering CCS, including all their important criteria and categories. These proposed views should help CCS architects and software developers achieve diverse optimised services, enhance these services in relation to communication, power usage, and interfaces that will ease cost and time, make these services desirable and accessible.
{"title":"Holistic View Angles of Cloud Computing Services Provisions","authors":"C. Oriaku, Ihsam Alshahib Lami","doi":"10.1109/CyberC.2012.24","DOIUrl":"https://doi.org/10.1109/CyberC.2012.24","url":null,"abstract":"Cloud computing services (CCS) is a modern blend of provisioning technologies and management of resources formed on limited requirements such as accessibility, hypotheses of elasticity and massive deployment. This paradigm offers on-demand IT resources such as applications, networks, services, data, servers and storage that are readily accessible through the Internet. Need for globalisation and collaboration is currently driving the adoption/rollout of cloud technology. Therefore, the current provision of CCS is focused and segmented, addressing explicit concerns according to these needs. This presents challenges for integrated services such as the missing interfaces concerning the diverse attributes of CCS, the required techniques and dependencies for efficient rollout/adoption. This paper proposes 6-view angles necessary for offering CCS, including all their important criteria and categories. These proposed views should help CCS architects and software developers achieve diverse optimised services, enhance these services in relation to communication, power usage, and interfaces that will ease cost and time, make these services desirable and accessible.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"40 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133196413","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}
Coarse-grained reconfigurable architecture (CGRA) aims to provide satisfying solutions in terms of both efficiency and flexibility. However, to meet the ever increasing performance demand for multimedia applications, the scale of CGRAs should be larger enough to contain more computation resources for higher processing performance. In this paper, we present a hybrid-priority configuration cache supervision approach to optimize the reconfiguration process of large-scale coarse-grained reconfigurable architectures for multimedia applications. By analyzing the reconfiguration features during mapping multimedia applications onto large-scale CGRAs, three types of priority are summarized and adopted to the supervision strategy of hierarchical configuration cache. Taking the H.264 standard as benchmark, the experimental results show that the proposed approach can improve the reconfiguration efficiency of the large-scale CGRAs much, even with reduced configuration cache size.
{"title":"Hybrid-Priority Configuration Cache Supervision Method for Coarse Grained Reconfigurable Architecture","authors":"Bo Liu, Peng Cao, Jinjiang Yang","doi":"10.1109/CyberC.2012.74","DOIUrl":"https://doi.org/10.1109/CyberC.2012.74","url":null,"abstract":"Coarse-grained reconfigurable architecture (CGRA) aims to provide satisfying solutions in terms of both efficiency and flexibility. However, to meet the ever increasing performance demand for multimedia applications, the scale of CGRAs should be larger enough to contain more computation resources for higher processing performance. In this paper, we present a hybrid-priority configuration cache supervision approach to optimize the reconfiguration process of large-scale coarse-grained reconfigurable architectures for multimedia applications. By analyzing the reconfiguration features during mapping multimedia applications onto large-scale CGRAs, three types of priority are summarized and adopted to the supervision strategy of hierarchical configuration cache. Taking the H.264 standard as benchmark, the experimental results show that the proposed approach can improve the reconfiguration efficiency of the large-scale CGRAs much, even with reduced configuration cache size.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133045893","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}
Through converting transportation data into some conditional attributes and one decision attribute which constitute the decision table, we use Rough Set theory (RS) to extract rules for traffic state evaluation. This method, named twi-extraction, combines the first extraction by the confidence threshold and the second extraction on the eliminated rules by the matching accuracy. Since the computational intensity is mainly placed onto the attribute significance computation of twi-extraction, Message Passing Interface (MPI) is adopted to parallelize it for acceleration. The experimental results show that by comparing the twi-extraction with the first extraction and pseudo twi-extraction, our MPI-based implementation can achieve both higher matching accuracy and higher computing efficiency.
{"title":"MPI-Based Twi-extraction of Traffic State Evaluation Rules","authors":"Yingjie Xia, Yiwen Fang, Zhoumin Ye","doi":"10.1109/CyberC.2012.10","DOIUrl":"https://doi.org/10.1109/CyberC.2012.10","url":null,"abstract":"Through converting transportation data into some conditional attributes and one decision attribute which constitute the decision table, we use Rough Set theory (RS) to extract rules for traffic state evaluation. This method, named twi-extraction, combines the first extraction by the confidence threshold and the second extraction on the eliminated rules by the matching accuracy. Since the computational intensity is mainly placed onto the attribute significance computation of twi-extraction, Message Passing Interface (MPI) is adopted to parallelize it for acceleration. The experimental results show that by comparing the twi-extraction with the first extraction and pseudo twi-extraction, our MPI-based implementation can achieve both higher matching accuracy and higher computing efficiency.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128769989","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}
Simulation based decision tools have been playing a significant role in the flood mitigation operation, especially for a river network with a large number of flood control structures. However, to evaluate the feasibility of alternative scenarios, decision-makers must repeat executing a simulation, which is a tiresome and time-consuming work. Based upon the technique of simulation cloning, a parallel and progressive incremental simulation cloning (PPISC) approach was proposed in this paper to concurrently analyze alternative scenarios of flood mitigation operations in the upper and middle reach of Huaihe River system. The objective of which was to optimize the simulation execution by avoiding unnecessary repeated computation among multiple associated scenarios. The basic idea of the PPISC was: merging associated scenarios into a compound one and performing the parallel incremental simulation cloning for each compound scenario according to the time sequence of its decision points. Both the theoretical analysis and test results show that the PPISC algorithm has the characteristic of high computational performance and twice more the parallel efficiency than traditional parallel and distributed simulation methods under the same time complexity.
{"title":"Parallel Cloning Simulation of Flood Mitigation Operations in the Upper-Middle Reach of Huaihe River","authors":"Guoyi Zhang, Minghui Fang, Mingkai Qian, Shijin Xu","doi":"10.1109/CyberC.2012.21","DOIUrl":"https://doi.org/10.1109/CyberC.2012.21","url":null,"abstract":"Simulation based decision tools have been playing a significant role in the flood mitigation operation, especially for a river network with a large number of flood control structures. However, to evaluate the feasibility of alternative scenarios, decision-makers must repeat executing a simulation, which is a tiresome and time-consuming work. Based upon the technique of simulation cloning, a parallel and progressive incremental simulation cloning (PPISC) approach was proposed in this paper to concurrently analyze alternative scenarios of flood mitigation operations in the upper and middle reach of Huaihe River system. The objective of which was to optimize the simulation execution by avoiding unnecessary repeated computation among multiple associated scenarios. The basic idea of the PPISC was: merging associated scenarios into a compound one and performing the parallel incremental simulation cloning for each compound scenario according to the time sequence of its decision points. Both the theoretical analysis and test results show that the PPISC algorithm has the characteristic of high computational performance and twice more the parallel efficiency than traditional parallel and distributed simulation methods under the same time complexity.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116707088","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}
As the Internet rapidly establishes itself as a major communications conduit, growing concern exists about personal privacy issues and the related ownership of personal data. Privacy and personal data may be vulnerable to exposure by unauthorized individuals, by commercial entities wishing to profit from the data, and even by the individual to whom the data pertains. Although fragments of data may not present a privacy issue on their own, data mining and other aggregation methods quickly assemble data to create a considerably more sensitive "whole. " This article presents an examination of aggregated personal data ownership, or "the digital aggregated self, " using a literature review and an ethical argument. We propose that while server owners may possess the disaggregated user data stored on their servers, individuals should hold the rights to their set of aggregated data that is stored throughout the entire network of online servers.
{"title":"The Digital Aggregated Self: A Literature Review","authors":"Lynne Y. Williams, Diane M. Neal","doi":"10.1109/CyberC.2012.36","DOIUrl":"https://doi.org/10.1109/CyberC.2012.36","url":null,"abstract":"As the Internet rapidly establishes itself as a major communications conduit, growing concern exists about personal privacy issues and the related ownership of personal data. Privacy and personal data may be vulnerable to exposure by unauthorized individuals, by commercial entities wishing to profit from the data, and even by the individual to whom the data pertains. Although fragments of data may not present a privacy issue on their own, data mining and other aggregation methods quickly assemble data to create a considerably more sensitive \"whole. \" This article presents an examination of aggregated personal data ownership, or \"the digital aggregated self, \" using a literature review and an ethical argument. We propose that while server owners may possess the disaggregated user data stored on their servers, individuals should hold the rights to their set of aggregated data that is stored throughout the entire network of online servers.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114209326","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}
With the increasingly efficient streaming of multimedia standard and the computational resources in the coarse grained reconfigurable architecture (CGRA), how to provide high data throughput for the CGRA for multimedia application in real time becomes a bottleneck challenge. In this paper, a data reuse method is proposed based on the pre-parsing mechanism of MB information in advance. The pre-parsed information guides the replacement process of the data buffer. By employing the data reuse method, the required bandwidth can be reduced by nearly 50% on average and the CGRA can support 1080p@30fps video decoding at the frequency of 200MHz.
{"title":"Memory Bandwidth Optimization Strategy of Coarse-Grained Reconfigurable Architecture","authors":"Peng Cao, Huiyan Jiang, Bo Liu, Weiwei Shan","doi":"10.1109/CyberC.2012.45","DOIUrl":"https://doi.org/10.1109/CyberC.2012.45","url":null,"abstract":"With the increasingly efficient streaming of multimedia standard and the computational resources in the coarse grained reconfigurable architecture (CGRA), how to provide high data throughput for the CGRA for multimedia application in real time becomes a bottleneck challenge. In this paper, a data reuse method is proposed based on the pre-parsing mechanism of MB information in advance. The pre-parsed information guides the replacement process of the data buffer. By employing the data reuse method, the required bandwidth can be reduced by nearly 50% on average and the CGRA can support 1080p@30fps video decoding at the frequency of 200MHz.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133427307","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}
Coarse-Grained Reconfigurable Architectures (CGRAs) can achieve both high performance and flexibility, and CGRAs with multi-array are used to meet the increasing performance requirement of multimedia applications. Meanwhile, the context size also becomes quite large, so many CGRAs use a configuration cache to reduce reconfiguration overhead. However, with high power consumption, configuration cache management is still a challenge. This paper first analyzes context features of media algorithms, and introduces the base hardware architecture. Then a configuration cache management technique is proposed to implement H.264 video decoding on the base architecture. It includes a novel configuration cache structure and a configuration cache replacement algorithm based on Context Sequence Prefetching & Priority (CSPP). The experimental results show that the proposed approach can drastically improve system performance and reduce power consumption. The average configuration cache hit rate of CSPP is 96.83%, the speedup ranges from 64% to 109%, and our approach can support H.264 1080p@30fps decoding at a 200MHz working frequency.
{"title":"Configuration Cache Management for Coarse-Grained Reconfigurable Architecture with Multi-Array","authors":"Peng Cao, Yong Cai, Bo Liu, Weiwei Shan","doi":"10.1109/CyberC.2012.55","DOIUrl":"https://doi.org/10.1109/CyberC.2012.55","url":null,"abstract":"Coarse-Grained Reconfigurable Architectures (CGRAs) can achieve both high performance and flexibility, and CGRAs with multi-array are used to meet the increasing performance requirement of multimedia applications. Meanwhile, the context size also becomes quite large, so many CGRAs use a configuration cache to reduce reconfiguration overhead. However, with high power consumption, configuration cache management is still a challenge. This paper first analyzes context features of media algorithms, and introduces the base hardware architecture. Then a configuration cache management technique is proposed to implement H.264 video decoding on the base architecture. It includes a novel configuration cache structure and a configuration cache replacement algorithm based on Context Sequence Prefetching & Priority (CSPP). The experimental results show that the proposed approach can drastically improve system performance and reduce power consumption. The average configuration cache hit rate of CSPP is 96.83%, the speedup ranges from 64% to 109%, and our approach can support H.264 1080p@30fps decoding at a 200MHz working frequency.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130175883","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}
In recent years, wireless technology has enjoyed a tremendous rise in popularity and its usage opens new fields of applications. Due to their possible deployment in remote locations for civil, educational, scientific, military purposes and security which includes intrusion detection and intrusion prevention are of utmost importance. Distributed wireless sensor networks have problems on detecting and preventing malicious nodes which always bring destructive threats and compromise multiple sensor nodes. Therefore, sensor networks need to support an authentication service for sensor identity and message transmission. Furthermore, intrusion detection and prevention schemes are always integrated in sensor security appliances so that they can enhance network security by discovering malicious or compromised nodes. In this paper, we propose an energy-aware protocol for intrusion detection in wireless sensor networks (WSNs). Detection system is implemented based on learning automata concept. We implemented the system in network simulator "GloMoSim". Also we have rigorously evaluated the performance of our proposed solution by performing a variety of experiments and have found our solution approach to be promising.
{"title":"A Protocol for Intrusion Detection Based on Learning Automata in Forwarding Packets for Distributed Wireless Sensor Networks","authors":"Amirhosein Fathinavid, Amir Bagheri Aghababa","doi":"10.1109/CyberC.2012.69","DOIUrl":"https://doi.org/10.1109/CyberC.2012.69","url":null,"abstract":"In recent years, wireless technology has enjoyed a tremendous rise in popularity and its usage opens new fields of applications. Due to their possible deployment in remote locations for civil, educational, scientific, military purposes and security which includes intrusion detection and intrusion prevention are of utmost importance. Distributed wireless sensor networks have problems on detecting and preventing malicious nodes which always bring destructive threats and compromise multiple sensor nodes. Therefore, sensor networks need to support an authentication service for sensor identity and message transmission. Furthermore, intrusion detection and prevention schemes are always integrated in sensor security appliances so that they can enhance network security by discovering malicious or compromised nodes. In this paper, we propose an energy-aware protocol for intrusion detection in wireless sensor networks (WSNs). Detection system is implemented based on learning automata concept. We implemented the system in network simulator \"GloMoSim\". Also we have rigorously evaluated the performance of our proposed solution by performing a variety of experiments and have found our solution approach to be promising.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134214691","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
扫码关注我们
求助内容：
应助结果提醒方式：