Pub Date : 2015-11-01DOI: 10.1109/KBEI.2015.7436055
Farshad Rafiei, G. Hossein-Zadeh
In a brain decoding study, using the functional magnetic resonance imaging (fMRI) data we determined the facial expression of the visual stimulus that the subject perceived. fMRI data acquired from a healthy right-handed adult volunteer who participated in three separate sessions. Participant viewed blocks of emotionally expressive faces alternating with blocks of neutral faces and scrambled images. Multi-voxel pattern analyses are then used to decode different expressions using the activity pattern of most active parts of brain. We used multi-class support vector machine (SVM) to distinct five brain states corresponding to neutral, happy, sad, angry and surprised. Results show that these facial expressions can be classified from fMRI data with the average sensitivity of 90 percent.
{"title":"fMRI brain decoding of facial expressions based on multi-voxel pattern analysis","authors":"Farshad Rafiei, G. Hossein-Zadeh","doi":"10.1109/KBEI.2015.7436055","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436055","url":null,"abstract":"In a brain decoding study, using the functional magnetic resonance imaging (fMRI) data we determined the facial expression of the visual stimulus that the subject perceived. fMRI data acquired from a healthy right-handed adult volunteer who participated in three separate sessions. Participant viewed blocks of emotionally expressive faces alternating with blocks of neutral faces and scrambled images. Multi-voxel pattern analyses are then used to decode different expressions using the activity pattern of most active parts of brain. We used multi-class support vector machine (SVM) to distinct five brain states corresponding to neutral, happy, sad, angry and surprised. Results show that these facial expressions can be classified from fMRI data with the average sensitivity of 90 percent.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134637215","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436077
Raoof Masoomi, Ali Khadem
Due to the potential applications of Brain-Computer Interfaces (BCI), like producing rehabilitation systems for disabled people, many researches have been aimed at minimizing the error of BCI systems. In this paper, we used left and right hand motor imagery EEG data provided by Graz University of Technology for the BCI Competition II. We attempted to achieve a better misclassification rate while selecting less features compared with various former reported researches on this dataset. We used linear discriminant analysis (LDA) as the classifier due to its low computational cost and previously reported promising results. Furthermore, we investigated what features have major impacts on local or global minimization of the misclassification rate. Also, we briefly assessed the effect of changing window length on the misclassification rate. In this paper first, a set of various statistical, spectral, wavelet-based, connectivity, and chaotic features was extracted from EEG data. Subsequently, an LDA-based wrapper Sequential Forward Selection (SFS) scheme was used for selecting optimum subset of features for each data window. Finally, data windows were classified by LDA. We achieved less misclassification rate using less features compared with previous LDA-based researches and the winner of BCI competition II on the same dataset. Also, the absolute mean of the third-level wavelet detail coefficients (related to μ-band) and the skewness were the two features that together yielded the best local discrimination results.
{"title":"Enhancing LDA-based discrimination of left and right hand motor imagery: Outperforming the winner of BCI Competition II","authors":"Raoof Masoomi, Ali Khadem","doi":"10.1109/KBEI.2015.7436077","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436077","url":null,"abstract":"Due to the potential applications of Brain-Computer Interfaces (BCI), like producing rehabilitation systems for disabled people, many researches have been aimed at minimizing the error of BCI systems. In this paper, we used left and right hand motor imagery EEG data provided by Graz University of Technology for the BCI Competition II. We attempted to achieve a better misclassification rate while selecting less features compared with various former reported researches on this dataset. We used linear discriminant analysis (LDA) as the classifier due to its low computational cost and previously reported promising results. Furthermore, we investigated what features have major impacts on local or global minimization of the misclassification rate. Also, we briefly assessed the effect of changing window length on the misclassification rate. In this paper first, a set of various statistical, spectral, wavelet-based, connectivity, and chaotic features was extracted from EEG data. Subsequently, an LDA-based wrapper Sequential Forward Selection (SFS) scheme was used for selecting optimum subset of features for each data window. Finally, data windows were classified by LDA. We achieved less misclassification rate using less features compared with previous LDA-based researches and the winner of BCI competition II on the same dataset. Also, the absolute mean of the third-level wavelet detail coefficients (related to μ-band) and the skewness were the two features that together yielded the best local discrimination results.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133334779","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436191
Ahmad Pouramini, Amine Naseri
Treebanks are essential resources for both data-driven approaches to natural language processing (NLP) and empirical linguistic researches. Developing these resources is time- and cost-consuming and requires specialized expertise. Therefore, they should be designed to be reused for different purposes. Currently, there are several dependency treebanks for some languages which are annotated in CoNLL format. For some languages, such as Persian, they are the few available linguistic resources. These treebanks are more suitable for the input of data-driven parsers, and querying linguistic data in them is not easy. In recent years, XML has been widely used for formatting treebanks, and there are various tools available for querying and annotating a linguistic croups in this format. In this paper, we present a tool for converting a dependency treebank in CoNLL format to an appropriate XML format. We designed the XML scheme to be particularly suitable for writing linguistic queries in XQuery syntax.
{"title":"The XMLization of a dependency treebank in CoNLL format for evaluating linguistic queries using XQuery","authors":"Ahmad Pouramini, Amine Naseri","doi":"10.1109/KBEI.2015.7436191","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436191","url":null,"abstract":"Treebanks are essential resources for both data-driven approaches to natural language processing (NLP) and empirical linguistic researches. Developing these resources is time- and cost-consuming and requires specialized expertise. Therefore, they should be designed to be reused for different purposes. Currently, there are several dependency treebanks for some languages which are annotated in CoNLL format. For some languages, such as Persian, they are the few available linguistic resources. These treebanks are more suitable for the input of data-driven parsers, and querying linguistic data in them is not easy. In recent years, XML has been widely used for formatting treebanks, and there are various tools available for querying and annotating a linguistic croups in this format. In this paper, we present a tool for converting a dependency treebank in CoNLL format to an appropriate XML format. We designed the XML scheme to be particularly suitable for writing linguistic queries in XQuery syntax.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133865244","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436082
Mojgan Esna Ashari, M. Zekri, M. Askari
Diabetes is known as the sixth leading cause of death in the world leading to kidney and cardiovascular diseases as well. As a result, controlling the disease is of particular importance. To control blood glucose level in diabetes mellitus type I, insulin must be injected into the body. This injection must be strictly controlled - any excessive increase in insulin injection can cause human death. Various controllers have been introduced to control diabetes type I with their own disadvantages. Diabetic patient model used in previous methods is not in compliance with physiological data, uncertainties are not considered in the model, or the controller has a very limited range of stability. In this paper, a Nonlinear Model Predictive Controller is introduced which not only resolves previous problems like lack of consideration of model uncertainty, sharp drop in blood glucose, and low stability, but also specifies insulin injection dosage based on blood glucose level momentarily so that.
{"title":"Control of the blood glucose level in diabetic patient using predictive controller and delay differential equation","authors":"Mojgan Esna Ashari, M. Zekri, M. Askari","doi":"10.1109/KBEI.2015.7436082","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436082","url":null,"abstract":"Diabetes is known as the sixth leading cause of death in the world leading to kidney and cardiovascular diseases as well. As a result, controlling the disease is of particular importance. To control blood glucose level in diabetes mellitus type I, insulin must be injected into the body. This injection must be strictly controlled - any excessive increase in insulin injection can cause human death. Various controllers have been introduced to control diabetes type I with their own disadvantages. Diabetic patient model used in previous methods is not in compliance with physiological data, uncertainties are not considered in the model, or the controller has a very limited range of stability. In this paper, a Nonlinear Model Predictive Controller is introduced which not only resolves previous problems like lack of consideration of model uncertainty, sharp drop in blood glucose, and low stability, but also specifies insulin injection dosage based on blood glucose level momentarily so that.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133967930","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436153
M. Hoseini, M. N. Shahraki, Behzad Soleimani Neysiani
Association Rule Mining is concerned with the search for relationships between item-sets based on co-occurrence of patterns. Since transactional databases are being updated all the time and there are always data being added or deleted, so Incremental Association Rule Mining is very importance. Many methods have been presented so far for incremental frequent patterns mining, one of these methods is the frequent patterns mining base on the CanTree (CANonical-order TREE). Related works on CanTree, didn't discuss about extraction of frequent patterns from the tree and it has only been suggested that the mining method would be similar to FP-growth. In this paper, a new method is presented for mining CanTree, and it is evaluated to show its improvement over the FP-growth method that mine FP tree. The evaluation results have demonstrated that performance of the presented algorithm is better than the FP-growth algorithm at high minimum support thresholds and for future work can try to improve it for lower minimum support threshold.
{"title":"A new algorithm for mining frequent patterns in Can Tree","authors":"M. Hoseini, M. N. Shahraki, Behzad Soleimani Neysiani","doi":"10.1109/KBEI.2015.7436153","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436153","url":null,"abstract":"Association Rule Mining is concerned with the search for relationships between item-sets based on co-occurrence of patterns. Since transactional databases are being updated all the time and there are always data being added or deleted, so Incremental Association Rule Mining is very importance. Many methods have been presented so far for incremental frequent patterns mining, one of these methods is the frequent patterns mining base on the CanTree (CANonical-order TREE). Related works on CanTree, didn't discuss about extraction of frequent patterns from the tree and it has only been suggested that the mining method would be similar to FP-growth. In this paper, a new method is presented for mining CanTree, and it is evaluated to show its improvement over the FP-growth method that mine FP tree. The evaluation results have demonstrated that performance of the presented algorithm is better than the FP-growth algorithm at high minimum support thresholds and for future work can try to improve it for lower minimum support threshold.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123030092","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436171
Zahra Shojaeerad, Saloomeh Taherifard, S. M. Jameii
At the present study, in order to ease analysis of real time data and to ease sharing data, combination of wireless sensor network and cloud computing has been applied. In addition, in order to be able to support large amount of data and in order to meet limitations of wireless sensor networks in regard with ability to process and acceleration of communications, cloud computing would be applied. Here, functions of integration of the two technologies of wireless sensor network and cloud computing would be referred and types of clouds, functions, their properties and threats of cloud computing would be also discussed.
{"title":"Combining wireless sensor networks and cloud computing: Security perspective","authors":"Zahra Shojaeerad, Saloomeh Taherifard, S. M. Jameii","doi":"10.1109/KBEI.2015.7436171","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436171","url":null,"abstract":"At the present study, in order to ease analysis of real time data and to ease sharing data, combination of wireless sensor network and cloud computing has been applied. In addition, in order to be able to support large amount of data and in order to meet limitations of wireless sensor networks in regard with ability to process and acceleration of communications, cloud computing would be applied. Here, functions of integration of the two technologies of wireless sensor network and cloud computing would be referred and types of clouds, functions, their properties and threats of cloud computing would be also discussed.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124235090","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436194
M. Hossein Ahmadzadegan, Ali-asghar Khorshidvand, Mehrdad Pezeshki
Secure login by passwords in the sites and applications has always been a major concern by users. Meanwhile, many spywares like Keylogger have been developed that can record the users' input characters and then have access to their passwords. In this method, a capability has been created in which Keylogger Software cannot login the user system as they record input characters. The method is in the way that one-time passwords (OTP) are generated for the users utilizing the Logistic Map Chaos Function; these passwords are expired after being used by the user and they are not valid any more. An Android Software was used to generate one-time passwords. The user generates the one-time password by installing this Android Software on his/her smart phone and enters the password into the computer without any concern of the Keylogger. The results demonstrate the success for this method.
{"title":"A method for securing username and password against the Keylogger software using the logistic map chaos function","authors":"M. Hossein Ahmadzadegan, Ali-asghar Khorshidvand, Mehrdad Pezeshki","doi":"10.1109/KBEI.2015.7436194","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436194","url":null,"abstract":"Secure login by passwords in the sites and applications has always been a major concern by users. Meanwhile, many spywares like Keylogger have been developed that can record the users' input characters and then have access to their passwords. In this method, a capability has been created in which Keylogger Software cannot login the user system as they record input characters. The method is in the way that one-time passwords (OTP) are generated for the users utilizing the Logistic Map Chaos Function; these passwords are expired after being used by the user and they are not valid any more. An Android Software was used to generate one-time passwords. The user generates the one-time password by installing this Android Software on his/her smart phone and enters the password into the computer without any concern of the Keylogger. The results demonstrate the success for this method.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128739275","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436221
S. Khakpour, D. Mirabbasi
This paper present automatic generation control (AGC) of interconnected two equal area thermal system with reheat turbine in deregulated environment and using PIDD controller that compared with other classical controllers. With existence of Electrical industry deregulation, the AGC system has been considered by taking the effect of bilateral contracts into account; it means that any distribution companies (DISCO) may have contracts with any generation companies (GENCO) in other areas. The goal is to improve system parameters such as frequency deviation error, area control error and line transmitted power using above - mentioned controllers. The simulation in MATLAB/Simulink shows that the AGC with PIDD controller results in increased dynamic efficiency and improvement in responses.
{"title":"Performance evaluation of PIDD controller for automatic generation control in interconnected thermal system with reheat turbine in deregulated environment","authors":"S. Khakpour, D. Mirabbasi","doi":"10.1109/KBEI.2015.7436221","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436221","url":null,"abstract":"This paper present automatic generation control (AGC) of interconnected two equal area thermal system with reheat turbine in deregulated environment and using PIDD controller that compared with other classical controllers. With existence of Electrical industry deregulation, the AGC system has been considered by taking the effect of bilateral contracts into account; it means that any distribution companies (DISCO) may have contracts with any generation companies (GENCO) in other areas. The goal is to improve system parameters such as frequency deviation error, area control error and line transmitted power using above - mentioned controllers. The simulation in MATLAB/Simulink shows that the AGC with PIDD controller results in increased dynamic efficiency and improvement in responses.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159052","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436046
K. Moradyan, O. Bushehrian, R. Akbari
Service Oriented Architecture proposes a new paradigm to achieve building complex web based applications. It uses web services as building blocks in order to create a composition. Although, before composing web services to build a complex application, proper web services should be discovered. Effective web service discovery heavily depends on the algorithm used to match services and also accuracy and adequacy of information gathered from user's request. In this paper a query ontology in accordance with web service description documents based on WSDL to facilitate web service discovery proposed.
{"title":"A query ontology to facilitate web service discovery","authors":"K. Moradyan, O. Bushehrian, R. Akbari","doi":"10.1109/KBEI.2015.7436046","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436046","url":null,"abstract":"Service Oriented Architecture proposes a new paradigm to achieve building complex web based applications. It uses web services as building blocks in order to create a composition. Although, before composing web services to build a complex application, proper web services should be discovered. Effective web service discovery heavily depends on the algorithm used to match services and also accuracy and adequacy of information gathered from user's request. In this paper a query ontology in accordance with web service description documents based on WSDL to facilitate web service discovery proposed.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114232854","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436078
Kobra Amiri Zirtol, Mahnaz Noroozi, Ziba Eslami
Searchable encryption is a cryptographic primitive that enables searching over encrypted data. Think over an organization that has outsourced its encrypted database. Consider the scenario in which each member of this organization can add encrypted data to the database but accessing the data is limited to certain predefined access structure. That is, only the members of authorized subsets of members can collaborate to search for a desired data and then decrypt the received ciphertexts. In this paper, we construct a scheme that enables such a scenario and supports general access structure.
{"title":"Multi-user searchable encryption scheme with general access structure","authors":"Kobra Amiri Zirtol, Mahnaz Noroozi, Ziba Eslami","doi":"10.1109/KBEI.2015.7436078","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436078","url":null,"abstract":"Searchable encryption is a cryptographic primitive that enables searching over encrypted data. Think over an organization that has outsourced its encrypted database. Consider the scenario in which each member of this organization can add encrypted data to the database but accessing the data is limited to certain predefined access structure. That is, only the members of authorized subsets of members can collaborate to search for a desired data and then decrypt the received ciphertexts. In this paper, we construct a scheme that enables such a scenario and supports general access structure.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125450915","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
扫码关注我们
求助内容：
应助结果提醒方式：