Pub Date : 2012-02-01DOI: 10.5220/0003824603990402
D. Gibson, H. Muller, N. Campbell
In this paper we propose that the combination of a state-of-the-art high frequency, low energy demanding microprocessor architecture combined with a highly programmable image sensor can offer a substantial reduction in cost and energy requirement when carrying out low-level visual event detection and object tracking. The XMOS microprocessor consists of a single or multi-core concurrent architecture that runs at between 400 and 1600 MIPS with 64KB per-core of on chip RAM. Modern highly programmable image sensors such as the Kodak KAC-401 can capture regions-of-interest (ROI) at rates in excess of 1500fps. To compare the difference between two 320 by 240 pixel images one would usually require 150KB of RAM, by combining the above components as a computational camera this constraint can be overcome. In the proposed system the microprocessor programs the sensor to capture images as a sequence of high frame rate regions-of-interest. These regions can be processed to determine the presence of motion as differences of ROIs over time. By providing additional cores extensive image processing can be carried out and ROI pixels can be composited onto an LCD to give output images of 320 by 240 pixels at near standard frame rates.
{"title":"Adaptive Image Sensor Sampling for Limited Memory Motion Detection","authors":"D. Gibson, H. Muller, N. Campbell","doi":"10.5220/0003824603990402","DOIUrl":"https://doi.org/10.5220/0003824603990402","url":null,"abstract":"In this paper we propose that the combination of a state-of-the-art high frequency, low energy demanding microprocessor architecture combined with a highly programmable image sensor can offer a substantial reduction in cost and energy requirement when carrying out low-level visual event detection and object tracking. The XMOS microprocessor consists of a single or multi-core concurrent architecture that runs at between 400 and 1600 MIPS with 64KB per-core of on chip RAM. Modern highly programmable image sensors such as the Kodak KAC-401 can capture regions-of-interest (ROI) at rates in excess of 1500fps. To compare the difference between two 320 by 240 pixel images one would usually require 150KB of RAM, by combining the above components as a computational camera this constraint can be overcome. In the proposed system the microprocessor programs the sensor to capture images as a sequence of high frame rate regions-of-interest. These regions can be processed to determine the presence of motion as differences of ROIs over time. By providing additional cores extensive image processing can be carried out and ROI pixels can be composited onto an LCD to give output images of 320 by 240 pixels at near standard frame rates.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131228836","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 : 2011-09-12DOI: 10.5220/0003364103170323
B. Xie, T. Bose
In practice, computational complexity is an important consideration of an adaptive signal processing system. A well-known approach to controlling computational complexity is applying partial update (PU) adaptive filters. In this paper, a partial update conjugate gradient (CG) algorithm is employed. Theoretical analyses of mean and mean-square performance are presented. The simulation results of different PU CG algorithms are shown. The performance of PU CG algorithms are also compared with PU recursive least squares (RLS) and PU Euclidean direction search (EDS) algorithms.
{"title":"Partial Update Conjugate Gradient Algorithms for Adaptive Filtering","authors":"B. Xie, T. Bose","doi":"10.5220/0003364103170323","DOIUrl":"https://doi.org/10.5220/0003364103170323","url":null,"abstract":"In practice, computational complexity is an important consideration of an adaptive signal processing system. A well-known approach to controlling computational complexity is applying partial update (PU) adaptive filters. In this paper, a partial update conjugate gradient (CG) algorithm is employed. Theoretical analyses of mean and mean-square performance are presented. The simulation results of different PU CG algorithms are shown. The performance of PU CG algorithms are also compared with PU recursive least squares (RLS) and PU Euclidean direction search (EDS) algorithms.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117175854","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 : 2011-09-12DOI: 10.5220/0003319903690378
Y. Kinebuchi, Hitoshi Mitake, Y. Yasukawa, Takushi Morita, Alexandre Courbot, T. Nakajima
Despite the strong requirement of supporting deterministic real-time scheduling on virtualization based multi-OS embedded systems, which enables co-location of a real-time operating system and a generalpurpose operating system on a single device, there are few investigations in the real-world hardware. In this paper we introduce our virtualization layer called SPUMONE, which runs on single-core and multi-core SH-4A processors. SPUMONE achieves the low overhead, and requires a small amount of engineering efforts to modify guest OS kernels for executing on SPUMONE. SPUMONE now can execute the TOPPERS real-time OS and Linux as a general-purpose OS concurrently on a single embedded platform. In addition we propose two techniques to mitigate the interference of Linux to the real-time responsiveness of RTOS. The first technique leverages the interrupt priority level mechanism supported by the SH-4A processor. The second is the proactive migration of a virtual core among physical cores to prevent the Linux kernel activity from blocking the interrupts assigned to RTOS. The evaluation shows that our techniques can decrease the interrupt latency of RTOS entailed by Linux. In addition, sharing a physical core between RTOS and Linux will increase total processor utilization.
{"title":"A Study on Real-time Responsiveness on Virtualization based Multi-OS Embedded Systems","authors":"Y. Kinebuchi, Hitoshi Mitake, Y. Yasukawa, Takushi Morita, Alexandre Courbot, T. Nakajima","doi":"10.5220/0003319903690378","DOIUrl":"https://doi.org/10.5220/0003319903690378","url":null,"abstract":"Despite the strong requirement of supporting deterministic real-time scheduling on virtualization based multi-OS embedded systems, which enables co-location of a real-time operating system and a generalpurpose operating system on a single device, there are few investigations in the real-world hardware. In this paper we introduce our virtualization layer called SPUMONE, which runs on single-core and multi-core SH-4A processors. SPUMONE achieves the low overhead, and requires a small amount of engineering efforts to modify guest OS kernels for executing on SPUMONE. SPUMONE now can execute the TOPPERS real-time OS and Linux as a general-purpose OS concurrently on a single embedded platform. In addition we propose two techniques to mitigate the interference of Linux to the real-time responsiveness of RTOS. The first technique leverages the interrupt priority level mechanism supported by the SH-4A processor. The second is the proactive migration of a virtual core among physical cores to prevent the Linux kernel activity from blocking the interrupts assigned to RTOS. The evaluation shows that our techniques can decrease the interrupt latency of RTOS entailed by Linux. In addition, sharing a physical core between RTOS and Linux will increase total processor utilization.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131243442","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 : 2011-09-12DOI: 10.5220/0003368302070214
L. Herbert, Nick E. Pears, D. Jackson, P. Olivier
We present further developments of our system that allows direction interaction between a camera-equipped hand-held device and a remote display. The essence of this system is the ability to estimate a planar projectivity between the remote display and the displayed image of that display on the handheld device. We describe how to achieve this by matching scale invariant SURF features across the two displays (remote and hand-held). We implement a prototype system and a drawing application and conduct both performance and usability evaluations. The feedback given indicates that our system is responsive, accurate and easy to use.
{"title":"Mobile Device and Intelligent Display Interaction via Scale-invariant Image Feature Matching","authors":"L. Herbert, Nick E. Pears, D. Jackson, P. Olivier","doi":"10.5220/0003368302070214","DOIUrl":"https://doi.org/10.5220/0003368302070214","url":null,"abstract":"We present further developments of our system that allows direction interaction between a camera-equipped hand-held device and a remote display. The essence of this system is the ability to estimate a planar projectivity between the remote display and the displayed image of that display on the handheld device. We describe how to achieve this by matching scale invariant SURF features across the two displays (remote and hand-held). We implement a prototype system and a drawing application and conduct both performance and usability evaluations. The feedback given indicates that our system is responsive, accurate and easy to use.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117210103","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 : 2011-09-12DOI: 10.5220/0003373301140123
Sausan Yazji, R. Dick, P. Scheuermann, Goce Trajcevski
Mobile devices such as smart phones and laptops are in common use and carry a vast amount of personal data. This paper presents an efficient behavior-based system for rapidly detecting the theft of mobile devices in order to protect the private data of their users. Our technique uses spatio-temporal information to construct models of user motion patters. These models are used to detect theft, which may produce anomalous spatio-temporal patterns. We consider two types of user models, each of which builds on the relationship between location and time of day. Our evaluation, based on the Reality Mining dataset, shows that our system is capable of detecting an attack within 15 minutes with 81% accuracy.
{"title":"Protecting Private Data on Mobile Systems based on Spatio-temporal Analysis","authors":"Sausan Yazji, R. Dick, P. Scheuermann, Goce Trajcevski","doi":"10.5220/0003373301140123","DOIUrl":"https://doi.org/10.5220/0003373301140123","url":null,"abstract":"Mobile devices such as smart phones and laptops are in common use and carry a vast amount of personal data. This paper presents an efficient behavior-based system for rapidly detecting the theft of mobile devices in order to protect the private data of their users. Our technique uses spatio-temporal information to construct models of user motion patters. These models are used to detect theft, which may produce anomalous spatio-temporal patterns. We consider two types of user models, each of which builds on the relationship between location and time of day. Our evaluation, based on the Reality Mining dataset, shows that our system is capable of detecting an attack within 15 minutes with 81% accuracy.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127726398","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 : 2011-09-12DOI: 10.5220/0003331003390344
Barathram Ramkumar, T. Bose
A multiuser automatic modulation classifier (MAMC) is an important component of a multiantenna cognitive radio (CR) receiver that helps the radio to better utilize the spectrum. MAMC identifies the modulation schemes of multiple users in a frequency band simultaneously. A multi-input-multi-output (MIMO) blind equalizer is another important component of a multiantenna CR receiver that improves symbol detection performance by reducing inter symbol interference (ISI) and inter user interference (IUI). In a CR scenario, it is preferable to also consider the performance of the automatic modulation classifier (AMC) while designing the blind equalizer. In this paper we propose a MIMO blind equalizer that improves the performance of both multiuser symbol detection and cumulant based MAMC.
{"title":"Combined Blind Equalization and Classification of Multiple Signals","authors":"Barathram Ramkumar, T. Bose","doi":"10.5220/0003331003390344","DOIUrl":"https://doi.org/10.5220/0003331003390344","url":null,"abstract":"A multiuser automatic modulation classifier (MAMC) is an important component of a multiantenna cognitive radio (CR) receiver that helps the radio to better utilize the spectrum. MAMC identifies the modulation schemes of multiple users in a frequency band simultaneously. A multi-input-multi-output (MIMO) blind equalizer is another important component of a multiantenna CR receiver that improves symbol detection performance by reducing inter symbol interference (ISI) and inter user interference (IUI). In a CR scenario, it is preferable to also consider the performance of the automatic modulation classifier (AMC) while designing the blind equalizer. In this paper we propose a MIMO blind equalizer that improves the performance of both multiuser symbol detection and cumulant based MAMC.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127802759","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 : 2011-03-14DOI: 10.5220/0003396202920297
Jiaqi Zhu, Vwen Yen Lee, J. Biswas, M. Mokhtari, T. Tiberghien, H. Aloulou
We are interested in providing people living or working in smart home environment with sensor network based assistive technology. We propose a novel rule-based reasoning engine that could be used in ubiquitous environments to infer logical consequences from events received over a sensor network. We introduce methods for rule design with high level knowledge input and using minimum information to infer micro-context. Personalised profiles can be introduced into the reasoning engine to customise features for a particular user using our rule refinement and generation module. New mechanism for sensor-engine communication is also introduced. As a proof of concept, a prototype system has been developed to demonstrate the functionalities of our reasoning engine in a simulated smart home environment.
{"title":"Context-aware Reasoning Engine with High Level Knowledge for Smart Home","authors":"Jiaqi Zhu, Vwen Yen Lee, J. Biswas, M. Mokhtari, T. Tiberghien, H. Aloulou","doi":"10.5220/0003396202920297","DOIUrl":"https://doi.org/10.5220/0003396202920297","url":null,"abstract":"We are interested in providing people living or working in smart home environment with sensor network based assistive technology. We propose a novel rule-based reasoning engine that could be used in ubiquitous environments to infer logical consequences from events received over a sensor network. We introduce methods for rule design with high level knowledge input and using minimum information to infer micro-context. Personalised profiles can be introduced into the reasoning engine to customise features for a particular user using our rule refinement and generation module. New mechanism for sensor-engine communication is also introduced. As a proof of concept, a prototype system has been developed to demonstrate the functionalities of our reasoning engine in a simulated smart home environment.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115900973","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 : 2011-03-05DOI: 10.5220/0003361100220031
A. Horst, N. Meratnia
In this paper, we explore the capability of wireless sensor networks to perform online activity matching for sport coaching applications. The goal is to design an algorithm to match movements of a trainee and a trainer online and to find their spatial and temporal differences. Such an algorithm can aid the trainer to better observe performance of the trainees in group lessons. We consider fitness-like movements such as those performed in aerobic. We also limit ourselves to only having one sensor node on the trainer and one sensor node on the trainee, however our algorithm scales well to more trainees per trainer. We use Sun SPOT sensor nodes and use the accelerometer and gyroscope sensors to capture the movements. The gravity vector is extracted and improved with a Kalman filter using the accelerometer and gyroscope data. An automatic segmentation technique is developed that examines the movement data for rest and activity periods and changes in movement direction. The segmentation and the movement information are communicated with the node of the trainee where the movements are compared. We choose to use Dynamic TimeWarping (DTW) to perform the spatial and temporal matching of movements. Because DTW is computationally intensive, we develop an optimized technique and provide feedback to the trainee. We test all the design choices extensively using experiments and perform a system test using different test methods to validate our approach.
{"title":"Online Activity Matching using Wireless Sensor Nodes","authors":"A. Horst, N. Meratnia","doi":"10.5220/0003361100220031","DOIUrl":"https://doi.org/10.5220/0003361100220031","url":null,"abstract":"In this paper, we explore the capability of wireless sensor networks to perform online activity matching for sport coaching applications. The goal is to design an algorithm to match movements of a trainee and a trainer online and to find their spatial and temporal differences. Such an algorithm can aid the trainer to better observe performance of the trainees in group lessons. We consider fitness-like movements such as those performed in aerobic. We also limit ourselves to only having one sensor node on the trainer and one sensor node on the trainee, however our algorithm scales well to more trainees per trainer. We use Sun SPOT sensor nodes and use the accelerometer and gyroscope sensors to capture the movements. The gravity vector is extracted and improved with a Kalman filter using the accelerometer and gyroscope data. An automatic segmentation technique is developed that examines the movement data for rest and activity periods and changes in movement direction. The segmentation and the movement information are communicated with the node of the trainee where the movements are compared. We choose to use Dynamic TimeWarping (DTW) to perform the spatial and temporal matching of movements. Because DTW is computationally intensive, we develop an optimized technique and provide feedback to the trainee. We test all the design choices extensively using experiments and perform a system test using different test methods to validate our approach.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128591865","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 : 2011-03-05DOI: 10.5220/0003330604210426
N. Sprynski, B. Lacolle, L. Biard
This paper deals with the motion capture of physical surfaces via a curve acquisition device. This device is a ribbon of sensors, named Ribbon Device, providing tangential measurements, allowing to reconstruct its 3D shape via an existing geometric method. We focus here on the problem of reconstructing animated surfaces, from a finite number of curves running on these surfaces, acquired with the Ribbon Device. This network of spatial curves is organized according a comb structure allowing to adjust these curves with respect to a reference curve, and then to develop a global C1 reconstruction method based on the mesh of ribbon curves together with interpolating transversal curves. Precisely, at each time position the surface is computed from the previous step by an updating process.
{"title":"Motion Capture of an Animated Surface via Sensors' Ribbons - Surface Reconstruction via Tangential Measurements","authors":"N. Sprynski, B. Lacolle, L. Biard","doi":"10.5220/0003330604210426","DOIUrl":"https://doi.org/10.5220/0003330604210426","url":null,"abstract":"This paper deals with the motion capture of physical surfaces via a curve acquisition device. This device is a ribbon of sensors, named Ribbon Device, providing tangential measurements, allowing to reconstruct its 3D shape via an existing geometric method. We focus here on the problem of reconstructing animated surfaces, from a finite number of curves running on these surfaces, acquired with the Ribbon Device. This network of spatial curves is organized according a comb structure allowing to adjust these curves with respect to a reference curve, and then to develop a global C1 reconstruction method based on the mesh of ribbon curves together with interpolating transversal curves. Precisely, at each time position the surface is computed from the previous step by an updating process.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128834085","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 : 2011-03-05DOI: 10.5220/0003371302770282
Ismail Mansour, G. Chalhoub, M. Misson
The security aspect of wireless sensor networks has taken the attention of numerous researchers in the past several years. It has recently been proven that public keys are now feasible in wireless sensor networks but still consume a lot of processing time and memory. In this paper we propose the use of public keys based on ECC to exchange symmetric keys that will be used to encrypt critical information. In addition, we propose a time segmentation approach that enables the use of frequency hopping time slotted communications. Nodes secretly exchange frequency hopping sequences that enable them to fight against jamming and eavesdropping. We use permutation ciphering technique to protect the information exchanged between nodes.
{"title":"Energy-efficient Security Protocol for Wireless Sensor Networks using Frequency Hopping and Permutation Ciphering","authors":"Ismail Mansour, G. Chalhoub, M. Misson","doi":"10.5220/0003371302770282","DOIUrl":"https://doi.org/10.5220/0003371302770282","url":null,"abstract":"The security aspect of wireless sensor networks has taken the attention of numerous researchers in the past several years. It has recently been proven that public keys are now feasible in wireless sensor networks but still consume a lot of processing time and memory. In this paper we propose the use of public keys based on ECC to exchange symmetric keys that will be used to encrypt critical information. In addition, we propose a time segmentation approach that enables the use of frequency hopping time slotted communications. Nodes secretly exchange frequency hopping sequences that enable them to fight against jamming and eavesdropping. We use permutation ciphering technique to protect the information exchanged between nodes.","PeriodicalId":298357,"journal":{"name":"International Conference on Pervasive and Embedded Computing and Communication Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133753554","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
扫码关注我们
求助内容：
应助结果提醒方式：