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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Brief Announcement: Stateless distributed Algorithms for Generalized Packing Linear Programs

Brief Announcement: Stateless Distributed Algorithms for Gen...

引用

28th annual acm symposium on principles of distributed computing

作者： Awerbuch, Baruch Fu, Zhenghua Khandekar, Rohit Johns Hopkins Univ Baltimore MD 21218 USA

ISBN: (纸本)9781605583969

We develop a framework of distributed and stateless solutions for implicitly given packing linear programs, which are solved by multiple agents operating in a cooperative but uncoordinated manner. This is motivated by multi-commodity flow problems where flows can be split along possibly exponentially many paths. Compared to explicitly given packing LPs, the main challenge here lies in the exponentially (or even infinitely) many variables handled by a single agent. An efficient algorithm thus must identify a few "good" variables to update. Using a notion similar to the shortest-path-first-flow-decomposition, our algorithm discovers polynomially many variables to update in each iteration. We prove that after polynomially many rounds, the discovered variables support a near-optimal solution to the given packing LP.

关键词： distributed and stateless algorithms gradient descent fast convergence linear programming

来源：评论

学校读者我要写书评

暂无评论

Bounding the Locality of distributed Routing Algorithms

Bounding the Locality of Distributed Routing Algorithms

引用

28th annual acm symposium on principles of distributed computing

作者： Bose, Prosenjit Carmi, Paz Durocher, Stephane Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9781605583969

We examine bounds on the locality of routing. A. local routing algorithm makes a sequence of distributed forwarding decisions, each of which is made using only local information. Specifically, in addition to knowing the node for which a message is destined, an intermediate node might also know a) the subgraph corresponding to all network nodes within k hops of itself, for some value of k, b) the node from which the message originated, and c) which of its neighbours last forwarded the message. Our objective is to determine which of these parameters are necessary and/or sufficient to permit local routing as k varies on a network modelled by a connected undirected graph. In particular, we establish tight bounds on k for the feasibility of deterministic k-local routing for various combinations of these parameters, as well as corresponding bounds on dilation (the worst-case ratio of actual route length to shortest path length).

关键词： distributed algorithms local routing dilation

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Algorithms for Approximating Wireless Network Capacity

Brief Announcement: Distributed Algorithms for Approximating...

引用

28th annual acm symposium on principles of distributed computing

作者： Dinitz, Michael Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781605583969

In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distributed algorithms with provable guarantees in the physical model, and also give the first algorithms in the protocol model that do riot assume transmitters can coordinate with their neighbors in the interference graph, so every transmitter chooses whether to broadcast based purely on local events. Our techniques draw heavily from algorithmic game theory and machine learning theory, even though our goal is a distributed algorithm. Indeed, our main results allow every transmitter to run any algorithm it wants, so long as its algorithm has a learning-theoretic property known as no-regret in a game-theoretic setting.

关键词： Algorithms C.2.1 [Network architecture and design]: Wireless communication Theory

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Discovery of Large Near-Cliques

Brief Announcement: Distributed Discovery of Large Near-Cliq...

引用

28th annual acm symposium on principles of distributed computing

作者： Brakerski, Zvika Patt-Shamir, Boaz Weizmann Inst Sci Dept Comp Sci IL-76100 Rehovot Israel

ISBN: (纸本)9781605583969

Given an undirected graph and 0 <= epsilon <= 1, a set of nodes is called epsilon-near clique if all but an epsilon fraction of the pairs of nodes in the set have a link between them. We present a fast synchronous network algorithm that uses small messages and finds a near-clique. Specifically, we present a constant-tirne algorithm that finds, with constant probability of success, a linear size epsilon-near clique if there exists an epsilon(3)- near clique of linear size in the graph. The algorithm uses messages of O(log n) bits. The failure probability can be reduced to n(-Omega(1)) in O(log n) time, and the algorithm also works if the graph contains a clique of size Omega(n/log(alpha) log n) for some alpha is an element of (0, 1). Our approach is based on a new idea of adapting property testing algorithms to the distributed setting.

关键词： Clique Communication Networks Property Testing Randomized Algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Complexity Analysis and Algorithm Design for Pipeline Configuration in distributed Networks

Brief Announcement: Complexity Analysis and Algorithm Design...

引用

28th annual acm symposium on principles of distributed computing

作者： Gu, Yi Wu, Qishi Benoit, Anne Robert, Yves Univ Memphis Dept Comp Sci Memphis TN 38152 USA

ISBN: (纸本)9781605583969

Supporting high-performance computing pipelines in wide-area networks is crucial to enabling large-scale distributed scientific applications that require minimizing end-to-end delay for fast user interaction or maximizing frame rate for smooth data flow. We formulate and categorize the linear pipeline configuration problems into six classes with two mapping objectives, i.e. minimum end-to-end delay and maximum frame rate, and three network constraints, i.e. no, contiguous, and arbitrary node reuse. We design a dynamic programming-based optimal solution to the configuration problem for minimum end-to-end delay with arbitrary. node reuse and prove the NP-completeness of the rest five problems, for each of which, a heuristic algorithm based on a similar optimization procedure is proposed. Performance superiorities of these heuristics are illustrated by extensive experimental results in comparison with existing methods.

关键词： Optimization problem NP-complete end-to-end delay frame rate heuristic algorithm dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs

A Distributed Polylogarithmic Time Algorithm for Self-Stabil...

引用

28th annual acm symposium on principles of distributed computing

作者： Jacob, Riko Richa, Andrea Scheideler, Christian Schmid, Stefan Taeubig, Hanjo Tech Univ Munich Dept Comp Sci D-85748 Garching Germany

ISBN: (纸本)9781605583969

Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only needs to connect to a small number of other nodes. In contrast to static communication networks, peer-to-peer networks allow nodes to adapt their neighbor set over time in order to react to join and leave events and failures. This paper shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (variant of the) skip graph in polylogarithmic time from any initial state in which the overlay network is still weakly connected. This is an exponential improvement compared to previously known self-stabilizing algorithms for overlay networks. In addition, individual joins and leaves are handled locally and require little work.

关键词： Algorithms C.2.4 [computer-communication networks]: distributed systems F.2.2 [analysis of algorithms and problem complexity]: nonnumerical algorithms and problems Theory

来源：评论

学校读者我要写书评

暂无评论

PODC'09 - proceedings of the 2009 acm symposium on principles of distributed computing

PODC'09 - Proceedings of the 2009 ACM Symposium on Principle...

引用

2009 acm symposium on principles of distributed computing, PODC'09

ISBN: (纸本)9781605583969

The proceedings contain 59 papers. The topics discussed include: refining the way to consensus;memory models: a case for rethinking parallel languages and hardware;emerging challenges and opportunities in parallel computing: the cretaceous redux?;the life and times of a zookeeper;Cassandra - a structured storage system on a P2P network;preventing versus curing: avoiding conflicts in transactional memories;dynamic atomic storage without consensus;tight bounds for clock synchronization;load balancing without regret in the bulletin board model;concurrent imitation dynamics in congestion games;extracting quorum failure detectors;the weakest failure detector for solving k-set agreement;simple and efficient asynchronous byzantine agreement with optimal resilience;fast scalable deterministic consensus for crash failures;the forgiving graph: a distributed data structure for low stretch under adversarial attack;and a distributed polylogarithmic time algorithm for self-stabilizing skip graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed Aggregation for Data-Parallel computing: Interfaces and Implementations 09

Distributed Aggregation for Data-Parallel Computing: Interfa...

引用

22nd acm SIGOPS symposium on Operating Systems principles

作者： Yu, Yuan Gunda, Pradeep Kumar Isard, Michael Microsoft Res Mountain View CA 94043 USA

ISBN: (纸本)9781605587523

Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and it is often the most efficient available mechanism for computations such as matrix multiplication and graph traversal. Such algorithms typically require non-standard aggregations that are more sophisticated than traditional built-in database functions such as Sum and Max. As a result, the ease of programming user-defined aggregations, and the efficiency of their implementation, is of great current interest. This paper evaluates the interfaces and implementations for user-defined aggregation in several state of the art distributed computing systems: Hadoop, databases such as Oracle Parallel Server, and DryadLINQ. We show that: the degree of language integration between user-defined functions and the high-level query language has an impact on code legibility and simplicity;the choice of programming interface has a material effect on the performance of computations;some execution plans perform better than others on average;and that in order to get good performance on a variety of workloads a system must be able to select between execution plans depending on the computation. The interface and execution plan described in the Map Reduce paper, and implemented by Hadoop, are found to be among the worst-performing choices.

关键词： distributed programming cloud computing concurrency

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Lightweight Key Agreement and Digital Certificates for Wireless Sensor Networks

Brief Announcement: Lightweight Key Agreement and Digital Ce...

引用

28th annual acm symposium on principles of distributed computing

作者： Garcia-Morchon, Oscar Heer, Tobias Wehrle, Klaus Philips Res Europe Eindhoven Netherlands

ISBN: (纸本)9781605583969

Key agreement and digital certificates allow bootstrapping secure communication links and verifying identities or information. Thus, they are the cornerstone of many basic security functionalities. However, the resource-constrained nature of wireless sensor nodes limits the use of traditional solutions in wireless sensor networks. We propose a novel scheme allowing for fast, resource-friendly, and distributed key agreement and verification of information, featuring the efficiency of symmetric-key cryptography and the functionality of public-key certificates. The core idea of our system relies on the cryptographic association of identification information with polynomial shares. This concept allows the base station of a sensor network to sign node identification and configuration information such as routing addresses or access control roles. The information is signed by means of the polynomial shares distributed to nodes creating a lightweight digital certificate for each node. The proposed system operates in a fully stand-alone and distributed way, being able to perform a combined key agreement and lightweight digital certificate verification handshake within a few milliseconds with very low memory requirements.

关键词： Wireless Sensor Networks distributed Algorithms Key Establishment Digital Certificates

来源：评论

学校读者我要写书评

暂无评论

Return of the Primal-Dual: distributed Metric Facility Location

Return of the Primal-Dual: Distributed Metric Facility Locat...

引用

28th annual acm symposium on principles of distributed computing

作者： Pandit, Saurav Pemmaraju, Sriram Univ Iowa Dept Comp Sci Iowa City IA 52242 USA

ISBN: (纸本)9781605583969

In this paper we present fast, distributed approximation algorithms for the metric facility location problem in the CONGEST model, where message sizes are bounded by O(log N) bits, N being the network size. We first show how to obtain a 7-approximation in O(log m + log n) rounds via the primal-dual method: here m is the number of facilities and n is the number of clients. Subsequently, we generalize this to a k-round algorithm, that for every constant k, yields art approximation factor of O(m(2/root k) . n(3/root k)). These results answer a question posed by Moscibroda and Wattenhofer (PODC 2005). Our techniques are based on the primal-dual algorithm due to Jain and Vazirani (Jacm 2001) and a rapid randomized sparsification of graphs due to Gfeller and Vicari (PODC 2007). These results complement the results of Moscibroda and Wattenhofer (PODC 2005) for non-metric facility location and extend the results of Gehweiler et al. (SPAA 2006) for uniform metric facility location.

关键词： Facility Location Approximation Algorithms Bounded Message Size Wireless Ad-hoc Networks Unit Ball Graphs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：