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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

740 篇 会议
41 篇 期刊文献

馆藏范围

781 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

607 篇 工学
- 593 篇 计算机科学与技术...
- 344 篇 软件工程
- 93 篇 信息与通信工程
- 67 篇 控制科学与工程
- 64 篇 电气工程
- 40 篇 网络空间安全
- 12 篇 电子科学与技术（可...
- 4 篇 机械工程
- 4 篇 仪器科学与技术
- 4 篇 化学工程与技术
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 3 篇 农业工程
- 2 篇 建筑学
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
234 篇 理学
- 218 篇 数学
- 61 篇 统计学（可授理学、...
- 12 篇 物理学
- 6 篇 系统科学
- 4 篇 化学
- 3 篇 大气科学
- 3 篇 生物学
48 篇 管理学
- 28 篇 管理科学与工程(可...
- 22 篇 图书情报与档案管...
- 18 篇 工商管理
10 篇 经济学
- 10 篇 应用经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

224 篇 distributed comp...
35 篇 distributed algo...
26 篇 distributed comp...
25 篇 computer systems...
17 篇 algorithms
15 篇 consensus
15 篇 distributed syst...
14 篇 fault tolerance
12 篇 distributed algo...
11 篇 computer network...
10 篇 message passing
10 篇 approximation al...
9 篇 self-stabilizati...
9 篇 shared memory
8 篇 cloud computing
8 篇 randomized algor...
6 篇 parallel algorit...
6 篇 computation theo...
6 篇 coloring
6 篇 sensor networks

机构

7 篇 ben gurion univ ...
5 篇 technion
5 篇 department of co...
4 篇 technion haifa
4 篇 college of compu...
4 篇 department of co...
4 篇 eth comp engn & ...
4 篇 yale univ dept c...
3 篇 univ of californ...
3 篇 univ of toronto ...
3 篇 computer enginee...
3 篇 cispa helmholtz ...
3 篇 yale university
3 篇 university of fr...
3 篇 technion israel ...
3 篇 hebrew univ jeru...
3 篇 mit cambridge ma...
3 篇 irisa rennes
3 篇 eth zurich
3 篇 cnrs university ...

作者

13 篇 kuhn fabian
13 篇 awerbuch baruch
13 篇 raynal michel
12 篇 peleg david
12 篇 kutten shay
11 篇 toueg sam
11 篇 patt-shamir boaz
11 篇 wattenhofer roge...
10 篇 guerraoui rachid
10 篇 gafni eli
10 篇 dolev danny
9 篇 elkin michael
9 篇 rajsbaum sergio
9 篇 attiya hagit
8 篇 khandekar rohit
8 篇 pandurangan gopa...
8 篇 aspnes james
8 篇 fraigniaud pierr...
7 篇 korman amos
7 篇 herlihy maurice

语言

774 篇 英文
6 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"

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

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

详细简洁

排序：

On the Pigeonhole and Related principles in Deep Inference and Monotone Systems 14

On the Pigeonhole and Related Principles in Deep Inference a...

引用

Joint Meeting of the 23rd EACSL annual Conference on Computer Science Logic (CSL) / 29th annual acm/IEEE symposium on Logic in Computer Science (LICS)

作者： Das, Anupam INRIA Rocquencourt France Univ Bath Bath Avon England

ISBN: (纸本)9781450328869

We construct quasipolynomial-size proofs of the propositional pigeonhole principle in the deep inference system KS, addressing an open problem raised in previous works and matching the best known upper bound for the more general class of monotone proofs. We make significant use of monotone formulae computing boolean threshold functions, an idea previously considered in works of Atserias et al. The main construction, monotone proofs witnessing the symmetry of such functions, involves an implementation of merge-sort in the design of proofs in order to tame the structural behaviour of atoms, and so the complexity of normalization. Proof transformations from previous work on atomic flows are then employed to yield appropriate KS proofs. As further results we show that our constructions can be applied to provide quasipolynomial-size KS proofs of the parity principle and the generalized pigeonhole principle. These bounds are inherited for the class of monotone proofs, and we are further able to construct n(O(log log n))-size monotone proofs of the weak pigeonhole principle with (1 + epsilon)n pigeons and n holes for epsilon = 1= log(k) n, thereby also improving the best known bounds for monotone proofs.

关键词： Pigeonhole Principle Deep Inference Monotone Proofs Atomic Flows

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: On minimum interaction time for continuous distributed interactive computing

Brief announcement: On minimum interaction time for continuo...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Zhang, Lu Tang, Xueyan He, Bingsheng School of Computer Engineering Nanyang Techonological University Singapore 639798 Singapore

ISBN: (纸本)9781450320658

In this paper, we study the interaction times of continuous distributed interactive computing in which the application states change due to not only user-initiated operations but also time passing. We formulate the Minimum Interaction Time problem as a combinatorial problem of how the clients are assigned to the servers and the simulation time settings of the servers. We also outline two approaches to approximate the problem. Copyright 2013 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Stone age distributed computing 13

Stone age distributed computing

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Emek, Yuval Wattenhofer, Roger Distributed Computing Group ETH Zurich Switzerland

ISBN: (纸本)9781450320658

A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributed computing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently. Copyright 2013 acm.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

PODC 2013 - proceedings of the 2013 acm symposium on principles of distributed computing

PODC 2013 - Proceedings of the 2013 ACM Symposium on Princip...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

ISBN: (纸本)9781450320658

The proceedings contain 54 papers. The topics discussed include: distributed computing theory for wireless networks and mobile systems;pragmatic primitives for non-blocking data structures;the SkipTrie: low-depth concurrent search without rebalancing;optimal deterministic routing and sorting on the congested clique;Byzantine vector consensus in complete graphs;fast Byzantine agreement in dynamic networks;synchronous Byzantine agreement with nearly a cubic number of communication bits;how to meet asynchronously at polynomial cost;on the complexity of universal leader election;on the complexity of universal leader election;on minimum interaction time for continuous distributed interactive computing;scalable anonymous communication with Byzantine adversary;brokerage and closure in a strategic model of social capital;and feedback from nature: an optimal distributed algorithm for maximal independent set selection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Toward more localized local algorithms: removing assumptions concerning global knowledge 11

Toward more localized local algorithms: removing assumptions...

引用

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

作者： Korman, Amos Sereni, Jean-Sebastien Viennot, Laurent CNRS F-75205 Paris 13 France Univ Paris Diderot LIAFA Case 7014 F-75205 Paris 13 France Charles Univ Prague Fac Math & Phys Dept Appl Math KAM Prague Czech Republic INRIA F-75205 Paris 13 France

ISBN: (纸本)9781450307192

Numerous sophisticated local algorithm were suggested in the literature for various fundamental problems. Notable examples are the MIS and -coloring algorithms by Barenboim and Elkin (Distrib Comput 22(5-6):363-379, 2010), by Kuhn (2009), and by Panconesi and Srinivasan (J Algorithms 20(2):356-374, 1996), as well as the -coloring algorithm by Linial (J Comput 21:193, 1992). Unfortunately, most known local algorithms (including, in particular, the aforementioned algorithms) are non-uniform, that is, local algorithms generally use good estimations of one or more global parameters of the network, e.g., the maximum degree or the number of nodes . This paper provides a method for transforming a non-uniform local algorithm into a uniform one. Furthermore, the resulting algorithm enjoys the same asymptotic running time as the original non-uniform algorithm. Our method applies to a wide family of both deterministic and randomized algorithms. Specifically, it applies to almost all state of the art non-uniform algorithms for MIS and Maximal Matching, as well as to many results concerning the coloring problem (In particular, it applies to all aforementioned algorithms). To obtain our transformations we introduce a new distributed tool called pruning algorithms, which we believe may be of independent interest.

关键词： distributed algorithm Global knowledge Parameters MIS Coloring Maximal matching

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Techniques for programmatically troubleshooting distributed systems

Brief announcement: Techniques for programmatically troubles...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Whitlock, Sam Scott, Colin Shenker, Scott 1947 Center St. Berkeley CA 94704 United States University of California Berkeley 387 Soda Hall Berkeley CA 94720-1776 United States ICSI University of California Berkeley 387 Soda Hall Berkeley CA 94720-1776 United States

ISBN: (纸本)9781450320658

The distributed systems research community has developed many provably correct algorithms and abstractions that are in wide use. However, practical implementations of distributed systems often contain many bugs, and practitioners spend much of their time troubleshooting these bugs. In this paper we present an algorithm, retrospective causal inference, to ease the burden of troubleshooting. We end by enumerating several open research problems related to the troubleshooting process. Copyright 2013 acm.

关键词： Inference engines

来源：评论

学校读者我要写书评

暂无评论

Upper bound on the complexity of solving hard renaming 13

Upper bound on the complexity of solving hard renaming

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Attiya, Hagit Castañeda, Armando Herlihy, Maurice Paz, Ami Technion Israel Brown Israel

ISBN: (纸本)9781450320658

The M-renaming task requires n+1 processes, each starting with a unique input name (from an arbitrary large range), to coordinate the choice of new output names from a range of size M. This paper presents the first upper bound on the complexity of hard renaming, i.e., 2n-renaming, when n + 1 is not a prime power. It is known that 2n-renaming can be solved if and only if n+1 is not a prime power;however, the previous proof of the "if" part was non-constructive, involving an approximation theorem;in particular, it did not yield a concrete upper bound on the complexity of the resulting protocol. Copyright 2013 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed deterministic edge coloring using bounded neighborhood independence 11

Distributed deterministic edge coloring using bounded neighb...

引用

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

作者： Barenboim, Leonid Elkin, Michael Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel

ISBN: (纸本)9781450307192

We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known deterministic algorithms for (2 Delta -1)-edge-coloring requires O(Delta) + log* n time (Panconesi and Rizzi in Distrib Comput 14(2):97-100, 2001), where Delta is the maximum degree of the input graph. Also, recent results of Barenboim and Elkin (2010) for vertex-coloring imply that one can get an O(Delta)-edge-coloring in time, and an -edge-coloring in O(log Delta log n) time, for an arbitrarily small constant . In this paper we devise a significantly faster deterministic edge-coloring algorithm. Specifically, our algorithm computes an O(Delta)-edge-coloring in time, and an -edge-coloring in O(log Delta) + log* n time. This result improves the state-of-the-art running time for deterministic edge-coloring with this number of colors in almost the entire range of maximum degree Delta. Moreover, it improves it exponentially in a wide range of Delta, specifically, for 2 (Omega(log*n)) a parts per thousand currency sign Delta a parts per thousand currency sign polylog(n). In addition, for small values of Delta (up to log(1 - delta) n, for some fixed delta > 0) our deterministic algorithm outperforms all the existing randomized algorithms for this problem. Also, our algorithm is the first O(Delta)-edge-coloring algorithm that has running time o(Delta) + log* n, for the entire range of Delta. All previous (deterministic and randomized) O(Delta)-edge-coloring algorithms require time. On our way to these results we study the vertex-coloring problem on graphs with bounded neighborhood independence. This is a large family of graphs, which strictly includes line graphs of r-hypergraphs (i.e., hypergraphs in which each hyperedge contains r or less vertices) for r = O(1), and graphs of bounded growth. We devise a very fast deterministic algorithm for vertex-coloring graphs with bounded neighborhood independe

关键词： Defective-coloring Legal-coloring Line-graphs

来源：评论

学校读者我要写书评

暂无评论

Highly dynamic distributed computing with byzantine failures 13

Highly dynamic distributed computing with byzantine failures

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Guerraoui, Rachid Huc, Florian Kermarrec, Anne-Marie Lab.de Programmation Distribuée EPFL Switzerland INRIA Rennes Bretagne-Atlantique France

ISBN: (纸本)9781450320658

This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two thirds of honest nodes with high probability, within a system whose size can vary polyno-mially with respect to its initial size. Furthermore, the communication cost induced by each node arrival or departure is polylogarithmic with respect to N, the maximal size of the system. Our clustering can be achieved despite the presence of a Byzantine adversary controlling a fraction τ ≤ 1/3 - e of the nodes, for some fixed constant e > 0, independent of N. So far, such a clustering could only be performed for systems whose size can vary constantly and it was not clear whether that was at all possible for polynomial variances. Copyright 2013 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Feedback from nature: An optimal distributed algorithm for maximal independent set selection 13

Feedback from nature: An optimal distributed algorithm for m...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Scott, Alex Jeavons, Peter Xu, Lei Mathematical Institute University of Oxford United Kingdom Dept. of Computer Science University of Oxford United Kingdom

ISBN: (纸本)9781450320658

Maximal Independent Set selection is a fundamental problem in distributed computing. A novel probabilistic algorithm for this problem has recently been proposed by Afek et al, inspired by the study of the way that developing cells in the fly become specialised. The algorithm they propose is simple and robust, but not as efficient as previous approaches: the expected time complexity is O(log2 n). Here we first show that the approach of Afek et al cannot achieve better efficiency than this across all networks, no matter how the global probability values are chosen. However, we then propose a new algorithm that incorporates another important feature of the biological system: the probability value at each node is adapted using local feedback from neighbouring nodes. Our new algorithm retains all the advantages of simplicity and robustness, but also achieves the optimal efficiency of O(log n) expected time. The new algorithm also has only a constant message complexity per node.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：