Pub Date : 2009-10-23DOI: 10.1109/PACRIM.2009.5291243
R. Cole, B. Awerbuch
All prominent unicast and multicast routing protocols designed for wireless Mobile Ad-Hoc Networks (MANETs) require a communications cost that scales like O(N2) where N is the number of nodes in the routing domain. We explore the use of extremely lightweight network structures, which require communications costs that scale like O(N) or O(N3/2), for use in new unicast and multicast routing. Our previous studies investigate the efficiency of single or multiple spanning trees for use in discovering unicast routing paths. In this paper we extend our previous studies to investigate the use of these same network structures to build efficient estimates of the Minimum Connected Dominating Set (MCDS) of nodes for multicast packet distribution. We use simulation studies to evaluate the closeness of our approach compared to other prominent MCDS estimate algorithms. We find that our approach results in MCDS estimates as good as the best distributed local algorithms, while generating no additional communications cost over our existing unicast routing methods.
{"title":"Lightweight unicast and multicast routing for MANETs","authors":"R. Cole, B. Awerbuch","doi":"10.1109/PACRIM.2009.5291243","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291243","url":null,"abstract":"All prominent unicast and multicast routing protocols designed for wireless Mobile Ad-Hoc Networks (MANETs) require a communications cost that scales like O(N2) where N is the number of nodes in the routing domain. We explore the use of extremely lightweight network structures, which require communications costs that scale like O(N) or O(N3/2), for use in new unicast and multicast routing. Our previous studies investigate the efficiency of single or multiple spanning trees for use in discovering unicast routing paths. In this paper we extend our previous studies to investigate the use of these same network structures to build efficient estimates of the Minimum Connected Dominating Set (MCDS) of nodes for multicast packet distribution. We use simulation studies to evaluate the closeness of our approach compared to other prominent MCDS estimate algorithms. We find that our approach results in MCDS estimates as good as the best distributed local algorithms, while generating no additional communications cost over our existing unicast routing methods.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"18 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127614186","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291281
Aijuan Dong, Baoying Wang
Automatic mammogram analysis is important in early breast cancer detection. In this paper, we present a multi-resolution approach to automated classification of mammograms using Gabor filters. Specifically, Gabor filters of different frequencies and orientations have been used to extract textual patterns of mammograms. To increase classification efficiency and reduce feature space, statistic t-test and its p-values for feature selection and weighting are proposed. Experimental results show that Gabor filters are able to extract textual patterns of mammograms, statistical-based feature selection and weighting can be used to further reduce the feature space without degrading the classification performance.
{"title":"Feature selection and analysis on mammogram classification","authors":"Aijuan Dong, Baoying Wang","doi":"10.1109/PACRIM.2009.5291281","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291281","url":null,"abstract":"Automatic mammogram analysis is important in early breast cancer detection. In this paper, we present a multi-resolution approach to automated classification of mammograms using Gabor filters. Specifically, Gabor filters of different frequencies and orientations have been used to extract textual patterns of mammograms. To increase classification efficiency and reduce feature space, statistic t-test and its p-values for feature selection and weighting are proposed. Experimental results show that Gabor filters are able to extract textual patterns of mammograms, statistical-based feature selection and weighting can be used to further reduce the feature space without degrading the classification performance.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121942744","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291316
Zhan Xu, Z. Miao, Fei Hao, Ming Liu, Ying Fang
Expression cloning is essential to motion capture. Currently, most methods to realize the idea require expensive equipment such as Cyberware and lot of manual work. This paper introduces a high speed monocular markerless expression cloning system. In Motion capture module, feature points in actor's face are captured and tracked with computer vision methods. Tracking result of 16 feature points is encouraging after only a few steps of manual work. In the Expression driven model, we well design a template model, then additional models can be loaded without initialization. Only a camera and a common PC is needed in our system, on condition that source video is taken under normal lightning environment, synchronous realistic target animation can be acquired.
{"title":"High speed markerless monocular expression cloning","authors":"Zhan Xu, Z. Miao, Fei Hao, Ming Liu, Ying Fang","doi":"10.1109/PACRIM.2009.5291316","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291316","url":null,"abstract":"Expression cloning is essential to motion capture. Currently, most methods to realize the idea require expensive equipment such as Cyberware and lot of manual work. This paper introduces a high speed monocular markerless expression cloning system. In Motion capture module, feature points in actor's face are captured and tracked with computer vision methods. Tracking result of 16 feature points is encouraging after only a few steps of manual work. In the Expression driven model, we well design a template model, then additional models can be loaded without initialization. Only a camera and a common PC is needed in our system, on condition that source video is taken under normal lightning environment, synchronous realistic target animation can be acquired.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121446054","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291263
S. Toshiya, H. Nishimura, Y. Sanada
A diversity scheme with fractional sampling (FS) in an OFDM receiver is investigated recently. Through FS, it is possible to separate multipath components and obtain diversity gain in the OFDM system. Expansion of the bandwidth of the total response including transmit and receive baseband filters allows the FS scheme to achieve path diversity. However, the transmit filter is designed according to the spectrum mask of the standards to avoid interference to the other communication systems. In order to achieve the maximum SNR, the same filter is commonly used in the transmitter and the receiver. In this paper, the trade-off between the SNR deterioration and the diversity gain due to the total response larger than the minimal bandwidth is investigated. Numerical results through computer simulation indicate that BER performance with the receive filter of non-minimal bandwidth shows better performance than that with the filter for maximizing the SNR in certain conditions.
{"title":"Improvement on diversity gain with filter bandwidth expansion in fractional sampling OFDM receiver","authors":"S. Toshiya, H. Nishimura, Y. Sanada","doi":"10.1109/PACRIM.2009.5291263","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291263","url":null,"abstract":"A diversity scheme with fractional sampling (FS) in an OFDM receiver is investigated recently. Through FS, it is possible to separate multipath components and obtain diversity gain in the OFDM system. Expansion of the bandwidth of the total response including transmit and receive baseband filters allows the FS scheme to achieve path diversity. However, the transmit filter is designed according to the spectrum mask of the standards to avoid interference to the other communication systems. In order to achieve the maximum SNR, the same filter is commonly used in the transmitter and the receiver. In this paper, the trade-off between the SNR deterioration and the diversity gain due to the total response larger than the minimal bandwidth is investigated. Numerical results through computer simulation indicate that BER performance with the receive filter of non-minimal bandwidth shows better performance than that with the filter for maximizing the SNR in certain conditions.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130149528","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291304
Y. Akai, Kazuaki Wakao, Takashi Yokouchi, M. Kai
Authors have developed a strong migration mobile agent system using Java. In order to make strong migration possible on usual JVM, we have already proposed an automatic code transformation method for such agents [1]. In this paper, in order to apply this strong migration mobile agent system to autonomic distributed processing, the system, called AgentSphere, which offers the space where agents can be active is proposed. Agents can perform their processing by entering into AgentSphere on any machine. AgentSphere consists of the core systems and the subsystems which support an agent's activities. As some of the core systems, a class loader which updates class files dynamically with agents' migration and the communication facility among AgentSpheres are designed and implemented. Moreover, as one of the subsystems, a virtual file system for autonomic distributed processing is implemented using out mobile agents.
{"title":"Development of the strong migration mobile agent system AgentSphere for autonomic distributed processing","authors":"Y. Akai, Kazuaki Wakao, Takashi Yokouchi, M. Kai","doi":"10.1109/PACRIM.2009.5291304","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291304","url":null,"abstract":"Authors have developed a strong migration mobile agent system using Java. In order to make strong migration possible on usual JVM, we have already proposed an automatic code transformation method for such agents [1]. In this paper, in order to apply this strong migration mobile agent system to autonomic distributed processing, the system, called AgentSphere, which offers the space where agents can be active is proposed. Agents can perform their processing by entering into AgentSphere on any machine. AgentSphere consists of the core systems and the subsystems which support an agent's activities. As some of the core systems, a class loader which updates class files dynamically with agents' migration and the communication facility among AgentSpheres are designed and implemented. Moreover, as one of the subsystems, a virtual file system for autonomic distributed processing is implemented using out mobile agents.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134564830","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291301
Hiroshi Emina, Yusuke Sugio, H. Koga, M. Shimamura, T. Ikenaga
Group-oriented communication services have become more attractive due to diversifying demands of Internet users. In such emerging applications, information shared or exchanged by users in a group should be quickly and reliably delivered to other group members. However, the current Internet architecture is difficult to accommodate these applications efficiently. Therefore, a novel network architecture concept has been proposed to achieve group-oriented communication. Although this concept enables such communication, intelligent connection management schemes are also needed to improve the efficiency of network resource use. In this paper, we propose a session-based mechanism for efficient group communication. Furthermore, we show the effectiveness of the proposed scheme by means of simulations.
{"title":"Split connection scheme for session-based group communication","authors":"Hiroshi Emina, Yusuke Sugio, H. Koga, M. Shimamura, T. Ikenaga","doi":"10.1109/PACRIM.2009.5291301","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291301","url":null,"abstract":"Group-oriented communication services have become more attractive due to diversifying demands of Internet users. In such emerging applications, information shared or exchanged by users in a group should be quickly and reliably delivered to other group members. However, the current Internet architecture is difficult to accommodate these applications efficiently. Therefore, a novel network architecture concept has been proposed to achieve group-oriented communication. Although this concept enables such communication, intelligent connection management schemes are also needed to improve the efficiency of network resource use. In this paper, we propose a session-based mechanism for efficient group communication. Furthermore, we show the effectiveness of the proposed scheme by means of simulations.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133907203","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291382
Hui Jing, H. Aida
As one of the most widely investigated topology control mechanisms of wireless sensor networks (WSNs), the clustering algorithm provides energy efficient communications by reducing transmission overhead and enhancing transmission reliability. Through the previous forms of noncooperative games, the behavior of each sensor node (SN) is individual in WSNs; accordingly, it engenders uneven distribution of residual energy across SNs and expedites network partition. To balance energy consumption of SNs and increase network lifetime and stability, a cooperative game theoretic model of clustering algorithms is provided for assigning feasible allocations of energy cost. Moreover, from the outcome of this model, we propose and analyze a cooperative clustering approach for global optimization with the capacity of sensing data transmission and energy efficiency. The key idea is that SNs should trade off individual cost with network-wide cost. In the algorithm, we develop conditions to form coalitions considering residual energy, transmission distance and number of SNs in a cluster adapting to various WSNs. Furthermore, we present performance evaluation and comparison of the existing clustering algorithms with our approach quantitatively with respect to network lifetime, data transmission capacity and energy efficiency. Comparing with other approaches through the simulation, our scheme can surely guarantee to prolong network life-time and improve data transmission capacity up to 5.8% and 35.9%, respectively.
{"title":"A cooperative game theoretic approach to clustering algorithms for wireless sensor networks","authors":"Hui Jing, H. Aida","doi":"10.1109/PACRIM.2009.5291382","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291382","url":null,"abstract":"As one of the most widely investigated topology control mechanisms of wireless sensor networks (WSNs), the clustering algorithm provides energy efficient communications by reducing transmission overhead and enhancing transmission reliability. Through the previous forms of noncooperative games, the behavior of each sensor node (SN) is individual in WSNs; accordingly, it engenders uneven distribution of residual energy across SNs and expedites network partition. To balance energy consumption of SNs and increase network lifetime and stability, a cooperative game theoretic model of clustering algorithms is provided for assigning feasible allocations of energy cost. Moreover, from the outcome of this model, we propose and analyze a cooperative clustering approach for global optimization with the capacity of sensing data transmission and energy efficiency. The key idea is that SNs should trade off individual cost with network-wide cost. In the algorithm, we develop conditions to form coalitions considering residual energy, transmission distance and number of SNs in a cluster adapting to various WSNs. Furthermore, we present performance evaluation and comparison of the existing clustering algorithms with our approach quantitatively with respect to network lifetime, data transmission capacity and energy efficiency. Comparing with other approaches through the simulation, our scheme can surely guarantee to prolong network life-time and improve data transmission capacity up to 5.8% and 35.9%, respectively.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133069446","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291368
Heejung Kim, M. Moh
This paper presents validation and evaluation of mobile VoIP support over WiMAX networks using the FMIPv6-based cross layer handover scheme. A software module has been implemented for the FMIPv6-based handoff scheme. The handoff delay components are formulated. To evaluate its support of mobile VoIP, we carefully assess the handoff delay, the total delay, and the R factor which is a representation of voice user satisfactory degree. Simulation results show that the cross-layering handoff scheme, as compared with the non-cross-layer scheme, successfully decreases layer-3 handoff delay by almost 50%, and is therefore thriving to support mobile VoIP services. We believe this is the first performance evaluation work for the FMIPv6-based cross-layer scheme, and hence an important work for the WiMAX research community.
{"title":"Performance of FMIPv6-based cross-layer handover for supporting mobile VoIP in WiMAX networks","authors":"Heejung Kim, M. Moh","doi":"10.1109/PACRIM.2009.5291368","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291368","url":null,"abstract":"This paper presents validation and evaluation of mobile VoIP support over WiMAX networks using the FMIPv6-based cross layer handover scheme. A software module has been implemented for the FMIPv6-based handoff scheme. The handoff delay components are formulated. To evaluate its support of mobile VoIP, we carefully assess the handoff delay, the total delay, and the R factor which is a representation of voice user satisfactory degree. Simulation results show that the cross-layering handoff scheme, as compared with the non-cross-layer scheme, successfully decreases layer-3 handoff delay by almost 50%, and is therefore thriving to support mobile VoIP services. We believe this is the first performance evaluation work for the FMIPv6-based cross-layer scheme, and hence an important work for the WiMAX research community.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133539915","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291401
T. Gunaratne, L. Bruton
A new polyphase architecture is proposed for the beam-forming of far-field temporally-broadband-bandpass signals received by an array of arbitrarily placed sensors. The sensor signals are demodulated using an array of synchronous mixers prior to temporal sampling using an array of time-interleaved analog-to-digital converters (TI-ADCs). The sampled data sequences are processed with a novel polyphase FIR filter structure to form the beamformer output. The filter coefficients are determined using a combination of design methods that involve modal subspace decomposition (MSD), bandpass filtering and polyphase noble identities. The proposed method achieves significantly lower sampling rates and operational clock rates compared to the direct-form implementation.
{"title":"A polyphase architecture for broadband bandpass beamforming for arrays of arbitrarily placed sensors","authors":"T. Gunaratne, L. Bruton","doi":"10.1109/PACRIM.2009.5291401","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291401","url":null,"abstract":"A new polyphase architecture is proposed for the beam-forming of far-field temporally-broadband-bandpass signals received by an array of arbitrarily placed sensors. The sensor signals are demodulated using an array of synchronous mixers prior to temporal sampling using an array of time-interleaved analog-to-digital converters (TI-ADCs). The sampled data sequences are processed with a novel polyphase FIR filter structure to form the beamformer output. The filter coefficients are determined using a combination of design methods that involve modal subspace decomposition (MSD), bandpass filtering and polyphase noble identities. The proposed method achieves significantly lower sampling rates and operational clock rates compared to the direct-form implementation.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132089583","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 : 2009-10-23DOI: 10.1109/PACRIM.2009.5291255
H. Puder
In order to reduce interfering signal components for hearing aids, a complete noise reduction system is described which consists of monaural and binaural beam-formers and a single channel noise reduction for further enhancement. Firstly, the monaural part combines the two or three microphones of each side of the head to adaptively suppress non desired sources outside the line of sight. Secondly, binaural approaches combine the output signals of both beamformers to further reduce the interfering components. Finally, the single channel noise reduction systems suppress longer-term stationary and transient signals, independent of their spatial characteristics.
{"title":"Acoustic noise control: An overview of several methods based on applications in hearing aids","authors":"H. Puder","doi":"10.1109/PACRIM.2009.5291255","DOIUrl":"https://doi.org/10.1109/PACRIM.2009.5291255","url":null,"abstract":"In order to reduce interfering signal components for hearing aids, a complete noise reduction system is described which consists of monaural and binaural beam-formers and a single channel noise reduction for further enhancement. Firstly, the monaural part combines the two or three microphones of each side of the head to adaptively suppress non desired sources outside the line of sight. Secondly, binaural approaches combine the output signals of both beamformers to further reduce the interfering components. Finally, the single channel noise reduction systems suppress longer-term stationary and transient signals, independent of their spatial characteristics.","PeriodicalId":217751,"journal":{"name":"2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132440816","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
扫码关注我们
求助内容：
应助结果提醒方式：