Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287327
Chih-Ming Chen, Ling-Jiun Duh, Chao-Yu Liu
With the rapid growth of computer and Internet technologies, e-learning has become a major trend in the computer assisted teaching and learning field currently. In past years, many researchers made efforts in developing e-learning systems with personalized learning mechanism to assist on-line learning. However, most of them focused on using learner's behaviors, interests, or habits to provide personalized e-learning services. These systems usually neglected to concern if learner's ability and the difficulty of courseware are matched each other. Generally, recommending an inappropriate courseware might result in learner's cognitive overhead or disorientation during a learning process. To promote learning efficiency and effectiveness, we present a personalized courseware recommendation system (PCRS) based on the proposed fuzzy item response theory (FIRT), which can recommend courseware with appropriate difficult level to learner through learner gives a fuzzy response of understanding percentage for the learned courseware. Experiment results show that applying the proposed fuzzy item response theory to Web-based learning can achieve personalized learning and help learners to learn more effectively and efficiently.
{"title":"A personalized courseware recommendation system based on fuzzy item response theory","authors":"Chih-Ming Chen, Ling-Jiun Duh, Chao-Yu Liu","doi":"10.1109/EEE.2004.1287327","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287327","url":null,"abstract":"With the rapid growth of computer and Internet technologies, e-learning has become a major trend in the computer assisted teaching and learning field currently. In past years, many researchers made efforts in developing e-learning systems with personalized learning mechanism to assist on-line learning. However, most of them focused on using learner's behaviors, interests, or habits to provide personalized e-learning services. These systems usually neglected to concern if learner's ability and the difficulty of courseware are matched each other. Generally, recommending an inappropriate courseware might result in learner's cognitive overhead or disorientation during a learning process. To promote learning efficiency and effectiveness, we present a personalized courseware recommendation system (PCRS) based on the proposed fuzzy item response theory (FIRT), which can recommend courseware with appropriate difficult level to learner through learner gives a fuzzy response of understanding percentage for the learned courseware. Experiment results show that applying the proposed fuzzy item response theory to Web-based learning can achieve personalized learning and help learners to learn more effectively and efficiently.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126450437","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287343
M. Fetscherin, Sabrina Zaugg
Content providers from the music industry argue that peer-to-peer (P2P) networks such as KaZaA, Morpheus, iMesh, or Audiogalaxy are an enormous threat to their business. They furthermore blame these networks for their recent decline in sales figures. For this reason, an empirical investigation was conducted during a period of 6 weeks on one of the most popular files-sharing systems, in order to determine the quantity and quality of pirated music songs shared. We present empirical evidence as to what extent and in which quality music songs are being shared. A number of hypotheses are outlined and were tested. We studied, among other things, the number of users online and the number of flies accessible on such networks, the free riding problem, and the duration per search request. We further tested to see if there are any differences in the accessibility of songs based on the nationality of the artist, the language of the song, and the corresponding chart position. Finally, we outline the main hurdles users may face when downloading illegal music and the probability of obtaining high quality music tracks on such peer-to-peer networks.
{"title":"Music piracy on peer-to-peer networks","authors":"M. Fetscherin, Sabrina Zaugg","doi":"10.1109/EEE.2004.1287343","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287343","url":null,"abstract":"Content providers from the music industry argue that peer-to-peer (P2P) networks such as KaZaA, Morpheus, iMesh, or Audiogalaxy are an enormous threat to their business. They furthermore blame these networks for their recent decline in sales figures. For this reason, an empirical investigation was conducted during a period of 6 weeks on one of the most popular files-sharing systems, in order to determine the quantity and quality of pirated music songs shared. We present empirical evidence as to what extent and in which quality music songs are being shared. A number of hypotheses are outlined and were tested. We studied, among other things, the number of users online and the number of flies accessible on such networks, the free riding problem, and the duration per search request. We further tested to see if there are any differences in the accessibility of songs based on the nationality of the artist, the language of the song, and the corresponding chart position. Finally, we outline the main hurdles users may face when downloading illegal music and the probability of obtaining high quality music tracks on such peer-to-peer networks.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126554569","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287342
F. Wu, Jie Lu, Guangquan Zhang
A new approximate algorithm has been developed by Wu et al. for solving fuzzy multiple objective linear programming (FMOLP) problems with fuzzy parameters in any form of membership function in both objective functions and constraints. Based on the approximate algorithm, a fuzzy multiple objective decision support system (FMODSS) is developed. We focus on the description of use for FMODSS in detail, and an example is presented for demonstrating how to solve a FMOLP problem by the FMODSS.
{"title":"A decision support system for multiple objective linear programming","authors":"F. Wu, Jie Lu, Guangquan Zhang","doi":"10.1109/EEE.2004.1287342","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287342","url":null,"abstract":"A new approximate algorithm has been developed by Wu et al. for solving fuzzy multiple objective linear programming (FMOLP) problems with fuzzy parameters in any form of membership function in both objective functions and constraints. Based on the approximate algorithm, a fuzzy multiple objective decision support system (FMODSS) is developed. We focus on the description of use for FMODSS in detail, and an example is presented for demonstrating how to solve a FMOLP problem by the FMODSS.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127929038","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287292
Hsiu-Mei Huang, S. Liaw
E-commerce Websites often use animation, video, music and other multimedia effects to capture customers' attention. Thus, the design of a commercial Website plays an important role in attracting, sustaining and retaining the interest of a customer at a Web site. As we know, successful Web design gives high accessibility to anyone who visits the Website with Web browsers. With an increased percentage of the population using the Internet, Web surveys are particularly effective and useful to collect data for e-commerce. Whenever Web surveys are present and available, a potential threat to research exists due to the lack of sampling control. However, the use of access control might arouse potential suspicions about anonymity and confidentiality for respondents. To ensure validity and reliability, there is a need to view this dilemma along with its two accompanying issues: (1) sampling control, and (2) anonymous responses.
{"title":"Web surveys for electronic commerce: a review of the literature","authors":"Hsiu-Mei Huang, S. Liaw","doi":"10.1109/EEE.2004.1287292","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287292","url":null,"abstract":"E-commerce Websites often use animation, video, music and other multimedia effects to capture customers' attention. Thus, the design of a commercial Website plays an important role in attracting, sustaining and retaining the interest of a customer at a Web site. As we know, successful Web design gives high accessibility to anyone who visits the Website with Web browsers. With an increased percentage of the population using the Internet, Web surveys are particularly effective and useful to collect data for e-commerce. Whenever Web surveys are present and available, a potential threat to research exists due to the lack of sampling control. However, the use of access control might arouse potential suspicions about anonymity and confidentiality for respondents. To ensure validity and reliability, there is a need to view this dilemma along with its two accompanying issues: (1) sampling control, and (2) anonymous responses.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115208908","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287285
Z. Maamar, S. Mostéfaoui, Emad Bataineh
We discuss the role of conversations in the composition of Web services. A Web service is an accessible application that other applications and humans can discover and trigger to satisfy needs. While much of the work has focused on low-level standards for publishing, discovering, and invoking Web services, it is deemed appropriate to start leveraging the Web services to the level of active components. Such components would be able for example to engage conversations and make decisions.
{"title":"A conceptual analysis of the role of conversations in Web services composition","authors":"Z. Maamar, S. Mostéfaoui, Emad Bataineh","doi":"10.1109/EEE.2004.1287285","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287285","url":null,"abstract":"We discuss the role of conversations in the composition of Web services. A Web service is an accessible application that other applications and humans can discover and trigger to satisfy needs. While much of the work has focused on low-level standards for publishing, discovering, and invoking Web services, it is deemed appropriate to start leveraging the Web services to the level of active components. Such components would be able for example to engage conversations and make decisions.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126053213","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287311
Show-Jane Yen, Yue-Shi Lee, Chung-Wen Cho
Mining frequent traversal patterns is to discover the consecutive reference paths traversed by a sufficient number of users from Web logs. The previous approaches for mining frequent traversal patterns need to repeatedly scan the traversal paths and take a large amount of computation time to find frequent traversal patterns. However, the discovered frequent traversal patterns may become invalid or inappropriate when the databases are updated. We propose an incremental updating technique to maintain the discovered frequent traversal patterns when the user sequences are inserted into or the database. Our approach partitions the database into some segments and scans the database segment by segment. For each segment scan, the candidate traversal sequences that cannot be frequent traversal sequences can be pruned and the frequent traversal sequences can be found out earlier. Besides, the number of database scans can be significantly reduced because some information can be computed by our approach. The experimental results show that our algorithms are more efficient than other algorithms for the maintenance of mining frequent traversal patterns.
{"title":"An efficient approach for the maintenance of path traversal patterns","authors":"Show-Jane Yen, Yue-Shi Lee, Chung-Wen Cho","doi":"10.1109/EEE.2004.1287311","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287311","url":null,"abstract":"Mining frequent traversal patterns is to discover the consecutive reference paths traversed by a sufficient number of users from Web logs. The previous approaches for mining frequent traversal patterns need to repeatedly scan the traversal paths and take a large amount of computation time to find frequent traversal patterns. However, the discovered frequent traversal patterns may become invalid or inappropriate when the databases are updated. We propose an incremental updating technique to maintain the discovered frequent traversal patterns when the user sequences are inserted into or the database. Our approach partitions the database into some segments and scans the database segment by segment. For each segment scan, the candidate traversal sequences that cannot be frequent traversal sequences can be pruned and the frequent traversal sequences can be found out earlier. Besides, the number of database scans can be significantly reduced because some information can be computed by our approach. The experimental results show that our algorithms are more efficient than other algorithms for the maintenance of mining frequent traversal patterns.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"2451 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130951234","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287297
J. Chen, Yangil Park
Trust and privacy have been widely recognized as important issues in the field of electronic commerce. We propose a research model with trust and privacy as two endogenous variables along with other exogenous variables like independent self-construal, interdependent self-construal, technological knowledge, and Web site quality, that are expected to effect Internet consumers' trust level and privacy concerns.
{"title":"Trust and privacy in electronic commerce","authors":"J. Chen, Yangil Park","doi":"10.1109/EEE.2004.1287297","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287297","url":null,"abstract":"Trust and privacy have been widely recognized as important issues in the field of electronic commerce. We propose a research model with trust and privacy as two endogenous variables along with other exogenous variables like independent self-construal, interdependent self-construal, technological knowledge, and Web site quality, that are expected to effect Internet consumers' trust level and privacy concerns.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127238998","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287307
Jeng-Jong Lin
The development of a remote quick design system is presented. The system can access through the Web, which can be used to quickly generate an optimized set of weaving parameters. The developed system is a client/server configuration where Web browsers were used as a generic client environment serving interface linking the client's parameter input to the search system located on the server side through the common gateway interface. The searching mechanism, developed in Turbo C programming environment and theory based on genetic algorithm, can find several desired solutions of the weaving parameters for the production of woven fabrics under controlled cost through access to the Web side. Moreover, the search mechanism was implemented by integrating the Internet information server 3.0 (IIS 3.0) Web server and a user interface was developed and underlying 2000 server platform. Through the assistance of this Web-based system the weaving mill can integrate the resource of different divisions (e.g. design division, production division and financial division) located at various areas on the earth to fulfill a perfect design of woven fabrics and enhance the enterprise's global competition power.
{"title":"Development of a remote quick design system for woven fabrics","authors":"Jeng-Jong Lin","doi":"10.1109/EEE.2004.1287307","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287307","url":null,"abstract":"The development of a remote quick design system is presented. The system can access through the Web, which can be used to quickly generate an optimized set of weaving parameters. The developed system is a client/server configuration where Web browsers were used as a generic client environment serving interface linking the client's parameter input to the search system located on the server side through the common gateway interface. The searching mechanism, developed in Turbo C programming environment and theory based on genetic algorithm, can find several desired solutions of the weaving parameters for the production of woven fabrics under controlled cost through access to the Web side. Moreover, the search mechanism was implemented by integrating the Internet information server 3.0 (IIS 3.0) Web server and a user interface was developed and underlying 2000 server platform. Through the assistance of this Web-based system the weaving mill can integrate the resource of different divisions (e.g. design division, production division and financial division) located at various areas on the earth to fulfill a perfect design of woven fabrics and enhance the enterprise's global competition power.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133893588","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287363
A. Leong, S. Fong, Shirley W. I. Siu
This paper describes a smart-card based solution that further extends the concept of static access control list by performing real-time analysis over user's access patterns, thus allowing early detection of abnormal card usages. A list of irregular behaviors are identified and classified to formulate a logical model that quantifies abnormal usage behaviors. Based on this model, a real-time suspicious action detection prototype is developed, allowing rapid alert and reaction towards irregular behaviors. Finally, example scenarios on some applications on electronic commerce are discussed.
{"title":"Smart card-based irregular access patterns detection system","authors":"A. Leong, S. Fong, Shirley W. I. Siu","doi":"10.1109/EEE.2004.1287363","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287363","url":null,"abstract":"This paper describes a smart-card based solution that further extends the concept of static access control list by performing real-time analysis over user's access patterns, thus allowing early detection of abnormal card usages. A list of irregular behaviors are identified and classified to formulate a logical model that quantifies abnormal usage behaviors. Based on this model, a real-time suspicious action detection prototype is developed, allowing rapid alert and reaction towards irregular behaviors. Finally, example scenarios on some applications on electronic commerce are discussed.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123860588","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 : 2004-03-28DOI: 10.1109/EEE.2004.1287332
Byung kwan Lee, Tai-Chi Lee, S. Yang
Unlike SET (secure electronic transaction) protocol. We propose an ASEP (advanced secure electronic payment) protocol, which uses ECC (elliptic curve cryptosystem with F/sub 2/ not F/sub p/) [N. Koblitz, (1987), V. S Miler, (1986), G. Harper et al., (1993)], SHA (secure hash algorithm) and 3BC (block byte bit cipher) instead of RSA and DES. To improve the strength of encryption and the speed of processing, the public key and the private key of ECC are used in SBC [I. S. Cho (2002)] algorithm, which generates session keys for the data encryption. In particular, when ECC is combined with SBC, the strength of security is improved significantly. As the process of the digital envelope used in the existing SET protocol is removed by the SBC algorithm, the processing time is substantially reduced. In addition, the use of multiple signatures has some advantages of reducing the size of transmission data as an intermediate payment agent and avoiding the danger of eavesdropping of private keys.
不像SET(安全电子交易)协议。本文提出了一种采用ECC (F/sub 2/ not F/sub p/) [N]的高级安全电子支付(ASEP)协议。Koblitz， (1987)， V. S miller， (1986)， G. Harper et al.， (1993)]， SHA(安全哈希算法)和3BC(块字节位密码)代替RSA和DES。为了提高加密的强度和处理速度，在SBC中使用了ECC的公钥和私钥[I]。S. Cho(2002)]算法，该算法生成用于数据加密的会话密钥。特别是当ECC与SBC结合使用时，安全强度明显提高。由于SBC算法去掉了现有SET协议中使用的数字包络的处理过程，大大缩短了处理时间。此外，多重签名的使用还具有作为中间支付代理减少传输数据大小、避免私钥被窃听的危险等优点。
{"title":"An ASEP (advanced secure electronic payment) protocol design using 3BC and ECC(F/sub 2//sup m/) algorithm","authors":"Byung kwan Lee, Tai-Chi Lee, S. Yang","doi":"10.1109/EEE.2004.1287332","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287332","url":null,"abstract":"Unlike SET (secure electronic transaction) protocol. We propose an ASEP (advanced secure electronic payment) protocol, which uses ECC (elliptic curve cryptosystem with F/sub 2/ not F/sub p/) [N. Koblitz, (1987), V. S Miler, (1986), G. Harper et al., (1993)], SHA (secure hash algorithm) and 3BC (block byte bit cipher) instead of RSA and DES. To improve the strength of encryption and the speed of processing, the public key and the private key of ECC are used in SBC [I. S. Cho (2002)] algorithm, which generates session keys for the data encryption. In particular, when ECC is combined with SBC, the strength of security is improved significantly. As the process of the digital envelope used in the existing SET protocol is removed by the SBC algorithm, the processing time is substantially reduced. In addition, the use of multiple signatures has some advantages of reducing the size of transmission data as an intermediate payment agent and avoiding the danger of eavesdropping of private keys.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128579186","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
扫码关注我们
求助内容：
应助结果提醒方式：