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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,075 篇 工学
- 1,046 篇 计算机科学与技术...
- 460 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 77 篇 控制科学与工程
- 41 篇 网络空间安全
- 19 篇 电子科学与技术（可...
- 9 篇 农业工程
- 7 篇 建筑学
- 7 篇 化学工程与技术
- 6 篇 机械工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 仪器科学与技术
302 篇 理学
- 274 篇 数学
- 67 篇 统计学（可授理学、...
- 17 篇 物理学
- 11 篇 系统科学
- 9 篇 生物学
- 8 篇 化学
- 4 篇 大气科学
71 篇 管理学
- 39 篇 管理科学与工程(可...
- 33 篇 图书情报与档案管...
- 24 篇 工商管理
12 篇 经济学
- 12 篇 应用经济学
12 篇 教育学
- 12 篇 教育学
9 篇 法学
- 7 篇 社会学
9 篇 农学
- 9 篇 作物学
1 篇 医学

主题

243 篇 distributed comp...
92 篇 distributed algo...
82 篇 distributed comp...
33 篇 distributed algo...
31 篇 consensus
29 篇 distributed syst...
26 篇 cloud computing
25 篇 algorithms
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 fault tolerance
20 篇 local model
20 篇 distributed grap...
19 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 randomized algor...
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
15 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 tel aviv univ te...
10 篇 natl univ singap...
9 篇 ben gurion univ ...
9 篇 technion dept co...
9 篇 aalto univ espoo
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 carnegie mellon ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 cnrs
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...

作者

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

语言

1,381 篇 英文
8 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2013 ACM symposium on Principles of distributed computing"

共 1390 条记录，以下是361-370 订阅

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

详细简洁

排序：

Self-organized Segregation on the Grid 17

Self-organized Segregation on the Grid

引用

36th acm symposium on principles of distributed computing (PODC)

作者： Omidvar, Hamed Franceschetti, Massimo Univ Calif San Diego San Diego CA 92103 USA

ISBN: (纸本)9781450349925

We consider an agent-based model in which two types of agents interact locally over a graph and have a common intolerance threshold tau for changing their types with exponentially distributed waiting times. The model is equivalent to an unperturbed Schelling model of self-organized segregation, an Asynchronous Cellular Automata (ACA) with extended Moore neighborhoods, or a zero-temperature Ising model with Glauber dynamics, and has applications in the analysis of social and biological networks, and spin glasses systems. Some rigorous results were recently obtained in the theoretical computer science literature, and this work provides several extensions. We enlarge the intolerance interval leading to the formation of large segregated regions of agents of a single type from the known size epsilon > 0 to size approximate to 0.134. Namely, we show that for 0.433 < tau < 1/2 (and by symmetry 1/2 < tau < 0.567), the expected size of the largest segregated region containing an arbitrary agent is exponential in the size of the neighborhood. We further extend the interval leading to large segregated regions to size approximate to 0.312 considering "almost segregated" regions, namely regions where the ratio of the number of agents of one type and the number of agents of the other type vanishes quickly as the size of the neighborhood grows. In this case, we show that for 0.344 < tau <= 0.433 (and by symmetry for 0.567 <= tau < 0.656) the expected size of the largest almost segregated region containing an arbitrary agent is exponential in the size of the neighborhood. This behavior is reminiscent of supercritical percolation, where small clusters of empty sites can be observed within any sufficiently large region of the occupied percolation cluster. The exponential bounds that we provide also imply that complete segregation, where agents of a single type cover the whole grid, does not occur with high probability for p = 1/2 and the range of tolerance considered.

关键词： Agent-based Model Asynchronous Cellular Automata Zero-temperature Ising Model Unperturbed Schelling Segregation distributed Algorithm Self-organized Segregation Percolation Theory First Passage Percolation Exponential Segregation

来源：评论

学校读者我要写书评

暂无评论

FruitChains: A Fair Blockchain 17

FruitChains: A Fair Blockchain

引用

36th acm symposium on principles of distributed computing (PODC)

作者： Pass, Rafael Shi, Elaine CornellTech New York NY 10044 USA Cornell Ithaca NY USA

ISBN: (纸本)9781450349925

Nakamoto's famous blockchain protocol enables achieving consensus in a so-called permissionless setting-anyone can join (or leave) the protocol execution, and the protocol instructions do not depend on the identities of the players. His ingenious protocol prevents "sybil attacks" (where an adversary spawns any number of new players) by relying on computational puzzles (a.k.a. "moderately hard functions") introduced by Dwork and Naor (Crypto' 92). Recent work by Garay et al (EuroCrypt' 15) and Pass et al (manuscript, 2016) demonstrate that this protocol provably achieves consistency and liveness assuming a) honest players control a majority of the computational power in the network, b) the puzzle-hardness is appropriately set as a function of the maximum network delay and the total computational power of the network, and c) the computational puzzle is modeled as a random oracle. Assuming honest participation, however, is a strong assumption, especially in a setting where honest players are expected to perform a lot of work (to solve the computational puzzles). In Nakamoto's Bitcoin application of the blockchain protocol, players are incentivized to solve these puzzles by receiving rewards for every "block" (of transactions) they contribute to the blockchain. An elegant work by Eyal and Sirer (FinancialCrypt' 14), strengthening and formalizing an earlier attack discussed on the Bitcoin forum, demonstrates that a coalition controlling even a minority fraction of the computational power in the network can gain (close to) 2 times its "fair share" of the rewards (and transaction fees) by deviating from the protocol instructions. In contrast, in a fair protocol, one would expect that players controlling a phi fraction of the computational resources to reap a phi fraction of the rewards. We present a newblockchain protocol-the FruitChain protocol-which satisfies the same consistency and liveness properties as Nakamoto's protocol (assuming an honest majority of the computing

关键词： distributed consensus blockchains fairness Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Rapid Asynchronous Plurality Consensus 17

Brief Announcement: Rapid Asynchronous Plurality Consensus

引用

36th acm symposium on principles of distributed computing (PODC)

作者： Elsaesser, Robert Friedetzky, Tom Kaaser, Dominik Mallmann-Trenn, Frederik Trinker, Horst Univ Salzburg Salzburg Austria Univ Durham Durham England Univ Hamburg Hamburg Germany Ecole Normale Super Paris France

ISBN: (纸本)9781450349925

We consider distributed plurality consensus on a complete graph of size n with k initial opinions in the following asynchronous communication model. Each node is equipped with a random Poisson clock with parameter lambda = 1. Whenever a node's clock ticks, it samples some neighbors uniformly at random and adjusts its opinion according to the sample. distributed plurality consensus has been deeply studied in the synchronous communication model. A prominent example is the so-called Two-Choices protocol, where in each round, every node chooses two neighbors uniformly at random, and if the two sampled opinions coincide, then that opinion is adopted. This protocol is very efficient when k = 2. If k = O(n(epsilon)) for some small epsilon, we show that it converges to the initial plurality opinion within O(k . logn) rounds, w.h.p., as long as the initial difference between the largest and second largest opinion is Omega(root nlogn). On the negative side, we show that there are cases in which Omega(k) rounds are needed, w.h.p. To beat this lower bound, we combine the Two-Choices protocol with push-pull broadcasting. We divide the process into several phases, where each phase consists of a two-choices round followed by several broadcasting rounds. Our main contribution is a non-trivial adaptation of this approach to the above asynchronous model. If the support of the most frequent opinion is at least (1 + epsilon) times that of the second-most frequent one and k = O(exp(logn/log logn)), then our protocol achieves the best possible run time of O(logn), w.h.p. Key to our adaptation is that we relax full synchronicity by allowing o(n) nodes to be poorly synchronized, and the well synchronized nodes are only required to be within a certain time difference from one another. We enforce this "sufficient" synchronicity by introducing a novel gadget into the protocol. Other parts of the adaptation are made to work using arguments and techniques based on a Polya urn model.

关键词： Plurality Consensus distributed Randomized Algorithms Asynchronicity

来源：评论

学校读者我要写书评

暂无评论

Massively parallel first-principles simulation of electron dynamics in materials 30

Massively parallel first-principles simulation of electron d...

引用

30th IEEE International Parallel and distributed Processing symposium (IPDPS)

作者： Draeger, Erik W. Andrade, Xavier Gunnels, John A. Bhatele, Abhinav Schleife, Andre Correa, Alfredo A. Lawrence Livermore Natl Lab Livermore CA 94551 USA IBM Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Illinois Champaign IL 61801 USA

ISBN: (纸本)9781509021406

We present a highly scalable, parallel implementation of first-principles electron dynamics coupled with molecular dynamics (MD). By using optimized kernels, network topology aware communication, and by fully distributing all terms in the time-dependent Kohn-Sham equation, we demonstrate unprecedented time to solution for disordered aluminum systems of 2000 atoms (22,000 electrons) and 5400 atoms (59,400 electrons), with wall clock time as low as 7.5 s per MD time step. Despite a significant amount of non-local communication required in every iteration, we achieved excellent strong scaling and sustained performance on the Sequoia Blue Gene/Qsupercomputer at LLNL. We obtained up to 59% of the theoretical sustained peak performance on 16,384 nodes and performance of 8.75 Petaflop/s (43% of theoretical peak) on the full 98,304 node machine (1,572,864 cores). Scalable explicit electron dynamics allows for the study of phenomena beyond the reach of standard first-principles MD, in particular, materials subject to strong or rapid perturbations, such as pulsed electromagnetic radiation, particle irradiation, or strong electric currents. Published by Elsevier Inc.

关键词： Electron dynamics TDDFT Explicit time integration Blue Gene/Q

来源：评论

学校读者我要写书评

暂无评论

Ignore or Comply? On Breaking Symmetry in Consensus 17

Ignore or Comply? On Breaking Symmetry in Consensus

引用

36th acm symposium on principles of distributed computing (PODC)

作者： Berenbrink, Petra Clementi, Andrea Elsaesser, Robert Kling, Peter Mallmann-Trenn, Frederik Natale, Emanuele Univ Hamburg Hamburg Germany Univ Roma Tor Vergata Rome Italy Univ Salzburg Salzburg Austria Ecole Normale Super Paris France Max Planck Inst Informat Saarbrucken Germany Simon Fraser Univ Burnaby BC Canada

ISBN: (纸本)9781450349925

We study consensus processes on the complete graph of n nodes. Initially, each node supports one up to n different opinions. Nodes randomly and in parallel sample the opinions of constantly many nodes. Based on these samples, they use an update rule to change their own opinion. The goal is to reach consensus, a configuration where all nodes support the same opinion. We compare two well-known update rules: 2-Choices and 3-Majority. In the former, each node samples two nodes and adopts their opinion if they agree. In the latter, each node samples three nodes: If an opinion is supported by at least two samples the node adopts it, otherwise it randomly adopts one of the sampled opinions. Known results for these update rules focus on initial configurations with a limited number of colors (say n 1/3), or typically assume a bias, where one opinion has a much larger support than any other. For such biased configurations, the time to reach consensus is roughly the same for 2-Choices and 3-Majority. Interestingly, we prove that this is no longer true for configurations with a large number of initial colors. In particular, we show that 3-Majority reaches consensus with high probability in O(n(3/4) . log(7/8) n) rounds, while 2-Choices can need O(n/logn) rounds. We thus get the first unconditional sublinear bound for 3-Majority and the first result separating the consensus time of these processes. Along the way, we develop a framework that allows a fine-grained comparison between consensus processes from a specific class. We believe that this framework might help to classify the performance of more consensus processes.

关键词： distributed Consensus Randomized Protocols Majorization Theory Leader Election

来源：评论

学校读者我要写书评

暂无评论

Interactive distributed Proofs 18

Interactive Distributed Proofs

引用

proceedings of the 2018 acm symposium on principles of distributed computing

作者： Gillat Kol Rotem Oshman Raghuvansh R. Saxena Princeton University Princeton NJ USA Tel-Aviv University Tel-Aviv Israel

ISBN: (纸本)9781450357951

Interactive proof systems allow a resource-bounded verifier to decide an intractable language (or compute a hard function) by communicating with a powerful but untrusted prover. Such systems guarantee that the prover can only convince the verifier of true statements. In the context of centralized computation, a celebrated result shows that interactive proofs are extremely powerful, allowing polynomial-time verifiers to decide any language in PSPACE. In this work we initiate the study of interactive distributed proofs : a network of nodes interacts with a single untrusted prover, who sees the entire network graph, to decide whether the graph satisfies some property. We focus on the communication cost of the protocol --- the number of bits the nodes must exchange with the prover and each other. Our model can also be viewed as a generalization of the various models of "distributed NP'' (proof labeling schemes, etc.) which received significant attention recently: while these models only allow the prover to present each network node with a string of advice, our model allows for back-and-forth interaction. We prove both upper and lower bounds for the new model. We show that for some problems, interaction can exponentially decrease the communication cost compared to a non-interactive prover, but on the other hand, some problems retain non-trivial cost even with interaction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards model driven verifiable deployment of distributed simulations in cloud

Towards model driven verifiable deployment of distributed si...

引用

2017 MODELS Satellite Event: Workshops (ModComp, ME, EXE, COMMitMDE, MRT, MULTI, GEMOC, MoDeVVa, MDETools, FlexMDE, MDEbug), Posters, Doctoral symposium, Educator symposium, acm Student Research Competition, and Tools and Demonstrations, MODEL-SSE 2017

作者： Barve, Yogesh D. Institute for Software Integrated Systems Dept. of EECS Vanderbilt University NashvilleTN37212 United States

Running simulations on cloud computing platforms offers advantages to users such as on-demand computing and scalability. Despite these benefits offered by cloud computing platforms, limitations exists in verifiable and efficient deployment of these simulations in the cloud. Moreover, distributed simulations impose additional requirements of coordinated time stepped execution to progress the simulations. As such, deadline-aware resource allocation for different simulation entities and dynamic execution of load balancing strategies are required to minimize the total execution time. Also, the cloud provider’s interest in minimal execution cost is another requirement which demands workload consolidation for these distributed simulations. In this context, there is a general lack of mechanisms that address these concerns in the cloud hosted distributed simulation space. To address these gaps, this research proposes Model Driven Verifiable distributed Simulations in Cloud (MoViDiX). It provides DSML building blocks for rapid provisioning of distributed simulations in cloud. It also provides a verification subsystem that identifies simulation resource incompatibilities and finds solution for verified deployment of the simulation. Leveraging Models@Runtime principles, dynamic resource management for effective simulations for deadline aware execution is proposed.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Deterministic distributed (Δ + o(Δ))-edge-coloring, and vertex-coloring of graphs with bounded diversity 17

Deterministic distributed (Δ + o(Δ))-edge-coloring, and ve...

引用

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

作者： Beranboim, Leonid Elkin, Michael Maimon, Tzalik Open University of Israel Raananna Israel Ben-Gurion University of the Negev Beer Sheva Israel

ISBN: (纸本)9781450349925

In the distributed message-passing setting a communication network is represented by a graph whose vertices represent processors that perform local computations and communicate over the edges of the graph. In the distributed edge-coloring problem the processors are required to assign colors to edges, such that all edges incident on the same vertex are assigned distinct colors. The previouslyknown deterministic algorithms for edge-coloring employed at least (2Δ - 1) colors, even though any graph admits an edge-coloring with Δ + 1 colors [36]. Moreover, the previously-known deterministic algorithms that employed at most O(Δ) colors required superlogarithmic time [3, 6, 7, 17]. In the current paper we devise deterministic edge-coloring algorithms that employ only Δ + o(Δ) colors, for a very wide family of graphs. Specifically, as long as the arboricity a of the graph is a = O(Δ1-ϵ), for a constant ϵ > 0, our algorithm computes such a coloring within polylogarithmic deterministic time. We also devise significantly improved deterministic edge-coloring algorithms for general graphs for a very wide range of parameters. Specifically, for any value κ in the range [4Δ, 2o(log Δ) · Δ], our κ-edge-coloring algorithm has smaller running time than the best previously-known κ-edge-coloring algorithms. Our algorithms are actually much more general, since edge-coloring is equivalent to vertex-coloring of line graphs. Our method is applicable to vertexcoloring of the family of graphs with bounded diversity that contains line graphs, line graphs of hypergraphs, and many other graphs. We significantly improve upon previous vertex-coloring of such graphs, and as an implication also obtain the improved edge-coloring algorithms for general graphs. Our results are obtained using a novel technique that connects vertices or edges in a certain way that reduces clique size. The resulting structures, which we call connectors, can be colored more efficiently than the original graph. Moreover, th

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Locally-Iterative distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models 18

Locally-Iterative Distributed (Δ+ 1): -Coloring below Szege...

引用

proceedings of the 2018 acm symposium on principles of distributed computing

作者： Leonid Barenboim Michael Elkin Uri Goldenberg Open University of Israel Raanana Israel Ben-Gurion University of the Negev Beer-Sheva Israel

ISBN: (纸本)9781450357951

We consider graph coloring and related problems in the distributed message-passing model. \em Locally-iterative algorithms are especially important in this setting. These are algorithms in which each vertex decides about its next color only as a function of the current colors in its 1 - hop-neighborhood. In STOC'93 Szegedy and Vishwanathan showed that any locally-iterative (Δ + 1)-coloring algorithm requires Ω(Δ log Δ + log^* n) rounds, unless there exists "a very special type of coloring that can be very efficiently reduced" \citeSV93. No such special coloring has been found since then. This led researchers to believe that Szegedy-Vishwanathan barrier is an inherent limitation for locally-iterative algorithms, and to explore other approaches to the coloring problem \citeBE09,K09,B15,FHK16. The latter gave rise to faster algorithms, but their heavy machinery which is of non-locally-iterative nature made them far less suitable to various settings. In this paper we obtain the aforementioned special type of coloring. Specifically, we devise a locally-iterative (Δ + 1)-coloring algorithm with running time O(Δ + log^* n), i.e., \em below Szegedy-Vishwanathan barrier. This demonstrates that this barrier is not an inherent limitation for locally-iterative algorithms. As a result, we also achieve significant improvements for dynamic, self-stabilizing and bandwidth-restricted settings. This includes the following results. \beginitemize ıtem We obtain self-stabilizing distributed algorithms for (Δ + 1)-vertex-coloring, (2Δ - 1)-edge-coloring, maximal independent set and maximal matching with O(Δ + log^* n) time. This significantly improves previously-known results that have O(n) or larger running times \citeGK10. ıtem We devise a (2Δ - 1)-edge-coloring algorithm in the CONGEST model with O(Δ + log^* n) time and O(Δ)-edge-coloring in the Bit-Round model with O(Δ + log n) time. The factors of log^* n and log n are unavoidable in the CONGEST and Bit-Round models, respectively. P

关键词： maximal independent set coloring maximal matching

来源：评论

学校读者我要写书评

暂无评论

Teaching distributed computing with WorkQueue (Abstract Only) 17

Teaching Distributed Computing with WorkQueue (Abstract Only...

引用

proceedings of the 2017 acm SIGCSE Technical symposium on Computer Science Education

作者： Aaron Dingler Peter Bui Seattle Pacific University Seattle WA USA University of Notre Dame Notre Dame IN USA

ISBN: (纸本)9781450346986

With the recent emphasis on Parallel and distributed computing topics in the Computer Science Curricula 2013, instructors are increasingly incorporating these topics into their undergraduate courses. Unfortunately, many universities lack the dedicated computing resources to provide hands-on experiences in this area. This workshop guides attendees through the open source WorkQueue software to teach parallel and distributed computing principles to undergraduate students. WorkQueue is a distributed master worker framework developed by the Cooperative computing Lab at the University of Notre Dame. WorkQueue is well-suited for inclusion in undergraduate courses due to the ease of use and deployment on a wide range of computer systems, low administrative overhead, and scalability. WorkQueue can be deployed on any system, from a small Raspberry Pi cluster to a high-performance grid computing environment. This workshop walks attendees through the use of WorkQueue with three demonstrations: a "live demo" such as would be used to engage students in the classroom with a hands-on introduction to distributed computing principles, and a guided "tour" through two lab assignments. The first lab assignment will give attendees a hands-on example of a simple distributed computing problem from implementation to deployment. The second lab will demonstrate WorkQueue MapReduce, a simple framework that can be used to introduce the MapReduce programming model without the overhead of a Hadoop cluster or equivalent. A laptop is required to participate in the workshop; the presenters will provide a pre-configured Linux VirtualBox virtual machine to facilitate software setup, or attendees can use their own Linux installations.

关键词： parallel computing MapReduce WorkQueue distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：