Many researchers have been interested in the processor-memory bottleneck problem. Quite a few image applications are only interested in one or more partial regions in the images. This paper proposes an efficient multi-access memory scheme for these image applications with multiple interested regions. A multi-module memory structure is presented between the main memory and the processing units, which achieves conflict-free parallel access of randomly aligned rectangular blocks of data in the interested regions. To increase the accessing efficiency, only interested regions are transmitted from main memory to secondary multi-module memory structure, and overlapped data between different regions are reused without retransfer. The addressing scheme of secondary multi-module memory is not based on predetermined addressing function, but based on a table structure mapping virtual addresses of required data to physical addresses of secondary memory modules, which increases data reusability without losing addressing consistency. The table content is updated for addressing consistency every time processing a new region. The proposed twin-table structure and block-rescheduling scheme reduce the addressing latency. Synthesis results on FPGA indicate small hardware costs for a range of access pattern dimensions. Significant transfer speedups in our experiments are achieved when compared with the scheme that accesses main memory directly.
{"title":"Rectangularly Multi-Module Memory System with Table-Based Dynamic Addressing Scheme","authors":"Jinbo Xu, Y. Dou, Jie Zhou","doi":"10.1109/NAS.2008.42","DOIUrl":"https://doi.org/10.1109/NAS.2008.42","url":null,"abstract":"Many researchers have been interested in the processor-memory bottleneck problem. Quite a few image applications are only interested in one or more partial regions in the images. This paper proposes an efficient multi-access memory scheme for these image applications with multiple interested regions. A multi-module memory structure is presented between the main memory and the processing units, which achieves conflict-free parallel access of randomly aligned rectangular blocks of data in the interested regions. To increase the accessing efficiency, only interested regions are transmitted from main memory to secondary multi-module memory structure, and overlapped data between different regions are reused without retransfer. The addressing scheme of secondary multi-module memory is not based on predetermined addressing function, but based on a table structure mapping virtual addresses of required data to physical addresses of secondary memory modules, which increases data reusability without losing addressing consistency. The table content is updated for addressing consistency every time processing a new region. The proposed twin-table structure and block-rescheduling scheme reduce the addressing latency. Synthesis results on FPGA indicate small hardware costs for a range of access pattern dimensions. Significant transfer speedups in our experiments are achieved when compared with the scheme that accesses main memory directly.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122606907","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}
IDOP_SP (IPTV DRM interactive operating platform security protocol) protocol is a applied complicated protocol which distributes digital media content in the Internet. The flow of the protocol is based on the behavior of Web service composition and the digital content is transmitted to the customer in the form of hybrid digital objects. But the protocol security only can be assured after the protocol is formally analyzed and verified. In this paper, we use a Petri Net to model the IDOP_SP and verify the security of the IDOP_SP protocol based on the model. The result shows that the applied complicated protocol is secure which satisfies confidentiality, authentication and non-repudiation. It also shows that the Petri net is a good tool to verify the security of complicated protocols.
{"title":"Formal Proof of the IDOP_SP Protocol Based on the Petri Net","authors":"Yingjiu Guo, Chuang Lin, H. Yin","doi":"10.1109/NAS.2008.50","DOIUrl":"https://doi.org/10.1109/NAS.2008.50","url":null,"abstract":"IDOP_SP (IPTV DRM interactive operating platform security protocol) protocol is a applied complicated protocol which distributes digital media content in the Internet. The flow of the protocol is based on the behavior of Web service composition and the digital content is transmitted to the customer in the form of hybrid digital objects. But the protocol security only can be assured after the protocol is formally analyzed and verified. In this paper, we use a Petri Net to model the IDOP_SP and verify the security of the IDOP_SP protocol based on the model. The result shows that the applied complicated protocol is secure which satisfies confidentiality, authentication and non-repudiation. It also shows that the Petri net is a good tool to verify the security of complicated protocols.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078043","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 trend of networking and the growth of data value, networked storage security becomes hotpot of research. Aiming at the scalability and security requirement of massive storage system, we proposed a security storage service model combining storage mechanism and security policy and designed a set of scalable third-party security protocols. The protocols adopt public-key cryptography to guarantee the integrity of capability, avoiding the maintenance of shared key. The results of the formal analysis logically ensure the feasibility of the proposed security protocol. Furthermore, the overhead evaluation of the capability illustrates that the security protocol can meet the scalability requirement of storage system.
{"title":"Design and Analysis of a Scalable Third-Party Storage Security Protocol","authors":"Hu Jianzhong, Xie Changsheng, Zhong Haifeng","doi":"10.1109/NAS.2008.11","DOIUrl":"https://doi.org/10.1109/NAS.2008.11","url":null,"abstract":"With the trend of networking and the growth of data value, networked storage security becomes hotpot of research. Aiming at the scalability and security requirement of massive storage system, we proposed a security storage service model combining storage mechanism and security policy and designed a set of scalable third-party security protocols. The protocols adopt public-key cryptography to guarantee the integrity of capability, avoiding the maintenance of shared key. The results of the formal analysis logically ensure the feasibility of the proposed security protocol. Furthermore, the overhead evaluation of the capability illustrates that the security protocol can meet the scalability requirement of storage system.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114619945","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}
Distributed hash table (DHT) based algorithms have been proposed to solve the routing issues in large-scale peer-to-peer (P2P) applications. DHT systems create an elegant peer-to-peer service model and work perfect in a homogeneous environment. Workload are evenly distributed on every participating peer and system is supposed to achieve the optimal performance. However, in the real world, the complicated scenarios such as peerspsila capability heterogeneity, diverse file popularities, and mismatching problem between physical network structure and logical routing data structure, jeopardize the efficiency of DHT infrastructure and may result in serious load imbalance problem. In this paper, we propose -- POND, a novel and efficient DHT algorithm to relieve the above problem. In POND, peers are divided into two types: main peers (MP) and shadow peers(SP). As other DHT systems, POND splits the name space into several disjointed zones. However, unlike other systems which only have one peer in charge of each zone, in POND, we use zone overlapping technique. In each zone, a MP and several SPs are used for services. Any of them is capable to handle service requests fallen into this zone. When a new request is coming,the peer with the minimal load has the high possibility to be chosen to provide the service. Thus, the risk of overload problem is reduced. With the introduction of shadow peers, POND also provides better failure tolerance and relieves the hot spot problem. Moreover, POND can improve the routing performance by reducing the average number of routing hops per request. We conduct extensive simulation experiments and the results show POND is superior to other DHT algorithms.
{"title":"POND: The Power of Zone Overlapping in DHT Networks","authors":"Zhiyong Xu, Jizhong Han, L. Bhuyan","doi":"10.1109/NAS.2008.56","DOIUrl":"https://doi.org/10.1109/NAS.2008.56","url":null,"abstract":"Distributed hash table (DHT) based algorithms have been proposed to solve the routing issues in large-scale peer-to-peer (P2P) applications. DHT systems create an elegant peer-to-peer service model and work perfect in a homogeneous environment. Workload are evenly distributed on every participating peer and system is supposed to achieve the optimal performance. However, in the real world, the complicated scenarios such as peerspsila capability heterogeneity, diverse file popularities, and mismatching problem between physical network structure and logical routing data structure, jeopardize the efficiency of DHT infrastructure and may result in serious load imbalance problem. In this paper, we propose -- POND, a novel and efficient DHT algorithm to relieve the above problem. In POND, peers are divided into two types: main peers (MP) and shadow peers(SP). As other DHT systems, POND splits the name space into several disjointed zones. However, unlike other systems which only have one peer in charge of each zone, in POND, we use zone overlapping technique. In each zone, a MP and several SPs are used for services. Any of them is capable to handle service requests fallen into this zone. When a new request is coming,the peer with the minimal load has the high possibility to be chosen to provide the service. Thus, the risk of overload problem is reduced. With the introduction of shadow peers, POND also provides better failure tolerance and relieves the hot spot problem. Moreover, POND can improve the routing performance by reducing the average number of routing hops per request. We conduct extensive simulation experiments and the results show POND is superior to other DHT algorithms.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126401841","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}
Yong Feng, Zhongfu Wu, Jiang Zhong, Chunxiao Ye, Kaigui Wu
In mobile IPv6, the location of a mobile node (MN) is obtained by implementing a binding update (BU) process. During the process, the unauthenticated BU message may give rise to many security risks, such as denial-of-service (DoS) attack. Thus, authentication of the BU message is most important for the security of mobile IPv6. The purpose of cryptographically generated addresses (CGA) is to prevent stealing and spoofing of existent IP addresses. In this paper, a novel authentication mechanism based on CGA is proposed for BU message in mobile IPv6. With the implementation of the novel authentication mechanism, care-of address of MN will be automatically generated, and this will be related to MN private attribute, hence, it would not be possible for a vicious node to steal it. With this method, the BU message can be authenticated.
{"title":"A Novel Authentication Mechanism Based on CGA for BU Message Disposal in Mobile IPv6","authors":"Yong Feng, Zhongfu Wu, Jiang Zhong, Chunxiao Ye, Kaigui Wu","doi":"10.1109/NAS.2008.8","DOIUrl":"https://doi.org/10.1109/NAS.2008.8","url":null,"abstract":"In mobile IPv6, the location of a mobile node (MN) is obtained by implementing a binding update (BU) process. During the process, the unauthenticated BU message may give rise to many security risks, such as denial-of-service (DoS) attack. Thus, authentication of the BU message is most important for the security of mobile IPv6. The purpose of cryptographically generated addresses (CGA) is to prevent stealing and spoofing of existent IP addresses. In this paper, a novel authentication mechanism based on CGA is proposed for BU message in mobile IPv6. With the implementation of the novel authentication mechanism, care-of address of MN will be automatically generated, and this will be related to MN private attribute, hence, it would not be possible for a vicious node to steal it. With this method, the BU message can be authenticated.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127944686","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}
Precise interrupts is a key technique of embedded processor, for assurance of properly executing and state resuming of the whole system. As interrupt occurs on the instruction boundary, pipeline flushing, interrupt transfer micro-program and interrupt handling routine are executed after the committing soon instruction finishes. This process spends lots of cycles to pre-fetch and decode instructions that will never be executed, and reduces the real time performance. Combined with the CISC processor execution characteristic of micro-operation, this paper proposes a precise interrupts mechanism based on Instruction Boundary Micro-operation Tracing, called IBMT. This technique inspects instruction boundary and interrupt window every clock cycle, and starts up the pipeline flushing, pre-fetch, interrupt transfer micro-program and interrupt handling routine in advance. As a result, 39.34% of the clock cycles can be saved at every interrupt acknowledgement.
{"title":"A Precise Interrupts Mechanism Based on Micro-Operation Tracing of Instruction Boundary for Embedded Processor","authors":"Jun Zhang, Xiaoming Fan, Song-He Liu","doi":"10.1109/NAS.2008.25","DOIUrl":"https://doi.org/10.1109/NAS.2008.25","url":null,"abstract":"Precise interrupts is a key technique of embedded processor, for assurance of properly executing and state resuming of the whole system. As interrupt occurs on the instruction boundary, pipeline flushing, interrupt transfer micro-program and interrupt handling routine are executed after the committing soon instruction finishes. This process spends lots of cycles to pre-fetch and decode instructions that will never be executed, and reduces the real time performance. Combined with the CISC processor execution characteristic of micro-operation, this paper proposes a precise interrupts mechanism based on Instruction Boundary Micro-operation Tracing, called IBMT. This technique inspects instruction boundary and interrupt window every clock cycle, and starts up the pipeline flushing, pre-fetch, interrupt transfer micro-program and interrupt handling routine in advance. As a result, 39.34% of the clock cycles can be saved at every interrupt acknowledgement.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134124110","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}
Consolidated storage service receives its momentum in the building of various IT system infrastructures because of its cost efficiency, reliability, and maintainability. Meanwhile, only when users who run their applications on the consolidated storage system have a similar or better performance experience compared to those using direct-attached storage on each server can the storage design really be widely accepted. We propose a framework in which performance of servicing requests from one user is well isolated from that for the others in such a way that each user can be regarded as being allocated an independent virtual disk (VD) of performance as specified in its service-level agreement (SLA). Three SLA expressions that we believe are most tangible to users are supported in the spatial-locality-aware framework, which we name as rent-a-disk, latency-conscious, and throughput-conscious. Our proposed I/O scheduling algorithm for implementing the three types of VDs provides strong isolation, low interference, and high fidelity of performance for each VD if SLA is not violated. Our algorithm also enables different types of VDs to cooperate with each other to improve performance for each VD as well as for the entire physical storage.
{"title":"Spatial-Locality-Aware Virtual Storage Devices with Tangible QoS Expressions","authors":"Pei Yan, Song Jiang","doi":"10.1109/NAS.2008.66","DOIUrl":"https://doi.org/10.1109/NAS.2008.66","url":null,"abstract":"Consolidated storage service receives its momentum in the building of various IT system infrastructures because of its cost efficiency, reliability, and maintainability. Meanwhile, only when users who run their applications on the consolidated storage system have a similar or better performance experience compared to those using direct-attached storage on each server can the storage design really be widely accepted. We propose a framework in which performance of servicing requests from one user is well isolated from that for the others in such a way that each user can be regarded as being allocated an independent virtual disk (VD) of performance as specified in its service-level agreement (SLA). Three SLA expressions that we believe are most tangible to users are supported in the spatial-locality-aware framework, which we name as rent-a-disk, latency-conscious, and throughput-conscious. Our proposed I/O scheduling algorithm for implementing the three types of VDs provides strong isolation, low interference, and high fidelity of performance for each VD if SLA is not violated. Our algorithm also enables different types of VDs to cooperate with each other to improve performance for each VD as well as for the entire physical storage.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131600943","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}
InfiniBand architecture (IBA) has emerged as a standard system-area interconnect in industry for both data-center and high performance computing. While IBA continues to evolve with more capabilities, it has yet to permeate the field of grid and pervasive computing across wide area. This requires a software infrastructure to take the full advantage of IBA networking mechanisms without being dwarfed by the long distances. In this paper, we present a detailed analysis of InfiniBand transport services for their suitability to data transfer and message passing in the wide area. Three of the common InfiniBand transport services have been examined, including reliable connection (RC), unreliable connection (UC), and unreliable datagram (UD). Our analysis indicates that UC and UD are better suited to provide high bandwidth for MPI on wide-area networks (WAN). We have also demonstrated that the current existing MPI implementations, designed over RC and UD, can be tuned to provide improved MPI bandwidth on WAN. Furthermore, by developing a UC-based MPI implementa-tion, we have shown that, at a distance of 8600 miles, MPI over UC can improve MPI bandwidth by as much as 100%.
{"title":"Experimental Analysis of InfiniBand Transport Services on WAN","authors":"Weikuan Yu, N. Rao, J. Vetter","doi":"10.1109/NAS.2008.65","DOIUrl":"https://doi.org/10.1109/NAS.2008.65","url":null,"abstract":"InfiniBand architecture (IBA) has emerged as a standard system-area interconnect in industry for both data-center and high performance computing. While IBA continues to evolve with more capabilities, it has yet to permeate the field of grid and pervasive computing across wide area. This requires a software infrastructure to take the full advantage of IBA networking mechanisms without being dwarfed by the long distances. In this paper, we present a detailed analysis of InfiniBand transport services for their suitability to data transfer and message passing in the wide area. Three of the common InfiniBand transport services have been examined, including reliable connection (RC), unreliable connection (UC), and unreliable datagram (UD). Our analysis indicates that UC and UD are better suited to provide high bandwidth for MPI on wide-area networks (WAN). We have also demonstrated that the current existing MPI implementations, designed over RC and UD, can be tuned to provide improved MPI bandwidth on WAN. Furthermore, by developing a UC-based MPI implementa-tion, we have shown that, at a distance of 8600 miles, MPI over UC can improve MPI bandwidth by as much as 100%.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132171320","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}
This paper presents a network memory architecture and makes a performance model to analysis the slowdown caused by the remote access delay. In this architecture the network memory is accessed through a smart network memory controller. A local page cache and a virtual page prefetching engine are designed in the smart network memory controller to improve the memory access performance.
{"title":"A Network Memory Architecture Model and Performance Analysis","authors":"","doi":"10.1109/NAS.2008.22","DOIUrl":"https://doi.org/10.1109/NAS.2008.22","url":null,"abstract":"This paper presents a network memory architecture and makes a performance model to analysis the slowdown caused by the remote access delay. In this architecture the network memory is accessed through a smart network memory controller. A local page cache and a virtual page prefetching engine are designed in the smart network memory controller to improve the memory access performance.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121391618","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 the development of wireless sensor networks applications, how to organize the sensors into a wireless communication network and route the sensed data from the field sensors to a remote base station is a particular challenging problem. In this paper, we present a novel clustering technique for wireless sensor networks. During the phrase of cluster initialization, the sensed zone is divided into several virtual hexagons which it can avoid the overlapping nodes of circular cluster. Furthermore, we make some sub-circle in the formatted virtual hexagon base on the average distance between the common nodes and the cluster's center. Depending on the special factor's value, each node will form a cluster heads order list. The clustering technique adopts a new method for cluster head election, which can avoid the frequent election of cluster head. Simulation results demonstrate that our proposed algorithm is effective in prolonging the lifetime of networks.
{"title":"An Energy-Efficient Clustering Technique for Wireless Sensor Networks","authors":"Guan Xin, YongXin Wang, Liu Fang","doi":"10.1109/NAS.2008.51","DOIUrl":"https://doi.org/10.1109/NAS.2008.51","url":null,"abstract":"In the development of wireless sensor networks applications, how to organize the sensors into a wireless communication network and route the sensed data from the field sensors to a remote base station is a particular challenging problem. In this paper, we present a novel clustering technique for wireless sensor networks. During the phrase of cluster initialization, the sensed zone is divided into several virtual hexagons which it can avoid the overlapping nodes of circular cluster. Furthermore, we make some sub-circle in the formatted virtual hexagon base on the average distance between the common nodes and the cluster's center. Depending on the special factor's value, each node will form a cluster heads order list. The clustering technique adopts a new method for cluster head election, which can avoid the frequent election of cluster head. Simulation results demonstrate that our proposed algorithm is effective in prolonging the lifetime of networks.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131885192","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
扫码关注我们
求助内容：
应助结果提醒方式：