In this paper, we separate the symbols in the layered basis and then find the equivalent channel matrix. Based on the equivalent channel matrix we provide the grouping scheme. In our paper, we construct a block wise transmission technique which will achieve the desired code rate and reduce the decoding complexity.
{"title":"SER Analysis of 8x8 QOSTC with Less Decoding Complexity","authors":"M. Hanif, M. Lee","doi":"10.1109/CyberC.2012.90","DOIUrl":"https://doi.org/10.1109/CyberC.2012.90","url":null,"abstract":"In this paper, we separate the symbols in the layered basis and then find the equivalent channel matrix. Based on the equivalent channel matrix we provide the grouping scheme. In our paper, we construct a block wise transmission technique which will achieve the desired code rate and reduce the decoding complexity.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"34 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":"126644098","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}
Florian Adamsky, S. A. Khayam, Rudolf Jäger, M. Rajarajan
BitTorrent is the most widely used Peer-to-Peer (P2P) protocol and it comprises the largest share of traffic in Europe. To make BitTorrent more Internet Service Provider (ISP) friendly, BitTorrent Inc. invented the Micro Transport Protocol (uTP). It is based on UDP with a novel congestion control called Low Extra Delay Background Transport (LEDBAT). This protocol assumes that the receiver always gives correct feedback, since otherwise this deteriorates throughput or yields to corrupted data. We show through experimental investigation that a misbehaving uTP receiver, which is not interested in data integrity, can increase the bandwidth of the sender by up to five times. This can cause a congestion collapse and steal large share of a victim's bandwidth. We present three attacks, which increase the bandwidth usage significantly. We have tested these attacks in a real world environment and show its severity both in terms of number of packets and total traffic generated. We also present a countermeasure for protecting against the attacks and evaluate the performance of that defence strategy.
{"title":"Security Analysis of the Micro Transport Protocol with a Misbehaving Receiver","authors":"Florian Adamsky, S. A. Khayam, Rudolf Jäger, M. Rajarajan","doi":"10.1109/CyberC.2012.31","DOIUrl":"https://doi.org/10.1109/CyberC.2012.31","url":null,"abstract":"BitTorrent is the most widely used Peer-to-Peer (P2P) protocol and it comprises the largest share of traffic in Europe. To make BitTorrent more Internet Service Provider (ISP) friendly, BitTorrent Inc. invented the Micro Transport Protocol (uTP). It is based on UDP with a novel congestion control called Low Extra Delay Background Transport (LEDBAT). This protocol assumes that the receiver always gives correct feedback, since otherwise this deteriorates throughput or yields to corrupted data. We show through experimental investigation that a misbehaving uTP receiver, which is not interested in data integrity, can increase the bandwidth of the sender by up to five times. This can cause a congestion collapse and steal large share of a victim's bandwidth. We present three attacks, which increase the bandwidth usage significantly. We have tested these attacks in a real world environment and show its severity both in terms of number of packets and total traffic generated. We also present a countermeasure for protecting against the attacks and evaluate the performance of that defence strategy.","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":"122019698","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}
Efficient swarming behaviours within peer-to-peer networks are hindered by imprecise or incorrect metadata content. Once published, metadata corrections can only be effected by a complete republish/swarm recreation or for each peer to manually make corrections (causing them to leave the swarm, decreasing performance). This work presents an approach which enables a swarm to collaboratively upgrade embedded data to reflect changes in metadata, and to identify additional candidates which contain differing metadata but a correct payload. Swarm degradation due to peer drop-off resulting from edits is eliminated, and additional peers can be identified in a fully automated fashion, increasing swarm lifetime and performance. Arising from this metadata abstraction, automatic purification can be realised in situations where multiple incomplete/incorrect versions are available within one or more unconnected swarms. Variations associated with a content set are processed associatively using a knowledge discovery rule set to extrapolate a canonical tag set, which can also be reinforced using data from external corpora. After any update, these changes can again be automatically disseminated in a peer-to-peer swarm. The system presented enables context-aware P2P data transfers which abstract metadata optimally, while also maximising swarm size and enabling cataloguing of content. A proof-of-concept implementation is presented, and its impact on swarm purification/ optimisation is evaluated.
{"title":"Metadata Independent Hashing for Media Identification & P2P Transfer Optimisation","authors":"J. Warren, Michael Clear, C. McGoldrick","doi":"10.1109/CyberC.2012.19","DOIUrl":"https://doi.org/10.1109/CyberC.2012.19","url":null,"abstract":"Efficient swarming behaviours within peer-to-peer networks are hindered by imprecise or incorrect metadata content. Once published, metadata corrections can only be effected by a complete republish/swarm recreation or for each peer to manually make corrections (causing them to leave the swarm, decreasing performance). This work presents an approach which enables a swarm to collaboratively upgrade embedded data to reflect changes in metadata, and to identify additional candidates which contain differing metadata but a correct payload. Swarm degradation due to peer drop-off resulting from edits is eliminated, and additional peers can be identified in a fully automated fashion, increasing swarm lifetime and performance. Arising from this metadata abstraction, automatic purification can be realised in situations where multiple incomplete/incorrect versions are available within one or more unconnected swarms. Variations associated with a content set are processed associatively using a knowledge discovery rule set to extrapolate a canonical tag set, which can also be reinforced using data from external corpora. After any update, these changes can again be automatically disseminated in a peer-to-peer swarm. The system presented enables context-aware P2P data transfers which abstract metadata optimally, while also maximising swarm size and enabling cataloguing of content. A proof-of-concept implementation is presented, and its impact on swarm purification/ optimisation is evaluated.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"54 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":"128079407","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}
IETF has specified Mobile IPv4 and Mobile IPv6 in RFC3344 and RFC3775 respectively, but not yet discussed Mobile IPv4/v6 in any published RFC. This paper proposes a solution to Mobile IPv4/v6 problems and gives an example when Home Agent(HA) located in IPv4 network, Correspondent Node(CN)located in IPv6 network, Mobile Node(MN) moving in IPv4/v6 mixed networks. A gateway called Mobile IPv4/v6 translation gateway (MIPv4/v6-TG) is introduced to bridge between IPv4 network and IPv6 network, which is made up of a NAT-PT gateway and a Mobile IP application level gateway (MIP-ALG) built upon the NAT-PT gateway. As a transition scheme, the idea is to make the solution compatible with RFC3344 and RFC3775. In this way, the Mobile IP entities in IPv4 network and the Mobile IP entities in IPv6 network will be transparent to each other.
{"title":"A Mobility Management Architecture for IPv4/IPv6 Networks","authors":"Zheng Xiang, Qiuli Kong","doi":"10.1109/CyberC.2012.80","DOIUrl":"https://doi.org/10.1109/CyberC.2012.80","url":null,"abstract":"IETF has specified Mobile IPv4 and Mobile IPv6 in RFC3344 and RFC3775 respectively, but not yet discussed Mobile IPv4/v6 in any published RFC. This paper proposes a solution to Mobile IPv4/v6 problems and gives an example when Home Agent(HA) located in IPv4 network, Correspondent Node(CN)located in IPv6 network, Mobile Node(MN) moving in IPv4/v6 mixed networks. A gateway called Mobile IPv4/v6 translation gateway (MIPv4/v6-TG) is introduced to bridge between IPv4 network and IPv6 network, which is made up of a NAT-PT gateway and a Mobile IP application level gateway (MIP-ALG) built upon the NAT-PT gateway. As a transition scheme, the idea is to make the solution compatible with RFC3344 and RFC3775. In this way, the Mobile IP entities in IPv4 network and the Mobile IP entities in IPv6 network will be transparent to each other.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"68 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":"127242436","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}
Studying the BitTorrent (BT) swarm evolution in different time scale is important to design accurate BT simulators and improve the performance of current BT systems. In this paper, we develop a hybrid measurement system incorporating both active and passive approaches. By exploiting DHT and PEX protocols in addition to traditional resources, we collect more extensive information compared to prior measurement systems. Based on the measurement results, we study the swarm evolution with different population in minute/hour/day scales, and discover that: (1) The swarm peer population is unbalanced, in that 74.6% torrents have no more than 1000 peers, (2) The lifetime of torrents can be divided into a fast growing stage, a dramatically shrinking stage, a sustaining stage and a slowly fading out stage in terms of swarm population, (3) Users' interest and diurnal periodicity are the main factors that influence the swarm evolution. The former dominates the first two stages, while the latter is decisive in the third stage. In this spirit, we raise an improved peer arrival rate model to describe the variation of the swarm population. Comparison results show that our model outperforms the state-of-the-art approach according to root mean square error and correlation coefficient.
{"title":"A measurement study on swarm evolution of BitTorrent","authors":"Majing Su, Hongli Zhang, Binxing Fang, N. Yan","doi":"10.1109/CyberC.2012.94","DOIUrl":"https://doi.org/10.1109/CyberC.2012.94","url":null,"abstract":"Studying the BitTorrent (BT) swarm evolution in different time scale is important to design accurate BT simulators and improve the performance of current BT systems. In this paper, we develop a hybrid measurement system incorporating both active and passive approaches. By exploiting DHT and PEX protocols in addition to traditional resources, we collect more extensive information compared to prior measurement systems. Based on the measurement results, we study the swarm evolution with different population in minute/hour/day scales, and discover that: (1) The swarm peer population is unbalanced, in that 74.6% torrents have no more than 1000 peers, (2) The lifetime of torrents can be divided into a fast growing stage, a dramatically shrinking stage, a sustaining stage and a slowly fading out stage in terms of swarm population, (3) Users' interest and diurnal periodicity are the main factors that influence the swarm evolution. The former dominates the first two stages, while the latter is decisive in the third stage. In this spirit, we raise an improved peer arrival rate model to describe the variation of the swarm population. Comparison results show that our model outperforms the state-of-the-art approach according to root mean square error and correlation coefficient.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"40 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":"122761900","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}
Alexander Cameron, M. Stumptner, N. Nandagopal, W. Mayer, T. Mansell
In this paper we consider the core issues that are inhibiting the application of general Service Oriented Architecture (SOA) principles to distributed real-time military environments. In particular, we propose a Distributed Real-Time Service Oriented Architecture (DRT-SOA) framework intended to overcome some of the problems that distributed SOA systems face in needing to exhibit verifiable deterministic behaviour. Although the time behaviour of asynchronous systems is inherently non-deterministic, such systems offer advantages in terms of extensibility, cost and utilisation. We show that DRT-SOA presents a framework where the sources of non-determinism can be supressed, making it suitable for certain classes of real-time system. We also show that decentralised execution of complex workflows is achievable using dynamic rule-based logic. We also present preliminary results demonstrating the architecture's ability to perform decentralised execution of workflow and to resolve deadline constrained tasks. We also present results of a sensitivity analysis showing that the architectural framework is able to scale in support of dynamic redeployment of workflow. This has application when needing to adapt to changing run-time needs in the case of self-healing.
{"title":"Rule-Based Control of Decentralised Asynchronous SOA for Real-Time Applications","authors":"Alexander Cameron, M. Stumptner, N. Nandagopal, W. Mayer, T. Mansell","doi":"10.1109/CyberC.2012.48","DOIUrl":"https://doi.org/10.1109/CyberC.2012.48","url":null,"abstract":"In this paper we consider the core issues that are inhibiting the application of general Service Oriented Architecture (SOA) principles to distributed real-time military environments. In particular, we propose a Distributed Real-Time Service Oriented Architecture (DRT-SOA) framework intended to overcome some of the problems that distributed SOA systems face in needing to exhibit verifiable deterministic behaviour. Although the time behaviour of asynchronous systems is inherently non-deterministic, such systems offer advantages in terms of extensibility, cost and utilisation. We show that DRT-SOA presents a framework where the sources of non-determinism can be supressed, making it suitable for certain classes of real-time system. We also show that decentralised execution of complex workflows is achievable using dynamic rule-based logic. We also present preliminary results demonstrating the architecture's ability to perform decentralised execution of workflow and to resolve deadline constrained tasks. We also present results of a sensitivity analysis showing that the architectural framework is able to scale in support of dynamic redeployment of workflow. This has application when needing to adapt to changing run-time needs in the case of self-healing.","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":"129712911","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 proposes a novel biometrics-based Single Sign On user authentication scheme in Telematics system, in order to enable to protect user account privacy. The contribution of this paper is to firstly combine biometrics with Single Sign On to replace traditional user authentication way by password in Telematics system. The use of biometrics will provide a high secure way to protect user data privacy, e.g., user's contact book, SMS or MMS records. And the use of Single Sign On offers users a convenient way that logs on only once, then access all services in the system involved with user account data.
{"title":"A Biometrics-Based SSO Authentication Scheme in Telematics","authors":"Di Liu, Zhi-Jiang Zhang, Ni Zhang","doi":"10.1109/CyberC.2012.39","DOIUrl":"https://doi.org/10.1109/CyberC.2012.39","url":null,"abstract":"This paper proposes a novel biometrics-based Single Sign On user authentication scheme in Telematics system, in order to enable to protect user account privacy. The contribution of this paper is to firstly combine biometrics with Single Sign On to replace traditional user authentication way by password in Telematics system. The use of biometrics will provide a high secure way to protect user data privacy, e.g., user's contact book, SMS or MMS records. And the use of Single Sign On offers users a convenient way that logs on only once, then access all services in the system involved with user account data.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"148 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":"116569529","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 increasing complexity of the current and future system-on-chip designs poses enormous challenges to system-level design. The uniform SystemC co-simulation methodology is proposed to describe the whole chip entirely with the same language. Elimination of the interaction between different simulators brings significant speedup in co-simulation. The processor model divides every instruction into a number of atomic operations, which makes it possible to accomplish fully cycle-accurate simulation. Meanwhile, the transaction-level-modeling communication model enables each hardware block to be built at different abstraction levels. The methodology is demonstrated by the exemplary design of a MP3 decoding system.
{"title":"Uniform SystemC Co-Simulation Methodology for System-on-Chip Designs","authors":"Xuexiang Wang, Weiwei Shan, Hao Liu","doi":"10.1109/CyberC.2012.51","DOIUrl":"https://doi.org/10.1109/CyberC.2012.51","url":null,"abstract":"The increasing complexity of the current and future system-on-chip designs poses enormous challenges to system-level design. The uniform SystemC co-simulation methodology is proposed to describe the whole chip entirely with the same language. Elimination of the interaction between different simulators brings significant speedup in co-simulation. The processor model divides every instruction into a number of atomic operations, which makes it possible to accomplish fully cycle-accurate simulation. Meanwhile, the transaction-level-modeling communication model enables each hardware block to be built at different abstraction levels. The methodology is demonstrated by the exemplary design of a MP3 decoding system.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"75 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":"131969283","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 implements a technique that enhances parallel execution of auto-generated OpenMP programs by considering architecture of on chip cache memory. It avoids false-sharing in 'for-loops' by generating OpenMP code for dynamically scheduling chunks by placing each core's data cache line size apart. An open-source parallelization tool called Par4All has been analyzed and its power has been unleashed to achieve maximum hardware utilization. Some of the computationally intensive programs from Poly Bench have been tested on different architectures, with different data sets and the results obtained reveal that the OpenMP codes generated by the enhanced technique have resulted in considerable speedup.
{"title":"Optimization of Automatic Conversion of Serial C to Parallel OpenMP","authors":"D. Dheeraj, B. Nitish, S. Ramesh","doi":"10.1109/CyberC.2012.59","DOIUrl":"https://doi.org/10.1109/CyberC.2012.59","url":null,"abstract":"This paper implements a technique that enhances parallel execution of auto-generated OpenMP programs by considering architecture of on chip cache memory. It avoids false-sharing in 'for-loops' by generating OpenMP code for dynamically scheduling chunks by placing each core's data cache line size apart. An open-source parallelization tool called Par4All has been analyzed and its power has been unleashed to achieve maximum hardware utilization. Some of the computationally intensive programs from Poly Bench have been tested on different architectures, with different data sets and the results obtained reveal that the OpenMP codes generated by the enhanced technique have resulted in considerable speedup.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"97 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":"133237297","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}
A clustering routing algorithm based on reliability (CRAR) is proposed in this paper, for the sake of improving reliability of clustering routing algorithm. CRAR introduces the random package model and divides the net into several areas by using the size of net and positions of nodes. First, the reference node in the line from source to sink is found. And then, the node which is reliable and nearest to sink in the next hop cluster head candidate area is selected as next hop cluster head by using the reference node's position. In each area, cluster head can cover the whole area and is responsible for collecting information and transmitting packages. Certainly, non-cluster-heads are dormant in order to reduce energy consumption. Both theory and simulation show that CRAR is more efficient and reliable than Ad Hoc on-demand multi-path distance vector routing(AOMDV) and Low Energy Adaptive Clustering Hierarchy (LEACH). At the same time, it can avoid broadcast storm effectively.
{"title":"A Clustering Routing Algorithm Based on Reliability in Wireless Sensor Network","authors":"Dong Ting","doi":"10.1109/CyberC.2012.71","DOIUrl":"https://doi.org/10.1109/CyberC.2012.71","url":null,"abstract":"A clustering routing algorithm based on reliability (CRAR) is proposed in this paper, for the sake of improving reliability of clustering routing algorithm. CRAR introduces the random package model and divides the net into several areas by using the size of net and positions of nodes. First, the reference node in the line from source to sink is found. And then, the node which is reliable and nearest to sink in the next hop cluster head candidate area is selected as next hop cluster head by using the reference node's position. In each area, cluster head can cover the whole area and is responsible for collecting information and transmitting packages. Certainly, non-cluster-heads are dormant in order to reduce energy consumption. Both theory and simulation show that CRAR is more efficient and reliable than Ad Hoc on-demand multi-path distance vector routing(AOMDV) and Low Energy Adaptive Clustering Hierarchy (LEACH). At the same time, it can avoid broadcast storm effectively.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"15 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":"125607825","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
扫码关注我们
求助内容：
应助结果提醒方式：