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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,334 篇 会议
55 篇 期刊文献
1 册 图书

馆藏范围

1,390 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,075 篇 工学
- 1,046 篇 计算机科学与技术...
- 460 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 77 篇 控制科学与工程
- 41 篇 网络空间安全
- 19 篇 电子科学与技术（可...
- 9 篇 农业工程
- 7 篇 建筑学
- 7 篇 化学工程与技术
- 6 篇 机械工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 仪器科学与技术
302 篇 理学
- 274 篇 数学
- 67 篇 统计学（可授理学、...
- 17 篇 物理学
- 11 篇 系统科学
- 9 篇 生物学
- 8 篇 化学
- 4 篇 大气科学
71 篇 管理学
- 39 篇 管理科学与工程(可...
- 33 篇 图书情报与档案管...
- 24 篇 工商管理
12 篇 经济学
- 12 篇 应用经济学
12 篇 教育学
- 12 篇 教育学
9 篇 法学
- 7 篇 社会学
9 篇 农学
- 9 篇 作物学
1 篇 医学

主题

243 篇 distributed comp...
92 篇 distributed algo...
82 篇 distributed comp...
33 篇 distributed algo...
31 篇 consensus
29 篇 distributed syst...
26 篇 cloud computing
25 篇 algorithms
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 fault tolerance
20 篇 local model
20 篇 distributed grap...
19 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 randomized algor...
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
15 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 tel aviv univ te...
10 篇 natl univ singap...
9 篇 ben gurion univ ...
9 篇 technion dept co...
9 篇 aalto univ espoo
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 carnegie mellon ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 cnrs
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...

作者

24 篇 kuhn fabian
20 篇 ghaffari mohsen
17 篇 raynal michel
17 篇 elkin michael
17 篇 censor-hillel ke...
16 篇 suomela jukka
16 篇 fraigniaud pierr...
15 篇 wattenhofer roge...
15 篇 pandurangan gopa...
14 篇 peleg david
14 篇 toueg sam
14 篇 rajsbaum sergio
14 篇 kutten shay
14 篇 brandt sebastian
13 篇 patt-shamir boaz
13 篇 guerraoui rachid
12 篇 chang yi-jun
12 篇 balliu alkida
12 篇 maus yannic
12 篇 olivetti dennis

语言

1,382 篇 英文
7 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2013 ACM symposium on Principles of distributed computing"

共 1390 条记录，以下是211-220 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

2021 Edsger W. Dijkstra Prize in distributed computing 21

2021 Edsger W. Dijkstra Prize in Distributed Computing

引用

proceedings of the 2021 acm symposium on principles of distributed computing

作者： Keren Censor-Hillel Pierre Fraigniaud Cyril Gavoille Seth Gilbert Andrzej Pelc David Peleg Technion Haifa Israel Université de Paris & CNRS Paris France LaBRI - Université de Bordeaux Bordeaux France National University of Singapore Singapore Singapore Université du Québec en Outaouais Gatineau PQ Canada Weizmann Institute of Science Rehovot Israel

No abstract available.

ISBN: (纸本)9781450385480

No abstract available.

关键词： edsgerw. dijkstra prize distributed computing

来源：评论

学校读者我要写书评

暂无评论

Noisy Beeps 20

Noisy Beeps

引用

39th symposium on principles of distributed computing

作者： Efremenko, Klim Kol, Gillat Saxena, Raghuvansh R. Ben Gurion Univ Negev Beer Sheva Israel Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450375825

We study the effect of noise on the n-party beeping model. In this model, in every round, each party may decide to either 'beep' or not. All parties hear a beep if and only if at least one party beeps. The beeping model is becoming increasingly popular, as it offers a very simple abstraction of wireless networks and is very well suited for studying biological phenomena. Still, the noise resilience of the beeping model is yet to be understood. Our main result is a lower bound, showing that making protocols in the beeping model resilient to noise may have a large performance overhead. Specifically, we give a protocol that works over the (noiseless) beeping model, and prove that any scheme that simulates this protocol over the beeping model with correlated stochastic noise will blow up the number of rounds by an O(logn) multiplicative factor. We complement this result by a matching upper bound, constructing a noise-resilient simulation scheme with O(logn) overhead for any noiseless beeping protocol.

关键词： Communication Complexity Beeping Models Lower Bounds Interactive Coding Error-Correcting Codes distributed Systems

来源：评论

学校读者我要写书评

暂无评论

Teaching distributed computing Fundamentals using Raspberry Pi Clusters 2022

Teaching Distributed Computing Fundamentals using Raspberry ...

引用

proceedings of the 53rd acm Technical symposium on Computer Science Education V. 2

作者： Elizabeth Shoop Richard Brown Joel Adams Suzanne Matthews Macalester College Saint Paul MN USA St. Olaf College Northfield MN USA Calvin University Grand Rapids MI USA United States Military Academy West Point NY USA

ISBN: (纸本)9781450390712

The 2019 ABET computer science criteria requires that all computing students learn parallel and distributed computing (PDC) as undergraduates, and CS2013 recommends at least fifteen hours of PDC in the undergraduate curriculum. Consequently, many educators are looking for easy ways to integrate PDC into courses at their institutions. This hands-on workshop introduces Message Passing Interface (MPI) basics in Python or C/C++ using clusters of Raspberry Pi single-board computers. MPI is a multi-language, platform independent, industry-standard library for PDC. Raspberry Pis are an inexpensive and engaging hardware platform for studying PDC as early as CS1. Participants will experience how to teach distributed computing essentials with MPI by means of reusable, effective "parallel patterns," including single program multiple data (SPMD) execution, send-receive message passing, and parallel loop patterns. No prior experience with MPI, PDC, or the Raspberry Pi is expected; participants will explore short programs designed to help students understand MPI basics, plus longer "exemplar" programs that use MPI to solve significant applied problems. The workshop includes: (i) personal experience with the Raspberry Pi (clusters provided); (ii) instructions on how to deploy Raspberry Pi clusters quickly in the classroom; (iii) self-paced hands-on experimentation with MPI programs; and (iv) a discussion of how to use Raspberry Pi clusters to align courses with CS2013 and ABET. All materials from this workshop are available from ***; participants should bring a laptop to access materials and connect to the Raspberry Pi clusters.

关键词： message passing parallel and distributed computing cluster computing undergraduate parallel computing pdc & education raspberry pi cluster

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for distributed Sketching of Maximal Matchings and Maximal Independent Sets 20

Lower Bounds for Distributed Sketching of Maximal Matchings ...

引用

39th symposium on principles of distributed computing

作者： Assadi, Sepehr Kol, Gillat Oshman, Rotem Rutgers State Univ Piscataway NJ 08854 USA Princeton Univ Princeton NJ 08544 USA Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450375825

Consider the following distributed graph sketching model: There is a referee and n vertices in an undirected graph G sharing public randomness. Each vertex v only knows its neighborhood in G and the referee receives no input initially. The vertices simultaneously each sends a message, called a sketch, to the referee who then based on the received sketches outputs a solution to some combinatorial problem on G, say, the minimum spanning tree problem. Previous work on graph sketching have shown that numerous problems, including connectivity, minimum spanning tree, edge or vertex connectivity, cut or spectral sparsifiers, and (Delta+1)-vertex coloring, all admit efficient algorithms in this model that only require sketches of size polylog(n) per vertex. In contrast, we prove that the two fundamental problems of maximal matching and maximal independent set do not admit such efficient solutions: Any algorithm for either problem that errs with a small constant probability requires sketches of size Omega(n(1/2-epsilon)) for any constant epsilon > 0. We prove our results by analyzing communication complexity of these problems in a communication model that allows sharing of inputs between limited number of players, and hence lies between the standard number-in-hand and number-on-forehead multi-party communication models. Our proofs are based on a family of hard instances using Ruzsa-Szemeredi graphs and information-theoretic arguments to establish the communication lower bounds.

关键词： distributed sketching maximal matching maximal independent set communication complexity broadcast congested clique

来源：评论

学校读者我要写书评

暂无评论

DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead 20

DConstructor: Efficient and Robust Network Construction with...

引用

39th symposium on principles of distributed computing

作者： Gilbert, Seth Pandurangan, Gopal Robinson, Peter Trehan, Amitabh Natl Univ Singapore Dept Comp Sci Singapore Singapore Univ Houston Dept Comp Sci Houston TX 77004 USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Loughborough Univ Dept Comp Sci Loughborough Leics England

ISBN: (纸本)9781450375825

With the rise of dynamic reconfigurable networks such as Peer-to-Peer (P2P) networks, overlay networks, ad hoc wireless and mesh networks, it has become important to construct and maintain topologies with various desirable properties (such as connectivity, low diameter, expansion, low degree etc.) in an efficient decentralized manner. The main result of this paper is a distributed protocol called DConstructor that given any (connected) network topology will "converge" to a given (desired) target topology such as an expander, hypercube, or Chord, with high probability. Our protocol is efficient, lightweight, and scalable, and it incurs only O (polylog(n)) overhead (where.. is the network size) for topology construction and maintenance: only polylogarithmic (in n) bits need to be processed and sent by each node per round, the convergence time is polylogarithmic rounds and any node's computation cost per round is also polylogarithmic. Our protocol is robust and self-repairing in the sense that it will converge to the desired topology in polylogarithmic rounds and polylogarithmic communication cost under dynamic topology changes and arbitrary insertions and deletions of nodes.

关键词： distributed Protocol Peer-to-Peer Network Randomized Algorithm Self-repairing Network Expander

来源：评论

学校读者我要写书评

暂无评论

distributed Approximation on Power Graphs 20

Distributed Approximation on Power Graphs

引用

39th symposium on principles of distributed computing

作者： Bar-Yehuda, Reuven Censor-Hillel, Keren Maus, Yannic Pai, Shreyas Pemmaraju, Sriram V. Technion Israel Inst Technol Haifa Israel Univ Iowa Iowa City IA USA

ISBN: (纸本)9781450375825

We investigate graph problems in the following setting: we are given a graph G and we are required to solve a problem on G(2). While we focus mostly on exploring this theme in the distributed CONGEST model, we also show new results and surprising connections to the centralized model of computation. In the CONGEST model, it is natural to expect that problems on G(2) would be quite difficult to solve efficiently on G, due to congestion. However, we show that the picture is both more complicated and more interesting. Specifically, we encounter two phenomena acting in opposing directions: (i) slowdown due to congestion and (ii) speedup due to structural properties of G(2). We demonstrate these two phenomena via two fundamental graph problems, namely, Minimum Vertex Cover (MVC) and Minimum Dominating Set (MDS). Among our many contributions, the highlights are the following. (1) In the CONGEST model, we show an O(n/epsilon)-round (1 + epsilon)approximation algorithm for MVC on G(2), whereas no o(n(2))round algorithm is known for any better-than-2 approximation for MVC on G. (2) We show a centralized polynomial time 5/3-approximation algorithm for MVC on G(2), whereas a better-than-2 approximation is UGC-hard for G. (3) In contrast, for MDS, in the CONGEST model, we show an (Omega) over tilde (n(2)) lower bound for a constant approximation factor for MDS on G(2), whereas an (Omega) over tilde (n(2)) lower bound for MDS on G is known only for exact computation.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：