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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Error-Free Multi-Valued Consensus with Byzantine Failures 11

Error-Free Multi-Valued Consensus with Byzantine Failures

引用

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

作者： Liang, Guanfeng Vaidya, Nitin Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

ISBN: (纸本)9781450307192

In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an L-bit value with communication complexity O(nL + n(4)L(0.5) + n(6)) bits, in a network consisting of n processors with up to t Byzantine failures, such that t < n/3. For large enough L, communication complexity of the proposed algorithm becomes O(nL) bits, linear in the number of processors. To achieve this goal, the algorithm performs consensus on a long message (L bits), in multiple generations, each generation performing consensus on a part of the input message. The failure-free execution of each generation is made efficient by using a combination of two techniques: error detection coding, and processor clique formation based on matching input values proposed by the processors. By keeping track of faulty behavior over the different generations, the algorithm can ensure that most generations of the algorithm are failure-free. With parameterization, our algorithm is able to achieve a large class of validity conditions for consensus, while maintaining linear communication complexity. With a suitable choice of the error detection code, and using a clique of an appropriate size, the communication cost can be traded off with the strength of the validity condition. The proposed algorithm requires no cryptographic techniques.

关键词： Byzantine agreement consensus distributed computing

来源：评论

学校读者我要写书评

暂无评论

Breaking the O(n²) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary

Breaking the O(n2) Bit Barrier: Sca...

引用

29th acm SIGACT-SIGOPS symposium on principles of distributed computing

作者： King, Valerie Saia, Jared Univ Victoria Dept Comp Sci Victoria BC V8W 3P6 Canada Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA

ISBN: (纸本)9781605588889

We describe an algorithm for Byzantine agreement that is scalable in the sense that each processor sends only (O) over tilde(root n) bits, where n is the total number of processors. Our algorithm succeeds with high probability against an adaptive adversary, which can take over processors at any time during the protocol, up to the point of taking over arbitrarily close to a 1/3 fraction. We assume synchronous communication but a rushing adversary. Moreover, our algorithm works in the presence of flooding: processors controlled by the adversary can send out any number of messages. We assume the existence of private channels between all pairs of processors but make no other cryptographic assumptions. Finally, our algorithm has latency that is polylogarithmic in n. To the best of our knowledge, ours is the first algorithm to solve Byzantine agreement against an adaptive adversary, while requiring o(n(2)) total bits of communication.

关键词： Theory Byzantine agreement consensus Samplers Peer-to-peer secret-sharing Monte Carlo Algorithms distributed computing

来源：评论

学校读者我要写书评

暂无评论

A Tight Unconditional Lower Bound on distributed Random Walk Computation 11

A Tight Unconditional Lower Bound on Distributed Random Walk...

引用

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

作者： Nanongkai, Danupon Das Sarma, Atish Pandurangan, Gopal Univ Vienna A-1010 Vienna Austria

ISBN: (纸本)9781450307192

We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show that a random walk of length l on a network of diameter D can be performed in (O) over tilde(root lD + D) time. A major question left open is whether there exists a faster algorithm, especially whether the multiplication of root l and root D is necessary. In this paper, we show a tight unconditional lower bound on the time complexity of distributed random walk computation. Specifically, we show that for any n, D, and D <= l <= (n/(D-3 log n))(1/4), performing a random walk of length circle minus(l) on an n-node network of diameter D requires Omega(root lD+D) time. This bound is unconditional, i.e., it holds for any (possibly randomized) algorithm. To the best of our knowledge;this is the first lower bound that the diameter plays a role of multiplicative factor. Our bound shows that the algorithm of Das Sarma et al. is time optimal. Our proof technique introduces a new connection between bounded-round communication complexity and distributed algorithm lower bounds with D as a trade-off parameter, strengthening the previous study by Das Sarma et al. [STOC'11]. In particular, we make use of the bounded-round communication complexity of the pointer chasing problem. Our technique can be of independent interest and may be useful in showing non-trivial lower bounds on the complexity of other fundamental distributed computing problems.

关键词： distributed Algorithms Random Walk Lower Bound Time Complexity Communication Complexity

来源：评论

学校读者我要写书评

暂无评论

Logical Attestation: An Authorization Architecture for Trustworthy computing 11

Logical Attestation: An Authorization Architecture for Trust...

引用

23rd acm symposium on Operating Systems principles (SOSP 2011)

作者： Sirer, Emin Guen de Bruijn, Willem Reynolds, Patrick Shieh, Alan Walsh, Kevin Williams, Dan Schneider, Fred B. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9781450309776

This paper describes the design and implementation of a new operating system authorization architecture to support trustworthy computing. Called logical attestation, this architecture provides a sound framework for reasoning about run time behavior of applications. Logical attestation is based on attributable, unforgeable statements about program properties, expressed in a logic. These statements are suitable for mechanical processing, proof construction, and verification;they can serve as credentials, support authorization based on expressive authorization policies, and enable remote principals to trust software components without restricting the local user's choice of binary implementations. We have implemented logical attestation in a new operating system called the Nexus. The Nexus executes natively on x86 platforms equipped with secure coprocessors. It supports both native Linux applications and uses logical attestation to support new trustworthy-computing applications. When deployed on a trustworthy cloud-computing stack, logical attestation is efficient, achieves high-performance, and can run applications that provide qualitative guarantees not possible with existing modes of attestation.

关键词： credentials-based authorization logic trusted platform module

来源：评论

学校读者我要写书评

暂无评论

Coordinated Consensus in Dynamic Networks 11

Coordinated Consensus in Dynamic Networks

引用

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

作者： Kuhn, Fabian Moses, Yoram Oshman, Rotem Univ Lugano Fac Informat CH-6904 Lugano Switzerland

ISBN: (纸本)9781450307192

We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adversary. The network topology is always connected, but can change completely from one round to the next. The model captures mobile and wireless networks, where communication can be unpredictable. In this setting we study the fundamental problems of eventual, simultaneous, and Delta-coordinated consensus, as well as their relationship to other distributed problems, such as determining the size of the network. We show that in the absence of a good initial upper bound on the size of the network, eventual consensus is as hard as computing deterministic functions of the input, e.g., the minimum or maximum of inputs to the nodes. We also give an algorithm for computing such functions that is optimal in every execution. Next, we show that simultaneous consensus can never be achieved in less than n - 1 rounds in any execution, where n is the size of the network;consequently, simultaneous consensus is as hard as computing an upper bound on the number of nodes in the network. For Delta-coordinated consensus, we show that if the ratio between nodes with input 0 and input 1 is bounded away from 1, it is possible to decide in time n - circle minus(root n Delta), where Delta bounds the time from the first decision until all nodes decide. If the dynamic graph has diameter D. the time to decide is min{O(nD/Delta), n - Omega(n Delta/D)}, even if D is not known in advance. Finally, we show that (a) there is a dynamic graph such that for every input, no node can decide before time n - O(Delta(0.28)n(0.72));and (b) for any diameter D = O(Delta), there is an execution with diameter D where no node can decide before time Omega(nD/Delta). To our knowledge, our work constitutes the first study of Delta-coordinated consensus in general graphs.

关键词： distributed algorithms dynamic networks consensus coordination common knowledge

来源：评论

学校读者我要写书评

暂无评论

Breaking Up is Hard to Do: Security and Functionality in a Commodity Hypervisor 11

Breaking Up is Hard to Do: Security and Functionality in a C...

引用

23rd acm symposium on Operating Systems principles (SOSP 2011)

作者： Colp, Patrick Nanavati, Mihir Zhu, Jun Aiello, William Coker, George Deegan, Tim Loscocco, Peter Warfield, Andrew Univ British Columbia Dept Comp Sci Vancouver BC V5Z 1M9 Canada

ISBN: (纸本)9781450309776

Cloud computing uses virtualization to lease small slices of large-scale datacenter facilities to individual paying customers. These multi-tenant environments, on which numerous large and popular web-based applications run today, are founded on the belief that the virtualization platform is sufficiently secure to prevent breaches of isolation between different users who are co-located on the same host. Hypervisors are believed to be trustworthy in this role because of their small size and narrow interfaces. We observe that despite the modest footprint of the hypervisor itself, these platforms have a large aggregate trusted computing base (TCB) that includes a monolithic control VM with numerous interfaces exposed to VMs. We present Xoar, a modified version of Xen that retrofits the modularity and isolation principles used in microkernels onto a mature virtualization platform. Xoar breaks the control VM into single-purpose components called service VMs. We show that this componentized abstraction brings a number of benefits: sharing of service components by guests is configurable and auditable, making exposure to risk explicit, and access to the hypervisor is restricted to the least privilege required for each component. Microrebooting components at configurable frequencies reduces the temporal attack surface of individual components. Our approach incurs little performance overhead, and does not require functionality to be sacrificed or components to be rewritten from scratch.

关键词： Virtual machine monitors Virtualization configurability Platform Destruction Cloud computing Modularity Security virtual machines Voltmeter

来源：评论

学校读者我要写书评

暂无评论

Fast and Compact Self Stabilizing Verification, Computation, and Fault Detection of an MST 11

Fast and Compact Self Stabilizing Verification, Computation,...

引用

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

作者： Korman, Amos Kutten, Shay Masuzawa, Toshimitsu CNRS Paris France

ISBN: (纸本)9781450307192

This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of algorithms. In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes it for improving the memory size complexity, while obtaining time efficiency too. As a result, we show that optimizing the memory size carries at most a small cost in terms of time, in the context of Minimum Spanning Tree (MST). That is, we present algorithms that are both time and space efficient for constructing an MST, for verifying it, and for detecting the location of the faults. This involves several steps that may be considered contributions in themselves. First, we generalize the notion of local proofs, trading off the locality (or, really, the time complexity) for memory efficiency. This adds a dimension to the study of distributed local proofs, that has been gaining attention recently. Second, as opposed to previous studies that presented only the labels verification part of a proof labeling schemes, we present here also a space and time efficient distributed self stabilizing marker algorithm to generates those labels. This presents proof labeling schemes as an algorithmic tool. Finally, we show how to enhance a known transformer that makes input/output algorithms self stabilizing. It now takes as input an efficient construction algorithm and an efficient self stabilizing proof labeling scheme, and produces an efficient self stabilizing algorithm. When used for MST;the transformer produces a memory optimal (i.e., O(log n) bits per node) self stabilizing algorithm, whose time complexity, namely, O(n), is significantly better even than that of previous algorithms that where not space optimal. (The time complexity of previous MST algorithms that used Omega(log(2) n) memory bits per node was O(n(2)), and the time for optimal space algorithms was O(n vertical bar E vertical bar).) Our MST algorithm also has the important property that, if f

关键词： distributed algorithm self stabilization MST distributed verification local proof checking fault detection locality

来源：评论

学校读者我要写书评

暂无评论

Secure Network Provenance 11

Secure Network Provenance

引用

23rd acm symposium on Operating Systems principles (SOSP 2011)

作者： Zhou, Wenchao Fei, Qiong Narayan, Arjun Haeberlen, Andreas Loo, Boon Thau Sherr, Micah Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450309776

This paper introduces secure network provenance (SNP), a novel technique that enables networked systems to explain to their operators why they are in a certain state - e.g., why a suspicious routing table entry is present on a certain router, or where a given cache entry originated. SNP provides network forensics capabilities by permitting operators to track down faulty or misbehaving nodes, and to assess the damage such nodes may have caused to the rest of the system. SNP is designed for adversarial settings and is robust to manipulation;its tamper-evident properties ensure that operators can detect when compromised nodes lie or falsely implicate correct nodes. We also present the design of SNooPY, a general-purpose SNP system. To demonstrate that SNooPY is practical, we apply it to three example applications: the Quagga BGP daemon, a declarative implementation of Chord, and Hadoop Map Reduce. Our results indicate that SNooPY can efficiently explain state in an adversarial setting, that it can be applied with minimal effort, and that its costs are low enough to be practical.

关键词： Accountability Byzantine faults distributed systems Evidence Provenance Security

来源：评论

学校读者我要写书评

暂无评论

Thialfi: A Client Notification Service for Internet-Scale Applications 11

Thialfi: A Client Notification Service for Internet-Scale Ap...

引用

23rd acm symposium on Operating Systems principles (SOSP 2011)

作者： Adya, Atul Cooper, Gregory Myers, Daniel Piatek, Michael Google Inc Mountain View CA 94043 USA

ISBN: (纸本)9781450309776

Ensuring the freshness of client data is a fundamental problem for applications that rely on cloud infrastructure to store data and mediate sharing. Thialfi is a notification service developed at Google to simplify this task. Thialfi supports applications written in multiple programming languages and running on multiple platforms, e.g., browsers, phones, and desktops. Applications register their interest in a set of shared objects and receive notifications when those objects change. Thialfi servers run in multiple Google data centers for availability and replicate their state asynchronously. Thialfi's approach to recovery emphasizes simplicity: all server state is soft, and clients drive recovery and assist in replication. A principal goal of our design is to provide a straightforward API and good semantics despite a variety of failures, including server crashes, communication failures, storage unavailability, and data center failures. Evaluation of live deployments confirms that Thialfi is scalable, efficient, and robust. In production use, Thialfi has scaled to millions of users and delivers notifications with an average delay of less than one second.

关键词： scalability distributed systems

来源：评论

学校读者我要写书评

暂无评论

distributed Graph Coloring in a Few Rounds 11

Distributed Graph Coloring in a Few Rounds

引用

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

作者： Kothapalli, Kishore Pemmaraju, Sriram Int Inst Informat Technol Ctr Secur Theory & Algorithm Res Hyderabad 500032 Andhra Pradesh India

ISBN: (纸本)9781450307192

This paper considers the question of how many colors a distributed graph coloring algorithm would need to use if it had only k rounds available, for any positive integer k. In our main result, we present an algorithm that runs in O(k) rounds for any k bounded below by Omega(log log n) and bounded above by O(root logn), and uses O(a . n(1/k)) colors to color a graph with arboricity a. This result is optimal since the palette size matches the lower bound of Barenboim and Elkin (PODC 2008). This result is achieved via the use of several new results developed in this paper on coloring graphs whose edges have been acyclically oriented. For example, suppose that G is an n-vertex, acyclically oriented graph with maximum out-degree Delta(o). We present an algorithm that, for any k >= 2 log log n, runs in O(k) rounds on G to produce an (i) O(Delta(o))-coloring when Delta(o) is an element of Omega(max{kn(2/k2) log(1+1/k) n, 2(k)}) and an (ii) O(Delta(o).n(2/k2))-coloring when Delta(o) is an element of Omega(max{k log(1+1/k) n, 2(k)}). These results are useful in any setting where it is possible to efficiently compute acyclic orientations of a graph with Delta(o) << Delta. We derive non-trivial bounds on the palette size even when k < 2 log log n. Our main technical contributions can be summarized as: (i) developing a k-round version of the algorithm of Kothapalli et al. (IPDPS 2006) which computes an O(Delta)-coloring of a graph in O(root logn) rounds, and (ii) developing an oriented version of the Brooks-Vizing coloring result of Grable and Panconesi (SODA 1998).

关键词： distributed algorithms oriented graphs symmetry breaking graph coloring

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：