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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Symmetry Breaking with Noisy Processes 17

Symmetry Breaking with Noisy Processes

引用

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

作者： Gilbert, Seth Newport, Calvin Natl Univ Singapore Singapore Singapore Georgetown Univ Washington DC 20057 USA

ISBN: (纸本)9781450349925

Biology and computer science intersect at the problem of symmetry breaking, which is relevant in both fields. Accordingly, in recent years, distributed algorithm theorists have studied symmetry breaking problems in models inspired by biology to help provide insight into the capabilities and constraints of this natural process. A potential shortcoming of these models, however, is that they execute distributed algorithms precisely as specified. In nature, where computation is often implemented by messy analog systems, this precision cannot necessarily be guaranteed. Motivated by this observation, in this paper we present a general method for injecting "computational noise" into any distributed system model that describes processes as interacting state machines. Our method captures noise as a force that can cause state machines to transition to the wrong state. We combine this formalization of noise with the beeping models that have been a popular target of recent work on bio-inspired symmetry breaking. We produce new upper and lower bounds for both single hop and multihop models-studying leader election in the former and the maximal independent set problem in the latter. These bounds introduce new techniques for achieving robustness to noise, and identify some fundamental limits in this pursuit. We argue that both our general approach and specific results can help advance the productive relationship between biology and algorithm theory.

关键词： noisy computation beeping biological distributed computing leader election MIS

来源：评论

学校读者我要写书评

暂无评论

distributed MST and Routing in Almost Mixing Time 17

Distributed MST and Routing in Almost Mixing Time

引用

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

作者： Ghaffari, Mohsen Kuhn, Fabian Su, Hsin-Hao Swiss Fed Inst Technol Zurich Switzerland Univ Freiburg Freiburg Germany MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450349925

We present a randomized distributed algorithm that computes a minimum spanning tree in tau(mix)(G) . 2(O(root log n log log n))) rounds, in any n-node graph G with mixing time tau(mix)(G). This result provides a sub-polynomial complexity for a wide range of graphs of practical interest, and goes below the celebrated (Omega) over tilde (D + root n) lower bound of Das Sarma et al. [STOC' 11] which holds for some worst-case general graphs. The core novelty in this result is a distributed method for permutation routing. In this problem, one is given a number of source-destination pairs, and we should deliver one packet from each source to its destination, all in parallel, in the shortest span of time possible. Our algorithm allows us to route and deliver all these packets in tau(mix)(G) .2(O(root log n log log n)) rounds, assuming that each node v is the source or destination for at most d(G)(v) packets. The main technical ingredient in this routing result is a certain hierarchical embedding of good-expansion random graphs on the base graph, which we believe can be of interest well beyond this work.

关键词： distributed Graph Algorithms CONGEST Model Routing Minimum Spanning Tree

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Approximation for Tree Augmentation 17

Brief Announcement: Distributed Approximation for Tree Augme...

引用

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

作者： Censor-Hillel, Keren Dory, Michal Technion Dept Comp Sci Haifa Israel

ISBN: (纸本)9781450349925

A minimum spanning tree (MST) is an essential structure for distributed algorithms, since it is a low-cost connected subgraph which provides an efficient way to communicate in a network. However, trees cannot survive even one link failure. In this paper, we study the Tree Augmentation Problem (TAP), for which the input is a graph G and a spanning tree T of G and the goal is to augment T with a minimum (or minimum weight) set of edges Au. from G, such that T. Au. remains connected after a failure of any single link. Being central tasks for network design, TAP and additional connectivity augmentation problems have been well studied in the sequential setting. However, despite the distributed nature of these problems, they have not been studied in the distributed setting. We address this fundamental topic and provide a study of distributed TAP. In the full version of this paper, we present distributed 2-approximation algorithms for TAP, both for the un-weighted and weighted versions, which have a time complexity of O(h) rounds, where h is the height of T. We also present a distributed 4-approximation for unweighted TAP that has a time complexity ofO(root n log* n+D) rounds for a graphG with n vertices and diameter D, which is an improvement for large values of h. We complement our algorithms with lower bounds and some applications to related problems.

关键词： approximation algorithms distributed network design connectivity augmentation

来源：评论

学校读者我要写书评

暂无评论

The Space Requirement of Local Forwarding on Acyclic Networks 17

The Space Requirement of Local Forwarding on Acyclic Network...

引用

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

作者： Patt-Shamir, Boaz Rosenbaum, Will Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450349925

We consider packet forwarding in acyclic networks with bounded adversarial packet injections. We focus on the model of adversarial queuing theory, where each packet is injected into the network with a prescribed path to its destination, and both the long-range average rate and the short-range burst size are bounded. Each edge has an associated buffer that stores packets while they wait to cross the edge. Our goal is to minimize the buffer space required to avoid overflows. Previous results for local forwarding protocols required buffers of size Omega(n). In the case of single destination trees, it is known that for centralized protocols, buffers of sizeO(1) are sufficient. We show that for local protocols, buffers of size Theta(log n) are necessary and sufficient for single destination trees. The upper bound is achieved by a novel protocol which we call Odd-Even Downhill forwarding (OED). We also show that even slightly more general networks-such as path graphs with multiple destinations, or DAGs with a single destination-require buffers of size Omega(n) to avoid overflows, even if forwarding is done by centralized, offline protocols.

关键词： queuing network network algorithms packet forwarding distributed algorithms store and forward odd even downhill buffer size adversarial queuing theory

来源：评论

学校读者我要写书评

暂无评论

Seeing is Believing: A Client-Centric Specification of Database Isolation 17

Seeing is Believing: A Client-Centric Specification of Datab...

引用

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

作者： Crooks, Natacha Pu, Youer Alvisi, Lorenzo Clement, Allen Univ Texas Austin Austin TX 78712 USA Cornell Univ Ithaca NY 14853 USA Google Inc Mountain View CA USA

ISBN: (纸本)9781450349925

This paper introduces the first state-based formalization of isolation guarantees. Our approach is premised on a simple observation: applications view storage systems as black-boxes that transition through a series of states, a subset of which are observed by applications. Defining isolation guarantees in terms of these states frees definitions from implementation-specific assumptions. It makes immediately clear what anomalies, if any, applications can expect to observe, thus bridging the gap that exists today between how isolation guarantees are de fined and how they are perceived. The clarity that results from definitions based on client-observable states brings forth several benefits. First, it allows us to easily compare the guarantees of distinct, but semantically close, isolation guarantees. We find that several well-known guarantees, previously thought to be distinct, are in fact equivalent, and that many previously incomparable flavors of snapshot isolation can be organized in a clean hierarchy. Second, freeing definitions from implementation-specific artefacts can suggest more efficient implementations of the same isolation guarantee. We show how a client-centric implementation of parallel snapshot isolation can be more resilient to slowdown cascades, a common phenomenon in large-scale datacenters.

关键词： consistency database distributed storage transactions cloud storage isolation weak consistency distributed systems concurrency control serializability acid eventual consistency

来源：评论

学校读者我要写书评

暂无评论

Efficient Matrix Sketching over distributed Data 17

Efficient Matrix Sketching over Distributed Data

引用

36th acm SIGMOD-SIGACT-SIGAI symposium on principles of Database Systems (PODS)

作者： Huang, Zengfeng Lin, Xuemin Zhang, Wenjie Zhang, Ying UNSW Sydney NSW Australia UTS Sydney NSW Australia

ISBN: (纸本)9781450341981

A sketch or synopsis of a large dataset captures vital properties of the original data while typically occupying much less space. In this paper, we consider the problem of computing a sketch of a massive data matrix A is an element of R-nxd, which is distributed across a large number of s servers. Our goal is to output a matrix B is an element of R-lxd which is significantly smaller than but still approximates A well in terms of covariance error, i.e., parallel to A(T) A - B-T B parallel to(2). Here, for a matrix A, parallel to A parallel to(2) is the spectral norm of A, which is defined as the largest singular value of A. Following previous works, we call B a covariance sketch of A. We are mainly focused on minimizing the communication cost, which is arguably the most valuable resource in distributed computations. We show a gap between deterministic and randomized communication complexity for computing a covariance sketch. More specifically, we first prove a tight deterministic lower bound, then show how to bypass this lower bound using randomization. In Principle Component Analysis (PCA), the goal is to find a low-dimensional subspace that captures as much of the variance of a dataset as possible. Based on a well-known connection between covariance sketch and PCA, we give a new algorithm for distributed PCA with improved communication cost. Moreover, in our algorithms, each server only needs to make one pass over the data with limited working space.

关键词： Matrix sketching communication complexity distributed data

来源：评论

学校读者我要写书评

暂无评论

Triangle Finding and Listing in CONGEST Networks 17

Triangle Finding and Listing in CONGEST Networks

引用

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

作者： Izumi, Taisuke Le Gall, Francois Nagoya Inst Technol Showa Ku Gokiso Cho Nagoya Aichi 4668555 Japan Kyoto Univ Grad Sch Informat Sakyo Ku Yoshida Honmachi Kyoto 6068501 Japan

ISBN: (纸本)9781450349925

Triangle-free graphs play a central role in graph theory, and triangle detection (or triangle finding) as well as triangle enumeration (triangle listing) play central roles in the field of graph algorithms. In distributed computing, algorithms with sublinear round complexity for triangle finding and listing have recently been developed in the powerful CONGEST clique model, where communication is allowed between any two nodes of the network. In this paper we present the first algorithms with sublinear complexity for triangle finding and triangle listing in the standard CONGEST model, where the communication topology is the same as the topology of the network. More precisely, we give randomized algorithms for triangle finding and listing with round complexity O(n(2/3) (logn) (2/3)) and O(n(3/4) logn), respectively, where n denotes the number of nodes of the network. We also show a lower bound O(n(1/3)/logn) on the round complexity of triangle listing, which also holds for the CONGEST clique model.

关键词： distributed algorithms graph algorithms CONGEST model triangle finding triangle listing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Object Oriented Consensus 17

Brief Announcement: Object Oriented Consensus

引用

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

作者： Afek, Yehuda Aspnes, James Cohen, Edo Vainstein, Danny Tel Aviv Univ Sch Comp Sci Tel Aviv Israel Yale Univ Sch Comp Sci New Haven CT 06520 USA

ISBN: (纸本)9781450349925

We suggest a template that reveals the structure of many consensus algorithms as a generic procedure. The template builds on a new object, vacillate-adopt-commit which is an extension of the well known adopt-commit object. In addition we extend Aspnes's conciliator object to a new object that we call a reconciliator. The consensus algorithm template works in rounds of alternating vacillate-adopt-commit and reconciliator operations. The vacillate-adopt-commit object observes the processors' preferences and suggests a preference output with a measure of confidence (vacillate, adopt or commit) on the preference. The reconciliator ensures termination, by providing new preferences for the processors. We show how several key consensus algorithms exactly fit our template. Here we demonstrate the decomposition of Ben-Or's randomized algorithm. The decomposition of the Phase King Byzantine and the Paxos algorithm are given in the full paper [1]. We analyze and compare our template based on vacillate-adopt-commit and reconciliator objects to previous work [3, 5], suggesting a decomposition of consensus based on adopt-commit and conciliator objects. We claim that the three return values of vacillate-adopt-commit more accurately describe existing algorithms.

关键词： distributed Algorithms Consensus Adopt-Commit

来源：评论

学校读者我要写书评

暂无评论

What Can be Sampled Locally? 17

What Can be Sampled Locally?

引用

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

作者： Feng, Weiming Sun, Yuxin Yin, Yitong Nanjing Univ Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450349925

The local computation of Linial [FOCS' 87] and Naor and Stockmeyer [STOC' 93] concerns with the question of whether a locally definable distributed computing problem can be solved locally: more specifically, for a given local CSP (Constraint Satisfaction Problem) whether a CSP solution can be constructed by a distributed algorithm using local information. In this paper, we consider the problem of sampling a uniform CSP solution by distributed algorithms, and ask whether a locally definable joint distribution can be sampled from locally. More broadly, we consider sampling from Gibbs distributions induced by weighted local CSPs, especially the Markov random fields (MRFs), in the LOCAL model. We give two Markov chain based distributed algorithms which we believe to represent two fundamental approaches for sampling from Gibbs distributions via distributed algorithms. The first algorithm generically parallelizes the single-site sequential Markov chain by updating in each step the variables from a random independent set in parallel, and achieves an O(Delta log n) time upper bound in the LOCAL model, where. is the maximum degree, when the Dobrushin's condition for the Gibbs distribution is satisfied. The second algorithm is a novel parallel Markov chain which proposes to update all variables simultaneously yet still guarantees to converge correctly with no bias. It surprisingly parallelizes an intrinsically sequential process: stabilizing to a joint distribution with massive local dependencies, and may achieve an optimal O(log n) time upper bound independent of the maximum degree Delta under a stronger mixing condition. We also show a strong Omega(diam) lower bound for sampling: in particular for sampling independent set in graphs with maximum degree Delta >= 6. Independent sets are trivial to construct locally and the sampling lower bound holds even when every node is aware of the entire graph. This gives a strong separation between sampling and constructing locally check

关键词： distributed sampling algorithms local computation LOCAL model Gibbs sampling Markov chain Monte Carlo

来源：评论

学校读者我要写书评

暂无评论

A Simple Deterministic distributed MST Algorithm, with Near-Optimal Time and Message Complexities 17

A Simple Deterministic Distributed MST Algorithm, with Near-...

引用

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

作者： Elkin, Michael Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel

ISBN: (纸本)9781450349925

distributed minimum spanning tree (MST) problem is one of the most central and fundamental problems in distributed graph algorithms. Kutten and Peleg [KP98] devised an algorithm with running time O(D + root n . log*n), where D is the hop-diameter of the input n-vertexm-edge graph, and with message complexity O(m + n(3/2)). Peleg and Rubinovich [PR99] showed that the running time of the algorithm of [KP98] is essentially tight, and asked if one can achieve near-optimal running time together with near-optimal message complexity. In a recent breakthrough, Pandurangan et al. [PRS16] answered this question in the affirmative, and devised a randomized algorithm with time (O) over tilde (D + root n) and message complexity (O) over tilde (m). They asked if such a simultaneous time- and message-optimality can be achieved by a deterministic algorithm. In this paper, building upon the work of [PRS16], we answer this question in the affirmative, and devise a deterministic algorithm that computes MST in time O((D + root n) . logn), using O(m . logn + n logn . log*n) messages. The polylogarithmic factors in the time and message complexities of our algorithm are significantly smaller than the respective factors in the result of [PRS16]. Also, our algorithm and its analysis are very simple and self-contained, as opposed to rather complicated previous sublinear-time algorithms [GKP98, KP98, Elk04b, PRS16].

关键词： distributed shortest paths bellman-ford algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：