Data request task scheduling is one of the important issues for P2P VoD systems. However the existing data scheduling strategies in P2P VoD system is not fair enough. They make many nodes, which upload data actively, bear very heavy load, while those selfish nodes providing no resource sit idle. This paper presents an admission control strategy on serving nodes combining with the incentive mechanism. The serving peers respond the requesting peers that contribute more data to systems with priority and reject some requests which can not be processed in time. The experiments show that this strategy improves the performance of the system and decreases the users' wait time for watching.
{"title":"Admission Control Strategy of Serving Peers in P2P VoD Systems","authors":"Yanqin Zhu, Jianjun Bian, Qijin Ji, Haojun Zhang","doi":"10.1109/SNPD.2012.95","DOIUrl":"https://doi.org/10.1109/SNPD.2012.95","url":null,"abstract":"Data request task scheduling is one of the important issues for P2P VoD systems. However the existing data scheduling strategies in P2P VoD system is not fair enough. They make many nodes, which upload data actively, bear very heavy load, while those selfish nodes providing no resource sit idle. This paper presents an admission control strategy on serving nodes combining with the incentive mechanism. The serving peers respond the requesting peers that contribute more data to systems with priority and reject some requests which can not be processed in time. The experiments show that this strategy improves the performance of the system and decreases the users' wait time for watching.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127684193","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}
We digitally archived festival music signals (“Ohayashi”) in the Yamahoko parades of Gion festival in Kyoto, Japan. Besides, the festival music, which consists of Japanese traditional drums, flutes, bells, ambient noise and in-float driving noise are needed to reproduce the authentic atmosphere of this festival. To reproduce a high-quality sound field, we recorded the festival music in the presence of ambient noise and float noise by using multi-channel recording. We reproduced the sound field of one of the parades with the recorded sound sources. We employed point-source loudspeakers for reproducing Japanese traditional drums, flutes, and bells with omni-directional radiation characteristics. After that, we built a web-based system linked to a map of the parade route that would produce an acoustic sound field with realistic sensations at different points along the route. This system reproduces the Ohayashi at particular positions along the route when the user clicks circular buttons on the map.
{"title":"Digital Archive for Japanese Intangible Cultural Heritage Based on Reproduction of High-Fidelity Sound Field in Yamahoko Parade of Gion Festival","authors":"Takahiro Fukumori, T. Nishiura, Y. Yamashita","doi":"10.1109/SNPD.2012.105","DOIUrl":"https://doi.org/10.1109/SNPD.2012.105","url":null,"abstract":"We digitally archived festival music signals (“Ohayashi”) in the Yamahoko parades of Gion festival in Kyoto, Japan. Besides, the festival music, which consists of Japanese traditional drums, flutes, bells, ambient noise and in-float driving noise are needed to reproduce the authentic atmosphere of this festival. To reproduce a high-quality sound field, we recorded the festival music in the presence of ambient noise and float noise by using multi-channel recording. We reproduced the sound field of one of the parades with the recorded sound sources. We employed point-source loudspeakers for reproducing Japanese traditional drums, flutes, and bells with omni-directional radiation characteristics. After that, we built a web-based system linked to a map of the parade route that would produce an acoustic sound field with realistic sensations at different points along the route. This system reproduces the Ohayashi at particular positions along the route when the user clicks circular buttons on the map.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134124270","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 describes a Bayesian Network model-to diagnose the causes-effect of software defect detection in the process of software testing. The aim is to use the BN model to identify defective software modules for efficient software test in order to improve the quality of a software system. It can also be used as a decision tool to assist software developers to determine defect priority levels for each phase of a software development project. The BN tool can provide a cause-effect relationship between the software defects found in each phase and other factors affecting software defect detection in software testing. First, we build a State and Transition Model that is used to provide a simple framework for integrating knowledge about software defect detection and various factors. Second, we convert the State and Transition Model into a Bayesian Network model. Third, the probabilities for the BN model are determined through the knowledge of software experts and previous software development projects or phases. Last, we observe the interactions among the variables and allow for prediction of effects of external manipulation. We believe that both STM and BN models can be used as very practical tools for predicting software defects and reliability in varying software development lifecycles.
{"title":"Developing a Bayesian Network Model Based on a State and Transition Model for Software Defect Detection","authors":"N. Jongsawat, W. Premchaiswadi","doi":"10.1109/SNPD.2012.41","DOIUrl":"https://doi.org/10.1109/SNPD.2012.41","url":null,"abstract":"This paper describes a Bayesian Network model-to diagnose the causes-effect of software defect detection in the process of software testing. The aim is to use the BN model to identify defective software modules for efficient software test in order to improve the quality of a software system. It can also be used as a decision tool to assist software developers to determine defect priority levels for each phase of a software development project. The BN tool can provide a cause-effect relationship between the software defects found in each phase and other factors affecting software defect detection in software testing. First, we build a State and Transition Model that is used to provide a simple framework for integrating knowledge about software defect detection and various factors. Second, we convert the State and Transition Model into a Bayesian Network model. Third, the probabilities for the BN model are determined through the knowledge of software experts and previous software development projects or phases. Last, we observe the interactions among the variables and allow for prediction of effects of external manipulation. We believe that both STM and BN models can be used as very practical tools for predicting software defects and reliability in varying software development lifecycles.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115568435","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}
A. Grzech, K. Juszczyszyn, P. Swiatek, C. Mazurek, A. Sochan
The paper gain is to present at the glance applications proposed, deployed and tested within Future Internet Engineering (FIE) project. The elaborated applications utilize the general concept of IP Multimedia Subsystem (IMS) according to which the IMS core servers (Parallel Internets) are treated as a docking station for any kind of application servers. It also means that the applications may be running as long as IMS provides standardized and extended interfaces. The mentioned applications have been selected as representative for process-oriented business organizations characterized by service- and process-oriented models and implementation (SOA, Web Services, Semantic Web, Web of data, content- and context aware applications, etc.) based on service-oriented architectures, pervasive computing and communication-enabled applications paradigms. In the applications' architectures complex, "autonomic" self-organizing distributed systems/workflows with autonomous components are specified, realized, simulated and evaluated as a based on active component technologies. Application-driven content- and context-aware networks support process- and service-oriented processes. A combination of the above mentioned models (the push and pull model), architecture and approaches are possible and attractive from research, application and business perspectives. All the shortly presented applications may be considered as Over-The-Top (OTT) applications which effectively commoditize intelligent network services.
{"title":"Applications of the Future Internet Engineering Project","authors":"A. Grzech, K. Juszczyszyn, P. Swiatek, C. Mazurek, A. Sochan","doi":"10.1109/SNPD.2012.61","DOIUrl":"https://doi.org/10.1109/SNPD.2012.61","url":null,"abstract":"The paper gain is to present at the glance applications proposed, deployed and tested within Future Internet Engineering (FIE) project. The elaborated applications utilize the general concept of IP Multimedia Subsystem (IMS) according to which the IMS core servers (Parallel Internets) are treated as a docking station for any kind of application servers. It also means that the applications may be running as long as IMS provides standardized and extended interfaces. The mentioned applications have been selected as representative for process-oriented business organizations characterized by service- and process-oriented models and implementation (SOA, Web Services, Semantic Web, Web of data, content- and context aware applications, etc.) based on service-oriented architectures, pervasive computing and communication-enabled applications paradigms. In the applications' architectures complex, \"autonomic\" self-organizing distributed systems/workflows with autonomous components are specified, realized, simulated and evaluated as a based on active component technologies. Application-driven content- and context-aware networks support process- and service-oriented processes. A combination of the above mentioned models (the push and pull model), architecture and approaches are possible and attractive from research, application and business perspectives. All the shortly presented applications may be considered as Over-The-Top (OTT) applications which effectively commoditize intelligent network services.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115860511","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}
Interactive Evolutionary Computation (IEC) is well known as an effective method to create media contents suited to user's preference and objectives to use. As one of the methods, we have applied Differential Evolution, which is recent evolutionary algorithm to IEC. Concretely, we have already presented a method that creates sign sounds with Interactive Differential Evolution (IDE). This study aims to investigate fundamentally the efficacy of the IDE method in comparison with Interactive Genetic Algorithm (IGA). Two listening experiments were conducted: experiment 1 as a creation experiment with IDE and IGA, experiment 2 as a re-evaluation experiment. Target of the creation was warning sign sounds. In the experiment 2, representative five sign sounds created in both of IDE and IGA were evaluated. Sixteen males participated as subjects in the experiments. In the result of the experiment 1, IDE overcame IGA in subjective fitness value. Drastic shrink of searching space was observed in IGA, and larger time cost was observed in IDE. In the result of the experiment 2, higher fitness value in average was observed in IDE, however, the difference was not significant.
{"title":"The Efficiency of Interactive Differential Evolution in Creation of Sound Contents: In Comparison with Interactive Genetic Algorithm","authors":"M. Fukumoto, Ryota Yamamoto, Shintarou Ogawa","doi":"10.4018/ijsi.2013040102","DOIUrl":"https://doi.org/10.4018/ijsi.2013040102","url":null,"abstract":"Interactive Evolutionary Computation (IEC) is well known as an effective method to create media contents suited to user's preference and objectives to use. As one of the methods, we have applied Differential Evolution, which is recent evolutionary algorithm to IEC. Concretely, we have already presented a method that creates sign sounds with Interactive Differential Evolution (IDE). This study aims to investigate fundamentally the efficacy of the IDE method in comparison with Interactive Genetic Algorithm (IGA). Two listening experiments were conducted: experiment 1 as a creation experiment with IDE and IGA, experiment 2 as a re-evaluation experiment. Target of the creation was warning sign sounds. In the experiment 2, representative five sign sounds created in both of IDE and IGA were evaluated. Sixteen males participated as subjects in the experiments. In the result of the experiment 1, IDE overcame IGA in subjective fitness value. Drastic shrink of searching space was observed in IGA, and larger time cost was observed in IDE. In the result of the experiment 2, higher fitness value in average was observed in IDE, however, the difference was not significant.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114982633","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 introduces a fusion model to reinforce multi-level fuzzy association rules, which integrated cumulative probability distribution approach (CPDA) and multi-level taxonomy concepts to extract fuzzy association rules. The proposed model generate large item sets level by level and mine multi-level fuzzy association rule lead to finding more informative and important knowledge from transaction dataset, which is more objective and reasonable in determining the universe of discourse and membership functions with other multi-level fuzzy association rules.
{"title":"Enhance the Multi-level Fuzzy Association Rules Based on Cumulative Probability Distribution Approach","authors":"Jr-Shian Chen, Fuh-Gwo Chen, Jen-Ya Wang","doi":"10.1109/SNPD.2012.36","DOIUrl":"https://doi.org/10.1109/SNPD.2012.36","url":null,"abstract":"This paper introduces a fusion model to reinforce multi-level fuzzy association rules, which integrated cumulative probability distribution approach (CPDA) and multi-level taxonomy concepts to extract fuzzy association rules. The proposed model generate large item sets level by level and mine multi-level fuzzy association rule lead to finding more informative and important knowledge from transaction dataset, which is more objective and reasonable in determining the universe of discourse and membership functions with other multi-level fuzzy association rules.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129987660","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}
Word sense disambiguation (WSD) problem asks to assign a meaning to a word according to a context in which it occurs. Many solutions exist for WSD in natural languages, such as English, but research work on Arabic WSD (AWSD) remains limited. AWSD is a more exigent task because Arabic has an intrinsic complexity in its writing structure and ambiguity, such as syntactic, semantic, and anaphoric ambiguity levels. Genetic algorithms (GAs) can be effective to solve this problem since they have been successfully used for many NP-hard optimization problems. In this paper, we propose a new approach to solve AWSD problem based on a GA. We describe a prototype of AWSD system in which we test the performance of our algorithm by carrying out experiments on Arabic sample text, and compare it with a naïve Bayes classifier for AWSD. We show the benefit of the proposed approach and its advantage over naïve Bayes classifier.
{"title":"Genetic Algorithm for Arabic Word Sense Disambiguation","authors":"M. Menai, Wojdan Alsaeedan","doi":"10.1109/SNPD.2012.38","DOIUrl":"https://doi.org/10.1109/SNPD.2012.38","url":null,"abstract":"Word sense disambiguation (WSD) problem asks to assign a meaning to a word according to a context in which it occurs. Many solutions exist for WSD in natural languages, such as English, but research work on Arabic WSD (AWSD) remains limited. AWSD is a more exigent task because Arabic has an intrinsic complexity in its writing structure and ambiguity, such as syntactic, semantic, and anaphoric ambiguity levels. Genetic algorithms (GAs) can be effective to solve this problem since they have been successfully used for many NP-hard optimization problems. In this paper, we propose a new approach to solve AWSD problem based on a GA. We describe a prototype of AWSD system in which we test the performance of our algorithm by carrying out experiments on Arabic sample text, and compare it with a naïve Bayes classifier for AWSD. We show the benefit of the proposed approach and its advantage over naïve Bayes classifier.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703396","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}
R. Ayed, Ibrahim Bounhas, Bilel Elayeb, F. Evrard, Narjès Bellamine Ben Saoud
This paper presents a new approach for Arabic non-vocalized texts disambiguation based on a possibilistic classifier. A morphological analyzer provides all the possible solutions and the values of the morphological features of words. When texts are vocalized, the number of solutions is reduced and in many cases, we can identify the correct analysis of the input word. The main idea of this paper is to exploit this type of texts in order to learn contextual dependencies between the different values of morphological features modeled as a possibilistic network. This knowledge is used later to disambiguate non-vocalized texts. In order to evaluate our approach, we perform experiments on a corpus of arabic stories. In this paper, we present results concerning the Part-Of-Speech (POS) which is the main morphological feature. Our results are compared to the SVM-based system called MADA.
{"title":"A Possibilistic Approach for the Automatic Morphological Disambiguation of Arabic Texts","authors":"R. Ayed, Ibrahim Bounhas, Bilel Elayeb, F. Evrard, Narjès Bellamine Ben Saoud","doi":"10.1109/SNPD.2012.21","DOIUrl":"https://doi.org/10.1109/SNPD.2012.21","url":null,"abstract":"This paper presents a new approach for Arabic non-vocalized texts disambiguation based on a possibilistic classifier. A morphological analyzer provides all the possible solutions and the values of the morphological features of words. When texts are vocalized, the number of solutions is reduced and in many cases, we can identify the correct analysis of the input word. The main idea of this paper is to exploit this type of texts in order to learn contextual dependencies between the different values of morphological features modeled as a possibilistic network. This knowledge is used later to disambiguate non-vocalized texts. In order to evaluate our approach, we perform experiments on a corpus of arabic stories. In this paper, we present results concerning the Part-Of-Speech (POS) which is the main morphological feature. Our results are compared to the SVM-based system called MADA.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129295005","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}
Off-line anonymous credit card systems are ones that enable card holders to make purchases anonymously while being disconnected from a card company, i.e. without using information maintained the by card company or other shops. This paper proposes one of components that are required for developing off-line anonymous credit card systems. The proposed component enables card holders to protect their tokens from being used by other entities.
{"title":"A Mechanism to Protect Tokens from Dishonest Uses","authors":"Yusuke Ohashi, S. Tamura, S. Taniguchi","doi":"10.1109/SNPD.2012.92","DOIUrl":"https://doi.org/10.1109/SNPD.2012.92","url":null,"abstract":"Off-line anonymous credit card systems are ones that enable card holders to make purchases anonymously while being disconnected from a card company, i.e. without using information maintained the by card company or other shops. This paper proposes one of components that are required for developing off-line anonymous credit card systems. The proposed component enables card holders to protect their tokens from being used by other entities.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130915120","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 proposes an extensible RTOS (real-time operating system) architecture for embedded heterogeneous muti-core processors, which consist of processors with different processing power and functionalities. The architecture splits the RTOS kernel into the two components, the proxy kernel (PK) and user-level kernel (UK). The PK runs on a less powerful core, and delegate its functions to the UK that runs on a powerful core as a user process. The UK takes responsibility for the dynamic resource management functions, thus, the PK can focus on the basic but important RTOS functionalities, such as timing management, synchronization, and dispatching the highest priority process. The experiment results running micro benchmark programs show that the proposed architecture can achieve the faster creation and invocation of processes and that a communication cost between the PK and the UK is negligible.
{"title":"Architecting RTOS for Extensibility by Heterogeneous Multiprocessing with Proxy Kernels","authors":"S. Oikawa","doi":"10.1109/SNPD.2012.42","DOIUrl":"https://doi.org/10.1109/SNPD.2012.42","url":null,"abstract":"This paper proposes an extensible RTOS (real-time operating system) architecture for embedded heterogeneous muti-core processors, which consist of processors with different processing power and functionalities. The architecture splits the RTOS kernel into the two components, the proxy kernel (PK) and user-level kernel (UK). The PK runs on a less powerful core, and delegate its functions to the UK that runs on a powerful core as a user process. The UK takes responsibility for the dynamic resource management functions, thus, the PK can focus on the basic but important RTOS functionalities, such as timing management, synchronization, and dispatching the highest priority process. The experiment results running micro benchmark programs show that the proposed architecture can achieve the faster creation and invocation of processes and that a communication cost between the PK and the UK is negligible.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121909270","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
扫码关注我们
求助内容：
应助结果提醒方式：