R. Globisch, Yago Sánchez de la Fuente, T. Schierl, K. Ferguson, T. Wiegand
Delay-sensitive media applications typically prioritise timeliness over reliability, therefore preferring UDP over TCP. Retransmission is a method to compensate for packet loss and requires the receiver to provide timely feedback to the sender. Delaying the retransmission request too long may result in the retransmitted media arriving late. Alternatively, aggressive error estimation, where slightly delayed packets are seen as lost, results in unnecessary bandwidth usage and may contribute to further congestion of the network. We study receiver-based retransmission timeout (RTO) estimation in the context of real-time streaming over Multipath RTP and propose a solution in which we use statistical methods to provide accurate RTO prediction which allows for timely feedback. The proposed approach allows the receiver to accurately estimate the RTO when receiving media over multiple paths irrespective of the scheduling algorithm used at the sender. This enables a sender to take advantage of multiple paths for load balancing or bandwidth aggregation by scheduling media based on dynamic path characteristics.
{"title":"Retransmission Timeout Estimation for Low-Delay Applications Using Multipath RTP","authors":"R. Globisch, Yago Sánchez de la Fuente, T. Schierl, K. Ferguson, T. Wiegand","doi":"10.1109/WAINA.2014.124","DOIUrl":"https://doi.org/10.1109/WAINA.2014.124","url":null,"abstract":"Delay-sensitive media applications typically prioritise timeliness over reliability, therefore preferring UDP over TCP. Retransmission is a method to compensate for packet loss and requires the receiver to provide timely feedback to the sender. Delaying the retransmission request too long may result in the retransmitted media arriving late. Alternatively, aggressive error estimation, where slightly delayed packets are seen as lost, results in unnecessary bandwidth usage and may contribute to further congestion of the network. We study receiver-based retransmission timeout (RTO) estimation in the context of real-time streaming over Multipath RTP and propose a solution in which we use statistical methods to provide accurate RTO prediction which allows for timely feedback. The proposed approach allows the receiver to accurately estimate the RTO when receiving media over multiple paths irrespective of the scheduling algorithm used at the sender. This enables a sender to take advantage of multiple paths for load balancing or bandwidth aggregation by scheduling media based on dynamic path characteristics.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124373952","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}
R. K. Miranda, J. Costa, M. A. M. Marinho, E. P. Freitas, Rafael de Freitas Ramos, Kefei Liu, H. So, L. Baltar, Rafael Timóteo de Sousa Júnior
By taking into account several dimension of the transmitted signal, such as space, frequency, period and time, MIMO-OFDM systems allow an increased spectral efficiency and an improved identifiability in comparison to matrix solutions. In this paper, we evaluate MIMO-OFDM systems for geometric scenarios where the narrow band approximation is violated. To this end a new data model is proposed to better represent the behavior of the system in the presence of wide band signals. Moreover, we also relax the assumption that the amount of transmitted antennas is equal to the number of transmitted symbols.
{"title":"Evaluation of Space-Time-Frequency (STF)-Coded MIMO-OFDM Systems in Realistic Channel Models","authors":"R. K. Miranda, J. Costa, M. A. M. Marinho, E. P. Freitas, Rafael de Freitas Ramos, Kefei Liu, H. So, L. Baltar, Rafael Timóteo de Sousa Júnior","doi":"10.1109/WAINA.2014.57","DOIUrl":"https://doi.org/10.1109/WAINA.2014.57","url":null,"abstract":"By taking into account several dimension of the transmitted signal, such as space, frequency, period and time, MIMO-OFDM systems allow an increased spectral efficiency and an improved identifiability in comparison to matrix solutions. In this paper, we evaluate MIMO-OFDM systems for geometric scenarios where the narrow band approximation is violated. To this end a new data model is proposed to better represent the behavior of the system in the presence of wide band signals. Moreover, we also relax the assumption that the amount of transmitted antennas is equal to the number of transmitted symbols.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126125877","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}
María Victoria Moreno Cano, José Luis Hernández Ramos, A. Gómez-Skarmeta, M. Nati, Nick Palaghias, A. Gluhak, R. Kranenburg
In line with the view of the SOCIOTAL EU project, this work presents a crucial next step in the transformation of an emerging business-driven Internet of Things (IoT) infrastructure into an all-inclusive one, tailored to the society and with the aim to accelerate the creation of a socially aware citizen-centric Internet of Things. To this purpose, this paper try to establish an IoT ecosystem that puts trust, user control and transparency at its heart in order to gain the confidence of everyday citizens. In line with this view, a privacy-preserving framework which integrates the explored relationships among identity, privacy, trust and reputation concepts is explored.
{"title":"A Framework for Citizen Participation in the Internet of Things","authors":"María Victoria Moreno Cano, José Luis Hernández Ramos, A. Gómez-Skarmeta, M. Nati, Nick Palaghias, A. Gluhak, R. Kranenburg","doi":"10.1109/WAINA.2014.161","DOIUrl":"https://doi.org/10.1109/WAINA.2014.161","url":null,"abstract":"In line with the view of the SOCIOTAL EU project, this work presents a crucial next step in the transformation of an emerging business-driven Internet of Things (IoT) infrastructure into an all-inclusive one, tailored to the society and with the aim to accelerate the creation of a socially aware citizen-centric Internet of Things. To this purpose, this paper try to establish an IoT ecosystem that puts trust, user control and transparency at its heart in order to gain the confidence of everyday citizens. In line with this view, a privacy-preserving framework which integrates the explored relationships among identity, privacy, trust and reputation concepts is explored.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"75 278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125966503","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. Ziad, Amr Al-Anwar, Y. Alkabani, M. El-Kharashi, Hassan Bedour
Electronic voting (e-voting) systems have been inuse since the 1960s. E-voting offers many advantages compared to other voting techniques. However, it also introduces many security challenges. As it may contain malicious back-doors that can affect system dependability. In this work, we present one of e-voting challenges where the hardware Trojan tampers results totally. We implement an e-voting machine as a case study on XilinxFPGA board. Then, we inject a hardware Trojan to tamper voting results. The attack depends mainly on the unused bits. We provide a protection technique and show its overhead. Furthermore, we introduce other attacks and protection scenarios. We compare between our selected protection techniques and others techniques. Finally, we illustrate that our chosen protection technique incurs negligible power overhead, whereas the average area and delay overheads are 4% and 10%, respectively.
{"title":"E-Voting Attacks and Countermeasures","authors":"M. Ziad, Amr Al-Anwar, Y. Alkabani, M. El-Kharashi, Hassan Bedour","doi":"10.1109/WAINA.2014.53","DOIUrl":"https://doi.org/10.1109/WAINA.2014.53","url":null,"abstract":"Electronic voting (e-voting) systems have been inuse since the 1960s. E-voting offers many advantages compared to other voting techniques. However, it also introduces many security challenges. As it may contain malicious back-doors that can affect system dependability. In this work, we present one of e-voting challenges where the hardware Trojan tampers results totally. We implement an e-voting machine as a case study on XilinxFPGA board. Then, we inject a hardware Trojan to tamper voting results. The attack depends mainly on the unused bits. We provide a protection technique and show its overhead. Furthermore, we introduce other attacks and protection scenarios. We compare between our selected protection techniques and others techniques. Finally, we illustrate that our chosen protection technique incurs negligible power overhead, whereas the average area and delay overheads are 4% and 10%, respectively.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134103155","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}
It is widely recognised that organizational culture has a key role in determining the success of change management initiatives. The introduction of Green IT approaches within an organization often represents a major exercise in change management. This paper explores ways of transforming organizational culture in directions that will support the introduction of greater levels of Green IT. A major theme is the use of 'choice architectures' to 'nudge' individuals in particular directions. Other themes explored in the paper are the roles of the social media and intelligent context-awareness. The impact of globalization is also considered. Cameron and Quinn's Competing Values Framework is used as a tool to explore the impact of organizational culture.
{"title":"Cultural Transformation to Support the Adoption of Green IT","authors":"William M. Campbell, P. Moore, Mak Sharma","doi":"10.1109/WAINA.2014.91","DOIUrl":"https://doi.org/10.1109/WAINA.2014.91","url":null,"abstract":"It is widely recognised that organizational culture has a key role in determining the success of change management initiatives. The introduction of Green IT approaches within an organization often represents a major exercise in change management. This paper explores ways of transforming organizational culture in directions that will support the introduction of greater levels of Green IT. A major theme is the use of 'choice architectures' to 'nudge' individuals in particular directions. Other themes explored in the paper are the roles of the social media and intelligent context-awareness. The impact of globalization is also considered. Cameron and Quinn's Competing Values Framework is used as a tool to explore the impact of organizational culture.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134112563","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}
Mobile crime report services have become a pervasive approach to enabling community-based crime reporting (CBCR) in developing nations. These services hold the advantage of facilitating law enforcement when resource constraints make using standard crime investigation approaches challenging. However, CBCRs have failed to achieve widespread popularity in developing nations because of concerns for privacy. Users are hesitant to make crime reports with out strong guarantees of privacy preservation. Furthermore, oftentimes lack of data mining expertise within the law enforcement agencies implies that the reported data needs to be processed manually which is a time-consuming process. In this paper we make two contributions to facilitate effective and efficient CBCR and crime data mining as well as to address the user privacy concern. The first is a practical framework for mobile CBCR and the second, is a hybrid k-anonymity algorithm to guarantee privacy preservation of the reported crime data. We use a hierarchy-based generalization algorithm to classify the data to minimize information loss by optimizing the nodal degree of the classification tree. Results from our proof-of-concept implementation demonstrate that in addition to guaranteeing privacy, our proposed scheme offers a classification accuracy of about 38% and a drop in information loss of nearly 50% over previous schemes when compared on various sizes of datasets. Performance-wise we observe an average improvement of about 50ms proportionate to the size of the dataset.
{"title":"K-Anonymity for Privacy Preserving Crime Data Publishing in Resource Constrained Environments","authors":"Mark-John Burke, Anne Kayem","doi":"10.1109/WAINA.2014.131","DOIUrl":"https://doi.org/10.1109/WAINA.2014.131","url":null,"abstract":"Mobile crime report services have become a pervasive approach to enabling community-based crime reporting (CBCR) in developing nations. These services hold the advantage of facilitating law enforcement when resource constraints make using standard crime investigation approaches challenging. However, CBCRs have failed to achieve widespread popularity in developing nations because of concerns for privacy. Users are hesitant to make crime reports with out strong guarantees of privacy preservation. Furthermore, oftentimes lack of data mining expertise within the law enforcement agencies implies that the reported data needs to be processed manually which is a time-consuming process. In this paper we make two contributions to facilitate effective and efficient CBCR and crime data mining as well as to address the user privacy concern. The first is a practical framework for mobile CBCR and the second, is a hybrid k-anonymity algorithm to guarantee privacy preservation of the reported crime data. We use a hierarchy-based generalization algorithm to classify the data to minimize information loss by optimizing the nodal degree of the classification tree. Results from our proof-of-concept implementation demonstrate that in addition to guaranteeing privacy, our proposed scheme offers a classification accuracy of about 38% and a drop in information loss of nearly 50% over previous schemes when compared on various sizes of datasets. Performance-wise we observe an average improvement of about 50ms proportionate to the size of the dataset.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133249877","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}
Power grids are parallel systems in which consumers demand a shared resource independent of each other. A blackout occurs when the total demand increases or decreases too rapidly. This paper combines methods and concepts from three domains. The first stems from estimating the power consumption based on thermostatically controlled loads via Markov chains. The second domain provides the composition of parallel systems enriched by intermediate lumping to construct a minimal aggregate transition model, in this case of a community of housings. The third domain provides reasoning about fault tolerance properties by introducing limiting window reliability as measure, suitable to account for the continuous risk of blackouts. Combined, the three methods and concepts allow to determine the risk of blackout of a community over time.
{"title":"Composing Thermostatically Controlled Loads to Determine the Reliability against Blackouts","authors":"Nils Müllner, Oliver E. Theel, M. Fränzle","doi":"10.1109/WAINA.2014.59","DOIUrl":"https://doi.org/10.1109/WAINA.2014.59","url":null,"abstract":"Power grids are parallel systems in which consumers demand a shared resource independent of each other. A blackout occurs when the total demand increases or decreases too rapidly. This paper combines methods and concepts from three domains. The first stems from estimating the power consumption based on thermostatically controlled loads via Markov chains. The second domain provides the composition of parallel systems enriched by intermediate lumping to construct a minimal aggregate transition model, in this case of a community of housings. The third domain provides reasoning about fault tolerance properties by introducing limiting window reliability as measure, suitable to account for the continuous risk of blackouts. Combined, the three methods and concepts allow to determine the risk of blackout of a community over time.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133432787","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}
Law enforcement employs an investigative approach based on marked money bills to track illegal drug dealers. In this paper we discuss research that aims at providing law enforcement with the cyber counterpart of that approach in order to track perpetrators that operate botnets. We have devised a novel steganographic approach that generates a watermark hidden within a honey token, i.e. A decoy Word document. The covert bits that comprise the watermark are carried via secret interpretation of object properties in the honey token. The encoding and decoding of object properties into covert bits follow a scheme based on bijective functions generated via a chaotic logistic map. The watermark is retrievable via a secret cryptographic key, which is generated and held by law enforcement. The honey token is leaked to a botmaster via a honey net. In the paper, we elaborate on possible means by which law enforcement can track the leaked honey token to the IP address of a botmaster's machine.
{"title":"A Steganographic Approach to Localizing Botmasters","authors":"J. Rrushi","doi":"10.1109/WAINA.2014.152","DOIUrl":"https://doi.org/10.1109/WAINA.2014.152","url":null,"abstract":"Law enforcement employs an investigative approach based on marked money bills to track illegal drug dealers. In this paper we discuss research that aims at providing law enforcement with the cyber counterpart of that approach in order to track perpetrators that operate botnets. We have devised a novel steganographic approach that generates a watermark hidden within a honey token, i.e. A decoy Word document. The covert bits that comprise the watermark are carried via secret interpretation of object properties in the honey token. The encoding and decoding of object properties into covert bits follow a scheme based on bijective functions generated via a chaotic logistic map. The watermark is retrievable via a secret cryptographic key, which is generated and held by law enforcement. The honey token is leaked to a botmaster via a honey net. In the paper, we elaborate on possible means by which law enforcement can track the leaked honey token to the IP address of a botmaster's machine.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130516277","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 mobile sensor networks (MSNs), since sensor nodes and wireless networks are highly resource constrained and, it is highly required to manage sensor data in flexible and efficient manners. Under the MEXT research project The Grand-in-Aid for Scientific Research (S)(21220002) of the Ministry of Education, Culture, Sports, Science and Technology (MEXT), Japan entitled "Studies on Efficient Data Processing Techniques for Mobile Sensor Networks," we have conducted researches on data management issues in MSNs. In this paper, we report some of our achievements in a sub-area of this project, which addresses data transmission for efficient data collection in MSNs. In particular, we first show our achievements on how to efficiently transmit sensor data from sensor nodes to mobile sink nodes considering the fairness and the amount of sensor data collected. Then, we also show our achievements on how to enlarge sensor data collection area and how to reduce communication traffic using mobile sink nodes.
{"title":"Data Transmission Techniques for Mobile Sensor Networks","authors":"T. Yoshihisa, S. Nishio","doi":"10.1109/WAINA.2014.44","DOIUrl":"https://doi.org/10.1109/WAINA.2014.44","url":null,"abstract":"In mobile sensor networks (MSNs), since sensor nodes and wireless networks are highly resource constrained and, it is highly required to manage sensor data in flexible and efficient manners. Under the MEXT research project The Grand-in-Aid for Scientific Research (S)(21220002) of the Ministry of Education, Culture, Sports, Science and Technology (MEXT), Japan entitled \"Studies on Efficient Data Processing Techniques for Mobile Sensor Networks,\" we have conducted researches on data management issues in MSNs. In this paper, we report some of our achievements in a sub-area of this project, which addresses data transmission for efficient data collection in MSNs. In particular, we first show our achievements on how to efficiently transmit sensor data from sensor nodes to mobile sink nodes considering the fairness and the amount of sensor data collected. Then, we also show our achievements on how to enlarge sensor data collection area and how to reduce communication traffic using mobile sink nodes.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115377813","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}
Heterogeneous Networks represent an open architecture in which two different domains need to cooperate in order to provide ubiquitous connectivity. The first is network operators domain, where multiple network operators share the core network to provide network accessibility over a wide variety of wireless technologies such as WiFi and mobile network technologies. The other is the Application-Service Providers domain, which launches various services ranging from the normal video streaming to the most confidential E-Commerce services. This highlights the fact that any efficient security solution for heterogeneous networks has to consider the security in these different domains. Therefore, this paper introduces security framework that comprises two Authentication and Key Agreement protocols to secure transactions at the network and service levels. The proposed protocols have been formally verified using formal methods approach based on Casper/FDR tool.
{"title":"A Secure Framework for Communications in Heterogeneous Networks","authors":"Mahdi Aiash, G. Mapp, A. Lasebae, J. Loo","doi":"10.1109/WAINA.2014.132","DOIUrl":"https://doi.org/10.1109/WAINA.2014.132","url":null,"abstract":"Heterogeneous Networks represent an open architecture in which two different domains need to cooperate in order to provide ubiquitous connectivity. The first is network operators domain, where multiple network operators share the core network to provide network accessibility over a wide variety of wireless technologies such as WiFi and mobile network technologies. The other is the Application-Service Providers domain, which launches various services ranging from the normal video streaming to the most confidential E-Commerce services. This highlights the fact that any efficient security solution for heterogeneous networks has to consider the security in these different domains. Therefore, this paper introduces security framework that comprises two Authentication and Key Agreement protocols to secure transactions at the network and service levels. The proposed protocols have been formally verified using formal methods approach based on Casper/FDR tool.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114123167","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
扫码关注我们
求助内容：
应助结果提醒方式：