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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

182 篇 会议
11 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

156 篇 工学
- 153 篇 计算机科学与技术...
- 80 篇 软件工程
- 26 篇 信息与通信工程
- 11 篇 控制科学与工程
- 10 篇 电气工程
- 6 篇 网络空间安全
- 3 篇 仪器科学与技术
- 3 篇 电子科学与技术（可...
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
62 篇 理学
- 58 篇 数学
- 23 篇 统计学（可授理学、...
- 6 篇 物理学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 生物学
22 篇 管理学
- 16 篇 管理科学与工程(可...
- 9 篇 工商管理
- 6 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
2 篇 农学
- 2 篇 作物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...

主题

62 篇 distributed comp...
13 篇 distributed comp...
12 篇 distributed algo...
6 篇 approximation al...
6 篇 self-stabilizati...
5 篇 computer systems...
5 篇 consensus
4 篇 distributed algo...
4 篇 fault tolerance
4 篇 algorithms
4 篇 multi-commodity ...
4 篇 distributed syst...
3 篇 statelessness
3 篇 data structures
3 篇 computer network...
3 篇 randomized algor...
2 篇 computer science
2 篇 random walk
2 篇 spanner
2 篇 message passing

机构

3 篇 ben gurion univ ...
3 篇 irisa campus bea...
3 篇 johns hopkins un...
2 篇 yale university ...
2 篇 irisa rennes ced...
2 篇 technion
2 篇 ibm tj watson re...
2 篇 technion haifa
2 篇 university of fr...
2 篇 eth zurich
2 篇 national univers...
2 篇 mitre corporatio...
2 篇 johns hopkins un...
2 篇 boston college
1 篇 georgia institut...
1 篇 mpi informat d-6...
1 篇 hamad bin khalif...
1 篇 university of ot...
1 篇 dept. of electri...
1 篇 massachusetts in...

作者

9 篇 awerbuch baruch
6 篇 raynal michel
6 篇 khandekar rohit
5 篇 kutten shay
4 篇 kuhn fabian
4 篇 rajsbaum sergio
4 篇 gafni eli
4 篇 dolev danny
4 篇 censor-hillel ke...
3 篇 peleg david
3 篇 lenzen christoph
3 篇 korman amos
3 篇 fabian kuhn
3 篇 patt-shamir boaz
3 篇 elkin michael
3 篇 golab wojciech
3 篇 herlihy maurice
3 篇 guerraoui rachid
2 篇 bar-noy amotz
2 篇 ghaffari mohsen

语言

191 篇 英文
2 篇 其他

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

共 193 条记录，以下是31-40 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Parameterized model checking of fault-tolerant distributed algorithms by abstraction

Brief announcement: Parameterized model checking of fault-to...

引用

2013 ACM symposium on principles of distributed computing, PODC 2013

作者： John, Annu Konnov, Igor Schmid, Ulrich Veith, Helmut Widder, Josef TU Wien Austria

ISBN: (纸本)9781450320658

We introduce an automated method for parameterized verification of fault-tolerant distributed algorithms. It rests on a novel parametric interval abstraction (PIA) technique, which works for systems with multiple parameters, for instance, where n and t are parameters describing the system size and the bound on the number of faulty processes, respectively. The PIA technique allows to map typical threshold-range intervals like [1,t + 1) and [t + 1,n - t) to values from a finite abstract domain. Applying PIA to both the local states of the processes and the global system state, the parameterized verification problem can be reduced to finite-state model checking. We demonstrate the practical feasibility of our method by verifying several variants of the well-known consistent broadcasting algorithm by Srikanth and Toueg for different fault models. To the best of our knowledge, this is the first successful automated parameterized verification of a Byzantine fault-tolerant distributed algorithm for message-passing systems. [7]. Supported by the Austrian National Research Network S11403 and S11405 (RiSE) of the Austrian Science Fund (FWF), and by the Vienna Science and Technology Fund (WWTF) grant PROSEED, ICT12-059, and VRG11-005.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed source detection with limited bandwidth 13

Efficient distributed source detection with limited bandwidt...

引用

2013 ACM symposium on principles of distributed computing, PODC 2013

作者： Lenzen, Christoph Peleg, David Massachusetts Institute of Technology 32 Vassar Street Cambridge 02139 United States Dept. of Computer Science and Applied Math. Weizmann Institute of Science 76100 Rehovot Israel

ISBN: (纸本)9781450320658

Given a simple graph G = (V, E) and a set of sources SCV, denote for each node v Ε V by L(∞) the lexicographically ordered list of distance/source pairs (d(s, v), s), where s Ε S. For integers d, k Ε NU{∞}, we consider the source detection, or (S, d, k)-detection task, requiring each node v to learn the first k entries of L(∞) (if for all of them d(s, v) ≤ d) or all entries (d(s, v),s) Ε L (∞), satisfying that d(s, v) ≤ d (otherwise). Solutions to this problem provide natural generalizations of concurrent breadth-first search (BFS) tree constructions. For example, the special case of k = ∞ requires each source s Ε S to build a complete BFS tree rooted at s, whereas the special case of d = ∞ and S = V requires constructing a partial BFS tree comprising at least k nodes from every node in V. In this work, we give a simple, near-optimal solution for the source detection task in the CONGEST model, where messages contain at most C(logn) bits, running in d + k rounds. We demonstrate its utility for various routing problems, exact and approximate diameter computation, and spanner construction. For those problems, we obtain algorithms in the CONGEST model that are faster and in some cases much simpler than previous solutions. Copyright 2013 ACM.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Deterministic self-stabilizing leader election with O(loglog n)-bits

Brief announcement: Deterministic self-stabilizing leader el...

引用

2013 ACM symposium on principles of distributed computing, PODC 2013

作者： Blin, Lélia Tixeuil, Sébastien Université d'Evry Val d'Essonne LIP6-CNRS UMR 7606 France UPMC Sorbonne Universités LIP6-CNRS UMR 7606 Institut Universitaire de France France

ISBN: (纸本)9781450320658

This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. Self-stabilization is a versatile approach to withstand any kind of transient failures. Leader election is a fundamental building block in distributed computing, enabling to distinguish a unique node, in order to, e.g., execute particular actions. When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of ω(log n) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(log log n) memory bits per node, and stabilizes in O(nlog 2 n) time. Our protocol has several attractive features that make it suitable for practical purposes. first, the communication model matches the one that is expected by existing compilers for real networks. Second, the size of the ring (or any upper bound for this size) needs not to be known by any node. Third, the node identifiers can be of various sizes. Finally, no synchrony assumption besides a weak fair scheduler is assumed. Therefore, our result shows that, perhaps surprisingly, trading silence for exponential improvement in term of memory space does not come at a high cost regarding stabilization time, neither it does regarding minimal assumptions about the framework for our algorithm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for barrier coverage using relocatable sensors 13

Distributed algorithms for barrier coverage using relocatabl...

引用

2013 ACM symposium on principles of distributed computing, PODC 2013

作者： Eftekhari, Mohsen Kranakis, Evangelos Krizanc, Danny Morales-Ponce, Oscar Narayanan, Lata Opatrny, Jaroslav Dept. Comp. Sci. and Soft. Eng. Concordia University Montreal Canada School of Comp. Sci. Carleton University Ottawa Canada Dept. of Math. and Comp. Sci. Wesleyan University Middletown United States Dept. of Comp. Science Chalmers U. of Tech. Gothenburg Sweden

ISBN: (纸本)9781450320658

We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the barrier and can move along the barrier. The goal is to find final positions for sensors so that the entire barrier is covered. In recent years, the problem has been studied extensively in the centralized setting. In this paper, we study the problem in the distributed setting. We assume each sensor repeatedly executes a Look-Compute-Move cycle: based on what it sees in its vicinity, it makes a decision on where to move, and moves to its next position. We make two strong but realistic restrictions on the capabilities of sensors: they have a constant visibility rang e and can move only a constant distance in every cycle. In this model, we give the first two distributed algorithms that achieve barrier coverage for a line segment barrier when there are enough nodes in the network to cover the entire barrier. Our algorithms are synchronous, and local in the sense that sensors make their decisions independently based only on what they see within their constant visibility range. One of our algorithms is oblivious whereas the other uses two bits of memory at each sensor to store the type of move made in the previous step. We show that our oblivious algorithm terminates within θ(n2) steps with the barrier fully covered, while the constant-memory algorithm is shown to take θ(n) steps to terminate in the worst case. Since any algorithm that can only move a constant distance in one step requires ω(n) steps on some inputs, our second algorithm is asymptotically optimal. Finally, both our algorithms are self-stabilizing, and can be easily extended to the case of non-homogeneous sensors, and for the case when the barrier is a circle. Copyright 2013 ACM.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Programming models for extreme-scale computing 13

Programming models for extreme-scale computing

引用

proceedings of the 2013 ACM symposium on principles of distributed computing

作者： Marc Snir Argonne National Laboratory Argonne IL USA

ISBN: (纸本)9781450320658

The first version of the MPI standard was released in November 1993. At the time, many of the authors of this standard, myself included, viewed MPI as a temporary solution, to be used until it is replaced by a good programming language for distributed memory systems. Almost twenty years later, MPI is the main programming model for High-Performance computing, and practically all HPC applications use MPI, which is now in its third generation; nobody expects MPI to disappear in the coming decade. The talk will discuss some plausible reasons for this situation, and the implications for research on new programming models for Extreme-Scale computing.

关键词： high-performance computing extreme-scale computing parallel programming

来源：评论

学校读者我要写书评

暂无评论

distributed maximal matching: Greedy is optimal 12

Distributed maximal matching: Greedy is optimal

引用

2012 ACM symposium on principles of distributed computing, PODC'12

作者： Hirvonen, Juho Suomela, Jukka Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki P.O. Box 68 FI-00014 Helsinki Finland

ISBN: (纸本)9781450314503

We study distributed algorithms that find a maximal matching in an anonymous, edge-coloured graph. If the edges are properly coloured with k colours, there is a trivial greedy algorithm that finds a maximal matching in k-1 synchronous communication rounds. The present work shows that the greedy algorithm is optimal in the general case: if A is a deterministic distributed algorithm that finds a maximal matching in anonymous, k-edge-coloured graphs, then there is a worst-case input in which the running time of A is at least k1 rounds. If we focus on graphs of maximum degree Δ, it is known that a maximal matching can be found in O(Δ+ log*k) rounds, and prior work implies a lower bound of Ω(polylog(Δ) + log*k) rounds. Our work closes the gap between upper and lower bounds: the complexity is Θ(Δ+ log*k) rounds. To our knowledge, this is the first linear-in-Δ lower bound for the distributed complexity of a classical graph problem. © 2012 ACM.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

distributed selfish load balancing with weights and speeds 12

Distributed selfish load balancing with weights and speeds

引用

2012 ACM symposium on principles of distributed computing, PODC'12

作者： Adolphs, Clemens P.J. Berenbrink, Petra University of British Columbia 6224 Agricultural Road Vancouver BC V6T 1Z1 Canada Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9781450314503

In this paper we consider neighborhood load balancing in the context of selfish clients. We assume that a network of n processors is given, with m tasks assigned to the processors. The processors may have different speeds and the tasks may have different weights. Every task is controlled by a selfish user. The objective of the user is to allocate his/her task to a processor with minimum load, where the load of a processor is defined as the weight of its tasks divided by its speed. We investigate a concurrent probabilistic protocol which works in sequential rounds. In each round every task is allowed to query the load of one randomly chosen neighboring processor. If that load is smaller than the load of the task's current processor, the task will migrate to that processor with a suitably chosen probability. Using techniques from spectral graph theory we obtain upper bounds on the expected convergence time towards approximate and exact Nash equilibria that are significantly better than previous results for this protocol. We show results for uniform tasks on non-uniform processors and the general case where the tasks have different weights and the machines have speeds. To the best of our knowledge, these are the first results for this general setting. © 2012 ACM.

关键词： Speed

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：