Pub Date : 2011-12-31DOI: 10.3745/KIPSTD.2011.18D.6.501
Bo-Seok Jung, Yung-Keun Kwon, Seung-Jin Kwak
A knowledge map, which has been recently applied in various fields, is discovering characteristics hidden in a large amount of information and showing a tangible output to understand the meaning of the discovery. In this paper, we suggested a knowledge map for research trend analysis based on keyword-relation networks which are constructed by using a database of the domestic journal articles in the computer engineering field from 2000 through 2010. From that knowledge map, we could infer influential changes of a research topic related a specific keyword through examining the change of sizes of the connected components to which the keyword belongs in the keyword-relation networks. In addition, we observed that the size of the largest connected component in the keyword-relation networks is relatively small and groups of high-similarity keyword pairs are clustered in them by comparison with the random networks. This implies that the research field corresponding to the largest connected component is not so huge and many small-scale topics included in it are highly clustered and loosely-connected to each other. our proposed knowledge map can be considered as a approach for the research trend analysis while it is impossible to obtain those results by conventional approaches such as analyzing the frequency of an individual keyword.
{"title":"A Knowledge Map Based on a Keyword-Relation Network by Using a Research Paper Database in the Computer Engineering Field","authors":"Bo-Seok Jung, Yung-Keun Kwon, Seung-Jin Kwak","doi":"10.3745/KIPSTD.2011.18D.6.501","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.501","url":null,"abstract":"A knowledge map, which has been recently applied in various fields, is discovering characteristics hidden in a large amount of information and showing a tangible output to understand the meaning of the discovery. In this paper, we suggested a knowledge map for research trend analysis based on keyword-relation networks which are constructed by using a database of the domestic journal articles in the computer engineering field from 2000 through 2010. From that knowledge map, we could infer influential changes of a research topic related a specific keyword through examining the change of sizes of the connected components to which the keyword belongs in the keyword-relation networks. In addition, we observed that the size of the largest connected component in the keyword-relation networks is relatively small and groups of high-similarity keyword pairs are clustered in them by comparison with the random networks. This implies that the research field corresponding to the largest connected component is not so huge and many small-scale topics included in it are highly clustered and loosely-connected to each other. our proposed knowledge map can be considered as a approach for the research trend analysis while it is impossible to obtain those results by conventional approaches such as analyzing the frequency of an individual keyword.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117326347","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-12-31DOI: 10.3745/KIPSTD.2011.18D.6.451
Dae-Yeob Kim, C. Youn
The ability to trace change history and dependency relations of software artifacts which are continuously changed has been recognized as an important factor that support quality management activities such as verification, validation, and testing in software system development process. General software configuration management systems provide tracing information for artifacts only within the configuration management system, and it does not go further to changes that occur within personal workspace. This paper provides a solution that helps tracing down not only changes of configuration items but also change history of artifacts existent in personal workspace through the integration of configuration management system and personal workspace. Furthermore, in cases of artifacts which are included in a configuration item, this paper provides a solution that support tracing dependency relations between the artifacts by identifying their version links. For the integration of configuration management system and personal workspace, a revision of configuration item is connected to the artifact`s version of the workspace by the tagging mechanism, and traceability for change history and dependency relations of artifacts can be managed more effectively through integrated change process.
{"title":"Traceability Enhancement Technique for Dependency Relations of Software Artifacts based on the Integration of Software Configuration Management System and Personal Workspace","authors":"Dae-Yeob Kim, C. Youn","doi":"10.3745/KIPSTD.2011.18D.6.451","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.451","url":null,"abstract":"The ability to trace change history and dependency relations of software artifacts which are continuously changed has been recognized as an important factor that support quality management activities such as verification, validation, and testing in software system development process. General software configuration management systems provide tracing information for artifacts only within the configuration management system, and it does not go further to changes that occur within personal workspace. This paper provides a solution that helps tracing down not only changes of configuration items but also change history of artifacts existent in personal workspace through the integration of configuration management system and personal workspace. Furthermore, in cases of artifacts which are included in a configuration item, this paper provides a solution that support tracing dependency relations between the artifacts by identifying their version links. For the integration of configuration management system and personal workspace, a revision of configuration item is connected to the artifact`s version of the workspace by the tagging mechanism, and traceability for change history and dependency relations of artifacts can be managed more effectively through integrated change process.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134584420","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-12-31DOI: 10.3745/KIPSTD.2011.18D.6.423
Chong-Hyeon Lee, Jang-won Kim, Dongwon Jeong, Sukhoon Lee, D. Baik
In this paper, we introduce XOnto-Apriori algorithm which is an extension of the Onto-Apriori algorithm. The extended algorithm is designed to improve the conventional algorithm`s problem of comparing only identifiers of transaction items by reasoning transaction properties of the items which belong in the same category. We show how the mining algorithm works with a smartphone application recommender system based on our extended algorithm to clearly describe the procedures providing personalized recommendations. Further, our simulation results validate our analysis on the algorithm overhead, precision, and recall.
{"title":"XOnto-Apriori: An eXtended Ontology Reasoning-based Association Rule Mining Algorithm","authors":"Chong-Hyeon Lee, Jang-won Kim, Dongwon Jeong, Sukhoon Lee, D. Baik","doi":"10.3745/KIPSTD.2011.18D.6.423","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.423","url":null,"abstract":"In this paper, we introduce XOnto-Apriori algorithm which is an extension of the Onto-Apriori algorithm. The extended algorithm is designed to improve the conventional algorithm`s problem of comparing only identifiers of transaction items by reasoning transaction properties of the items which belong in the same category. We show how the mining algorithm works with a smartphone application recommender system based on our extended algorithm to clearly describe the procedures providing personalized recommendations. Further, our simulation results validate our analysis on the algorithm overhead, precision, and recall.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115045874","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}
The trends of technical terms express the changes of particular subjects in a specific research field over time. However, the amount of academic literature and patent data is too large to be analyzed by human resources. In this paper, we propose a method that can detect and analyze the trends of terms by modeling the life cycle of the terms. The proposed method is composed of the following steps. First, the technical terms are extracted from academic literature data, and the TDVs(Term Dominance Values) of terms are computed on a periodic basis. Based on the TDVs, the life cycles of terms are modeled, and technical terms with similar temporal patterns of the life cycles are classified into the same trends class. The experiments shown in this paper is performed by exploiting the NDSL academic literature data maintained by KISTI.
{"title":"Trend Analysis of Technical Terms Using Term Life Cycle Modeling","authors":"Mi-Nyeong Hwang, Min-Hee Cho, Myunggwon Hwang, Do-Heon Jeong","doi":"10.3745/KIPSTD.2011.18D.6.493","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.493","url":null,"abstract":"The trends of technical terms express the changes of particular subjects in a specific research field over time. However, the amount of academic literature and patent data is too large to be analyzed by human resources. In this paper, we propose a method that can detect and analyze the trends of terms by modeling the life cycle of the terms. The proposed method is composed of the following steps. First, the technical terms are extracted from academic literature data, and the TDVs(Term Dominance Values) of terms are computed on a periodic basis. Based on the TDVs, the life cycles of terms are modeled, and technical terms with similar temporal patterns of the life cycles are classified into the same trends class. The experiments shown in this paper is performed by exploiting the NDSL academic literature data maintained by KISTI.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114808607","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-12-31DOI: 10.3745/KIPSTD.2011.18D.6.461
D. Cheun, Sungsook Jo, Soo Dong Kim
Component-Based Development (CBD) focuses on developing reusable components and assembling them into target applications. Service-Oriented Computing (SOC) is a relatively new paradigm where reusable services are developed, published, and composed into target service applications. Due to the popularity of CBD, many organizations already have CBD models for their applications. Hence, it is feasible and appealing to develop SOC applications economically by transforming existing CBD models, rather than developing SOC applications from the scratch. Our research is to develop a methodology for transforming existing CBD design into Service-Oriented Architecture (SOA) design. In this paper, we first compare the two paradigms and their key elements for the design; CBD design and SOA design. Then, we define mapping relationships of the transformation. For each transformation mapping, we present step-wise instructions. The benefit of applying this transformation is to increase reusability of existing design assets, to maintain the consistency between existing CBD and SOC models, and reduced cost for deploying service-oriented applications.
{"title":"A Practical Method to Transform Component-based Design to Service-Oriented Design","authors":"D. Cheun, Sungsook Jo, Soo Dong Kim","doi":"10.3745/KIPSTD.2011.18D.6.461","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.461","url":null,"abstract":"Component-Based Development (CBD) focuses on developing reusable components and assembling them into target applications. Service-Oriented Computing (SOC) is a relatively new paradigm where reusable services are developed, published, and composed into target service applications. Due to the popularity of CBD, many organizations already have CBD models for their applications. Hence, it is feasible and appealing to develop SOC applications economically by transforming existing CBD models, rather than developing SOC applications from the scratch. Our research is to develop a methodology for transforming existing CBD design into Service-Oriented Architecture (SOA) design. In this paper, we first compare the two paradigms and their key elements for the design; CBD design and SOA design. Then, we define mapping relationships of the transformation. For each transformation mapping, we present step-wise instructions. The benefit of applying this transformation is to increase reusability of existing design assets, to maintain the consistency between existing CBD and SOC models, and reduced cost for deploying service-oriented applications.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127648030","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-12-31DOI: 10.3745/KIPSTD.2011.18D.6.443
Hoon Jang, M. Park, Yunja Choi
Model-based Component development methodologies consider the whole system as an component and develop physical components through recursive decomposition and refinements of components in a top-down manner. We developed a model translator that can be used to formally verify interaction consistency among components, especially the interaction behavior between before- and after- refinements of components. This translator can be used to identify potential problems in the refinement process so that problems can be addressed from the early stage of development. This paper introduces our translation approach and the organization of the translator. The translator has been applied to two case studies to show its usefulness.
{"title":"A Model Translator for Checking Behavioral Consistency of Abstract Components","authors":"Hoon Jang, M. Park, Yunja Choi","doi":"10.3745/KIPSTD.2011.18D.6.443","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.443","url":null,"abstract":"Model-based Component development methodologies consider the whole system as an component and develop physical components through recursive decomposition and refinements of components in a top-down manner. We developed a model translator that can be used to formally verify interaction consistency among components, especially the interaction behavior between before- and after- refinements of components. This translator can be used to identify potential problems in the refinement process so that problems can be addressed from the early stage of development. This paper introduces our translation approach and the organization of the translator. The translator has been applied to two case studies to show its usefulness.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123906651","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-12-31DOI: 10.3745/KIPSTD.2011.18D.6.433
Yong-Kyun Cho, Yong-ik Bak, Young-Bom Park
As software is varied and grew in size, the importance of clear understanding and representing customer`s need, has been emphasized. It is not easy to drive and define critical system needs, since requirements in early stage of the development, is and conceptual. Technical perspective view, Several theoretical analysis methods and validation techniques are introduced, but in practice, it is hard to drive clear customer`s requirement. In this paper, to drive clear customer`s requirements, Macrostruktur concept of textlinguistics is used. First, Macrostruktur of textlinguistics is used to analysis descriptive requirements. Second, Macrostruktur-rule is applied to analyzed Macrostruktur data in order to derive Macrostruktur-propositions. Finally, it is proposed to generating Use-case model using derived Macrostruktur-propositions.
{"title":"Requirements analysis and Use-case realization using Macrostruktur","authors":"Yong-Kyun Cho, Yong-ik Bak, Young-Bom Park","doi":"10.3745/KIPSTD.2011.18D.6.433","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.433","url":null,"abstract":"As software is varied and grew in size, the importance of clear understanding and representing customer`s need, has been emphasized. It is not easy to drive and define critical system needs, since requirements in early stage of the development, is and conceptual. Technical perspective view, Several theoretical analysis methods and validation techniques are introduced, but in practice, it is hard to drive clear customer`s requirement. In this paper, to drive clear customer`s requirements, Macrostruktur concept of textlinguistics is used. First, Macrostruktur of textlinguistics is used to analysis descriptive requirements. Second, Macrostruktur-rule is applied to analyzed Macrostruktur data in order to derive Macrostruktur-propositions. Finally, it is proposed to generating Use-case model using derived Macrostruktur-propositions.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134083743","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-12-31DOI: 10.3745/KIPSTD.2011.18D.6.415
Inteak Kwon, Jongik Kim
Finding similar strings is an important operation because textual data can have errors, duplications, and inconsistencies by nature. Many algorithms have been developed for string approximate searches and most of them make use of inverted lists to find similar strings. These algorithms basically perform merge operations on inverted lists. In this paper, we develop a bitmap representation of an inverted list and propose an efficient search algorithm that can skip unnecessary inverted lists without searching using bitmap filters. Experimental results show that the proposed technique consistently improve the performance of the search.
{"title":"Efficient Inverted List Search Technique using Bitmap Filters","authors":"Inteak Kwon, Jongik Kim","doi":"10.3745/KIPSTD.2011.18D.6.415","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.6.415","url":null,"abstract":"Finding similar strings is an important operation because textual data can have errors, duplications, and inconsistencies by nature. Many algorithms have been developed for string approximate searches and most of them make use of inverted lists to find similar strings. These algorithms basically perform merge operations on inverted lists. In this paper, we develop a bitmap representation of an inverted list and propose an efficient search algorithm that can skip unnecessary inverted lists without searching using bitmap filters. Experimental results show that the proposed technique consistently improve the performance of the search.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130286151","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-10-31DOI: 10.3745/KIPSTD.2011.18D.5.329
Yunsoo Choi, Sa-kwang Song, H. Chun, Chang-Hoo Jeong, Sung-Pil Choi
Terminology recognition system which is a preceding research for text mining, information extraction, information retrieval, semantic web, and question-answering has been intensively studied in limited range of domains, especially in bio-medical domain. We propose a domain independent terminology recognition system based on machine learning method using dictionary, syntactic features, and Web search results, since the previous works revealed limitation on applying their approaches to general domain because their resources were domain specific. We achieved F-score 80.8 and 6.5% improvement after comparing the proposed approach with the related approach, C-value, which has been widely used and is based on local domain frequencies. In the second experiment with various combinations of unithood features, the method combined with NGD(Normalized Google Distance) showed the best performance of 81.8 on F-score. We applied three machine learning methods such as Logistic regression, C4.5, and SVMs, and got the best score from the decision tree method, C4.5.
{"title":"Terminology Recognition System based on Machine Learning for Scientific Document Analysis","authors":"Yunsoo Choi, Sa-kwang Song, H. Chun, Chang-Hoo Jeong, Sung-Pil Choi","doi":"10.3745/KIPSTD.2011.18D.5.329","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.5.329","url":null,"abstract":"Terminology recognition system which is a preceding research for text mining, information extraction, information retrieval, semantic web, and question-answering has been intensively studied in limited range of domains, especially in bio-medical domain. We propose a domain independent terminology recognition system based on machine learning method using dictionary, syntactic features, and Web search results, since the previous works revealed limitation on applying their approaches to general domain because their resources were domain specific. We achieved F-score 80.8 and 6.5% improvement after comparing the proposed approach with the related approach, C-value, which has been widely used and is based on local domain frequencies. In the second experiment with various combinations of unithood features, the method combined with NGD(Normalized Google Distance) showed the best performance of 81.8 on F-score. We applied three machine learning methods such as Logistic regression, C4.5, and SVMs, and got the best score from the decision tree method, C4.5.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129573647","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-10-31DOI: 10.3745/KIPSTD.2011.18D.5.403
Hwa-Yeong Choe, Sangwon Park
Recently, smart phones based on Android platform have been widely used, and lots of applications have been developed. Data generated from an application are frequently transferred to other applications. Therefore, a method that can easily transfer or share meta-data among applications is required. Generally meta-data created by android applications are java objects. The android platform uses clipboard, intent and content provider in order to transfer data among the applications. However, those ways are designed to transfer data as a record. So these methods have to marshall the object to a record and unmarshall the record to an object. In this paper, we designed and implemented the MetaService which can transfer any type of object made by applications. When the MetaService is used, we can reduce complex implementations such as clipboards and content providers and we can reduce many bugs. Therefore, we can make the applications simple and increase productivity.
{"title":"Design and Implementation of a MetaService for Improving Object Transfer among Applications on Android Platform","authors":"Hwa-Yeong Choe, Sangwon Park","doi":"10.3745/KIPSTD.2011.18D.5.403","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.5.403","url":null,"abstract":"Recently, smart phones based on Android platform have been widely used, and lots of applications have been developed. Data generated from an application are frequently transferred to other applications. Therefore, a method that can easily transfer or share meta-data among applications is required. Generally meta-data created by android applications are java objects. The android platform uses clipboard, intent and content provider in order to transfer data among the applications. However, those ways are designed to transfer data as a record. So these methods have to marshall the object to a record and unmarshall the record to an object. In this paper, we designed and implemented the MetaService which can transfer any type of object made by applications. When the MetaService is used, we can reduce complex implementations such as clipboards and content providers and we can reduce many bugs. Therefore, we can make the applications simple and increase productivity.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126321200","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
扫码关注我们
求助内容：
应助结果提醒方式：