Pub Date : 2020-03-05DOI: 10.1109/ICDCS48716.2020.243560
G. Saranya, M. SivamangaiN., B. Priya, R. BenazirBegam
The electrical and optical characteristics of InGaN/GaN based light emitting diodes (LEDs) having V-shaped, trapezoidal and U-shaped quantum well is simulated using TCAD Silvaco software. Comparison of different well shape is studied and simulation results shows that the device with V-shaped quantum well has superior performance in terms of Internal Quantum Efficiency of 80% and optical power of 120 mW for a maximum current of 200 mA when compared with U-shaped and trapezoidal well.
{"title":"Design and Simulation of Multiple Quantum well based InGaN/GaN Light Emitting Diode for High power applications","authors":"G. Saranya, M. SivamangaiN., B. Priya, R. BenazirBegam","doi":"10.1109/ICDCS48716.2020.243560","DOIUrl":"https://doi.org/10.1109/ICDCS48716.2020.243560","url":null,"abstract":"The electrical and optical characteristics of InGaN/GaN based light emitting diodes (LEDs) having V-shaped, trapezoidal and U-shaped quantum well is simulated using TCAD Silvaco software. Comparison of different well shape is studied and simulation results shows that the device with V-shaped quantum well has superior performance in terms of Internal Quantum Efficiency of 80% and optical power of 120 mW for a maximum current of 200 mA when compared with U-shaped and trapezoidal well.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"18 1","pages":"109-112"},"PeriodicalIF":0.0,"publicationDate":"2020-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86950854","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 : 2020-03-01DOI: 10.1109/ICDCS48716.2020.243577
M. AbiTZerith, M. Nesasudha
In this paper, a compact flexible and wearable meandered structure microstrip patch antenna to resonate at 2.45 GHz frequency (ISM band) has been proposed. The proposed antenna substrate is designed using polydimethylsiloxane (PDMS) substrate with a dielectric constant of 2.71, loss tangent of 0.0134 and thickness of 1mm. The silicone polymer is highly flexible and well suited for wearable applications. The overall size of the proposed flexible antenna is 33x30x1 mm3. The parameters such as gain, return loss, directivity, VSWR, radiation efficiency and the surface current distribution of the designed antenna are analyzed and validated using finite element method based Ansys HFSS (High Frequency Simulator Software) software. The simulation results show that the antenna has a gain of 1.9 dB, -26.82 dB return loss, 100 MHz bandwidth (2.4 GHz – 2.5 GHz) based on |S 11 | ≤ -10 dB, a directivity of 2.1 and 92% radiation efficiency. The compact size and high flexibility of the proposed antenna makes it suitable for Wireless Body Area Network (WBAN) applications.
{"title":"A Compact Wearable 2.45 GHz Antenna for WBAN Applications","authors":"M. AbiTZerith, M. Nesasudha","doi":"10.1109/ICDCS48716.2020.243577","DOIUrl":"https://doi.org/10.1109/ICDCS48716.2020.243577","url":null,"abstract":"In this paper, a compact flexible and wearable meandered structure microstrip patch antenna to resonate at 2.45 GHz frequency (ISM band) has been proposed. The proposed antenna substrate is designed using polydimethylsiloxane (PDMS) substrate with a dielectric constant of 2.71, loss tangent of 0.0134 and thickness of 1mm. The silicone polymer is highly flexible and well suited for wearable applications. The overall size of the proposed flexible antenna is 33x30x1 mm3. The parameters such as gain, return loss, directivity, VSWR, radiation efficiency and the surface current distribution of the designed antenna are analyzed and validated using finite element method based Ansys HFSS (High Frequency Simulator Software) software. The simulation results show that the antenna has a gain of 1.9 dB, -26.82 dB return loss, 100 MHz bandwidth (2.4 GHz – 2.5 GHz) based on |S 11 | ≤ -10 dB, a directivity of 2.1 and 92% radiation efficiency. The compact size and high flexibility of the proposed antenna makes it suitable for Wireless Body Area Network (WBAN) applications.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"64 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84389678","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 : 2020-03-01DOI: 10.1109/ICDCS48716.2020.243536
N. Kumar, G. Bala
Routing protocols have ability to discover and maintain routes in the network. However, the efficiency of designed routing protocol depends on the node capability and application requirement. IoTN (Internet of Things Network) is being adopted into real time applications such as finding shortest path to reach destination, traffic management, rerouting path based on weather conditions, happy home architectures, weather systems and so on. Despite enormous applications of IoTN, the battery life and energy efficiency are limited to fulfil applications in IoTN. Hence the selected features for the proposed algorithm contribute towards optimizing the path to select best and least distance path to destination using ant-based system. Proposed Ant-colony optimized stable path (AOSP) selection algorithm focus on network selection stages like Selection of acquaintances, channel decisions and Energy management. Sensors can communicate with target BS (Base station) to forward or relay the data efficiently to reach server. The optimal intermediate sensors can act as cluster head and collect information from group of sensors with minimal energy spent which increase the throughput and decrease the packet dropping ratio.
{"title":"A Cognitive Based Channel Assortment Using Ant-Colony Optimized Stable Path Selection in an IoTN","authors":"N. Kumar, G. Bala","doi":"10.1109/ICDCS48716.2020.243536","DOIUrl":"https://doi.org/10.1109/ICDCS48716.2020.243536","url":null,"abstract":"Routing protocols have ability to discover and maintain routes in the network. However, the efficiency of designed routing protocol depends on the node capability and application requirement. IoTN (Internet of Things Network) is being adopted into real time applications such as finding shortest path to reach destination, traffic management, rerouting path based on weather conditions, happy home architectures, weather systems and so on. Despite enormous applications of IoTN, the battery life and energy efficiency are limited to fulfil applications in IoTN. Hence the selected features for the proposed algorithm contribute towards optimizing the path to select best and least distance path to destination using ant-based system. Proposed Ant-colony optimized stable path (AOSP) selection algorithm focus on network selection stages like Selection of acquaintances, channel decisions and Energy management. Sensors can communicate with target BS (Base station) to forward or relay the data efficiently to reach server. The optimal intermediate sensors can act as cluster head and collect information from group of sensors with minimal energy spent which increase the throughput and decrease the packet dropping ratio.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76248968","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 : 2020-03-01DOI: 10.1109/ICDCS48716.2020.243603
A. S. Pradeeksha, S. Sathyapriya
The intensity of DNA figuring will reinforce the current security on frameworks by opening up another probability of a half and half cryptographic framework. Here, we are exhibiting the DNA S-box for actualizing cryptographic algorithm. The DNA based S-Box is designed using vivado software and implemented using Artix-7 device. The main aim is to design the DNA based S-box to increase the security. Also pipelining and parallelism techniques are to be implement in future to increase the speed.
{"title":"Design and Implementation of DNA Based Cryptographic Algorithm","authors":"A. S. Pradeeksha, S. Sathyapriya","doi":"10.1109/ICDCS48716.2020.243603","DOIUrl":"https://doi.org/10.1109/ICDCS48716.2020.243603","url":null,"abstract":"The intensity of DNA figuring will reinforce the current security on frameworks by opening up another probability of a half and half cryptographic framework. Here, we are exhibiting the DNA S-box for actualizing cryptographic algorithm. The DNA based S-Box is designed using vivado software and implemented using Artix-7 device. The main aim is to design the DNA based S-box to increase the security. Also pipelining and parallelism techniques are to be implement in future to increase the speed.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80127858","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 : 2020-03-01DOI: 10.1109/ICDCS48716.2020.243541
T. NithyaShree, A. Selvarani
Children with Autism Spectrum Disorder (ASD) are found having impairments related to brain development that causes deficits in social communication, cognitive skills, sensory and emotional regulations. Virtual Reality allows children with ASD to safely participate in interactive and immersive simulated situations. This proposed study contributes to children affected with ASD to improve managing their safety awareness on fire and to identify the environment that is about to cause a fire accident and make them exit from the situation. As short sessions and unembellished designs are advised in VR for such kinds of disorders, in this the work is attempted to create a model environment in Unity Engine, that could create awareness towards the improvisation of safety on fire by completing the tasks given through stages and to monitor them to analyze their task performances and make the participants to actively immerse into virtual experiences. So this system will help children with ASD to learn about fire cautions. As a result after the required sessions, they will be to learn how to react and escape from a fire accident.
{"title":"Virtual Reality based System for Training and Monitoring Fire Safety Awareness for Children with Autism Spectrum Disorder","authors":"T. NithyaShree, A. Selvarani","doi":"10.1109/ICDCS48716.2020.243541","DOIUrl":"https://doi.org/10.1109/ICDCS48716.2020.243541","url":null,"abstract":"Children with Autism Spectrum Disorder (ASD) are found having impairments related to brain development that causes deficits in social communication, cognitive skills, sensory and emotional regulations. Virtual Reality allows children with ASD to safely participate in interactive and immersive simulated situations. This proposed study contributes to children affected with ASD to improve managing their safety awareness on fire and to identify the environment that is about to cause a fire accident and make them exit from the situation. As short sessions and unembellished designs are advised in VR for such kinds of disorders, in this the work is attempted to create a model environment in Unity Engine, that could create awareness towards the improvisation of safety on fire by completing the tasks given through stages and to monitor them to analyze their task performances and make the participants to actively immerse into virtual experiences. So this system will help children with ASD to learn about fire cautions. As a result after the required sessions, they will be to learn how to react and escape from a fire accident.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"47 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73090143","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 : 2020-03-01DOI: 10.1109/ICDCS48716.2020.243563
J. NivithaAngeline, S. AllinChriste
In this paper, two miniaturized antennas of two different dimensions has been designed and analyzed for continuous monitoring of Blood Glucose Levels (BGL). The performance of these two antennas are analyzed numerically in free space operation. The results show that both the antennas work excellently in this scenario. These antennas operate at frequencies of 2.49 Giga Hertz and 2.94 Giga Hertz with gains 1.25 decibel and 2.03 decibel respectively. Owing to good performance, small size and buoyancy to many of the effects made by the human body will prove that the antenna will have a very good potential use in the future work of glucose monitoring.
{"title":"Design and Analysis of a Small Implantable Antenna for Blood Glucose Monitoring","authors":"J. NivithaAngeline, S. AllinChriste","doi":"10.1109/ICDCS48716.2020.243563","DOIUrl":"https://doi.org/10.1109/ICDCS48716.2020.243563","url":null,"abstract":"In this paper, two miniaturized antennas of two different dimensions has been designed and analyzed for continuous monitoring of Blood Glucose Levels (BGL). The performance of these two antennas are analyzed numerically in free space operation. The results show that both the antennas work excellently in this scenario. These antennas operate at frequencies of 2.49 Giga Hertz and 2.94 Giga Hertz with gains 1.25 decibel and 2.03 decibel respectively. Owing to good performance, small size and buoyancy to many of the effects made by the human body will prove that the antenna will have a very good potential use in the future work of glucose monitoring.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89143070","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 : 2020-01-01DOI: 10.1109/ICDCS47774.2020.00159
B. SwaroopaReddy, G. Sharma
{"title":"UL-blockDAG : Unsupervised Learning based Consensus Protocol for Blockchain","authors":"B. SwaroopaReddy, G. Sharma","doi":"10.1109/ICDCS47774.2020.00159","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00159","url":null,"abstract":"","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"83 1","pages":"1243-1248"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77973440","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}
Beibei Miao, Chen Yu, Jin Xuebo, Wang Bo, Xianping Qu, Shimin Tao, Wang Dong, Zang Zhi
The Internet services generate huge amount of data, which require large space for storage. Determining device purchase plan turns out to be very important for the service providers. Under-purchasing might lead to data loss, while over-purchasing would result in waste. In this paper, we propose a linear regression based approach to predict the storage demand according to the time series of the storage consumption. We partitioned the storage con-sumption time series into several linear segments, and perform prediction on the last segment using linear regression. Since the position of turning points between adjacent segments and the total number of the segments are both unknown, how to achieve the online segmentation becomes a big challenge. Aiming to solve this problem, we carried out the Kalman-Anova segmentation method. Experiment results show that our method has good accuracy in precision, recall and F-measure values. Moreover, the method is able to segment nonlinear time series as well, suggesting a potential wider application. The proposed method has been deployed in Baidu Inc. and saves about 45 thousand dollars in one of its device purchase program.
{"title":"Segmentation of Time Series Based on Kinetic Characteristics for Storage Consumption Prediction","authors":"Beibei Miao, Chen Yu, Jin Xuebo, Wang Bo, Xianping Qu, Shimin Tao, Wang Dong, Zang Zhi","doi":"10.1109/ICDCS.2017.254","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.254","url":null,"abstract":"The Internet services generate huge amount of data, which require large space for storage. Determining device purchase plan turns out to be very important for the service providers. Under-purchasing might lead to data loss, while over-purchasing would result in waste. In this paper, we propose a linear regression based approach to predict the storage demand according to the time series of the storage consumption. We partitioned the storage con-sumption time series into several linear segments, and perform prediction on the last segment using linear regression. Since the position of turning points between adjacent segments and the total number of the segments are both unknown, how to achieve the online segmentation becomes a big challenge. Aiming to solve this problem, we carried out the Kalman-Anova segmentation method. Experiment results show that our method has good accuracy in precision, recall and F-measure values. Moreover, the method is able to segment nonlinear time series as well, suggesting a potential wider application. The proposed method has been deployed in Baidu Inc. and saves about 45 thousand dollars in one of its device purchase program.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"147 1","pages":"2559-2560"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75047959","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}
Feng Li, Jun Luo, Shiqing Xin, Wenping Wang, Ying He
Although the problem of k-area coverage has been intensively investigated for dense wireless sensor networks (WSNs), how to arrive at a k-coverage sensor deployment that optimizes certain objectives in relatively sparse WSNs still faces both theoretical and practical difficulties. In this paper, we present a practical algorithm LAACAD (Load balancing k-Area Coverage through Autonomous Deployment) to move sensor nodes toward k-area coverage, aiming at minimizing the maximum sensing range required by the nodes. LAACAD enables purely autonomous node deployment as it only entails localized computations. We prove the convergence of the algorithm, as well as the (local) optimality of the output. We also show that our optimization objective is closely related to other frequently considered objectives. Therefore, our practical algorithm design also contributes to the theoretical understanding of the k-area coverage problem. Finally, we use extensive simulation results both to confirm our theoretical claims and to demonstrate the efficacy of LAACAD.
尽管密集无线传感器网络(WSNs)的k-area覆盖问题已经得到了深入的研究，但如何在相对稀疏的WSNs中获得优化某些目标的k-coverage传感器部署仍然面临着理论和实践上的困难。在本文中，我们提出了一种实用的LAACAD (Load balancing k-Area Coverage through Autonomous Deployment)算法，将传感器节点移动到k-Area覆盖范围，旨在使节点所需的最大感知距离最小化。LAACAD支持纯粹自主的节点部署，因为它只需要本地化的计算。我们证明了算法的收敛性，以及输出的(局部)最优性。我们还表明，我们的优化目标与其他经常考虑的目标密切相关。因此，我们的实际算法设计也有助于从理论上理解k-area覆盖问题。最后，我们使用广泛的仿真结果来证实我们的理论主张并证明LAACAD的有效性。
{"title":"LAACAD: Load Balancing k-Area Coverage through Autonomous Deployment in Wireless Sensor Networks","authors":"Feng Li, Jun Luo, Shiqing Xin, Wenping Wang, Ying He","doi":"10.1109/ICDCS.2012.34","DOIUrl":"https://doi.org/10.1109/ICDCS.2012.34","url":null,"abstract":"Although the problem of k-area coverage has been intensively investigated for dense wireless sensor networks (WSNs), how to arrive at a k-coverage sensor deployment that optimizes certain objectives in relatively sparse WSNs still faces both theoretical and practical difficulties. In this paper, we present a practical algorithm LAACAD (Load balancing k-Area Coverage through Autonomous Deployment) to move sensor nodes toward k-area coverage, aiming at minimizing the maximum sensing range required by the nodes. LAACAD enables purely autonomous node deployment as it only entails localized computations. We prove the convergence of the algorithm, as well as the (local) optimality of the output. We also show that our optimization objective is closely related to other frequently considered objectives. Therefore, our practical algorithm design also contributes to the theoretical understanding of the k-area coverage problem. Finally, we use extensive simulation results both to confirm our theoretical claims and to demonstrate the efficacy of LAACAD.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"2 1","pages":"566-575"},"PeriodicalIF":0.0,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75541624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a method that can generate Self-Stabilizing (SS) parameterized protocols that are generalizable, i.e., correct for arbitrary number of finite-state processes. Specifically, we present necessary and sufficient conditions specified in the local state space of the representative process of parameterized rings for deadlock-freedom in their global state space. Moreover, we introduce sufficient conditions that guarantee live lock-freedom in arbitrary-sized unidirectional rings. We illustrate the proposed approach in the context of several classic examples including a maximal matching protocol and an agreement protocol. More importantly, the proposed method lays the foundation of an approach for automated design of global convergence in the local state space of the representative process.
{"title":"Local Reasoning for Global Convergence of Parameterized Rings","authors":"Aly Farahat, Ali Ebnenasir","doi":"10.1109/ICDCS.2012.66","DOIUrl":"https://doi.org/10.1109/ICDCS.2012.66","url":null,"abstract":"This paper presents a method that can generate Self-Stabilizing (SS) parameterized protocols that are generalizable, i.e., correct for arbitrary number of finite-state processes. Specifically, we present necessary and sufficient conditions specified in the local state space of the representative process of parameterized rings for deadlock-freedom in their global state space. Moreover, we introduce sufficient conditions that guarantee live lock-freedom in arbitrary-sized unidirectional rings. We illustrate the proposed approach in the context of several classic examples including a maximal matching protocol and an agreement protocol. More importantly, the proposed method lays the foundation of an approach for automated design of global convergence in the local state space of the representative process.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"7 1","pages":"496-505"},"PeriodicalIF":0.0,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74409608","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
扫码关注我们
求助内容：
应助结果提醒方式：