J. Macknick, T. Quinby, E. Caulfield, Margot Gerritsen, J. Diffendorfer, S. Haines
Recent policy and economic conditions have encouraged a renewed interest in developing large-scale solar projects in the U.S. Southwest. However, siting large-scale solar projects is complex. In addition to the quality of the solar resource, solar developers must take into consideration many environmental, social, and economic factors when evaluating a potential site. This report describes a proof-of-concept, Web-based Geographical Information Systems (GIS) tool that evaluates multiple user-defined criteria in an optimization algorithm to inform discussions and decisions regarding the locations of utility-scale solar projects. Existing siting recommendations for large-scale solar projects from governmental and non-governmental organizations are not consistent with each other, are often not transparent in methods, and do not take into consideration the differing priorities of stakeholders. The siting assistance GIS tool we have developed improves upon the existing siting guidelines by being user-driven, transparent, interactive, capable of incorporating multiple criteria, and flexible. This work provides the foundation for a dynamic siting assistance tool that can greatly facilitate siting decisions among multiple stakeholders.
{"title":"Geospatial optimization of siting large-scale solar projects","authors":"J. Macknick, T. Quinby, E. Caulfield, Margot Gerritsen, J. Diffendorfer, S. Haines","doi":"10.2172/1126849","DOIUrl":"https://doi.org/10.2172/1126849","url":null,"abstract":"Recent policy and economic conditions have encouraged a renewed interest in developing large-scale solar projects in the U.S. Southwest. However, siting large-scale solar projects is complex. In addition to the quality of the solar resource, solar developers must take into consideration many environmental, social, and economic factors when evaluating a potential site. This report describes a proof-of-concept, Web-based Geographical Information Systems (GIS) tool that evaluates multiple user-defined criteria in an optimization algorithm to inform discussions and decisions regarding the locations of utility-scale solar projects. Existing siting recommendations for large-scale solar projects from governmental and non-governmental organizations are not consistent with each other, are often not transparent in methods, and do not take into consideration the differing priorities of stakeholders. The siting assistance GIS tool we have developed improves upon the existing siting guidelines by being user-driven, transparent, interactive, capable of incorporating multiple criteria, and flexible. This work provides the foundation for a dynamic siting assistance tool that can greatly facilitate siting decisions among multiple stakeholders.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"78 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75000430","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}
K. Deutsch, D. Leroy, C. Belpaire, K. D. Haan, B. Vrana, H. Clayton, G. Hanke, M. Ricci, A. Held, B. Gawlik, M. Babut, O. Perceval, P. Lepom, C. Heiss, J. Koschorreck, Simon O’Toole, S. Valsecchi, S. Polesello, M. Carere, D. T. Hulscher, E. Verbruggen, V. Dulio, N. Green, L. Viñas
This Technical Guidance Document on Biota Monitoring (the Implementation of EQSbiota) aims to facilitate the implementation of environmental quality standards (EQS) in biota under the Water Framework Directive by addressing in particular the sampling strategies appropriate for monitoring programmes designed to assess compliance with biota EQS. It is Guidance Document No. 32 in the series of guidance documents prepared to support the Common Implementation Strategy (CIS) for the Water Framework Directive. It elaborates extensively on the content of Guidance Document No. 25 on Chemical Monitoring in Sediment and Biota under the Water Framework Directive, and is complemented by Guidance Document No. 33, the Technical Guidance Document on Analytical Methods for Biota Monitoring. Guidance Documents 32 and 33 together address the requirement for guidance on biota monitoring mentioned in Article 3(8a) of Directive 2008/105/EC as amended by Directive 2013/39/EU. The original Directive 2008/105/EC included biota standards for mercury, hexachlorobenzene and hexachlorobutadiene. In Directive 2013/39/EU, biota EQS were introduced for three other existing priority substances (fluoranthene, polyaromatic hydrocarbons and brominated diphenylethers), and set for four new priority substances (dicofol, perfluorooctane sulfonic acid and its derivatives, hexabromocyclododecane, and heptachlor/heptachlor epoxide). This guidance document takes into account the fact that trend monitoring in sediment and/or biota is required for several other priority substances as specified in Article 3(6), and indicates how trend monitoring data can be used to check compliance with biota EQS, but does not elaborate on trend monitoring as such. This document constitutes guidance and Member States are therefore not legally required to follow the recommendations contained in it. Member States are, however, required to use methods compliant with the requirements of the Environmental Quality Standards Directive 2008/105/EC and the Quality Assurance/Quality Control Directive 2009/90/EC.
{"title":"COMMON IMPLEMENTATION STRATEGY FOR THE WATER FRAMEWORK DIRECTIVE (2000/60/EC). Guidance Document No. 32 ON BIOTA MONITORING (THE IMPLEMENTATION OF EQSBIOTA) UNDER THE WATER FRAMEWORK DIRECTIVE","authors":"K. Deutsch, D. Leroy, C. Belpaire, K. D. Haan, B. Vrana, H. Clayton, G. Hanke, M. Ricci, A. Held, B. Gawlik, M. Babut, O. Perceval, P. Lepom, C. Heiss, J. Koschorreck, Simon O’Toole, S. Valsecchi, S. Polesello, M. Carere, D. T. Hulscher, E. Verbruggen, V. Dulio, N. Green, L. Viñas","doi":"10.2779/833200","DOIUrl":"https://doi.org/10.2779/833200","url":null,"abstract":"This Technical Guidance Document on Biota Monitoring (the Implementation of EQSbiota) aims to facilitate the implementation of environmental quality standards (EQS) in biota under the Water Framework Directive by addressing in particular the sampling strategies appropriate for monitoring programmes designed to assess compliance with biota EQS. It is Guidance Document No. 32 in the series of guidance documents prepared to support the Common Implementation Strategy (CIS) for the Water Framework Directive. It elaborates extensively on the content of Guidance Document No. 25 on Chemical Monitoring in Sediment and Biota under the Water Framework Directive, and is complemented by Guidance Document No. 33, the Technical Guidance Document on Analytical Methods for Biota Monitoring. Guidance Documents 32 and 33 together address the requirement for guidance on biota monitoring mentioned in Article 3(8a) of Directive 2008/105/EC as amended by Directive 2013/39/EU. The original Directive 2008/105/EC included biota standards for mercury, hexachlorobenzene and hexachlorobutadiene. In Directive 2013/39/EU, biota EQS were introduced for three other existing priority substances (fluoranthene, polyaromatic hydrocarbons and brominated diphenylethers), and set for four new priority substances (dicofol, perfluorooctane sulfonic acid and its derivatives, hexabromocyclododecane, and heptachlor/heptachlor epoxide). This guidance document takes into account the fact that trend monitoring in sediment and/or biota is required for several other priority substances as specified in Article 3(6), and indicates how trend monitoring data can be used to check compliance with biota EQS, but does not elaborate on trend monitoring as such. This document constitutes guidance and Member States are therefore not legally required to follow the recommendations contained in it. Member States are, however, required to use methods compliant with the requirements of the Environmental Quality Standards Directive 2008/105/EC and the Quality Assurance/Quality Control Directive 2009/90/EC.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"128 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80767792","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 : 2014-01-01DOI: 10.13140/RG.2.1.3965.0167
André R. Breton, D. Winkelman, Kevin R. Bestgen, J. Hawkins
{"title":"Population dynamics modeling of introduced smallmouth bass in the upper Colorado River basin","authors":"André R. Breton, D. Winkelman, Kevin R. Bestgen, J. Hawkins","doi":"10.13140/RG.2.1.3965.0167","DOIUrl":"https://doi.org/10.13140/RG.2.1.3965.0167","url":null,"abstract":"","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"12 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82926531","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 : 2012-04-01DOI: 10.3929/ethz-a-007313715
Tahmineh Sanamrad, Daniel Widmer, Donald Kossmann
Everybody loves Google Apps. Google provides highly available web applications that help you communicate, organize and collaborate from anywhere using different interfaces in the most user friendly and efficient way, without being worried about any IT issues. However, some people still hesitate using Google services because of privacy and trust issues. In this paper, we identify privacy issues in GoogleWeb Applications as a particularly vital problem and propose a solution. In our solution a transparent encryption layer is put between the user and the cloud service provider on a site trusted by the user. This layer accesses the request and response messages passed between the two parties in a fine-grained manner. It applies modern cryptography techniques to encrypt the data without sacrificing functionality and portability of the cloud service. This way the trust of the end user can be reobtained and he or she will be encouraged to further enjoy using web applications such as Google Apps without having to worry about privacy issues.
{"title":"My Private Google Calendar","authors":"Tahmineh Sanamrad, Daniel Widmer, Donald Kossmann","doi":"10.3929/ethz-a-007313715","DOIUrl":"https://doi.org/10.3929/ethz-a-007313715","url":null,"abstract":"Everybody loves Google Apps. Google provides highly available web applications that help you communicate, organize and collaborate from anywhere using different interfaces in the most user friendly and efficient way, without being worried about any IT issues. However, some people still hesitate using Google services because of privacy and trust issues. In this paper, we identify privacy issues in GoogleWeb Applications as a particularly vital problem and propose a solution. In our solution a transparent encryption layer is put between the user and the cloud service provider on a site trusted by the user. This layer accesses the request and response messages passed between the two parties in a fine-grained manner. It applies modern cryptography techniques to encrypt the data without sacrificing functionality and portability of the cloud service. This way the trust of the end user can be reobtained and he or she will be encouraged to further enjoy using web applications such as Google Apps without having to worry about privacy issues.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"289 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76309492","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 : 2012-01-01DOI: 10.3929/ETHZ-A-007315735
Aanjhan Ranganathan
In this work, we propose the use of Frequency Modulated Continuous Wave (FMCW) concept as a physical-layer scheme to enable the realization of accurate and secure distance bounding. We provide an overview of FMCW and propose an extension to allow up and down-link data communication for the purposes of distance bounding. We refer to it as FMCW-DB. We then show how a secure distance bounding protocol adapted from [2] could be used with the FMCW technology to provide the necessary security and distance estimation guarantees.
{"title":"FMCW-based realization of distance bounding protocols","authors":"Aanjhan Ranganathan","doi":"10.3929/ETHZ-A-007315735","DOIUrl":"https://doi.org/10.3929/ETHZ-A-007315735","url":null,"abstract":"In this work, we propose the use of Frequency Modulated Continuous Wave (FMCW) concept as a physical-layer scheme to enable the realization of accurate and secure distance bounding. We provide an overview of FMCW and propose an extension to allow up and down-link data communication for the purposes of distance bounding. We refer to it as FMCW-DB. We then show how a secure distance bounding protocol adapted from [2] could be used with the FMCW technology to provide the necessary security and distance estimation guarantees.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73182594","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 : 2012-01-01DOI: 10.3929/ETHZ-A-007313474
Davide Zanetti, Vincent Lenders, Srdjan Capkun
In this work, we study the physical-layer identification of GSM devices. For our exploration, we build an ad-hoc acquisition setup that collects GSM signals during voice calls. We collect signals from a population of 18 mobile devices and build fingerprints by considering both the transient and the data parts of the acquired signals. Our results show that devices of different models and manufacturers can be identified with high accuracy (0% identification error) by exploiting transient-based fingerprints. Same model and manufacturer devices could also be identified by using transient-based fingerprints: we find an identification error between 0 and 8% depending on the considered device set. We also find that the built transient-based fingerprints are sensitive to the device transmission power, but only partially to the device position with respect to our acquisition setup antenna. This possibly enables defensive (e.g., access control) applications. Although with less accuracy with respect to transient-based fingerprints, data-based fingerprints could also be used to identify same model and manufacturer devices. However, these seem to be sensitive to the device position.
{"title":"Exploring the Physical-layer Identification of GSM Devices","authors":"Davide Zanetti, Vincent Lenders, Srdjan Capkun","doi":"10.3929/ETHZ-A-007313474","DOIUrl":"https://doi.org/10.3929/ETHZ-A-007313474","url":null,"abstract":"In this work, we study the physical-layer identification of GSM devices. For our exploration, we build an ad-hoc acquisition setup that collects GSM signals during voice calls. We collect signals from a population of 18 mobile devices and build fingerprints by considering both the transient and the data parts of the acquired signals. Our results show that devices of different models and manufacturers can be identified with high accuracy (0% identification error) by exploiting transient-based fingerprints. Same model and manufacturer devices could also be identified by using transient-based fingerprints: we find an identification error between 0 and 8% depending on the considered device set. We also find that the built transient-based fingerprints are sensitive to the device transmission power, but only partially to the device position with respect to our acquisition setup antenna. This possibly enables defensive (e.g., access control) applications. Although with less accuracy with respect to transient-based fingerprints, data-based fingerprints could also be used to identify same model and manufacturer devices. However, these seem to be sensitive to the device position.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77051584","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 : 2012-01-01DOI: 10.3929/ETHZ-A-007316734
S. Seibert, A. Sprock, Walter Unger
We study online algorithms with advice for the problem of coloring graphs which come as input vertex by vertex. We consider the class of all 3-colorable graphs and its sub-classes of chordal and maximal outerplanar graphs, respectively. We show that, in the case of the first two classes, for coloring optimally, essentially log2 3 advice bits per vertex (bpv) are necessary and sufficient. In the case of maximal outerplanar graphs, we show a lower bound of 1.0424 bpv and an upper bound of 1.2932 bpv. Finally, we develop algorithms for 4-coloring in these graph classes. The algorithm for 3-colorable chordal and outerplanar graphs uses 0.9865 bpv, and in case of general 3-colorable graphs, we obtain an algorithm using < 1.1583 bpv.
{"title":"Advice Complexity of the Online Vertex Coloring Problem","authors":"S. Seibert, A. Sprock, Walter Unger","doi":"10.3929/ETHZ-A-007316734","DOIUrl":"https://doi.org/10.3929/ETHZ-A-007316734","url":null,"abstract":"We study online algorithms with advice for the problem of coloring graphs which come as input vertex by vertex. We consider the class of all 3-colorable graphs and its sub-classes of chordal and maximal outerplanar graphs, respectively. We show that, in the case of the first two classes, for coloring optimally, essentially log2 3 advice bits per vertex (bpv) are necessary and sufficient. In the case of maximal outerplanar graphs, we show a lower bound of 1.0424 bpv and an upper bound of 1.2932 bpv. Finally, we develop algorithms for 4-coloring in these graph classes. The algorithm for 3-colorable chordal and outerplanar graphs uses 0.9865 bpv, and in case of general 3-colorable graphs, we obtain an algorithm using < 1.1583 bpv.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86680918","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 : 2012-01-01DOI: 10.3929/ETHZ-A-007315774
J. Buhmann, Matúš Mihalák, Rastislav Šrámek, P. Widmayer
We study optimization in the presence of uncertainty such as noise in measurements, and advocate a novel approach to deal with it. The main di erence to any existing approach is that we do not assume any knowledge about the nature of the uncertainty (such as for instance a probability distribution). Instead, we are given several instances of the same optimization problem as input, and, assuming they are typical w.r.t. the uncertainty, we make use of it in order to compute a solution that is good for the sample instances as well as for future (unknown) expected instances. We demonstrate our approach for the case of two typical input instances. We rst propose a measure of similarity of instances with respect to an objective. This concept allows us to assess whether instances are indeed typical . Based on this concept, we then choose a solution randomly among all solutions that are near-optimum for both instances. We show that the exact notion of near-optimum is intertwined with the proposed measure of similarity. Furthermore, we will show that our measure of similarity also allows us to make formal statements about the expected quality of the computed solution: If the given instances are not similar, or are too noisy, our approach will detect this. We demonstrate for a few optimization problems and real world data that our approach not only works well in theory, but also in practice. ? This work was supported by the Swiss National Science Foundation (SNF) under the grant 200021_138117/1.
{"title":"Optimization in the presence of uncertainty","authors":"J. Buhmann, Matúš Mihalák, Rastislav Šrámek, P. Widmayer","doi":"10.3929/ETHZ-A-007315774","DOIUrl":"https://doi.org/10.3929/ETHZ-A-007315774","url":null,"abstract":"We study optimization in the presence of uncertainty such as noise in measurements, and advocate a novel approach to deal with it. The main di erence to any existing approach is that we do not assume any knowledge about the nature of the uncertainty (such as for instance a probability distribution). Instead, we are given several instances of the same optimization problem as input, and, assuming they are typical w.r.t. the uncertainty, we make use of it in order to compute a solution that is good for the sample instances as well as for future (unknown) expected instances. We demonstrate our approach for the case of two typical input instances. We rst propose a measure of similarity of instances with respect to an objective. This concept allows us to assess whether instances are indeed typical . Based on this concept, we then choose a solution randomly among all solutions that are near-optimum for both instances. We show that the exact notion of near-optimum is intertwined with the proposed measure of similarity. Furthermore, we will show that our measure of similarity also allows us to make formal statements about the expected quality of the computed solution: If the given instances are not similar, or are too noisy, our approach will detect this. We demonstrate for a few optimization problems and real world data that our approach not only works well in theory, but also in practice. ? This work was supported by the Swiss National Science Foundation (SNF) under the grant 200021_138117/1.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"87 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74155355","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 : 2012-01-01DOI: 10.3929/ETHZ-A-007316742
Mathias Payer
Compiling an application as a Position Independent Executable (PIE) enables Address Space Layout Randomization to protect the application from security attacks by mapping the executable at a random memory location. Nevertheless most applications on current x86 Linux distributions are mapped to a static address for performance reasons. This paper evaluates the overhead and side-effects of PIE using the SPEC CPU2006 benchmarks on an Intel Core i7 CPU with a recent Ubuntu distribution. Our analysis shows that the overhead for PIE on 32bit x86 is up to 26% for some benchmarks with an (arithmetic) average of 10% and a geometric mean of 9.4%. We identify the increased register pressure as the source for most of the overhead on x86.
{"title":"Too much PIE is bad for performance","authors":"Mathias Payer","doi":"10.3929/ETHZ-A-007316742","DOIUrl":"https://doi.org/10.3929/ETHZ-A-007316742","url":null,"abstract":"Compiling an application as a Position Independent Executable (PIE) enables Address Space Layout Randomization to protect the application from security attacks by mapping the executable at a random memory location. Nevertheless most applications on current x86 Linux distributions are mapped to a static address for performance reasons. This paper evaluates the overhead and side-effects of PIE using the SPEC CPU2006 benchmarks on an Intel Core i7 CPU with a recent Ubuntu distribution. Our analysis shows that the overhead for PIE on 32bit x86 is up to 26% for some benchmarks with an (arithmetic) average of 10% and a geometric mean of 9.4%. We identify the increased register pressure as the source for most of the overhead on x86.","PeriodicalId":10841,"journal":{"name":"CTIT technical reports series","volume":"61 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82319614","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
扫码关注我们
求助内容：
应助结果提醒方式：