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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

182 篇 会议
11 篇 期刊文献

馆藏范围

193 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

156 篇 工学
- 153 篇 计算机科学与技术...
- 80 篇 软件工程
- 26 篇 信息与通信工程
- 11 篇 控制科学与工程
- 10 篇 电气工程
- 6 篇 网络空间安全
- 3 篇 仪器科学与技术
- 3 篇 电子科学与技术（可...
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
62 篇 理学
- 58 篇 数学
- 23 篇 统计学（可授理学、...
- 6 篇 物理学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 生物学
22 篇 管理学
- 16 篇 管理科学与工程(可...
- 9 篇 工商管理
- 6 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
2 篇 农学
- 2 篇 作物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...

主题

62 篇 distributed comp...
13 篇 distributed comp...
12 篇 distributed algo...
6 篇 approximation al...
6 篇 self-stabilizati...
5 篇 computer systems...
5 篇 consensus
4 篇 distributed algo...
4 篇 fault tolerance
4 篇 algorithms
4 篇 multi-commodity ...
4 篇 distributed syst...
3 篇 statelessness
3 篇 data structures
3 篇 computer network...
3 篇 randomized algor...
2 篇 computer science
2 篇 random walk
2 篇 spanner
2 篇 message passing

机构

3 篇 ben gurion univ ...
3 篇 irisa campus bea...
3 篇 johns hopkins un...
2 篇 yale university ...
2 篇 irisa rennes ced...
2 篇 technion
2 篇 ibm tj watson re...
2 篇 technion haifa
2 篇 university of fr...
2 篇 eth zurich
2 篇 national univers...
2 篇 mitre corporatio...
2 篇 johns hopkins un...
2 篇 boston college
1 篇 georgia institut...
1 篇 mpi informat d-6...
1 篇 hamad bin khalif...
1 篇 university of ot...
1 篇 dept. of electri...
1 篇 massachusetts in...

作者

9 篇 awerbuch baruch
6 篇 raynal michel
6 篇 khandekar rohit
5 篇 kutten shay
4 篇 kuhn fabian
4 篇 rajsbaum sergio
4 篇 gafni eli
4 篇 dolev danny
4 篇 censor-hillel ke...
3 篇 peleg david
3 篇 lenzen christoph
3 篇 korman amos
3 篇 fabian kuhn
3 篇 patt-shamir boaz
3 篇 elkin michael
3 篇 golab wojciech
3 篇 herlihy maurice
3 篇 guerraoui rachid
2 篇 bar-noy amotz
2 篇 ghaffari mohsen

语言

191 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the twenty-first annual symposium on Principles of distributed computing"

共 193 条记录，以下是21-30 订阅

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

详细简洁

排序：

distributed House-Hunting in Ant Colonies 15

Distributed House-Hunting in Ant Colonies

引用

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

作者： Ghaffari, Mohsen Musco, Cameron Radeva, Tsvetomira Lynch, Nancy MIT 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450336178

We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony relocates to a new nest. The task of identifying and evaluating the quality of potential new nests is distributed among all ants. They must additionally reach consensus on a final nest choice and transport the full colony to this single new nest. Our goal is to use tools and techniques from distributed computing theory in order to gain insight into the house-hunting process. We develop a formal model for the house-hunting problem inspired by the behavior of the Temnothorax genus of ants. We then show a Omega(log n) lower bound on the time for all n ants to agree on one of k candidate nests. We also present two algorithms that solve the house-hunting problem in our model. The first algorithm solves the problem in optimal O(log n) time but exhibits some features not characteristic of natural ant behavior. The second algorithm runs in O(k log n) time and uses an extremely simple and natural rule for each ant to decide on the new nest.

关键词： distributed algorithms randomized algorithms social insect colonies biology-inspired algorithms house-hunting Temnothorax ants

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fast distributed Almost Stable Matchings 15

Fast Distributed Almost Stable Matchings

引用

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

作者： Ostrovsky, Rafail Rosenbaum, Will Univ Calif Los Angeles Dept Comp Sci 4732 Boelter Hall Los Angeles CA 90095 USA Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA

ISBN: (纸本)9781450336178

In their seminal work on the Stable Marriage Problem, Gale and Shapley [4] describe an algorithm which finds a stable matching in O (n(2)) communication rounds. Their algorithm has a natural interpretation as a distributed algorithm where each player is represented by a single processor. In this distributed model, Floreen, Kaski, Polishchuk, and Suomela [3] recently showed that for bounded preference lists, terminating the Gale-Shapley algorithm after a constant number of rounds results in an almost stable matching. In this paper, we describe a new deterministic distributed algorithm which finds an almost stable matching in O(log(5) n) communication rounds for arbitrary preferences. We also present a faster randomized variant which requires O(log(2) n) rounds. This run-time can be improved to O(1) rounds for "almost regular" (and in particular complete) preferences. To our knowledge, these are the first sub-polynomial round distributed algorithms for any variant of the stable marriage problem with unbounded preferences.

关键词： stable marriage problem stable matchings distributed algorithms approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimal Synchrony for Byzantine Consensus 15

Minimal Synchrony for Byzantine Consensus

引用

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

作者： Bouzid, Zohir Mostfaoui, Achour Raynal, Michel Univ Rennes IRISA Rennes France Univ Nantes LINA F-44322 Nantes France Inst Univ France Paris France

ISBN: (纸本)9781450336178

Solving the consensus problem requires in one way or another that the underlying system satisfies some synchrony assumption. Considering an asynchronous message-passing system of n processes where (a) up to t < n/3 may commit Byzantine failures, and (b) each pair of processes is connected by two uni-directional channels (with possibly different timing properties), this paper investigates the synchrony assumption required to solve consensus, and presents a signature-free consensus algorithm whose synchrony requirement is the existence of a process that is an eventual < t + 1 > bisource. Such a process p is a correct process that eventually has (a) timely input channels from t correct processes and (b) timely output channels to t correct processes ( these input and output channels can connect p to different subsets of processes). As this synchrony condition was shown to be necessary and sufficient in the stronger asynchronous system model (a) enriched with message authentication, and (b) where the channels are bidirectional and have the same timing properties in both directions, it follows that it is also necessary and sufficient in the weaker system model considered in the paper. In addition to the fact that it closes a long-lasting problem related to Byzantine agreement, a noteworthy feature of the proposed algorithm lies in its design simplicity, which is a first-class property.

关键词： Adopt-commit Asynchronous message-passing Byzantine process Consensus distributed algorithm Eventual timely channel Feasibility condition Lower bound Optimal resilience Reliable broadcast Signature-free algorithm Synchrony assumption

来源：评论

学校读者我要写书评

暂无评论

computing Weak Consistency in Polynomial Time

Computing Weak Consistency in Polynomial Time

引用

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

作者： Golab, Wojciech Li, Xiaozhou (Steve) Lopez-Ortiz, Alejandro Nishimura, Naomi Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Google Inc Mountain View CA USA Univ Waterloo Sch Comp Sci Waterloo ON Canada

ISBN: (纸本)9781450336178

The k-atomicity property can be used to describe the consistency of data operations in large distributed storage systems. The weak consistency guarantees offered by such systems are seen as a necessary compromise in view of Brewer's CAP principle. The k-atomicity property requires that every read operation obtains a value that is at most k updates (writes) old, and becomes a useful way to quantify weak consistency if k is treated as a variable that can be computed from a history of operations. Specifically, the value of k quantifies how far the history deviates from Lamport's atomicity property for read/write registers. We address the problem of computing k indirectly by solving the k-atomicity verification problem (k-AV): given a history of read/write operations and a positive integer k, decide whether the history is k-atomic. Gibbons and Korach showed that in general this problem is NP-complete when k = 1, and hence not solvable in polynomial time unless P = NP. In this paper we present two algorithms that solve the k-AV problem for any k >= 2 in special cases. Similarly to known solutions for k = 1 and k = 2, both algorithms assume that all the values written to a given object are distinct. The first algorithm places an additional restriction on the structure of the input history and solves k-AV in O(n(2) +n center dot k log k) time. The second algorithm does not place any additional restrictions on the input but is efficient only when k is small and when concurrency among write operations is limited. Its time complexity is O(n(2)) if both k and our particular measure of write concurrency are bounded by constants.

关键词： Consistency atomicity verification distributed storage

来源：评论

学校读者我要写书评

暂无评论

Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems [Extended Abstract] 15

Stabilizing Server-Based Storage in Byzantine Asynchronous M...

引用

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

作者： Bonomi, Silvia Dolev, Shlomi Potop-Butucaru, Maria Raynal, Michel Univ Roma La Sapienza DIAG Rome Italy Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel Univ P&M Curie LIP6 Paris France Univ Rennes IRISA Inst Univ France Rennes France

ISBN: (纸本)9781450336178

A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering inversions are eliminated by the use of a (bounded) sequence number for writes, obtaining a practically stabilizing SWSR atomic register. A practically stabilizing Byzantine single-writer multi-reader (SWMR) atomic register is then obtained by using several copies of SWSR atomic registers. Finally, bounded time-stamps, with a time-stamp per writer, together with SWMR atomic registers, are used to construct a practically stabilizing Byzantine multi-writer multi-reader (MWMR) atomic register. In a system of n servers implementing an atomic register, and in addition to transient failures, the constructions tolerate t < n/8 Byzantine servers if communication is asynchronous, and t < n/3 Byzantine servers if it is synchronous. The noteworthy feature of the proposed algorithms is that (to our knowledge) these are the first that build an atomic read/write storage on top of asynchronous servers prone to transient failures, and where up to t of them can be Byzantine.

关键词： Asynchronous message-passing system Atomic read/write register Byzantine server Clients/servers architecture distributed algorithm Fault-tolerance Read/write register Regular register Self-stabilization Transient failures

来源：评论

学校读者我要写书评

暂无评论

Upper bound on the complexity of solving hard renaming 13

Upper bound on the complexity of solving hard renaming

引用

2013 ACM symposium on principles of distributed computing, PODC 2013

作者： Attiya, Hagit Castañeda, Armando Herlihy, Maurice Paz, Ami Technion Israel Brown Israel

ISBN: (纸本)9781450320658

The M-renaming task requires n+1 processes, each starting with a unique input name (from an arbitrary large range), to coordinate the choice of new output names from a range of size M. This paper presents the first upper bound on the complexity of hard renaming, i.e., 2n-renaming, when n + 1 is not a prime power. It is known that 2n-renaming can be solved if and only if n+1 is not a prime power;however, the previous proof of the "if" part was non-constructive, involving an approximation theorem;in particular, it did not yield a concrete upper bound on the complexity of the resulting protocol. Copyright 2013 ACM.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：