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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,301 篇 会议
53 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

1,071 篇 工学
- 1,039 篇 计算机科学与技术...
- 439 篇 软件工程
- 152 篇 信息与通信工程
- 149 篇 电气工程
- 74 篇 控制科学与工程
- 41 篇 网络空间安全
- 17 篇 电子科学与技术（可...
- 7 篇 化学工程与技术
- 6 篇 农业工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 4 篇 交通运输工程
297 篇 理学
- 271 篇 数学
- 68 篇 统计学（可授理学、...
- 17 篇 物理学
- 9 篇 系统科学
- 8 篇 化学
- 7 篇 生物学
60 篇 管理学
- 32 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 19 篇 工商管理
18 篇 教育学
- 18 篇 教育学
10 篇 经济学
- 10 篇 应用经济学
10 篇 法学
- 7 篇 社会学
- 4 篇 法学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

244 篇 distributed comp...
95 篇 distributed algo...
78 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
28 篇 distributed syst...
23 篇 approximation al...
23 篇 computer systems...
23 篇 algorithms
23 篇 congest model
22 篇 local model
21 篇 fault tolerance
21 篇 distributed grap...
19 篇 cloud computing
17 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 graph algorithms
14 篇 fault-tolerance
14 篇 randomized algor...

机构

30 篇 swiss fed inst t...
26 篇 technion haifa
18 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 univ michigan an...
11 篇 tel aviv univ te...
11 篇 aalto univ espoo
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 natl univ singap...
8 篇 weizmann inst sc...
8 篇 ben gurion univ ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 technion
6 篇 ecole polytech f...
6 篇 cnrs
5 篇 georgetown univ ...
5 篇 univ toronto on

作者

25 篇 kuhn fabian
22 篇 ghaffari mohsen
19 篇 censor-hillel ke...
18 篇 suomela jukka
17 篇 raynal michel
17 篇 pandurangan gopa...
16 篇 chang yi-jun
16 篇 elkin michael
16 篇 fraigniaud pierr...
15 篇 wattenhofer roge...
14 篇 peleg david
14 篇 toueg sam
14 篇 kutten shay
14 篇 brandt sebastian
13 篇 balliu alkida
13 篇 patt-shamir boaz
13 篇 maus yannic
13 篇 olivetti dennis
13 篇 guerraoui rachid
12 篇 rajsbaum sergio

语言

1,328 篇 英文
26 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"

共 1355 条记录，以下是231-240 订阅

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

详细简洁

排序：

Generalizing the Sharp Threshold Phenomenon for the distributed Complexity of the Lovasz Local Lemma 20

Generalizing the Sharp Threshold Phenomenon for the Distribu...

引用

39th symposium on principles of distributed computing

作者： Brandt, Sebastian Grunau, Christoph Rozhon, Vaclav Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450375825

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lovasz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved that, under the LLL criterion p2(d) < 1, if each random variable affects at most 3 events, the deterministic complexity of the LLL in the LOCAL model is O(d(2) + log* n). In stark contrast, under the criterion p2(d) <= 1, there is a randomized lower bound of O(log logn) by Brandt et al. [STOC'16] and a deterministic lower bound of O(logn) by Chang, Kopelowitz and Pettie [FOCS'16]. Brandt, Maus and Uitto conjectured that the same behavior holds for the unrestricted setting where each random variable affects arbitrarily many events. We prove their conjecture, by providing an algorithm that solves the LLL in time O(d(2) + log* n) under the LLL criterion p2(d) < 1, which is tight in bounded-degree graphs due to an Omega(log* n) lower bound by Chung, Pettie and Su [PODC'14]. By the work of Brandt, Maus and Uitto, obtaining such an algorithm can be reduced to proving that all members in a certain family of functions in arbitrarily high dimensions are convex on some specific domain. Unfortunately, an analytical description of these functions is known only for dimension at most 3, which led to the aforementioned restriction of their result. While obtaining those descriptions for functions of (substantially) higher dimension seems out of the reach of current techniques, we show that their convexity can be inferred by combinatorial means.

关键词： Lovasz Local Lemma LOCAL model exponential criterion sharp threshold phenomenon

来源：评论

学校读者我要写书评

暂无评论

distributed Construction of Light Networks 20

Distributed Construction of Light Networks

引用

39th symposium on principles of distributed computing

作者： Elkin, Michael Filtser, Arnold Neiman, Ofer Ben Gurion Univ Negev Beer Sheva Israel Columbia Univ New York NY 10027 USA

ISBN: (纸本)9781450375825

A t -spanner H of a weighted graph G = (V, E, w) is a subgraph that approximates all pairwise distances up to a factor of t. The lightness of H is defined as the ratio between the weight of H to that of the minimum spanning tree. An (alpha, beta)-Shallow Light Tree (SLT) is a tree of lightness beta, that approximates all distances from a designated root vertex up to a factor of alpha. A long line of works resulted in efficient algorithms that produce (nearly) optimal light spanners and SLTs. Some of the most notable algorithmic applications of light spanners and SLTs are in distributed settings. Surprisingly, so far there are no known efficient distributed algorithms for constructing these objects in general graphs. In this paper we devise efficient distributed algorithms in the CONGEST model for constructing light spanners and SLTs, with near optimal parameters. Specifically, for any k >= 1 and 0 < epsilon < 1, we show a (2k - 1) center dot (1 + epsilon)-spanner with lightnessO( k center dot n(1/k)) can be built in (O) over tilde (n 1/2 + 1/4k+2 + D) rounds (where n = |V | and D is the hop-diameter of G). In addition, for any alpha > 1 we provide an (alpha, 1 + O(1)/a-1)-SLT in (root n + D) center dot n(o(1)) rounds. The running times of our algorithms cannot be substantially improved. We also consider spanners for the family of doubling graphs, and devise a (root n + D) center dot n(o(1)) rounds algorithm in the CONGEST model that computes a (1 + epsilon)-spanner with lightness (logn)/epsilon(O(1)). As a stepping stone, which is interesting in its own right, we first develop a distributed algorithm for constructing nets (for arbitrary weighted graphs), generalizing previous algorithms that worked only for unweighted graphs.

关键词： CONGEST Light Spanners Shallow light tree Doubling Dimension

来源：评论

学校读者我要写书评

暂无评论

I/O lower bounds for auto-tuning of convolutions in CNNs 21

I/O lower bounds for auto-tuning of convolutions in CNNs

引用

26th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2021

作者： Zhang, Xiaoyang Xiao, Junmin Tan, Guangming State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Science China

ISBN: (纸本)9781450382946

Convolution is the most time-consuming part in the computation of convolutional neural networks (CNNs), which have achieved great successes in numerous practical applications. Due to the complex data dependency and the increase in the amount of model samples, the convolution suffers from high overhead on data movement (i.e., memory access). This work provides comprehensive analysis and methodologies to minimize the communication for the convolution in CNNs. With an in-depth analysis of the recent I/O complexity theory under the red-blue game model, we develop a general I/O lower bound theory for a composite algorithm which consists of several different sub-computations. Based on the proposed theory, we establish the data movement lower bound results for two main convolution algorithms in CNNs, namely the direct convolution and Winograd algorithm, which represents the direct and indirect implementations of a convolution respectively. Next, derived from I/O lower bound results, we design the near I/O-optimal dataflow strategies for the two main convolution algorithms by fully exploiting the data reuse. Furthermore, in order to push the envelope of performance of the near I/O-optimal dataflow strategies further, an aggressive design of auto-tuning based on I/O lower bounds, is proposed to search an optimal parameter configuration for the direct convolution and Winograd algorithm on GPU, such as the number of threads and the size of shared memory used in each thread block. Finally, experiment evaluation results on the direct convolution and Winograd algorithm show that our dataflow strategies with the auto-tuning approach can achieve about 3.32× performance speedup on average over cuDNN. In addition, compared with TVM, which represents the state-of-the-art technique for auto-tuning, not only our auto-tuning method based on I/O lower bounds can find the optimal parameter configuration faster, but also our solution has higher performance than the optimal solution provided

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

distributed Computation and Reconfiguration in Actively Dynamic Networks 20

Distributed Computation and Reconfiguration in Actively Dyna...

引用

39th symposium on principles of distributed computing

作者： Michail, Othon Skretas, George Spirakis, Paul G. Univ Liverpool Dept Comp Sci Liverpool Merseyside England Univ Patras Comp Engn & Informat Dept Patras Greece

ISBN: (纸本)9781450375825

In this paper, we study systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration in order to carry out a given task. At the same time, the distributed task itself may now require a global reconfiguration from a given initial network G(s). to a target network G(f). from a family of networks having some good properties, like small diameter. To formally capture costs associated with creating and maintaining connections, we define three reasonable edge-complexity measures: the total edge activations, the maximum activated edges per round, and the maximum activated degree of a node. We give (poly)log(n) time algorithms for the general task of transforming any G(s) into a G(f) of diameter (poly)log(n), while minimizing the edge-complexity. There is a natural trade-off between time and edge complexity. Our main lower bound shows that Omega(n) total edge activations and O(n/log n) activations per round must be paid by any algorithm (even centralized) that achieves an optimum of Theta( log n) rounds. On the positive side, we give three distributed algorithms for our general task. The first runs in O( log n) time, with at most 2n active edges per round, a total of O(n log n) edge activations, a maximum degree n - 1, and a target network of diameter 2. The second achieves bounded degree by paying an additional logarithmic factor in time and in total edge activations. It gives a target network of diameter O( log n) and uses O (n) active edges per round. Our third algorithm shows that if we slightly increase the maximum degree to polylog(n) then we can achieve a running time of o (log(2) n). This novel model of distributed computation and reconfiguration in actively dynamic networks and the proposed measures of the edge complexity of distributed algorithms, may open new avenues for research in the algorithmic theory of dynamic networks.

关键词： distributed algorithms dynamic networks reconfiguration transformation polylogarithmic time edge complexity

来源：评论

学校读者我要写书评

暂无评论

Genuinely distributed Byzantine Machine Learning 20

Genuinely Distributed Byzantine Machine Learning

引用

39th symposium on principles of distributed computing

作者： El-Mhamdi, El-Mahdi Guerraoui, Rachid Guirguis, Arsany Le Nguyen Hoang Rouault, Sebastien Ecole Polytech Fed Lausanne Lausanne VD Switzerland

ISBN: (纸本)9781450375825

Machine Learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component failures, which can be all encompassed within the spectrum of a Byzantine behavior. Several approaches have been proposed recently to tolerate Byzantine workers. Yet all require trusting a central parameter server. We initiate in this paper the study of the "general" Byzantineresilient distributed machine learning problem where no individual component is trusted. In particular, we distribute the parameter server computation on several nodes. We show that this problem can be solved in an asynchronous system, despite the presence of 1/3 Byzantine parameter servers and 1/3 Byzantine workers (which is optimal). We present a new algorithm, ByzSGD, which solves the general Byzantine-resilient distributed machine learning problem by relying on three major schemes. The first, Scatter/Gather, is a communication scheme whose goal is to bound the maximum drift among models on correct servers. The second, distributed Median Contraction (DMC), leverages the geometric properties of the median in high dimensional spaces to bring parameters within the correct servers back close to each other, ensuring learning convergence. The third, Minimum-Diameter Averaging (MDA), is a statistically-robust gradient aggregation rule whose goal is to tolerate Byzantine workers. MDA requires loose bound on the variance of non-Byzantine gradient estimates, compared to existing alternatives (e.g., Krum [12]). Interestingly, ByzSGD ensures Byzantine resilience without adding communication rounds (on a normal path), compared to vanilla non-Byzantine alternatives. ByzSGD requires, however, a larger number of messages which, we show, can be reduced if we assume synchrony. We implemented ByzSGD on top of TensorFlow, and we report on our evaluation result

关键词： distributed machine learning Byzantine fault tolerance Byzantine parameter servers

来源：评论

学校读者我要写书评

暂无评论

On distributed Listing of Cliques 20

On Distributed Listing of Cliques

引用

39th symposium on principles of distributed computing

作者： Censor-Hillel, Keren Le Gall, Francois Leitersdorf, Dean Technion Dept Comp Sci Haifa Israel Nagoya Univ Grad Sch Math Nagoya Aichi Japan

ISBN: (纸本)9781450375825

We show an (O) over tilde (n(p/(p+2)))-round algorithm in the CONGEST model for listing of K-p (a clique with p nodes), for all p = 4, p >= 6. For p = 5, we show an (O) over tilde (n(3/4))-round algorithm. For p = 4 and p = 5, our results improve upon the previous state-of-the-art of O(n(5/6+o(1))) and O(n(21/22+o(1))), respectively, by Eden et al. [DISC 2019]. For all p >= 6, ours is the first sub-linear round algorithm for Kp listing. We leverage the recent expander decomposition algorithm of Chang et al. [SODA 2019] to create clusters with a good mixing time. Three key novelties in our algorithm are: (1) we carefully iterate our listing process with coupled values of min-degree within the clusters and arboricity outside the clusters, (2) all the listing is done within the cluster, which necessitates new techniques for bringing into the cluster the information about all edges that can potentially form K-p instances with the cluster edges, and (3) within each cluster we use a sparsity-aware listing algorithm, which is faster than a general listing algorithm and which we can allow the cluster to use since we make sure to sparsify the graph as the iterations proceed. As a byproduct of our algorithm, we show an optimal sparsityaware algorithm for K-p listing, which runs in Theta(1 + m/n(1+2/p)) rounds in the CONGESTED CLIQUE model. Previously, Pandurangan et al. [SPAA 2018], Chang et al. [SODA 2019], and Censor-Hillel et al. [TCS 2020] showed sparsity-aware algorithms for the case of p = 3, yet ours is the first such sparsity aware algorithm for p >= 4.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

computing Shortest Paths and Diameter in the Hybrid Network Model 20

Computing Shortest Paths and Diameter in the Hybrid Network ...

引用

39th symposium on principles of distributed computing

作者： Kuhn, Fabian Schneider, Philipp Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450375825

The HYBRID model, introduced in [Augustine et al., SODA '20], provides a theoretical foundation for networks that allow multiple communication modes. The model follows the principles of synchronous message passing, whereas nodes are allowed to use two fundamentally different communication modes. First, a local mode where nodes may exchange arbitrary information per round over edges of a local communication graph G (akin to the LOCAL model). Second, a global mode where every node may exchange O(log n) messages of size O(log n) bits per round with arbitrary nodes in the network. The HYBRID model intends to reflect the conditions of many real hybrid networks, where high-bandwidth but inherently local communication is combined with highly flexible global communication with restricted bandwidth. We continue to explore the power and limitations of the HYBRID model by investigating the complexity of computing shortest paths and diameter of the local communication graph G. We show that the all pair shortest paths problem can be solved exactly in (O) over tilde(root n) rounds, which improves on the previous (O) over tilde (n(2/3)) round algorithm and closes the gap to the known (Omega) over tilde(root n) lower bound (up to polylog n factors). Furthermore, we give constant approximations for the k-source shortest paths problem (k-SSP) with runtime (O) over tilde(root k), provided that k is sufficiently large. As k-SSP has a lower bound of (Omega) over tilde(root k) even for large approximation ratios, our k-SSP algorithms are almost tight for large enough k. In the case of a single source we give an exact (O) over tilde (n(2/5))-round algorithm, improving on the known (O) over tilde(root D)-round algorithm for graphs with large diameter D. For the diameter problem we provide algorithms with complexities (O) over tilde (n(1/3) /epsilon) and (O) over tilde (n(0.397) /epsilon) and approximation factors (3/2+epsilon) and (1+epsilon), respectively. On the negative side, we demonst

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

The Energy Complexity of BFS in Radio Networks 20

The Energy Complexity of BFS in Radio Networks

引用

39th symposium on principles of distributed computing

作者： Chang, Yi-Jun Dani, Varsha Hayes, Thomas P. Pettie, Seth Swiss Fed Inst Technol Zurich Switzerland Univ New Mexico Albuquerque NM USA Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781450375825

We consider a model of energy complexity in Radio Networks in which transmitting or listening on the channel costs one unit of energy and computation is free. This simplified model captures key aspects of battery-powered sensors: that battery-life is most influenced by transceiver usage, and that at low transmission powers, the actual cost of transmitting and listening are very similar. The energy complexity of tasks in single-hop (clique) networks are well understood [6, 9, 20, 32]. Recent work of Chang et al. [8] considered energy complexity in multi-hop networks and showed that Broadcast admits an energy-efficient protocol, by which we mean each of the n nodes in the network spends O(polylog(n)) energy. This work left open the strange possibility that all natural problems in multi-hop networks might admit such an energyefficient solution. In this paper we prove that the landscape of energy complexity is rich enough to support a multitude of problem complexities. Whereas Broadcast can be solved by an energy-efficient protocol, exact computation of Diameter cannot, requiring Omega(n) energy. Our main result is that BreadthFirstSearch has sub-polynomial energy complexity at most 2(O)((root log n log log n)) = n(o(1));whether it admits an efficient O(polylog(n))-energy protocol is an open problem. Our main algorithm involves recursively solving a generalized BFS problem on a "cluster graph" introduced by Miller, Peng, and Xu [31]. In this application, we make crucial use of a close relationship between distances in this cluster graph, and distances in the original network. This relationship is new and may be of independent interest. We also consider the problem of approximating the network Diameter. From our main result, it is immediate that Diameter can be 2-approximated using no(1) energy per node. We observe that, for all epsilon > 0, approximating Diameter to within a (2 - epsilon) factor requires Omega(n) energy per node. However, this lower bound is only due to

关键词： distributed computing graph algorithms energy-aware computing radio networks sensor networks

来源：评论

学校读者我要写书评

暂无评论

Assignments that Blend Ethics and Technology 20

Assignments that Blend Ethics and Technology

引用

51st acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Doore, Stacy A. Fiesler, Casey Kirkpatrick, Michael S. Peck, Evan Sahami, Mehran Bowdwoin Coll Brunswick ME 04011 USA Univ Colorado Boulder CO 80309 USA James Madison Univ Harrisonburg VA 22807 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450367936

With the 2018 revision of the acm Code of Ethics and Professional Conduct, there is a growing interest in how computer science faculty can integrate these principles into the education of future practitioners. This special session illustrates one approach by highlighting assignments that blend ethics and technology. These assignments can be used in a variety of courses, including CS1, CS2, and later courses. Presenters will provide an overview of each assignment and gather feedback from the audience. All materials, including descriptions, starter files, and guidelines for instructors, will be published at https://***/SIGCSE2020.

关键词： acm Code of Ethics computing ethics CS education pedagogy

来源：评论

学校读者我要写书评

暂无评论

Poster: Revisiting linpack algorithm on large-scale CPU-GPU heterogeneous systems 25

Poster: Revisiting linpack algorithm on large-scale CPU-GPU ...

引用

25th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2020

作者： Shui, Chaoyang Yu, Xianzhi Yan, Yujin Wang, Yinshan Meng, Ke Tan, Guangming State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

ISBN: (纸本)9781450368186

As the widening gap between GPU computing capability and other components (CPU, PCIe bus and communication network), it’s increasingly challenging to design high performance parallel algorithms for large CPU-GPU heterogeneous systems. There are mainly two reasons. Firstly, simply offloading the kernel library to GPU incurs large volume data transfer through low-speed PCIe bus. Secondly, communication overheads through network severely affects scalability. To solve the above issues, we advocate a paradigm shift to GPU-centric and fine-grained pipelining algorithm design. By taking Linpack benchmark as a case study, the new algorithm design paradigm shows its effectiveness. Our optimized Linpack program achieves 63.79PFlops on 16384 GPUs. Its floating-point efficiency outperforms the NVIDIA proprietary counterparts by 5% on average. © 2020 Copyright held by the owner/author(s).

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：