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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是461-470 订阅

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

详细简洁

排序：

Born and Raised Distributively: Fully distributed Non-Interactive Adaptively-Secure Threshold Signatures with Short Shares 14

Born and Raised Distributively: Fully Distributed Non-Intera...

引用

acm symposium on principles of distributed computing (PODC)

作者： Libert, Benoit Joye, Marc Yung, Moti ENS Lyon LIP Lyon France Technicolor Palo Alto CA USA Google Inc New York NY USA Columbia Univ New York NY USA Technicolor Paris France

ISBN: (纸本)9781450329446

Threshold cryptography is a fundamental distributed computational paradigm for enhancing the availability and the security of cryptographic public-key schemes. It does it by dividing private keys into n shares handed out to distinct servers. In threshold signature schemes, a set of at least t + 1 <= n servers is needed to produce a valid digital signature. Availability is assured by the fact that any subset of t + 1 servers can produce a signature when authorized. At the same time, the scheme should remain robust (in the fault tolerance sense) and unforgeable (cryptographically) against up to t corrupted servers;i.e., it adds quorum control to traditional cryptographic services and introduces redundancy. Originally, most practical threshold signatures have a number of demerits: They have been analyzed in a static corruption model (where the set of corrupted servers is fixed at the very beginning of the attack), they require interaction, they assume a trusted dealer in the key generation phase (so that the system is not fully distributed), or they suffer from certain overheads in terms of storage (large share sizes). In this paper, we construct practical fully distributed (the private key is born distributed), non-interactive schemes -where the servers can compute their partial signatures without communication with other servers- with adaptive security (i.e., the adversary corrupts servers dynamically based on its full view of the history of the system). Our schemes are very efficient in terms of computation, communication, and scalable storage (with private key shares of size O(1), where certain solutions incur O(n) storage costs at each server). Unlike other adaptively secure schemes, our schemes are erasure-free (reliable erasure is a hard to assure and hard to administer property in actual systems). To the best of our knowledge, such a fully distributed highly constrained scheme has been an open problem in the area. In particular, and of special interest, is the

关键词： Threshold signature schemes fully distributed systems non-interactivity adaptive security efficiency availability fault tolerance distributed key generation erasure-free schemes

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Game Theoretical Approach for Energy-Delay Balancing in distributed Duty-Cycled MAC Protocols of Wireless Networks 14

Brief Announcement: Game Theoretical Approach for Energy-Del...

引用

acm symposium on principles of distributed computing (PODC)

作者： Doudou, Messaoud Barcelo Ordinas, Jose M. Djenouri, Djamel Garcia Vidal, Jorge Badache, Nadjib CERIST Res Ctr Algiers Algeria Univ Politecn Catalunya UPC Barcelona Spain USTHB Univ Algiers Algeria

ISBN: (纸本)9781450329446

Optimizing energy consumption and end-to-end (e2e) packet delay in energy constrained distributed wireless networks is a conflicting multi-objective optimization problem. This paper investigates this trade-off from a game-theoretic perspective, where the two optimization objectives are considered as virtual game players that attempt to optimize their utility values. The cost model of each player is mapped through a generalized optimization framework onto protocol specific MAC parameters. A cooperative game is then defined, in which the Nash Bargaining solution assures the balance between energy consumption and e2e packet delay. For illustration, this formulation is applied to three state-of-the-art wireless sensor network MAC protocols;X-MAC, DMAC, and LMAC as representatives of preamble sampling, slotted contention-based, and frame-based MAC categories, respectively. The paper shows the effectiveness of such framework in optimizing protocol parameters for achieving a fair energy-delay performance trade-off, under the application requirements in terms of initial energy budget and maximum e2e packet delay. The proposed framework is scalable with the increase in the number of nodes, as the players represent the optimization metrics instead of nodes.

关键词： Wireless Networks Game Theory Duty-Cycling MAC Energy Delay

来源：评论

学校读者我要写书评

暂无评论

distributed Connectivity Decomposition 14

Distributed Connectivity Decomposition

引用

acm symposium on principles of distributed computing (PODC)

作者： Censor-Hillel, Keren Ghaffari, Mohsen Kuhn, Fabian Technion Haifa Israel MIT Cambridge MA 02139 USA Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450329446

A fundamental problem in distributed network algorithms is to manage congestion and obtain information flow matching the graph's connectivity. In this paper, we present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. These decompositions allow us to achieve a flow with size close to the connectivity by parallelizing it along the trees. More specifically, our distributed decomposition algorithms are as follows: (I) A decomposition of each undirected graph with vertexconnectivity k into (fractionally) vertex-disjoint weighted dominating trees with total weight Omega(k/log n), in (O)over tilde(D + root n) rounds in networks, where each node can send a total of at most O(log n) bits per round. (II) A decomposition of each undirected graph with edgeconnectivity. into (fractionally) edge-disjoint weighted spanning trees with total weight inverted right perpendicular lambda-1/2right perpendicular in (O)over tilde(D+root n lambda) rounds, if in each round, each edge can carry at most O(log n) bits of information. We also show round complexity lower bounds of (Omega)over tilde(D+root n/k) and (Omega)over tilde(D+root n/lambda) for the above two decompositions, using techniques of [Das Sarma et al., STOC'11]. Moreover, our vertex-connectivity decomposition extends to centralized algorithms and improves the time complexity of [Censor-Hillel et al., SODA'14] from O(n(3)) to near-optimal (O)over tilde(m). Additional implications of our results are: a near-linear time centralized approximation of vertex connectivity (which can be seen as a step towards a conjecture of Aho, Hopcroft and Ullman), the first distributed approximating of vertex connectivity, and distributed algorithms with near-optimal competitiveness for oblivious broadcast routing.

关键词： Graph Connectivity Decomposition distributed Algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallel and distributed computing Across the Computer Science Curriculum 28

Parallel and Distributed Computing Across the Computer Scien...

引用

28th IEEE International Parallel & distributed Processing symposium Workshops (IPDPSW)

作者： John, David J. Thomas, Stan J. Wake Forest Univ Dept Comp Sci Winston Salem NC 27109 USA

ISBN: (纸本)9781479941162

Two recent curriculum studies, the acm/IEEE Curricula 2013 Report and the NSF/IEEE-TCPP Curriculum Initiative on Parallel and distributed computing, argue that every undergraduate computer science program should include topics in parallel and distributed computing (PDC). Although not within the scope of these reports, there is also a need for students in computing related general education courses to be aware of the role that parallel and distributed computing technologies play in the computing landscape. One approach to integrating these topics into existing curricula is to spread them across several courses. However, this approach requires development of multiple instructional modules targeted to introduce PDC concepts at specific points in the curriculum. Such modules need to mesh with the goals of the courses for which they are designed in such a way that minimal material has to be removed from existing topics. At the same time the modules should provide students with an understanding of and experience employing fundamental PDC concepts. In this paper we report on our experience developing and deploying such modules.

关键词： parallel computing distributed computing computer science education

来源：评论

学校读者我要写书评

暂无评论

Can Quantum Communication Speed Up distributed Computation? 14

Can Quantum Communication Speed Up Distributed Computation?

引用

acm symposium on principles of distributed computing (PODC)

作者： Elkin, Michael Klauck, Hartmut Nanongkai, Danupon Pandurangan, Gopal Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel Nanyang Technol Univ Singapore Singapore Ctr Quantum Technol Singapore Singapore Univ Vienna Fac Comp Sci Vienna Austria Brown Univ Providence RI 02912 USA

ISBN: (纸本)9781450329446

The focus of this paper is on quantum distributed computation, where we investigate whether quantum communication can help in speeding up distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication does not help in substantially speeding up distributed algorithms for these problems compared to the classical setting. In order to obtain this result, we extend the technique of Das Sarma et al. [SICOMP 2012] to obtain a uniform approach to prove non-trivial lower bounds for quantum distributed algorithms for several graph optimization (both exact and approximate versions) as well as verification problems, some of which are new even in the classical setting, e.g. tight randomized lower bounds for Hamiltonian cycle and spanning tree verification, answering an open problem of Das Sarma et al., and a lower bound in terms of the weight aspect ratio, matching the upper bounds of Elkin [STOC 2004]. Our approach introduces the Server model and Quantum Simulation Theorem which together provide a connection between distributed algorithms and communication complexity. The Server model is the standard twoparty communication complexity model augmented with additional power;yet, most of the hardness in the two-party model is carried over to this new model. The Quantum Simulation Theorem carries this hardness further to quantum distributed computing. Our techniques, except the proof of the hardness in the Server model, require very little knowledge in quantum computing, and this can help overcoming a usual impediment in proving bounds on quantum distributed algorithms. In particular, if one can prove a lower bound for distributed algorithms for a certain problem using the technique of Das Sarma et al., it is likely that such lower bound can be extended to the quantum setting using tools provided in this paper and without the need of knowledge in quantum computing.

关键词： distributed computing graph algorithms quantum communication time complexity lower bound CONGEST model

来源：评论

学校读者我要写书评

暂无评论

Beyond Set Disjointness: The Communication Complexity of Finding the Intersection 14

Beyond Set Disjointness: The Communication Complexity of Fin...

引用

acm symposium on principles of distributed computing (PODC)

作者： Brody, Joshua Chakrabarti, Amit Kondapally, Ranganath Woodruff, David P. Yaroslavtsev, Grigory Swarthmore Coll Swarthmore PA 19081 USA Dartmouth Coll Hanover NH 03755 USA IBM Almaden San Jose CA USA Brown Univ ICERM Providence RI 02912 USA

ISBN: (纸本)9781450329446

We consider the following fundamental communication problem - there is data that is distributed among servers, and the servers want to compute the intersection of their data sets, e.g., the common records in a relational database. They want to do this with as little communication and as few messages (rounds) as possible. They are willing to use randomization, and fail with a tiny probability. Given a protocol for computing the intersection, it can also be used to compute the exact Jaccard similarity, the rarity, the number of distinct elements, and joins between databases. computing the intersection is at least as hard as the set disjointness problem, which asks whether the intersection is empty. Formally, in the two-server setting, the players hold subsets S;T subset of [n]. In many realistic scenarios, the sizes of S and T are significantly smaller than n, so we impose the constraint that vertical bar S vertical bar;vertical bar T vertical bar <= k. We study the minimum number of bits the parties need to communicate in order to compute the intersection set S boolean AND T, given a certain number r of messages that are allowed to be exchanged. While O(k log(n=k)) bits is achieved trivially and deterministically with a single message, we ask what is possible with more than one message and with randomization. We give a smooth communication/round tradeoff which shows that with O(log*k) rounds, O (k) bits of communication is possible, which improves upon the trivial protocol by an order of magnitude. This is in contrast to other basic problems such as computing the union or symmetric difference, for which Omega(k log(n=k)) bits of communication is required for any number of rounds. For two players, known lower bounds for the easier problem of set disjointness imply our algorithms are optimal up to constant factors in communication and number of rounds. We extend our protocols to m-player protocols, obtaining an optimal O(mk) bits of communication with a similarly small

关键词： big data communication protocols communication complexity distributed algorithms databases

来源：评论

学校读者我要写书评

暂无评论

Beyond Geometry: Towards Fully Realistic Wireless Models 14

Beyond Geometry: Towards Fully Realistic Wireless Models

引用

acm symposium on principles of distributed computing (PODC)

作者： Bodlaender, Marijke H. L. Halldorsson, Magnus M. Reykjavik Univ Sch Comp Sci ICE TCS Reykjavik Iceland

ISBN: (纸本)9781450329446

Signal-strength models of wireless communications capture the gradual fading of signals and the additivity of interference. As such, they are closer to reality than other models. However, nearly all theoretic work in the SINR model depends on the assumption of smooth geometric decay, one that is true in free space but is far off in actual environments. The challenge is to model realistic environments, including walls, obstacles, reflections and anisotropic antennas, without making the models algorithmically impractical or analytically intractable. We present a simple solution that allows the modeling of arbitrary static situations by moving from geometry to arbitrary decay spaces. The complexity of a setting is captured by a metricity parameter zeta that indicates how far the decay space is from satisfying the triangular inequality. All results that hold in the SINR model in general metrics carry over to decay spaces, with the resulting time complexity and approximation depending on zeta in the same way that the original results depends on the path loss term a. For distributed algorithms, that to date have appeared to necessarily depend on the planarity, we indicate how they can be adapted to arbitrary decay spaces at a cost in time complexity that depends on a fading parameter of the decay space. In particular, for decay spaces that are doubling, the parameter is constant-bounded. Finally, we explore the dependence on zeta in the approximability of core problems. In particular, we observe that the capacity maximization problem has exponential upper and lower bounds in terms of zeta in general decay spaces. In Euclidean metrics and related growth-bounded decay spaces, the performance depends on the exact metricity definition, with a polynomial upper bound in terms of zeta, but an exponential lower bound in terms of a variant parameter phi. The upper bound result is the first approximation of a capacitytype SINR problem that is subexponential in alpha.

关键词： Wireless Networks SINR Capacity distributed Algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Universality Contention-Awareness;Wait-freedom;Object Progress, and Other Properties 14

Brief Announcement: Distributed Universality Contention-Awar...

引用

acm symposium on principles of distributed computing (PODC)

作者： Raynal, Michel Stainer, Julien Taubenfeld, Gadi Univ Rennes Inst Univ France IRISA F-35042 Rennes France Univ Rennes IRISA F-35042 Rennes France Interdisciplinary Ctr IL-46150 Herzliyya Israel

ISBN: (纸本)9781450329446

A notion of a universal construction suited to distributed computing has been introduced by M. Herlihy in his celebrated paper "Wait-free synchronization" (acm TOPLAS, 1991). A universal construction is an algorithm that can be used to wait-free implement any object defined by a sequential specification. Herlihy's paper shows that the basic system model, which supports only atomic read/write registers, has to be enriched with consensus objects to allow the design of universal constructions. The generalized notion of a k-universal construction has been recently introduced by Gafni and Guerraoui (CONCUR, 2011). A k-universal construction is an algorithm that can be used to simultaneously implement k objects (instead of just one object), with the guarantee that at least one of the k constructed objects progresses forever. While Herlihy's universal construction relies on atomic registers and consensus objects, a k-universal construction relies on atomic registers and ksimultaneous consensus objects (which have been shown to be computationally equivalent to k-set agreement objects in the read/write system model where any number of processes may crash). This paper significantly extends the universality results introduced by Herlihy and Gafni-Guerraoui. In particular, we present a k-universal construction which satisfies the following five desired properties, which are not satisfi ed by the previous k-universal construction: (1) among the k objects that are constructed, at least l objects (and not just one) are guaranteed to progress forever;(2) the progress condition for processes is wait-freedom, which means that each correct process executes an infinite number of operations on each object that progresses forever;(3) if one of the k constructed objects stops progressing, it stops in the same state at each process;(4) the proposed construction is contentionaware, which means that it uses only read/write registers in the absence of contention;and (5) it is indulgent with r

关键词： asynchronous read/write system universal construction k-set agreement k-simultaneous consensus wait-freedom non-blocking obstruction-freedom crash failures state machine replication

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Are Lock-Free Concurrent Algorithms Practically Wait-Free? 14

Brief Announcement: Are Lock-Free Concurrent Algorithms Prac...

引用

acm symposium on principles of distributed computing (PODC)

作者： Alistarh, Dan Censor-Hillel, Keren Shavit, Nir Microsoft Res Redmond WA 98052 USA Technion Haifa Israel MIT Cambridge MA 02139 USA Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450329446

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers would prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is in general a complex undertaking, and the resulting algorithms are not always efficient, so most non-blocking commercial code is only lock-free, and the design of efficient wait-free algorithms has been left to the academic community. In [2], we suggest a solution to this problem. We show that, for a large class of lock-free algorithms, under scheduling conditions which approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can keep on designing simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes with the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1, but that in fact a broad subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. To the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst case adversary, in a stochastic model capturing their expected asymptotic behavior.

关键词： distributed computing shared memory wait-free algorithms lock-free algorithms progress properties schedulers

来源：评论

学校读者我要写书评

暂无评论

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication 14

Trade-offs between Selection Complexity and Performance when...

引用

acm symposium on principles of distributed computing (PODC)

作者： Lenzen, Christoph Lynch, Nancy Newport, Calvin Radeva, Tsvetomira MIT 77 Massachusetts Ave Cambridge MA 02139 USA Georgetown Univ Washington DC USA

ISBN: (纸本)9781450329446

We argue that in the context of biology-inspired problems in computer science, in addition to studying the time complexity of solutions it is also important to study the selection complexity, a measure of how likely a given algorithmic strategy is to arise in nature. In this spirit, we propose a selection complexity metric chi for the ANTS problem [Feinerman et al.]. For algorithm A, we define chi(A) = b + log l, where b is the number of memory bits used by each agent and l bounds the fineness of available probabilities (agents use probabilities of at least 1=2(l)). We consider n agents searching for a target in the plane, within an (unknown) distance D from the origin. We identify log logD as a crucial threshold for our selection complexity metric. We prove a new upper bound that achieves near-optimal speed-up of (D-2=n +D) . 2(O(l)) for chi(A) <= 3 log logD + O(1), which is asymptotically optimal if l is an element of O(1). By comparison, previous algorithms achieving similar speed-up require chi(A) = Omega(logD). We show that this threshold is tight by proving that if chi(A) < log logD - omega(1), then with high probability the target is not found if each agent performs D2-o(1) moves. This constitutes a sizable gap to the straightforward Omega(D2=n + D) lower bound.

关键词： distributed algorithms biology-inspired algorithms search algorithms Markov chains mobile agents

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：