Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8717978
Madhur Poddar, Swathi Ganta, K. Swaraj, Debasis Das
As the vehicles become a formidable sensor platform, the concept of VANETs is being transformed into a pervasive and ubiquitous concept of IoV (Internet of Vehicles). We discuss the scope of IoV over the limitations of VANET and further, we see the standards specified for automated vehicles and the aspects related to their deployment. We also discuss the various techniques under development that facilitate the transfer of anonymous user data upload in automated vehicle environment to the open public data repositories for the research community. We give the abstract of a model proposed to answer the privacy issue and see its controlled deployment. We finally propose the newly modelled approach of Google and suggest some modifications to the approach to answer the privacy issue.
{"title":"Privacy in the Internet of Vehicles: Models, Algorithms, and Applications","authors":"Madhur Poddar, Swathi Ganta, K. Swaraj, Debasis Das","doi":"10.1109/ICOIN.2019.8717978","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8717978","url":null,"abstract":"As the vehicles become a formidable sensor platform, the concept of VANETs is being transformed into a pervasive and ubiquitous concept of IoV (Internet of Vehicles). We discuss the scope of IoV over the limitations of VANET and further, we see the standards specified for automated vehicles and the aspects related to their deployment. We also discuss the various techniques under development that facilitate the transfer of anonymous user data upload in automated vehicle environment to the open public data repositories for the research community. We give the abstract of a model proposed to answer the privacy issue and see its controlled deployment. We finally propose the newly modelled approach of Google and suggest some modifications to the approach to answer the privacy issue.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131730276","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718166
Takehiro Nagato, Takumi Tsutano, Tomio Kamada, Yumi Takaki, C. Ohta
In this article, we provide a data framework for edge computing where developers can easily attain efficient data transfer between devices or users. We propose a distributed key-value storage platform for edge computing and its explicit data distribution management method. In this platform, edge servers organize the distributed key-value storage in a uniform namespace. To enable fast data access to a record in edge computing, the allocation strategy of the record and its cache on the edge servers is important. Our platform offers a distributed objects that can dynamically change home server and allocate cache objects following user defined rules. A rule is defined in a declarative manner and specifies where to place cache objects depending on the status of the target record and its associated records. We also integrate a push notification system using WebSocket to immediately notify events on a specified table. We evaluate the performance of our system using a messaging service application between mobile appliances.
{"title":"Distributed Key-Value Storage for Edge Computing and its Explicit Data Distribution Method","authors":"Takehiro Nagato, Takumi Tsutano, Tomio Kamada, Yumi Takaki, C. Ohta","doi":"10.1109/ICOIN.2019.8718166","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718166","url":null,"abstract":"In this article, we provide a data framework for edge computing where developers can easily attain efficient data transfer between devices or users. We propose a distributed key-value storage platform for edge computing and its explicit data distribution management method. In this platform, edge servers organize the distributed key-value storage in a uniform namespace. To enable fast data access to a record in edge computing, the allocation strategy of the record and its cache on the edge servers is important. Our platform offers a distributed objects that can dynamically change home server and allocate cache objects following user defined rules. A rule is defined in a declarative manner and specifies where to place cache objects depending on the status of the target record and its associated records. We also integrate a push notification system using WebSocket to immediately notify events on a specified table. We evaluate the performance of our system using a messaging service application between mobile appliances.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121772807","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718149
Johannes Goltz, T. Mundt, Simeon Wiedenmann
Building automation is increasingly used to minimize energy consumption and increasing comfort and flexibility in buildings. When the KNX Association was founded in 1999 the need for security was quite low. Systems were usually not connected to the internet and so the standard lacks of nowadays common security requirements. To get an idea where the most serious problems are located in installations we present in this paper a method to calculate a risk for the different network segments. Without limiting the generality KNX is used as one example of fieldbuses. The basic concepts in the communication of fieldbus devices are present in KNX and the results can easily be transferred to other fieldbus protocols.
{"title":"Risk Analysis in Fieldbus Networks Using the Example of KNX","authors":"Johannes Goltz, T. Mundt, Simeon Wiedenmann","doi":"10.1109/ICOIN.2019.8718149","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718149","url":null,"abstract":"Building automation is increasingly used to minimize energy consumption and increasing comfort and flexibility in buildings. When the KNX Association was founded in 1999 the need for security was quite low. Systems were usually not connected to the internet and so the standard lacks of nowadays common security requirements. To get an idea where the most serious problems are located in installations we present in this paper a method to calculate a risk for the different network segments. Without limiting the generality KNX is used as one example of fieldbuses. The basic concepts in the communication of fieldbus devices are present in KNX and the results can easily be transferred to other fieldbus protocols.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127075603","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718168
Keita Ito, Yoshihiro Masuda, E. Okamoto
For secure and high-quality wireless transmission, we propose a chaos multiple-input multiple-output (C-MIMO) transmission scheme, in which physical layer security and a channel coding effect with a coding rate of 1 are obtained by chaotic MIMO block modulation. In previous studies, we introduced a log-likelihood ratio (LLR) to C-MIMO to exploit LLR-based outer channel coding and turbo decoding, and obtained further coding gain. However, we only studied the concatenation of turbo code, low-density parity check (LDPC) code, and convolutional code which were relatively high-complexity or weak codes; thus, outer code having further low-complexity and strong error correction ability were expected. In particular, a transmission system with short and good code is required for control signaling, such as in 5G networks. Therefore, in this paper, we propose a polar code concatenation to C-MIMO, and introduce soft successive decoding (SCAD) and soft successive cancellation list decoding (SSCLD) as LLR-based turbo decoding for polar code. We numerically evaluate the bit error rate performance of the proposed scheme, and compare it to the conventional LDPC-concatenated transmission.
{"title":"A Chaos MIMO-Based Polar Concatenation Code for Secure Channel Coding","authors":"Keita Ito, Yoshihiro Masuda, E. Okamoto","doi":"10.1109/ICOIN.2019.8718168","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718168","url":null,"abstract":"For secure and high-quality wireless transmission, we propose a chaos multiple-input multiple-output (C-MIMO) transmission scheme, in which physical layer security and a channel coding effect with a coding rate of 1 are obtained by chaotic MIMO block modulation. In previous studies, we introduced a log-likelihood ratio (LLR) to C-MIMO to exploit LLR-based outer channel coding and turbo decoding, and obtained further coding gain. However, we only studied the concatenation of turbo code, low-density parity check (LDPC) code, and convolutional code which were relatively high-complexity or weak codes; thus, outer code having further low-complexity and strong error correction ability were expected. In particular, a transmission system with short and good code is required for control signaling, such as in 5G networks. Therefore, in this paper, we propose a polar code concatenation to C-MIMO, and introduce soft successive decoding (SCAD) and soft successive cancellation list decoding (SSCLD) as LLR-based turbo decoding for polar code. We numerically evaluate the bit error rate performance of the proposed scheme, and compare it to the conventional LDPC-concatenated transmission.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127961746","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718127
Tetsuya Noguchi, O. Takyu, T. Fujii, T. Ohtsuki
This paper clarifies the secure capacity in a secure information sharing among multiple destinations by using artificial noise and mirroring null steering (MNS) constructed by cooperative relays in single antenna networks. The MNS can selectively pass the desired signal to all destinations and remove artificial noise. Because the destinations archive high-quality received signals and the other systems cannot, secure information sharing can be achieved from a physical layer security perspective.
{"title":"Performance Evaluation of Information-Sharing Scheme Among Multiple Destinations with Mirroring Null Steering in Single Antenna Networks","authors":"Tetsuya Noguchi, O. Takyu, T. Fujii, T. Ohtsuki","doi":"10.1109/ICOIN.2019.8718127","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718127","url":null,"abstract":"This paper clarifies the secure capacity in a secure information sharing among multiple destinations by using artificial noise and mirroring null steering (MNS) constructed by cooperative relays in single antenna networks. The MNS can selectively pass the desired signal to all destinations and remove artificial noise. Because the destinations archive high-quality received signals and the other systems cannot, secure information sharing can be achieved from a physical layer security perspective.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115384881","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718199
Nway Nway Ei, Chit Wutyee Zaw, Min Kyung Lee, C. Hong
In this paper, the total transmit power of Unmanned Aerial Vehicles (UAVs) which are deployed as aerial base stations is minimized by adjusting the altitudes of different UAVs. We assume that the UAVs adopt the frequency division multiple access (FDMA) technique to serve ground users that are distributed in a certain geographical area. For the given two-dimensional locations of UAVs and the distribution of ground users, we find the optimal altitude of each UAV so that it covers all the ground users nearby and provides services with the minimum transmit power. Our formulated problem is separated into two sub-problems: (1) cell association and (2) transmit power minimization. We find the optimal altitude of each UAV in the first sub-problem by using K Means clustering algorithm. In the second sub-problem, we minimize the transmit power of UAV by using the solution of the previous sub-problem. Exploiting convex optimization, we jointly find the optimal altitude and the optimal transmit power of each UAV under its QoS constraints. In essence, the resulting optimal altitudes can lead to lower transmit power of the UAVs in the network compared to the cases when UAVs are deployed at a fixed altitude.
{"title":"Cell Association in Energy-Constrained Unmanned Aerial Vehicle Communications Under Altitude Consideration","authors":"Nway Nway Ei, Chit Wutyee Zaw, Min Kyung Lee, C. Hong","doi":"10.1109/ICOIN.2019.8718199","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718199","url":null,"abstract":"In this paper, the total transmit power of Unmanned Aerial Vehicles (UAVs) which are deployed as aerial base stations is minimized by adjusting the altitudes of different UAVs. We assume that the UAVs adopt the frequency division multiple access (FDMA) technique to serve ground users that are distributed in a certain geographical area. For the given two-dimensional locations of UAVs and the distribution of ground users, we find the optimal altitude of each UAV so that it covers all the ground users nearby and provides services with the minimum transmit power. Our formulated problem is separated into two sub-problems: (1) cell association and (2) transmit power minimization. We find the optimal altitude of each UAV in the first sub-problem by using K Means clustering algorithm. In the second sub-problem, we minimize the transmit power of UAV by using the solution of the previous sub-problem. Exploiting convex optimization, we jointly find the optimal altitude and the optimal transmit power of each UAV under its QoS constraints. In essence, the resulting optimal altitudes can lead to lower transmit power of the UAVs in the network compared to the cases when UAVs are deployed at a fixed altitude.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128338753","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718129
Meihua Jin, Ji-Young Jung, Dara Ron, Sengly Muy, Jung-Ryun Lee
In order to reduce power consumption of GO in Wi-Fi direct which act as traditional Wi-Fi AP, the Wi-Fi alliance proposed two power saving method called Opportunistic power save and NOA power save method. However, both scheme result in different energy efficiency performance according to traffic pattern, also the specification does not define how GO adjust the parameters(CTWindow, ratio of absent/present interval). In this paper, we proposed a new power saving method based on NOA power save mode to improve energy efficiency. We obtain energy gain by dynamically adjusting the GO awake interval depending on the estimated size of video frame which arrive the next beacon period. Additionally, based on frame inter-dependency define frame importance order, then using that processing frame transmission which high priority frame take high transmission probability.
{"title":"Energy-Efficient Sleep Mode Adjustment Considering GoP Structure","authors":"Meihua Jin, Ji-Young Jung, Dara Ron, Sengly Muy, Jung-Ryun Lee","doi":"10.1109/ICOIN.2019.8718129","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718129","url":null,"abstract":"In order to reduce power consumption of GO in Wi-Fi direct which act as traditional Wi-Fi AP, the Wi-Fi alliance proposed two power saving method called Opportunistic power save and NOA power save method. However, both scheme result in different energy efficiency performance according to traffic pattern, also the specification does not define how GO adjust the parameters(CTWindow, ratio of absent/present interval). In this paper, we proposed a new power saving method based on NOA power save mode to improve energy efficiency. We obtain energy gain by dynamically adjusting the GO awake interval depending on the estimated size of video frame which arrive the next beacon period. Additionally, based on frame inter-dependency define frame importance order, then using that processing frame transmission which high priority frame take high transmission probability.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124055050","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718164
Keita Onose, Koya Sato, Kei Inage, T. Fujii
In order to realize highly efficient spectrum sharing, it is important to accurately recognize the radio environment for the suitable communication parameter setting, and interpolation of the statistical information on the frequency axis can be used. Some papers report that shadowing has high frequency correlated. However, conventional works only present frequency correlation analyses between several distant channels. In this paper, we evaluate frequency correlation of shadowing based on actual measurement using 5 GHz wireless LAN channels for confirming the adaptability of the frequency correlation to wireless environment recognition. In addition, we examine the possibility of interpolation of statistical information on frequency axis using inverse distance weighting (IDW).
{"title":"Experimental Verification of Frequency-Correlation in Radio Propagation Characteristics for Radio Environment Recognition","authors":"Keita Onose, Koya Sato, Kei Inage, T. Fujii","doi":"10.1109/ICOIN.2019.8718164","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718164","url":null,"abstract":"In order to realize highly efficient spectrum sharing, it is important to accurately recognize the radio environment for the suitable communication parameter setting, and interpolation of the statistical information on the frequency axis can be used. Some papers report that shadowing has high frequency correlated. However, conventional works only present frequency correlation analyses between several distant channels. In this paper, we evaluate frequency correlation of shadowing based on actual measurement using 5 GHz wireless LAN channels for confirming the adaptability of the frequency correlation to wireless environment recognition. In addition, we examine the possibility of interpolation of statistical information on frequency axis using inverse distance weighting (IDW).","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124168333","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718106
Muhammad Hanif, Hyeongdeok Yoon, Choonhwa Lee
There is an upsurge in the usage and adaptation of streaming applications in the recent years by both industry and academia. At the core of these applications is streaming data processing engines that perform resource management and allocation in order to support continuous track of queries over distributed data streams. Several stream processing engines exists to handle these distributed streaming applications. In this paper, we present different challenges of the stream processing systems, in particular to stateful operators and implement Linear Road benchmark to examine the characteristic and performance metrics of the streaming system, in particular Apache Flink. Furthermore, we examine that Apache Flink can be used as a core for an efficient Linear Road application implementation for distributed environments without breaching the SLA requirements of the application.
{"title":"Benchmarking Tool for Modern Distributed Stream Processing Engines","authors":"Muhammad Hanif, Hyeongdeok Yoon, Choonhwa Lee","doi":"10.1109/ICOIN.2019.8718106","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718106","url":null,"abstract":"There is an upsurge in the usage and adaptation of streaming applications in the recent years by both industry and academia. At the core of these applications is streaming data processing engines that perform resource management and allocation in order to support continuous track of queries over distributed data streams. Several stream processing engines exists to handle these distributed streaming applications. In this paper, we present different challenges of the stream processing systems, in particular to stateful operators and implement Linear Road benchmark to examine the characteristic and performance metrics of the streaming system, in particular Apache Flink. Furthermore, we examine that Apache Flink can be used as a core for an efficient Linear Road application implementation for distributed environments without breaching the SLA requirements of the application.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"2020 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131748668","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}
Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718172
H. Brahmi
Many approaches have provided applicable solutions to explain associations within data cubes. Nevertheless, there are still many issues causing users extra time to get real knowledge or even failing to obtain the useful knowledge they need. In this paper, we introduce an ontology based approach for multidimensional association rule mining that incorporates a domain ontology to help users in reducing the system resource consumption and improving the efficiency of the mining process. The structure of this ontology is illustrated and how it would be of benefit to the mining process is also demonstrated. Our experimental results prove that a significant improvement and efficiency is achieved using our suggested approach in comparison with those fitting in the same trend.
{"title":"Ontology Enhanced Mining of Multidimensional Association Rules from Data Cubes","authors":"H. Brahmi","doi":"10.1109/ICOIN.2019.8718172","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718172","url":null,"abstract":"Many approaches have provided applicable solutions to explain associations within data cubes. Nevertheless, there are still many issues causing users extra time to get real knowledge or even failing to obtain the useful knowledge they need. In this paper, we introduce an ontology based approach for multidimensional association rule mining that incorporates a domain ontology to help users in reducing the system resource consumption and improving the efficiency of the mining process. The structure of this ontology is illustrated and how it would be of benefit to the mining process is also demonstrated. Our experimental results prove that a significant improvement and efficiency is achieved using our suggested approach in comparison with those fitting in the same trend.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131744208","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
扫码关注我们
求助内容：
应助结果提醒方式：