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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,624 篇 会议
13 篇 期刊文献
9 册 图书

馆藏范围

1,646 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

916 篇 工学
- 838 篇 计算机科学与技术...
- 323 篇 软件工程
- 211 篇 信息与通信工程
- 133 篇 电气工程
- 63 篇 控制科学与工程
- 31 篇 生物工程
- 22 篇 生物医学工程（可授...
- 17 篇 电子科学与技术（可...
- 15 篇 动力工程及工程热...
- 15 篇 安全科学与工程
- 14 篇 网络空间安全
- 13 篇 建筑学
- 12 篇 土木工程
- 10 篇 仪器科学与技术
- 10 篇 交通运输工程
- 9 篇 机械工程
- 9 篇 材料科学与工程（可...
- 8 篇 化学工程与技术
183 篇 理学
- 89 篇 数学
- 68 篇 物理学
- 33 篇 生物学
- 19 篇 系统科学
- 18 篇 统计学（可授理学、...
134 篇 管理学
- 94 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 57 篇 工商管理
20 篇 法学
- 16 篇 社会学
17 篇 经济学
- 15 篇 应用经济学
17 篇 医学
- 16 篇 临床医学
- 14 篇 基础医学(可授医学...
2 篇 农学
1 篇 教育学
1 篇 文学
1 篇 军事学
1 篇 艺术学

主题

156 篇 distributed comp...
113 篇 cloud computing
78 篇 peer to peer com...
74 篇 application soft...
67 篇 protocols
67 篇 computer network...
64 篇 computational mo...
63 篇 mobile computing
56 篇 computer science
56 篇 computer archite...
49 篇 high performance...
47 篇 routing
46 篇 bandwidth
45 篇 internet
45 篇 middleware
43 篇 privacy
40 篇 costs
39 篇 resource managem...
39 篇 distributed comp...
38 篇 social networkin...

机构

14 篇 state key labora...
10 篇 gansu provincial...
9 篇 beijing universi...
7 篇 institute of com...
7 篇 cern geneva
6 篇 college of compu...
6 篇 shenzhen institu...
6 篇 tokyo denki univ...
5 篇 department of ph...
5 篇 dept. of astrono...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 iii. physikalisc...
5 篇 erlangen centre ...
5 篇 département de p...
5 篇 school of physic...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 department of ph...
5 篇 institut für phy...

作者

8 篇 takizawa makoto
6 篇 huang lican
6 篇 enokido tomoya
6 篇 makoto takizawa
5 篇 de ridder s.
5 篇 choi k.
5 篇 an r.
5 篇 haungs a.
5 篇 fürst p.
5 篇 cross r.
5 篇 bradascio f.
5 篇 fan k.l.
5 篇 bourbeau e.
5 篇 fritz a.
5 篇 bastian b.
5 篇 gündüz m.
5 篇 dvorak e.
5 篇 halve l.
5 篇 gonzalez j.g.
5 篇 de clercq c.

语言

1,636 篇 英文
8 篇 中文
5 篇 其他

检索条件"任意字段=Proceedings of the 22nd International Conference on Distributed Computing and Networking"

共 1646 条记录，以下是1491-1500 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Web Proxy Auto Discovery for the WLCG 22

Web Proxy Auto Discovery for the WLCG

引用

22nd international conference on computing in High Energy and Nuclear Physics, CHEP 2016

作者： Dykstra, D. Blomer, J. Blumenfeld, B. De Salvo, A. Dewhurst, A. Verguilov, V. Scientific Computing Division Fermilab BataviaIL United States EP-SFT Department CERN Geneva Switzerland Johns Hopkins University BaltimoreMD United States Istituto Nazionale di Fisica Nucleare Rome Italy Rutherford Appleton Laboratory Oxfordshire United Kingdom EP-UCM Department CERN Geneva Switzerland

All four of the LHC experiments depend on web proxies (that is, squids) at each grid site to support software distribution by the CernVM FileSystem (CVMFS). CMS and ATLAS also use web proxies for conditions data distributed through the Frontier distributed Database caching system. ATLAS & CMS each have their own methods for their grid jobs to find out which web proxies to use for Frontier at each site, and CVMFS has a third method. Those diverse methods limit usability and flexibility, particularly for opportunistic use cases, where an experiment's jobs are run at sites that do not primarily support that experiment. This paper describes a new Worldwide LHC computing Grid (WLCG) system for discovering the addresses of web proxies. The system is based on an internet standard called Web Proxy Auto Discovery (WPAD). WPAD is in turn based on another standard called Proxy Auto Configuration (PAC). Both the Frontier and CVMFS clients support this standard. The input into the WLCG system comes from squids registered in the ATLAS Grid Information System (AGIS) and CMS SITECONF files, cross-checked with squids registered by sites in the Grid Configuration Database (GOCDB) and the OSG Information Management (OIM) system, and combined with some exceptions manually configured by people from ATLAS and CMS who operate WLCG Squid monitoring. WPAD servers at CERN respond to http requests from grid nodes all over the world with a PAC file that lists available web proxies, based on IP addresses matched from a database that contains the IP address ranges registered to organizations. Large grid sites are encouraged to supply their own WPAD web servers for more flexibility, to avoid being affected by short term long distance network outages, and to offload the WLCG WPAD servers at CERN. The CERN WPAD servers additionally support requests from jobs running at non-grid sites (particularly for LHC@Home) which they direct to the nearest publicly accessible web proxy servers. The responses to

关键词： Molluscs

来源：评论

学校读者我要写书评

暂无评论

On Design and Performance of Cloud-Based distributed Interactive Applications

On Design and Performance of Cloud-Based Distributed Interac...

引用

international conference on Network Protocols

作者： Haiyang Wang Ryan Shea Xiaoqiang Ma Feng Wang Jiangchuan Liu University of Minnesota Duluth Simon Fraser University Simon Fraser University Burnaby BC CA University of Mississippi

distributed interactive applications (DIAs) such as online gaming have attracted a vast number of users over the Internet. It is however known that the deployment of DIA systems comes with peculiar hardware/software requirements on the users' consoles. Recently, such industrial pioneers as Gaikai, Onlive and Ciinow have offered a new based distributed interactive applications generation of cloud (CDIAs), which shift the necessary computing loads to cloud platforms and largely relieve the pressure on individual user consoles. In this paper, we take a first step towards understanding the CDIA framework and highlight its design challenges. Our measurement reveals the inside structure as well as the operations of real CDIA systems and identifies the critical role of the cloud proxies. While this design makes effective use of cloud resources to mitigate the clients' workloads, it can also significantly increase the interaction latency among clients if not carefully handled. Besides the extra network latency due to the involvement of cloud proxies, we find that the computation-intensive tasks (e.g., Game rendering) and bandwidth-intensive tasks (e.g., Streaming the game screen to the clients) together create a severe bottleneck in CDIA. Our experiment indicates that when the cloud proxies are virtual machines (VMs) in the cloud, the computation-intensive and bandwidth-intensive tasks will seriously interfere with each other if not handled carefully. We accordingly capture this feature in our model and present an interference-aware solution. This approach not only smartly allocates the workloads but also dynamically assigns the capacities across VMs.

关键词： Games Servers Cloud computing Benchmark testing Hardware Bandwidth Random access memory

来源：评论

学校读者我要写书评

暂无评论

Game Theoretic Energy Allocation for Renewable Powered In-Situ Server Systems

Game Theoretic Energy Allocation for Renewable Powered In-Si...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Junlong Zhou Jianfei Chen Kun Cao Tongquan Wei Mingsong Chen Department of Computer Science and Technology East China Normal University Shanghai China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China

ISBN: (纸本)9781509053827

In-situ server systems are deployed in very special operating environment to handle in-situ workloads that are normally generated from environmentally sensitive areas or remote places that lack established utility infrastructure. This very special operating environment of in-situ servers urges such systems to be 100 percent powered by renewable energy. However, existing energy management schemes assume a hybrid supply of grid and renewable energy, hence are not well suited for 100 percent renewable powered in-situ server systems. In this paper, we tackle the problem of allocating harvested energy to 100 percent renewable powered server systems for optimizing both the overall system throughput and throughput of individual servers. From a game theoretic perspective, we model the energy allocation problem as a cooperative game among multiple servers and derive a Nash bargaining solution. Based on the Nash bargaining solution, we then propose a heuristic algorithm that determines the energy allocation strategies according to system energy states. Experimental results show that our proposed game theoretic approach achieves a high throughput from perspectives of both the overall system and individual servers.

关键词： Servers Renewable energy sources Resource management Games Energy states Program processors Throughput

来源：评论

学校读者我要写书评

暂无评论

Garlic Cast: Lightweight and Decentralized Anonymous Content Sharing

Garlic Cast: Lightweight and Decentralized Anonymous Content...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Chen Qian Junjie Shi Zihao Yu Ye Yu Sheng Zhong UC Santa Cruz Nanjing Univ. ICT CAS Univ. Kentucky

ISBN: (纸本)9781509053827

Anonymous content sharing over the Internet protects user privacy and content confidentiality. Most overlay anonymous communication protocols employ some relay nodes as the proxies to forward content and require relays to perform cryptography or coding operations on messages. They have two major limitations. First, extra computation overhead may discourage overlay nodes from serving as relays. Second, long forwarding latency at relays makes an anonymous path easier to fail under network churn. In this paper, we present a lightweight and decentralized anonymous content sharing system named Garlic Cast, which requires near-zero computation cost on relays and does not rely on any centralized service. Garlic Cast uses random walks to find proxies in overlay networks and an security-enhanced Information Dispersal Algorithm to search and deliver content files. We have implemented a prototype of Garlic Cast and performed extensive simulation on real overlay topologies. Evaluation results show that the throughput of Garlic Cast is higher than that of RSA-based anonymous routing by over two orders of magnitude. Garlic Cast provides high level of anonymity and is robust to various attacks.

关键词： Peer-to-peer computing Cryptography Relays Overlay networks Protocols Routing Internet

来源：评论

学校读者我要写书评

暂无评论

High speed scientific data transfers using software defined networking 2

High speed scientific data transfers using software defined ...

引用

2nd Workshop on Innovating the Network for Data-Intensive Science, IndIS 2015

作者： Newman, Harvey Legrand, Iosif Mughal, Azher Voicu, Ramiro Kcira, Dorian Bunn, Julian Marcos, Jorge Lopez, Luis Barczyk, Artur Bredel, Michael Cury, Samir Lapadatescu, Vlad Spiroulu, Maria Vlimant, Jean-Roch Hendricks, Wayne Tam, Thomas Martelli, Edoardo Foster, David Papadopoulis, Christos Shannigrahi, Susmit Hoeft, Bruno Lee, Andy Lee, Gene Tierney, Brian Pouyoul, Eric Monga, Inder Guok, Chin Bell, Greg Johnston, Bill Colling, David Rand, Duncan Fayer, Simon Boyd, Eric DeMar, Phil Wu, Wenji Spentzouris, Panagiotis Ibarra, Julio Alvarez, Heidi Bezerra, Jeronimo Keen, Andrew Yeh, Edmund Liu, Ran Chen, James Mambretti, Joe Timoteo, Sergio Salamao, Jorge Cox, Chip Wildish, Tony Moura, Alex Dias, Gustavo Ciuffo, Leandro Stanton, Michael Von Malenstein, Gerben Rothenberg, Christian Esteve Arantes, Dalton Soares Melo, Darli Barbosa, Felipe Rudge Novaes, Sergio Iope, Rogerio Leal, Beraldo Bach, Eduardo Costa, Marcio Pavani, Gustavo Batista, Jorge Ball, Robert Hockett, Roy McKee, Shawn De, Kaushik Gable, Ian Sobie, Randal Tackett, Alan Melo, Andrew Sheldon, Paul Caltech 1200 E California Blvd. PasadenaCA91125 United States Brazil United States CANARIE Canada CERN Switzerland Colorado State University United States Germany Echostreams Germany ESnet Spain Imperial College London United Kingdom Internet2 United States Fermilab United States Florida International University/AmLight United States Michigan State University United States Northeastern University United States Northwestern University United States Padtec United States Princeton University United States Brazil SurfNET Brazil Brazil Brazil Universidade Federal Do ABC Brazil United States United States Canada Vanderbilt University United States

ISBN: (纸本)9781450340021

The massive data volumes acquired, simulated, processed and analyzed by globally distributed scientific collaborations continue to grow exponentially. One leading example is the LHC program, now at the start of its second three year data taking cycle, searching for new particles and interactions in a previously inaccessible range of energies, which has experienced a 70% growth in peak data transfer rates over the last 12 months alone. Other major science programs such as LSST and SKA, and other disciplines ranging from earth observation to genomics, are expected to have similar or great needs than the LHC program within the next decade. The development of new methods for fast, efficient and reliable data transfers over national and global distances, and a new generation of intelligent, software-driven networks capable of supporting multiple science programs with diverse needs for high volume and/or real-time data delivery, are essential if these programs are to continue to progress, and meet their goals. In this paper we describe activities of the Caltech High Energy Physics team and collaborators, related to the use Software Defined networking to help achieve fast and efficient data distribution and access. Results from Supercomputing 2014 are presented together with our work on the Advanced Network Services for the Experiments project, and a new project developing a Next Generation Integrated SDN Architecture, as well as our plans for Supercomputing 2015. © 2015 ACM.

关键词： Software defined networking

来源：评论

学校读者我要写书评

暂无评论

A Fine-Grained Parallel Intra Prediction for HEVC Based on GPU

A Fine-Grained Parallel Intra Prediction for HEVC Based on G...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Wenbin Jiang Ye Chi Hai Jin Xiaofei Liao Yangsong Zhang Geyan Ye Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781509053827

Intra prediction in HEVC is much more complex compared to the one in H.264 because of the more diversifications of the block sizes and prediction modes. The state-of-the-art researches for its parallelization only focus on block-level methods, which only take very limited advantage of GPUs. It is still a big challenge to implement fine-grained parallelism on GPU in consideration of the HEVC branch instructions and the different prediction formulae. We present a novel pixel-level parallelism method for the intra prediction of HEVC based on GPU combined with mode-level parallelism. By unifying not only the prediction formulae between angular mode and planar mode but also a predictor array, an algorithm based on look-up table is proposed to greatly reduce branches and improve prediction efficiency. With the help of look-up table algorithm, each pixel in a block can obtain the offset of corresponding reference pixels and find the value in the unifying predictor array at the same time which makes it possible to predict all pixels in parallel regardless of their relative positions in the block. The experimental results show that the proposed algorithm outperforms previous work and can reduce encoding time effectively.

关键词： Parallel processing Graphics processing units Encoding Prediction algorithms Instruction sets Algorithm design and analysis Standards

来源：评论

学校读者我要写书评

暂无评论

Enabling Self-defined Navigation on Road Graph via Double Rewarded Generalized VIN

Enabling Self-defined Navigation on Road Graph via Double Re...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Xiaojuan Wei Jinglin Li Quan Yuan Zhe Zhang Yangyang Zha Fangchun Yang State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781728176499;9781728176505

Nowadays navigation systems are mostly centralized and mainly relying on the traffic conditions of road network, and other influence factors are rarely considered, such as roads topology, domain knowledge and planning autonomy, which is result in the recommended seemingly optimal routes may attract numerous vehicles and then congestion. Besides, the existing region-based methods have deviation on acquiring the traffic conditions of road segments, which lead to the inadequate use of road resource and the waste of drivers' *** that MEC can provide low latency and quick responses support for intelligent driving, we propose an online planning approach on the road graph via a double rewarded Generalized Value Iteration Network, 2r-GVIN for short. In detail, a large-scale real GPS trajectories are mapped and discretized into traffic sequence pairs anonymously, that is, capturing the traffic status and driving actions as dataset. Then a neural network ConvLSTM which can effectively capture the spatio-temporal properties, is trained to predict the future traffic situation to form “prediction reward”. To enable learning and planning on irregular road graphs straightforwardly, an economical embedding graph convolution operator network GVIN is used. Combining with the model input “current reward”, 2r-GVIN is formed to solve the plan-involved function iteratively. Lastly, we train and evaluate 2r-GVIN on planning problem in road networks, showing that it can achieve road segment-based self-defined navigation with high success rate.

关键词： Navigation Convolution Roads Collaboration Planning Trajectory Topology

来源：评论

学校读者我要写书评

暂无评论

Research on distributed Database Stability Testing Platform based on Chaos Engineering

Research on Distributed Database Stability Testing Platform ...

引用

IEEE international conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Chaolun Wang Jiaxing Yang Xiaolu Han Jianrui Ma Siyuan Liu Pengwei Ma China Academy of Information and Communications Technology Beijing China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

With the fast development of information technology, the databases used as the fundamental storage and computing component of information system have to deal with much more complicated scenarios with high frequency and concurrency. distributed databases are becoming more and more common in data-intensive industries such as banking and telecommunications. The selection of distributed database products requires comprehensively consider the function, performance, security, ease of use and stability of the product. The stability of distributed database is known to be difficult in testing and product selection. The method widely used in database testing is TPC-DS (transaction processing performance council-decision support) benchmark, which is only suitable for functional and performance testing. To deal with this drawback, a distributed database stability testing platform based on chaos engineering methodology is developed. Through the perturbation injection by using the stability testing platform, the performance fluctuation of the database under pressure condition can be observed, and the stability of the database can then be evaluated.

关键词： Chaos Industries Urban areas distributed databases Transportation Software Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Current Advances on Cloud-Based distributed computing for Forest Monitoring 22nd

Current Advances on Cloud-Based Distributed Computing for Fo...

引用

22nd international Scientific and Practical conference Information and Communication Technologies and Sustainable Development, ICT and SD 2022

作者： Shelestov, Andrii Salii, Yevhenii Hordiiko, Nataliia Yailymova, Hanna National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" Beresteiskyi Ave. 37 Kyiv03056 Ukraine Space Research Institute National Academy of Sciences of Ukraine and State Space Agency of Ukraine Glushkov Ave. 40 Kyiv03187 Ukraine

ISBN: (纸本)9783031468797

One of the most important tasks related to environmental protection is forests monitoring. Meanwhile, specialists deal with the problem of big data and the need to utilize powerful computing resources that are not always available. Cloud solutions (CREODIAS, Google Earth Engine, etc.) provide instant satellite data access and the ability to quickly and conveniently process geospatial data in the cloud and use it to search for information products. Forest monitoring is supported by the European Commission (EU project SWIFTT), the World Wildlife Fund and others. This work analyzes Sentinel-2 satellite spectral channels, which distribution of pixel values was constructed for diseased and healthy forests, and the possibility of separating these two classes was analyzed based on the Bhattacharya distance. The informativeness of time series application of the normalized difference vegetation index (ndVI) was analyzed. The assumption that the average value of ndVI decreases and the standard deviation increases when the forest changes is confirmed. Getting results for large areas will lead to a big data problem. Therefore, the structure of the pilot information system is proposed as the basis for a further cloud solution with the development of a machine (deep) learning model for forest monitoring in any territory (including Ukraine). This system allows monitoring forests dynamics based on time series of satellite data at the country level and worldwide. This will be an important step for Ukraine as a potential member of the EU in the field of providing information services and monitoring the most sensitive natural resources. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Lightweight Dependency Checking for Parallelizing Loops with Non-Deterministic Dependency on GPU

Lightweight Dependency Checking for Parallelizing Loops with...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Hongyuan Liu King Tin Lam Huanxin Lin Cho-Li Wang Junchao Ma Department of Computer Science The University of Hong Kong Shannon Cognitive Computing Laboratory Huawei Technologies

ISBN: (纸本)9781509053827

General-purpose GPUs have been prevalent for a decade. Nevertheless, GPU programming remains an onerous job practically exclusive to veteran developers who must know both domain-specific knowledge and GPU architecture well. Although current parallelizing compilers that automatically parallelize and offload sizable loops onto the GPU have helped in unfettering the power of the GPU with minimal programming effort, there are still a family of loops that carry statically non-deterministic data dependencies and cannot be parallelized. To tackle this issue, we propose two lightweight dependency checking schemes that are very different from existing conservative compilers to assist parallelizing loops with non-deterministic data dependencies. Our schemes feature linear work complexity for memory operations, lower memory consumption compared to previous work, and minimal false positives by leveraging the lockstep execution on the GPU's SIMD lanes. Experiments done using microbenchmarking and real-life applications on the latest advanced AMD discrete GPUs show that our schemes can achieve 2.2 × speedup over existing solutions in dependency-free cases while only taking about 20% of time compared to existing solutions in the case with statically unproven loop-carried dependencies.

关键词： Graphics processing units Instruction sets Kernel Programming Memory management Registers Complexity theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共165页 << < 146 147 148 149 150 151 152 153 154 155 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：