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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,075 篇 工学
- 1,034 篇 计算机科学与技术...
- 459 篇 软件工程
- 158 篇 信息与通信工程
- 146 篇 电气工程
- 78 篇 控制科学与工程
- 42 篇 网络空间安全
- 16 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 农业工程
- 6 篇 仪器科学与技术
- 6 篇 建筑学
- 6 篇 生物工程
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
297 篇 理学
- 270 篇 数学
- 70 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 9 篇 化学
- 8 篇 生物学
- 6 篇 大气科学
65 篇 管理学
- 34 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
15 篇 教育学
- 15 篇 教育学
13 篇 经济学
- 13 篇 应用经济学
9 篇 法学
- 7 篇 社会学
8 篇 农学
- 8 篇 作物学
1 篇 医学

主题

249 篇 distributed comp...
96 篇 distributed algo...
77 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 local model
22 篇 algorithms
21 篇 distributed grap...
20 篇 fault tolerance
19 篇 cloud computing
17 篇 shared memory
16 篇 self-stabilizati...
15 篇 message passing
15 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
17 篇 mit cambridge ma...
16 篇 univ freiburg fr...
11 篇 tel aviv univ te...
10 篇 univ michigan an...
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 aalto univ espoo
10 篇 natl univ singap...
9 篇 ben gurion univ ...
8 篇 weizmann inst sc...
8 篇 cispa helmholtz ...
8 篇 national univers...
7 篇 ben gurion univ ...
6 篇 ecole polytech f...
6 篇 cnrs
6 篇 univ texas austi...
5 篇 georgetown univ ...
5 篇 aalto university...

作者

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

语言

1,379 篇 英文
13 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"

共 1393 条记录，以下是131-140 订阅

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

详细简洁

排序：

proceedings - Adaptive Resource Management and Scheduling for Cloud computing: 3rd Internatioal Workshop, ARMS-CC 2016, Held in Conjunction with acm symposium on principles of distributed computing, PODC 2016

Proceedings - Adaptive Resource Management and Scheduling fo...

引用

3rd Internatioal Workshop on Adaptive Resource Management and Scheduling for Cloud computing, ARMS-CC 2016

ISBN: (纸本)9781450342278

The proceedings contain 10 papers. The topics discussed include: computation offloading from mobile devices: can edge devices perform better than the cloud?;performance of approximate causal consistency for partially-replicated systems;modeling the scalability of real-time online interactive applications on clouds;the impact on the performance of co-running virtual machines in a virtualized environment;a gossip-based dynamic virtual machine consolidation strategy for large-scale cloud data centers;data management of sensor signals for high bandwidth data streaming to the cloud;cloud elasticity: going beyond demand as user load;and cloud live streaming system based on auto-adaptive overlay for cyber physical infrastructure.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Decision Power of Weak Asynchronous Models of distributed computing 21

Decision Power of Weak Asynchronous Models of Distributed Co...

引用

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

作者： Czerner, Philipp Guttenberg, Roland Helfrich, Martin Esparza, Javier Tech Univ Munich Munich Germany

ISBN: (纸本)9781450385480

Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that cooperate to decide if the underlying graph of the network satisfies a given property. The study classifies models according to four criteria, and shows that twenty-four initially possible combinations collapse into seven equivalence classes with respect to their decision power, i.e. the properties that the automata of each class can decide. However, Esparza and Reiter only show (proper) inclusions between the classes, and so do not characterise their decision power. In this paper we do so for labelling properties, i.e. properties that depend only on the labels of the nodes, but not on the structure of the graph. In particular, majority (whether more nodes carry label a than b) is a labelling property. Our results show that only one of the seven equivalence classes identified by Esparza and Reiter can decide majority for arbitrary networks. We then study the expressive power of the classes on bounded-degree networks, and show that three classes can. In particular, we present an algorithm for majority that works for all bounded-degree networks under adversarial schedulers, i.e. even if the scheduler must only satisfy that every node makes a move infinitely often, and prove that no such algorithm can work for arbitrary networks.

关键词： distributed computing graph automata weak asynchronous models labelling properties communication graphs decision power

来源：评论

学校读者我要写书评

暂无评论

Nearly-Optimal distributed Ruling Sets for Trees and high-girth graphs 25

Nearly-Optimal Distributed Ruling Sets for Trees and high-gi...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Malte Baumecker Yannic Maus Jara Uitto Graz University of Technology Graz Austria Aalto University Helsinki Finland

ISBN: (纸本)9798400718854

Given a graph G = (V, E), a β-ruling set is a subset S ⊆ V that is i) independent, and ii) every node υ ∈ V has a node of S within distance β. In this paper we present almost optimal distributed algorithms for finding ruling sets in trees and high girth graphs in the classic LOCAL model. As our first contribution we present an O(log log n)-round randomized algorithm for computing 2-ruling sets on trees, almost matching the Ω (log log n/log log log n) lower bound given by Balliu et al. [FOCS'20]. Second, we show that 2-ruling sets can be solved in Õ(log5/3 log n) rounds in high-girth graphs. Lastly, we show that O(log log log n)-ruling sets can be computed in Õ(log log n) rounds in high-girth graphs matching the lower bound up to triple-log factors. All of these results either improve polynomially or exponentially on the previously best algorithms and use a smaller domination distance β.

关键词： distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs 21

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

引用

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

作者： Bodwin, Greg Parter, Merav Univ Michigan EECS Ann Arbor MI 48109 USA Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9781450385480

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths. However, the lemma is tiebreaking-sensitive: if one selects a particular canonical shortest path for each node pair, it is no longer guaranteed that one can build replacement paths by concatenating two selected shortest paths. They left as an open problem whether a method of shortest path tiebreaking with this desirable property is generally possible. We settle this question affirmatively with the first general construction of restorable tiebreaking schemes. We then show applications to various problems in fault-tolerant network design. These include a faster algorithm for subset replacement paths, more efficient fault-tolerant (exact) distance labeling schemes, fault-tolerant subset distance preservers and +4 additive spanners with improved sparsity, and fast distributed algorithms that construct these objects. For example, an almost immediate corollary of our restorable tiebreaking scheme is the first nontrivial distributed construction of sparse fault-tolerant distance preservers resilient to three faults.

关键词： shortest path tiebreaking fault tolerance spanners labeling schemes replacement paths distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Security and Privacy for distributed Optimization & distributed Machine Learning 21

Security and Privacy for Distributed Optimization & Distribu...

引用

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

作者： Vaidya, Nitin H. Georgetown Univ Washington DC 20057 USA

ISBN: (纸本)9781450385480

The tutorial will include an introduction to (i) distributed optimization and distributed machine learning, (ii) security or fault-tolerance for distributed optimization and learning, and (iii) privacy in distributed optimization and learning. The presentation will cover the basic principles, and some representative solutions. Server-based and peer-to-peer solutions will be discussed. In particular, Byzantine fault-tolerant algorithms for distributed optimization and learning will be discussed. Privacy mechanisms to be discussed include differential privacy and its variations for systems based on multiple servers.

关键词： distributed optimization and learning Fault-tolerance Secure and privacy-preserving optimization

来源：评论

学校读者我要写书评

暂无评论

Deterministic distributed DFS via Cycle Separators in Planar Graphs 25

Deterministic Distributed DFS via Cycle Separators in Planar...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Benjamin Jauregui Pedro Montealegre Ivan Rapaport Universidad de Chile Santiago Chile Universidad Adolfo Ibáñez Santiago Chile

ISBN: (纸本)9798400718854

One of the most basic techniques in algorithm design consists of breaking a problem into subproblems and then proceeding recursively. In the case of graph algorithms, one way to implement this approach is through separator sets. Given a graph G = (V, E), a subset of nodes S ⊆ V is called a separator set of G if the size of each connected component of G - S is at most 2/3 · |V|. The most useful separator sets are those that satisfy certain restrictions of cardinality or *** this work, we present the first deterministic algorithm in the distributed CONGEST model that recursively computes a cycle separator over planar graphs in Õ(D) rounds. This result, as in the centralized setting, has significant implications in the area of distributed planar algorithms. In fact, from this result, we can construct a deterministic algorithm that computes a DFS tree in Õ(D) rounds. This matches both the best-known randomized algorithm of Ghaffari and Parter (DISC, 2017) and, up to polylogarithmic factors, the trivial lower bound of Ω(D) rounds.

关键词： deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures 36

On Implementing SWMR Registers from SWSR Registers in System...

引用

36th International symposium on distributed computing, DISC 2022

作者： Hu, Xing Toueg, Sam Department of Computer Science University of Toronto Canada

ISBN: (纸本)9783959772556

The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport's pioneering work [14], this problem has been extensively studied in the context of asynchronous processes with crash failures. In this paper, we investigate this problem in the context of Byzantine process failures, with and without process signatures. In particular, we first show a strong impossibility result, namely, that there is no wait-free linearizable implementation of a 1-writer n-reader register from atomic 1-writer (n - 1)-reader registers. In fact, this impossibility result holds even if all the processes except the writer are given atomic 1-writer n-reader registers, and even if we assume that the writer can only crash and at most one reader is subject to Byzantine failures. In light of this impossibility result, we give two register implementations. The first one implements a 1-writer n-reader register from atomic 1-writer 1-reader registers. This implementation is linearizable (under any combination of Byzantine process failures), but it is wait-free only under the assumption that the writer is correct or no reader is Byzantine - thus matching the impossibility result. The second implementation assumes process signatures;it is wait-free and linearizable under any number and combination of Byzantine process failures. © Xing Hu and Sam Toueg.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal distributed Computation of Small Vertex Cuts 36

Near-Optimal Distributed Computation of Small Vertex Cuts

引用

36th International symposium on distributed computing, DISC 2022

作者： Parter, Merav Petruschka, Asaf Weizmann Institute Rehovot Israel

ISBN: (纸本)9783959772556

We present near-optimal algorithms for detecting small vertex cuts in the CONGEST model of distributed computing. Despite extensive research in this area, our understanding of the vertex connectivity of a graph is still incomplete, especially in the distributed setting. To this date, all distributed algorithms for detecting cut vertices suffer from an inherent dependency in the maximum degree of the graph, ∆. Hence, in particular, there is no truly sub-linear time algorithm for this problem, not even for detecting a single cut vertex. We take a new algorithmic approach for vertex connectivity which allows us to bypass the existing ∆ barrier. As a warm-up to our approach, we show a simple Õ(D)-round1 randomized algorithm for computing all cut vertices in a D-diameter n-vertex graph. This improves upon the O(D + ∆/log n)-round algorithm of [Pritchard and Thurimella, ICALP 2008]. Our key technical contribution is an Õ(D)-round randomized algorithm for computing all cut pairs in the graph, improving upon the state-of-the-art O(∆ · D)4-round algorithm by [Parter, DISC'19]. Note that even for the considerably simpler setting of edge cuts, currently Õ(D)-round algorithms are currently known only for detecting pairs of cut edges. Our approach is based on employing the well-known linear graph sketching technique [Ahn, Guha and McGregor, SODA 2012] along with the heavy-light tree decomposition of [Sleator and Tarjan, STOC 1981]. Combining this with a careful characterization of the survivable subgraphs, allows us to determine the connectivity of G \ {x, y} for every pair x, y ∈ V, using Õ(D)-rounds. We believe that the tools provided in this paper are useful for omitting the ∆-dependency even for larger cut values. © Merav Parter and Asaf Petruschka.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The Topology of Randomized Symmetry-Breaking distributed computing 21

The Topology of Randomized Symmetry-Breaking Distributed Com...

引用

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

作者： Fraigniaud, Pierre Gelles, Ran Lotker, Zvi Univ Paris Paris France CNRS Paris France Bar Ilan Univ Ramat Gan Israel

ISBN: (纸本)9781450385480

Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic algorithms. In a nutshell, this approach consists of capturing all the possible states of a distributed system at a certain time as a simplicial complex called protocol complex, and viewing computation as a simplicial map from that complex to the so-called output complex, that captures all possible legal output states of the system. This paper aims at studying randomized synchronous distributed computing through the lens of algebraic topology. We do so by studying the wide class of (input-free) symmetry-breaking tasks, e.g., leader election, in synchronous fault-free anonymous systems. We show that it is possible to redefine solvability of a task "locally", i.e., for each simplex of the protocol complex individually, without requiring any global consistency. However, this approach has a drawback: it eliminates the topological aspect of the computation, since a single facet has a trivial topological structure. To overcome this issue, we introduce a "projection" pi of both protocol and output complexes, where every simplex.. is mapped to a complex pi (sigma);the later has a rich structure that replaces the structure we lost by considering one single facet at a time. To show the significance and applicability of our topological approach, we derive necessary and sufficient conditions for solving leader election in synchronous fault-free anonymous sharedmemory and message-passing models. In both models, we consider scenarios in which there might be correlations between the random values provided to the nodes. In particular, different parties might have access to the same randomness source so their randomness is not independent but equal. Interestingly, we find that solvability of leader election relates to the number of parties that posse

关键词： distributed computing lower bounds algebraic topology correlated randomness leader election

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Temporal Locality in Online Algorithms 36

Brief Announcement: Temporal Locality in Online Algorithms

引用

36th International symposium on distributed computing, DISC 2022

作者： Pacut, Maciej Parham, Mahmoud Rybicki, Joel Schmid, Stefan Suomela, Jukka Tereshchenko, Aleksandr Technische Universität Berlin Germany Faculty of Computer Science Universität Wien Austria Institute of Science and Technology Austria Klosterneuburg Austria TU Berlin Germany Fraunhofer SIT Berlin Germany Aalto University Espoo Finland

ISBN: (纸本)9783959772556

Online algorithms make decisions based on past inputs, with the goal of being competitive against an algorithm that sees also future inputs. In this work, we introduce time-local online algorithms;these are online algorithms in which the output at any given time is a function of only T latest inputs. Our main observation is that time-local online algorithms are closely connected to local distributed graph algorithms: distributed algorithms make decisions based on the local information in the spatial dimension, while time-local online algorithms make decisions based on the local information in the temporal dimension. We formalize this connection, and show how we can directly use the tools developed to study distributed approximability of graph optimization problems to prove upper and lower bounds on the competitive ratio achieved with time-local online algorithms. Moreover, we show how to use computational techniques to synthesize optimal time-local algorithms. © Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共140页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：