Pub Date : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886024
G. Fahmy, R. Würtz
Many recent techniques in forgery detection tried to counter noise dithering, which is well adopted in removing footprints of JPEG editing in any image tampering (anti forensics) process. In this paper we present a novel idea of detecting this noise dithering based on detecting spatial frequency phase variations for different blocks of suspect-able images. We try to measure the level of coherence of phase values for spatial frequencies of image pixels and detect threshold variations/distributions that would indicate some editing or tampering of images. The proposed technique is robust against noise dithering due to the fact that local homogeneous regions inherit distinctive phase values. These phase values are inconsistent with embedded or dithered noise signals that are considered to be out of phase and can be easily detected in noisy environments. Our proposed technique is compared with recent successful literature techniques for performance with degraded tampered/hacked images. Unlike other literature techniques, Our proposed approach does not require the knowledge of the quantization matrix that is typically adopted in original compression for forgery detection, as will be illustrated.
{"title":"Phase based forgery detection of JPEG anti forensics","authors":"G. Fahmy, R. Würtz","doi":"10.1109/ISSPIT.2016.7886024","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886024","url":null,"abstract":"Many recent techniques in forgery detection tried to counter noise dithering, which is well adopted in removing footprints of JPEG editing in any image tampering (anti forensics) process. In this paper we present a novel idea of detecting this noise dithering based on detecting spatial frequency phase variations for different blocks of suspect-able images. We try to measure the level of coherence of phase values for spatial frequencies of image pixels and detect threshold variations/distributions that would indicate some editing or tampering of images. The proposed technique is robust against noise dithering due to the fact that local homogeneous regions inherit distinctive phase values. These phase values are inconsistent with embedded or dithered noise signals that are considered to be out of phase and can be easily detected in noisy environments. Our proposed technique is compared with recent successful literature techniques for performance with degraded tampered/hacked images. Unlike other literature techniques, Our proposed approach does not require the knowledge of the quantization matrix that is typically adopted in original compression for forgery detection, as will be illustrated.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133704427","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/ISSPIT.2016.7886049
D. Azinovic, K. Tittelbach-Helmrich, Z. Stamenkovic
This paper investigates the performance of the BCH encoder and decoder for different error-correcting capabilities. The focus is on BCH codes of length 255. The motivation for this research is a project where data symbols of this length are transmitted over an error-prone wireless channel. The paper presents a mathematical introduction into encoding for cyclic codes and decoding of the BCH code. The code was implemented in both software and hardware and the performance and cost of both implementations were measured for different code parameters.
{"title":"Performance investigation on BCH codec implementations","authors":"D. Azinovic, K. Tittelbach-Helmrich, Z. Stamenkovic","doi":"10.1109/ISSPIT.2016.7886049","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886049","url":null,"abstract":"This paper investigates the performance of the BCH encoder and decoder for different error-correcting capabilities. The focus is on BCH codes of length 255. The motivation for this research is a project where data symbols of this length are transmitted over an error-prone wireless channel. The paper presents a mathematical introduction into encoding for cyclic codes and decoding of the BCH code. The code was implemented in both software and hardware and the performance and cost of both implementations were measured for different code parameters.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"86 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132984090","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/ISSPIT.2016.7886008
Rui Sun, Lingling Zhao, Xiaohong Su
The probability hypothesis density (PHD) filter is widely used to solve multi-target tracking (MTT) problems. Although the Sequential Monte Carlo (SMC) implementation provides a tractable solution for PHD filter to handle the highly nonlinear and non-Gaussian MTT scenario, the high computational cost caused by a large number of particles limits the applications that need to be performed in real-time. This paper proposes a computationally efficient SMC-PHD filter using particle-measurement partition and intermediate region strategy. Firstly, the partition strategy provides a way to solve the related PHD calculation in each partition independently. Secondly, based on the rectangular gating technique, the particle intermediate region strategy ensures the estimation accuracy of the proposed method. The simulation results indicate that the partition strategy significantly reduces the computational complexity of the SMC-PHD filter. In addition, the proposed method can maintain comparable accuracy as the standard SMC-PHD filter via the intermediate region strategy.
{"title":"A novel computationally efficient SMC-PHD Filter using particle-measurement partition","authors":"Rui Sun, Lingling Zhao, Xiaohong Su","doi":"10.1109/ISSPIT.2016.7886008","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886008","url":null,"abstract":"The probability hypothesis density (PHD) filter is widely used to solve multi-target tracking (MTT) problems. Although the Sequential Monte Carlo (SMC) implementation provides a tractable solution for PHD filter to handle the highly nonlinear and non-Gaussian MTT scenario, the high computational cost caused by a large number of particles limits the applications that need to be performed in real-time. This paper proposes a computationally efficient SMC-PHD filter using particle-measurement partition and intermediate region strategy. Firstly, the partition strategy provides a way to solve the related PHD calculation in each partition independently. Secondly, based on the rectangular gating technique, the particle intermediate region strategy ensures the estimation accuracy of the proposed method. The simulation results indicate that the partition strategy significantly reduces the computational complexity of the SMC-PHD filter. In addition, the proposed method can maintain comparable accuracy as the standard SMC-PHD filter via the intermediate region strategy.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115404732","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/ISSPIT.2016.7886042
A. Wijayasiri, Tania Banerjee-Mishra, S. Ranka, S. Sahni, M. Schmalz
The reconstruction of nxn-pixel Synthetic Aperture Radar imagery using Back Projection algorithm incurs O(n2·m) cost, where m is the number of pulses. This paper presents dynamic data driven multiresolution algorithms to speed up SAR backprojection on multiple GPUs. A critical part of this spatially variant reconstruction process is load balancing, which circumvents asymmetric work assignment. Our algorithms achieve 15 TFLOPS using 128 GPUs.
{"title":"Dynamic data driven image reconstruction using multiple GPUs","authors":"A. Wijayasiri, Tania Banerjee-Mishra, S. Ranka, S. Sahni, M. Schmalz","doi":"10.1109/ISSPIT.2016.7886042","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886042","url":null,"abstract":"The reconstruction of nxn-pixel Synthetic Aperture Radar imagery using Back Projection algorithm incurs O(n2·m) cost, where m is the number of pulses. This paper presents dynamic data driven multiresolution algorithms to speed up SAR backprojection on multiple GPUs. A critical part of this spatially variant reconstruction process is load balancing, which circumvents asymmetric work assignment. Our algorithms achieve 15 TFLOPS using 128 GPUs.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121443607","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/ISSPIT.2016.7886047
M. Awad, Yousef Rafique, S. Alhadlaq, Dunya Hassoun, A. Alabdulhadi, S. Thani
We consider the problem of minimizing the routing power consumption in software-defined networks. The network is composed of software-defined networking (SDN) nodes and a central controller where routing decisions are centralized. More specifically, the central controller minimizes the routing power consumption by routing flows on the minimum number of active links with the lowest discrete link rates. Thus, it maximizes the number of inactive links and the level of link rates, which reflects significant saving in power consumption. This problem is a mixed-integer programming problem and known to be NP-hard. Therefore, we propose a low-complexity greedy heuristic to minimize the number of active links and link rates by rerouting flows and aggregating them on common links. Numerical results show that the proposed algorithm achieves 17.18% to 32.97% power saving in real network topologies relative to a base shortest path algorithm. The savings are achieved with minimal increase in average path length that is less than 0.2 hops.
{"title":"A greedy power-aware routing algorithm for software-defined networks","authors":"M. Awad, Yousef Rafique, S. Alhadlaq, Dunya Hassoun, A. Alabdulhadi, S. Thani","doi":"10.1109/ISSPIT.2016.7886047","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886047","url":null,"abstract":"We consider the problem of minimizing the routing power consumption in software-defined networks. The network is composed of software-defined networking (SDN) nodes and a central controller where routing decisions are centralized. More specifically, the central controller minimizes the routing power consumption by routing flows on the minimum number of active links with the lowest discrete link rates. Thus, it maximizes the number of inactive links and the level of link rates, which reflects significant saving in power consumption. This problem is a mixed-integer programming problem and known to be NP-hard. Therefore, we propose a low-complexity greedy heuristic to minimize the number of active links and link rates by rerouting flows and aggregating them on common links. Numerical results show that the proposed algorithm achieves 17.18% to 32.97% power saving in real network topologies relative to a base shortest path algorithm. The savings are achieved with minimal increase in average path length that is less than 0.2 hops.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128692294","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/ISSPIT.2016.7886038
T. Debroutelle, A. Chetouani, S. Treuillet, M. Exbrayat, S. Jesset
A large corpus of ceramic sherds dating from High Middle Ages has been extracted in Saran (France). The sherds have an engraved frieze made by the potter with a carved wooden wheel, used as a dating to study the dissemination of productions. ARCADIA project aims to develop an automatic classification of this archaeological heritage. The sherds are scanned using a 3D laser scanner. Then, a binary pattern is extracted after projecting the 3D point cloud into a depth map. Gabor filters and bag-of-words are compared as inputs for training a SVM classifier by selecting the pattern as a region of interest. On a database of 377 representative sherds, the recognition rates are about 74% on binary patterns extracted from the 3D scans. Even if the recognition remains below that obtained with manual stampings carried out by the archaeologist, he already saves a lot of time in archiving.
{"title":"Classification of friezes engraved on ceramic sherds from 3D scans","authors":"T. Debroutelle, A. Chetouani, S. Treuillet, M. Exbrayat, S. Jesset","doi":"10.1109/ISSPIT.2016.7886038","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886038","url":null,"abstract":"A large corpus of ceramic sherds dating from High Middle Ages has been extracted in Saran (France). The sherds have an engraved frieze made by the potter with a carved wooden wheel, used as a dating to study the dissemination of productions. ARCADIA project aims to develop an automatic classification of this archaeological heritage. The sherds are scanned using a 3D laser scanner. Then, a binary pattern is extracted after projecting the 3D point cloud into a depth map. Gabor filters and bag-of-words are compared as inputs for training a SVM classifier by selecting the pattern as a region of interest. On a database of 377 representative sherds, the recognition rates are about 74% on binary patterns extracted from the 3D scans. Even if the recognition remains below that obtained with manual stampings carried out by the archaeologist, he already saves a lot of time in archiving.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127383989","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/ISSPIT.2016.7886004
Subbareddy Darukumalli, P. A. Kara, A. Barsi, M. Martini, T. Balogh, Ahmed Chehaibi
User experience of 3D visualization on light field displays depends on several technical and human factors. One of these factors is Region of Interest, which determines the properties of visualization, such as the level of zoom. In this paper we present the results of three experiments investigating the effect of level of zoom on Quality of Experience. These experiments use different subjective quality assessment methods to evaluate user experience. Beyond the subjective preference of the visualized 3D content, visual comfort is measured as well.
{"title":"Performance comparison of subjective assessment methodologies for Light Field Displays","authors":"Subbareddy Darukumalli, P. A. Kara, A. Barsi, M. Martini, T. Balogh, Ahmed Chehaibi","doi":"10.1109/ISSPIT.2016.7886004","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886004","url":null,"abstract":"User experience of 3D visualization on light field displays depends on several technical and human factors. One of these factors is Region of Interest, which determines the properties of visualization, such as the level of zoom. In this paper we present the results of three experiments investigating the effect of level of zoom on Quality of Experience. These experiments use different subjective quality assessment methods to evaluate user experience. Beyond the subjective preference of the visualized 3D content, visual comfort is measured as well.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125869480","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/ISSPIT.2016.7886021
Georgios Katsikogiannis, S. Mitropoulos, C. Douligeris
Various Identity and Access Management (IAM) architectural challenges are emerging for the effective deployment of applications in a Service-Oriented Architecture (SOA) context. SOA solutions should incorporate efficient access control techniques and adopt an optimal setup among countless and complex approaches in providing access control services. Web Single Sign-on (SSO), federated identities, password synchronization and service granularity can be accomplished through the IAM capabilities, so that SOA can address and fulfil most of the contemporary access management challenges. This paper proposes an innovative model to manage the multilevel integration of identity, authentication and authorization modules based on formal policy-based methods and various access control mechanisms in order to provide secure access to the resources. In the proposed model, we analyze and integrate identity, authentication, user roles, authorization access control levels, and rule validation mechanisms. Finally, the model offers policy-based and integration capabilities enabling automated controls, improved efficiency and simplified management.
{"title":"An Identity and Access Management approach for SOA","authors":"Georgios Katsikogiannis, S. Mitropoulos, C. Douligeris","doi":"10.1109/ISSPIT.2016.7886021","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886021","url":null,"abstract":"Various Identity and Access Management (IAM) architectural challenges are emerging for the effective deployment of applications in a Service-Oriented Architecture (SOA) context. SOA solutions should incorporate efficient access control techniques and adopt an optimal setup among countless and complex approaches in providing access control services. Web Single Sign-on (SSO), federated identities, password synchronization and service granularity can be accomplished through the IAM capabilities, so that SOA can address and fulfil most of the contemporary access management challenges. This paper proposes an innovative model to manage the multilevel integration of identity, authentication and authorization modules based on formal policy-based methods and various access control mechanisms in order to provide secure access to the resources. In the proposed model, we analyze and integrate identity, authentication, user roles, authorization access control levels, and rule validation mechanisms. Finally, the model offers policy-based and integration capabilities enabling automated controls, improved efficiency and simplified management.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114140921","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/ISSPIT.2016.7886019
Tomoyuki Kozu, K. Ohuchi
Demand for Radio Frequency (RF) communications increases in late years. Optical Orthogonal Frequency Division Multiplexing (O-OFDM) has resistance to inter symbol interference (ISI) and multi-path fading. We proposed a Superposed Asymmetrically Clipped Optical OFDM (SACO-OFDM) which is based on ACO-OFDM. In SACO-OFDM, we superpose the conventional ACO-OFDM signal on the another ACO-OFDM signal. Thus, we can use 1.5 times as many subcarriers as the conventional ACO-OFDM. In this paper, we investigate influence of multi-path fading to SACO-OFDM from the view point of the bit error rate (BER) performance. Then, we assume that the impulse response consists of a ceiling bounce model and an exponential-decay model. As a result, SACO-OFDM is advantageous compared to ACO-OFDM when we use multi-level modulation methods.
{"title":"BER performance of Superposed ACO-OFDM in multi-path fading channel","authors":"Tomoyuki Kozu, K. Ohuchi","doi":"10.1109/ISSPIT.2016.7886019","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886019","url":null,"abstract":"Demand for Radio Frequency (RF) communications increases in late years. Optical Orthogonal Frequency Division Multiplexing (O-OFDM) has resistance to inter symbol interference (ISI) and multi-path fading. We proposed a Superposed Asymmetrically Clipped Optical OFDM (SACO-OFDM) which is based on ACO-OFDM. In SACO-OFDM, we superpose the conventional ACO-OFDM signal on the another ACO-OFDM signal. Thus, we can use 1.5 times as many subcarriers as the conventional ACO-OFDM. In this paper, we investigate influence of multi-path fading to SACO-OFDM from the view point of the bit error rate (BER) performance. Then, we assume that the impulse response consists of a ceiling bounce model and an exponential-decay model. As a result, SACO-OFDM is advantageous compared to ACO-OFDM when we use multi-level modulation methods.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124461803","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/ISSPIT.2016.7886009
P. Petsas, Paris Kaimakis
We present a multi-target tracking system for estimating the position of multiple soccer players as they move around during a soccer game. Our system relies on silhouette observations recorded by a static camera, and utilises 3D models and particle filter methods to estimate athlete positions. Tracking parameters can be adapted in order to tip the scales towards precision or performance. We present the system's software architecture as a client-server application, and demonstrate results based on a simulated yet realistic dataset produced using the Unity3D game engine.
{"title":"Soccer player tracking using particle filters","authors":"P. Petsas, Paris Kaimakis","doi":"10.1109/ISSPIT.2016.7886009","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886009","url":null,"abstract":"We present a multi-target tracking system for estimating the position of multiple soccer players as they move around during a soccer game. Our system relies on silhouette observations recorded by a static camera, and utilises 3D models and particle filter methods to estimate athlete positions. Tracking parameters can be adapted in order to tip the scales towards precision or performance. We present the system's software architecture as a client-server application, and demonstrate results based on a simulated yet realistic dataset produced using the Unity3D game engine.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455916","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
扫码关注我们
求助内容：
应助结果提醒方式：