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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Near-Optimal distributed Maximum Flow

Near-Optimal Distributed Maximum Flow

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Ghaffari, Mohsen Karrenbauer, Andreas Kuhn, Fabian Lenzen, Christoph Patt-Shamir, Boaz MIT Cambridge MA 02139 USA MPI Informat D-66123 Saarbrucken Germany Univ Freiburg D-79110 Freiburg Germany Tel Aviv Univ IL-6997801 Tel Aviv Israel

ISBN: (纸本)9781450336178

We present a near-optimal distributed algorithm for (1+o(1))-approximation of single-commodity maximum flow in undirected weighted networks that runs in (D + root n).n(o(1)) communication rounds in the CONGEST model. Here, n and D denote the number of nodes and the network diameter, respectively. This is the first improvement over the trivial bound of O(m), and it nearly matches the (Omega) over tilde (D+root n) round complexity lower bound. The development of the algorithm contains two results of independent interest, (D + root n).n(o(1))): center dot distributed construction of a spanning tree of average stretch n(o(1)). center dot distributed construction of an n(o(1))-congestion approximator consisting of the cuts induced by O(logn) virtual trees. The distributed representation of the cut approximator allows for evaluation in (D + root n).n(o(1))) rounds. All our algorithms make use of randomization and succeed with high probability.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Robust and Private distributed Shared Atomic Memory in Message Passing Networks 15

Brief Announcement: Robust and Private Distributed Shared At...

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Dolev, Shlomi Petig, Thomas Schiller, Elad M. Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Chalmers Univ Technol Dept Comp Sci & Engn S-41296 Gothenburg Sweden

ISBN: (纸本)9781450336178

We study the problem of privately emulating shared memory in message passing networks. The system includes N servers, and at most e semi-Byzantine servers that can deviate from the algorithm by sending corrupted data. Moreover, at most f servers can fail and stop. The focus is on coded atomic storage (CAS) algorithms. We present a variant that ensures no information leakage by letting the servers store their data as secret shares. Our enhancement to CAS uses [(N + k + 2e)/2]-size quorums and Reed-Solomon codes. This enhancement preserves the algorithm ability to function in asynchronous system settings. To the best of our knowledge, we are the first to address the privacy issue when emulating shared memory in message-passing systems.

关键词： shared memory emulation message passing network coding secret sharing privacy semi-Byzantine MRMW fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Safety-Liveness Exclusion in distributed computing 15

Safety-Liveness Exclusion in Distributed Computing

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Bushkov, Victor Guerraoui, Rachid Ecole Polytech Fed Lausanne IC LPD Lausanne Switzerland

ISBN: (纸本)9781450336178

The history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of consensus in an asynchronous system basically says that we cannot devise an algorithm that deterministically ensures consensus agreement and validity (i.e., safety) on the one hand, and consensus wait-freedom (i.e., liveness) on the other hand. The motivation of this work is to study the extent to which safety and liveness properties inherently exclude each other. More specifically, we ask, given any safety property S, whether we can determine the strongest (resp. weakest) liveness property that can (resp. cannot) be achieved with S. We show that, maybe surprisingly, the answers to these safety-liveness exclusion questions are in general negative. This has several ramifications in various distributed computing contexts. In the context of consensus for example, this means that it is impossible to determine the strongest (resp. the weakest) liveness property that can (resp. cannot) be ensured with linearizability. However, we present a way to circumvent these impossibilities and answer positively the safety-liveness question by considering a restricted form of liveness. We consider a definition that gathers generalized forms of obstruction-freedom and lock-freedom while enabling to determine the strongest (resp. weakest) liveness property that can (resp. cannot) be implemented in the context of consensus and transactional memory.

关键词： Concurrency Safety Liveness Impossibility Results Consensus Transactional Memory

来源：评论

学校读者我要写书评

暂无评论

Randomized Proof-Labeling Schemes 15

Randomized Proof-Labeling Schemes

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Baruch, Mor Fraigniaud, Pierre Patt-Shamir, Boaz Tel Aviv Univ Sch Elect Engn Tel Aviv Israel CNRS Dept Comp Sci Paris France Univ Paris Diderot Paris France

ISBN: (纸本)9781450336178

Proof-labeling schemes, introduced by Korman, Kutten and Peleg [PODC 2005], are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find applications in many contexts, e.g., the design of fault-tolerant distributed algorithms. In a proof-labeling scheme, predicate verification consists of neighbors exchanging labels, whose contents depends on the predicate. In this paper, we introduce the notion of randomized proof-labeling schemes where messages are randomized and correctness is probabilistic. We show that randomization reduces label size exponentially while guaranteeing probability of correctness arbitrarily close to one. In addition, we present a novel label-size lower bound technique that applies to both deterministic and randomized proof-labeling schemes. Using this technique, we establish several tight bounds on the verification complexity of MST, acyclicity, connectivity, and longest cycle size.

关键词： distributed verfification communication complexity

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Fault-tolerant Broadcast in Anonymous distributed Systems with Fair Lossy Communication Channels 15

Brief Announcement: Fault-tolerant Broadcast in Anonymous Di...

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Tang, Jian Larrea, Mikel Arevalo, Sergio Jimenez, Ernesto Tech Univ Madrid Distributed Syst Lab LSD Madrid 28031 Spain Univ Basque Country UPV EHU San Sebastian 20018 Spain Tech Univ Madrid Madrid 28031 Spain Escuela Politec Nacl Quito 170515 Ecuador

ISBN: (纸本)9781450336178

Fault-tolerant broadcast is a fundamental service in distributed systems, by which processes can communicate with each other consistently and reliably. It has two main forms: Reliable Broadcast (RB) and Uniform Reliable Broadcast (URB). This service has been extensively investigated in non-anonymous distributed systems where processes have unique identifiers, usually assume the communication channels are reliable, which is not always the case in real systems. In this paper, the fault-tolerant broadcast service is studied in an anonymous asynchronous message passing distributed system model with fair lossy communication channels. Firstly, two simple and non-quiescent algorithms implementing RB and URB are given. Secondly, two new classes of failure detectors A Theta and AP* are proposed. Finally, with the information provided by A Theta and AP*, quiescent algorithms for both RB and URB are given.

关键词： Anonymous reliable broadcast failure detector quiescent

来源：评论

学校读者我要写书评

暂无评论

The "Mobile Adversary" Paradigm in distributed Computation and Systems 15

The "Mobile Adversary" Paradigm in Distributed Computation a...

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Yung, Moti Google Inc New York NY 10011 USA Columbia Univ New York NY USA

ISBN: (纸本)9781450336178

The notion of mobile adversary, where the opponent can capture parties in a multi-party protocol dynamically, as long as at any given point in time its capturing capability is limited by a bound on number of parties (processors) it can control, has been suggested as an extensions of the traditionally static adversary. The motivation for this adversary was a result of a few issues: First, it was originated in systems corruption phenomena like virus injection into a computer network (such as the Internet), where viruses are spread but also detected and eliminated at network computers. Secondly, it is natural to assume that for managed networks, there will be efforts to recover failed processors, so the adversary control may cease to exist in a node locally while its control of other nodes continues. thirdly, the notion of self-stabilization implies that a system tries to get rid of failures and the notion represents a strong fault-tolerance aspect, and should be extended (i.e., augmented by assuming bound on faults and extending initial benign fault to adversarial perpetual ones). As a result, the mobile adversary notion and a methodology for coping with it (proactive fault-tolerance, or proactive security in security oriented protocols) and its perpetual self-healing character, have been suggested. This work will review the development and influence of this notion on fault-tolerant secure distributed computing.

关键词： distributed Systems Multi-party Secure Computation Mobile Adversary Dynamic Adversary Proactive Security Self Healing Self-Recovery

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Scheduling of distributed Algorithms 15

Near-Optimal Scheduling of Distributed Algorithms

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Ghaffari, Mohsen MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450336178

This paper studies the question of how to run many distributed algorithms, solving independent problems, together as fast as possible. Suppose that we want to run distributed algorithms A(1);A(2) ...;A(k) in the CONGEST model, each taking at most dilation rounds, and where for each network edge, at most congestion messages need to go through it, in total over all these algorithms. A celebrated work of Leighton, Maggs, and Rao [22] shows that in the special case where each of these algorithms is simply a packet routing |that is, sending a message from a source to a destination along a given path|there is an O(congestion + dilation) round schedule. Note that this bound is trivially optimal. Generalizing the framework of LMR [22], we study scheduling general distributed algorithms and present two results: (a) an existential schedule-length lower bound of Omega(congestion +dilation . log n/log log n) rounds, (b) a distributed algorithm that produces a near-optimal O (congestion+ *** n) round schedule, after O(dilation vertical bar log(2) n) rounds of pre-computation. A key challenge in the latter result is to solve the problem with only private randomness, as globally-shared randomness simplifies it significantly. The technique we use for this problem is in fact more general, and it can be used to remove the assumption of having shared randomness from a broad range of distributed algorithms, at the cost of a slow down factor of O(log(2) n).

关键词： distributed Algorithm Scheduling Congestion Dilation Packet Routing Shared Randomness

来源：评论

学校读者我要写书评

暂无评论

distributed Convex Thresholding 15

Distributed Convex Thresholding

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Wolff, Ran Yahoo Labs Haifa Israel

ISBN: (纸本)9781450336178

Over the last fifteen years, a large group of algorithms emerged which compute various predicates from distributed data with a focus on communication efficiency. These algorithms are often called "communication-efficient", "geometric-monitoring", or "local" algorithms. We jointly call them distributed convex thresholding algorithms, for reasons which will be explained in this work. distributed convex thresholding algorithms have found their applications in domains in which bandwidth is a scarce resource, such as wireless sensor networks and peer-to-peer systems, or in scenarios in which data rapidly streams to the different processors but outcome of the predicate rarely changes. Common to all of these algorithms is the use of a data dependent criteria to determine when further messaging is required. This work presents two very simple yet exceedingly general theorems from which the correctness of all distributed convex thresholding algorithms can be elicited, and demonstrates that for key examples. Because the theorems are general, they extend the range of predicates which can be computed in a communication efficient manner beyond what is currently known. Unlike the previous correction proofs given to these algorithms, the proofs of the theorems presented here do not depend on the communication infrastructure. So the correctness of any distributed convex thresholding algorithm is immediately extended from broadcast enabled networks or from cycle free networks to general networks. Inspecting existing algorithms in light of the new theorems reveals that they contain redundant requirements, which cause them to send messages when indeed none are needed.

关键词： Local algorithms Geometric monitoring Communication efficient algorithms Wireless sensor networks Peer-to-peer systems

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Discovery in Sub-Logarithmic Time 15

Distributed Resource Discovery in Sub-Logarithmic Time

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Haeupler, Bernhard Malkhi, Dahlia Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA VMware Res Palo Alto CA 94304 USA

ISBN: (纸本)9781450336178

We present a new distributed algorithm for the resource discovery problem introduced by Harchol-Balter, Leighton, and Levin in PODC'99. The resource discovery problem consists of a synchronous network with n machines in which at any timestep any machine v can PUSH or PULL a message to/from any other machine u whose (IP) address is known to v. Messages can contain addresses which then change the "topology". The goal of a distributed resource discovery problem is to enable all machines to learn the addresses of all other machines as fast as possible while keeping the number of messages sent low. We present a randomized distributed algorithm that achieves this goal in O(log D log log n) rounds using O(n) messages, where D is the strong diameter of the initial topology. Up to the log log n factor, our round complexity is best possible given the trivial Omega(log D) lower bound. For many typical networks with D = o(n), our running time is a drastic improvement over prior O(log n) round algorithms. In particular, for networks with polylogarithmic diameter an O(log(2) log n) running time and thus an almost exponential speedup is obtained.

关键词： resource discovery direct addressing gossip information dissemination rumor spreading

来源：评论

学校读者我要写书评

暂无评论

Algebraic Methods in the Congested Clique 15

Algebraic Methods in the Congested Clique

引用

34th annual acm symposium on principles of distributed computing (PODC)

作者： Censor-Hillel, Keren Kaski, Petteri Korhonen, Janne H. Lenzen, Christoph Paz, Ami Suomela, Jukka Technion Haifa Israel Helsinki Inst Informat Technol Helsinki Finland Aalto Univ Espoo Finland Univ Helsinki Helsinki Finland MPI Informat Saarbrucken Germany

ISBN: (纸本)9781450336178

In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n(1-2/omega)) round matrix multiplication algorithm, where omega < 2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: - triangle and 4-cycle counting in O(n(0.158)) rounds, improving upon the O(n(1/3)) triangle detection algorithm of Dolev et al. [DISC 2012], - a (1+o(1))-approximation of all-pairs shortest paths in O(n(0.158)) rounds, improving upon the <(O)over tilde>(n(1/2))-round (2+o(1))-approximation algorithm of Nanongkai [STOC 2014], and - computing the girth in O(n(0.158)) rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.

关键词： distributed computing congested clique model lower bounds matrix multiplication subgraph detection distance computation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：