In the existing face hallucination approach using Locality Preserving Projections (LPP), the weight in neighborhood graph is artificially predefined, and this scheme does not benefit for subsequent learning process. That may bring about some uncertainty situation in the performance of algorithm. In this paper we use a novel dimension reduction algorithm called Graph-optimized Locality Preserving Projections(GoLPP), which takes construction of neighborhood graph in a optimal way. Then, Generalized Regression Neural Network (GRNN) is used to predict the global high resolution face image. However, the face image obtained by GRNN is smooth and lack of high frequency information. To enhance the image visual quality, a patch based Residual model is adopted. Experiment results show that the proposed approach can reconstruct high resolution face image efficiently, and the performance is better than other methods based LPP.
{"title":"Face Hallucination via Using the Graph-Optimal Locality Preserving Projections","authors":"Rongfang Yang, Yunqiong Wang, De-Shun Yang, Tianwei Xu, Juxiang Zhou","doi":"10.1109/ICIS.2011.36","DOIUrl":"https://doi.org/10.1109/ICIS.2011.36","url":null,"abstract":"In the existing face hallucination approach using Locality Preserving Projections (LPP), the weight in neighborhood graph is artificially predefined, and this scheme does not benefit for subsequent learning process. That may bring about some uncertainty situation in the performance of algorithm. In this paper we use a novel dimension reduction algorithm called Graph-optimized Locality Preserving Projections(GoLPP), which takes construction of neighborhood graph in a optimal way. Then, Generalized Regression Neural Network (GRNN) is used to predict the global high resolution face image. However, the face image obtained by GRNN is smooth and lack of high frequency information. To enhance the image visual quality, a patch based Residual model is adopted. Experiment results show that the proposed approach can reconstruct high resolution face image efficiently, and the performance is better than other methods based LPP.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116521442","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 Multiprocessor System-on-Chip is becoming a promising solution for the future complex computers and embedded systems, which are requiring higher performances. This paper addresses the inherent unreliability and instability of the multiple uncertain characteristics of complex embedded multiprocessor systems. In this work, we propose a fuzzy sets description for the multiple uncertain characteristics of system, and using fuzzy set membership calculation to determine the scheduling priorities of tasks and resources, in order to improve the capability of concurrent executions of tasks. And also we present a method estimation of comprehensive analysis on the multiple performances in order to increase utilization factor and balancing loads on processors. We implemented a prototype MPSoC system design, which utilizes the proposed fuzzy dynamic scheduling algorithm to allocating tasks onto the multiprocessors. And in our case study, we design a parallel architecture h.264 encoder, running on a multicore MPSoC system on FPGA.
{"title":"Multiprocessor System-on-Chip Design with Fuzzy Dynamic Scheduling for Parallel Video Processing","authors":"Da Li, Yibin Hou, Zhangqin Huang, C. Xiao","doi":"10.1109/ICIS.2011.19","DOIUrl":"https://doi.org/10.1109/ICIS.2011.19","url":null,"abstract":"The Multiprocessor System-on-Chip is becoming a promising solution for the future complex computers and embedded systems, which are requiring higher performances. This paper addresses the inherent unreliability and instability of the multiple uncertain characteristics of complex embedded multiprocessor systems. In this work, we propose a fuzzy sets description for the multiple uncertain characteristics of system, and using fuzzy set membership calculation to determine the scheduling priorities of tasks and resources, in order to improve the capability of concurrent executions of tasks. And also we present a method estimation of comprehensive analysis on the multiple performances in order to increase utilization factor and balancing loads on processors. We implemented a prototype MPSoC system design, which utilizes the proposed fuzzy dynamic scheduling algorithm to allocating tasks onto the multiprocessors. And in our case study, we design a parallel architecture h.264 encoder, running on a multicore MPSoC system on FPGA.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123656765","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}
To prevent cost overrun of software projects, it is necessary for project managers to identify projects which have high risk of cost overrun in the early phase. So far, discriminant methods such as linear discriminant analysis and logistic regression have been used to predict cost overrun projects. However, accuracy of discriminant methods often becomes low when a dataset used for predict is imbalanced, i.e. there exists a large difference between the number of cost overrun projects and non cost overrun projects. In this paper, we compared accuracy of linear discriminant analysis, logistic regression, classification tree, Mahalanobis-Taguchi method, and collaborative filtering, by changing the percentage of cost overrun projects in the dataset. The result showed that collaborative filtering was highest accuracy among five methods. When the number of cost overrun projects and non cost overrun was balanced in the dataset, linear discriminant analysis was second highest accuracy, and when it was not balanced, Mahalanobis-Taguchi method was second highest among five methods.
{"title":"Empirical Evaluation of Cost Overrun Prediction with Imbalance Data","authors":"Masateru Tsunoda, Akito Monden, Jun-ichiro Shibata, Ken-ichi Matsumoto","doi":"10.1109/ICIS.2011.71","DOIUrl":"https://doi.org/10.1109/ICIS.2011.71","url":null,"abstract":"To prevent cost overrun of software projects, it is necessary for project managers to identify projects which have high risk of cost overrun in the early phase. So far, discriminant methods such as linear discriminant analysis and logistic regression have been used to predict cost overrun projects. However, accuracy of discriminant methods often becomes low when a dataset used for predict is imbalanced, i.e. there exists a large difference between the number of cost overrun projects and non cost overrun projects. In this paper, we compared accuracy of linear discriminant analysis, logistic regression, classification tree, Mahalanobis-Taguchi method, and collaborative filtering, by changing the percentage of cost overrun projects in the dataset. The result showed that collaborative filtering was highest accuracy among five methods. When the number of cost overrun projects and non cost overrun was balanced in the dataset, linear discriminant analysis was second highest accuracy, and when it was not balanced, Mahalanobis-Taguchi method was second highest among five methods.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128070468","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 3rd generation partnership project (3GPP) long term evolution (LTE) standard has adopted orthogonal frequency division multiplexing access (OFDMA) in downlink and single carrier-frequency division multiple access (SC-FDMA) scheme for the uplink transmissions, which utilizes single carrier modulation and frequency domain equalization. In this paper, we proposed a power-function companding scheme to reduce the peak-to-average power ratio (PAPR) of SC-FDMA signals. The proposed companding scheme can transform the original SC-FDMA signals into power-function-distributed. Moreover, the scheme can compress the large signals, while maintaining the average power constant. Computer simulation results show that the proposed companding scheme can offer better PAPR reduction by properly choosing the control parameters.
{"title":"Power Function Companding Scheme for Peak-to-Average Power Ratio Reduction of SC-FDMA Signals","authors":"Enchang Sun, Pengbo Si, Ruizhe Yang, Yanhua Sun, Yanhua Zhang","doi":"10.1109/ICIS.2011.17","DOIUrl":"https://doi.org/10.1109/ICIS.2011.17","url":null,"abstract":"The 3rd generation partnership project (3GPP) long term evolution (LTE) standard has adopted orthogonal frequency division multiplexing access (OFDMA) in downlink and single carrier-frequency division multiple access (SC-FDMA) scheme for the uplink transmissions, which utilizes single carrier modulation and frequency domain equalization. In this paper, we proposed a power-function companding scheme to reduce the peak-to-average power ratio (PAPR) of SC-FDMA signals. The proposed companding scheme can transform the original SC-FDMA signals into power-function-distributed. Moreover, the scheme can compress the large signals, while maintaining the average power constant. Computer simulation results show that the proposed companding scheme can offer better PAPR reduction by properly choosing the control parameters.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131114078","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}
Language-based information flow security provides a way to enforce either the baseline noninterference property or more relaxed properties specifying intended information release. This paper presents a new approach for enforcing information release policy on programming language with I/O channels. First we present a relaxed security property complying with the security policy on the what-dimension of declassification. Second we propose an enforcement mechanism for the security property based on reach ability analysis of pushdown system. The self-composition is equipped with a store-match pattern, which reduces the cost of verification by avoiding duplication of I/O channels. The pattern also facilitates characterization of the security property. The experimental results show the preciseness of our enforcement.
{"title":"Enforcing Relaxed Declassifications with Reference Points","authors":"Cong Sun, Liyong Tang, Zhong Chen","doi":"10.1109/ICIS.2011.20","DOIUrl":"https://doi.org/10.1109/ICIS.2011.20","url":null,"abstract":"Language-based information flow security provides a way to enforce either the baseline noninterference property or more relaxed properties specifying intended information release. This paper presents a new approach for enforcing information release policy on programming language with I/O channels. First we present a relaxed security property complying with the security policy on the what-dimension of declassification. Second we propose an enforcement mechanism for the security property based on reach ability analysis of pushdown system. The self-composition is equipped with a store-match pattern, which reduces the cost of verification by avoiding duplication of I/O channels. The pattern also facilitates characterization of the security property. The experimental results show the preciseness of our enforcement.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133540963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes a new method for building detection and reconstruction from satellite images. In our approach, we propose to use divergence-based centroid neural network to carry out the grouping of 3D line segments. By grouping 3D line segments into the principal 3D lines which can constitute 3D rooftop model, the system significantly reduces the unnecessary line segments from low level feature extraction. Our grouping process consists of two steps. We carry out the first grouping process to group fragmented or duplicated 3D lines into the principal 3D lines which can be used to construct the rooftop model, and construct the groups of lines that are parallel each other in the second step. From the grouping result, 3D rooftop models are reconstructed by the final clustering process. We test the proposed method with high-resolution IKONOS stereo images. The experimental result proved the efficiency of the proposed method in the reconstruction of the rectilinear type of 3D rooftop model from high-resolution satellite imagery.
{"title":"Stereoscopic Building Reconstruction Using High-Resolution Satellite Image Data","authors":"Dong-Min Woo, Dong-Chul Park","doi":"10.1109/ICIS.2011.37","DOIUrl":"https://doi.org/10.1109/ICIS.2011.37","url":null,"abstract":"This paper proposes a new method for building detection and reconstruction from satellite images. In our approach, we propose to use divergence-based centroid neural network to carry out the grouping of 3D line segments. By grouping 3D line segments into the principal 3D lines which can constitute 3D rooftop model, the system significantly reduces the unnecessary line segments from low level feature extraction. Our grouping process consists of two steps. We carry out the first grouping process to group fragmented or duplicated 3D lines into the principal 3D lines which can be used to construct the rooftop model, and construct the groups of lines that are parallel each other in the second step. From the grouping result, 3D rooftop models are reconstructed by the final clustering process. We test the proposed method with high-resolution IKONOS stereo images. The experimental result proved the efficiency of the proposed method in the reconstruction of the rectilinear type of 3D rooftop model from high-resolution satellite imagery.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133447663","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}
S. A. Arzil, Majid Hosseinpour Aghdam, M. A. J. Jamali
Inter-Vehicle Communications (IVC) allows to exchange data among vehicles without requiring any fixed infrastructure in Vehicular Ad-hoc Networks (VANETs). Multi-hop data delivery through VANETs is challenging because of rapid topology changes and network fragmentation. To address this issue, we combine the idea of store-carry and forward (SCF) with routing scheme. In this paper, we proposed a novel routing protocol for VANETs, which is well adapted to continuously changing topology in such networks. Adaptive Vehicle Traces Routing (AVTR) includes a mechanism for tracking source and destination vehicles when they leave their expected locations and use packet forwarding policy at the intersection. When the network is sparse, we use SCF paradigm and vehicles as ferries for overcoming the network partitioning. Finally, our protocol is compared with two VANET routing protocols, VADD and GPSR*. The obtained results show that AVTR outperforms GPSR* and VADD in terms of both packet delivery ratio and average end-to-end delay of data packets. For example, under specific conditions that was considered in the simulations, when the total number of nodes varies in networks, the packet delivery ratio of AVTR is approximately 8% better than VADD and 70% better than GPSR*. Also, using our algorithm delivery delay has been enhanced more than 82% and 58% in comparison to VADD and GPSR* respectively.
{"title":"Adaptive Vehicle Traces Routing for Vehicular Ad-Hoc Network","authors":"S. A. Arzil, Majid Hosseinpour Aghdam, M. A. J. Jamali","doi":"10.1109/ICIS.2011.15","DOIUrl":"https://doi.org/10.1109/ICIS.2011.15","url":null,"abstract":"Inter-Vehicle Communications (IVC) allows to exchange data among vehicles without requiring any fixed infrastructure in Vehicular Ad-hoc Networks (VANETs). Multi-hop data delivery through VANETs is challenging because of rapid topology changes and network fragmentation. To address this issue, we combine the idea of store-carry and forward (SCF) with routing scheme. In this paper, we proposed a novel routing protocol for VANETs, which is well adapted to continuously changing topology in such networks. Adaptive Vehicle Traces Routing (AVTR) includes a mechanism for tracking source and destination vehicles when they leave their expected locations and use packet forwarding policy at the intersection. When the network is sparse, we use SCF paradigm and vehicles as ferries for overcoming the network partitioning. Finally, our protocol is compared with two VANET routing protocols, VADD and GPSR*. The obtained results show that AVTR outperforms GPSR* and VADD in terms of both packet delivery ratio and average end-to-end delay of data packets. For example, under specific conditions that was considered in the simulations, when the total number of nodes varies in networks, the packet delivery ratio of AVTR is approximately 8% better than VADD and 70% better than GPSR*. Also, using our algorithm delivery delay has been enhanced more than 82% and 58% in comparison to VADD and GPSR* respectively.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115829229","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}
Security is a crucial requirement for many software systems. Misuse case modeling is a technique that allows system designers to inject security considerations within their designs early in the development cycle. This is potentially a much more effective approach to ensuring security than patching an end system with security mechanisms after it was developed. While the notation and syntactical rules of misuse case models are relatively simple, developing high quality misuse case models is not a straightforward task. Modeling practitioners are highly vulnerable to modeling mistakes, creating defective misuse case models that can lead to the development of insecure systems. In this paper, an approach based on antipatterns that attempts to repair defective misuse case models is presented. The misuse case model of an Online Phone Accessories Store subsystem is presented to demonstrate the feasibility of the approach. The results show that applying the technique has improved the overall quality of the misuse case model.
{"title":"Improving Quality in Misuse Case Models: A Risk-Based Approach","authors":"M. El-Attar, Irfan Ahmad","doi":"10.1109/ICIS.2011.59","DOIUrl":"https://doi.org/10.1109/ICIS.2011.59","url":null,"abstract":"Security is a crucial requirement for many software systems. Misuse case modeling is a technique that allows system designers to inject security considerations within their designs early in the development cycle. This is potentially a much more effective approach to ensuring security than patching an end system with security mechanisms after it was developed. While the notation and syntactical rules of misuse case models are relatively simple, developing high quality misuse case models is not a straightforward task. Modeling practitioners are highly vulnerable to modeling mistakes, creating defective misuse case models that can lead to the development of insecure systems. In this paper, an approach based on antipatterns that attempts to repair defective misuse case models is presented. The misuse case model of an Online Phone Accessories Store subsystem is presented to demonstrate the feasibility of the approach. The results show that applying the technique has improved the overall quality of the misuse case model.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114610045","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}
Enterprise Resource Planning (ERP) systems are important generic software packages. With a long term development over 15 years ERP-systems have changed profoundly, and diversified into a number of applications. This contribution is addressing two major issues left aside in the research on ERP: the technological content and the time dynamics. Using two different small reviews of journal articles from IS journals it is developed that while IS research on ERP seem to deliver strong insight in user processes around ERP, it largely disregards the content of ERP, as well as the continual development that this content is undergoing. This means that ERP-research is disregarding the profound software changes and their impact on the user context, when implementing and operating ERP. Possible improvements of research approaches are presented.
{"title":"Closing the Blackbox? A Status on Enterprise Resource Planning (ERP) Studies in Information Systems Research","authors":"C. Koch","doi":"10.1109/ICIS.2011.70","DOIUrl":"https://doi.org/10.1109/ICIS.2011.70","url":null,"abstract":"Enterprise Resource Planning (ERP) systems are important generic software packages. With a long term development over 15 years ERP-systems have changed profoundly, and diversified into a number of applications. This contribution is addressing two major issues left aside in the research on ERP: the technological content and the time dynamics. Using two different small reviews of journal articles from IS journals it is developed that while IS research on ERP seem to deliver strong insight in user processes around ERP, it largely disregards the content of ERP, as well as the continual development that this content is undergoing. This means that ERP-research is disregarding the profound software changes and their impact on the user context, when implementing and operating ERP. Possible improvements of research approaches are presented.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114804059","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}
Using formal method PAR, two algorithms involving sequences, a majority problem deterministic algorithmic solution and computing the mode, are derived. From formal functional specifications, problems are partitioned into sub-problems, problem solving recurrences are constructed through formal specification transformation, and then loop invariants are achieved naturally, the algorithms that can be further transformed into executable programs supported by PAR platform are obtained. Formal derivation using PAR makes the algorithm idea is exhibited naturally and clearly.
{"title":"Formal Derivation of Two Algorithms Involving Sequences","authors":"Haihe Shi, Jinyun Xue","doi":"10.1109/ICIS.2011.52","DOIUrl":"https://doi.org/10.1109/ICIS.2011.52","url":null,"abstract":"Using formal method PAR, two algorithms involving sequences, a majority problem deterministic algorithmic solution and computing the mode, are derived. From formal functional specifications, problems are partitioned into sub-problems, problem solving recurrences are constructed through formal specification transformation, and then loop invariants are achieved naturally, the algorithms that can be further transformed into executable programs supported by PAR platform are obtained. Formal derivation using PAR makes the algorithm idea is exhibited naturally and clearly.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"248 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123674036","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
扫码关注我们
求助内容：
应助结果提醒方式：