Pub Date : 1900-01-01DOI: 10.1109/ISSPA.2001.949773
J. Mukherjee, M. Moore, S. Mitra
In a single-chip digital color imaging sensor, a color filter array (CFA) is used to obtain sampled spectral components (red, green and blue) in an interleaved fashion. Color demosaicing is the process of interpolating these regularly spaced sampled values into a dense pixel map for each spectral component. We present two new color interpolation techniques with low buffer requirements for processing while developing color images with very good quality. We also present a comparative study with other interpolation techniques of similar buffer requirements.
{"title":"Color demosaicing with constrained buffering","authors":"J. Mukherjee, M. Moore, S. Mitra","doi":"10.1109/ISSPA.2001.949773","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949773","url":null,"abstract":"In a single-chip digital color imaging sensor, a color filter array (CFA) is used to obtain sampled spectral components (red, green and blue) in an interleaved fashion. Color demosaicing is the process of interpolating these regularly spaced sampled values into a dense pixel map for each spectral component. We present two new color interpolation techniques with low buffer requirements for processing while developing color images with very good quality. We also present a comparative study with other interpolation techniques of similar buffer requirements.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123265732","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950223
A. Yatim, N. Idris
Digital signal processors (DSPs) are becoming more popular in the area of AC motor control, in particular the induction motor drives. The fast number crunching capabilities of DSPs which are traditionally meant for data processing tasks such as image processing and speech recognition, are being utilised to perform on-line calculation of the AC motor variables, such as electromagnetic torque, fluxes, mechanical speed, etc. This paper presents the implementation of a high performance induction motor control technique known as direct torque control (DTC) utilising the TMS320C31 DSP from Texas Instrument. To minimise the sampling period of the implemented drive system, a Xilinx FPGA (XC4005E) is used to perform some of the main tasks of DTC drives. Experimental results of this high performance drive system on a 1/4 hp standard induction motor are as expected and agree with the theoretical work.
{"title":"Implementation of direct torque control of induction machine utilising TMS320C31 digital signal processor","authors":"A. Yatim, N. Idris","doi":"10.1109/ISSPA.2001.950223","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950223","url":null,"abstract":"Digital signal processors (DSPs) are becoming more popular in the area of AC motor control, in particular the induction motor drives. The fast number crunching capabilities of DSPs which are traditionally meant for data processing tasks such as image processing and speech recognition, are being utilised to perform on-line calculation of the AC motor variables, such as electromagnetic torque, fluxes, mechanical speed, etc. This paper presents the implementation of a high performance induction motor control technique known as direct torque control (DTC) utilising the TMS320C31 DSP from Texas Instrument. To minimise the sampling period of the implemented drive system, a Xilinx FPGA (XC4005E) is used to perform some of the main tasks of DTC drives. Experimental results of this high performance drive system on a 1/4 hp standard induction motor are as expected and agree with the theoretical work.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124908470","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949836
Yi Yang, Chunyan Wang, M. Ahmad, M. Swamy
This paper presents a cost-effective VLSI architecture for a two-dimensional (2-D) inverse discrete cosine transform (IDCT) core based on a modified on-line CORDIC algorithm. In order to have a low hardware complexity and to provide a good performance, the proposed design is based on the row-column decomposition approach and distributed arithmetic (DA). By reformulating the 1-D IDCT functions using the CORDIC approach, the proposed design requires about 60% less ROM than the conventional DA-based IDCT without using CORDIC. In our architecture the on-line algorithm is used to further reduce the area and to enhance the computation speed. The core operates on blocks of 8/spl times/8 pixels, with 12-bit and 8-bit precision for inputs and outputs, respectively. The proposed design has been synthesized by using 0.35-/spl mu/m CMOS technology. The simulation results show that the core for IDCT can run at 150 MHz with 60 Mpixel/s throughput, while meeting the requirement of the H.26x standard.
本文提出了一种基于改进的在线CORDIC算法的二维(2-D)反离散余弦变换(IDCT)核的高效VLSI结构。为了降低硬件复杂度并提供良好的性能，该设计基于行-列分解方法和分布式算法(DA)。通过使用CORDIC方法重新制定1-D IDCT功能，所提出的设计比不使用CORDIC的传统基于数据的IDCT减少了约60%的ROM。在我们的体系结构中，采用了在线算法，进一步减小了面积，提高了计算速度。核心在8/spl倍/8像素的块上运行，输入和输出分别具有12位和8位精度。采用0.35-/spl μ m CMOS工艺合成了该电路。仿真结果表明，该IDCT核心工作频率为150 MHz，吞吐量为60 Mpixel/s，满足H.26x标准的要求。
{"title":"An on-line CORDIC based 2-D IDCT implementation using distributed arithmetic","authors":"Yi Yang, Chunyan Wang, M. Ahmad, M. Swamy","doi":"10.1109/ISSPA.2001.949836","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949836","url":null,"abstract":"This paper presents a cost-effective VLSI architecture for a two-dimensional (2-D) inverse discrete cosine transform (IDCT) core based on a modified on-line CORDIC algorithm. In order to have a low hardware complexity and to provide a good performance, the proposed design is based on the row-column decomposition approach and distributed arithmetic (DA). By reformulating the 1-D IDCT functions using the CORDIC approach, the proposed design requires about 60% less ROM than the conventional DA-based IDCT without using CORDIC. In our architecture the on-line algorithm is used to further reduce the area and to enhance the computation speed. The core operates on blocks of 8/spl times/8 pixels, with 12-bit and 8-bit precision for inputs and outputs, respectively. The proposed design has been synthesized by using 0.35-/spl mu/m CMOS technology. The simulation results show that the core for IDCT can run at 150 MHz with 60 Mpixel/s throughput, while meeting the requirement of the H.26x standard.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133295480","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949813
O. Stasse, Yoichi Ishiwata, Y. Kuniyoshi
This paper presents our results in using ART, a real-time extension for Linux, in the context of a visual attention model implementation using log-polar images. ART allows periodic computing in the user space, suitable for frame-rate image processing, and motor control at 200 Hz. Integrated with PredN (parallel real-time event and data-driven network), a development tool for complex robotic applications, it provides a low cost and user-friendly environment to realize distributed image processing in real-time.
本文介绍了我们在使用对数极图像实现视觉注意力模型的背景下使用ART (Linux的实时扩展)的结果。ART允许在用户空间进行周期性计算，适用于帧率图像处理和200hz的电机控制。结合复杂机器人应用开发工具PredN (parallel real-time event and data-driven network，并行实时事件和数据驱动网络)，为实现实时分布式图像处理提供了低成本、用户友好的环境。
{"title":"Frame rate distributed computing for log-polar images with a novel real-time operating system on a general purpose platform","authors":"O. Stasse, Yoichi Ishiwata, Y. Kuniyoshi","doi":"10.1109/ISSPA.2001.949813","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949813","url":null,"abstract":"This paper presents our results in using ART, a real-time extension for Linux, in the context of a visual attention model implementation using log-polar images. ART allows periodic computing in the user space, suitable for frame-rate image processing, and motor control at 200 Hz. Integrated with PredN (parallel real-time event and data-driven network), a development tool for complex robotic applications, it provides a low cost and user-friendly environment to realize distributed image processing in real-time.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115899671","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950203
How Sun Dee, V. Jeoti
We propose a hybrid transform that performs one-level wavelet decomposition of any image and follows it with a discrete cosine transform (DCT) in its lowpass sub-band. It shows a definite improvement over the DCT-based JPEG coder performance, in that it allows for a wider range of compression ratios (CR) over which the coder PSNR performance is good while it requires far fewer computations. We show that even though the proposed transform has similarity to sub-band DCT, it outperforms sub-band DCT at low CR and is as good as the sub-band DCT at high CR.
{"title":"On image compression: a DWT-DCT algorithm","authors":"How Sun Dee, V. Jeoti","doi":"10.1109/ISSPA.2001.950203","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950203","url":null,"abstract":"We propose a hybrid transform that performs one-level wavelet decomposition of any image and follows it with a discrete cosine transform (DCT) in its lowpass sub-band. It shows a definite improvement over the DCT-based JPEG coder performance, in that it allows for a wider range of compression ratios (CR) over which the coder PSNR performance is good while it requires far fewer computations. We show that even though the proposed transform has similarity to sub-band DCT, it outperforms sub-band DCT at low CR and is as good as the sub-band DCT at high CR.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115278259","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950207
H. Kondo, Keiko Yamahara, Jun Liao
Identification of DCT signs for image coding is presented. In the JPEG DCT coding method the sign of the DCT coefficient is included in the coded signal. Usually 0.1/spl sim/0.2 bit/pixel for the average bit rate is taken for coding these signs. This paper shows these DCT signs can be estimated at the receiver side almost perfectly on the basis of the smoothness cost function, so it is not needed to send this information. The smoothness cost function is the measure of a smooth connection of the sub-block borders. Here as a cost function the absolute squared Laplacian sum is used. And the technique to determine the signs is a genetic algorithm. It gives us an effective solution quickly. The simulation results show that the reconstructed images have adequate picture quality.
{"title":"Identification of DCT signs for sub-block coding","authors":"H. Kondo, Keiko Yamahara, Jun Liao","doi":"10.1109/ISSPA.2001.950207","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950207","url":null,"abstract":"Identification of DCT signs for image coding is presented. In the JPEG DCT coding method the sign of the DCT coefficient is included in the coded signal. Usually 0.1/spl sim/0.2 bit/pixel for the average bit rate is taken for coding these signs. This paper shows these DCT signs can be estimated at the receiver side almost perfectly on the basis of the smoothness cost function, so it is not needed to send this information. The smoothness cost function is the measure of a smooth connection of the sub-block borders. Here as a cost function the absolute squared Laplacian sum is used. And the technique to determine the signs is a genetic algorithm. It gives us an effective solution quickly. The simulation results show that the reconstructed images have adequate picture quality.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114081332","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949855
Wenyi Wang
Our study in the past showed that the autoregressive (AR) modelling method could be effectively used in the detection of gear tooth cracking. In the search for further improvement, a technique of identifying linear parametric models for gear signals using higher order statistics and inverse filter criteria has been evaluated and was applied to some seeded fault gear test data. The results indicate that this approach is more effective than the AR modelling method and the conventional residual signal technique.
{"title":"Linear model identification for gear fault detection using higher order statistics and inverse filter criteria","authors":"Wenyi Wang","doi":"10.1109/ISSPA.2001.949855","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949855","url":null,"abstract":"Our study in the past showed that the autoregressive (AR) modelling method could be effectively used in the detection of gear tooth cracking. In the search for further improvement, a technique of identifying linear parametric models for gear signals using higher order statistics and inverse filter criteria has been evaluated and was applied to some seeded fault gear test data. The results indicate that this approach is more effective than the AR modelling method and the conventional residual signal technique.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123858009","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950253
S. A. Samat, S. M. Tahir, A. Sha'ameri
This paper proposes the use of spectrum estimation with cross spectrum correlation to monitor the condition of automotive engines based on their sound signatures. This approach is convenient and economical as it is nonintrusive and does not require high precision sensors, The nonparametric spectrum estimation is chosen because the sample available is sufficiently large such that there is no leakage and frequency resolution problem. The methods chosen are periodogram, Bartlett, Welch and Blackman-Tukey.
{"title":"Engines condition monitoring based on spectrum analysis of sound signals","authors":"S. A. Samat, S. M. Tahir, A. Sha'ameri","doi":"10.1109/ISSPA.2001.950253","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950253","url":null,"abstract":"This paper proposes the use of spectrum estimation with cross spectrum correlation to monitor the condition of automotive engines based on their sound signatures. This approach is convenient and economical as it is nonintrusive and does not require high precision sensors, The nonparametric spectrum estimation is chosen because the sample available is sufficiently large such that there is no leakage and frequency resolution problem. The methods chosen are periodogram, Bartlett, Welch and Blackman-Tukey.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123980622","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949793
F. Nagi
The work describes here uses optimization techniques to increase the gain of a uniform linear array's beampattern when some of its elements fails. The optimization criteria evaluates the weights of the remaining elements so as to restore the gain as closely as possible to the reference beampattern. LMS and goal programming methods are used to evaluate the weights of the remaining array elements. In the LMS algorithm the error between the reference and the iterated beampattern is reduced. In the goal attaining algorithm the goal of optimization is set to the reference pattern. The comparison between the two techniques reveals that in general the goal programming algorithm perform better in terms of the SNR of the beampattern beamwidths.
{"title":"Linear array beampattern gain optimization techniques","authors":"F. Nagi","doi":"10.1109/ISSPA.2001.949793","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949793","url":null,"abstract":"The work describes here uses optimization techniques to increase the gain of a uniform linear array's beampattern when some of its elements fails. The optimization criteria evaluates the weights of the remaining elements so as to restore the gain as closely as possible to the reference beampattern. LMS and goal programming methods are used to evaluate the weights of the remaining array elements. In the LMS algorithm the error between the reference and the iterated beampattern is reduced. In the goal attaining algorithm the goal of optimization is set to the reference pattern. The comparison between the two techniques reveals that in general the goal programming algorithm perform better in terms of the SNR of the beampattern beamwidths.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"77 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124811434","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950260
S. Shamsuddin, M. Baba, Deepak K. Ghodgaonkar
The objective of this paper is to discuss on the implementation of cryptographic security algorithms for radio telemetry using the graphical programming software from National Instruments known as LabVIEW. The telemetry system consists of a remote telemetry station (RTS) and base telemetry station (BTS) for acquiring and monitoring environmental conditions respectively. RTS setup includes a desktop computer integrated with a data acquisition system, 1200 bps modem and GP300 Motorola walkie talkie (see Ghodgaonkar, D.K. et al., IEEE Proceedings Malaysia Section 2nd National Conference on Telecommunications Technology, p.88-93, 1998). The BTS has the same setup as the RTS except that it does not have a data acquisition system. The walkie-talkie operating frequency is 477.1 MHz with FM transmission. A combination of One Time Pad (OTP) and Caesar Cipher cryptographic algorithms are implemented in order to safeguard the information from eavesdroppers. OTP was chosen because it is suitable for low bit rate data.
本文的目的是讨论使用美国国家仪器公司的图形编程软件LabVIEW实现无线电遥测的加密安全算法。遥测系统由远程遥测站(RTS)和基遥测站(BTS)组成，分别用于获取和监测环境条件。RTS设置包括与数据采集系统集成的台式计算机，1200 bps调制解调器和GP300摩托罗拉对讲机(见Ghodgaonkar, D.K. et al.， IEEE Proceedings Malaysia Section 2nd National Conference on Telecommunications Technology, p.88- 93,1998)。除了没有数据采集系统外，防弹少年团的设置与RTS相同。对讲机工作频率为477.1 MHz，调频传输。为了保护信息不被窃听，实现了一次性垫(OTP)和凯撒密码(Caesar Cipher)的组合加密算法。选择OTP是因为它适合于低比特率数据。
{"title":"Implementation of cryptographic algorithms for radio telemetry using LabVIEW","authors":"S. Shamsuddin, M. Baba, Deepak K. Ghodgaonkar","doi":"10.1109/ISSPA.2001.950260","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950260","url":null,"abstract":"The objective of this paper is to discuss on the implementation of cryptographic security algorithms for radio telemetry using the graphical programming software from National Instruments known as LabVIEW. The telemetry system consists of a remote telemetry station (RTS) and base telemetry station (BTS) for acquiring and monitoring environmental conditions respectively. RTS setup includes a desktop computer integrated with a data acquisition system, 1200 bps modem and GP300 Motorola walkie talkie (see Ghodgaonkar, D.K. et al., IEEE Proceedings Malaysia Section 2nd National Conference on Telecommunications Technology, p.88-93, 1998). The BTS has the same setup as the RTS except that it does not have a data acquisition system. The walkie-talkie operating frequency is 477.1 MHz with FM transmission. A combination of One Time Pad (OTP) and Caesar Cipher cryptographic algorithms are implemented in order to safeguard the information from eavesdroppers. OTP was chosen because it is suitable for low bit rate data.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"56 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120917458","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
扫码关注我们
求助内容：
应助结果提醒方式：