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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

741 篇 会议
41 篇 期刊文献

馆藏范围

782 篇 电子文献
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

语言

775 篇 英文
6 篇 其他
1 篇 中文

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

共 782 条记录，以下是141-150 订阅

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

详细简洁

排序：

Brief announcement: Achieving reliability in master-worker computing via evolutionary dynamics 12

Brief announcement: Achieving reliability in master-worker c...

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Christoforou, Evgenia Fernández Anta, Antonio Georgiou, Chryssis Mosteiro, Miguel A. Sanchez, Angel University of Cyprus Cyprus Institute IMDEA Networks Spain Univ. Rey Juan Carlos Spain Rutgers University United States Matemáticas Univ. Carlos III Spain BIFI Univ. Zaragoza Spain

ISBN: (纸本)9781450314503

This work considers Internet-based task computations in which a master process assigns tasks, over the Internet, to rational workers and collect their responses. The objective is for the master to obtain the correct task outcomes. For this purpose we formulate and study the dynamics of evolution of Internet-based master-worker computations through reinforcement learning. © 2012 Authors.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

distributed maximal matching: Greedy is optimal 12

Distributed maximal matching: Greedy is optimal

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Hirvonen, Juho Suomela, Jukka Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki P.O. Box 68 FI-00014 Helsinki Finland

ISBN: (纸本)9781450314503

We study distributed algorithms that find a maximal matching in an anonymous, edge-coloured graph. If the edges are properly coloured with k colours, there is a trivial greedy algorithm that finds a maximal matching in k-1 synchronous communication rounds. The present work shows that the greedy algorithm is optimal in the general case: if A is a deterministic distributed algorithm that finds a maximal matching in anonymous, k-edge-coloured graphs, then there is a worst-case input in which the running time of A is at least k1 rounds. If we focus on graphs of maximum degree Δ, it is known that a maximal matching can be found in O(Δ+ log*k) rounds, and prior work implies a lower bound of Ω(polylog(Δ) + log*k) rounds. Our work closes the gap between upper and lower bounds: the complexity is Θ(Δ+ log*k) rounds. To our knowledge, this is the first linear-in-Δ lower bound for the distributed complexity of a classical graph problem. © 2012 acm.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed all pairs shortest paths and applications 12

Optimal distributed all pairs shortest paths and application...

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Holzer, Stephan Wattenhofer, Roger ETH Zurich Switzerland

ISBN: (纸本)9781450314503

We present an algorithm to compute All Pairs Shortest Paths (APSP) of a network in a distributed way. The model of distributed computation we consider is the message passing model: in each synchronous round, every node can transmit a different (but short) message to each of its neighbors. We provide an algorithm that computes APSP in O(n) communication rounds, where n denotes the number of nodes in the network. This implies a linear time algorithm for computing the diameter of a network. Due to a lower bound these two algorithms are optimal up to a logarithmic factor. Furthermore, we present a new lower bound for approximating the diameter D of a graph: Being allowed to answer D+1 or D can speed up the computation by at most a factor D. On the positive side, we provide an algorithm that achieves such a speedup of D and computes an (1+Εepsilon) multiplicative approximation of the diameter. We extend these algorithms to compute or approximate other problems, such as girth, radius, center and peripheral vertices. At the heart of these approximation algorithms is the S-Shortest Paths problem which we solve in O(|S|+D) time. © 2012 acm.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement 12

Brief announcement: There are plenty of tasks weaker than pe...

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Castãeda, Armando Rajsbaum, Sergio Raynal, Michel INRIA Campus de Beaulieu 35042 Rennes Cedex France Instituto de Matemáticas UNAM Mexico City Mexico Institut Universtaire de France IRISA Campus de Beaulieu 35042 Rennes Cedex France

ISBN: (纸本)9781450314503

In the asynchronous wait-free shared memory model, two families of tasks play a central role because of their implications in theory and in practice: k-set agreement and M-renaming. Let n denote the number of processes in the system. Previous research shows that (n-1)-set agreement can solve (2n-2)-renaming, for any value of n, while (2n-2)-renaming cannot solve (n-1)-set agreement, when n is odd. It is also known that, for every n > 3, n-renaming, also called perfect renaming, is strictly stronger than (n-1)-set agreement. This paper shows that when n > 4, there is a family of tasks that are strictly stronger than (n-1)-set agreement and strictly weaker than perfect renaming. This enlarges our view of both the nature and the structure of what are distributed computing tasks. © 2012 Authors.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed connectivity of wireless networks 12

Distributed connectivity of wireless networks

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Halldórsson, Magnús M. Mitra, Pradipta ICE-TCS School of Computer Science Reykjavik University 101 Reykjavik Iceland

ISBN: (纸本)9781450314503

We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set of n points in the plane, and b) scheduling it efficiently in the SINR model of interference. The nodes must converge on a solution in a distributed manner, having no means of communication beyond the sole wireless channel. We give distributed connectivity algorithms that run in time O(poly(log Δ, log n)), where Δ is the ratio between the longest and shortest distances among nodes. Given that algorithm without prior knowledge of the instance are essentially limited to using uniform power, this is close to best possible. Our primary aim, however, is to find efficient structures, measured in the number of slots used in the final schedule of the links. Our main result is algorithms that match the efficiency of centralized solutions. Specifically, the networks can be scheduled in O(log n) slots using (arbitrary) power control, and in O(log n (log log Δ + log n)) slots using a simple oblivious power scheme. Additionally, the networks have the desirable properties that the latency of a converge-cast and of any node-to-node communication is optimal O(log n) time. © 2012 acm.

关键词： Power control

来源：评论

学校读者我要写书评

暂无评论

Weak models of distributed computing, with connections to modal logic 12

Weak models of distributed computing, with connections to mo...

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Hella, Lauri Järvisalo, Matti Kuusisto, Antti Laurinharju, Juhana Lempiäinen, Tuomo Luosto, Kerkko Suomela, Jukka Virtema, Jonni School of Information Sciences University of Tampere Finland Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki Finland Department of Mathematics and Statistics University of Helsinki Finland

ISBN: (纸本)9781450314503

This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker versions of the widely-studied port-numbering model. In the port-numbering model, a node of degree d receives messages through d input ports and it sends messages through d output ports, both numbered with 1,2,...,d. In this work, VVc is the class of all graph problems that can be solved in the standard port-numbering model. We study the following subclasses of VVc: VV: Input port i and output port i are not necessarily connected to the same ***: Input ports are not numbered;algorithms receive a multiset of messages. SV: Input ports are not numbered;algorithms receive a set of messages. VB: Output ports are not numbered;algorithms send the same message to all output ports. MB: Combination of MV and VB. SB: Combination of SV and VB. Now we have many trivial containment relations, such as SB ⊆ MB ⊆ VB ⊆ VV ⊆ VVc, but it is not obvious if, e.g., either of VB ⊆ SV or SV ⊆ VB should hold. Nevertheless, it turns out that we can identify a linear order on these classes. We prove that SB MB = VB SV = MV = VV VVc. The same holds for the constant-time versions of these classes. We also show that the constant-time variants of these classes can be characterised by a corresponding modal logic. Hence the linear order identified in this work has direct implications in the study of the expressibility of modal logic. Conversely, we can use tools from modal logic to study these classes. © 2012 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed selfish load balancing with weights and speeds 12

Distributed selfish load balancing with weights and speeds

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Adolphs, Clemens P.J. Berenbrink, Petra University of British Columbia 6224 Agricultural Road Vancouver BC V6T 1Z1 Canada Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9781450314503

In this paper we consider neighborhood load balancing in the context of selfish clients. We assume that a network of n processors is given, with m tasks assigned to the processors. The processors may have different speeds and the tasks may have different weights. Every task is controlled by a selfish user. The objective of the user is to allocate his/her task to a processor with minimum load, where the load of a processor is defined as the weight of its tasks divided by its speed. We investigate a concurrent probabilistic protocol which works in sequential rounds. In each round every task is allowed to query the load of one randomly chosen neighboring processor. If that load is smaller than the load of the task's current processor, the task will migrate to that processor with a suitably chosen probability. Using techniques from spectral graph theory we obtain upper bounds on the expected convergence time towards approximate and exact Nash equilibria that are significantly better than previous results for this protocol. We show results for uniform tasks on non-uniform processors and the general case where the tasks have different weights and the machines have speeds. To the best of our knowledge, these are the first results for this general setting. © 2012 acm.

关键词： Speed

来源：评论

学校读者我要写书评

暂无评论

Creating mobile ad hoc workflows with Twitter 12

Creating mobile ad hoc workflows with Twitter

引用

27th annual acm symposium on Applied computing, SAC 2012

作者： Treiber, Martin Schall, Daniel Dustdar, Schahram Scherling, Christian Distributed Systems Group TU Vienna Argentinierstrasse 8 A-1040 Wien Austria Ikangai Solutions Treustrasse 59/5/20 A-1220 Wien Austria

ISBN: (纸本)9781450308571

The wide-spread adoption of powerful mobile devices allows for the design of workflows while on the move. In this paper, we leverage established SOA principles towards mobility in design and execution. For this purpose, we introduce a lightweight Service workflow model that is tailored for the needs of ad-hoc creation and mobility. We show how sensor data from mobile devices can be included during the design of Service workflows and we address crowd sourcing aspects for the deployment and execution of Service workflows. We present a proof of concept prototype application that supports the creation of Service workflows on mobile devices. © 2012 Authors.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for scheduling on line and tree networks 12

Distributed algorithms for scheduling on line and tree netwo...

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Chakaravarthy, Venkatesan T. Roy, Sambuddha Sabharwal, Yogish IBM Research - India New Delhi India

ISBN: (纸本)9781450314503

We have a set of processors (or agents) and a set of graph networks defined over some vertex set. Each processor can access a subset of the graph networks. Each processor has a demand specified as a pair of vertices 〈u, v〉, along with a profit;the processor wishes to send data between u and v. Towards that goal, the processor needs to select a graph network accessible to it and a path connecting u and v within the selected network. The processor requires exclusive access to the chosen path, in order to route the data. Thus, the processors are competing for routes/channels. A feasible solution selects a subset of demands and schedules each selected demand on a graph network accessible to the processor owning the demand;the solution also specifies the paths to use for this purpose. The requirement is that for any two demands scheduled on the same graph network, their chosen paths must be edge disjoint. The goal is to output a solution having the maximum aggregate profit. Prior work has addressed the above problem in a distibuted setting for the special case where all the graph networks are simply paths (i.e, line-networks). distributed constant factor approximation algorithms are known for this case. The main contributions of this paper are twofold. First we design a distributed constant factor approximation algorithm for the more general case of tree-networks. The core component of our algorithm is a tree-decomposition technique, which may be of independent interest. Secondly, for the case of line-networks, we improve the known approximation guarantees by a factor of 5. Our algorithms can also handle the capacitated scenario, wherein the demands and edges have bandwidth requirements and capacities, respectively. © 2012 acm.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed public key schemes secure against continual leakage 12

Distributed public key schemes secure against continual leak...

引用

2012 acm symposium on principles of distributed computing, PODC'12

作者： Akavia, Adi Goldwasser, Shafi Hazay, Carmit Tel-Aviv Academic College Israel Weizmann Institute MIT United States Aarhus University Denmark

ISBN: (纸本)9781450314503

In this work we study distributed public key schemes secure against continual memory leakage. The secret key will be shared among two computing devices communicating over a public channel, and the decryption operation will be computed by a simple 2-party protocol between the devices. Similarly, the secret key shares will be periodically refreshed by a simple 2-party protocol executed in discrete time periods throughout the lifetime of the system. The leakage adversary can choose pairs, one per device, of polynomial time computable length shrinking (or entropy shrinking) functions, and receive the value of the respective function on the internal state of the respective device (namely, on its secret share, internal randomness, and results of intermediate computations). We present distributed public key encryption (DPKE) and distributed identity based encryption (DIBE) schemes that are secure against continual memory leakage, under the Bilinear Decisional Diffie-Hellman and $2$-linear assumptions. Our schemes have the following properties: 1. Our DPKE and DIBE schemes tolerate leakage at all times, including during refresh. During refresh the tolerated leakage is a (1/2-o (1),1)-fraction of the secret memory of P1, P2 respectively;and at all other times (post key generation) the tolerated leakage is a (1-o (1),1)-fraction of the secret memory of P1, P2 respectively. Our DIBE scheme tolerates leakage from both the master secret key and the identity based secret keys. Our DPKE scheme is CCA2-secure against continual memory leakage. Our DPKE scheme also implies a secure storage system on leaky devices, where a value s can be secretely stored on devices that continually leak information about their internal state to an external attacker. The devices go through a periodic refresh protocol. These properties improve on bounds and properties of known constructions designed to be secure against continual memory leakage in the single processor model. © 2012 acm.

关键词： Shrinkage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：