Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929121
Rasha M. El Azab, E. H. Shehab Eldin, P. Lataire, M. M. Sallam
Under Frequency Load Shedding, UFLS, is the last step and the most extreme in protecting electric power systems from black outs and severe damages. The nature of the load and the system voltage play very important roles in the dynamics of the power system. In the present paper, the frequency variation during overloading and the subsequent load shedding is examined experimentally for a single machine system loaded with loads of different natures (resistive and induction machine).The obtained results demonstrate a considerable change in frequency behavior when using different load models. This may be a significant step in minimizing load to be shed if the load model could be estimated adaptively.
{"title":"Factors affect on the UFLS: Experimental results","authors":"Rasha M. El Azab, E. H. Shehab Eldin, P. Lataire, M. M. Sallam","doi":"10.1109/SYSCON.2011.5929121","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929121","url":null,"abstract":"Under Frequency Load Shedding, UFLS, is the last step and the most extreme in protecting electric power systems from black outs and severe damages. The nature of the load and the system voltage play very important roles in the dynamics of the power system. In the present paper, the frequency variation during overloading and the subsequent load shedding is examined experimentally for a single machine system loaded with loads of different natures (resistive and induction machine).The obtained results demonstrate a considerable change in frequency behavior when using different load models. This may be a significant step in minimizing load to be shed if the load model could be estimated adaptively.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122212845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929125
Nawwar Kabbani, S. Tilley
This paper presents a systematic approach for a context-based evaluation of SOA testing tools, with an emphasis on security. An evaluation framework is used to structure a case study with a selection of SOA testing tools. The evaluation data are analyzed and discussed to show the tools' strengths and weaknesses. This research reveals three main results. The first result highlights the gap between research works in the literature and the capabilities of the existing tools. The second result is a qualitative evaluation of the capabilities of the tools under study with respect to the case study context. The third result is general conclusions and lessons learned from the application of the evaluation process.
{"title":"Evaluating the capabilities of SOA security testing tools","authors":"Nawwar Kabbani, S. Tilley","doi":"10.1109/SYSCON.2011.5929125","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929125","url":null,"abstract":"This paper presents a systematic approach for a context-based evaluation of SOA testing tools, with an emphasis on security. An evaluation framework is used to structure a case study with a selection of SOA testing tools. The evaluation data are analyzed and discussed to show the tools' strengths and weaknesses. This research reveals three main results. The first result highlights the gap between research works in the literature and the capabilities of the existing tools. The second result is a qualitative evaluation of the capabilities of the tools under study with respect to the case study context. The third result is general conclusions and lessons learned from the application of the evaluation process.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126111657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929069
A. Mitchell, Katherine Wallace, J. R. Wirthlin
In 2000 just 17% of bachelor's degrees in the United States were in science and engineering while other countries boasted far more graduates. Additionally, by 2010, the U.S. share of world science and engineering PhDs will decrease by approximately 15%. The Department of Defense has issued a call for additional systems engineers. However, attaining advanced degrees is difficult as military students face a wide variety of issues contributing to a large incompletion rate. A need for a better educational structure exists in order to address the needs of military community. In response to this recognized need, several potential solutions emerged from a workshop called to address these issues. This paper outlines many of these solutions and advocates for their implementation.
{"title":"Addressing the challenges educating system engineers for the Armed Forces","authors":"A. Mitchell, Katherine Wallace, J. R. Wirthlin","doi":"10.1109/SYSCON.2011.5929069","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929069","url":null,"abstract":"In 2000 just 17% of bachelor's degrees in the United States were in science and engineering while other countries boasted far more graduates. Additionally, by 2010, the U.S. share of world science and engineering PhDs will decrease by approximately 15%. The Department of Defense has issued a call for additional systems engineers. However, attaining advanced degrees is difficult as military students face a wide variety of issues contributing to a large incompletion rate. A need for a better educational structure exists in order to address the needs of military community. In response to this recognized need, several potential solutions emerged from a workshop called to address these issues. This paper outlines many of these solutions and advocates for their implementation.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128857173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929061
Marwa Fouad, A. El Saddik, Jiying Zhao, E. Petriu
In recent years biometric cryptosystem evolved as a means for solving key management issues as well as protecting biometric templates. The fuzzy vault is a well known cryptotographic construction well suited for biometric systems. It has been studied theoretically as well as practically implemented in biometric systems using different biometric traits. When implemented in iris-based biometric system, the fuzzy vault faces two main challenges: 1) it requires an unordered set for successful implementation, and 2) it needs to deal with intra-class variations. In this paper, we implement a fuzzy vault based on the iris templates. A modified fuzzy vault resolves the issue of unordered set and error correction coding is used to deal with intra-class variations. An iris shuffling algorithm is also integrated into the system to ensure revocability. The proposed structure can be integrated with existing databases using binary iris templates and hence does not require the redesign of the biometric authentication system. Revocability ensures that even if the system is compromised new templates can be issued without compromising privacy of the individuals. The system is evaluated using the CASIA database and results show that the system is successful in ensuring security and revocability of the iris templates without compromising the performance
{"title":"A fuzzy vault implementation for securing revocable iris templates","authors":"Marwa Fouad, A. El Saddik, Jiying Zhao, E. Petriu","doi":"10.1109/SYSCON.2011.5929061","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929061","url":null,"abstract":"In recent years biometric cryptosystem evolved as a means for solving key management issues as well as protecting biometric templates. The fuzzy vault is a well known cryptotographic construction well suited for biometric systems. It has been studied theoretically as well as practically implemented in biometric systems using different biometric traits. When implemented in iris-based biometric system, the fuzzy vault faces two main challenges: 1) it requires an unordered set for successful implementation, and 2) it needs to deal with intra-class variations. In this paper, we implement a fuzzy vault based on the iris templates. A modified fuzzy vault resolves the issue of unordered set and error correction coding is used to deal with intra-class variations. An iris shuffling algorithm is also integrated into the system to ensure revocability. The proposed structure can be integrated with existing databases using binary iris templates and hence does not require the redesign of the biometric authentication system. Revocability ensures that even if the system is compromised new templates can be issued without compromising privacy of the individuals. The system is evaluated using the CASIA database and results show that the system is successful in ensuring security and revocability of the iris templates without compromising the performance","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122056014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929033
I. Astrov, A. Pedai
This paper focuses on a critical component of the situational awareness (SA), the control of autonomous vertical flight for an unmanned aerial vehicle (UAV). With the SA strategy, we proposed a two stage flight control procedure to address the dynamics variation and performance requirement difference in initial and final stages of flight trajectory for a nontrivial nonlinear model of four-rotor helicopter robot called drone. This control strategy for chosen drone model has been verified by simulation of hovering maneuvers using software package Simulink and demonstrated good performance for fast stabilization of engines in hovering, consequently, fast SA with economy in energy of batteries can be asserted during the flight.
{"title":"Situational awareness based flight control of a drone","authors":"I. Astrov, A. Pedai","doi":"10.1109/SYSCON.2011.5929033","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929033","url":null,"abstract":"This paper focuses on a critical component of the situational awareness (SA), the control of autonomous vertical flight for an unmanned aerial vehicle (UAV). With the SA strategy, we proposed a two stage flight control procedure to address the dynamics variation and performance requirement difference in initial and final stages of flight trajectory for a nontrivial nonlinear model of four-rotor helicopter robot called drone. This control strategy for chosen drone model has been verified by simulation of hovering maneuvers using software package Simulink and demonstrated good performance for fast stabilization of engines in hovering, consequently, fast SA with economy in energy of batteries can be asserted during the flight.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121835064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929040
Sumit Kumar Bose, Scott Brock, Ronald Skeoch, N. Shaikh, Shrisha Rao
Migrating virtual machines (VM) at run time within acceptable time limits is significantly challenging due to large size of the virtual disk files. In this paper, we propose our framework called cloudspider to overcome this challenge by combining replication and scheduling of VM images into a common framework. In particular, we replicate VM images apriori onto a few chosen cloud sites and select one of the replicas of the VM image to be the primary copy. Based on dynamically changing cost parameters at these cloud sites, the scheduler can appropriately select a different replica of a VM image to be the primary copy. The updates at the primary copy are incrementally propagated to the remaining copies. In order to bring down the cost of storage requirement due to the additional replicas our work proposes the use of deduplication techniques. In this paper we address the question of replica placement of VM images when disparate VM images have varying degrees of commonality and latency requirements. The replication algorithm has been implemented and tested using an open-source cloud simulator called CloudSim and the initial results are quite promising.
{"title":"Optimizing live migration of virtual machines across wide area networks using integrated replication and scheduling","authors":"Sumit Kumar Bose, Scott Brock, Ronald Skeoch, N. Shaikh, Shrisha Rao","doi":"10.1109/SYSCON.2011.5929040","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929040","url":null,"abstract":"Migrating virtual machines (VM) at run time within acceptable time limits is significantly challenging due to large size of the virtual disk files. In this paper, we propose our framework called cloudspider to overcome this challenge by combining replication and scheduling of VM images into a common framework. In particular, we replicate VM images apriori onto a few chosen cloud sites and select one of the replicas of the VM image to be the primary copy. Based on dynamically changing cost parameters at these cloud sites, the scheduler can appropriately select a different replica of a VM image to be the primary copy. The updates at the primary copy are incrementally propagated to the remaining copies. In order to bring down the cost of storage requirement due to the additional replicas our work proposes the use of deduplication techniques. In this paper we address the question of replica placement of VM images when disparate VM images have varying degrees of commonality and latency requirements. The replication algorithm has been implemented and tested using an open-source cloud simulator called CloudSim and the initial results are quite promising.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130892654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929081
A. Hatami Hardoroudi, Ali Farhang Dareshuri, Haslina Md.Sarkan, M. Nourizadeh
Corrective and preventive action (CAPA) procedure in most organizations is merely used to log problems. These organizations do not implement a robust CAPA process, and as a result they are still struggling today with CAPA. Many firms have been using root cause analysis and corrective action program. A case study on a company which has long recognized that using a good root cause, corrective and preventive action program is crucial to satisfy its customers, has been conducted. This is to help managers to make decisions effectively. Initially CAPA was not properly implemented and not cost-effective for the company. For example, it could not meet the operational management's needs timely, efficiently and effectively. Therefore, the authors had conducted a secondary research and adopted a universal process & quality standards from CMMI Level 5 & ISO 20000 on the top levels of the CAPA procedure in order to improve the CAPA issues.
{"title":"Robust corrective and preventive action(CAPA)","authors":"A. Hatami Hardoroudi, Ali Farhang Dareshuri, Haslina Md.Sarkan, M. Nourizadeh","doi":"10.1109/SYSCON.2011.5929081","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929081","url":null,"abstract":"Corrective and preventive action (CAPA) procedure in most organizations is merely used to log problems. These organizations do not implement a robust CAPA process, and as a result they are still struggling today with CAPA. Many firms have been using root cause analysis and corrective action program. A case study on a company which has long recognized that using a good root cause, corrective and preventive action program is crucial to satisfy its customers, has been conducted. This is to help managers to make decisions effectively. Initially CAPA was not properly implemented and not cost-effective for the company. For example, it could not meet the operational management's needs timely, efficiently and effectively. Therefore, the authors had conducted a secondary research and adopted a universal process & quality standards from CMMI Level 5 & ISO 20000 on the top levels of the CAPA procedure in order to improve the CAPA issues.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133935885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929059
S. Blouin
Multiple autonomous agents measuring the same phenomenon and communicating randomly among themselves may or may not reach an agreement in finite time depending on the system design and communication pattern. We exploit here the consensus concept for investigating if and how such a collective agreement among agents can be accelerated. Indeed an accelerated consensus has many benefits for situations where time is critical such as emergency response or surveillance teams made of geographically dispersed network agents. Specifically we look at accelerating consensus of random networks made of independent agents with unidirectional (one-way) communication capabilities. In particular we propose a sub-network consensus concept and show how the proposed scheme relates to a lower bound for the conventional network state variance. Also we derive sufficient conditions for accelerating consensus through the manipulation of information relevance, which can be associated to the edge weights of a directed graph.
{"title":"Sufficient conditions for accelerated consensus over random networks","authors":"S. Blouin","doi":"10.1109/SYSCON.2011.5929059","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929059","url":null,"abstract":"Multiple autonomous agents measuring the same phenomenon and communicating randomly among themselves may or may not reach an agreement in finite time depending on the system design and communication pattern. We exploit here the consensus concept for investigating if and how such a collective agreement among agents can be accelerated. Indeed an accelerated consensus has many benefits for situations where time is critical such as emergency response or surveillance teams made of geographically dispersed network agents. Specifically we look at accelerating consensus of random networks made of independent agents with unidirectional (one-way) communication capabilities. In particular we propose a sub-network consensus concept and show how the proposed scheme relates to a lower bound for the conventional network state variance. Also we derive sufficient conditions for accelerating consensus through the manipulation of information relevance, which can be associated to the edge weights of a directed graph.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122197684","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}
In the recent past, there have been rapid advances in the technology of processors, storage and networks, leading to technologies like cloud computing. However, amid all these advances, performance of clouds and cloud services continues to present challenges. Access latencies to the information on the cloud due to variable bandwidth continues to be a serious problem of research; more so in environments requiring mobile devices to stay connected to the cloud. One way to smooth out bumps in bandwidth available is to use anticipatory retrieval of data, and to cache data that is likely to be requested later. The proposed anticipatory retrieval and caching system is a solution that takes this path. It offers a better experience to those mobile users who are connected to a cloud and make frequent access to the cloud's datastore. The proposed method aims to provide ubiquitous access to data on clouds regardless of the bandwidth levels. This is done by locally caching all the one-hop related item-sets I1; I2; … ; Ik semantically belonging to (or semantically linked to) a particular item-set I′. Caching is done asynchronously in the background during times of high bandwidth. The proposed algorithms assess the semantic relevance of the data using semantic distances along with user priorities and availability of bandwidth, and then prioritizes anticipatory data downloads on to the cloud's storage based on the relevance quotient.
{"title":"Anticipatory retrieval and caching of data for mobile devices in variable-bandwidth environments","authors":"Bharath Cheluvaraju, Aravalli Srinivasa Ramachandra Kousik, Shrisha Rao","doi":"10.1109/SYSCON.2011.5929049","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929049","url":null,"abstract":"In the recent past, there have been rapid advances in the technology of processors, storage and networks, leading to technologies like cloud computing. However, amid all these advances, performance of clouds and cloud services continues to present challenges. Access latencies to the information on the cloud due to variable bandwidth continues to be a serious problem of research; more so in environments requiring mobile devices to stay connected to the cloud. One way to smooth out bumps in bandwidth available is to use anticipatory retrieval of data, and to cache data that is likely to be requested later. The proposed anticipatory retrieval and caching system is a solution that takes this path. It offers a better experience to those mobile users who are connected to a cloud and make frequent access to the cloud's datastore. The proposed method aims to provide ubiquitous access to data on clouds regardless of the bandwidth levels. This is done by locally caching all the one-hop related item-sets I1; I2; … ; Ik semantically belonging to (or semantically linked to) a particular item-set I′. Caching is done asynchronously in the background during times of high bandwidth. The proposed algorithms assess the semantic relevance of the data using semantic distances along with user priorities and availability of bandwidth, and then prioritizes anticipatory data downloads on to the cloud's storage based on the relevance quotient.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114310328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-04DOI: 10.1109/SYSCON.2011.5929042
C. Boucher, J. Noyer
This paper presents a method to detect missing roads and to update GIS map databases from GPS data. It relies on an extended Kalman filter that fuses, in a centralized fusion scheme, available GPS and road map data. The map is modeled as an additional sensor which allows a direct modeling of the map errors and uncertainties. A probabilistic map-matching algorithm is used to manage the road network database through the computation of the Mahalanobis distance. We show experimental results from an urban transport network scenario where roads are missing, due to an outdated database.
{"title":"Updating road network databases using GNSS","authors":"C. Boucher, J. Noyer","doi":"10.1109/SYSCON.2011.5929042","DOIUrl":"https://doi.org/10.1109/SYSCON.2011.5929042","url":null,"abstract":"This paper presents a method to detect missing roads and to update GIS map databases from GPS data. It relies on an extended Kalman filter that fuses, in a centralized fusion scheme, available GPS and road map data. The map is modeled as an additional sensor which allows a direct modeling of the map errors and uncertainties. A probabilistic map-matching algorithm is used to manage the road network database through the computation of the Mahalanobis distance. We show experimental results from an urban transport network scenario where roads are missing, due to an outdated database.","PeriodicalId":109868,"journal":{"name":"2011 IEEE International Systems Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121783614","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
扫码关注我们
求助内容：
应助结果提醒方式：