Pub Date : 2019-12-01DOI: 10.1109/globecom38437.2019.9014212
Christopher Paolini, Davit Soselia, Harsimran Baweja, Mahasweta Sarkar
A leading cause of physical injury sustained by elderly persons is the event of unintentionally falling onto a hard surface. Approximately 32-42% of those 70 and over fall at least once each year, and those who live in assisted living facilities fall with greater frequency per year than those who live in residential communities. Delay between the time of fall and the time of medical attention can exacerbate injury if the fall resulted in concussion, traumatic brain injury, or bone fracture. Several implementations of mobile, wireless, wearable, low-power fall detection sensors (FDS) have become commercially available. These devices are typically worn around the neck as a pendant, or on the wrist, as a watch is worn. Based on features collected from IMU sensors placed at sixteen body locations, and used to train four different machine learning models, our findings show the optimal placement for an FDS on the body is in front of the shinbone.
{"title":"Optimal Location for Fall Detection Edge Inferencing.","authors":"Christopher Paolini, Davit Soselia, Harsimran Baweja, Mahasweta Sarkar","doi":"10.1109/globecom38437.2019.9014212","DOIUrl":"https://doi.org/10.1109/globecom38437.2019.9014212","url":null,"abstract":"<p><p>A leading cause of physical injury sustained by elderly persons is the event of unintentionally falling onto a hard surface. Approximately 32-42% of those 70 and over fall at least once each year, and those who live in assisted living facilities fall with greater frequency per year than those who live in residential communities. Delay between the time of fall and the time of medical attention can exacerbate injury if the fall resulted in concussion, traumatic brain injury, or bone fracture. Several implementations of mobile, wireless, wearable, low-power fall detection sensors (FDS) have become commercially available. These devices are typically worn around the neck as a pendant, or on the wrist, as a watch is worn. Based on features collected from IMU sensors placed at sixteen body locations, and used to train four different machine learning models, our findings show the optimal placement for an FDS on the body is in front of the shinbone.</p>","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"2019 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/globecom38437.2019.9014212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9892795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/GLOCOM.2018.8647922
Rithea Ngeth, Yuto Lim, B. Kurkoski, Yasuo Tan
A physical-layer network coding approach, compute-and- forward based on nested lattice code (NLC), is considered for multi-source multi-relay networks. This paper proposes a design of overlapped chunked code (OCC) which is applied before NLC, which we call OCC/CF. Random linear network coding is applied within each chunk. Only the transmissions from the sources to the relays are considered. The design is based on the empirical rank distribution and the empirical probability distributions of the participation factor of all sources. A consecutive OCC is employed with the proposed design to investigate the performance of OCC/CF. From the numerical results, the design overhead of OCC/CF is low when the probability distribution of the participation factor is dense at chunk size for each source.
{"title":"A Design of Overlapped Chunked Code over Compute-and-Forward in Multi-Source Multi-Relay Networks","authors":"Rithea Ngeth, Yuto Lim, B. Kurkoski, Yasuo Tan","doi":"10.1109/GLOCOM.2018.8647922","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647922","url":null,"abstract":"A physical-layer network coding approach, compute-and- forward based on nested lattice code (NLC), is considered for multi-source multi-relay networks. This paper proposes a design of overlapped chunked code (OCC) which is applied before NLC, which we call OCC/CF. Random linear network coding is applied within each chunk. Only the transmissions from the sources to the relays are considered. The design is based on the empirical rank distribution and the empirical probability distributions of the participation factor of all sources. A consecutive OCC is employed with the proposed design to investigate the performance of OCC/CF. From the numerical results, the design overhead of OCC/CF is low when the probability distribution of the participation factor is dense at chunk size for each source.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"17 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77350910","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 : 2016-12-01DOI: 10.1109/GLOCOM.2016.7841932
Qingxia Chen, F. Yu, Tao Huang, Renchao Xie, Jiang Liu, Yun-jie Liu
Recently, there are significant advances in the areas of networking, caching and computing. Nevertheless, these three important areas have traditionally been addressed separately in the existing research. In this paper, we present a novel framework that integrates networking, caching and computing in a systematic way and enables dynamic orchestration of these three resources to improve the end-to-end system performance and meet the requirements of different applications. Then, we consider the bandwidth, caching and computing resource allocation issue and formulate it as a joint caching/computing strategy and servers selection problem to minimize the combination cost of network usage and energy consumption in the framework. To minimize the combination cost of network usage and energy consumption in the framework, we formulate it as a joint caching/computing strategy and servers selection problem. In addition, we solve the joint caching/computing strategy and servers selection problem using an exhaustive-search algorithm. Simulation results show that our proposed framework significantly outperforms the traditional network without in-network caching/computing in terms of network usage and energy consumption.
{"title":"Joint Resource Allocation for Software Defined Networking, Caching and Computing","authors":"Qingxia Chen, F. Yu, Tao Huang, Renchao Xie, Jiang Liu, Yun-jie Liu","doi":"10.1109/GLOCOM.2016.7841932","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841932","url":null,"abstract":"Recently, there are significant advances in the areas of networking, caching and computing. Nevertheless, these three important areas have traditionally been addressed separately in the existing research. In this paper, we present a novel framework that integrates networking, caching and computing in a systematic way and enables dynamic orchestration of these three resources to improve the end-to-end system performance and meet the requirements of different applications. Then, we consider the bandwidth, caching and computing resource allocation issue and formulate it as a joint caching/computing strategy and servers selection problem to minimize the combination cost of network usage and energy consumption in the framework. To minimize the combination cost of network usage and energy consumption in the framework, we formulate it as a joint caching/computing strategy and servers selection problem. In addition, we solve the joint caching/computing strategy and servers selection problem using an exhaustive-search algorithm. Simulation results show that our proposed framework significantly outperforms the traditional network without in-network caching/computing in terms of network usage and energy consumption.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84403836","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 : 2016-12-01DOI: 10.1109/GLOCOM.2016.7841758
A. Hussain, Sang-Hyo Kim, Seok-Ho Chang
In this paper, the performance of a dual-hop variable-gain amplify-and-forward (AF) relay system with beamforming is analyzed for the recently proposed κ-μ shadowed fading model. The κ-μ shadowed fading model can emulate different types of empirical wireless channels that undergo shadowing, fading, or both and it includes the κ-μ, Rayleigh, Nakagami-$m$, Rician, and Rician shadowed channels as special cases. We consider that the source and destination are equipped with multiple-antennas and communication occurs through a single-antenna variable-gain relay. First, we derive the new exact analytical expressions for the outage probability (OP) and average capacity, then, we derive the asymptotic results for the OP and average capacity in terms of basic elementary functions to get useful intuition on the impact of the shaping parameters and multiple-antennas on the system performance. These results enable us to explicitly analyze the performance of relaying system under different environments arising from fading and shadowing occurring simultaneously as well as separately. Our results are general so as to be readily reduced to previously published results for classical fading channels as well as new additional ones.
{"title":"Dual-Hop Variable-Gain AF Relaying with Beamforming over k-µ Shadowed Fading Channels","authors":"A. Hussain, Sang-Hyo Kim, Seok-Ho Chang","doi":"10.1109/GLOCOM.2016.7841758","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841758","url":null,"abstract":"In this paper, the performance of a dual-hop variable-gain amplify-and-forward (AF) relay system with beamforming is analyzed for the recently proposed κ-μ shadowed fading model. The κ-μ shadowed fading model can emulate different types of empirical wireless channels that undergo shadowing, fading, or both and it includes the κ-μ, Rayleigh, Nakagami-$m$, Rician, and Rician shadowed channels as special cases. We consider that the source and destination are equipped with multiple-antennas and communication occurs through a single-antenna variable-gain relay. First, we derive the new exact analytical expressions for the outage probability (OP) and average capacity, then, we derive the asymptotic results for the OP and average capacity in terms of basic elementary functions to get useful intuition on the impact of the shaping parameters and multiple-antennas on the system performance. These results enable us to explicitly analyze the performance of relaying system under different environments arising from fading and shadowing occurring simultaneously as well as separately. Our results are general so as to be readily reduced to previously published results for classical fading channels as well as new additional ones.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"8 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75176893","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 : 2015-02-09DOI: 10.1109/GLOCOM.2014.7037030
N. Lee, R. Heath
In this paper, a space-time physical-layer network coding method is proposed in fully-connected multi-way relay networks. The proposed method includes two essential steps: side-information learning; and space-time relay transmission. In the phase of side-information learning, sets of users are scheduled to transmit messages over networks and the remaining users and relays overhear the transmitted messages to learn the interference patterns. In the phase of space-time relay transmission, multiple relays cooperatively transmit linear combinations of received messages in the previous phase using space-time precoding so that all users simultaneously harness their side-information in decoding. With this transmission technique, it is shown that the sum of degrees of freedom of the network is improved compared to existing interference management methods. Our key finding is that efficiently exploiting both transmitted and overheard messages as side-information brings substantial performance gains to fully-connected multi-way relay networks.
{"title":"2014 IEEE Global Communications Conference, GLOBECOM 2014","authors":"N. Lee, R. Heath","doi":"10.1109/GLOCOM.2014.7037030","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037030","url":null,"abstract":"In this paper, a space-time physical-layer network coding method is proposed in fully-connected multi-way relay networks. The proposed method includes two essential steps: side-information learning; and space-time relay transmission. In the phase of side-information learning, sets of users are scheduled to transmit messages over networks and the remaining users and relays overhear the transmitted messages to learn the interference patterns. In the phase of space-time relay transmission, multiple relays cooperatively transmit linear combinations of received messages in the previous phase using space-time precoding so that all users simultaneously harness their side-information in decoding. With this transmission technique, it is shown that the sum of degrees of freedom of the network is improved compared to existing interference management methods. Our key finding is that efficiently exploiting both transmitted and overheard messages as side-information brings substantial performance gains to fully-connected multi-way relay networks.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"37 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74623993","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037155
D. M. F. Mattos, O. Duarte
Next generation networks offer virtual networks on demand, each one with its own features and Quality of Service (QoS) requirements. Besides, live-migration provides a flexible and seamless topology remapping primitive for virtual networks, but it is usually limited to a local area network. In this paper, we propose XenFlow, a hybrid virtualization system, based on Xen and OpenFlow. XenFlow main goals are threefold. First, it provides a flexible virtual network migration primitive, as it deploys a Software Defined Networking between virtual machines, based on OpenFlow. Second, it provides a strong isolation of virtual networks, avoiding denial of service caused by interference of other virtual networks. Third, XenFlow offers inter-network and intra-network QoS provisioning by a consistent resource controller. We developed a prototype and our results show that the proposed system performs better than native mechanism of Xen virtual machine migration. XenFlow allows virtual router migration between different local area networks without creating tunnels or losing packets. Our experiments also show that resource usage controller meets QoS requirements and outperforms other techniques while it redistributes idle network resources.
{"title":"XenFlow: Seamless migration primitive and quality of service for virtual networks","authors":"D. M. F. Mattos, O. Duarte","doi":"10.1109/GLOCOM.2014.7037155","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037155","url":null,"abstract":"Next generation networks offer virtual networks on demand, each one with its own features and Quality of Service (QoS) requirements. Besides, live-migration provides a flexible and seamless topology remapping primitive for virtual networks, but it is usually limited to a local area network. In this paper, we propose XenFlow, a hybrid virtualization system, based on Xen and OpenFlow. XenFlow main goals are threefold. First, it provides a flexible virtual network migration primitive, as it deploys a Software Defined Networking between virtual machines, based on OpenFlow. Second, it provides a strong isolation of virtual networks, avoiding denial of service caused by interference of other virtual networks. Third, XenFlow offers inter-network and intra-network QoS provisioning by a consistent resource controller. We developed a prototype and our results show that the proposed system performs better than native mechanism of Xen virtual machine migration. XenFlow allows virtual router migration between different local area networks without creating tunnels or losing packets. Our experiments also show that resource usage controller meets QoS requirements and outperforms other techniques while it redistributes idle network resources.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"39 1","pages":"2326-2331"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89227868","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037146
Lyno Henrique G. Ferraz, D. M. F. Mattos, O. Duarte
Data centers for cloud computing should allocate services with different traffic patterns, provide high data transfer capacity and link fault tolerance. Data center network topologies provide physical connection redundancy, which forwarding mechanisms avail to generate multiple paths. In this paper, we divide multipathing into two phases: (i) Configuration phase based on genetic algorithms to minimize path lengths and maximize link usage diversity; (ii) Path selection phase based on heuristics to minimize path reuse. The proposed multipathing scheme implements minimal modification in infrastructure. Our proposal only requires common network devices features and it avoids any tenant modification. We develop a flow simulator to evaluate multipathing techniques. The simulations model flow behaviors in different data center scenarios and compares the proposed scheme with multipathing techniques in literature. The results show the proposed scheme enhances transmission rates, even in the highest network utilization scenarios.
{"title":"A two-phase multipathing scheme based on genetic algorithm for data center networking","authors":"Lyno Henrique G. Ferraz, D. M. F. Mattos, O. Duarte","doi":"10.1109/GLOCOM.2014.7037146","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037146","url":null,"abstract":"Data centers for cloud computing should allocate services with different traffic patterns, provide high data transfer capacity and link fault tolerance. Data center network topologies provide physical connection redundancy, which forwarding mechanisms avail to generate multiple paths. In this paper, we divide multipathing into two phases: (i) Configuration phase based on genetic algorithms to minimize path lengths and maximize link usage diversity; (ii) Path selection phase based on heuristics to minimize path reuse. The proposed multipathing scheme implements minimal modification in infrastructure. Our proposal only requires common network devices features and it avoids any tenant modification. We develop a flow simulator to evaluate multipathing techniques. The simulations model flow behaviors in different data center scenarios and compares the proposed scheme with multipathing techniques in literature. The results show the proposed scheme enhances transmission rates, even in the highest network utilization scenarios.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"27 1","pages":"2270-2275"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78002225","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503348
Yong Wang, Yun Li, Xiaolong Yang, Chao Liao, Quan Chen
Recently, as it can increase the capacity of wireless networks greatly through spatial diversity by taking advantage of antennas on other nodes, cooperative communication (CC) has been obtaining more and more attention. However, as the selfish nature, the wireless node may be unwilling to serve as relay node if they can't get the corresponding reward. In this paper, we constructs a real double-auction scenario between source nodes and relay nodes instead of idealized truthful market which may obtain relatively lower system performance. We consider the system performance involving (1) successful source-relay pairs, (2) system capacity and (3) social welfare (SW). We transform the double auction-based optimal relay assignment problem into Maximum Matching (MM) and Maximum Weighted Matching (MWM) problem respectively and solve them using corresponding algorithms. Extensive experiments show that this mechanism can achieve higher system efficiency than truthful auction.
{"title":"Double auction-based optimal relay assignment for many-to-many cooperative wireless networks","authors":"Yong Wang, Yun Li, Xiaolong Yang, Chao Liao, Quan Chen","doi":"10.1109/GLOCOM.2012.6503348","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503348","url":null,"abstract":"Recently, as it can increase the capacity of wireless networks greatly through spatial diversity by taking advantage of antennas on other nodes, cooperative communication (CC) has been obtaining more and more attention. However, as the selfish nature, the wireless node may be unwilling to serve as relay node if they can't get the corresponding reward. In this paper, we constructs a real double-auction scenario between source nodes and relay nodes instead of idealized truthful market which may obtain relatively lower system performance. We consider the system performance involving (1) successful source-relay pairs, (2) system capacity and (3) social welfare (SW). We transform the double auction-based optimal relay assignment problem into Maximum Matching (MM) and Maximum Weighted Matching (MWM) problem respectively and solve them using corresponding algorithms. Extensive experiments show that this mechanism can achieve higher system efficiency than truthful auction.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"59 1","pages":"1635-1640"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73325305","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503148
Bo Chai, Ruilong Deng, Peng Cheng, Jiming Chen
In this paper, we study power allocation in cognitive sensor networks where cognitive users (cognitive enabled sensor nodes) opportunistically share a common spectrum with primary users (licensed devices). We define an energy efficiency-oriented utility function as a new metric to evaluate power allocation. Consider that sensor nodes are self-interested to maximize their own utility, we formulate the energy efficient power allocation problem as a non-cooperative game. We firstly prove that there exist Nash equilibriums in the proposed game. Secondly, we prove that the power allocation game is a supermodular game with some conditions. Finally, we use best response algorithm to identify the Nash equilibrium. Simulations are conducted to demonstrate that the proposed power allocation strategy can achieve satisfactory performance in terms of energy efficiency, convergence speed and fairness in cognitive sensor networks.
{"title":"Energy-efficient power allocation in cognitive sensor networks: A game theoretic approach","authors":"Bo Chai, Ruilong Deng, Peng Cheng, Jiming Chen","doi":"10.1109/GLOCOM.2012.6503148","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503148","url":null,"abstract":"In this paper, we study power allocation in cognitive sensor networks where cognitive users (cognitive enabled sensor nodes) opportunistically share a common spectrum with primary users (licensed devices). We define an energy efficiency-oriented utility function as a new metric to evaluate power allocation. Consider that sensor nodes are self-interested to maximize their own utility, we formulate the energy efficient power allocation problem as a non-cooperative game. We firstly prove that there exist Nash equilibriums in the proposed game. Secondly, we prove that the power allocation game is a supermodular game with some conditions. Finally, we use best response algorithm to identify the Nash equilibrium. Simulations are conducted to demonstrate that the proposed power allocation strategy can achieve satisfactory performance in terms of energy efficiency, convergence speed and fairness in cognitive sensor networks.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"33 1","pages":"416-421"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76400103","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号