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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,075 篇 工学
- 1,034 篇 计算机科学与技术...
- 459 篇 软件工程
- 158 篇 信息与通信工程
- 146 篇 电气工程
- 78 篇 控制科学与工程
- 42 篇 网络空间安全
- 16 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 农业工程
- 6 篇 仪器科学与技术
- 6 篇 建筑学
- 6 篇 生物工程
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
297 篇 理学
- 270 篇 数学
- 70 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 9 篇 化学
- 8 篇 生物学
- 6 篇 大气科学
65 篇 管理学
- 34 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
15 篇 教育学
- 15 篇 教育学
13 篇 经济学
- 13 篇 应用经济学
9 篇 法学
- 7 篇 社会学
8 篇 农学
- 8 篇 作物学
1 篇 医学

主题

249 篇 distributed comp...
96 篇 distributed algo...
77 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 local model
22 篇 algorithms
21 篇 distributed grap...
20 篇 fault tolerance
19 篇 cloud computing
17 篇 shared memory
16 篇 self-stabilizati...
15 篇 message passing
15 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
17 篇 mit cambridge ma...
16 篇 univ freiburg fr...
11 篇 tel aviv univ te...
10 篇 univ michigan an...
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 aalto univ espoo
10 篇 natl univ singap...
9 篇 ben gurion univ ...
8 篇 weizmann inst sc...
8 篇 cispa helmholtz ...
8 篇 national univers...
7 篇 ben gurion univ ...
6 篇 ecole polytech f...
6 篇 cnrs
6 篇 univ texas austi...
5 篇 georgetown univ ...
5 篇 aalto university...

作者

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

语言

1,379 篇 英文
13 篇 其他
1 篇 中文

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

共 1393 条记录，以下是181-190 订阅

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

详细简洁

排序：

Can We Break Symmetry with o(m) Communication? 21

Can We Break Symmetry with <i>o</i>(<i>m</i>) Communication?

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Pai, Shreyas Pandurangan, Gopal Pemmaraju, Sriram, V Robinson, Peter Univ Iowa Iowa City IA 52242 USA Univ Houston Houston TX USA City Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450385480

We study the communication cost (or message complexity) of fundamental distributed symmetry breaking problems, namely, coloring and MIS. While significant progress has been made in understanding and improving the running time of such problems, much less is known about the message complexity of these problems. In fact, all known algorithms need at least Omega(m) communication for these problems, where m is the number of edges in the graph. We address the following question in this paper: can we solve problems such as coloring and MIS using sublinear, i.e., o(m) communication, and if so under what conditions? In a classical result, Awerbuch, Goldreich, Peleg, and Vainish [Jacm 1990] showed that fundamental global problems such as broadcast and spanning tree construction require at least Omega(m) messages in the KT-1 CONGEST model (i.e., CONGEST model in which nodes have initial knowledge of the neighbors' ID's) when algorithms are restricted to be comparison-based (i.e., algorithms in which node ID's can only be compared). Thirty five years after this result, King, Kutten, and Thorup [PODC 2015] showed that one can solve the above problems using (O) over tilde (n) messages (n is the number of nodes in the graph) in (O) over tilde (n) rounds in the KT-1 CONGEST model if non-comparison-based algorithms are permitted. An important implication of this result is that one can use the synchronous nature of the KT-1 CONGEST model, using silence to convey information, and solve any graph problem using non-comparison-based algorithms with (O) over tilde (n) messages, but this takes an exponential number of rounds. In the asynchronous model, even this is not possible. In contrast, much less is known about the message complexity of local symmetry breaking problems such as coloring and MIS. Our paper fills this gap by presenting the following results. Lower bounds: In the KT-1 CONGEST model, we show that any comparison-based algorithm, even a randomized Monte-Carlo algorithm with

关键词： distributed Graph Algorithms Congest Model Message Complexity Symmetry Breaking MIS Coloring

来源：评论

学校读者我要写书评

暂无评论

Diversity, Fairness, and Sustainability in Population Protocols 21

Diversity, Fairness, and Sustainability in Population Protoc...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Kang, Nan Mallmann-Trenn, Frederik Rivera, Nicolas Kings Coll London London England IMDF Santiago Chile Univ Valparaiso Santiago Chile

ISBN: (纸本)9781450385480

Over the years, population protocols with the goal of reaching consensus have been studied in great depth. However, many systems in the real-world do not result in all agents eventually reaching consensus, but rather in the opposite: they converge to a state of rich diversity. Consider for example task allocation in ants. If eventually all ants perform the same task, then the colony will perish (lack of food, no brood care, etc.). Then, it is vital for the survival of the colony to have a diverse set of tasks and enough ants working on each task. What complicates matters is that ants need to switch tasks periodically to adjust the needs of the colony;e.g., when too many foragers fell victim to other ant colonies. A further difficulty is that not all tasks are equally important and maybe they need to keep certain proportions in the distribution of the task. How can ants keep a healthy and balanced allocation of tasks? To answer this question, we propose a simple population protocol for n agents on a complete graph and an arbitrary initial distribution of k colours (tasks). In this protocol we assume that each colour i has an associated weight (importance or value) w(i) >= 1. By denoting w as the sum of the weights of different colours, we show that the protocol converges in O(w(2)n logn) rounds to a configuration where the number of agents supporting each colour i is concentrated on the fair share w(i)n/w and will stay concentrated for a large number of rounds, w.h.p. Our protocol has many interesting properties: agents do not need to know other colours and weights in the system, and our protocol requires very little memory per agent. Furthermore, the protocol guarantees fairness meaning that over a long period each agent has each colour roughly a number of times proportional to the weight of the colour. Finally, our protocol also fulfils sustainability meaning that no colour ever vanishes. All of these properties still hold when an adversary adds agents or colours.

关键词： distributed Systems Population Protocols Self-organisation Randomised Algorithm

来源：评论

学校读者我要写书评

暂无评论

3-Majority and 2-Choices with Many Opinions 25

3-Majority and 2-Choices with Many Opinions

引用

proceedings of the acm symposium on principles of distributed computing

作者： Nobutaka Shimizu Takeharu Shiraga Institute of Science Tokyo Tokyo Japan Chuo University Tokyo Japan

ISBN: (纸本)9798400718854

We present the first nearly-optimal bounds on the consensus time for the well-known synchronous consensus dynamics, specifically 3-Majority and 2-Choices, for an arbitrary number of opinions. In synchronous consensus dynamics, we consider an n-vertex complete graph with self-loops, where each vertex holds an opinion from {1,..., k}. At each discrete-time round, all vertices update their opinions simultaneously according to a given protocol. The goal is to reach a consensus, where all vertices support the same opinion. In 3-Majority, each vertex chooses three random neighbors with replacement and updates its opinion to match the majority, with ties broken randomly. In 2-Choices, each vertex chooses two random neighbors with replacement. If the selected vertices hold the same opinion, the vertex adopts that opinion. Otherwise, it retains its current opinion for that *** upon a line of work [Becchetti et al., SPAA'14], [Becchetti et al., SODA'16], [Berenbrink et al., PODC'17], [Ghaffari and Lengler, PODC'18], we prove that, for every 2 ≤ k ≤ n, 3-Majority (resp. 2-Choices) reaches consensus within [EQUATION] (resp. [EQUATION] rounds with high probability. Prior to this work, the best known upper bound on the consensus time of 3-Majority was Õ(k) if k ≪ n1/3 and Õ(n2/3) otherwise, and for 2-Choices, the consensus time was known to be Õ(k) for [EQUATION].

关键词： distributed voting

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: New distributed Interactive Proofs for Planarity: A Matter of Left and Right 25

Brief Announcement: New Distributed Interactive Proofs for P...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Yuval Gil Merav Parter Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9798400718854

We provide new distributed interactive proofs (DIP) for planarity and related graph families. The notion of a distributed interactive proof (DIP) was introduced by Kol, Oshman, and Saxena (PODC 2018). In this setting, the verifier consists of n nodes connected by a communication graph G. The prover is a single entity that communicates with all nodes by short messages. The goal is to verify that the graph G satisfies a certain property (e.g., planarity) in a small number of rounds, and with a small communication bound, denoted as the proof *** work by Naor, Parter and Yogev (SODA 2020) presented a DIP for planarity that uses three interaction rounds and a proof size of O (log n). Feuilloley et al. (PODC 2020) showed that the same can be achieved with a single interaction round and without randomization, by providing a proof labeling scheme with a proof size of O (log n). In this work, we design new DIPs that use exponentially shorter proofs compared to the state-of-the-art bounds. Our main results are:• There is a 5-round protocol with O (log log n) proof size for outerplanarity.• There is a 5-round protocol with O (log log n) proof size for verifying embedded planarity and O (log log n + log Δ) proof size for general planar graphs, where Δ is the maximum degree in the graph. In the former setting, it is assumed that an embedding of the graph is given (e.g., each node holds a clockwise orientation of its neighbors) and the goal is to verify that it is a valid planar embedding. The latter result should be compared with the non-interactive setting for which there is lower bound of Ω (log n) bits for graphs with Δ = O(1) by Feuilloley et al. (PODC 2020).• The non-interactive deterministic lower bound of Ω (log n) bits by Feuilloley et al. (PODC 2020) can be extended to hold even if the verifier is randomized. Moreover, the lower bound holds even with the assumption that the verifier's randomness comes in the form of an unbounded random string shared among the nod

关键词： distributed interactive proofs

来源：评论

学校读者我要写书评

暂无评论

Online Locality Meets distributed Quantum computing 25

Online Locality Meets Distributed Quantum Computing

引用

proceedings of the 57th Annual acm symposium on Theory of computing

作者： Amirreza Akbari Xavier Coiteux-Roy Francesco d'Amore François Le Gall Henrik Lievonen Darya Melnyk Augusto Modanese Shreyas Pai Marc-Olivier Renou Václav Rozhoň Jukka Suomela Aalto University Espoo Finland University of Calgary Calgary Canada TU Munich Garching Germany MCQST Munich Germany Bocconi University Milan Italy Gran Sasso Science Institute L'Aquila Italy Nagoya University Nagoya Japan TU Berlin Berlin Germany IIT Madras Chennai India Inria - Université Paris-Saclay Palaiseau France Ecole Polytechnique Palaiseau France INSAIT Sofia Bulgaria

ISBN: (纸本)9798400715105

We connect three distinct lines of research that have recently explored extensions of the classical LOCAL model of distributed computing: A. distributed quantum computing and non-signaling distributions [e.g. STOC 2024], B. finitely-dependent processes [e.g. Forum Math. Pi 2016], and C. locality in online graph algorithms and dynamic graph algorithms [e.g. ICALP 2023].We prove new results on the capabilities and limitations of all of these models of computing, for locally checkable labeling problems (LCLs). We show that all these settings can be sandwiched between the classical LOCAL model and what we call the randomized online-LOCAL model. Our work implies limitations on the quantum advantage in the distributed setting, and we also exhibit a new barrier for proving tighter bounds. Our main technical results are these: (1) All LCL problems solvable with locality O(log⋆n) in the classical deterministic LOCAL model admit a finitely-dependent distribution with locality O(1). This answers an open question by Holroyd [2024], and also presents a new barrier for proving bounds on distributed quantum advantage using causality-based arguments. (2) In rooted trees, if we can solve an LCL problem with locality o(logloglogn) in the randomized online-LOCAL model (or any of the weaker models, such as quantum-LOCAL), we can solve it with locality O(log⋆n) in the classical deterministic LOCAL model. One of many implications is that in rooted trees, O(log⋆n) locality in quantum-LOCAL is not stronger than O(log⋆n) locality in classical LOCAL.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Annual acm symposium on principles of distributed computing

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

36th acm symposium on principles of distributed computing, PODC 2017

ISBN: (纸本)9781450349925

The proceedings contain 59 papers. The topics discussed include: exploiting spontaneous transmissions for broadcasting and leader election in radio networks;communication primitives in cognitive radio networks;analyzing contention and backoff in asynchronous shared memory;a layered architecture for erasure-coded consistent distributed storage;seeing is believing: a client-centric specification of database isolation;space complexity of fault-tolerant register emulations;brief announcement: readers of wait-free unbounded registers must write;brief announcement: fast shared counting using (O(n)) compare-and-swap registers;on the multiparty communication complexity of testing triangle-freeness;distributed MST and routing in almost mixing time;brief announcement: optimal address-oblivious epidemic dissemination;a simple deterministic distributed MST algorithm, with near-optimal time and message complexities;distributed approximation of maximum independent set and maximum matching;deterministic distributed (delta + o(delta))-edge-coloring, and vertex-coloring of graphs with bounded diversity;optimal distance labeling schemes for trees;randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model;effectiveness of delaying timestamp computation;ignore or comply? on breaking symmetry in consensus;and greedy routing and the algorithmic small-world phenomenon.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LineFS: Efficient SmartNIC Offload of a distributed File System with Pipeline Parallelism 21

LineFS: Efficient SmartNIC Offload of a Distributed File Sys...

引用

28th acm symposium on Operating Systems principles (SOSP)

作者： Kim, Jongyul Jang, Insu Reda, Waleed Im, Jaeseong Canini, Marco Kostic, Dejan Kwon, Youngjin Peter, Simon Witchel, Emmett Korea Adv Inst Sci & Technol Daejeon South Korea Univ Michigan Ann Arbor MI 48109 USA Univ Catholic Louvain KTH Royal Inst Technol Louvain Belgium KAUST Daejeon South Korea KTH Royal Inst Technol Daejeon South Korea Univ Texas Austin Austin TX 78712 USA Katana Graph Austin TX USA

ISBN: (纸本)9781450387095

In multi-tenant systems, the CPU overhead of distributed file systems (DFSes) is increasingly a burden to application performance. CPU and memory interference cause degraded and unstable application and storage performance, in particular for operation latency. Recent client-local DFSes for persistent memory (PM) accelerate this trend. DFS offload to SmartNICs is a promising solution to these problems, but it is challenging to fit the complex demands of a DFS onto simple SmartNIC processors located across PCIe. We present LineFS, a SmartNIC-offloaded, high-performance DFS with support for client-local PM. To fully leverage the SmartNIC architecture, we decompose DFS operations into execution stages that can be offloaded to a parallel datapath execution pipeline on the SmartNIC. LineFS offloads CPU-intensive DFS tasks, like replication, compression, data publication, index and consistency management to a SmartNIC. We implement LineFS on the Mellanox BlueField SmartNIC and compare it to Assise, a state-of-the-art PM DFS. LineFS improves latency in LevelDB up to 80% and through-put in Filebench up to 79%, while providing extended DFS availability during host system failures.

关键词： distributed file system SmartNIC offload

来源：评论

学校读者我要写书评

暂无评论

An Almost Singularly Optimal Asynchronous distributed MST Algorithm 36

An Almost Singularly Optimal Asynchronous Distributed MST Al...

引用

36th International symposium on distributed computing, DISC 2022

作者： Dufoulon, Fabien Kutten, Shay Moses, William K. Pandurangan, Gopal Peleg, David Department of Computer Science University of Houston HoustonTX United States Faculty of Industrial Engineering and Management Technion - Israel Institute of Technology Haifa Israel Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9783959772556

A singularly (near) optimal distributed algorithm is one that is (near) optimal in two criteria, namely, its time and message complexities. For synchronous CONGEST networks, such algorithms are known for fundamental distributed computing problems such as leader election [Kutten et al., Jacm 2015] and Minimum Spanning Tree (MST) construction [Pandurangan et al., STOC 2017, Elkin, PODC 2017]. However, it is open whether a singularly (near) optimal bound can be obtained for the MST construction problem in general asynchronous CONGEST networks. In this paper, we present a randomized distributed MST algorithm that, with high probability, computes an MST in asynchronous CONGEST networks and takes Õ(D1+Ε + √n) time and Õ(m) messages1, where n is the number of nodes, m the number of edges, D is the diameter of the network, and Ε > 0 is an arbitrarily small constant (both time and message bounds hold with high probability). Since (Equation presented)(D + √n) and Ω(m) are respective time and message lower bounds for distributed MST construction in the standard KT0 model, our algorithm is message optimal (up to a polylog(n) factor) and almost time optimal (except for a DΕ factor). Our result answers an open question raised in Mashregi and King [DISC 2019] by giving the first known asynchronous MST algorithm that has sublinear time (for all D = O(n1-Ε)) and uses Õ(m) messages. Using a result of Mashregi and King [DISC 2019], this also yields the first asynchronous MST algorithm that is sublinear in both time and messages in the KT1 CONGEST model. A key tool in our algorithm is the construction of a low diameter rooted spanning tree in asynchronous CONGEST that has depth Õ(D1+Ε) (for an arbitrarily small constant Ε > 0) in Õ(D1+Ε) time and Õ(m) messages. To the best of our knowledge, this is the first such construction that is almost singularly optimal in the asynchronous setting. This tree construction may be of independent interest as it can also be used for efficiently perfor

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Improved Byzantine Agreement under an Adaptive Adversary 25

Improved Byzantine Agreement under an Adaptive Adversary

引用

proceedings of the acm symposium on principles of distributed computing

作者： Fabien Dufoulon Gopal Pandurangan School of Computing and Communications Lancaster University Lancaster United Kingdom United Kingdom Department of Computer Science University of Houston Houston Texas USA

ISBN: (纸本)9798400718854

Byzantine agreement is a fundamental problem in fault-tolerant distributed computing that has been studied intensively for the last four decades. Much of the research has focused on a static Byzantine adversary, where the adversary is constrained to choose the Byzantine nodes in advance of the protocol's execution. This work focuses on the harder case of an adaptive Byzantine adversary that can choose the Byzantine nodes adaptively based on the protocol's execution. While efficient O(log n)-round protocols (n is the total number of nodes) are known for the static adversary (Ben-Or, Goldwasser, Vaikuntanathan, FOCS 2006) tolerating up to t < n/(3 + ϵ) Byzantine nodes, [EQUATION] rounds is a well-known lower bound for adaptive adversary [Bar-Joseph and Ben-Or, PODC 1998]. The best-known protocol for adaptive adversary runs in O(t/log n) rounds [Chor and Coan, IEEE Trans. Soft. Engg., 1985].This work presents a synchronous randomized Byzantine agreement protocol under an adaptive adversary that improves over previous results. Our protocol works under the powerful adaptive rushing adversary in the full information model. That is, we assume that the Byzantine nodes can behave arbitrarily and maliciously, have knowledge about the entire state of the network at every round, including random choices made by all the nodes up to and including the current round, have unlimited computational power, and may collude among themselves. Furthermore, the adversary can adaptively corrupt up to t < n/3 nodes based on the protocol's execution. We present a simple randomized Byzantine agreement protocol that runs in O(min{t2 log n/n, t/log n}) rounds that improves over the long-standing bound of O(t/log n) rounds due to Chor and Coan [IEEE Trans. Soft. Engg., 1985]. Our bound is significantly better than that of Chor and Coan for t = o(n/log2 n) and approaches the Bar-Joseph and Ben-Or [PODC 1998] lower bound of [EQUATION] rounds when t approaches [EQUATION].

关键词： secure computation

来源：评论

学校读者我要写书评

暂无评论

2022 principles of distributed computing Doctoral Dissertation Award 22

2022 Principles of Distributed Computing Doctoral Dissertati...

引用

proceedings of the 2022 acm symposium on principles of distributed computing

作者： Yehuda Afek Keren Censor-Hillel Pierre Fraigniaud Seth Gilbert Gopal Pandurangan Gadi Taubenfeld Tel-Aviv University Tel-Aviv Israel Technion Haifa Israel CNRS and Université Paris Cité Paris France National University of Singapore Singapore Singapore University of Houston Houston TX USA Reichman University Herzelia Israel

ISBN: (纸本)9781450392624

Many exceptionally high-quality doctoral dissertations were submitted for the 2022 principles of distributed computing Doctoral Dissertation Award. After careful long deliberation, the award committee decided to share the award among two:⋅ Dr. Naama Ben-David for her dissertation ''Theoretical Foundations for Practical Concurrent and distributed Computation.''⋅ Dr. Manuela Fischer for her dissertation ''Local Algorithms for Classic Graph Problems.''

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共140页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：