检索结果-内蒙古大学图书馆

International Conference on computer Science and Network Technology

作者： Zaid Ameen Abduljabbar Hai Jin Ayad Ibrahim Aqeel Noori Mohammed Abdulridha Hussain Zaid Alaa Hussien Deqing Zou Salah H. Abbdal Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China University of Basrah Basrah Iraq

ISBN: (纸本)9781467381741

Popular service providers, such as Google and Amazon, have turned their vast resources into a cloud computing model and enforced their businesses to run applications on the servers of such new model. To ensure security and privacy in this environments, customers have to encrypt their data before uploading them into the cloud servers. Unfortunately, modern unbreakable encryption methods are inadequate because they do not have the ability to execute database queries on the encrypted data. In this paper, we address the problem of how to calculate the geographical distance over an encrypted dataset. Specifically, the data owner, Alice, sends her encrypted dataset of geographical locations into the cloud server. At any time, Bob would like to check the proximity of his submitted query from the locations of Alice. Our proposed scheme enables the untrusted server to perform such task without compromising the privacy of either the dataset of Alice or the query of Bob. Among various distance metrics, we employ the efficient principle of approximate matching to obtain the proximity between query and data locations. Furthermore, we use the inner product similarity to formalize such principle for similarity measurement. Several experiments have been conducted to investigate the overhead and the efficiency of the proposed scheme.

关键词： Cloud computing Privacy preserving Geographical distance Cloud computing Servers distance metric approximate match Dataset CLOUDS Clouds data querying similar measure Uploading Privacy cryptography Geographical Locations

来源：评论

学校读者我要写书评

暂无评论

Scheme for Ensuring Data Security on Cloud Data Storage in a Semi-trusted Third Party Auditor

Scheme for Ensuring Data Security on Cloud Data Storage in a...

引用

International Conference on computer Science and Network Technology

作者： Zaid Alaa Hussien Hai Jin Zaid Ameen Abduljabbar Mohammed Abdulridha Hussain Salah H. Abbdal Deqing Zou Cluster and Grid Computing Lab Big Data Technology and System Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781467381741

Cloud computing is a promising information technology service that allocates and reallocates resources when a client requires virtual data storage and network facility at any time and place. Cloud computing provides large data storage and management services at the lowest cost. Thus, it is crucial for many organizations and clients who seek such services. Data security and integrity are necessary and play important roles. However, these two issues are facing significant challenges. Therefore, a robust scheme is required to ensure security and privacy while transmitting or storing data in the cloud storage environment. We propose an efficient and robust scheme to ensure data security in a semi-trusted third party auditor. Our scheme adopts an advanced encryption standard to support data owner privacy, a cryptography hash function to maintain data owner integrity, and elliptic curve cryptography to ensure data confidentiality, correctness, and security when transmitting data over unsecure channels. A security analysis confirms that our scheme can withstand man-in-the-middle attack and provides data correctness.

关键词： Cloud storage data security elliptic curve cryptography hash function integrity semi-trusted third party auditor Data Security Elliptic curve cryptography cryptography Cloud computing computer information security Data Storage Scheme auditor Third party customers Management services Transmitting Data

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware Service Selection for Customisable Multi-tenant Service-Based Systems: Maturity and Approaches

QoS-Aware Service Selection for Customisable Multi-tenant Se...

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Qiang He Jun Han Feifei Chen Yanchun Wang Rajesh Vasa Yun Yang Hai Jin School of Software and Electrical Engineering Swinburne University of Technology Melbourne Australia Services Computing Technology and Systems Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Multi-tenant service-based systems (SBSs) have become a major paradigm in software engineering in the cloud environment. Instead of serving a single end-user, a multitenant SBS provides multiple tenants with similar and yet customised functionalities with potentially different quality-of service (QoS) values. Thus, existing approaches to service selection for single-tenant SBSs are no longer suitable. Furthermore, the target multi-tenancy maturity level also needs to be considered in the service selection approach for an SBS. In this paper, we propose three novel QoS-aware service selection approaches for composing multi-tenant SBSs that achieve three different multi-tenancy maturity levels. Extensive and comprehensive experiments are conducted and the experimental results show that our approaches outperform the existing approach in both effectiveness and efficiency.

关键词： Optimization Engines Throughput Rails Insurance Linear programming

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for supersymmetry in final states with two same-sign or three leptons and jets using 36 fb−1 of = 13 TeV pp collision data with the ATLAS detector

引用

Journal of High Energy Physics 2019年第8期2019卷 1-19页

作者： Aaboud, M. Aad, G. Abbott, B. Abdinov, O. Abeloos, B. Abidi, S. H. AbouZeid, O. S. Abraham, N. L. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B. S. Adachi, S. Adamczyk, L. Adelman, J. Adersberger, M. Adye, T. Affolder, A. A. Afik, Y. Agatonovic-Jovin, T. Agheorghiesei, C. Aguilar-Saavedra, J. A. Ahlen, S. P. Ahmadov, F. Aielli, G. Akatsuka, S. Akerstedt, H. Åkesson, T. P. A. Akilli, E. Akimov, A. V. Alberghi, G. L. Albert, J. Albicocco, P. Alconada Verzini, M. J. Alderweireldt, S. C. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexander, G. Alexopoulos, T. Alhroob, M. Ali, B. Aliev, M. Alimonti, G. Alison, J. Alkire, S. P. Allbrooke, B. M. M. Allen, B. W. Allport, P. P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Alshehri, A. A. Alstaty, M. I. Alvarez Gonzalez, B. Álvarez Piqueras, D. Alviggi, M. G. Amadio, B. T. Amaral Coutinho, Y. Amelung, C. Amidei, D. Amor Dos Santos, S. P. Amoroso, S. Amundsen, G. Anastopoulos, C. Ancu, L. S. Andari, N. Andeen, T. Anders, C. F. Anders, J. K. Anderson, K. J. Andreazza, A. Andrei, V. Angelidakis, S. Angelozzi, I. Angerami, A. Anisenkov, A. V. Anjos, N. Annovi, A. Antel, C. Antonelli, M. Antonov, A. Antrim, D. J. Anulli, F. Aoki, M. Aperio Bella, L. Arabidze, G. Arai, Y. Araque, J. P. Araujo Ferraz, V. Arce, A. T. H. Ardell, R. E. Arduh, F. A. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A. J. Armitage, L. J. Arnaez, O. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Artz, S. Asai, S. Asbah, N. Ashkenazi, A. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N. B. Augsten, K. Avolio, G. Axen, B. Ayoub, M. K. Azuelos, G. Baas, A. E. Baca, M. J. Bachacou, H. Bachas, K. Backes, M. Bagnaia, P. Bahmani, M. Bahrasemani, H. Baines, J. T. Bajic, M. Baker, O. K. Baldin, E. M. Balek, P. Balli, F. Balunas, W. K. Banas, E. Bandyopadhyay, A. Banerjee, Sw. Bannoura, A. A. E. Barak, L. Barberio, E. L. Barberis, D. Barbero, M. Barillari, T. Barisits, M-S Barkeloo, J. T. Barklow, T. Barlow, N. Barnes, S. L. Barnett, B. M. Barnett, R. M. Barnovska-Blenessy, Z Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman U.S.A. Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz U.S.A. Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene U.S.A. Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Udine Italy ICTP Trieste Italy Department of Physics King’s College London London United Kingdom International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb U.S.A. Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas – LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos Universidad de Granada Granada Portugal Department of Physics Boston University Boston U.S.A. Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Roma Italy Dip

One correction is made to the figure 4e of the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic detection and recognition of silicosis in chest radiograph

Automatic detection and recognition of silicosis in chest ra...

引用

作者： Zhu, Lei Zheng, Ran Jin, Hai Zhang, Qin Zhang, Wei Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Silicosis remains one of the most harmful occupational respiratory diseases. It threatens the workers exposed to dust environment. Chest radiograph is the main available image source for silicosis diagnosis according to the diagnostic criteria of pneumoconiosis (DCP). Automatic detection and recognition of silicosis in chest radiograph has great importance on aiding the process of silicosis diagnosis. This paper proposes a multi-scale opacity detection approach to detect all suspected opacities from the chest radiograph. A support vector machine (SVM) based computer-aided silicosis diagnosis is proposed to recognize silicosis opacity from a large amount of candidate regions, and gives processing result for radiologist reference. Comprehensive experiments conducted on real world chest radiographs demonstrate that the proposed approach can reveal changes of silicosis pathology well, and it can be adopted as an effective tool for automatic silicosis diagnosis. © 2014 - IOS Press and the authors.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Boosting mapreduce with network-aware task assignment 4th

Boosting mapreduce with network-aware task assignment

引用

4th International Conference on Cloud computing, CloudComp 2013

作者： Xu, Fei Liu, Fangming Zhu, Dekang Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319055053

Running MapReduce in a shared cluster has become a recent trend to process large-scale data analytical applications while improving the cluster utilization. However, the network sharing among various applications can make the network bandwidth for MapReduce applications constrained and heterogeneous. This further increases the severity of network hotspots in racks, and makes existing task assignment policies which focus on the data locality no longer effective. To deal with this issue, this paper develops a model to analyze the relationship between job completion time and the assignment of both map and reduce tasks across racks. We further design a network-aware task assignment strategy to shorten the completion time of MapReduce jobs in shared clusters. It integrates two simple yet effective greedy heuristics that minimize the completion time of map phase and reduce phase, respectively. With large-scale simulations driven by Facebook job traces, we demonstrate that the network-aware strategy can shorten the average completion time of MapReduce jobs, as compared to the state-of-the-art task assignment strategies, yet with an acceptable computational overhead. © Institute for computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

An efficient privacy-preserving compressive data gathering scheme in WSNs 1

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Xie, Kun Ning, Xueping Wang, Xin Wen, Jigang Liu, Xiaoxiao He, Shiming Zhang, Daqiang College of Computer Science and Electronics Engineering Hunan University Changsha410082 China The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommmunications Beijing100876 China Department of Electrical and Computer Engineering State University of New York at Stony Brook New York11790 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China State Grid HuNan Electric Power Company Research Insitute Changsha410000 China School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410114 China School of Software Engineering Tongji University Shanghai201804 China

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

Due to the strict energy limitation and the common vulnerability of WSNs, providing efficient and security data gathering in WSNs becomes an essential problem. Compressive data gathering, which is based on the recent breakthroughs in compressive sensing theory, has been proposed as a viable approach for data gathering in WSNs at low communication overhead. Nevertheless, compressive data gathering is susceptible to various attacks due to the open wireless medium. To thwart traffic analysis/flow tracing and realize privacy preservation, this paper proposes a novel Efficient Privacy-Preserving Compressive Data Gathering Scheme which exploits homomorphic encryption functions in compressive data gathering. With homomorphic encryption on the compressive sensing encoded sensory reading messages, the proposed scheme offers two significant privacy-preserving features, message flow untraceability and message content confidentiality, for efficiently thwarting the traffic analysis attacks. Extensive performance evaluations and security analysis demonstrate the validity and efficiency of the proposed scheme. © Springer International Publishing Switzerland 2015.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Robust One-TimeMessage Authentication CodeScheme using Feature Extraction of Iris in Cloud computing

An Efficient and Robust One-TimeMessage Authentication CodeS...

引用

2014 International Conference on Cloud computing and Internet of Things (CCIOT)(2014年第一届云计算和物联网国际会议)

作者： Mohammed Abdulridha Hussain ZaidAmeen Abduljabbar Deqing Zou Hai Jin Ali A.Yassin ZaidAlaa Hussien Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scien 1Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scie University of Basrah BasrahIraq Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scien

Cloud computing suffers from a number of problems in terms of security *** and integrity play an important role in the security field and numerous concerns have been raised to recognizeor protect any tampering with exchanges of text between two entities(sender and receiver)within the cloud *** schemes in this area can be vulnerable to well known methods of attack such as replay attack,forgery attack,dictionary,insider,and modification attacks.A robust scheme is therefore required to detect or prevent any modification or manipulation of a message during *** this paper,we propose a new message authentication code(MAC)based on feature extraction of the user's iris in order to assure the integrity of the user's *** are extracted from the user's iris to generate a message code for each user's login and to prohibit malicious attacks such as replay,forgery and insider *** proposed scheme enjoysseveral important security attributes such as a user's one time bio-key,robust message anonymity,data integrity for a user's message,phase key agreement,bio-key management,and one time message code for each user's ***,our security analysis and experimental results demonstrate and prove the invulnerability and efficiency of our proposed scheme.

关键词： Cloud computing Iris Features Extraction One Time Bio-key One Tim Message Authentication Code MAC.

来源：评论

学校读者我要写书评

暂无评论

Dependability Analysis for Fault-Tolerant computer Systems Using Dynamic Fault Graphs

引用

China Communications 2014年第9期11卷 16-30页

作者： ZHAO Feng JIN Hai ZOU Deqing QIN Pan Services Computing Technology and System Lab & Cluster and Grid Computing Lab School of Computer Scienceand Technology Huazhong University of Science and Technology Wuhan 430074 Hubei Province P. R. China

Dependability analysis is an important step in designing and analyzing safety computer systems and protection *** multi-processor and virtual machine increases the system faults' complexity,diversity and dynamic,in particular for software-induced failures,with an impact on the overall ***,it is very different for safety system to operate successfully at any active phase,since there is a huge difference in failure rate between hardware-induced and softwareinduced *** handle these difficulties and achieve accurate dependability evaluation,consistently reflecting the construct it measures,a new formalism derived from dynamic fault graphs(DFG) is developed in this *** exploits the concept of system event as fault state sequences to represent dynamic behaviors,which allows us to execute probabilistic measures at each timestamp when change *** approach automatically combines the reliability analysis with the system *** this paper,we describe how to use the proposed methodology drives to the overall system dependability analysis through the phases of modeling,structural discovery and probability analysis,which is also discussed using an example of a virtual computing system.

关键词： fault-tolerant system depend-ability analysis dynamic fault-graph structural link probability forecast

来源：评论

学校读者我要写书评

暂无评论

Search for a Structure in the Bs0π± Invariant Mass Spectrum with the ATLAS Experiment

引用

Physical Review Letters 2018年第20期120卷 202007-202007页

作者： M. Aaboud G. Aad B. Abbott O. Abdinov B. Abeloos S. H. Abidi O. S. AbouZeid N. L. Abraham H. Abramowicz H. Abreu Y. Abulaiti B. S. Acharya S. Adachi L. Adamczyk J. Adelman M. Adersberger T. Adye A. A. Affolder Y. Afik C. Agheorghiesei J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli S. Akatsuka H. Akerstedt T. P. A. Åkesson E. Akilli A. V. Akimov G. L. Alberghi J. Albert P. Albicocco M. J. Alconada Verzini S. Alderweireldt M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob B. Ali M. Aliev G. Alimonti J. Alison S. P. Alkire B. M. M. Allbrooke B. W. Allen P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. A. Alshehri M. I. Alstaty B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos S. Amoroso C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi A. Angerami A. V. Anisenkov N. Anjos A. Annovi C. Antel M. Antonelli A. Antonov D. J. Antrim F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque V. Araujo Ferraz A. T. H. Arce R. E. Ardell F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster L. J. Armitage O. Arnaez H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Artz S. Asai N. Asbah A. Ashkenazi L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay K. Augsten G. Avolio B. Axen M. K. Ayoub G. Azuelos A. E. Baas M. J. Baca H. Bachacou K. Bachas M. Backes P. Bagnaia M. Bahmani H. Bahrasemani J. T. Baines M. Bajic O. K. Baker P. J. Bakker D. Bakshi Gupta E. M. Baldin P. Balek F. Balli W. K. Balunas E. Banas A. Bandyopadhyay Sw. Banerjee A. A. E. Bannoura L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M-S Barisits J. T. Barkeloo T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska-Blenessy A. Baroncelli G. Barone A. J. Barr L. Barranco Navarro F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Basalaev A. Bassalat R. L. B Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Ontario Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz California USA Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb Illinois USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos Universidad de Granada Granada Portugal Department of Physics Boston University Boston Massachusetts USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Italy Dipartimento di Fisica Università di Roma Tor Vergata Roma Italy Faculty of Science Kyoto University Kyoto Japan Fysiska institutionen Lunds universit

A search for the narrow structure, X(5568), reported by the D0 Collaboration in the decay sequence X→Bs0π±, Bs0→J/ψϕ, is presented. The analysis is based on a data sample recorded with the ATLAS detector at the LHC corresponding to 4.9 fb−1 of pp collisions at 7 TeV and 19.5 fb−1 at 8 TeV. No significant signal was found. Upper limits on the number of signal events, with properties corresponding to those reported by D0, and on the X production rate relative to Bs0 mesons, ρX, were determined at 95% confidence level. The results are N(X)<382 and ρX<0.015 for Bs0 mesons with transverse momenta above 10 GeV, and N(X)<356 and ρX<0.016 for transverse momenta above 15 GeV. Limits are also set for potential Bs0π± resonances in the mass range 5550 to 5700 MeV.

关键词： Exotic mesons Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：