Voice signal analysis is becoming one of the most significant examination in clinical practice due to the importance of extracting related parameters to reflect the patient's health. In this regard, various acoustic studies have been revealed that the analysis of laryngeal, respiratory and articulatory function may be efficient as an early indicator in the diagnosis of Parkinson disease (PD). PD is a common chronic neurodegenerative disorder, which affects a central nervous system and it is characterized by progressive loss of muscle control. Tremor, movement and speech disorders are the main symptoms of PD. The diagnosis decision of PD is obtained by continued clinical observation which relies on expert human observer. Therefore, an additional diagnosis method is desirable for most comfortable and timely detection of PD as well as faster treatment is needed. In this study, we develop and validate automated classification algorithms, which are based on Naive Bayes and K- Nearest Neighbors (KNN) using voice signal measurements to predict PD. According to the results, the diagnostic performance provided by the automated classification algorithm using Naive Bayes was superior to that of the KNN and it is useful as a predictive tool for PD screening with a high degree of accuracy, approximately 93.3%.
{"title":"Pathological Voice Signal Analysis Using Machine Learning Based Approaches","authors":"Yahia Alemami, L. Almazaydeh","doi":"10.5539/cis.v11n1p8","DOIUrl":"https://doi.org/10.5539/cis.v11n1p8","url":null,"abstract":"Voice signal analysis is becoming one of the most significant examination in clinical practice due to the importance of extracting related parameters to reflect the patient's health. In this regard, various acoustic studies have been revealed that the analysis of laryngeal, respiratory and articulatory function may be efficient as an early indicator in the diagnosis of Parkinson disease (PD). PD is a common chronic neurodegenerative disorder, which affects a central nervous system and it is characterized by progressive loss of muscle control. Tremor, movement and speech disorders are the main symptoms of PD. The diagnosis decision of PD is obtained by continued clinical observation which relies on expert human observer. Therefore, an additional diagnosis method is desirable for most comfortable and timely detection of PD as well as faster treatment is needed. In this study, we develop and validate automated classification algorithms, which are based on Naive Bayes and K- Nearest Neighbors (KNN) using voice signal measurements to predict PD. According to the results, the diagnostic performance provided by the automated classification algorithm using Naive Bayes was superior to that of the KNN and it is useful as a predictive tool for PD screening with a high degree of accuracy, approximately 93.3%.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"37 1","pages":"8-13"},"PeriodicalIF":0.0,"publicationDate":"2017-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91210933","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}
L. Almazaydeh, Jun Zhang, Peiqiao Wu, Ruoqi Wei, Yisheng Cheng, K. Elleithy
Due its universality, Universal Serial Bus (USB) has become the major connecting port of modern computers. Programmability provides convenience between hardware vendors and operating system vendors to develop their products and related firmware. However, it leads to high risk by opening a door for a potential vulnerability. In the past three years, researchers have attempt to stop and prevent the security influence of compromised products, reported this issue and their suggestion to chips vendors, peripheral vendors and OS vendor, in order to patch up existing vulnerable device and avoid known exploits in the future. In result, none of those vendors could successfully overcome the vulnerabilities, with inactive response to either the reports by security researchers or incidents by hacker communities. Thus, third party organizations and research teams start to take over the problem of "BadUSB" and focus on discovering its solution. In this paper ,we introduce an approach to protect against BadUSB. A comparison between the presented scheme and the existing defense methods demonstrates that the presented approach outperforms the reported approaches in literature.
{"title":"Bad USB MITM: A Network Attack Based on Physical Access and Its Practical Security Solutions","authors":"L. Almazaydeh, Jun Zhang, Peiqiao Wu, Ruoqi Wei, Yisheng Cheng, K. Elleithy","doi":"10.5539/cis.v11n1p1","DOIUrl":"https://doi.org/10.5539/cis.v11n1p1","url":null,"abstract":"Due its universality, Universal Serial Bus (USB) has become the major connecting port of modern computers. Programmability provides convenience between hardware vendors and operating system vendors to develop their products and related firmware. However, it leads to high risk by opening a door for a potential vulnerability. In the past three years, researchers have attempt to stop and prevent the security influence of compromised products, reported this issue and their suggestion to chips vendors, peripheral vendors and OS vendor, in order to patch up existing vulnerable device and avoid known exploits in the future. In result, none of those vendors could successfully overcome the vulnerabilities, with inactive response to either the reports by security researchers or incidents by hacker communities. Thus, third party organizations and research teams start to take over the problem of \"BadUSB\" and focus on discovering its solution. In this paper ,we introduce an approach to protect against BadUSB. A comparison between the presented scheme and the existing defense methods demonstrates that the presented approach outperforms the reported approaches in literature.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"16 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82966319","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 necessity of having intelligent methodology to access databases in networks has become more apparent in the age of distributed networks. Using semantics and ontologies can be highly helpful in developing such methodologies, as they provide the required classifications and mined information. The necessities that are required by the database administrator to build durable, reliable, and flexible data access methodology have been highly appreciated. This study that compares between the proposed system and conventional methods, for example Role Based Access Control (RBAC) and classical chain-based methods. The comparison is done using applications in the healthcare sector. This study is based on real surveys that have been conducted in an active hospital in the State of Kuwait.
{"title":"A Comparative Study to the Semantics of Ontology Chain-Based Data Access Control versus Conventional Methods in Healthcare Applications","authors":"Esraa Omran, David Nelson, A. Roumani","doi":"10.5539/cis.v10n4p1","DOIUrl":"https://doi.org/10.5539/cis.v10n4p1","url":null,"abstract":"The necessity of having intelligent methodology to access databases in networks has become more apparent in the age of distributed networks. Using semantics and ontologies can be highly helpful in developing such methodologies, as they provide the required classifications and mined information. The necessities that are required by the database administrator to build durable, reliable, and flexible data access methodology have been highly appreciated. This study that compares between the proposed system and conventional methods, for example Role Based Access Control (RBAC) and classical chain-based methods. The comparison is done using applications in the healthcare sector. This study is based on real surveys that have been conducted in an active hospital in the State of Kuwait.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"53 1","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84561371","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 method to realize dynamic interface, and designs a database storage model based on XML field technology to realize convenient data storage, any combination condition retrieval function and how to improve the retrieval speed in this kind of storage model. Usually a business system needs to provide information entry and retrieval functions, software designers have to design the appropriate entry items, input interface and retrieval functions for each business system and spend too much time on the repetitive works. And later engineers have to maintain the changing needs of the entry project, so we can apply the dynamic interface technology to achieve the customize needs of input items by the user, reducing the time of the repetitive works. Dynamic interface technology includes the realization of database storage and high performance data retrieval. This paper explores a storage model based on XML database to realize common and efficient storage and discuss on how to improve the retrieval speed in this kind of storage model.
{"title":"Realization of Dynamic Interface and High Performance Data Retrieval","authors":"H. Jiang, Chang Wan","doi":"10.5539/cis.v10n4p16","DOIUrl":"https://doi.org/10.5539/cis.v10n4p16","url":null,"abstract":"This paper introduces a method to realize dynamic interface, and designs a database storage model based on XML field technology to realize convenient data storage, any combination condition retrieval function and how to improve the retrieval speed in this kind of storage model. Usually a business system needs to provide information entry and retrieval functions, software designers have to design the appropriate entry items, input interface and retrieval functions for each business system and spend too much time on the repetitive works. And later engineers have to maintain the changing needs of the entry project, so we can apply the dynamic interface technology to achieve the customize needs of input items by the user, reducing the time of the repetitive works. Dynamic interface technology includes the realization of database storage and high performance data retrieval. This paper explores a storage model based on XML database to realize common and efficient storage and discuss on how to improve the retrieval speed in this kind of storage model.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"13 1","pages":"16-21"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82901447","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}
It is proved that the linear space constructed by power base is a banach space under 2-norm by using approximation method. For the Bezier curve--the elements in banach space, the linear combination of the low-order S power base is used to approximate optimal the high-order Bernstein base function. The original Bezier curve is instituted by the linear combination of low-order S power base and the optimal approximation element of the original Bezier curve is obtained.
{"title":"An Approximation Method of Bézier Curve","authors":"Zhi Wu, Chuanning Song, Deng Bao","doi":"10.5539/cis.v10n4p67","DOIUrl":"https://doi.org/10.5539/cis.v10n4p67","url":null,"abstract":"It is proved that the linear space constructed by power base is a banach space under 2-norm by using approximation method. For the Bezier curve--the elements in banach space, the linear combination of the low-order S power base is used to approximate optimal the high-order Bernstein base function. The original Bezier curve is instituted by the linear combination of low-order S power base and the optimal approximation element of the original Bezier curve is obtained.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"26 1","pages":"67-72"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75112480","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}
B. C. Singh, Mohammad Muntasir Rahman, Md. Sipon Miah, M. K. Baowaly
Community detection in online social networks is a difficult but important phenomenon in term of revealing hidden relationships patterns among people so that we can understand human behaviors in term of social-economics perspectives. Community detection algorithms allow us to discover these types of patterns in online social networks. Identifying and detecting communities are not only of particular importance but also have immediate applications. For this reason, researchers have been intensively investigated to implement efficient algorithms to detect community in recent years. In this paper, we introduce set theory to address the community detection problem considering node attributes and network structural patterns. We also formulate probability theory to detect the overlapping community in online social network. Furthermore, we extend our focus on the comparative analysis on some existing community detection methods, which basically consider node attributes and edge contents for detecting community. We conduct comprehensive analysis on our framework so that we justify the performance of our proposed model. The experimental results show the effectiveness of the proposed approach.
{"title":"Community Detection Using Node Attributes and Structural Patterns in Online Social Networks","authors":"B. C. Singh, Mohammad Muntasir Rahman, Md. Sipon Miah, M. K. Baowaly","doi":"10.5539/cis.v10n4p50","DOIUrl":"https://doi.org/10.5539/cis.v10n4p50","url":null,"abstract":"Community detection in online social networks is a difficult but important phenomenon in term of revealing hidden relationships patterns among people so that we can understand human behaviors in term of social-economics perspectives. Community detection algorithms allow us to discover these types of patterns in online social networks. Identifying and detecting communities are not only of particular importance but also have immediate applications. For this reason, researchers have been intensively investigated to implement efficient algorithms to detect community in recent years. In this paper, we introduce set theory to address the community detection problem considering node attributes and network structural patterns. We also formulate probability theory to detect the overlapping community in online social network. Furthermore, we extend our focus on the comparative analysis on some existing community detection methods, which basically consider node attributes and edge contents for detecting community. We conduct comprehensive analysis on our framework so that we justify the performance of our proposed model. The experimental results show the effectiveness of the proposed approach.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"186 1","pages":"50-59"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77482683","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}
Linguistic steganalysis is a technique that discovering potentially hidden information embedded through using linguistically in plain text using. Varieties of syntax and multi-meanings of semantics for linguistics augment the difficulty of linguistic steganalysis intensely, thereby it is a challenge area. In this paper, we propose a novel steganalysis method for linguistics based on immune. This method has two attributions: i). basis statistical features of text are employed for blind steganalysis ii). immune technique is chosen to build a two-level detection mechanism to detect two categories of stego text respectively, one of which is Success-Stego-text and another is False-Stego-text. Appropriate detections are generated and preferable features are signed . Experiments prove the approach has higher accuracy than current steganalysis algorithms. Especially when the segment size of text is greater than 3kB, the accuracies of detecting for natural text and stego text are both more than 95%.
{"title":"A Linguistic Steganalysis Approach Base on Source Features of Text and Immune Mechanism","authors":"Licai Zhu","doi":"10.5539/cis.v10n4p60","DOIUrl":"https://doi.org/10.5539/cis.v10n4p60","url":null,"abstract":"Linguistic steganalysis is a technique that discovering potentially hidden information embedded through using linguistically in plain text using. Varieties of syntax and multi-meanings of semantics for linguistics augment the difficulty of linguistic steganalysis intensely, thereby it is a challenge area. In this paper, we propose a novel steganalysis method for linguistics based on immune. This method has two attributions: i). basis statistical features of text are employed for blind steganalysis ii). immune technique is chosen to build a two-level detection mechanism to detect two categories of stego text respectively, one of which is Success-Stego-text and another is False-Stego-text. Appropriate detections are generated and preferable features are signed . Experiments prove the approach has higher accuracy than current steganalysis algorithms. Especially when the segment size of text is greater than 3kB, the accuracies of detecting for natural text and stego text are both more than 95%.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"92 25 1","pages":"60-66"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81268741","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}
Semantic hiding is the technology of using semantic knowledge to embed secret information into text carrier. Among the many methods of semantic hiding, "synonym substitution" is paid more and more attention by semantic hiding. The main idea of this method is to hide the secret information by replacing synonyms in text so as to retain its original meaning as much as possible. In order to effectively restore hidden information, we need to find the synonym replacement location as accurately as possible, so it is very important to recognize the collocation of words. So far, however, there is no effective way to identify and match Natural Language Processing, that is, it is very difficult to tell exactly whether or not the words in the text have been replaced. In this paper, a hidden reduction method based on collocation is proposed. By analyzing the characteristics of synonyms and their collocation, this paper treats their relation as the relation between the pairs of samples in statistical sense. According to the nature of the statistic, we design several decision features to identify the collocations. At the same time, we introduce the form of point mutual information in the information theory as a feature to use the independence of quantifier pairs. In order to recognize word collocation effectively, this paper combines these features, and uses genetic algorithm to get the recognition degree of each feature. Then, a replacement recognition system based on immune abnormality mechanism is designed. Synonyms for collocation are regarded as "normal", while substitutions are regarded as "anomalies"". The experimental samples are generated by semantic hidden software TLEX. To better render the restore process, we rewrote the TLEX to add the key selection module.
{"title":"A Method of Semantic Hidden Reduction Based on Collocation","authors":"Licai Zhu","doi":"10.5539/cis.v10n4p73","DOIUrl":"https://doi.org/10.5539/cis.v10n4p73","url":null,"abstract":"Semantic hiding is the technology of using semantic knowledge to embed secret information into text carrier. Among the many methods of semantic hiding, \"synonym substitution\" is paid more and more attention by semantic hiding. The main idea of this method is to hide the secret information by replacing synonyms in text so as to retain its original meaning as much as possible. In order to effectively restore hidden information, we need to find the synonym replacement location as accurately as possible, so it is very important to recognize the collocation of words. So far, however, there is no effective way to identify and match Natural Language Processing, that is, it is very difficult to tell exactly whether or not the words in the text have been replaced. In this paper, a hidden reduction method based on collocation is proposed. By analyzing the characteristics of synonyms and their collocation, this paper treats their relation as the relation between the pairs of samples in statistical sense. According to the nature of the statistic, we design several decision features to identify the collocations. At the same time, we introduce the form of point mutual information in the information theory as a feature to use the independence of quantifier pairs. In order to recognize word collocation effectively, this paper combines these features, and uses genetic algorithm to get the recognition degree of each feature. Then, a replacement recognition system based on immune abnormality mechanism is designed. Synonyms for collocation are regarded as \"normal\", while substitutions are regarded as \"anomalies\"\". The experimental samples are generated by semantic hidden software TLEX. To better render the restore process, we rewrote the TLEX to add the key selection module.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"1 1","pages":"73-80"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91355729","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}
Cities are complex spatial systems and modeling their dynamics of growth using traditional modeling techniques is a challenging task. Cellular automata (CA) have been widely used for modeling urban growth because of their computational simplicity, their explicit representation of time and space and their ability to generate complex patterns from the interaction of simple components of the system using simple rules. Integrating GIS tools and remote sensing data with CA has the potential to provide realistic simulation of the future urban growth of cities. The proposed approach is applied to model the growth of the City of Montreal. Land use/land cover maps derived from Landsat data acquired in 1975 and 1990 were used to train a CA model which was then used to project the land use in 2005. A comparison of the projected and actual land uses for 2005 is presented and discussed.
{"title":"Remote Sensing, Gis and Cellular Automata for Urban Growth Simulation","authors":"Munira Al-Ageili, Malek Mouhoub, J. Piwowar","doi":"10.5539/cis.v10n4p38","DOIUrl":"https://doi.org/10.5539/cis.v10n4p38","url":null,"abstract":"Cities are complex spatial systems and modeling their dynamics of growth using traditional modeling techniques is a challenging task. Cellular automata (CA) have been widely used for modeling urban growth because of their computational simplicity, their explicit representation of time and space and their ability to generate complex patterns from the interaction of simple components of the system using simple rules. Integrating GIS tools and remote sensing data with CA has the potential to provide realistic simulation of the future urban growth of cities. The proposed approach is applied to model the growth of the City of Montreal. Land use/land cover maps derived from Landsat data acquired in 1975 and 1990 were used to train a CA model which was then used to project the land use in 2005. A comparison of the projected and actual land uses for 2005 is presented and discussed.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"85 1","pages":"38-49"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73439518","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 newly emerging market for data is insufficiently researched up to now. The survey presented in this work - which is the third iteration of a a series of studies that started in 2012 - intends to provide a deeper understanding of this emerging type of market. Research questions concerning the provider manifestations and the commoditization of data are identified. The findings indicate that data providers focus on limited business models and that data remains individualized and differentiated. Nevertheless, a trend towards commoditization for certain types of data can be foreseen, which even allows an outlook to further developments in this area.
{"title":"Marketplaces for Digital Data: Quo Vadis?","authors":"F. Stahl, Fabian Schomm, Lara Vomfell, G. Vossen","doi":"10.5539/cis.v10n4p22","DOIUrl":"https://doi.org/10.5539/cis.v10n4p22","url":null,"abstract":"The newly emerging market for data is insufficiently researched up to now. The survey presented in this work - which is the third iteration of a a series of studies that started in 2012 - intends to provide a deeper understanding of this emerging type of market. Research questions concerning the provider manifestations and the commoditization of data are identified. The findings indicate that data providers focus on limited business models and that data remains individualized and differentiated. Nevertheless, a trend towards commoditization for certain types of data can be foreseen, which even allows an outlook to further developments in this area.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"73 1","pages":"22-37"},"PeriodicalIF":0.0,"publicationDate":"2017-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83966975","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
扫码关注我们
求助内容：
应助结果提醒方式：