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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

70 篇 会议
3 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

57 篇 工学
- 57 篇 计算机科学与技术...
- 27 篇 信息与通信工程
- 15 篇 软件工程
- 6 篇 电气工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
33 篇 理学
- 33 篇 数学
- 5 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 化学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学
1 篇 医学
- 1 篇 临床医学

主题

9 篇 distributed comp...
4 篇 local model
4 篇 computational mo...
4 篇 distributed algo...
4 篇 cloud computing
4 篇 distributed comp...
3 篇 concurrent compu...
3 篇 application soft...
3 篇 power system mod...
3 篇 grid computing
3 篇 processor schedu...
3 篇 data structures
3 篇 federated learni...
2 篇 internet of thin...
2 篇 computer science
2 篇 power system ana...
2 篇 distributed comp...
2 篇 approximation al...
2 篇 programming
2 篇 load balancing

机构

6 篇 univ freiburg fr...
5 篇 swiss fed inst t...
3 篇 technion haifa
2 篇 ibm tj watson re...
2 篇 princeton univ p...
2 篇 technion israel ...
2 篇 technion israel ...
2 篇 ben gurion univ ...
2 篇 institute of inf...
2 篇 johns hopkins un...
2 篇 univ houston dep...
2 篇 tel aviv univ te...
2 篇 fakultät für inf...
2 篇 aalto univ espoo
2 篇 faculty of infor...
1 篇 univ new mexico ...
1 篇 istituto naziona...
1 篇 nagoya univ grad...
1 篇 dept. of comput....
1 篇 orenburg state u...

作者

4 篇 kuhn fabian
4 篇 maus yannic
3 篇 balliu alkida
3 篇 elkin michael
3 篇 olivetti dennis
3 篇 brandt sebastian
2 篇 sauerwald thomas
2 篇 awerbuch baruch
2 篇 friedrich tobias
2 篇 erzsébet csuhaj-...
2 篇 kol gillat
2 篇 gairing martin
2 篇 suomela jukka
2 篇 zoltán ésik
2 篇 khandekar rohit
2 篇 martin dietzfelb...
2 篇 attiya hagit
2 篇 neiman ofer
2 篇 censor-hillel ke...
1 篇 chadha mohak

语言

74 篇 英文
1 篇 其他

检索条件"任意字段=39th Symposium on Principles of Distributed Computing"

共 75 条记录，以下是11-20 订阅

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

详细简洁

排序：

the AtLarge Vision on the Design of distributed Systems and Ecosystems 39

The AtLarge Vision on the Design of Distributed Systems and ...

引用

39th IEEE International Conference on distributed computing Systems (ICDCS)

作者： Iosup, Alexandra Versluis, Laurens Vrije Univ Amsterdam Fac Sci Dept Comp Sci Amsterdam Netherlands Vrije Univ Amsterdam Amsterdam Netherlands Delft Univ Technol Delft Netherlands

ISBN: (纸本)9781728125190

High-quality designs of distributed systems and services are essential for our digital economy and society. threatening to slow down the stream of working designs, we identify the mounting pressure of scale and complexity of (eco-)systems, of ill-defined and wicked problems, and of unclear processes, methods, and tools. We envision design itself as a core research topic in distributed systems, to understand and improve the science and practice of distributed (eco-)system design. Toward this vision, we propose the ATLARGE design framework, accompanied by a set of 8 core design principles. We also propose 10 key challenges, which we hope the community can address in the following 5 years. In our experience so far, the proposed framework and principles are practical, and lead to pragmatic and innovative designs for large-scale distributed systems.

关键词： Design distributed systems distributed ecosystems massivizing computer systems system design vision

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerance in distributed Optimization: the Case of Redundancy 20

Fault-Tolerance in Distributed Optimization: The Case of Red...

引用

39th symposium on principles of distributed computing

作者： Gupta, Nirupam Vaidya, Nitin H. Georgetown Univ Dept Comp Sci Washington DC 20057 USA

ISBN: (纸本)9781450375825

this paper considers the problem of Byzantine fault-tolerance in distributed multi-agent optimization. In this problem, each agent has a local cost function. the goal of a distributed optimization algorithm is to allow the agents to collectively compute a minimum of their aggregate cost function. We consider the case when a certain number of agents may be Byzantine faulty. Such faulty agents may not follow a prescribed algorithm, and they may send arbitrary or incorrect information regarding their local cost functions. Unless a fault-tolerance mechanism is employed, traditional distributed optimization algorithms cannot tolerate such faulty agents. A reasonable goal in presence of faulty agents is to minimize the aggregate cost of the non-faulty agents. However, we show that this goal is impossible to achieve unless the cost functions of the non-faulty agents have a minimal redundancy property. We further propose a distributed optimization algorithm that allows the non-faulty agents to obtain a minimum of their aggregate cost if the minimal redundancy property holds. the scope of our algorithm is demonstrated through distributed sensing and learning applications, which are special cases of distributed optimization.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Single-Source Shortest Paths in the CONGEST Model with Improved Bound 20

Single-Source Shortest Paths in the CONGEST Model with Impro...

引用

39th symposium on principles of distributed computing

作者： Chechik, Shiri Mukhtar, Doron Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450375825

We improve the time complexity of the single-source shortest path problem for weighted directed graphs (with non-negative integer weights) in the Broadcast CONGEST model of distributed computing. For polynomially bounded edge weights, the state-of-the-art algorithm for this problem requires (O) over tilde (min root nD(1/2), root nD(1/4) +n(3/5) + D}) rounds [Forster and Nanongkai, FOCS 2018], which is quite far from the known lower bound of (O) over tilde(root n + D) rounds [Elkin, STOC 2014];here D is the diameter of the underlying network and n is the number of vertices in it. For the approximate version of this problem, Forster and Nanongkai [FOCS 2018] obtained an upper bound of (O) over tilde (root nD(1/4) + D), and stated that achieving the same bound for the exact case remains a major open problem. In this paper we resolve the above mentioned problem by devising a new randomized algorithm for solving (the exact version of) this problem in (O) over tilde(root nD(1/4) + D) rounds. Our algorithm is based on a novel weight-modifying technique that allows us to compute bounded-hop distance approximation that preserves a certain form of the triangle inequality for the edges in the graph.

关键词： Broadcast CONGEST single-source shortest paths distributed algorithms overlay networks

来源：评论

学校读者我要写书评

暂无评论

K-set agreement bounds in round-based models through combinatorial topology 20

K-set agreement bounds in round-based models through combina...

引用

39th symposium on principles of distributed computing

作者： Shimi, Adam Castaneda, Armando Univ Toulouse IRIT Toulouse France Univ Nacl Autonoma Mexico Mexico City DF Mexico

ISBN: (纸本)9781450375825

Round-based models are very common message-passing models;combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k -set agreement. Among all the possible round-based models, we consider oblivious ones, where the constraints are given only round per round by a set of allowed graphs. And among oblivious models, we focus on closed-above ones, that is models where the set of possible graphs contains all graphs with more edges than some starting graphs. these capture intuitively the underlying structure required by some communication model, like containing a ring. We then derive lower bounds and upper bounds in one round for k-set agreement, such that these bounds are proved using combinatorial topology but stated only in terms of graph properties. these bounds extend to multiple rounds when limiting our algorithms to be oblivious - recalling only pairs of processes and initial value, not who send what and when.

关键词： distributed Computability Set-agreeement Round-based models Combinatorial Topology Lower bounds Upper Bounds

来源：评论

学校读者我要写书评

暂无评论

Efficient Deterministic distributed Coloring with Small Bandwidth 20

Efficient Deterministic Distributed Coloring with Small Band...

引用

39th symposium on principles of distributed computing

作者： Bamberger, Philipp Kuhn, Fabian Maus, Yannic Univ Freiburg Freiburg Germany Technion Haifa Israel

ISBN: (纸本)9781450375825

We show that the (degree + 1)-list coloring problem can be solved deterministically in O(D . log n . log(2) Delta) rounds in the CONGEST model, where D is the diameter of the graph, n the number of nodes, and Delta the maximum degree. Using the recent polylogarithmic-time deterministic network decomposition algorithm by Rozhon and Ghaffari [49], this implies the first efficient (i.e., poly log n-time) deterministic CONGEST algorithm for the (Delta + 1)-coloring and the (degree + 1)-list coloring problem. Previously the best known algorithm required 2(O(root log n)) rounds and was not based on network decompositions. Our techniques also lead to deterministic (degree + 1)-list coloring algorithms for the congested clique and the massively parallel computation (MPC) model. For the congested clique, we obtain an algorithm with time complexity O(log Delta . log log Delta), for the MPC model, we obtain algorithms with round complexity O(log(2) Delta) for the linear-memory regime and O(log(2) Delta + log n) for the sublinear memory regime.

关键词： deterministic vertex coloring CONGEST model massively parallel computation

来源：评论

学校读者我要写书评

暂无评论

Information Effects 12

Information Effects

引用

39th Annual ACM SIGPLAN-SIGACT symposium on principles of Programming Languages

作者： James, Roshan P. Sabry, Amr Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781450310833

Computation is a physical process which, like all other physical processes, is fundamentally reversible. From the notion of type isomorphisms, we derive a typed, universal, and reversible computational model in which information is treated as a linear resource that can neither be duplicated nor erased. We use this model as a semantic foundation for computation and show that the "gap" between conventional irreversible computation and logically reversible computation can be captured by a type-and-effect system. Our type-and-effect system is structured as an arrow metalanguage that exposes creation and erasure of information as explicit effect operations. Irreversible computations arise from interactions with an implicit information environment, thus making them a derived notion, much like open systems in Physics. We sketch several applications which can benefit from an explicit treatment of information effects, such as quantitative information-flow security and differential privacy.

关键词： Languages theory Arrows Linear logic Quantum computing Reversible logic

来源：评论

学校读者我要写书评

暂无评论

Cost-based Load Balancing of RDF Reasoning in Fog-computing Environments 24

Cost-based Load Balancing of RDF Reasoning in Fog-Computing ...

引用

39th Annual ACM symposium on Applied computing (SAC)

作者： Kokubo, Yuma Amagasa, Toshiyuki Univ Tsukuba Tsukuba Ibaraki Japan

ISBN: (纸本)9798400702433

Fog computing has attracted growing attention as a distributed computing platform for real-world problems, and semantic web technologies, including RDF (resource description framework), have been used as key enablers for semantic data processing. RDF reasoning allows us to perform high-level reasoning about real-world entities, but RDF reasoning in a distributed environment is still challenging because of the changing nature of the real world, leading to unbalanced loads among fog nodes and cloud servers. Existing distributed reasoning methods in fog computing cannot cope with such dynamism. this work proposes a dynamic load-balancing method for RDF reasoning in fog environments. Specifically, we devise a cost model of RDF reasoning considering the processing and network loads, thereby enabling balancing the load between fog nodes. We conduct a set of experiments to demonstrate the performance of the method.

关键词： Fog computing RDF reasoning load balancing IoT

来源：评论

学校读者我要写书评

暂无评论

distributed computing theory: Algorithms, Impossibility Results, Models, and Proofs 07

Distributed Computing Theory: Algorithms, Impossibility Resu...

引用

39th Annual ACM symposium on theory of computing

作者： Lynch, Nancy MIT CSAIL Cambridge MA 02139 USA

ISBN: (纸本)9781595936318

In this talk, I will recount my history of working in the area of distributed computing theory, starting nearly 30 years ago. I will describe the main contributions my collaborators and I have made, with some history and perspective. these contributions include a few algorithms, many impossibility results, a strong dose of modeling and proof methods, and a variety of applications of the theory. I will highlight one specific technical result-the well-known "Fischer, Lynch, Paterson (FLP)" result that asserts impossibility of reaching consensus in a distributed system, in the presence of failures. I will explain what it says, why it is true, and what its significance has been. Because distributed algorithms must contend with many subtleties that do not arise in simpler settings, modeling and proof methods have come to be an important part of distributed computing theory. I will describe the modeling frameworks that my collaborators and I have developed to support work on distributed algorithms. these are mainly interacting state-machine models like I/O Automata, Timed I/O Automata, and Hybrid and Probabilistic I/O Automata. One thing led to another: Having good modeling and proof methods for distributed algorithms, we found ourselves applying them to practical case studies, in diverse areas including Internet communication protocols, mobile wireless network protocols, controlled robotics and vehicle systems, security protocols, and even cellular-level biological systems. Finally, I will describe some new directions that my research group is currently pursuing. these include new interacting state-machine models that combine timed, hybrid, and probabilistic features in one framework, as well as a formal language (Tempo) and computer-supported tools for describing and analyzing systems modeled as Timed I/O Automata. And we are still working on distributed algorithms and impossibility results, but now we are focusing or) new kinds of distributed network settings: highly d

关键词： distributed computing theory

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the Annual ACM symposium on principles of distributed computing

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

39th symposium on principles of distributed computing, PODC 2020

ISBN: (纸本)9781450375825

the proceedings contain 66 papers. the topics discussed include: an adaptive approach to recoverable mutual exclusion;upper and lower bounds on the space complexity of detectable objects;long-lived snapshots with polylogarithmic amortized step complexity;from Bezout's identity to space-optimal election in anonymous memory systems;brief announcement: store-collect in the presence of continuous churn with application to snapshots and lattice agreement;brief announcement: why extension-based proofs fail;exponentially faster shortest paths in the congested clique;lower bounds for distributed sketching of maximal matchings and maximal independent sets;seeing far vs. seeing wide: volume complexity of local graph problems;computing shortest paths and diameter in the hybrid network model;revisiting asynchronous fault tolerant computation with optimal resilience;and asynchronous byzantine approximate consensus in directed networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Improved distributed Approximations for Maximum-Weight Independent Set 20

Brief Announcement: Improved Distributed Approximations for ...

引用

39th symposium on principles of distributed computing

作者： Kawarabayashi, Ken-ichi Khoury, Seri Schild, Aaron Schwartzman, Gregory NII Tokyo Japan Univ Calif Berkeley Berkeley CA USA Univ Washington Seattle WA 98195 USA JAIST Nomi Japan

ISBN: (纸本)9781450375825

We present improved algorithms for approximating maximum-weight independent set (MaxIS) in the CONGEST model. Given an input graph, let n and Delta be the number of nodes and maximum degree, respectively, and let MIS(n,Delta ) be the running time of finding a maximal independent set (MIS) in the CONGEST model. Bar-Yehuda et al. [PODC 2017] showed that there is an algorithm in the CONGEST model that finds a.-approximation for MaxIS in O ( MIS(n,Delta) log W) rounds, where.. is the maximum weight of a node in the graph, which can be as high as poly(n). Whether their algorithm is deterministic or randomized depends on the MIS algorithm that is used as a black-box. Our results: (1) A deterministic O(MIS(n, Delta)/epsilon)-round algorithm that finds a (1 + epsilon)Delta-approximation for MaxIS in the CONGEST model. (2) Arandomized ( poly( log log n)/epsilon)-round algorithm that finds, with high probability, a (1 +epsilon)Delta-approximation for MaxIS in the CONGEST model. that is, by sacrificing only a tiny fraction of the approximation guarantee, we achieve an exponential speed-up in the running time over the previous best known result.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：