Dayong Ye, Q. Bai, Minjie Zhang, K. Win, Zhiqi Shen
Recently, task allocation in multi-agent systems has been investigated by many researchers. Some researchers suggested to have a central controller which has a global view about the environment to allocate tasks. Although centralized control brings convenience during task allocation processes, it also has some obvious weaknesses. Firstly, a central controller plays an important role in a multi-agent system, but task allocation procedures will break down if the central controller of a system cannot work properly. Secondly, centralized multi-agent architecture is not suitable for distributed working environments. In order to overcome some limitations caused by centralized control, some researchers proposed distributed task allocation protocols. They supposed that each agent has a limited local view about its direct linked neighbors, and can allocate tasks to its neighbors. However, only involving direct linked neighbors could limit resource origins, so that the task allocation efficiency will be greatly reduced. In this paper, we propose an efficient task allocation protocol for P2P multi-agent systems. This protocol allows not only neighboring agents but also indirect linked agents in the system to help with a task if needed. Through this way, agents can achieve more efficient and robust task allocations in loosely coupled distributed environments (e.g. P2P multi-agent systems). A set of experiments are presented in this paper to evaluate the efficiency and adaptability of the protocol. The experiment result shows that the protocol can work efficiently in different situations.
{"title":"An Efficient Task Allocation Protocol for P2P Multi-agent Systems","authors":"Dayong Ye, Q. Bai, Minjie Zhang, K. Win, Zhiqi Shen","doi":"10.1109/ISPA.2009.14","DOIUrl":"https://doi.org/10.1109/ISPA.2009.14","url":null,"abstract":"Recently, task allocation in multi-agent systems has been investigated by many researchers. Some researchers suggested to have a central controller which has a global view about the environment to allocate tasks. Although centralized control brings convenience during task allocation processes, it also has some obvious weaknesses. Firstly, a central controller plays an important role in a multi-agent system, but task allocation procedures will break down if the central controller of a system cannot work properly. Secondly, centralized multi-agent architecture is not suitable for distributed working environments. In order to overcome some limitations caused by centralized control, some researchers proposed distributed task allocation protocols. They supposed that each agent has a limited local view about its direct linked neighbors, and can allocate tasks to its neighbors. However, only involving direct linked neighbors could limit resource origins, so that the task allocation efficiency will be greatly reduced. In this paper, we propose an efficient task allocation protocol for P2P multi-agent systems. This protocol allows not only neighboring agents but also indirect linked agents in the system to help with a task if needed. Through this way, agents can achieve more efficient and robust task allocations in loosely coupled distributed environments (e.g. P2P multi-agent systems). A set of experiments are presented in this paper to evaluate the efficiency and adaptability of the protocol. The experiment result shows that the protocol can work efficiently in different situations.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130110141","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}
Junguo Li, Gang Huang, Xingrun Chen, Franck Chauvel, Hong Mei
Dynamic reconfiguration support in application servers is a solution to meet the demands for flexible and adaptive component-based applications. However, when an application is reconfigured, its fault-tolerant mechanism should be reconfigured either. This is one of the crucial problems we have to solve before a fault-tolerant application is dynamically reconfigured at runtime. This paper proposes a fault-tolerant sandbox to support the reconfigurable fault-tolerant mechanisms on application servers. We present how the sandbox integrates multiple error detection and recovery mechanisms, and how to reconfigure these mechanisms at runtime, especially for coordinated recovery mechanisms. We implement a prototype and perform a set of controlled experiments to demonstrate the sandbox’s capabilities.
{"title":"Supporting Reconfigurable Fault Tolerance on Application Servers","authors":"Junguo Li, Gang Huang, Xingrun Chen, Franck Chauvel, Hong Mei","doi":"10.1109/ISPA.2009.57","DOIUrl":"https://doi.org/10.1109/ISPA.2009.57","url":null,"abstract":"Dynamic reconfiguration support in application servers is a solution to meet the demands for flexible and adaptive component-based applications. However, when an application is reconfigured, its fault-tolerant mechanism should be reconfigured either. This is one of the crucial problems we have to solve before a fault-tolerant application is dynamically reconfigured at runtime. This paper proposes a fault-tolerant sandbox to support the reconfigurable fault-tolerant mechanisms on application servers. We present how the sandbox integrates multiple error detection and recovery mechanisms, and how to reconfigure these mechanisms at runtime, especially for coordinated recovery mechanisms. We implement a prototype and perform a set of controlled experiments to demonstrate the sandbox’s capabilities.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122661217","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 information era advocating ubiquitous computing, computing resources are susceptible to attack without guaranteeing security of network system. It is necessary and desirable for network system to employ powerful safeguard to protect itself against diversified vulnerabilities. In this paper, we present reverse analysis and vulnerability detection for network system software (RAVDNSS), a novel approach which uses reverse analysis and vulnerability detection technologies to deal with security problems on critical network system. Adaptive reverse analysis we propose is used to dig out potential vulnerabilities, which might be abused by unauthorized and unlawful communities. A new vulnerability detection model is designed to provide safety precautions through detecting vulnerabilities and monitoring program behaviors. Our investigation aims to improve the ability to guard network system against malicious attacks. The proposed schemes demonstrate that our approach can effectively perform security detection and management of network system software.
{"title":"Reverse Analysis and Vulnerability Detection for Network System Software","authors":"Wei Pan, Weihua Li","doi":"10.1109/ISPA.2009.73","DOIUrl":"https://doi.org/10.1109/ISPA.2009.73","url":null,"abstract":"In information era advocating ubiquitous computing, computing resources are susceptible to attack without guaranteeing security of network system. It is necessary and desirable for network system to employ powerful safeguard to protect itself against diversified vulnerabilities. In this paper, we present reverse analysis and vulnerability detection for network system software (RAVDNSS), a novel approach which uses reverse analysis and vulnerability detection technologies to deal with security problems on critical network system. Adaptive reverse analysis we propose is used to dig out potential vulnerabilities, which might be abused by unauthorized and unlawful communities. A new vulnerability detection model is designed to provide safety precautions through detecting vulnerabilities and monitoring program behaviors. Our investigation aims to improve the ability to guard network system against malicious attacks. The proposed schemes demonstrate that our approach can effectively perform security detection and management of network system software.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117205350","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 concepts of self, nonself, antibody, antigen and vaccine in in-Depth-Defense system for Network Security was presented in this paper, the architecture of in-Depth Defense for network intrusion and detection based on immune principle is proposed. The intrusion information gotten from current monitored network is encapsulated and sent to the neighbor network as bacterin; therefore the neighbor network can make use of the bacterin and predict the danger of network. We can use communicate agent cooperated with response agent to achieve active defense formwork. The experimental results show that the new model not only actualizes an active prevention method but also improves the ability of intrusion detection and prevention than that of the traditional passive intrusion prevention systems
{"title":"A Method of In-Depth-Defense for Network Security Based on Immunity Principles","authors":"Yaping Jiang, Jianhua Zhou, Yong Gan, Zengyu Cai","doi":"10.1109/ISPA.2009.65","DOIUrl":"https://doi.org/10.1109/ISPA.2009.65","url":null,"abstract":"The concepts of self, nonself, antibody, antigen and vaccine in in-Depth-Defense system for Network Security was presented in this paper, the architecture of in-Depth Defense for network intrusion and detection based on immune principle is proposed. The intrusion information gotten from current monitored network is encapsulated and sent to the neighbor network as bacterin; therefore the neighbor network can make use of the bacterin and predict the danger of network. We can use communicate agent cooperated with response agent to achieve active defense formwork. The experimental results show that the new model not only actualizes an active prevention method but also improves the ability of intrusion detection and prevention than that of the traditional passive intrusion prevention systems","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121113128","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 security of inter-domain routing system greatly depends on the trustworthiness of routing information and routing behavior of autonomous system (AS). Many researches on e-commerce, grid, and p2p have proven that reputation mechanism is helpful to inhibit the spread of false route and the occurrence of malicious routing behavior. To increase AS resistance to malicious routing attack, we designs an alliance based reputation model for AS routing behavior trust evaluation. Our approach calculates AS reputation with the Bayesian probability model and manages AS reputation with AS alliance. Compared with the fully distributed reputation model, our model has lower storage and communication overhead. This reputation model is incremental deployment and easy to implement. It can be employed for securing AS routing and assisting malicious behavior detection.
{"title":"An Alliance Based Reputation Model for Internet Autonomous System Trust Evaluation","authors":"Ning Hu, Peidong Zhu, Peng Zou","doi":"10.1109/ISPA.2009.104","DOIUrl":"https://doi.org/10.1109/ISPA.2009.104","url":null,"abstract":"The security of inter-domain routing system greatly depends on the trustworthiness of routing information and routing behavior of autonomous system (AS). Many researches on e-commerce, grid, and p2p have proven that reputation mechanism is helpful to inhibit the spread of false route and the occurrence of malicious routing behavior. To increase AS resistance to malicious routing attack, we designs an alliance based reputation model for AS routing behavior trust evaluation. Our approach calculates AS reputation with the Bayesian probability model and manages AS reputation with AS alliance. Compared with the fully distributed reputation model, our model has lower storage and communication overhead. This reputation model is incremental deployment and easy to implement. It can be employed for securing AS routing and assisting malicious behavior detection.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132926097","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}
Xiang Zhang, Jie Ma, Yanchao Miao, Qingwei Meng, Dan Meng
The overhead caused by virtualization makes it difficult to apply VM in the applications which require high degrees of both performance isolation and efficiency, such as the high performance computing. In this paper, we present a lightweight virtual machine, named Solo. It simplifies the design of VMM greatly by making most privileged instructions bypass the VMM, except the I/O operations. Solo allows VM running directly on hardware with the highest privileges, therefore greatly reduces the overhead caused by virtualization. Our evaluation shows that Solo not only guarantees the VM performance isolation, but also improves VM performance to the level of traditional OS, and thus meets the requirements of the high performance applications without special hardware support.
{"title":"Solo: A Lightweight Virtual Machine","authors":"Xiang Zhang, Jie Ma, Yanchao Miao, Qingwei Meng, Dan Meng","doi":"10.1109/ISPA.2009.7","DOIUrl":"https://doi.org/10.1109/ISPA.2009.7","url":null,"abstract":"The overhead caused by virtualization makes it difficult to apply VM in the applications which require high degrees of both performance isolation and efficiency, such as the high performance computing. In this paper, we present a lightweight virtual machine, named Solo. It simplifies the design of VMM greatly by making most privileged instructions bypass the VMM, except the I/O operations. Solo allows VM running directly on hardware with the highest privileges, therefore greatly reduces the overhead caused by virtualization. Our evaluation shows that Solo not only guarantees the VM performance isolation, but also improves VM performance to the level of traditional OS, and thus meets the requirements of the high performance applications without special hardware support.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134455616","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}
Guibin Wang, Xuejun Yang, Y. Zhang, T. Tang, Xudong Fang
Graphic Processing Unit (GPU), with many light-weight data-parallel cores, can provide substantial parallel computational power to accelerate general purpose applications. But the powerful computing capacity could not be fully utilized for memory-intensive applications, which are limited by off-chip memory bandwidth and latency. Stencil computation has abundant parallelism and low computational intensity which make it a useful architectural evaluation benchmark. In this paper, we propose some memory optimizations for a stencil based application mgrid from SPEC 2K benchmarks. Through exploiting data locality in 3-level memory hierarchies and tuning the thread granularity, we reduce the pressure on the off-chip memory bandwidth. To hide the long off-chip memory access latency, we further prefetch data during computation through double-buffer. In order to fully exploit the CPU-GPU heterogeneous system, we redistribute the computation between these two computing resource. Through all these optimizations, we gain 24.2x speedup compared to the simple mapping version, and get as high as 34.3x speedup when compared with a CPU implementation.
{"title":"Program Optimization of Stencil Based Application on the GPU-Accelerated System","authors":"Guibin Wang, Xuejun Yang, Y. Zhang, T. Tang, Xudong Fang","doi":"10.1109/ISPA.2009.70","DOIUrl":"https://doi.org/10.1109/ISPA.2009.70","url":null,"abstract":"Graphic Processing Unit (GPU), with many light-weight data-parallel cores, can provide substantial parallel computational power to accelerate general purpose applications. But the powerful computing capacity could not be fully utilized for memory-intensive applications, which are limited by off-chip memory bandwidth and latency. Stencil computation has abundant parallelism and low computational intensity which make it a useful architectural evaluation benchmark. In this paper, we propose some memory optimizations for a stencil based application mgrid from SPEC 2K benchmarks. Through exploiting data locality in 3-level memory hierarchies and tuning the thread granularity, we reduce the pressure on the off-chip memory bandwidth. To hide the long off-chip memory access latency, we further prefetch data during computation through double-buffer. In order to fully exploit the CPU-GPU heterogeneous system, we redistribute the computation between these two computing resource. Through all these optimizations, we gain 24.2x speedup compared to the simple mapping version, and get as high as 34.3x speedup when compared with a CPU implementation.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128073552","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}
Techniques for building local area network clusters differ from those used for large scale harvesting of idle computing power. The overlapping non dedicated clusters (ONDC) architecture is trying to mix advantages of both techniques. Clusters build in ONDC style can be deployed both on small scale local networks, but as well in large scale over the Internet deployments. In this paper we analyze the security requirements of ONDC and describe our solution. The solution was implemented for the Clondike clustering system, but the same approach can be used for any other ONDC system. The proposed system is inspired by the security mechanisms of existing P2P grid systems and various trust management systems, but it is tailored to exactly match the ONDC requirements. An important aspect of the proposed solution is a combination of locally issued identity based access control and certificates based delegated authorizations. While the identity based access control is the most intuitive way how to express trust for the users of the system, delegated authorizations are an answer for more complex cases. The unique feature of the proposed system is configurable mechanism for authorization distributions and storage that enables users to trade-off a local information availability with local storage requirements.
{"title":"Security System for Overlapping Non-dedicated Clusters","authors":"M. Stáva, P. Tvrdík","doi":"10.1109/ISPA.2009.19","DOIUrl":"https://doi.org/10.1109/ISPA.2009.19","url":null,"abstract":"Techniques for building local area network clusters differ from those used for large scale harvesting of idle computing power. The overlapping non dedicated clusters (ONDC) architecture is trying to mix advantages of both techniques. Clusters build in ONDC style can be deployed both on small scale local networks, but as well in large scale over the Internet deployments. In this paper we analyze the security requirements of ONDC and describe our solution. The solution was implemented for the Clondike clustering system, but the same approach can be used for any other ONDC system. The proposed system is inspired by the security mechanisms of existing P2P grid systems and various trust management systems, but it is tailored to exactly match the ONDC requirements. An important aspect of the proposed solution is a combination of locally issued identity based access control and certificates based delegated authorizations. While the identity based access control is the most intuitive way how to express trust for the users of the system, delegated authorizations are an answer for more complex cases. The unique feature of the proposed system is configurable mechanism for authorization distributions and storage that enables users to trade-off a local information availability with local storage requirements.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122960334","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}
M. Hedayat, Wentong Cai, S. Turner, Shayan Shahand
Grid computing is a fundamental technology for large scale distributed resource sharing. Workflow management is becoming one of the most important Grid services. A lot of research work has been done on different issues involved in workflow management systems. The focus of this paper is on three areas: workflow partitioning, enactment and data movement. A new workflow management system called parallel and distributed workflow management system (PDWMS) is proposed. In this system the execution of workflow is done by a network of collaborative engines. To achieve this target, the original abstract workflow (input of the system) is partitioned into parallel parts, using a new proposed partitioning algorithm. PDWMS’s data movement, which is categorized into local and global models, uses a peer-to-peer approach.
{"title":"Distributed Execution of Workflow Using Parallel Partitioning","authors":"M. Hedayat, Wentong Cai, S. Turner, Shayan Shahand","doi":"10.1109/ISPA.2009.96","DOIUrl":"https://doi.org/10.1109/ISPA.2009.96","url":null,"abstract":"Grid computing is a fundamental technology for large scale distributed resource sharing. Workflow management is becoming one of the most important Grid services. A lot of research work has been done on different issues involved in workflow management systems. The focus of this paper is on three areas: workflow partitioning, enactment and data movement. A new workflow management system called parallel and distributed workflow management system (PDWMS) is proposed. In this system the execution of workflow is done by a network of collaborative engines. To achieve this target, the original abstract workflow (input of the system) is partitioned into parallel parts, using a new proposed partitioning algorithm. PDWMS’s data movement, which is categorized into local and global models, uses a peer-to-peer approach.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124471305","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 this paper, we analyze the basic characteristics of the propagation network. Using the modeling framework Algebra of System (AoS), we convert the complexity of the network structure into the quantity of data. By using OPN(Object-Process Network) which is an executable meta-language based on the mathematical specification of AoS, we build a framework to describe and evaluate the performance of internet networking during Beijing Olympic Games, which is collected by GPERF, a globally distributed performance measurement system of China Education and Research Network (CERNET). In this framework, we deal with the information of QoS for simulation, visualization, and analysis of user’s needs in a uniform algebraic way.
{"title":"Analysing Internet Information Propagation Using Quality of Service Methodology Based on Algebra of System","authors":"T. Wang, Q. Qu, Benjamin H. Y. Koo","doi":"10.1109/ISPA.2009.87","DOIUrl":"https://doi.org/10.1109/ISPA.2009.87","url":null,"abstract":"In this paper, we analyze the basic characteristics of the propagation network. Using the modeling framework Algebra of System (AoS), we convert the complexity of the network structure into the quantity of data. By using OPN(Object-Process Network) which is an executable meta-language based on the mathematical specification of AoS, we build a framework to describe and evaluate the performance of internet networking during Beijing Olympic Games, which is collected by GPERF, a globally distributed performance measurement system of China Education and Research Network (CERNET). In this framework, we deal with the information of QoS for simulation, visualization, and analysis of user’s needs in a uniform algebraic way.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121634208","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
扫码关注我们
求助内容：
应助结果提醒方式：