Pub Date : 2014-12-01DOI: 10.1109/APSIPA.2014.7041627
Jiahao Pang, Gene Cheung, Wei Hu, O. Au
Image denoising is the most basic inverse imaging problem. As an under-determined problem, appropriate definition of image priors to regularize the problem is crucial. Among recent proposed priors for image denoising are: i) graph Laplacian regularizer where a given pixel patch is assumed to be smooth in the graph-signal domain; and ii) self-similarity prior where image patches are assumed to recur throughout a natural image in non-local spatial regions. In our first contribution, we demonstrate that the graph Laplacian regularizer converges to a continuous time functional counterpart, and careful selection of its features can lead to a discriminant signal prior. In our second contribution, we redefine patch self-similarity in terms of patch gradients and argue that the new definition results in a more accurate estimate of the graph Laplacian matrix, and thus better image denoising performance. Experiments show that our designed algorithm based on graph Laplacian regularizer and gradient-based self-similarity can outperform non-local means (NLM) denoising by up to 1.4 dB in PSNR.
{"title":"Redefining self-similarity in natural images for denoising using graph signal gradient","authors":"Jiahao Pang, Gene Cheung, Wei Hu, O. Au","doi":"10.1109/APSIPA.2014.7041627","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041627","url":null,"abstract":"Image denoising is the most basic inverse imaging problem. As an under-determined problem, appropriate definition of image priors to regularize the problem is crucial. Among recent proposed priors for image denoising are: i) graph Laplacian regularizer where a given pixel patch is assumed to be smooth in the graph-signal domain; and ii) self-similarity prior where image patches are assumed to recur throughout a natural image in non-local spatial regions. In our first contribution, we demonstrate that the graph Laplacian regularizer converges to a continuous time functional counterpart, and careful selection of its features can lead to a discriminant signal prior. In our second contribution, we redefine patch self-similarity in terms of patch gradients and argue that the new definition results in a more accurate estimate of the graph Laplacian matrix, and thus better image denoising performance. Experiments show that our designed algorithm based on graph Laplacian regularizer and gradient-based self-similarity can outperform non-local means (NLM) denoising by up to 1.4 dB in PSNR.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"35 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114117807","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/APSIPA.2014.7041637
Bin Wu, Jinsong Zhang, Yanlu Xie
This paper attempts to provide some insights about the relationship between the differentiability and the classification importance of consonants in Chinese speech communication. The two characteristics can be modelled by the perceptual distance and the functional load respectively. We have a clustering analysis of Chinese consonants based on functional load (FL) relied on mutual information (MI) between the text and its phoneme transcription. Then we compare our clustering result with that based on the perceptual distance by articulation tests. By experimenting on the Chinese newspaper corpus with millions of sentences, we find most phonemes at the same place of articulation with different manners tend to have large FLs pairwise. It is consistent with the result that those phonemes tend to have long perceptual distance pairwise.
{"title":"A clustering analysis of Chinese consonants based on functional load","authors":"Bin Wu, Jinsong Zhang, Yanlu Xie","doi":"10.1109/APSIPA.2014.7041637","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041637","url":null,"abstract":"This paper attempts to provide some insights about the relationship between the differentiability and the classification importance of consonants in Chinese speech communication. The two characteristics can be modelled by the perceptual distance and the functional load respectively. We have a clustering analysis of Chinese consonants based on functional load (FL) relied on mutual information (MI) between the text and its phoneme transcription. Then we compare our clustering result with that based on the perceptual distance by articulation tests. By experimenting on the Chinese newspaper corpus with millions of sentences, we find most phonemes at the same place of articulation with different manners tend to have large FLs pairwise. It is consistent with the result that those phonemes tend to have long perceptual distance pairwise.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984583","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/APSIPA.2014.7041777
Lasguido Nio, S. Sakti, Graham Neubig, T. Toda, Satoshi Nakamura
An example-based dialog model often require a lot of data collections to achieve a good performance. However, when it comes on handling an out of vocabulary (OOV) database queries, this approach resulting in weakness and inadequate handling of interactions between words in the sentence. In this work, we try to overcome this problem by utilizing recursive neural network paraphrase identification to improve the robustness of example-based dialog response retrieval. We model our dialog-pair database and user input query with distributed word representations, and employ recursive autoencoders and dynamic pooling to determine whether two sentences with arbitrary length have the same meaning. The distributed representations have the potential to improve handling of OOV cases, and the recursive structure can reduce confusion in example matching.
{"title":"Recursive neural network paraphrase identification for example-based dialog retrieval","authors":"Lasguido Nio, S. Sakti, Graham Neubig, T. Toda, Satoshi Nakamura","doi":"10.1109/APSIPA.2014.7041777","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041777","url":null,"abstract":"An example-based dialog model often require a lot of data collections to achieve a good performance. However, when it comes on handling an out of vocabulary (OOV) database queries, this approach resulting in weakness and inadequate handling of interactions between words in the sentence. In this work, we try to overcome this problem by utilizing recursive neural network paraphrase identification to improve the robustness of example-based dialog response retrieval. We model our dialog-pair database and user input query with distributed word representations, and employ recursive autoencoders and dynamic pooling to determine whether two sentences with arbitrary length have the same meaning. The distributed representations have the potential to improve handling of OOV cases, and the recursive structure can reduce confusion in example matching.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114629805","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/APSIPA.2014.7041716
Quang-Trung Hoang, X. Tran
This paper considers the design of a cross-layer medium access control (MAC) protocol for wireless ad hoc cooperative networks. Specifically, we redesign the message exchange process of the MAC protocol previously proposed by Shan et al. By using a HRP signal with shorter length the proposed protocol can reduce the protocol overhead and thus improve the transmission reliability. We also propose to use only one HRP signal to resolve the collision among the helpers with the same cooperative rate. The proposed protocol achieves higher path throughput and lower end-to-end packet latency compared with that by Shan et al. and the traditional IEEE 802.11 MAC protocol.
{"title":"Improved cross-layer cooperative MAC protocol for wireless ad hoc networks","authors":"Quang-Trung Hoang, X. Tran","doi":"10.1109/APSIPA.2014.7041716","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041716","url":null,"abstract":"This paper considers the design of a cross-layer medium access control (MAC) protocol for wireless ad hoc cooperative networks. Specifically, we redesign the message exchange process of the MAC protocol previously proposed by Shan et al. By using a HRP signal with shorter length the proposed protocol can reduce the protocol overhead and thus improve the transmission reliability. We also propose to use only one HRP signal to resolve the collision among the helpers with the same cooperative rate. The proposed protocol achieves higher path throughput and lower end-to-end packet latency compared with that by Shan et al. and the traditional IEEE 802.11 MAC protocol.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123714825","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/APSIPA.2014.7041671
Yudong Liang, Jinjun Wang, Shizhou Zhang, Yihong Gong
This paper proposes a novel neural network learning the essential mapping function between the low resolution and high resolution image for Image superresolution problem. In our approach, patch recurrence property of small patches in natural image are utilized as a prior to train the network. An autoencoder neutral network is designed to reconstruct the high resolution patches. The constraint that the output of the coding part should be similar as the corresponding high resolution patches is imposed to ameliorate the illness nature of the superresolution problem. In fact, the degeneration mapping from the high resolution image to the low resolution image is also integrated in the network. Both visual improvements and objective assessments are demonstrated on true images.
{"title":"Learning visual co-occurrence with auto-encoder for image super-resolution","authors":"Yudong Liang, Jinjun Wang, Shizhou Zhang, Yihong Gong","doi":"10.1109/APSIPA.2014.7041671","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041671","url":null,"abstract":"This paper proposes a novel neural network learning the essential mapping function between the low resolution and high resolution image for Image superresolution problem. In our approach, patch recurrence property of small patches in natural image are utilized as a prior to train the network. An autoencoder neutral network is designed to reconstruct the high resolution patches. The constraint that the output of the coding part should be similar as the corresponding high resolution patches is imposed to ameliorate the illness nature of the superresolution problem. In fact, the degeneration mapping from the high resolution image to the low resolution image is also integrated in the network. Both visual improvements and objective assessments are demonstrated on true images.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123493236","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/APSIPA.2014.7041569
K. Hayashi, Masanori Sakai, Takuya Kamenosono, Megumi Kaneko
The paper considers a time domain channel estimation approach for uplink OFDMA (Orthogonal Frequency Division Multiple Access) systems. Although frequency domain channel estimation schemes are widely used for those systems, we propose time domain channel estimation schemes by taking advantage of the sparsity of channel impulse response with compressed sensing. Numerical simulations show the merit of the proposed schemes, which demonstrates the validity of the time domain channel estimation approach for OFDMA systems.
{"title":"Compressed sensing based channel estimation for uplink OFDMA systems","authors":"K. Hayashi, Masanori Sakai, Takuya Kamenosono, Megumi Kaneko","doi":"10.1109/APSIPA.2014.7041569","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041569","url":null,"abstract":"The paper considers a time domain channel estimation approach for uplink OFDMA (Orthogonal Frequency Division Multiple Access) systems. Although frequency domain channel estimation schemes are widely used for those systems, we propose time domain channel estimation schemes by taking advantage of the sparsity of channel impulse response with compressed sensing. Numerical simulations show the merit of the proposed schemes, which demonstrates the validity of the time domain channel estimation approach for OFDMA systems.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121555654","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/APSIPA.2014.7041548
Longbiao Wang, Bo Ren, Yuma Ueda, A. Kai, Shunta Teraoka, T. Fukushima
In this paper, we propose a robust distant-talking speech recognition system with asynchronous speech recording. This is implemented by combining denoising autoencoder-based cepstral-domain dereverberation, automatic asynchronous speech (microphone or mobile terminal) selection and environment adaptation. Although applications using mobile terminals have attracted increasing attention, there are few studies that focus on distant-talking speech recognition with asynchronous mobile terminals. For the system proposed in this paper, after applying a denoising autoencoder in the cepstral domain of speech to suppress reverberation and performing Large Vocabulary Continuous Speech Recognition (LVCSR), we adopted automatic asynchronous mobile terminal selection and environment adaptation using speech segments from optimal mobile terminals. The proposed method was evaluated using a reverberant WSJCAMO corpus, which was emitted by a loudspeaker and recorded in a meeting room with multiple speakers by far-field multiple mobile terminals. By integrating a cepstral-domain denoising autoencoder and automatic mobile terminal selection with environment adaptation, the average Word Error Rate (WER) was reduced from 51.8% of the baseline system to 28.8%, i.e., the relative error reduction rate was 44.4% when using multi-condition acoustic models.
{"title":"Denoising autoencoder and environment adaptation for distant-talking speech recognition with asynchronous speech recording","authors":"Longbiao Wang, Bo Ren, Yuma Ueda, A. Kai, Shunta Teraoka, T. Fukushima","doi":"10.1109/APSIPA.2014.7041548","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041548","url":null,"abstract":"In this paper, we propose a robust distant-talking speech recognition system with asynchronous speech recording. This is implemented by combining denoising autoencoder-based cepstral-domain dereverberation, automatic asynchronous speech (microphone or mobile terminal) selection and environment adaptation. Although applications using mobile terminals have attracted increasing attention, there are few studies that focus on distant-talking speech recognition with asynchronous mobile terminals. For the system proposed in this paper, after applying a denoising autoencoder in the cepstral domain of speech to suppress reverberation and performing Large Vocabulary Continuous Speech Recognition (LVCSR), we adopted automatic asynchronous mobile terminal selection and environment adaptation using speech segments from optimal mobile terminals. The proposed method was evaluated using a reverberant WSJCAMO corpus, which was emitted by a loudspeaker and recorded in a meeting room with multiple speakers by far-field multiple mobile terminals. By integrating a cepstral-domain denoising autoencoder and automatic mobile terminal selection with environment adaptation, the average Word Error Rate (WER) was reduced from 51.8% of the baseline system to 28.8%, i.e., the relative error reduction rate was 44.4% when using multi-condition acoustic models.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128533131","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/APSIPA.2014.7041701
Masanori Takehara, Hiroya Nojiri, S. Tamura, S. Hayamizu, T. Kurata
Human behavior sensing and their analysis are great role to improve service quality and education of employees. This paper shows novel frameworks of detection of customer communication and lead time estimation(LTE) by using multi-sensored data, sound data and accounting data in the restaurant. They are useful for management about work environments and problems for employees. Lead time from order to delivery shows the quality of the service for customers. We found sound data of an employee's speech is useful for these techniques by speech ratio smoothing and POS sound detection.
{"title":"Analysis of customer communication by employee in restaurant and lead time estimation","authors":"Masanori Takehara, Hiroya Nojiri, S. Tamura, S. Hayamizu, T. Kurata","doi":"10.1109/APSIPA.2014.7041701","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041701","url":null,"abstract":"Human behavior sensing and their analysis are great role to improve service quality and education of employees. This paper shows novel frameworks of detection of customer communication and lead time estimation(LTE) by using multi-sensored data, sound data and accounting data in the restaurant. They are useful for management about work environments and problems for employees. Lead time from order to delivery shows the quality of the service for customers. We found sound data of an employee's speech is useful for these techniques by speech ratio smoothing and POS sound detection.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131017694","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/APSIPA.2014.7041561
Ryo Matsuoka, T. Baba, M. Okuda
We present an algorithm for the constrained design of FIR filters with sparse coefficients. In general, the filter design approach aims to minimize a filter order and maximize the filter performance. Although the FIR filter coefficients designed by the least squares method is optimal in the least squares sense, it is not necessarily optimal among the set of filters with the same number of multipliers, that is, less mean squared error can be achieved by a filter that has the same number of multipliers, but has longer impulse response with some zero-valued entries. Our method minimizes the number of nonzero entries in the impulse response together with the least squares error of its frequency response. In addition, we incorporate some constraints to the design and realize better performance than conventional constrained least squares design.
{"title":"Constrained design of FIR filters with sparse coefficients","authors":"Ryo Matsuoka, T. Baba, M. Okuda","doi":"10.1109/APSIPA.2014.7041561","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041561","url":null,"abstract":"We present an algorithm for the constrained design of FIR filters with sparse coefficients. In general, the filter design approach aims to minimize a filter order and maximize the filter performance. Although the FIR filter coefficients designed by the least squares method is optimal in the least squares sense, it is not necessarily optimal among the set of filters with the same number of multipliers, that is, less mean squared error can be achieved by a filter that has the same number of multipliers, but has longer impulse response with some zero-valued entries. Our method minimizes the number of nonzero entries in the impulse response together with the least squares error of its frequency response. In addition, we incorporate some constraints to the design and realize better performance than conventional constrained least squares design.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129978061","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/APSIPA.2014.7041731
Nicholas Chong, Shanhung Wong, S. Nordholm, I. Murray
In Source Separation research, "cocktail party problem" is a challenging problem that research into source separation aims to solve. Many attempts have been made to solve this complex problem. A logical approach would be to break down this complex problem into several smaller problems which are solved in different stages - each considering various aspects. In this paper, we are providing a robust solution to a part of the problem by localizing and tracking multiple moving speech sources in a room environment. Here we study the separation problem for unknown number of moving sources. The DUET-CBMeMBer method we outline is capable of estimating the number of sound sources as well as tracking and labelling them. This paper proposes a track management technique that identifies sound sources based on their trajectory as an extension to the DUET-CBMeMBer technique.
{"title":"Multiple sound source tracking and identification via degenerate unmixing estimation technique and cardinality balanced multi-target multi-bernoulli filter (DUET-CBMeMBer) with track management","authors":"Nicholas Chong, Shanhung Wong, S. Nordholm, I. Murray","doi":"10.1109/APSIPA.2014.7041731","DOIUrl":"https://doi.org/10.1109/APSIPA.2014.7041731","url":null,"abstract":"In Source Separation research, \"cocktail party problem\" is a challenging problem that research into source separation aims to solve. Many attempts have been made to solve this complex problem. A logical approach would be to break down this complex problem into several smaller problems which are solved in different stages - each considering various aspects. In this paper, we are providing a robust solution to a part of the problem by localizing and tracking multiple moving speech sources in a room environment. Here we study the separation problem for unknown number of moving sources. The DUET-CBMeMBer method we outline is capable of estimating the number of sound sources as well as tracking and labelling them. This paper proposes a track management technique that identifies sound sources based on their trajectory as an extension to the DUET-CBMeMBer technique.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999347","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
扫码关注我们
求助内容：
应助结果提醒方式：