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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,338 篇 会议
54 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

1,075 篇 工学
- 1,034 篇 计算机科学与技术...
- 459 篇 软件工程
- 158 篇 信息与通信工程
- 146 篇 电气工程
- 78 篇 控制科学与工程
- 42 篇 网络空间安全
- 16 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 农业工程
- 6 篇 仪器科学与技术
- 6 篇 建筑学
- 6 篇 生物工程
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
297 篇 理学
- 270 篇 数学
- 70 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 9 篇 化学
- 8 篇 生物学
- 6 篇 大气科学
65 篇 管理学
- 34 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
15 篇 教育学
- 15 篇 教育学
13 篇 经济学
- 13 篇 应用经济学
9 篇 法学
- 7 篇 社会学
8 篇 农学
- 8 篇 作物学
1 篇 医学

主题

249 篇 distributed comp...
96 篇 distributed algo...
77 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 local model
22 篇 algorithms
21 篇 distributed grap...
20 篇 fault tolerance
19 篇 cloud computing
17 篇 shared memory
16 篇 self-stabilizati...
15 篇 message passing
15 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
17 篇 mit cambridge ma...
16 篇 univ freiburg fr...
11 篇 tel aviv univ te...
10 篇 univ michigan an...
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 aalto univ espoo
10 篇 natl univ singap...
9 篇 ben gurion univ ...
8 篇 weizmann inst sc...
8 篇 cispa helmholtz ...
8 篇 national univers...
7 篇 ben gurion univ ...
6 篇 ecole polytech f...
6 篇 cnrs
6 篇 univ texas austi...
5 篇 georgetown univ ...
5 篇 aalto university...

作者

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

语言

1,379 篇 英文
13 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

I/O lower bounds for auto-tuning of convolutions in CNNs 21

I/O lower bounds for auto-tuning of convolutions in CNNs

引用

26th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2021

作者： Zhang, Xiaoyang Xiao, Junmin Tan, Guangming State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Science China

ISBN: (纸本)9781450382946

Convolution is the most time-consuming part in the computation of convolutional neural networks (CNNs), which have achieved great successes in numerous practical applications. Due to the complex data dependency and the increase in the amount of model samples, the convolution suffers from high overhead on data movement (i.e., memory access). This work provides comprehensive analysis and methodologies to minimize the communication for the convolution in CNNs. With an in-depth analysis of the recent I/O complexity theory under the red-blue game model, we develop a general I/O lower bound theory for a composite algorithm which consists of several different sub-computations. Based on the proposed theory, we establish the data movement lower bound results for two main convolution algorithms in CNNs, namely the direct convolution and Winograd algorithm, which represents the direct and indirect implementations of a convolution respectively. Next, derived from I/O lower bound results, we design the near I/O-optimal dataflow strategies for the two main convolution algorithms by fully exploiting the data reuse. Furthermore, in order to push the envelope of performance of the near I/O-optimal dataflow strategies further, an aggressive design of auto-tuning based on I/O lower bounds, is proposed to search an optimal parameter configuration for the direct convolution and Winograd algorithm on GPU, such as the number of threads and the size of shared memory used in each thread block. Finally, experiment evaluation results on the direct convolution and Winograd algorithm show that our dataflow strategies with the auto-tuning approach can achieve about 3.32× performance speedup on average over cuDNN. In addition, compared with TVM, which represents the state-of-the-art technique for auto-tuning, not only our auto-tuning method based on I/O lower bounds can find the optimal parameter configuration faster, but also our solution has higher performance than the optimal solution provided

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：