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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,861 篇 会议
9 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,162 篇 工学
- 1,098 篇 计算机科学与技术...
- 479 篇 软件工程
- 285 篇 电气工程
- 138 篇 信息与通信工程
- 126 篇 电子科学与技术（可...
- 52 篇 控制科学与工程
- 33 篇 动力工程及工程热...
- 21 篇 机械工程
- 17 篇 生物医学工程（可授...
- 16 篇 仪器科学与技术
- 15 篇 生物工程
- 14 篇 网络空间安全
- 12 篇 环境科学与工程（可...
- 10 篇 光学工程
- 8 篇 力学（可授工学、理...
- 8 篇 建筑学
- 7 篇 化学工程与技术
218 篇 理学
- 161 篇 数学
- 33 篇 物理学
- 32 篇 系统科学
- 18 篇 生物学
- 17 篇 统计学（可授理学、...
- 9 篇 化学
- 9 篇 地球物理学
196 篇 管理学
- 156 篇 管理科学与工程(可...
- 79 篇 工商管理
- 44 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 9 篇 社会学
10 篇 医学
- 8 篇 基础医学(可授医学...
6 篇 农学
5 篇 教育学

主题

547 篇 computer archite...
187 篇 hardware
122 篇 high performance...
109 篇 field programmab...
108 篇 computational mo...
83 篇 grid computing
80 篇 cloud computing
73 篇 concurrent compu...
73 篇 application soft...
73 篇 distributed comp...
72 篇 computer science
71 篇 parallel process...
71 篇 resource managem...
71 篇 graphics process...
70 篇 kernel
63 篇 throughput
59 篇 bandwidth
59 篇 benchmark testin...
58 篇 optimization
56 篇 runtime

机构

8 篇 school of comput...
8 篇 intel corp santa...
7 篇 univ chicago dep...
7 篇 mathematics and ...
6 篇 georgia inst tec...
6 篇 university of ch...
6 篇 mathematics and ...
6 篇 college of compu...
5 篇 univ wisconsin m...
5 篇 barcelona superc...
5 篇 univ calif santa...
5 篇 northeastern uni...
5 篇 carnegie mellon ...
5 篇 intel corporatio...
5 篇 univ fed rio gra...
4 篇 univ politecn ca...
4 篇 univ toronto on
4 篇 univ illinois ur...
4 篇 georgia institut...
4 篇 oak ridge nation...

作者

11 篇 navaux philippe ...
8 篇 prasanna viktor ...
8 篇 mutlu onur
7 篇 borin edson
7 篇 chong frederic t...
7 篇 guedes dorgival
6 篇 dongarra jack
6 篇 patt yale n.
6 篇 xie yuan
6 篇 torrellas josep
6 篇 schwan karsten
6 篇 ferreira renato
6 篇 i. foster
5 篇 franca felipe m....
5 篇 hwu wen-mei
5 篇 nam sung kim
5 篇 martonosi margar...
5 篇 loh gabriel h.
5 篇 kim nam sung
5 篇 zhou huiyang

语言

1,856 篇 英文
11 篇 中文
2 篇 其他
1 篇 葡萄牙文

检索条件"任意字段=IEEE 27th International Symposium on Computer Architecture and High Performance Computing"

共 1870 条记录，以下是111-120 订阅

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

详细简洁

排序：

SupermarQ: A Scalable Quantum Benchmark Suite 28

SupermarQ: A Scalable Quantum Benchmark Suite

引用

28th Annual ieee international symposium on high-performance computer architecture (HPCA)

作者： Tomesh, Teague Gokhale, Pranav Omole, Victory Ravi, Gokul Subramanian Smith, Kaitlin N. Viszlai, Joshua Wu, Xin-Chuan Hardavellas, Nikos Martonosi, Margaret R. Chong, Frederic T. Princeton Univ Dept Comp Sci Princeton NJ 08544 USA Supertech Chicago IL 60615 USA Univ Chicago Dept Comp Sci Chicago IL 60637 USA Northwestern Univ Dept Comp Sci Evanston IL 60208 USA

ISBN: (纸本)9781665420273

the emergence of quantum computers as a new computational paradigm has been accompanied by speculation concerning the scope and timeline of their anticipated revolutionary changes. While quantum computing is still in its infancy, the variety of different architectures used to implement quantum computations make it difficult to reliably measure and compare performance. this problem motivates our introduction of SupermarQ, a scalable, hardware-agnostic quantum benchmark suite which uses application-level metrics to measure performance. SupermarQ is the first attempt to systematically apply techniques from classical benchmarking methodology to the quantum domain. We define a set of feature vectors to quantify coverage, select applications from a variety of domains to ensure the suite is representative of real workloads, and collect benchmark results from the IBM, IonQ, and AQT@LBNL platforms. Looking forward, we envision that quantum benchmarking will encompass a large cross-community effort built on open source, constantly evolving benchmark suites. We introduce SupermarQ as an important step in this direction.

关键词： Quantum computing Benchmarking Program Characterization

来源：评论

学校读者我要写书评

暂无评论

INSPIRE: IN-Storage Private Information REtrieval via Protocol and architecture Co-design 22

INSPIRE: IN-Storage Private Information REtrieval via Protoc...

引用

49th ieee/ACM Annual international symposium on computer architecture (ISCA)

作者： Lin, Jilan Liang, Ling Qu, Zheng Ahmad, Ishtiyaque Liu, Liu Tu, Fengbin Gupta, Trinabh Ding, Yufei Xie, Yuan Univ Calif Santa Barbara Santa Barbara CA 93106 USA

ISBN: (纸本)9781450386104

Private Information Retrieval (PIR) plays a vital role in secure, database-centric applications. However, existing PIR protocols explore a massive working space containing hundreds of GiBs of query and database data. As a consequence, PIR performance is severely bounded by storage communication, making it far from practical for real-world deployment. In this work, we describe INSPIRE, an accelerator for IN-Storage Private Information REtrieval. INSPIRE follows a protocol and architecture co-design approach. We first design the INSPIRE protocol with a multi-stage filtering mechanism, which achieves a constant PIR query size. For a 1-billion-entry database of size 288GiB, INSPIRE's protocol reduces the query size from 27GiB to 3.6MiB. Further, we propose the INSPIRE hardware, a heterogeneous instorage architecture, which integrates our protocol across the SSD hierarchy. Together with the INSPIRE protocol, the INSPIRE hardware reduces the query time from 28.4min to 36s, relative to the the state-of-the-art FastPIR scheme.

关键词： In-storage computing private information retrieval (PIR)

来源：评论

学校读者我要写书评

暂无评论

QVal: A Novel Routing Algorithm for Dragonfly Networks 25

QVal: A Novel Routing Algorithm for Dragonfly Networks

引用

25th ieee international Conferences on high performance computing and Communications, 9th international Conference on Data Science and Systems, 21st ieee international Conference on Smart City and 9th ieee international Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Navaridas, Javier Pascual, Jose A. Dept. of Computer Architecture and Technology Paseo Manuel de Lardizabal 1 Donostia-San Sebastián20018 Spain

ISBN: (纸本)9798350330014

Dragonfly is becoming one of the networks of choice for high-performance computer systems as it offers a sweet spot in terms of cost, simplicity, performance, fault-tolerance and power. In a Dragonfly topology, compute nodes are connected to routers forming fully-connected groups, which are then connected to every other group. this provides very high connectivity with very low diameter which are desired characteristics of high performance interconnection networks. In this work, we propose Quick Valiant, a new routing algorithms for dragonfly networks which leverages Valiant routing with novel proxy selection criteria which reduce the utilization of network resources and eases congestion under pathological loads. these criteria restrict the possible proxies to these that are adjacent to either the local or the remote router, codenamed QVL and QVR, respectively. We compare our proposals with canonical routing functions and observe reductions of average path length of up to 27% and throughput improvements of up to 46% when compared with Valiant routing. Out of these criteria, restricting to local proxies only, QVL, obtains the best results in all scenarios. © 2023 ieee.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing 28

Not All SWAPs Have the Same Cost: A Case for Optimization-Aw...

引用

28th Annual ieee international symposium on high-performance computer architecture (HPCA)

作者： Liu, Ji Li, Peiyi Zhou, Huiyang North Carolina State Univ Raleigh NC 27695 USA

ISBN: (纸本)9781665420273

Despite rapid advances in quantum computing technologies, the qubit connectivity limitation remains to be a critical challenge. Both near-term NISQ quantum computers and relatively long-term scalable quantum architectures do not offer full connectivity. As a result, quantum circuits may not be directly executed on quantum hardware, and a quantum compiler needs to perform qubit routing to make the circuit compatible with the device layout. During the qubit routing step, the compiler inserts SWAP gates and performs circuit transformations. Given the connectivity topology of the target hardware, there are typically multiple qubit routing candidates. the state-of-the-art compilers use a cost function to evaluate the number of SWAP gates for different routes and then select the one with the minimum number of SWAP gates. After qubit routing, the quantum compiler performs gate optimizations upon the circuit with the newly inserted SWAP gates. In this paper, we observe that the aforementioned qubit routing is not optimal, and qubit routing should not be independent on subsequent gate optimizations. We find that with the consideration of gate optimizations, not all of the SWAP gates have the same basis-gate cost. these insights lead to the development of our qubit routing algorithm, NASSC (Not All Swaps have the Same Cost). NASSC is the first algorithm that considers the subsequent optimizations during the routing step. Our optimization-aware qubit routing leads to better routing decisions and benefits subsequent optimizations. We also propose a new optimization-aware decomposition for the inserted SWAP gates. Our experiments show that the routing overhead compiled with our routing algorithm is reduced by up to 69.30% (21.30% on average) in the number of CNOT gates and up to 43.50% (7.61% on average) in the circuit depth compared with the state-of-the-art scheme, SABRE.

关键词： quantum computing compiler optimization qubit routing

来源：评论

学校读者我要写书评

暂无评论

Low-Bitwidth Floating Point Quantization for Efficient high-Quality Diffusion Models 27

Low-Bitwidth Floating Point Quantization for Efficient High-...

引用

27th international symposium on Workload Characterization

作者： Chen, Cheng Giannoula, Christina Moshovos, Andreas Univ Toronto Elect & Comp Engn Toronto ON Canada Univ Toronto Comp Sci Toronto ON Canada Vector Inst Toronto ON Canada

ISBN: (纸本)9798350356045;9798350356038

Diffusion models are emerging models that generate images by iteratively denoising random Gaussian noise using deep neural networks. these models typically exhibit high computational and memory demands, necessitating effective post-training quantization for high-performance inference. Recent works propose low-bitwidth (e.g., 8-bit or 4-bit) quantization for diffusion models, however 4-bit integer quantization typically results in low-quality images. We observe that on several widely used hardware platforms, there is little or no difference in compute capability between floating-point and integer arithmetic operations of the same bitwidth (e.g., 8-bit or 4-bit). therefore, we propose an effective floating-point quantization method for diffusion models that provides better image quality compared to integer quantization methods. We employ a floating-point quantization method that was effective for other processing tasks, specifically computer vision and natural language tasks, and tailor it for diffusion models by integrating weight rounding learning during the mapping of the full-precision values to the quantized values in the quantization process. We comprehensively study integer and floating-point quantization methods in state-of-the-art diffusion models. Our floating-point quantization method not only generates higher-quality images than that of integer quantization methods, but also shows no noticeable degradation compared to full-precision models (32-bit floating-point), when both weights and activations are quantized to 8-bit floating-point values, while has minimal degradation with 4-bit weights and 8-bit activations. Additionally, we introduce a better methodology to evaluate quantization effects, highlighting shortcomings with existing output quality metrics and experimental methodologies. Finally, as an additional potential benefit, our floating-point quantization method increases model sparsity by an order of magnitude, enabling further optimization opportu

关键词： Diffusion Model Floating-Point Quantization

来源：评论

学校读者我要写书评

暂无评论

Presenting method to schedule tasks in the cloud computing environment using the whale optimization algorithm 27

Presenting method to schedule tasks in the cloud computing e...

引用

27th international computer Conference, computer Society of Iran, CSICC 2022

作者： Dinani, Armin Tavakoli Mirabi, Meqdad Khademi, Maryam Islamic Azad University Electronic Campus Computer Engineering In Software Tehran Iran Islamic Azad University South Tehran Branch Tehran Iran Islamic Azad University South Tehran Branch Applied Mathematics Tehran Iran

ISBN: (纸本)9781665480277

Cloud computing, the distributed computing template, is a model for providing easy access based on the user demand through changeable and configurable computing resources with the slightest need to manage the help of a heterogeneous computing system in its geographically distributed form for sharing. Task scheduling in different heterogeneous physical machines and also efficient scheduling of tasks from a program in the available resources are the key factors in achieving the high performance. the main problem of task scheduling involves assigning the functions of a program to the appropriate processors and arranging work functions in each resource. One of the crucial challenges with a significant impact on the performance of such systems is the optimal scheduling. For the purpose of study, the whale optimization algorithm for a high-performance optimal scheduling was studied in different heterogeneous environments. this meta-heuristic algorithm can find the optimal answer with great accuracy while taking advantage of the relationships between the whales. To reduce time, both the total execution time and also the maximum execution time of every task were minimized. through this, the highest level of time consumption for the task execution would be reduced. the results show that for a large set of functions (400 and more), the total time obtained is much less than the time for the base study. As a result, for the set of1000 functions, the given improvements through the suggested method is 24.26 in the best case and 24.85 in the average mode. © 2022 ieee.

关键词： Cloud computing Processor scheduling Software algorithms Whales Optimal scheduling Heterogeneous networks Software

来源：评论

学校读者我要写书评

暂无评论

Defense Method against Adversarial Attacks Using JPEG Compression and One-Pixel Attack for Improved Dataset Security 27

Defense Method against Adversarial Attacks Using JPEG Compre...

引用

27th international Conference on System theory, Control and computing, ICSTCC 2023

作者： Cucu, Adelina-Valentina Valenzise, Giuseppe Stănescu, Daniela Ghergulescu, Ioana Găină, Lucian Ionel Gușiță, Bianca CentraleSupélec Laboratoire des Signaux et systèmes Université Paris-Saclay Gif-sur-Yvette France Computer Science Department Politehnica University of Timisoara Timisoara Romania CNRS CentraleSupélec Laboratoire des Signaux et systèmes Université Paris-Saclay Gif-sur-Yvette France Adaptemy Dublin Ireland

ISBN: (纸本)9798350337983

Machine Learning has gained widespread applications, especially in the domain of image recognition due to the high performance of algorithms and models. Nonetheless, the potential threat posed by adversarial samples has impeded their widespread adoption, especially in safety-critical applications. In such cases, the model's final performance is significantly compromised due to the presence of adversarial perturbations that are invisible to human perception. this paper introduces a novel pre-processing solution for protecting image datasets against adversarial attacks such as the Fast Sign Gradient Method or other similar attacks. the proposed method involves utilizing high JPEG compression for removing the adversarial perturbations of the dataset and applying a Targeted One Pixel Attack with the aim of recovering the true class of the images after the compression process. the proposed approach results in a highly secured and clean dataset maintaining a high classification accuracy. the approach was tested on CIFAR10 dataset. the results have shown that the misclassification rate after the FGSM attack was significantly reduced from 89.3% to 12.5% using this method for the compression quality of 20 on a subset of 1000 images. © 2023 ieee.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

QULATIS: A Quantum Error Correction Methodology toward Lattice Surgery 28

QULATIS: A Quantum Error Correction Methodology toward Latti...

引用

28th Annual ieee international symposium on high-performance computer architecture (HPCA)

作者： Ueno, Yosuke Kondo, Masaaki Tanaka, Masamitsu Suzuki, Yasunari Tabuchi, Yutaka Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan Keio Univ Fac Sci & Technol Tokyo Japan RIKEN Ctr Quantum Comp Tokyo Japan Nagoya Univ Grad Sch Engn Nagoya Aichi Japan NTT Comp & Data Sci Labs Tokyo Japan JST PRESTO Tokyo Japan

ISBN: (纸本)9781665420273

Due to the high error rate of a qubit, detecting and correcting errors on it is essential for fault-tolerant quantum computing (FTQC). Surface code (SC) associated with its decoding algorithm is one of the most promising quantum error correction (QEC) methods because it has high fidelity and requires only nearest neighbor qubits connectivity. To realize FTQC, we need a decoder circuit capable of not only QEC in a 3-D lattice to deal with errors in measurement on ancillary qubits but also quantum operations on logically constructed qubits. Whereas several methods to perform logical operations on SC, such as lattice surgery (LS), are known, no practical decoders supporting them have been proposed yet. One of the most promising QC implementations today is made up of superconducting qubits that are located in a cryogenic environment. To reduce the hardware complexity of QC and latency of QEC, we are supposed to perform QEC in a cryogenic environment. Hence a power-efficient decoder is required due to the limited power budget inside a dilution refrigerator. In this paper, we propose an online-QEC algorithm that supports LS with a practical decoder circuit, as well as a new FTQC architecture. We design a key building block of the proposed architecture with a hybrid of SFQ- and Cryo-CMOS-based digital circuits and evaluate it with a SPICE-level simulation. Each logic element includes about 2400 Josephson junctions, and power consumption is estimated to be 2.07 mu W when operating with a 2 GHz clock frequency. We evaluate the decoder performance by a quantum error simulator for an essential operation of LS with code distances up to 11, and it achieves a 0.6% accuracy threshold. In an LS-based architecture further supporting a magic-state distillation protocol, which is expected to run for near-term universal quantum computing, we evaluate the QEC performance and power consumption of the architecture and show that it is practical to be operated in 4-K temperature region of a

关键词： Quantum computing Quantum Error Correction Single flux quantum (SFQ)

来源：评论

学校读者我要写书评

暂无评论

PIMCloud: QoS-Aware Resource Management of Latency-Critical Applications in Clouds with Processing-in-Memory 28

PIMCloud: QoS-Aware Resource Management of Latency-Critical ...

引用

28th Annual ieee international symposium on high-performance computer architecture (HPCA)

作者： Chen, Shuang Jiang, Yi Delimitrou, Christina Martinez, Jose F. Cornell Univ Comp Syst Lab Ithaca NY 14850 USA

ISBN: (纸本)9781665420273

the slowdown of Moore's Law, combined with advances in 3D stacking of logic and memory, have pushed architects to revisit the concept of processing-in-memory (PIM) to overcome the memory wall bottleneck. this PIM renaissance finds itself in a very different computing landscape from the one twenty years ago, as more and more computation shifts to the cloud. Most PIM architecture papers still focus on best-effort applications, while PIM's impact on latency-critical cloud applications is not well understood. this paper explores how datacenters can exploit PIM architectures in the context of latency-critical applications. We adopt a general-purpose cloud server with HBM-based, 3D stacked logic+memory modules, and study the impact of PIM on six diverse interactive cloud applications. We reveal the previously neglected opportunity that PIM presents to these services, and show the importance of properly managing PIM-related resources to meet the QoS targets of interactive services and maximize resource efficiency. then, we present PIMCloud, a QoS-aware resource manager designed for cloud systems with PIM allowing colocation of multiple latency-critical and best-effort applications. We show that PIMCloud efficiently manages PIM resources: it (1) improves effective machine utilization by up to 70% and 85% (average 24% and 33%) under 2-app and 3-app mixes, compared to the best state-of-the-art manager;(2) helps latency-critical applications meet QoS;and (3) adapts to varying load patterns.

关键词： three-dimensional displays Stacking Quality of service computer architecture Resource management Servers

来源：评论

学校读者我要写书评

暂无评论

Ring Road: A Scalable Polar-Coordinate-based 2D Network-on-Chip architecture 57

Ring Road: A Scalable Polar-Coordinate-based 2D Network-on-C...

引用

57th Annual ieee/ACM international symposium on Microarchitecture, MICRO 2024

作者： Feng, Yinxiao Li, Wei Ma, Kaisheng Tsinghua University Beijing China Tsinghua University Department of Computer Science and Technology Beijing China

ISBN: (纸本)9798350350579

Networks-on-chip (NoCs) are scaled out to build large-scale multi-chip networks to meet the growing demand for computing. However, the traditional router-based NoC architecture has significant limitations: 1) the overhead of routers is high, especially for long-distance traffic that traverses numerous chips and hops;2) On/off-chip traffic is mixed up, so the local NoC performance is dragged down by the cross-chip traffic;3) the routing design of intra/inter-chip networks is also entangled. the alternative router-less solution based on isolated multi-ring (IMR) can address some of these issues;however, the complete lack of routers leads to wiring overhead and limited scalability thus not suitable for large-scale multi-chip networks. therefore, we are motivated to design a new network architecture that can reduce router/wiring overhead, isolate on/off-chip traffic, and decouple inter/intra-chip routing design by combining the advantages of both routers and router-less rings. In this paper, we propose Ring Road, in which high-speed isolated multi-rings are integrated with compact routers, thus achieving flexible traffic delivery with less router usage and overhead. A polar-coordinate-based description is presented to describe the topology, and corresponding deadlock-free routing algorithms are discussed. As a standalone NoC, Ring Road is low-cost, low-latency, and high-performance. It can also be scaled out into multi-chip networks without redesigning the on-chip routing regardless of inter-chip topology. With low-cost isolated ring channels, no matter how heavy the cross-chip traffic is, the local NoC performance remains consistent. Circuit implementation and post-synthesis analysis show that Ring Road achieves 1.7∼2× bandwidth-per-Area and 1.6∼1.9× bandwidth-per-power compared with the traditional mesh router. Cycle-Accurate simulation shows that Ring Road achieves better performance and energy efficiency at various workloads and configurations. © 2024 ieee.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共187页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：