Pub Date : 2012-07-02DOI: 10.1109/ISSPA.2012.6310646
Y. Begriche, Messaoud Thameri, K. Abed-Meraim
In this paper, we derive the conditional Cramer Rao Bound (CRB) for near field source localization using the exact expression of the time delay parameter. Based on this derivation, several observations and comments are made: (i) The exact CRB allows us to analyze the effect of the near field assumption on the angle of arrival estimation performance, (ii) the second order Taylor expansion of the exact CRB is shown to be different from the CRB given by El Korso et al for an approximate time delay parameter (i.e approximate model), and (iii) we show how the exact CRB can be used to define the `near field localization region' based on a target localization performance. Simulation experiments are provided to better illustrate our different results and observations.
{"title":"Exact Cramer Rao Bound for near field source localization","authors":"Y. Begriche, Messaoud Thameri, K. Abed-Meraim","doi":"10.1109/ISSPA.2012.6310646","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310646","url":null,"abstract":"In this paper, we derive the conditional Cramer Rao Bound (CRB) for near field source localization using the exact expression of the time delay parameter. Based on this derivation, several observations and comments are made: (i) The exact CRB allows us to analyze the effect of the near field assumption on the angle of arrival estimation performance, (ii) the second order Taylor expansion of the exact CRB is shown to be different from the CRB given by El Korso et al for an approximate time delay parameter (i.e approximate model), and (iii) we show how the exact CRB can be used to define the `near field localization region' based on a target localization performance. Simulation experiments are provided to better illustrate our different results and observations.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125469314","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-07-02DOI: 10.1109/ISSPA.2012.6310624
S. Sbai, A. Aïssa-El-Bey, Dominique Pastor
This paper addresses the underdetermined source separation problem of finite alphabet signals. We present a new framework for recovering finite alphabet signals. We formulate this problem as a recovery of sparse signals from highly incomplete measurements. It is known that sparse solutions can be obtained by ℓ1 minimization, through convex optimization. This relaxation procedure in our problem fails in recovering sparse solutions. However, this does not impact the reconstruction of the finite alphabet signals. Simulation results are presented to show that this approach provides good recovery properties and good images separation performance.
{"title":"Underdetermined source separation of finite alphabet signals via l1 minimization","authors":"S. Sbai, A. Aïssa-El-Bey, Dominique Pastor","doi":"10.1109/ISSPA.2012.6310624","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310624","url":null,"abstract":"This paper addresses the underdetermined source separation problem of finite alphabet signals. We present a new framework for recovering finite alphabet signals. We formulate this problem as a recovery of sparse signals from highly incomplete measurements. It is known that sparse solutions can be obtained by ℓ1 minimization, through convex optimization. This relaxation procedure in our problem fails in recovering sparse solutions. However, this does not impact the reconstruction of the finite alphabet signals. Simulation results are presented to show that this approach provides good recovery properties and good images separation performance.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121800150","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-07-02DOI: 10.1109/ISSPA.2012.6310657
Vishnu Priya Nallagatla, V. Chandran
Fusion techniques have received considerable attention for achieving performance improvement with biometrics. While a multi-sample fusion architecture reduces false rejects, it also increases false accepts. This impact on performance also depends on the nature of subsequent attempts, i.e., random or adaptive. Expressions for error rates are presented and experimentally evaluated in this work by considering the multi-sample fusion architecture for text-dependent speaker verification using HMM based digit dependent speaker models. Analysis incorporating correlation modeling demonstrates that the use of adaptive samples improves overall fusion performance compared to randomly repeated samples. For a text dependent speaker verification system using digit strings, sequential decision fusion of seven instances with three random samples is shown to reduce the overall error of the verification system by 26% which can be further reduced by 6% for adaptive samples. This analysis novel in its treatment of random and adaptive multiple presentations within a sequential fused decision architecture, is also applicable to other biometric modalities such as finger prints and handwriting samples.
{"title":"Sequential fusion of decisions from adaptive and random samples for controlled verification errors","authors":"Vishnu Priya Nallagatla, V. Chandran","doi":"10.1109/ISSPA.2012.6310657","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310657","url":null,"abstract":"Fusion techniques have received considerable attention for achieving performance improvement with biometrics. While a multi-sample fusion architecture reduces false rejects, it also increases false accepts. This impact on performance also depends on the nature of subsequent attempts, i.e., random or adaptive. Expressions for error rates are presented and experimentally evaluated in this work by considering the multi-sample fusion architecture for text-dependent speaker verification using HMM based digit dependent speaker models. Analysis incorporating correlation modeling demonstrates that the use of adaptive samples improves overall fusion performance compared to randomly repeated samples. For a text dependent speaker verification system using digit strings, sequential decision fusion of seven instances with three random samples is shown to reduce the overall error of the verification system by 26% which can be further reduced by 6% for adaptive samples. This analysis novel in its treatment of random and adaptive multiple presentations within a sequential fused decision architecture, is also applicable to other biometric modalities such as finger prints and handwriting samples.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134422555","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-07-02DOI: 10.1109/ISSPA.2012.6310654
V. Janarthanan, Abdelouahed Gherbi
We had shown in our previous work [7, 9] that supervisory control theory (SCT) of discrete-event systems could be applied for scheduling hard real-time systems. In particular, we had presented a formal framework for the synthesis of real-time schedulers on single processor systems using priority-based supervisory control of timed discrete-event systems (TDES). We had also provided the extension of SCT in designing schedulers for uniform multiprocessor systems [8]. As we had considered discrete time models in our scheduler design, the state sizes were substantially large, and increased exponentially with the number of real-time tasks. In order to reduce the state space explosion problem in our models, we have utilized a modified form of symbolic modeling methodology [3], along with the pre-stable algorithm proposed in [3], for reducing state space while designing schedulers for real-time tasks on uniprocessor systems. The main contribution through this paper has been the development of an informal procedure for uniprocessor scheduler design with reduced state space for preemptive real-time tasks.
{"title":"A model-based framework for the design of a symbolic scheduler for pre-emptive real-time tasks","authors":"V. Janarthanan, Abdelouahed Gherbi","doi":"10.1109/ISSPA.2012.6310654","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310654","url":null,"abstract":"We had shown in our previous work [7, 9] that supervisory control theory (SCT) of discrete-event systems could be applied for scheduling hard real-time systems. In particular, we had presented a formal framework for the synthesis of real-time schedulers on single processor systems using priority-based supervisory control of timed discrete-event systems (TDES). We had also provided the extension of SCT in designing schedulers for uniform multiprocessor systems [8]. As we had considered discrete time models in our scheduler design, the state sizes were substantially large, and increased exponentially with the number of real-time tasks. In order to reduce the state space explosion problem in our models, we have utilized a modified form of symbolic modeling methodology [3], along with the pre-stable algorithm proposed in [3], for reducing state space while designing schedulers for real-time tasks on uniprocessor systems. The main contribution through this paper has been the development of an informal procedure for uniprocessor scheduler design with reduced state space for preemptive real-time tasks.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132796403","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-07-02DOI: 10.1109/ISSPA.2012.6310603
W. Trottier-Lapointe, Lucas Majeau, Yahya El-Iraki, S. Loranger, Guillaume Chabot-Nobert, Jonathan Borduas, J. Lavoie, J. Lapointe
The PolyProject initiative goal is to produce a low cost dataglove for sign language translation by using an optical detector technology and a 3D positioning system. The main innovation here is the optical system used for the glove which allows a great cost reduction. The glove also makes sign language translation much more accessible. In this article, we describe the optical signal analysis as well as the 3D positioning. These two elements will lead to the demonstration of the complete sign language translation methodology.
{"title":"Signal processing for low cost optical dataglove","authors":"W. Trottier-Lapointe, Lucas Majeau, Yahya El-Iraki, S. Loranger, Guillaume Chabot-Nobert, Jonathan Borduas, J. Lavoie, J. Lapointe","doi":"10.1109/ISSPA.2012.6310603","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310603","url":null,"abstract":"The PolyProject initiative goal is to produce a low cost dataglove for sign language translation by using an optical detector technology and a 3D positioning system. The main innovation here is the optical system used for the glove which allows a great cost reduction. The glove also makes sign language translation much more accessible. In this article, we describe the optical signal analysis as well as the 3D positioning. These two elements will lead to the demonstration of the complete sign language translation methodology.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130892892","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-07-02DOI: 10.1109/ISSPA.2012.6310529
Francis Quintal Lauzon
Deep learning allows automatically learning multiple levels of representations of the underlying distribution of the data to be modeled. In this work, a specific implementation called stacked denoising autoencoders is explored. We contribute by demonstrating that this kind of representation coupled to a SVM improves classification error on MNIST over the usual deep learning approach where a logistic regression layer is added to the stack of denoising autoencoders.
{"title":"An introduction to deep learning","authors":"Francis Quintal Lauzon","doi":"10.1109/ISSPA.2012.6310529","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310529","url":null,"abstract":"Deep learning allows automatically learning multiple levels of representations of the underlying distribution of the data to be modeled. In this work, a specific implementation called stacked denoising autoencoders is explored. We contribute by demonstrating that this kind of representation coupled to a SVM improves classification error on MNIST over the usual deep learning approach where a logistic regression layer is added to the stack of denoising autoencoders.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"25 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131009242","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-07-02DOI: 10.1109/ISSPA.2012.6310480
J. O’Toole, B. G. Zapirain, Iratxe Maestro Saiz, Alina Beatriz Anaya Chen, I. Y. Santamaria
Periodic lateralized epileptiform discharges (PLEDs) are EEG waveforms that can occur after brain injury or disease. The time-varying periodicity, or instantaneous frequency, of the PLEDs is a potentially important prognostic feature. Estimating the instantaneous frequency, however, is difficult because of the concurrent presence of background activity and artefacts. Here we present a method to enhance the instantaneous frequency features in the joint time-frequency domain. The procedure 1) enhances the PLED spikes in the time-domain using a simple energy operator; 2) transforms to the time-frequency domain using a separable-kernel distribution; and 3) uses a homomorphic filtering approach, within the time-frequency domain, to remove spectral modulation. Existing methods for instantaneous-frequency estimation are then applied to this enhanced time-frequency distribution. We show working examples with EEG epochs but have yet to test the method over an entire EEG database.
{"title":"Estimating the time-varying periodicity of epileptiform discharges in the electroencephalogram","authors":"J. O’Toole, B. G. Zapirain, Iratxe Maestro Saiz, Alina Beatriz Anaya Chen, I. Y. Santamaria","doi":"10.1109/ISSPA.2012.6310480","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310480","url":null,"abstract":"Periodic lateralized epileptiform discharges (PLEDs) are EEG waveforms that can occur after brain injury or disease. The time-varying periodicity, or instantaneous frequency, of the PLEDs is a potentially important prognostic feature. Estimating the instantaneous frequency, however, is difficult because of the concurrent presence of background activity and artefacts. Here we present a method to enhance the instantaneous frequency features in the joint time-frequency domain. The procedure 1) enhances the PLED spikes in the time-domain using a simple energy operator; 2) transforms to the time-frequency domain using a separable-kernel distribution; and 3) uses a homomorphic filtering approach, within the time-frequency domain, to remove spectral modulation. Existing methods for instantaneous-frequency estimation are then applied to this enhanced time-frequency distribution. We show working examples with EEG epochs but have yet to test the method over an entire EEG database.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130994556","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-07-02DOI: 10.1109/ISSPA.2012.6310664
A. Karami, S. Beheshti, M. Yazdi
Hyperspectral images exhibit significant spectral correlation, whose exploitation is crucial for compression. In this paper, an efficient method for hyperspectral image compression is presented using the three-dimensional discrete cosine transform (3D-DCT) and support vector machine (SVM). The core idea behind our proposed technique is to apply SVM on the 3D-DCT coefficients of hyperspectral images in order to determine which coefficients (support vectors) are more critical for being preserved. Our method not only exploits redundancies between the bands, but also uses spatial correlations of every image band. Consequently, as simulation results applied to real hyperspectral images demonstrate, the proposed method leads to a remarkable compression ratio and quality.
{"title":"Hyperspectral image compression using 3D discrete cosine transform and support vector machine learning","authors":"A. Karami, S. Beheshti, M. Yazdi","doi":"10.1109/ISSPA.2012.6310664","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310664","url":null,"abstract":"Hyperspectral images exhibit significant spectral correlation, whose exploitation is crucial for compression. In this paper, an efficient method for hyperspectral image compression is presented using the three-dimensional discrete cosine transform (3D-DCT) and support vector machine (SVM). The core idea behind our proposed technique is to apply SVM on the 3D-DCT coefficients of hyperspectral images in order to determine which coefficients (support vectors) are more critical for being preserved. Our method not only exploits redundancies between the bands, but also uses spatial correlations of every image band. Consequently, as simulation results applied to real hyperspectral images demonstrate, the proposed method leads to a remarkable compression ratio and quality.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133267398","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-07-02DOI: 10.1109/ISSPA.2012.6310481
Cheng Liu, Hongmei Zhu
The Stockwell transform, a mix of the short-time Fourier transform and the wavelet transform, has been widely used in practice in the last decade due to its easily interpretable and multi-resolution time-frequency characteristics. In this paper, we introduce the reassigned Stockwell spectrogram by re-mapping the surface of the spectrogram of the Stock-well transform with the aim to improve its readability. We first define and mathematically validate the channelized instantaneous frequency (CIF) and the local group delay (LGD) for the Stockwell transform. At any given point in the time-frequency domain, the associated CIF and LGD provide a re-estimation of the time arrival and instantaneous frequency of the signal component observed at that point. Thus, the reassigned Stockwell spectrogram has signal energy highly concentrated at the instantaneous frequency/group delay curves and greatly increases the resolution and readability of the time-frequency structure of the underlying signal. The instantaneous frequencies of signal components can then be extracted by detecting the local energy peaks in the reassigned Stockwell spectrogram. The difference between the reassigned and conventional Stockwell spectrograms is illustrated using both synthetic and real signals.
{"title":"Instantaneous frequency estimation by the reassigned Stockwell spectrogram","authors":"Cheng Liu, Hongmei Zhu","doi":"10.1109/ISSPA.2012.6310481","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310481","url":null,"abstract":"The Stockwell transform, a mix of the short-time Fourier transform and the wavelet transform, has been widely used in practice in the last decade due to its easily interpretable and multi-resolution time-frequency characteristics. In this paper, we introduce the reassigned Stockwell spectrogram by re-mapping the surface of the spectrogram of the Stock-well transform with the aim to improve its readability. We first define and mathematically validate the channelized instantaneous frequency (CIF) and the local group delay (LGD) for the Stockwell transform. At any given point in the time-frequency domain, the associated CIF and LGD provide a re-estimation of the time arrival and instantaneous frequency of the signal component observed at that point. Thus, the reassigned Stockwell spectrogram has signal energy highly concentrated at the instantaneous frequency/group delay curves and greatly increases the resolution and readability of the time-frequency structure of the underlying signal. The instantaneous frequencies of signal components can then be extracted by detecting the local energy peaks in the reassigned Stockwell spectrogram. The difference between the reassigned and conventional Stockwell spectrograms is illustrated using both synthetic and real signals.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134623739","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-07-02DOI: 10.1109/ISSPA.2012.6310580
Xiaozhou Zhou, P. Boulanger
Stereo matching aims at finding the corresponding pixels between two images. Most methods in the literatures are based on pixel intensity comparison. When images are taken at different illumination conditions or using different sensors, it is very unlikely that the corresponding pixels will have the same intensity creating false correspondences if it is only based on intensity matching functions alone. In this paper, a novel hierarchical radiometric invariant method is proposed to solve this problem. Pixels on different disparity planes in a local window are assigned the same label as the central pixel to solve the boundary problem. A more robust mutual information similarity function is used to compare the similarity of windows. A hierarchical structure is proposed to reduce the computational burden caused by using mutual information similarity function. Experimental results demonstrate that both the visual quality and quantitative analysis of the proposed algorithm outperforms most commonly used algorithms in the literatures.
{"title":"A fast hierarchical radiometric invariant stereo matching algorithm","authors":"Xiaozhou Zhou, P. Boulanger","doi":"10.1109/ISSPA.2012.6310580","DOIUrl":"https://doi.org/10.1109/ISSPA.2012.6310580","url":null,"abstract":"Stereo matching aims at finding the corresponding pixels between two images. Most methods in the literatures are based on pixel intensity comparison. When images are taken at different illumination conditions or using different sensors, it is very unlikely that the corresponding pixels will have the same intensity creating false correspondences if it is only based on intensity matching functions alone. In this paper, a novel hierarchical radiometric invariant method is proposed to solve this problem. Pixels on different disparity planes in a local window are assigned the same label as the central pixel to solve the boundary problem. A more robust mutual information similarity function is used to compare the similarity of windows. A hierarchical structure is proposed to reduce the computational burden caused by using mutual information similarity function. Experimental results demonstrate that both the visual quality and quantitative analysis of the proposed algorithm outperforms most commonly used algorithms in the literatures.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115552457","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
扫码关注我们
求助内容：
应助结果提醒方式：