Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627015
Shyi-Tsong Wu, J. Chiu, Bin-Chang Chieu
Elliptic curve cryptography sustains equal security for afar small key size. Recently the pairings operations on elliptic curve have received considerable attention. In this paper, we apply the cryptographic primitive of pairings on elliptic curve to a remote password authentication scheme with smart cards. The proposed pairing-based remote authentication scheme requires no password table to verify the legitimacy of the login user and allows the users to choose and change their password. The distributed remote hosts do not need the knowledge of the secret of the key information center to authenticate the legitimacy of the users. It enhances the flexibility of the remote authentication scheme
{"title":"ID-based remote authentication with smart cards on open distributed system from elliptic curve cryptography","authors":"Shyi-Tsong Wu, J. Chiu, Bin-Chang Chieu","doi":"10.1109/EIT.2005.1627015","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627015","url":null,"abstract":"Elliptic curve cryptography sustains equal security for afar small key size. Recently the pairings operations on elliptic curve have received considerable attention. In this paper, we apply the cryptographic primitive of pairings on elliptic curve to a remote password authentication scheme with smart cards. The proposed pairing-based remote authentication scheme requires no password table to verify the legitimacy of the login user and allows the users to choose and change their password. The distributed remote hosts do not need the knowledge of the secret of the key information center to authenticate the legitimacy of the users. It enhances the flexibility of the remote authentication scheme","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128780586","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627050
M. Harke, D. Raca, R. Lorenz, E. Schlevensky
A general solution for initial position and magnet polarity estimation on PM machines is presented. The technique is based on carrier frequency signal injection and proves to be fast, simple and parameter insensitive. It is applied to both salient and very low saliency PM synchronous machines of different power levels. An important step to understanding the implementation is to map the saliency and magnet polarity information as a function of rotor position. A state filter topology is proposed to ensure fast, smooth and robust convergence of the initial position and magnet polarity estimation for a SPMSM with an extremely low saliency ratio. Test results demonstrate consistent performance across different machine types
{"title":"Implementation of a fast initial position and magnet polarity estimation for PM synchronous machines in traction and white goods applications","authors":"M. Harke, D. Raca, R. Lorenz, E. Schlevensky","doi":"10.1109/EIT.2005.1627050","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627050","url":null,"abstract":"A general solution for initial position and magnet polarity estimation on PM machines is presented. The technique is based on carrier frequency signal injection and proves to be fast, simple and parameter insensitive. It is applied to both salient and very low saliency PM synchronous machines of different power levels. An important step to understanding the implementation is to map the saliency and magnet polarity information as a function of rotor position. A state filter topology is proposed to ensure fast, smooth and robust convergence of the initial position and magnet polarity estimation for a SPMSM with an extremely low saliency ratio. Test results demonstrate consistent performance across different machine types","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123163689","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627051
G. Srivastava, P. Boustead, J. Chicharo
The topology of a wireless network can have a significant impact on the connectivity, fault tolerance and longevity of a network. Power optimised topology control algorithms including a relative neighbourhood graph (RNG) and a minimum spanning tree (MST) reduce the links in a network topology, while keeping a topology connected. Link redundancy may be critical to cope with faults such as node failures and link disruptions. In this paper, we analyse the fault tolerance of a number of topology control algorithms. We propose a new distributed mechanism to increase the fault tolerance of power optimised topology control algorithms. The proposed mechanism can be used in the case of node failures, where extra link redundancy may be crucial to provide a connected topology. We compare the connectivity, fault tolerance, transmission power and the hop diameter of the proposed approach against RNG, MST and the 'minimum node degree' graphs for different node degree values. Simulations indicates that the proposed approach provides a distributed mechanism to enhance the fault tolerance and connectivity of RNG and MST topology graphs for high node failure rates
{"title":"Link redundancy based connected topologies in ad-hoc networks","authors":"G. Srivastava, P. Boustead, J. Chicharo","doi":"10.1109/EIT.2005.1627051","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627051","url":null,"abstract":"The topology of a wireless network can have a significant impact on the connectivity, fault tolerance and longevity of a network. Power optimised topology control algorithms including a relative neighbourhood graph (RNG) and a minimum spanning tree (MST) reduce the links in a network topology, while keeping a topology connected. Link redundancy may be critical to cope with faults such as node failures and link disruptions. In this paper, we analyse the fault tolerance of a number of topology control algorithms. We propose a new distributed mechanism to increase the fault tolerance of power optimised topology control algorithms. The proposed mechanism can be used in the case of node failures, where extra link redundancy may be crucial to provide a connected topology. We compare the connectivity, fault tolerance, transmission power and the hop diameter of the proposed approach against RNG, MST and the 'minimum node degree' graphs for different node degree values. Simulations indicates that the proposed approach provides a distributed mechanism to enhance the fault tolerance and connectivity of RNG and MST topology graphs for high node failure rates","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126450577","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626999
Chin-ling Chen, Jia-Chun Yu
We propose a new active queue management (AQM) scheme, proportional rate-based control (PRC), which aims to maintain the queue length around the target level by 1) dropping these packets whose arrival rate exceeding the desired rate; 2) using explicit congestion notification (ECN) marking to notify the source to suppress the transmission rate when the virtual queue becomes full. We compare the performance of PRC through simulation with several well-known AQM schemes such as RED, DRED and SRED. The study shows that the proposed scheme is more effective at stabilizing the queue size and responding quickly to traffic change while maintaining negligible loss
{"title":"A proportional rate-based control scheme for active queue management","authors":"Chin-ling Chen, Jia-Chun Yu","doi":"10.1109/EIT.2005.1626999","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626999","url":null,"abstract":"We propose a new active queue management (AQM) scheme, proportional rate-based control (PRC), which aims to maintain the queue length around the target level by 1) dropping these packets whose arrival rate exceeding the desired rate; 2) using explicit congestion notification (ECN) marking to notify the source to suppress the transmission rate when the virtual queue becomes full. We compare the performance of PRC through simulation with several well-known AQM schemes such as RED, DRED and SRED. The study shows that the proposed scheme is more effective at stabilizing the queue size and responding quickly to traffic change while maintaining negligible loss","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114220957","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}
This paper presents a multiresolution image segmentation method based on the discrete wavelet transform and Markov random field (MRF) modeling. A major contribution of this work is to add spatial scalability to the segmentation algorithm producing the same segmentation pattern at different resolutions. This property makes it applicable for scalable object-based wavelet coding. The correlation between different resolutions of pyramid is considered by a multire solution analysis which is incorporated into the objective function of the MRF segmentation algorithm. Examining the corresponding pixels at different resolutions simultaneously enables the algorithm to directly segment the images in the YUV or similar color spaces where luminance is in full resolution and chrominance components are at half resolution. Allowing for smoothness terms in the objective function at different resolutions improves border smoothness and creates visually more pleasing objects/regions, particularly at lower resolutions where downsampling distortions are more visible. In addition to spatial scalability, the proposed algorithm outperforms the standard single and multire solution segmentation algorithms, in both objective and subjective tests
{"title":"Scalable multiresolution color image segmentation with smoothness constraint","authors":"F. Tab, G. Naghdy, A. Mertins","doi":"10.1117/12.633217","DOIUrl":"https://doi.org/10.1117/12.633217","url":null,"abstract":"This paper presents a multiresolution image segmentation method based on the discrete wavelet transform and Markov random field (MRF) modeling. A major contribution of this work is to add spatial scalability to the segmentation algorithm producing the same segmentation pattern at different resolutions. This property makes it applicable for scalable object-based wavelet coding. The correlation between different resolutions of pyramid is considered by a multire solution analysis which is incorporated into the objective function of the MRF segmentation algorithm. Examining the corresponding pixels at different resolutions simultaneously enables the algorithm to directly segment the images in the YUV or similar color spaces where luminance is in full resolution and chrominance components are at half resolution. Allowing for smoothness terms in the objective function at different resolutions improves border smoothness and creates visually more pleasing objects/regions, particularly at lower resolutions where downsampling distortions are more visible. In addition to spatial scalability, the proposed algorithm outperforms the standard single and multire solution segmentation algorithms, in both objective and subjective tests","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115283536","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627019
Aijuan Dong, Honglin Li
A virtual learning environment (VLE) is a set of integrated teaching and learning tools designed to enhance a student's learning experience. Over the last decade, a number of VLEs have been developed and adopted by universities and even high schools. However, we note that the majority learning materials in VLEs are still text-based and multimedia has not been effectively explored in existing VLEs. In this paper, we propose a multimedia access platform for VLEs. A good multimedia access platform should provide efficient access mechanism, interactive learning environment, and rich and relevant learning material at appropriate time. Based on the proposal, multimedia access platform for virtual conferences (MAPVC) has been implemented. This platform integrates videos, PowerPoint slides, HTML files and other public domain data into structured multimedia learning material, which supports random access and flexible search, and optimizes learning by presenting learning materials in multiple channels and at appropriate time
{"title":"Multimedia access platform for virtual learning environment","authors":"Aijuan Dong, Honglin Li","doi":"10.1109/EIT.2005.1627019","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627019","url":null,"abstract":"A virtual learning environment (VLE) is a set of integrated teaching and learning tools designed to enhance a student's learning experience. Over the last decade, a number of VLEs have been developed and adopted by universities and even high schools. However, we note that the majority learning materials in VLEs are still text-based and multimedia has not been effectively explored in existing VLEs. In this paper, we propose a multimedia access platform for VLEs. A good multimedia access platform should provide efficient access mechanism, interactive learning environment, and rich and relevant learning material at appropriate time. Based on the proposal, multimedia access platform for virtual conferences (MAPVC) has been implemented. This platform integrates videos, PowerPoint slides, HTML files and other public domain data into structured multimedia learning material, which supports random access and flexible search, and optimizes learning by presenting learning materials in multiple channels and at appropriate time","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123759892","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626980
Jia Tang, Xi Zhang
In order to support the quality of service (QoS) for data applications in wideband CDMA (W-CDMA) networks, space-time (ST) techniques are developed at the physical layer. The employment of such techniques also plays an important role in cross-layer design for wireless networks. In this paper, we investigate three different channel-feedback adaptation-based space-time systems, including non-adaptive, fast-adaptive, and slow-adaptive schemes. Our analysis reveals the tradeoff between the space-time diversity and channel-feedback adaptation. The improvement of QoS for data transmission can be achieved either by enhancing the space-time diversity or by increasing the channel-feedback. However, the space-time diversity impacts the system throughput more significantly than the channel-feedback adaptation. We also obtain a set of optimal system parameters to achieve the maximum throughput. Both numerical and simulation results show that the enhancement of space-time diversity can increase the system throughput and simplify the higher-layer protocol design using channel-feedback. Also compared are the throughput improvements as taking the feedback cost into account
{"title":"Space-time diversity versus feedback-based channel adaptation in cross-layer design of wireless networks","authors":"Jia Tang, Xi Zhang","doi":"10.1109/EIT.2005.1626980","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626980","url":null,"abstract":"In order to support the quality of service (QoS) for data applications in wideband CDMA (W-CDMA) networks, space-time (ST) techniques are developed at the physical layer. The employment of such techniques also plays an important role in cross-layer design for wireless networks. In this paper, we investigate three different channel-feedback adaptation-based space-time systems, including non-adaptive, fast-adaptive, and slow-adaptive schemes. Our analysis reveals the tradeoff between the space-time diversity and channel-feedback adaptation. The improvement of QoS for data transmission can be achieved either by enhancing the space-time diversity or by increasing the channel-feedback. However, the space-time diversity impacts the system throughput more significantly than the channel-feedback adaptation. We also obtain a set of optimal system parameters to achieve the maximum throughput. Both numerical and simulation results show that the enhancement of space-time diversity can increase the system throughput and simplify the higher-layer protocol design using channel-feedback. Also compared are the throughput improvements as taking the feedback cost into account","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125094530","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627023
Leen-Kiat Soh, T. Blank, L. D. Miller, S. Person
In this paper, we describe an intelligent agent that delivers learning materials adaptively to different students, factoring in the usage history of the learning materials, the student static background profile, and the student dynamic activity profile. Our assumption is that through the interaction of a student going through a learning material (i.e., a topical tutorial, a set of examples, and a set of problems), an agent will be able to capture and utilize the student's activity as the primer to select the appropriate example or problem to administer to the student. In addition, our agent monitors the usage history of the learning materials and derives empirical observations that improve its performance. We have built an end-to-end infrastructure, with a GUI front-end, an agent powered by case-based reasoning, and a multi-database backend. Preliminary experiments based on a comprehensive simulator show the feasibility, correctness, and learning capability of our methodology and system
{"title":"ILMDA: an intelligent learning materials delivery agent and simulation","authors":"Leen-Kiat Soh, T. Blank, L. D. Miller, S. Person","doi":"10.1109/EIT.2005.1627023","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627023","url":null,"abstract":"In this paper, we describe an intelligent agent that delivers learning materials adaptively to different students, factoring in the usage history of the learning materials, the student static background profile, and the student dynamic activity profile. Our assumption is that through the interaction of a student going through a learning material (i.e., a topical tutorial, a set of examples, and a set of problems), an agent will be able to capture and utilize the student's activity as the primer to select the appropriate example or problem to administer to the student. In addition, our agent monitors the usage history of the learning materials and derives empirical observations that improve its performance. We have built an end-to-end infrastructure, with a GUI front-end, an agent powered by case-based reasoning, and a multi-database backend. Preliminary experiments based on a comprehensive simulator show the feasibility, correctness, and learning capability of our methodology and system","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866782","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627049
Min Chen, S. Reichenbach, Jiazheng Shi
This paper proposes techniques to automate unmixing of coeluted chemicals in data produced by comprehensive two-dimensional gas chromatography (GCxGC) coupled with mass spectrometry (MS). The approach consists of three steps: i) measure the pureness of a region of interest, ii) count and locate the peak points of underlying compounds in impure regions, and Hi) unmix the region into pure compounds using parallel factor analysis (PARAFAC). This approach has parametric controls that allow tuning to balance demands for performance and computational efficiency. Experiments with real and simulated data demonstrate the approach is effective in automating the analysis of coelutions in GCxGC/MS
{"title":"Automated unmixing of comprehensive two-dimensional chemical separations with mass spectrometry","authors":"Min Chen, S. Reichenbach, Jiazheng Shi","doi":"10.1109/EIT.2005.1627049","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627049","url":null,"abstract":"This paper proposes techniques to automate unmixing of coeluted chemicals in data produced by comprehensive two-dimensional gas chromatography (GCxGC) coupled with mass spectrometry (MS). The approach consists of three steps: i) measure the pureness of a region of interest, ii) count and locate the peak points of underlying compounds in impure regions, and Hi) unmix the region into pure compounds using parallel factor analysis (PARAFAC). This approach has parametric controls that allow tuning to balance demands for performance and computational efficiency. Experiments with real and simulated data demonstrate the approach is effective in automating the analysis of coelutions in GCxGC/MS","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133399571","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627030
Chi-Chao Chang, T. Hwang
As the Internet becomes omnipresent, people nowadays depend heavily on the on-line services for their shopping and banking transactions. However, users register for on-line services may not like their activities being logged and analyzed by the service providers. Anonymity is essential in the protection of users' privacy, especially now when the Internet is a treacherous place full of embezzlers trying to collect information of others. In 2001, Rivest et al. introduced and formalized the ring signature in which the verifier is convinced that the message must be signed by one of the ring members but is unable to determine which one. Ring signature is very useful for proving membership anonymously. With a ring signature scheme, a paid customer can prove his membership by involving other legitimate users' identity without help from the manager. In this paper, we propose a ring signature scheme based on the El Gamal digital signature scheme that is provably secure against adaptively chosen ciphertext attack
{"title":"Anonymous proof of membership with ring signature","authors":"Chi-Chao Chang, T. Hwang","doi":"10.1109/EIT.2005.1627030","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627030","url":null,"abstract":"As the Internet becomes omnipresent, people nowadays depend heavily on the on-line services for their shopping and banking transactions. However, users register for on-line services may not like their activities being logged and analyzed by the service providers. Anonymity is essential in the protection of users' privacy, especially now when the Internet is a treacherous place full of embezzlers trying to collect information of others. In 2001, Rivest et al. introduced and formalized the ring signature in which the verifier is convinced that the message must be signed by one of the ring members but is unable to determine which one. Ring signature is very useful for proving membership anonymously. With a ring signature scheme, a paid customer can prove his membership by involving other legitimate users' identity without help from the manager. In this paper, we propose a ring signature scheme based on the El Gamal digital signature scheme that is provably secure against adaptively chosen ciphertext attack","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115643409","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
扫码关注我们
求助内容：
应助结果提醒方式：