In transmitting and receiving such a large amount of data, reliable data communication is crucial for normal operation of a device and to prevent abnormal operations caused by errors. Therefore, in this paper, it is assumed that an error correction code (ECC) that can detect and correct errors by itself is used in an environment where massive data is sequentially received. Because an embedded system has limited resources, such as a low-performance processor or a small memory, it requires efficient operation of applications. In this paper, we propose using an accelerated ECC-decoding technique with a graphics processing unit (GPU) built into the embedded system when receiving a large amount of data. In the matrix–vector multiplication that forms the Hamming code used as a function of the ECC operation, the matrix is expressed in compressed sparse row (CSR) format, and a sparse matrix–vector product is used. The multiplication operation is performed in the kernel of the GPU, and we also accelerate the Hamming code computation so that the ECC operation can be performed in parallel. The proposed technique is implemented with CUDA on a GPU-embedded target board, NVIDIA Jetson TX2, and compared with execution time of the CPU.
{"title":"GPU-Based ECC Decode Unit for Efficient Massive Data Reception Acceleration","authors":"Jisu Kwon, Moon Gi Seok, Daejin Park","doi":"10.3745/JIPS.01.0060","DOIUrl":"https://doi.org/10.3745/JIPS.01.0060","url":null,"abstract":"In transmitting and receiving such a large amount of data, reliable data communication is crucial for normal operation of a device and to prevent abnormal operations caused by errors. Therefore, in this paper, it is assumed that an error correction code (ECC) that can detect and correct errors by itself is used in an environment where massive data is sequentially received. Because an embedded system has limited resources, such as a low-performance processor or a small memory, it requires efficient operation of applications. In this paper, we propose using an accelerated ECC-decoding technique with a graphics processing unit (GPU) built into the embedded system when receiving a large amount of data. In the matrix–vector multiplication that forms the Hamming code used as a function of the ECC operation, the matrix is expressed in compressed sparse row (CSR) format, and a sparse matrix–vector product is used. The multiplication operation is performed in the kernel of the GPU, and we also accelerate the Hamming code computation so that the ECC operation can be performed in parallel. The proposed technique is implemented with CUDA on a GPU-embedded target board, NVIDIA Jetson TX2, and compared with execution time of the CPU.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114705470","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}
Q. Zheng, Nan Liu, Baoqin Cao, Fenghua Wang, Yanan Yang
A zero-watermarking algorithm in transform domain based on RGB channel and voting strategy is proposed. The registration and identification of ownership have achieved copyright protection for color images. In the ownership registration, discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) are used comprehensively because they have the characteristics of multi-resolution, energy concentration and stability, which is conducive to improving the robustness of the proposed algorithm. In order to take full advantage of the characteristics of the image, we use three channels of R, G, and B of a color image to construct three master shares, instead of using data from only one channel. Then, in order to improve security, the master share is superimposed with the copyright watermark encrypted by the owner’s key to generate an ownership share. When the ownership is authenticated, copyright watermarks are extracted from the three channels of the disputed image. Then using voting decisions, the final copyright information is determined by comparing the extracted three watermarks bit by bit. Experimental results show that the proposed zero watermarking scheme is robust to conventional attacks such as JPEG compression, noise addition, filtering and tampering, and has higher stability in various common color images.
{"title":"Zero-Watermarking Algorithm in Transform Domain Based on RGB Channel and Voting Strategy","authors":"Q. Zheng, Nan Liu, Baoqin Cao, Fenghua Wang, Yanan Yang","doi":"10.3745/JIPS.02.0150","DOIUrl":"https://doi.org/10.3745/JIPS.02.0150","url":null,"abstract":"A zero-watermarking algorithm in transform domain based on RGB channel and voting strategy is proposed. The registration and identification of ownership have achieved copyright protection for color images. In the ownership registration, discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) are used comprehensively because they have the characteristics of multi-resolution, energy concentration and stability, which is conducive to improving the robustness of the proposed algorithm. In order to take full advantage of the characteristics of the image, we use three channels of R, G, and B of a color image to construct three master shares, instead of using data from only one channel. Then, in order to improve security, the master share is superimposed with the copyright watermark encrypted by the owner’s key to generate an ownership share. When the ownership is authenticated, copyright watermarks are extracted from the three channels of the disputed image. Then using voting decisions, the final copyright information is determined by comparing the extracted three watermarks bit by bit. Experimental results show that the proposed zero watermarking scheme is robust to conventional attacks such as JPEG compression, noise addition, filtering and tampering, and has higher stability in various common color images.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115745938","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 physical security layer of industrial wireless sensor networks in the event of an eavesdropping attack has been investigated in this paper. An optimal sensor selection scheme based on the maximum channel capacity is proposed for transmission environments that experience Nakagami fading. Comparing the intercept probabilities of the traditional round robin (TRR) and optimal sensor selection schemes, the system secure performance is analyzed. Simulation results show that the change in the number of sensors and the eavesdropping ratio affect the convergence rate of the intercept probability. Additionally, the proposed optimal selection scheme has a faster convergence rate compared to the TRR scheduling scheme for the same eavesdropping ratio and number of sensors. This observation is also valid when the Nakagami channel is simplified to a Rayleigh channel.
{"title":"Secure Performance Analysis Based on Maximum Capacity","authors":"Xiuping Zheng, Meiling Li, Xiaoxia Yang","doi":"10.3745/JIPS.03.0151","DOIUrl":"https://doi.org/10.3745/JIPS.03.0151","url":null,"abstract":"The physical security layer of industrial wireless sensor networks in the event of an eavesdropping attack has been investigated in this paper. An optimal sensor selection scheme based on the maximum channel capacity is proposed for transmission environments that experience Nakagami fading. Comparing the intercept probabilities of the traditional round robin (TRR) and optimal sensor selection schemes, the system secure performance is analyzed. Simulation results show that the change in the number of sensors and the eavesdropping ratio affect the convergence rate of the intercept probability. Additionally, the proposed optimal selection scheme has a faster convergence rate compared to the TRR scheduling scheme for the same eavesdropping ratio and number of sensors. This observation is also valid when the Nakagami channel is simplified to a Rayleigh channel.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127954236","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}
Crowd evacuation simulation is an important research issue for designing reasonable building layouts and planning more effective evacuation routes. The social force model (SFM) is an important pedestrian movement model, and is widely used in crowd evacuation simulations. The model can effectively simulate crowd evacuation behaviors in a simple scene, but for a multi-obstacle scene, the model could result in some undesirable problems, such as pedestrian evacuation trajectory oscillation, pedestrian stagnation and poor evacuation routing. This paper analyzes the causes of these problems and proposes an improved SFM for complex multi-obstacle scenes. The new model adds navigation points and walking shortest route principles to the SFM. Based on the proposed model, a crowd evacuation simulation system is developed, and the crowd evacuation simulation was carried out in various scenes, including some with simple obstacles, as well as those with multi-obstacles. Experiments show that the pedestrians in the proposed model can effectively bypass obstacles and plan reasonable evacuation routes.
人群疏散仿真是设计合理的建筑布局和规划更有效的疏散路线的重要研究课题。社会力模型(social force model, SFM)是一种重要的行人运动模型，广泛应用于人群疏散仿真。该模型可以有效地模拟简单场景下的人群疏散行为，但对于多障碍物场景，该模型可能会导致行人疏散轨迹振荡、行人停滞和疏散路径不佳等不良问题。本文分析了产生这些问题的原因，提出了一种针对复杂多障碍物场景的改进SFM算法。新模型在SFM中增加了导航点和步行最短路径原则。基于所提出的模型，开发了人群疏散仿真系统，并在不同场景下进行了人群疏散仿真，包括简单障碍物场景和多障碍物场景。实验表明，该模型中的行人能够有效绕过障碍物，规划合理的疏散路线。
{"title":"Improved Social Force Model based on Navigation Points for Crowd Emergent Evacuation","authors":"Jun Li, Haoxiang Zhang, Zhongrui Ni","doi":"10.3745/JIPS.04.0199","DOIUrl":"https://doi.org/10.3745/JIPS.04.0199","url":null,"abstract":"Crowd evacuation simulation is an important research issue for designing reasonable building layouts and planning more effective evacuation routes. The social force model (SFM) is an important pedestrian movement model, and is widely used in crowd evacuation simulations. The model can effectively simulate crowd evacuation behaviors in a simple scene, but for a multi-obstacle scene, the model could result in some undesirable problems, such as pedestrian evacuation trajectory oscillation, pedestrian stagnation and poor evacuation routing. This paper analyzes the causes of these problems and proposes an improved SFM for complex multi-obstacle scenes. The new model adds navigation points and walking shortest route principles to the SFM. Based on the proposed model, a crowd evacuation simulation system is developed, and the crowd evacuation simulation was carried out in various scenes, including some with simple obstacles, as well as those with multi-obstacles. Experiments show that the pedestrians in the proposed model can effectively bypass obstacles and plan reasonable evacuation routes.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122258326","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}
Visual saliency detection is an essential task because it is an important part of various vision-based applications. There are many techniques for saliency detection in color images. However, the number of methods for saliency detection in infrared images is limited. In this paper, we introduce a simple approach for saliency detection in infrared images based on the thresholding technique. The input image is thresholded into several Boolean maps, and an initial saliency map is calculated as a weighted sum of the created Boolean maps. The initial map is further refined by using thresholding, morphology operation, and a Gaussian filter to produce the final, highquality saliency map. The experiment showed that the proposed method has high performance when applied to real-life data.
{"title":"A Study on Visual Saliency Detection in Infrared Images Using Boolean Map Approach","authors":"M. T. N. Truong, Sanghoon Kim","doi":"10.3745/JIPS.02.0145","DOIUrl":"https://doi.org/10.3745/JIPS.02.0145","url":null,"abstract":"Visual saliency detection is an essential task because it is an important part of various vision-based applications. There are many techniques for saliency detection in color images. However, the number of methods for saliency detection in infrared images is limited. In this paper, we introduce a simple approach for saliency detection in infrared images based on the thresholding technique. The input image is thresholded into several Boolean maps, and an initial saliency map is calculated as a weighted sum of the created Boolean maps. The initial map is further refined by using thresholding, morphology operation, and a Gaussian filter to produce the final, highquality saliency map. The experiment showed that the proposed method has high performance when applied to real-life data.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127208968","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}
Aiming at the defect detection quality of denim fabric, this paper designs an improved algorithm based on the optimized Gabor filter. Firstly, we propose an improved defect detection algorithm of jean fabric based on the maximum two-dimensional image entropy and the loss evaluation function. Secondly, 24 Gabor filter banks with 4 scales and 6 directions are created and the optimal filter is selected from the filter banks by the one-dimensional image entropy algorithm and the two-dimensional image entropy algorithm respectively. Thirdly, these two optimized Gabor filters are compared to realize the common defect detection of denim fabric, such as normal texture, miss of weft, hole and oil stain. The results show that the improved algorithm has better detection effect on common defects of denim fabrics and the average detection rate is more than 91.25%.
{"title":"An Improved Defect Detection Algorithm of Jean Fabric Based on Optimized Gabor Filter","authors":"Shuangbao Ma, Wen Liu, Changli You, Shulin Jia, Yurong Wu","doi":"10.3745/JIPS.02.0140","DOIUrl":"https://doi.org/10.3745/JIPS.02.0140","url":null,"abstract":"Aiming at the defect detection quality of denim fabric, this paper designs an improved algorithm based on the optimized Gabor filter. Firstly, we propose an improved defect detection algorithm of jean fabric based on the maximum two-dimensional image entropy and the loss evaluation function. Secondly, 24 Gabor filter banks with 4 scales and 6 directions are created and the optimal filter is selected from the filter banks by the one-dimensional image entropy algorithm and the two-dimensional image entropy algorithm respectively. Thirdly, these two optimized Gabor filters are compared to realize the common defect detection of denim fabric, such as normal texture, miss of weft, hole and oil stain. The results show that the improved algorithm has better detection effect on common defects of denim fabrics and the average detection rate is more than 91.25%.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131816562","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 personal authentication technique is an essential tool in this complex and modern digital information society. Traditionally, the most general mechanism of personal authentication was using alphanumeric passwords. However, passwords that are hard to guess or to break, are often hard to remember. There are demands for a technology capable of replacing the text-based password system. Graphical passwords can be an alternative, but it is vulnerable to shoulder-surfing attacks. This paper looks through a number of recently developed graphical password systems and introduces a personal authentication system using a machine learning technique with electroencephalography (EEG) signals as a new type of personal authentication system which is easier for a person to use and more difficult for others to steal than other preexisting authentication systems.
{"title":"Next-Generation Personal Authentication Scheme Based on EEG Signal and Deep Learning","authors":"Gi-Chul Yang","doi":"10.3745/JIPS.03.0147","DOIUrl":"https://doi.org/10.3745/JIPS.03.0147","url":null,"abstract":"The personal authentication technique is an essential tool in this complex and modern digital information society. Traditionally, the most general mechanism of personal authentication was using alphanumeric passwords. However, passwords that are hard to guess or to break, are often hard to remember. There are demands for a technology capable of replacing the text-based password system. Graphical passwords can be an alternative, but it is vulnerable to shoulder-surfing attacks. This paper looks through a number of recently developed graphical password systems and introduces a personal authentication system using a machine learning technique with electroencephalography (EEG) signals as a new type of personal authentication system which is easier for a person to use and more difficult for others to steal than other preexisting authentication systems.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125932306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this study, we propose a reinforcement learning agent to control the data transmission rates of nodes in carrier sensing multiple access with collision avoidance (CSMA/CA)-based wireless networks. We design a reinforcement learning (RL) agent, based on Q-learning. The agent learns the environment using the timeout events of packets, which are locally available in data sending nodes. The agent selects actions to control the data transmission rates of nodes that adjust the modulation and coding scheme (MCS) levels of the data packets to utilize the available bandwidth in dynamically changing channel conditions effectively. We use the ns3-gym framework to simulate RL and investigate the effects of the parameters of Q-learning on the performance of the RL agent. The simulation results indicate that the proposed RL agent adequately adjusts the MCS levels according to the changes in the network, and achieves a high throughput comparable to those of the existing data transmission rate adaptation schemes such as Minstrel.
{"title":"Rate Adaptation with Q-Learning in CSMA/CA Wireless Networks","authors":"Soohyun Cho","doi":"10.3745/JIPS.03.0148","DOIUrl":"https://doi.org/10.3745/JIPS.03.0148","url":null,"abstract":"In this study, we propose a reinforcement learning agent to control the data transmission rates of nodes in carrier sensing multiple access with collision avoidance (CSMA/CA)-based wireless networks. We design a reinforcement learning (RL) agent, based on Q-learning. The agent learns the environment using the timeout events of packets, which are locally available in data sending nodes. The agent selects actions to control the data transmission rates of nodes that adjust the modulation and coding scheme (MCS) levels of the data packets to utilize the available bandwidth in dynamically changing channel conditions effectively. We use the ns3-gym framework to simulate RL and investigate the effects of the parameters of Q-learning on the performance of the RL agent. The simulation results indicate that the proposed RL agent adequately adjusts the MCS levels according to the changes in the network, and achieves a high throughput comparable to those of the existing data transmission rate adaptation schemes such as Minstrel.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130658188","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}
Sehrish Malik, Israr Ullah, Do-Hyeun Kim, Kyu-Tae Lee
There is a growing interest in the development of smart environments through predicting the behaviors of inhabitants of smart spaces in the recent past. Various smart services are deployed in modern smart cities to facilitate residents and city administration. Prediction algorithms are broadly used in the smart fields in order to well equip the smart services for the future demands. Hence, an accurate prediction technology plays a vital role in the smart services. In this paper, we take out an extensive survey of smart spaces such as smart homes, smart farms and smart cars and smart applications such as smart health and smart energy. Our extensive survey is based on more than 400 articles and the final list of research studies included in this survey consist of 134 research papers selected using Google Scholar database for period of 2008 to 2018. In this survey, we highlight the role of prediction algorithms in each sub-domain of smart Internet of Things (IoT) environments. We also discuss the main algorithms which play pivotal role in a particular IoT subfield and effectiveness of these algorithms. The conducted survey provides an efficient way to analyze and have a quick understanding of state of the art work in the targeted domain. To the best of our knowledge, this is the very first survey paper on main categories of prediction algorithms covering statistical, heuristic and hybrid approaches for smart environments.
{"title":"Heuristic and Statistical Prediction Algorithms Survey for Smart Environments","authors":"Sehrish Malik, Israr Ullah, Do-Hyeun Kim, Kyu-Tae Lee","doi":"10.3745/JIPS.04.0191","DOIUrl":"https://doi.org/10.3745/JIPS.04.0191","url":null,"abstract":"There is a growing interest in the development of smart environments through predicting the behaviors of inhabitants of smart spaces in the recent past. Various smart services are deployed in modern smart cities to facilitate residents and city administration. Prediction algorithms are broadly used in the smart fields in order to well equip the smart services for the future demands. Hence, an accurate prediction technology plays a vital role in the smart services. In this paper, we take out an extensive survey of smart spaces such as smart homes, smart farms and smart cars and smart applications such as smart health and smart energy. Our extensive survey is based on more than 400 articles and the final list of research studies included in this survey consist of 134 research papers selected using Google Scholar database for period of 2008 to 2018. In this survey, we highlight the role of prediction algorithms in each sub-domain of smart Internet of Things (IoT) environments. We also discuss the main algorithms which play pivotal role in a particular IoT subfield and effectiveness of these algorithms. The conducted survey provides an efficient way to analyze and have a quick understanding of state of the art work in the targeted domain. To the best of our knowledge, this is the very first survey paper on main categories of prediction algorithms covering statistical, heuristic and hybrid approaches for smart environments.","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121815901","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}
{"title":"A Survey of Deep Learning in Agriculture: Techniques and Their Applications","authors":"Chengjuan Ren, Dae-Kyoo Kim, Dongwon Jeong","doi":"10.3745/JIPS.04.0187","DOIUrl":"https://doi.org/10.3745/JIPS.04.0187","url":null,"abstract":"","PeriodicalId":415161,"journal":{"name":"J. Inf. Process. Syst.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124039980","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
扫码关注我们
求助内容：
应助结果提醒方式：