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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,071 篇 工学
- 1,039 篇 计算机科学与技术...
- 439 篇 软件工程
- 152 篇 信息与通信工程
- 149 篇 电气工程
- 74 篇 控制科学与工程
- 41 篇 网络空间安全
- 17 篇 电子科学与技术（可...
- 7 篇 化学工程与技术
- 6 篇 农业工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 4 篇 交通运输工程
297 篇 理学
- 271 篇 数学
- 68 篇 统计学（可授理学、...
- 17 篇 物理学
- 9 篇 系统科学
- 8 篇 化学
- 7 篇 生物学
60 篇 管理学
- 32 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 19 篇 工商管理
18 篇 教育学
- 18 篇 教育学
10 篇 经济学
- 10 篇 应用经济学
10 篇 法学
- 7 篇 社会学
- 4 篇 法学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

244 篇 distributed comp...
95 篇 distributed algo...
78 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
28 篇 distributed syst...
23 篇 approximation al...
23 篇 computer systems...
23 篇 algorithms
23 篇 congest model
22 篇 local model
21 篇 fault tolerance
21 篇 distributed grap...
19 篇 cloud computing
17 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 graph algorithms
14 篇 fault-tolerance
14 篇 randomized algor...

机构

30 篇 swiss fed inst t...
26 篇 technion haifa
18 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 univ michigan an...
11 篇 tel aviv univ te...
11 篇 aalto univ espoo
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 natl univ singap...
8 篇 weizmann inst sc...
8 篇 ben gurion univ ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 technion
6 篇 ecole polytech f...
6 篇 cnrs
5 篇 georgetown univ ...
5 篇 univ toronto on

作者

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

语言

1,328 篇 英文
26 篇 其他
1 篇 中文

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

共 1355 条记录，以下是161-170 订阅

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

详细简洁

排序：

Brief Announcement: computing Power of Hybrid Models in Synchronous Networks 36

Brief Announcement: Computing Power of Hybrid Models in Sync...

引用

36th International symposium on distributed computing, DISC 2022

作者： Fraigniaud, Pierre Montealegre, Pedro Paredes, Pablo Rapaport, Ivan Ríos-Wilson, Martín Todinca, Ioan IRIF Université Paris Cité CNRS France Faculty of Engineering and Science Universidad Adolfo Ibáñez Santiago Chile Department of Mathematical Engineering University of Chile Santiago Chile DIM-CMM UMI 2807 CNRS University of Chile Santiago Chile LIFO Université d'Orléans France INSA Centre-Val de Loire Bourges France

ISBN: (纸本)9783959772556

During the last two decades, a small set of distributed computing models for networks have emerged, among which LOCAL, CONGEST, and Broadcast Congested Clique (BCC) play a prominent role. We consider hybrid models resulting from combining these three models. That is, we analyze the computing power of models allowing to, say, perform a constant number of rounds of CONGEST, then a constant number of rounds of LOCAL, then a constant number of rounds of BCC, possibly repeating this figure a constant number of times. We specifically focus on 2-round models, and we establish the complete picture of the relative powers of these models. That is, for every pair of such models, we determine whether one is (strictly) stronger than the other, or whether the two models are incomparable. © Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, and Ioan Todinca.

关键词： computing power

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: The Complexity Landscape of Dynamic distributed Subgraph Finding 25

Brief Announcement: The Complexity Landscape of Dynamic Dist...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Yi-Jun Chang Lyuting Chen Yanyu Chen Gopinath Mishra Mingyang Yang National University of Singapore Singapore Singapore

ISBN: (纸本)9798400718854

Bonne and Censor-Hillel (ICALP 2019) initiated the study of distributed subgraph finding in dynamic networks of limited bandwidth. For the case where the target subgraph is a clique, they determined the tight bandwidth complexity bounds in nearly all settings. However, several open questions remain, and very little is known about finding subgraphs beyond cliques. In this work, we consider these questions and explore subgraphs beyond *** finding cliques, we establish an Ω (log log n) bandwidth lower bound for one-round membership-detection under edge insertions only and an Ω (log log log n) bandwidth lower bound for one-round detection under both edge insertions and node insertions. Moreover, we demonstrate new algorithms to show that our lower bounds are tight in bounded-degree networks when the target subgraph is a triangle. Prior to our work, no lower bounds were known for these *** finding subgraphs beyond cliques, we present a complete characterization of the bandwidth complexity of the membership-listing problem for every target subgraph, every number of rounds, and every type of topological change: node insertions, node deletions, edge insertions, and edge deletions. We also show partial characterizations for one-round membership-detection and listing.

关键词： distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Exponential Speedup over Locality in MPC with Optimal Memory 36

Exponential Speedup over Locality in MPC with Optimal Memory

引用

36th International symposium on distributed computing, DISC 2022

作者： Balliu, Alkida Brandt, Sebastian Fischer, Manuela Latypov, Rustam Maus, Yannic Olivetti, Dennis Uitto, Jara Gran Sasso Science Institute L'Aquila Italy CISPA Helmholtz Center for Information Security Saarbrücken Germany ETH Zürich Switzerland Aalto University Espoo Finland TU Graz Austria

ISBN: (纸本)9783959772556

Locally Checkable Labeling (LCL) problems are graph problems in which a solution is correct if it satisfies some given constraints in the local neighborhood of each node. Example problems in this class include maximal matching, maximal independent set, and coloring problems. A successful line of research has been studying the complexities of LCL problems on paths/cycles, trees, and general graphs, providing many interesting results for the LOCAL model of distributed computing. In this work, we initiate the study of LCL problems in the low-space Massively Parallel Computation (MPC) model. In particular, on forests, we provide a method that, given the complexity of an LCL problem in the LOCAL model, automatically provides an exponentially faster algorithm for the low-space MPC setting that uses optimal global memory, that is, truly linear. While restricting to forests may seem to weaken the result, we emphasize that all known (conditional) lower bounds for the MPC setting are obtained by lifting lower bounds obtained in the distributed setting in tree-like networks (either forests or high girth graphs), and hence the problems that we study are challenging already on forests. Moreover, the most important technical feature of our algorithms is that they use optimal global memory, that is, memory linear in the number of edges of the graph. In contrast, most of the state-of-the-art algorithms use more than linear global memory. Further, they typically start with a dense graph, sparsify it, and then solve the problem on the residual graph, exploiting the relative increase in global memory. On forests, this is not possible, because the given graph is already as sparse as it can be, and using optimal memory requires new solutions. © Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility 21

Separating Bounded and Unbounded Asynchrony for Autonomous R...

引用

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

作者： Kirkpatrick, David Kostitsyna, Irina Navarra, Alfredo Prencipe, Giuseppe Santoro, Nicola Univ British Columbia Dept Comp Sci Vancouver BC Canada TU Eindhoven Dept Math & Comp Sci Eindhoven Netherlands Univ Perugia Dept Math & Comp Sci Perugia Italy Univ Dip Informat Pisa Italy Carleton Univ Sch Comp Sci Ottawa ON Canada

ISBN: (纸本)9781450385480

We consider distributed computations, by identical autonomous mobile entities, that solve the Point Convergence problem: given an arbitrary initial configuration of entities, disposed in the Euclidean plane, move in such a way that, for all epsilon > 0, a configuration is eventually reached and maintained in which the separation between all entities is at most epsilon. The problem has been previously studied in a variety of settings. Our study concerns the minimal assumptions under which entities, moving asynchronously with limited and unknown visibility range and subject to limited imprecision in measurements, can be guaranteed to converge in this way. We present an algorithm that solves Point Convergence, provided the degree of asynchrony is bounded by some arbitrarily large but fixed constant. This provides a strong positive answer to a decade old open question posed by Katreniak. We also prove that, in an otherwise comparable setting, Point Convergence is impossible with unbounded asynchrony. This serves to distinguish the power of bounded and unbounded asynchrony in the control of autonomous mobile entities, settling at the same time a long-standing question whether in the Euclidean plane synchronous entities are more powerful than asynchronous ones.

关键词： Mobile robots distributed geometric algorithms Asynchrony

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Quantum Interactive Proofs 36

Brief Announcement: Distributed Quantum Interactive Proofs

引用

36th International symposium on distributed computing, DISC 2022

作者： Le Gall, François Miyamoto, Masayuki Nishimura, Harumichi Graduate School of Mathematics Nagoya University Japan Graduate School of Informatics Nagoya University Japan

ISBN: (纸本)9783959772556

The study of distributed interactive proofs was initiated by Kol, Oshman, and Saxena [PODC 2018] as a generalization of distributed decision mechanisms (proof-labeling schemes, etc.), and has received a lot of attention in recent years. In distributed interactive proofs, the nodes of an n-node network G can exchange short messages (called certificates) with a powerful prover. The goal is to decide if the input (including G itself) belongs to some language, with as few turns of interaction and as few bits exchanged between nodes and the prover as possible. There are several results showing that the size of certificates can be reduced drastically with a constant number of interactions compared to non-interactive distributed proofs. In this brief announcement, we introduce the quantum counterpart of distributed interactive proofs: certificates can now be quantum bits, and the nodes of the network can perform quantum computation. The main result of this paper shows that by using quantum distributed interactive proofs, the number of interactions can be significantly reduced. More precisely, our main result shows that for any constant k, the class of languages that can be decided by a k-turn classical (i.e., non-quantum) distributed interactive protocol with f(n)-bit certificate size is contained in the class of languages that can be decided by a 5-turn distributed quantum interactive protocol with O(f(n))-bit certificate size. We also show that if we allow to use shared randomness, the number of turns can be reduced to 3-turn. Since no similar turn-reduction classical technique is currently known, our result gives evidence of the power of quantum computation in the setting of distributed interactive proofs as well. © François Le Gall, Masayuki Miyamoto, and Harumichi Nishimura.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Byzantine Agreement and Leader Election: From Classical to the Modern 21

Byzantine Agreement and Leader Election: From Classical to t...

引用

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

作者： Augustine, John Molla, Anisur Rahaman Pandurangan, Gopal IIT Madras Dept Comp Sci & Engn Chennai Tamil Nadu India Indian Stat Inst Kolkata Crypto & Secur Res Unit Kolkata W Bengal India Univ Houston Dept Comp Sci Houston TX 77204 USA

ISBN: (纸本)9781450385480

We will present the fundamentals of Byzantine agreement and leader election problems from a modern perspective. Byzantine fault tolerant protocols are at the heart of secure and robust protocols that can tolerate the presence of malicious nodes in a distributed system, such as a Peer-to-Peer (P2P) network, which allows a large number of peers to enter the network with little or no admission control. Such malicious peers acting alone or in collaboration can cause disruption of service in P2P systems. Our tutorial is largely inspired by recent P2P applications like Blockchain and cryptocurrencies that espouse permissionless settings whereby peers can anonymously and dynamically join and leave the network at will. Our presentation will be in three parts. In the first part, we will present the historic foundations of Byzantine agreement and leader election and describe the fundamentals that underlie our modern understanding of these problems. Much of the classical results focus on complete networks where nodes have global knowledge. In the second part, motivated by real-world distributed networks such as P2P networks which are typically sparse and bounded degree with nodes having only local knowledge, we focus on Byzantine protocols for sparse networks. While the first two parts will focus on static settings, motivated by modern applications such as blockchains and cryptocurrencies which operate on dynamic P2P networks, the third part will delve into Byzantine procotols for dynamic networks where nodes continuously join and leave the system. The tutorial will cover various tools and techniques that are useful in designing Byzantine protocols in sparse and dynamic networks and will discuss key open problems in the area.

关键词： Byzantine protocols leader election agreement consensus distributed algorithms blockchain sparse networks P2P networks dynamic networks

来源：评论

学校读者我要写书评

暂无评论

Low-Congestion Shortcuts for Graphs Excluding Dense Minors 21

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

引用

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

作者： Ghaffari, Mohsen Haeupler, Bernhard Swiss Fed Inst Technol Zurich Switzerland Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450385480

We prove that any n-node graph G with diameter D admits shortcuts with congestion O(delta D log n) and dilation O(delta D), where delta is the maximum edge-density of any minor of G. Our proof is simple and constructive with a (Theta) over tilde(delta D)-round(1) distributed construction algorithm. Our results are tight up to logarithmic factors and generalize, simplify, unify, and strengthen several prior results. For example, for graphs excluding a fixed minor, i.e., graphs with constant delta, only (O) over tilde (D-2) bound was known based on a very technical proof that relies on the Robertson-Seymour Graph Structure Theorem. A direct consequence of our result is this: many graph families, including any minor-excluded ones, have near-optimal (Theta) over tilde (D)-round distributed algorithms for many fundamental communication primitives and optimization problems in the standard synchronous message-passing model with logarithmic message sizes, i.e., the CONGEST model. These problems include minimum spanning tree, minimum cut approximation, and shortest-path approximations.

关键词： distributed graph algorithms low-congestion shortcuts minor-exluded graphs planar graphs congestion dilation minimum spanning tree

来源：评论

学校读者我要写书评

暂无评论

Tight Bounds on Channel Reliability via Generalized Quorum Systems 25

Tight Bounds on Channel Reliability via Generalized Quorum S...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Alejandro Naser-Pastoriza Gregory Chockler Alexey Gotsman Fedor Ryabinin IMDEA Software Institute Madrid Spain Universidad Politécnica de Madrid Madrid Spain University of Surrey UK Guildford United Kingdom

ISBN: (纸本)9798400718854

Communication channel failures are a major concern for the developers of modern fault-tolerant systems. However, while tight bounds for process failures are well-established, extending them to include channel failures has remained an open problem. We introduce generalized quorum systems -- a framework that characterizes the necessary and sufficient conditions for implementing atomic registers, atomic snapshots, lattice agreement and consensus under arbitrary patterns of process-channel failures. Generalized quorum systems relax the connectivity constraints of classical quorum systems: instead of requiring bidirectional reachability for every pair of write and read quorums, they only require some write quorum to be unidirectionally reachable from some read quorum. This weak connectivity makes implementing registers particularly challenging, because it precludes the traditional request/response pattern of quorum access, making classical solutions like ABD inapplicable. To address this, we introduce novel logical clocks that allow write and read quorums to reliably track state updates without relying on bidirectional connectivity.

关键词： distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate Byzantine Fault-Tolerance in distributed Optimization 21

Approximate Byzantine Fault-Tolerance in Distributed Optimiz...

引用

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

作者： Liu, Shuo Gupta, Nirupam Vaidya, Nitin H. Georgetown Univ Washington DC 20057 USA Ecole Polytech Fed Lausanne EPFL Lausanne Switzerland

ISBN: (纸本)9781450385480

This paper considers the problem of Byzantine fault-tolerance in distributed multi-agent optimization. In this problem, each agent has a local cost function, and in the fault-free case, the goal is to design a distributed algorithm that allows all the agents to find a minimum point of all the agents' aggregate cost function. We consider a scenario where some agents might be Byzantine faulty that renders the original goal of computing a minimum point of all the agents' aggregate cost vacuous. A more reasonable objective for an algorithm in this scenario is to allow all the non-faulty agents to compute the minimum point of only the non-faulty agents' aggregate cost. Prior work [24] shows that if there are up to f (out of n) Byzantine agents then a minimum point of the non-faulty agents' aggregate cost can be computed exactly if and only if the non-faulty agents' costs satisfy a certain redundancy property called 2f -redundancy. However, 2f-redundancy is an ideal property that can be satisfied only in systems free from noise or uncertainties, which can make the goal of exact fault-tolerance unachievable in some applications. Thus, we introduce the notion of (f, epsilon)-resilience, a generalization of exact fault-tolerance wherein the objective is to find an approximate minimum point of the non-faulty aggregate cost, with c accuracy. This approximate fault-tolerance can be achieved under a weaker condition that is easier to satisfy in practice, compared to 2f-redundancy. We obtain necessary and sufficient conditions for achieving (f, epsilon)-resilience characterizing the correlation between relaxation in redundancy and approximation in resilience. In case when the agents' cost functions are differentiable, we obtain conditions for (f, epsilon)-resilience of the distributed gradient-descent method when equipped with robust gradient aggregation;such as comparative gradient elimination or coordinate-wise trimmed mean.

关键词： distributed optimization Approximate fault-tolerance distributed gradient-descent

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Strong and Hiding distributed Certification of $k$-Coloring 25

Brief Announcement: Strong and Hiding Distributed Certificat...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Augusto Modanese Pedro Montealegre Martín Ríos-Wilson Aalto University Espoo Finland Adolfo Ibáñez University Santiago Chile

ISBN: (纸本)9798400718854

We study the problem of certifying whether a graph is k-colorable with a locally checkable proof (LCP) that is able to hide the k-coloring from the verifier, in the sense that no algorithm can (completely) extract a k-coloring from the certificate. Motivated by the search for promise-free separations of extensions of the LOCAL model in the context of locally checkable labeling (LCL) problems, we also require the LCPs to satisfy what we call the strong soundness property. We focus on the case of 2-coloring and show that strong and hiding LCPs for 2-coloring exist in specific graph classes and require only O (log n)-sized certificates. Furthermore, when the input is promised to be a cycle or contains a node of degree 1, we show the existence of strong and hiding LCPs even in an anonymous network and with constant-size certificates. Despite these upper bounds, we prove that there are no strong and hiding LCPs for 2-coloring in general, regardless of certificate size. Along the way, we give a characterization of the hiding property for the general k-coloring problem that appears to be a key component for future investigations in this context.

关键词： coloring problem

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：