Pub Date : 2017-12-23DOI: 10.1504/IJAISC.2017.10009793
M. Kalyani, P. H. Chandra, S. Kalavathy
In the field of the DNA computing, splicing system was proposed by Tom Head in which the splicing operation is used. Various models have been studied with mate operation working on strings. The operations mate and drip considered in membrane computing resemble the operations cut and recombination well known from the DNA computing. Recently, a new generative model called array P system with mate operation has been introduced. In this paper, we incorporate the t-communicating and permitting features in the rules of array P system with mate operation and develop the generating picture languages consisting of picture arrays. This enables us to reduce the number of membranes used in the existing array P system models.
{"title":"Array P system with t-communicating and permitting mate operation","authors":"M. Kalyani, P. H. Chandra, S. Kalavathy","doi":"10.1504/IJAISC.2017.10009793","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10009793","url":null,"abstract":"In the field of the DNA computing, splicing system was proposed by Tom Head in which the splicing operation is used. Various models have been studied with mate operation working on strings. The operations mate and drip considered in membrane computing resemble the operations cut and recombination well known from the DNA computing. Recently, a new generative model called array P system with mate operation has been introduced. In this paper, we incorporate the t-communicating and permitting features in the rules of array P system with mate operation and develop the generating picture languages consisting of picture arrays. This enables us to reduce the number of membranes used in the existing array P system models.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128583219","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 : 2017-12-23DOI: 10.1504/IJAISC.2017.10009789
N. Sivakumar, A. Alaraj
In ad hoc mobile wireless networks, energy consumption is an important issue as most mobile hosts operate on limited battery resources. Most of the existing ad hoc routing algorithms select the shortest path using various resources (energy). Approach: to overcome these problems an optimal path management approach called path vector calculation based on fuzzy and rough set theory were addressed. The ultimate intent of this study is to select the qualified path based on energy consumption of the node in the network. Simple rules were generated using fuzzy and rough set techniques for calculating path vector and to remove irrelevant attributes (resources) for evaluating the best routing. The set of rules were evaluated with proactive protocols namely fisheye state routing (FSR) protocol in the NS-2 simulation environment based on metrics such as total energy consumed, average energy consumed, overall residual energy and average residual energy and it also considers the importance of the objects (nodes). The results have shown that in MANET, decision rules with fuzzy and rough set technique has provided qualified path based best routing. The network life time and performance of proactive protocols in MANET has improved with fuzzy and rough set based decision rules.
{"title":"Path management strategy to reduce flooding of grid fisheye state routing protocol in mobile ad hoc network using fuzzy and rough set theory","authors":"N. Sivakumar, A. Alaraj","doi":"10.1504/IJAISC.2017.10009789","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10009789","url":null,"abstract":"In ad hoc mobile wireless networks, energy consumption is an important issue as most mobile hosts operate on limited battery resources. Most of the existing ad hoc routing algorithms select the shortest path using various resources (energy). Approach: to overcome these problems an optimal path management approach called path vector calculation based on fuzzy and rough set theory were addressed. The ultimate intent of this study is to select the qualified path based on energy consumption of the node in the network. Simple rules were generated using fuzzy and rough set techniques for calculating path vector and to remove irrelevant attributes (resources) for evaluating the best routing. The set of rules were evaluated with proactive protocols namely fisheye state routing (FSR) protocol in the NS-2 simulation environment based on metrics such as total energy consumed, average energy consumed, overall residual energy and average residual energy and it also considers the importance of the objects (nodes). The results have shown that in MANET, decision rules with fuzzy and rough set technique has provided qualified path based best routing. The network life time and performance of proactive protocols in MANET has improved with fuzzy and rough set based decision rules.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114045796","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 : 2017-12-23DOI: 10.1504/IJAISC.2017.10009796
S. Immanuel, D. G. Thomas
In this paper, we extend the concept of double jumping automata for string languages recently introduced in the literature to two-dimensional languages, also called as picture languages. The paper is a modification and study of jumping finite automata for two-dimensional languages already introduced in the literature, where they always perform two simultaneous row-jumps over a row of an input array according to the same rule which is defined. The direction of either of the two simultaneous row-jumps is: 1) left; 2) right or 3) in either direction. Based on the directions of the two simultaneous jumps, we give the classification of the jumping finite automata for two-dimensional languages. The mutual relationship between the families of languages accepted by the two-dimensional jumping finite automata performing the jumps in the ways as mentioned above are investigated. We also give the comparison of these families with that of local and recognisable families of languages and families of Siromoney matrix languages.
{"title":"Two-dimensional double jumping finite automata","authors":"S. Immanuel, D. G. Thomas","doi":"10.1504/IJAISC.2017.10009796","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10009796","url":null,"abstract":"In this paper, we extend the concept of double jumping automata for string languages recently introduced in the literature to two-dimensional languages, also called as picture languages. The paper is a modification and study of jumping finite automata for two-dimensional languages already introduced in the literature, where they always perform two simultaneous row-jumps over a row of an input array according to the same rule which is defined. The direction of either of the two simultaneous row-jumps is: 1) left; 2) right or 3) in either direction. Based on the directions of the two simultaneous jumps, we give the classification of the jumping finite automata for two-dimensional languages. The mutual relationship between the families of languages accepted by the two-dimensional jumping finite automata performing the jumps in the ways as mentioned above are investigated. We also give the comparison of these families with that of local and recognisable families of languages and families of Siromoney matrix languages.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133840244","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 : 2017-12-23DOI: 10.1504/IJAISC.2017.10009794
D. Arivudainambi, M. Gowsalya
The proposed queueing model discusses a single server retrial queueing system subject to a Bernoulli vacation, two types of service and starting failure. The single server provides two types of service in which the customer either chooses type 1 service or type 2 services. We assume that the server may subject to starting failure. After each service completion the server will take a Bernoulli vacation. For such queueing model the necessary and sufficient condition for steady state has been derived. The model has been solved through use of supplementary variable technique. To validate the proposed model some performance measures, special cases and numerical illustrations have been discussed.
{"title":"Analysis of an M/G/1 retrial queue with Bernoulli vacation, two types of service and starting failure","authors":"D. Arivudainambi, M. Gowsalya","doi":"10.1504/IJAISC.2017.10009794","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10009794","url":null,"abstract":"The proposed queueing model discusses a single server retrial queueing system subject to a Bernoulli vacation, two types of service and starting failure. The single server provides two types of service in which the customer either chooses type 1 service or type 2 services. We assume that the server may subject to starting failure. After each service completion the server will take a Bernoulli vacation. For such queueing model the necessary and sufficient condition for steady state has been derived. The model has been solved through use of supplementary variable technique. To validate the proposed model some performance measures, special cases and numerical illustrations have been discussed.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127228423","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 : 2017-12-23DOI: 10.1504/IJAISC.2017.10009788
D. Samuel, P. Abisha
In language theory based cryptography, a block cipher based on Gluskov product of automata was considered and studied. On the other hand the concept of cooperating distributed grammar systems (CDGS) was introduced and studied by Csuhaj-Varju and Dassow. Motivated by this cryptosystem, we introduce a block cipher based on CDGS which has better security with regard to avalanche effect and is suitable for implementation.
{"title":"A novel cryptosystem based on cooperating distributed grammar systems","authors":"D. Samuel, P. Abisha","doi":"10.1504/IJAISC.2017.10009788","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10009788","url":null,"abstract":"In language theory based cryptography, a block cipher based on Gluskov product of automata was considered and studied. On the other hand the concept of cooperating distributed grammar systems (CDGS) was introduced and studied by Csuhaj-Varju and Dassow. Motivated by this cryptosystem, we introduce a block cipher based on CDGS which has better security with regard to avalanche effect and is suitable for implementation.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527108","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 : 2017-06-21DOI: 10.1504/IJAISC.2017.10005615
A. Thakare, L. Bhagat, A. Thomas
Wireless sensor networks area collection of a large number of unattended sensor nodes. The sensor nodes are dynamically deployed in the region. In wireless sensor networks, the unlicensed sensor nodes use their temporarily available vacant licensed channels or spectrum band in a telecommunication network. The many open challenges with issues such as adaptive in self-organisation, fault-tolerance and network scalability with cooperative spectrum sensing and sharing are identifying new challenges in wireless sensor networks. In this paper, we proposed the bio-inspired adaptive routing algorithm for cognitive radio wireless sensor networks. The utilisation of the foraging approach of ANTs and BEEs for making the decision of using the available spectrum sensing and sharing of channels over multi-hops communication, provides the method to utilise idle channel and decrease the delay for communication in wireless sensor network. In this paper, we design the algorithm to solve the issue of wireless sensor network and performance of classical routing protocol LEACH and cognitive radio sensor networks (CRSN) evaluates the parameters which proof the self-organisation routing algorithm.
{"title":"A self-organised routing algorithm for cognitive radio-based wireless sensor networks using biologically-inspired method","authors":"A. Thakare, L. Bhagat, A. Thomas","doi":"10.1504/IJAISC.2017.10005615","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005615","url":null,"abstract":"Wireless sensor networks area collection of a large number of unattended sensor nodes. The sensor nodes are dynamically deployed in the region. In wireless sensor networks, the unlicensed sensor nodes use their temporarily available vacant licensed channels or spectrum band in a telecommunication network. The many open challenges with issues such as adaptive in self-organisation, fault-tolerance and network scalability with cooperative spectrum sensing and sharing are identifying new challenges in wireless sensor networks. In this paper, we proposed the bio-inspired adaptive routing algorithm for cognitive radio wireless sensor networks. The utilisation of the foraging approach of ANTs and BEEs for making the decision of using the available spectrum sensing and sharing of channels over multi-hops communication, provides the method to utilise idle channel and decrease the delay for communication in wireless sensor network. In this paper, we design the algorithm to solve the issue of wireless sensor network and performance of classical routing protocol LEACH and cognitive radio sensor networks (CRSN) evaluates the parameters which proof the self-organisation routing algorithm.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"104 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117311271","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 : 2017-06-21DOI: 10.1504/IJAISC.2017.10005624
Shruti Parashar, J. Senthilnath, Xin-She Yang
In this paper, the application of nature-inspired algorithms (NIA) along with fuzzy classifiers is studied. The four algorithms used for the analysis are genetic algorithm, particle swarm optimisation, artificial bee colony and bat algorithm. These algorithms are used on three standard benchmark datasets and one real-time multi-spectral satellite dataset. The results obtained using different fuzzy-NIAs are analysed. Finally, we observe that the fuzzy classifiers under a given set of parameters perform more accurately when applied with the bat algorithm.
{"title":"A novel bat algorithm fuzzy classifier approach for classification problems","authors":"Shruti Parashar, J. Senthilnath, Xin-She Yang","doi":"10.1504/IJAISC.2017.10005624","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005624","url":null,"abstract":"In this paper, the application of nature-inspired algorithms (NIA) along with fuzzy classifiers is studied. The four algorithms used for the analysis are genetic algorithm, particle swarm optimisation, artificial bee colony and bat algorithm. These algorithms are used on three standard benchmark datasets and one real-time multi-spectral satellite dataset. The results obtained using different fuzzy-NIAs are analysed. Finally, we observe that the fuzzy classifiers under a given set of parameters perform more accurately when applied with the bat algorithm.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128082103","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 : 2017-06-21DOI: 10.1504/IJAISC.2017.10005612
L. Arafeh
Higher education institutions are increasingly implementing eLearning means to meet the increasing demand of students' enrolment. Current eLearning quality models have been reviewed. A two-stage softcomputing eLearning quality model, SCeQLM, is proposed. The SCeQLM model is based on ten critical success factors (CSFs). Characteristics of each CSF are modelled, the outputs input into the second stage, to produce the overall output of the SCeLQM model. This output will be either low, satisfactory, good or high. To validate the adequacy of these models, correlation coefficient and mean absolute percentage error (MAPE) have been used. We achieved correlation coefficients values of higher than 0.9905 and MAPE values lower than 1.722 for all the models. The promising results indicate the relevance to apply the modelling techniques, neurofuzzy, for this type of problems. As a future work, our goal will be to further investigate, enhance and develop a web-based SCeLQM version.
{"title":"A neurofuzzy-based quality of eLearning model","authors":"L. Arafeh","doi":"10.1504/IJAISC.2017.10005612","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005612","url":null,"abstract":"Higher education institutions are increasingly implementing eLearning means to meet the increasing demand of students' enrolment. Current eLearning quality models have been reviewed. A two-stage softcomputing eLearning quality model, SCeQLM, is proposed. The SCeQLM model is based on ten critical success factors (CSFs). Characteristics of each CSF are modelled, the outputs input into the second stage, to produce the overall output of the SCeLQM model. This output will be either low, satisfactory, good or high. To validate the adequacy of these models, correlation coefficient and mean absolute percentage error (MAPE) have been used. We achieved correlation coefficients values of higher than 0.9905 and MAPE values lower than 1.722 for all the models. The promising results indicate the relevance to apply the modelling techniques, neurofuzzy, for this type of problems. As a future work, our goal will be to further investigate, enhance and develop a web-based SCeLQM version.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130126088","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 : 2017-06-21DOI: 10.1504/IJAISC.2017.10005629
Moussa Kaouan, D. Bouchiha, S. Benslimane, Sofiane Boukli-Hacene
Web services become increasingly important in the world of internet. Thus, users need to access and effectively share web services. The centralised UDDI is a less robust structure and does not support a large number of web services. If the distributed environment is introduced into the UDDI, there will be a rapid increase in services with minimisation of resource consumption. Accordingly, mechanisms are needed for efficient selection of the appropriate instance of the web service in terms of factors like quality and performance. Distribution mechanisms, clustering and classification are necessary for efficient selection of the appropriate web service to the customer needs. In this paper, we propose a shared repository (ontology) which is produced by clustering of web services. This ontology can be exploited by the UDDI for publishing and discovering web services. A matching algorithm is also proposed to show how to perform this operation. A prototype tool has been developed to support experiments that have been carried out to evaluate and show the efficiency of our matching algorithm. We also introduce a comparative analysis to show the effectiveness of our approach compared to existing works.
{"title":"Ontology-based web services classification for registration and discovery of web services","authors":"Moussa Kaouan, D. Bouchiha, S. Benslimane, Sofiane Boukli-Hacene","doi":"10.1504/IJAISC.2017.10005629","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005629","url":null,"abstract":"Web services become increasingly important in the world of internet. Thus, users need to access and effectively share web services. The centralised UDDI is a less robust structure and does not support a large number of web services. If the distributed environment is introduced into the UDDI, there will be a rapid increase in services with minimisation of resource consumption. Accordingly, mechanisms are needed for efficient selection of the appropriate instance of the web service in terms of factors like quality and performance. Distribution mechanisms, clustering and classification are necessary for efficient selection of the appropriate web service to the customer needs. In this paper, we propose a shared repository (ontology) which is produced by clustering of web services. This ontology can be exploited by the UDDI for publishing and discovering web services. A matching algorithm is also proposed to show how to perform this operation. A prototype tool has been developed to support experiments that have been carried out to evaluate and show the efficiency of our matching algorithm. We also introduce a comparative analysis to show the effectiveness of our approach compared to existing works.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121852040","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 : 2017-05-24DOI: 10.1504/IJAISC.2017.10005161
Jyotsna Nigam, M. Tushir, D. Rai
In the past few years, the kernel-based clustering methods have overpowered the conventional clustering techniques in the field of unsupervised learning due to its strength and effectiveness to deal with nonlinearly separable data and mapping it into higher dimensional feature space by preserving the inner structure of the data. Many kernel functions exist in the literature which works effectively depending on the type of dataset to be used. In this paper, we have proposed a new log kernel function which is embedded in the unsupervised possibilistic clustering and this kernel function is not explored much in research. We have done extensive comparison of the proposed algorithm with few clustering techniques over a test suite of several synthetic and real life datasets. Based on the experimental results, we have proved that our algorithm gives better performance than the previous methods on various comparative parameters like ideal centroids, error rate, misclassification, accuracy and elapsed time.
{"title":"A conditionally positive definite kernel function for possibilistic clustering","authors":"Jyotsna Nigam, M. Tushir, D. Rai","doi":"10.1504/IJAISC.2017.10005161","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005161","url":null,"abstract":"In the past few years, the kernel-based clustering methods have overpowered the conventional clustering techniques in the field of unsupervised learning due to its strength and effectiveness to deal with nonlinearly separable data and mapping it into higher dimensional feature space by preserving the inner structure of the data. Many kernel functions exist in the literature which works effectively depending on the type of dataset to be used. In this paper, we have proposed a new log kernel function which is embedded in the unsupervised possibilistic clustering and this kernel function is not explored much in research. We have done extensive comparison of the proposed algorithm with few clustering techniques over a test suite of several synthetic and real life datasets. Based on the experimental results, we have proved that our algorithm gives better performance than the previous methods on various comparative parameters like ideal centroids, error rate, misclassification, accuracy and elapsed time.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134329027","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
扫码关注我们
求助内容：
应助结果提醒方式：