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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Uncertainty principles, Extractors, and Explicit Embeddings of L2 into L1 07

Uncertainty Principles, Extractors, and Explicit Embeddings ...

引用

39th Annual ACM symposium on theory of computing

作者： Indyk, Piotr MIT Cambridge MA 02139 USA

We give an explicit construction of a constant distortion embedding F of l(2)(n) into l(1)(m), with m = n(1+o(1)). As a bonus, our embedding also has good computational properties: for any input x, Fx can be computed ... 详细信息

ISBN: (纸本)9781595936318

关键词： Norm embeddings uncertainty principles extractors

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement 20

Brief Announcement: Collect in the Presence of Continuous Ch...

引用

39th symposium on principles of distributed computing

作者： Attiya, Hagit Kumari, Sweta Somani, Archit Welch, Jennifer L. Technion Haifa Israel Texas A&M Univ College Stn TX 77843 USA

ISBN: (纸本)9781450375825

A popular programming technique that contributes to designing provably-correct distributed applications is to use shared objects for interprocess communication, instead of more low-level techniques. Although shared objects are a convenient abstraction, they are not generally provided in large-scale distributed systems; instead, the processes keep individual copies of the data and communicate by sending messages to keep the copies consistent. Traditional distributed computing considers a static system, with known bounds on the number of fixed computing nodes and the number of possible failures. Dynamic distributed systems allow nodes to enter and leave the system at will, either due to failures and recoveries, moving in the real world, or changes to the systems' composition. Motivating applications include those in peer-to-peer, sensor, mobile, and social networks, as well as server farms.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta 20

Distributed Edge Coloring in Time Quasi-Polylogarithmic in D...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Kuhn, Fabian Olivetti, Dennis Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450375825

the problem of coloring the edges of an n-node graph of maximum degree. with 2 Delta - 1 colors is one of the key symmetry breaking problems in the area of distributed graph algorithms. While there has been a lot of progress towards the understanding of this problem, the dependency of the running time on. has been a long-standing open question. Very recently, Kuhn [SODA '20] showed that the problem can be solved in time 2O(root log Delta) + O(log* n). In this paper, we study the edge coloring problem in the distributed LOCAL model. We show that the (degree + 1)-list edge coloring problem, and thus also the (2 Delta- 1)-edge coloring problem, can be solved deterministically in time 2(O(log2 log Delta))+ O(log* n). this is a significant improvement over the result of Kuhn [SODA '20].

关键词： LOCAL model graph problems graph coloring edge coloring

来源：评论

学校读者我要写书评

暂无评论

Grid computing at the Undergraduate Level: Can We Do It? 08

Grid Computing at the Undergraduate Level: Can We Do It?

引用

39th ACM Technical symposium on Computer Science Education

作者： Mache, Jens Apon, Amy Feilhauer, thomas Wilkinson, Barry Lewis & Clark Coll Dept Math Sci Portland OR 97219 USA

ISBN: (纸本)9781595939470

In 2003, MIT Technology Review listed Grid computing as one of "Ten Emerging Technologies that Will Change the World" [5]. Five years later, is Grid computing ready for the undergraduate classroom? In this panel, a group of educators share their experiences in teaching Grid computing over the past several years and in various settings, and discuss how the subject materials should be developed for the future. Key points under discussion include the place in the undergraduate curriculum, the role of programming exercises, bottom-up versus top-down approaches, and the necessary Grid computing platform. this panel will be of interest to those who teach the subject, and those who wish to introduce Grid computing into their programs. It will also interest those who do not want to offer a full Grid computing course but may wish to introduce Grid computing into existing distributed systems, networking, or parallel programming courses.

关键词： distributed computing Grid computing Globus Networking

来源：评论

学校读者我要写书评

暂无评论

Distance-2 Coloring in the CONGEST Model 20

Distance-2 Coloring in the CONGEST Model

引用

39th symposium on principles of distributed computing

作者： Halldorsson, Magnus M. Kuhn, Fabian Maus, Yannic Reykjavik Univ ICE TCS Reykjavik Iceland Reykjavik Univ Dept Comp Sci Reykjavik Iceland Univ Freiburg Freiburg Germany Technion Israel Inst Technol Haifa Israel

ISBN: (纸本)9781450375825

We give efficient randomized and deterministic distributed algorithms for computing a distance-2 vertex coloring of a graph G in the CONGEST model. In particular, if Delta is the maximum degree of G, we show that there is a randomized CONGEST model algorithm to compute a distance-2 coloring of G with Delta(2) + 1 colors in O(log Delta . log n) rounds. Further if the number of colors is slightly increased to (1 + epsilon)Delta(2) for some epsilon > 1/polylog n, we show that it is even possible to compute a distance-2 coloring deterministically in polylog n time in the CONGEST model. Finally, we give a O(Delta(2) + log* n)-round deterministic CONGEST algorithm to compute distance-2 coloring with Delta(2) + 1 colors.

关键词： CONGEST model distributed graph coloring distance-2 coloring power graph

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Byzantine Agreement with Unknown Participants and Failures 20

Brief Announcement: Byzantine Agreement with Unknown Partici...

引用

39th symposium on principles of distributed computing

作者： Khanchandani, Pankaj Wattenhofer, Roger Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450375825

A set of participants that want to agree on a common opinion despite the presence of malicious or Byzantine participants need to solve an instance of a Byzantine agreement problem. this classic problem has been well studied but most of the existing solutions assume that the participants are aware of n - the total number of participants in the system - and f - the upper bound on the number of Byzantine participants. In this paper, we examine a synchronous system with Byzantine faults where the participants are neither aware of n nor f. the participants have unique identifiers, which are not necessarily consecutive. For such a system, we give algorithms for rotor-coordinator and consensus, both with the resiliency of n > 3f, which is also the optimal resiliency for solving consensus when the participants know n and f. thus, resiliency is unaffected even if the Byzantine participants can lie about n and f.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Classification of distributed Binary Labeling Problems* 20

Brief Announcement: Classification of Distributed Binary Lab...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Brandt, Sebastian Efron, Yuval Hirvonen, Juho Maus, Yannic Olivetti, Dennis Suomela, Jukka Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland Technion Haifa Israel Aalto Univ Espoo Finland

ISBN: (纸本)9781450375825

We present a complete classification of the deterministic distributed time complexity for a family of graph problems: binary labeling problems in trees in the usual LOCAL model of distributed computing. these are locally checkable problems that can be encoded with an alphabet of size two in the edge labeling formalism. Examples of binary labeling problems include sinkless orientation, sinkless and sourceless orientation, 2-vertex coloring, and perfect matching. We show that the complexity of any such problem is in one of the following classes: O(1), theta(log n), theta(n), or unsolvable. Furthermore, given the description of any binary labeling problem, we can easily determine in which of the four classes it is and what is an asymptotically optimal algorithm for solving it.

关键词： LOCAL model graph problems locally checkable labeling problems distributed computational complexity

来源：评论

学校读者我要写书评

暂无评论

How much does randomness help with locally checkable problems? 20

How much does randomness help with locally checkable problem...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Brandt, Sebastian Olivetti, Dennis Suomela, Jukka Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland Aalto Univ Espoo Finland

ISBN: (纸本)9781450375825

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are examples of LCLs. On the one hand, it is known that some LCLs benefit exponentially from randomness-for example, any deterministic distributed algorithm that finds a sinkless orientation requires theta(logn) rounds in the LOCAL model, while the randomized complexity of the problem is theta(log logn) rounds. On the other hand, there are also many LCLs in which randomness is useless. Previously, it was not known whether there are any LCLs that benefit from randomness, but only subexponentially. We show that such problems exist: for example, there is an LCL with deterministic complexity theta(log(2) n) rounds and randomized complexity T(logn log logn) rounds.

关键词： locally checkable labeling problems LOCAL model distributed computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Analysis on Fast Implementations of distributed Multi-writer Atomic Registers 20

Fine-grained Analysis on Fast Implementations of Distributed...

引用

39th symposium on principles of distributed computing

作者： Huang, Kaile Huang, Yu Wei, Hengfeng Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450375825

distributed multi-writer atomic registers are at the heart of a large number of distributed algorithms. While enjoying the benefits of atomicity, researchers further explore fast implementations of atomic reigsters which are optimal in terms of data access latency. though it is proved that multi-writer atomic register implementations are impossible when both read and write are required to be fast, it is still open whether implementations are impossible when only write or read is required to be fast. this work proves the impossibility of fast write implementations based on a series of chain arguments among indistiguishable executions. We also show the necessary and sufficient condition for fast read implementations by extending the results in the single-writer case. this work concludes a series of studies on fast implementations of distributed atomic registers.

关键词： atomicity fast implementation impossibility result chain argument

来源：评论

学校读者我要写书评

暂无评论

Cluster computing for Web-Scale Data Processing 08

Cluster Computing for Web-Scale Data Processing

引用

39th ACM Technical symposium on Computer Science Education

作者： Kimball, Aaron Michels-Slettvet, Sierra Bisciglia, Christophe Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)9781595939470

In this paper we present the design of a modem course in cluster computing and large-scale data processing. the defining differences between this and previously published designs are its focus on processing very large data sets and its use of Hadoop, an open source Java-based implementation of MapReduce and the Google File System as the platform for programming exercises. Hadoop proved to be a key element for successfully implementing structured lab activities and independent design projects. through this course, offered at the University of Washington in 2007, we imparted new skills on our students, improving their ability to design systems capable of solving web-scale problems.

关键词： Education Hadoop MapReduce Clusters distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：