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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Stability of long-lived consensus

Stability of long-lived consensus

引用

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

作者： Dolev, S Rajsbaum, S Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Compaq Cambridge Res Lab Cambridge MA 02142 USA

This paper introduces the notion of stability for a long-lived consensus system. This notion reflects how sensitive to changes the decisions of the system are, from one invocation of the consensus algorithm to the next, with respect to input changes. Stable long-lived consensus systems are proposed, and tight lower bounds on the achievable stability are proved, for several different scenarios. The scenarios include systems that keep memory from one invocation of consensus to the next versus memoryless systems;systems that take their decisions based on the number of different inputs but not on the source identities of those inputs versus non-symmetric systems. These results intend to study essential aspects of stability, and hence are independent of specific models of distributed computing. Applications to particular self-stabilizing asynchronous systems and synchronous systems are described. (C) 2003 Elsevier Science (USA). All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Player-Optimal Protocols for Strong and Differential Consensus 03

Efficient Player-Optimal Protocols for Strong and Differenti...

引用

twenty-Second annual acm symposium on principles of distributed computing, PODC 2003

作者： Fitzi, Matthias Garay, Juan A. Department of Computer Science University of California Davis CA 95616 United States Bell-Labs Lucent Technologies 600 Mountain Ave. Murray Hill NJ 07974 United States

ISBN: (纸本)9781581137088

In this paper we consider the following two variants of the consensus problem. First, the strong consensus problem, where n players attempt to reach agreement on a value initially held by one of the correct players, despite the (malicious) behavior of up to t of them. (Recall that in the standard version of the problem, the players are also required to decide on one of the correct players' input values, but only when they all start with the same value;otherwise, they can decide on a default.) Although the problem is closely related to the standard problem, the only known solution with the optimal number of players requires exponential computation and communication in the unconditional setting. Even though the decision would be a value originally held by a correct player, strong consensus allows for a decision value that is the least common among the correct players. We also formulate the δ-differential consensus problem, which specifies that the value agreed on must be of a certain plurality among the correct players - specifically, that the plurality of any other value cannot exceed the plurality of the decision value by more than δ. In this paper we study these problems, and present efficient protocols and tight lower bounds for several standard distributed computation models - unconditional, computational, synchronous, and asynchronous.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Resource Discovery 03

Asynchronous Resource Discovery

引用

twenty-Second annual acm symposium on principles of distributed computing, PODC 2003

作者： Abraham, Ittai Dolev, Danny Sch. of Eng. and Computer Science Hebrew University Jerusalem Israel

ISBN: (纸本)9781581137088

Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP address) are known to them. One of the basic building blocks of such a distributed system is resource discovery efficiently discovering the ids of the nodes that currently exist in the system. We present both upper and lower bounds for the resource discovery problem. For the original problem raised by Harchol-Balter, Leighton, and Lewin we present an ω(n log n) message complexity lower bound for asynchronous networks whose size is unknown. For this model, we give an asymptotically message optimal algorithm that improves the bit complexity of Kutten and Peleg. When each node knows the size of its connected component, we provide a novel and highly efficient algorithm with near linear O(nα(n, n)) message complexity (where α is the inverse of Ackerman's function). In addition, we define and study the Ad-hoc Resource Discovery Problem, which is a practical relaxation of the original problem. Our algorithm for ad-hoc resource discovery has near linear O(nα(n, n)) message complexity. The algorithm efficiently deals with dynamic node additions to the system, thus addressing an open question of [3], We present a ω(nα(n, n)) lower bound for the Ad-hoc Resource Discovery Problem, showing that our algorithm is asymptotically message optimal.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Operation-Valency and the Cost of Coordination 03

Operation-Valency and the Cost of Coordination

引用

twenty-Second annual acm symposium on principles of distributed computing, PODC 2003

作者： Hendler, Danny Shavit, Nir School of Computer Science Tel-Aviv University Tel Aviv 69978 Israel

ISBN: (纸本)9781581137088

This paper introduces operation-valency, a generalization of the valency proof technique originated by Fischer, Lynch, and Paterson. By focusing on critical events that influence the return values of individual operations rather then on critical events that influence a protocol's single return value, the new technique allows us to derive a collection of realistic lower bounds for lock-free implementations of concurrent objects such as linearizable queues, stacks, sets, hash tables, shared counters, approximate agreement, and more. By realistic we mean that they follow the real-world model introduced by Dwork, Herlihy, and Waarts, counting both memory-references and memory-stalls due to contention, and that they allow the combined use of read, write, and read-modify-write operations available on current machines. By using the operation-valency technique, we derive an Ω(√n) non-cached shared memory accesses lower bound on the worst-case time complexity of lock-free implementations of objects in Influence(n), a wide class of concurrent objects including all of those mentioned above, in which an individual operation can be influenced by all others. We also prove the existence of a fundamental relationship between the space complexity, latency, contention, and "influence level" of any lock-free object implementation. Our results are broad in that they hold for implementations combining read/write memory and any collection of read-modify-write operations, and in that they apply even if shared memory words have unbounded size.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Constructing Fair-Exchange Protocols for E-commerce Via distributed Computation of RSA Signatures 03

Constructing Fair-Exchange Protocols for E-commerce Via Dist...

引用

twenty-Second annual acm symposium on principles of distributed computing, PODC 2003

作者： Park, Jung Min Chong, Edwin K.P. Siegel, Howard Jay Sch. of Elec./Computer Engineering Purdue University West Lafayette IN 47907-1285 United States Dept. of Electrical Engineering Colorado State University Fort Collins CO 80523-1373 United States

ISBN: (纸本)9781581137088

Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item, or neither party does. We describe a novel method of constructing very efficient fair-exchange protocols by distributing the computation of RSA signatures. Specifically, we employ multisignatures based on the RSA-signature scheme. To date, the vast majority of fair-exchange protocols require the use of zero-knowledge proofs, which is the most computationally intensive part of the exchange protocol. Using the intrinsic features of our multisignature model, we construct protocols that require no zero-knowledge proofs in the exchange protocol. Use of zero-knowledge proofs is needed only in the protocol setup phase - this is a one-time cost. Furthermore, our scheme uses multisignatures that are compatible with the underlying standard (single-signer) signature scheme, which makes it possible to readily integrate the fair-exchange feature with existing e-commerce systems.

关键词： Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

distributed Error Confinement 03

Distributed Error Confinement

引用

twenty-Second annual acm symposium on principles of distributed computing, PODC 2003

作者： Azar, Yossi Kutten, Shay Patt-Shamir, Boaz Dept. of Computer Science Tel Aviv University Tel Aviv 69978 Israel Dept. of Industrial Engineering Technion Haifa 32000 Israel HP Cambridge Research Lab One Cambridge Center Cambridge MA 02142 United States Department of Electrical Engineering Tel Aviv University Tel Aviv 69978 Israel

ISBN: (纸本)9781581137088

We initiate the study of error confinement in distributed applications, where the goal is that only nodes that were directly hit by a fault may deviate from their correct external behavior, and only temporarily. The external behavior of all other nodes must remain impeccable, even though their internal state may be affected. Error confinement is impossible if an adversary is allowed to inflict arbitrary transient faults on the system, since the faults might completely wipe out input values. We introduce a new fault tolerance measure we call agility, which quantifies the strength of an algorithm that disseminate information, against state corrupting faults. We study the basic problem of broadcast, and propose algorithms that guarantee error confinement with optimal agility to within a constant factor, even in asynchronous networks when the topology is unknown. These algorithms can serve as building blocks in more general reactive systems. Previous results in exploring locality in reactive systems were not error confined, and relied on the assumption (not used in current paper) that the errors hitting each node are probabilistic, such that a faulty node itself, or its neighbor, can detect the node faulty. The main algorithm uses the novel core bootstrapping technique, that seems inherent for voting in reactive networks;its analysis leads to an interesting combinatorial problem. The technique and the analysis may be of independent interest.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed Consensus in the Presence of Sectional Faults 03

Distributed Consensus in the Presence of Sectional Faults

引用

twenty-Second annual acm symposium on principles of distributed computing, PODC 2003

作者： Amitanand, S. Sanketh, I. Srinathan, K. Vinod, V. Pandu Rangan, C. Dept. of Comp. Sci. and Engineering Indian Inst. of Technology Madras Chennai-600036 India

ISBN: (纸本)9781581137088

Consider a synchronous network of n players, each with a local input. The goal of distributed consensus is to globally agree on one of the valid inputs even if some non-trivial sub-set of the players are faulty. By valid input, we mean the input of any non-faulty player. Extant results in Byzantine agreement literature capture the behaviour of faulty players in an "all-or-nothing" fashion, For instance, a (Byzantine) faulty player is completely unconstrained and could behave differently with different players. This leads to a gross underestimation of the achievable fault-tolerance. In this work, we propose a fault-model that considerably improves the estimation of fault-tolerance and helps capture real-life scenarios better. For instance, if two (honest) players were part of the same LAN (which is essentially a broadcast network), it is impossible for a external faulty player to behave differently with these two players (though the faulty player may behave with "equal" malice with both these players!). Among our results, we introduce the sectional fault-model that is more general and can capture practical scenarios not captured by any extant model. We provide a complete characterization of the tolerable faults and present efficient protocols to achieve consensus. We remark that the results of this paper strictly generalize the extant characterizations of fault-tolerance. For example, consider a network of four players P1,P1,P3 and P 4, under the corrupting influence of a Byzantine adversary given by the adversary structure A = {(P1,P2),(P2,P 3),(P4)}. Agreement is impossible in such a scenario, since the three sets from A cover the player set. However, it would be evident from our results that consensus in the above scenario was indeed possible if (and only if) the players P1, P3 and P4 belonged to a single LAN in the network!

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: extending SQL access control to derived and distributed data 03

Brief announcement: extending SQL access control to derived ...

引用

proceedings of the twenty-second annual symposium on principles of distributed computing

作者： Arnon Rosenthal Edward Sciore MITRE Corporation Boston College

No abstract available.

ISBN: (纸本)9781581137088

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cryptography and competition policy: issues with 'trusted computing' 03

Cryptography and competition policy: issues with 'trusted co...

引用

proceedings of the twenty-second annual symposium on principles of distributed computing

作者： Ross Anderson Cambridge University Cambridge England

ISBN: (纸本)9781581137088

The most significant strategic development in information technology over the past year has been 'trusted computing'. This is popularly associated with Microsoft's 'Palladium' project, recently renamed 'NGSCB'. In this paper, I give an outline of the technical aspects of 'trusted computing' and sketch some of the public policy consequences.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Working with mike on distributed computing theory, 1978--1992 03

Working with mike on distributed computing theory, 1978--199...

引用

proceedings of the twenty-second annual symposium on principles of distributed computing

作者： Nancy Lynch Massachusetts Institute of Technology Cambridge MA

ISBN: (纸本)9781581137088

I have had the honor of working with Mike Fischer on no fewer than 15 projects in the area of distributed computing theory, plus a few others in other areas. The results of some of these projects, like the one with Mike Paterson on impossibility of consensus, are very well known in the PODC community and elsewhere. Others are less well known, but I think are interesting anyway.I will take the opportunity of Mike's birthday celebration to review the many papers we have written together and describe their contributions. I will put the ideas of these papers in the context of earlier and later distributed computing theory *** papers cover a wide range of topics within distributed computing theory. The papers include algorithms and/or impossibility results for mutual exclusion, k-exclusion, optimal resource placement in networks, consensus (synchronous and asynchronous), global snapshots, and implementing reliable communication over unreliable channels. One paper establishes a quantitative difference between the capabilities of synchronous and asynchronous systems. Another, dated 1980, presents an early levels-of-abstraction proof for a complex mutual exclusion algorithm. Yet another, dated 1979, presents a very early compositional model for fair asynchronous systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：