Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930093
Kanatorn Jindarak, P. Uthayopas
Cloud storage is a massive and public accessible storage available for use on internet. Since the number of users and data access request will be massive, a good performance improvement algorithm is needed. In this work, a technique of using a smart object placement is presented. The model for cloud storage and object placement are discussed. Then, genetic algorithm is used to optimize the placement function to gain a better average access speed for any storage object. The experimental results show an obvious performance increases due to a better object placement. The result of this work can be applied to enhance performance of both private and public storage cloud.
{"title":"Performance improvement of cloud storage using a genetic algorithm based placement","authors":"Kanatorn Jindarak, P. Uthayopas","doi":"10.1109/JCSSE.2011.5930093","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930093","url":null,"abstract":"Cloud storage is a massive and public accessible storage available for use on internet. Since the number of users and data access request will be massive, a good performance improvement algorithm is needed. In this work, a technique of using a smart object placement is presented. The model for cloud storage and object placement are discussed. Then, genetic algorithm is used to optimize the placement function to gain a better average access speed for any storage object. The experimental results show an obvious performance increases due to a better object placement. The result of this work can be applied to enhance performance of both private and public storage cloud.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121165962","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930140
Panya Boonyakulsrirung, T. Suwannasart
Web Services Business Process Execution Language (WS-BPEL) is as an XML-based Web Services composition language for more complex business processes. Mutation Testing is error-based software testing in unit level which indicates efficiency of test suites. Weak mutation testing can reduce execution cost more than typical mutation testing. A few empirical studies identify its test effiectiveness which was also closely to traditional mutation testing. Recently, there is a research which proposes definition of expression mutation operators for WS-BPEL, while the definitions are not completed for WS-BPEL language. Thereafter an investigation had presented more three mutation operators (Identifier replace operators, Activity operators, as well as Exceptional and event operators) which completely cover for WS-BPEL language. This paper provides a comprehensive analysis by using some mutation operators for WS-BPEL that can apply for weak mutation testing and also proposes a framework for generating mutants by using weak mutation technique. The framework can identify dead mutants and live mutants. Moreover the framework can present execution time, mutation score, and test cases effectiveness.
{"title":"A weak mutation testing framework for WS-BPEL","authors":"Panya Boonyakulsrirung, T. Suwannasart","doi":"10.1109/JCSSE.2011.5930140","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930140","url":null,"abstract":"Web Services Business Process Execution Language (WS-BPEL) is as an XML-based Web Services composition language for more complex business processes. Mutation Testing is error-based software testing in unit level which indicates efficiency of test suites. Weak mutation testing can reduce execution cost more than typical mutation testing. A few empirical studies identify its test effiectiveness which was also closely to traditional mutation testing. Recently, there is a research which proposes definition of expression mutation operators for WS-BPEL, while the definitions are not completed for WS-BPEL language. Thereafter an investigation had presented more three mutation operators (Identifier replace operators, Activity operators, as well as Exceptional and event operators) which completely cover for WS-BPEL language. This paper provides a comprehensive analysis by using some mutation operators for WS-BPEL that can apply for weak mutation testing and also proposes a framework for generating mutants by using weak mutation technique. The framework can identify dead mutants and live mutants. Moreover the framework can present execution time, mutation score, and test cases effectiveness.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123762231","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930142
Kiettisak Chanhom, J. Natwichai
Data-duplication is one of the most important issues in the context of information system management. Instead of storing a single real-world object as an entity in an information system, the duplication, storing more than one entity representing a single object, can be occurred. This problem can decrease the quality of service of information systems. In this paper, we propose an efficient approach to detect the duplication based on the RDBMS foundation. Our approach is based on the assumption that the data to be processed have been stored in the RDBMS at the first place. Thus, the proposed approach does not require the data to be imported/exported from the storage. Also, such approach will benefit from the query optimizer of the RDBMS. The experiment results on the TPC-H dataset have been presented to validate such proposed work.
{"title":"An efficient approach for data-duplication detection based on RDBMS","authors":"Kiettisak Chanhom, J. Natwichai","doi":"10.1109/JCSSE.2011.5930142","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930142","url":null,"abstract":"Data-duplication is one of the most important issues in the context of information system management. Instead of storing a single real-world object as an entity in an information system, the duplication, storing more than one entity representing a single object, can be occurred. This problem can decrease the quality of service of information systems. In this paper, we propose an efficient approach to detect the duplication based on the RDBMS foundation. Our approach is based on the assumption that the data to be processed have been stored in the RDBMS at the first place. Thus, the proposed approach does not require the data to be imported/exported from the storage. Also, such approach will benefit from the query optimizer of the RDBMS. The experiment results on the TPC-H dataset have been presented to validate such proposed work.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134069255","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930083
V. Visoottiviseth, Uttapol Jaralrungroj, Ekkachai Phoomrungraungsuk, Pongpak Kultanon
Honeypot is a prominent technology that helps us learn new hacking techniques from attackers and intruders. The much information from multiple Honeypot servers, the more appropriate signatures we can generate. To ease the administrator to manage and monitor trace files from multiple Honeypot servers that are distributed in various locations at the same time, in this paper we design and implement a prototype of log management server to automatically and periodically collect log files from them. Information reported by each Honeypot server will be sent in secure manner to the log management server. The log management server then parses the information into the database server, where users can search for specific information through the web interface, such as searching based on one or two Honeypot servers. Moreover, the geographical distribution of attackers is visualized in the world map by utilizing the WHOIS database and GeoPlot software.
{"title":"Distributed Honeypot log management and visualization of attacker geographical distribution","authors":"V. Visoottiviseth, Uttapol Jaralrungroj, Ekkachai Phoomrungraungsuk, Pongpak Kultanon","doi":"10.1109/JCSSE.2011.5930083","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930083","url":null,"abstract":"Honeypot is a prominent technology that helps us learn new hacking techniques from attackers and intruders. The much information from multiple Honeypot servers, the more appropriate signatures we can generate. To ease the administrator to manage and monitor trace files from multiple Honeypot servers that are distributed in various locations at the same time, in this paper we design and implement a prototype of log management server to automatically and periodically collect log files from them. Information reported by each Honeypot server will be sent in secure manner to the log management server. The log management server then parses the information into the database server, where users can search for specific information through the web interface, such as searching based on one or two Honeypot servers. Moreover, the geographical distribution of attackers is visualized in the world map by utilizing the WHOIS database and GeoPlot software.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116091779","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930119
Silpol Sukswai, K. Piromsopa
We propose Conslide, a new Thai input method for compact mobile devices. To address the complexity of Thai language, our design adopts drawing approach for text input. This results in a smaller keyboard (more area for applications). With appropriate layout, users can input words without lifting finger from the screen, hence the better efficiency. Empirical result shows that the average movement distance and minimal movement time required for each Thai word are comparable to those of the quasi-Kedmanee keyboards such as Droidsans Thai keyboard.
{"title":"Conslide: A Thai soft keyboard for mobile text input","authors":"Silpol Sukswai, K. Piromsopa","doi":"10.1109/JCSSE.2011.5930119","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930119","url":null,"abstract":"We propose Conslide, a new Thai input method for compact mobile devices. To address the complexity of Thai language, our design adopts drawing approach for text input. This results in a smaller keyboard (more area for applications). With appropriate layout, users can input words without lifting finger from the screen, hence the better efficiency. Empirical result shows that the average movement distance and minimal movement time required for each Thai word are comparable to those of the quasi-Kedmanee keyboards such as Droidsans Thai keyboard.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123432224","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930117
Jinman Kim, E. Lee, Jao Sang Lim
This paper presents a new objective visual fatigue measurement system by using one remote camera. In captured image, eye and pupil regions are sequentially detected using some image processing methods. Based on the pupil region, pupil size, pupil accommodation speed, blink frequency, and eye closed duration can be determined. Because more frequent blinks and slower pupil accommodation indicate an increased level of visual fatigue, our system can objectively measure visual fatigue. Also, since there is no need to wear any device, inconvenience may be minimized. Experimental results showed the blink detection accuracy was 98.9% and pupil localization error was 1.9%.
{"title":"A new objective visual fatigue measurement system by using a remote infrared camera","authors":"Jinman Kim, E. Lee, Jao Sang Lim","doi":"10.1109/JCSSE.2011.5930117","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930117","url":null,"abstract":"This paper presents a new objective visual fatigue measurement system by using one remote camera. In captured image, eye and pupil regions are sequentially detected using some image processing methods. Based on the pupil region, pupil size, pupil accommodation speed, blink frequency, and eye closed duration can be determined. Because more frequent blinks and slower pupil accommodation indicate an increased level of visual fatigue, our system can objectively measure visual fatigue. Also, since there is no need to wear any device, inconvenience may be minimized. Experimental results showed the blink detection accuracy was 98.9% and pupil localization error was 1.9%.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123005568","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930078
Munin Eamopas, Jittat Fakcharoenphol
This paper considers the linear network coding problem when there are k independent source-sink pairs. The problem when k is not bounded, this problem is NP-hard. Recently Iwama, Nishimura, Peterson, Raymond, and Yamashita show that when k is fixed and the field F is fixed, the problem can be solved in polynomial time. One of their key lemmas shows that the number of vertices in the network performing the K encoding operations is at most |F|3k This paper improves the k bound exponentially to k2 |F|2k Since their algorithm's running time depends on this bound exponentially, our bound implies an improved running time.
研究了有k个独立源汇对时的线性网络编码问题。当k无界时，这个问题是np困难的。最近Iwama, Nishimura, Peterson, Raymond, and Yamashita证明当k固定且场F固定时，问题可以在多项式时间内解决。他们的一个关键引理表明，网络中执行K编码操作的顶点数最多为|F|3k。本文将K界指数地改进为k2 |F|2k，因为他们的算法的运行时间指数地依赖于这个界，我们的界暗示了一个改进的运行时间。
{"title":"An improved bound for multiple source-sink linear network coding","authors":"Munin Eamopas, Jittat Fakcharoenphol","doi":"10.1109/JCSSE.2011.5930078","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930078","url":null,"abstract":"This paper considers the linear network coding problem when there are k independent source-sink pairs. The problem when k is not bounded, this problem is NP-hard. Recently Iwama, Nishimura, Peterson, Raymond, and Yamashita show that when k is fixed and the field F is fixed, the problem can be solved in polynomial time. One of their key lemmas shows that the number of vertices in the network performing the K encoding operations is at most |F|3k This paper improves the k bound exponentially to k2 |F|2k Since their algorithm's running time depends on this bound exponentially, our bound implies an improved running time.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123013944","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930097
Yuto Nakai, Kohta Ohshima, Koji Tajima, M. Terada
Wi-Fi access provides a very convenient way for mobile terminals to connect the Internet. However, locating points where connections can be made is not always easy. In this paper, we propose a Neighbor Wi-Fi Access Point Advertisement System. The features of our system are as follows: (1) A personal access point function operates on mobile terminals that continuously detect and collect information on nearby WiFi access points (APs) within its radio detection range. (2) Detected and collected Wi-Fi AP information, such as locations and network names, are shared between mobile terminals in proximity with each other. (3) Neighbor Wi-Fi AP information can then be advertised to clients through their personal access points. In our system, a client is a mobile terminal that does not have access privileges for nearby APs. In such cases, clients will not connect to the Internet through the restricted APs; they will simply obtain information regarding APs that are available nearby, yet outside their normal detection range. We developed a prototype system and have confirmed the usability of its basic functions by experiment.
{"title":"Wi-Fi access point discovery system for mobile users","authors":"Yuto Nakai, Kohta Ohshima, Koji Tajima, M. Terada","doi":"10.1109/JCSSE.2011.5930097","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930097","url":null,"abstract":"Wi-Fi access provides a very convenient way for mobile terminals to connect the Internet. However, locating points where connections can be made is not always easy. In this paper, we propose a Neighbor Wi-Fi Access Point Advertisement System. The features of our system are as follows: (1) A personal access point function operates on mobile terminals that continuously detect and collect information on nearby WiFi access points (APs) within its radio detection range. (2) Detected and collected Wi-Fi AP information, such as locations and network names, are shared between mobile terminals in proximity with each other. (3) Neighbor Wi-Fi AP information can then be advertised to clients through their personal access points. In our system, a client is a mobile terminal that does not have access privileges for nearby APs. In such cases, clients will not connect to the Internet through the restricted APs; they will simply obtain information regarding APs that are available nearby, yet outside their normal detection range. We developed a prototype system and have confirmed the usability of its basic functions by experiment.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123979058","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930091
Montida Pattaranantaku, Kanyalag Phodong, C. Issariyapat, P. Sangwongngam, R. Kongkachandra
This paper emphasizes the development of network monitoring appliance for monitoring network health, network resources and for further analysis of Quantum Key Distribution (QKD) performance where QKD devices located in different locations. It provides tools and services for end users who enable to view real time QKD performance statistics on the network. As it is very important to keep track of each key parameter involved with device status and QKD temporal evolution to perform traffic analysis and to determine the error probability during the phase of key generation. The system has been developed from a Network Health Analysis and Monitoring system (NetHAM) [1] implemented under an open source platform, offered more features both graphical statistics display and user friendly interface. In addition, this paper proposed a conformance passive monitoring method to analysis the QKD performance. The log from QKD layer has been converted to well organized database format before storing it in the database server. The relevant information will be invoked for network topology display, link and device status that would be helpful for end user can easily view the QKD performance with frequently updated through the dynamic graphical display and for further historical data analysis.
{"title":"Passive monitoring method for analysis Quantum Key Distribution performance statistics","authors":"Montida Pattaranantaku, Kanyalag Phodong, C. Issariyapat, P. Sangwongngam, R. Kongkachandra","doi":"10.1109/JCSSE.2011.5930091","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930091","url":null,"abstract":"This paper emphasizes the development of network monitoring appliance for monitoring network health, network resources and for further analysis of Quantum Key Distribution (QKD) performance where QKD devices located in different locations. It provides tools and services for end users who enable to view real time QKD performance statistics on the network. As it is very important to keep track of each key parameter involved with device status and QKD temporal evolution to perform traffic analysis and to determine the error probability during the phase of key generation. The system has been developed from a Network Health Analysis and Monitoring system (NetHAM) [1] implemented under an open source platform, offered more features both graphical statistics display and user friendly interface. In addition, this paper proposed a conformance passive monitoring method to analysis the QKD performance. The log from QKD layer has been converted to well organized database format before storing it in the database server. The relevant information will be invoked for network topology display, link and device status that would be helpful for end user can easily view the QKD performance with frequently updated through the dynamic graphical display and for further historical data analysis.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129537128","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930152
Kawin Wattanatchariya, Satapond Chuchuaikam, N. Dejdumrong
An educational game for learning gravity theory is developed on iOS technology, called "Drop Donuts". The goal of this game is to feed a monster on the island at the bottom of the screen by dropping donuts. While the wind speed and direction keeps changing all the time, a donut is dropped. Flowing leaves will be a hint to the players in the determination of the wind direction and speed. This will affect to the donut in following away. This game is developed using a tool called "GameSalad". The result is an edutainment game which provides both fun and physics concept. Furthermore, the wind simulation is implemented and deployed onto iPhone or iPad devices.
{"title":"An educational game for learning wind and gravity theory on iOS: Drop donuts","authors":"Kawin Wattanatchariya, Satapond Chuchuaikam, N. Dejdumrong","doi":"10.1109/JCSSE.2011.5930152","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930152","url":null,"abstract":"An educational game for learning gravity theory is developed on iOS technology, called \"Drop Donuts\". The goal of this game is to feed a monster on the island at the bottom of the screen by dropping donuts. While the wind speed and direction keeps changing all the time, a donut is dropped. Flowing leaves will be a hint to the players in the determination of the wind direction and speed. This will affect to the donut in following away. This game is developed using a tool called \"GameSalad\". The result is an edutainment game which provides both fun and physics concept. Furthermore, the wind simulation is implemented and deployed onto iPhone or iPad devices.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124023564","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
扫码关注我们
求助内容：
应助结果提醒方式：