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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,071 篇 工学
- 1,039 篇 计算机科学与技术...
- 439 篇 软件工程
- 152 篇 信息与通信工程
- 149 篇 电气工程
- 75 篇 控制科学与工程
- 41 篇 网络空间安全
- 17 篇 电子科学与技术（可...
- 7 篇 化学工程与技术
- 6 篇 农业工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 4 篇 交通运输工程
298 篇 理学
- 272 篇 数学
- 68 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 8 篇 化学
- 7 篇 生物学
60 篇 管理学
- 32 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 19 篇 工商管理
18 篇 教育学
- 18 篇 教育学
10 篇 经济学
- 10 篇 应用经济学
10 篇 法学
- 7 篇 社会学
- 4 篇 法学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

247 篇 distributed comp...
95 篇 distributed algo...
76 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
28 篇 distributed syst...
23 篇 approximation al...
23 篇 computer systems...
23 篇 congest model
22 篇 local model
22 篇 algorithms
21 篇 fault tolerance
21 篇 distributed grap...
19 篇 cloud computing
17 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 graph algorithms
14 篇 fault-tolerance
14 篇 randomized algor...

机构

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

作者

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

语言

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

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

共 1355 条记录，以下是41-50 订阅

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

详细简洁

排序：

distributed Delta-Coloring Under Bandwidth Limitations 38

Distributed Delta-Coloring Under Bandwidth Limitations

引用

38th International symposium on distributed computing, DISC 2024

作者： Halldórsson, Magnús M. Maus, Yannic Reykjavik University Iceland TU Graz Austria

ISBN: (纸本)9783959773522

We consider the problem of coloring graphs of maximum degree ∆ with ∆ colors in the distributed setting with limited bandwidth. Specifically, we give a poly log log n-round randomized algorithm in the CONGEST model. This is close to the lower bound of Ω(log log n) rounds from [Brandt et al., STOC’16], which holds also in the more powerful LOCAL model. The core of our algorithm is a reduction to several special instances of the constructive Lovász local lemma (LLL) and the deg + 1-list coloring problem. © Magnús M. Halldórsson and Yannic Maus.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

A Near-Optimal Deterministic distributed Synchronizer 23

A Near-Optimal Deterministic Distributed Synchronizer

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Ghaffari, Mohsen Trygub, Anton MIT Cambridge MA 02139 USA

ISBN: (纸本)9798400701214

We provide the first deterministic distributed synchronizer with near-optimal time complexity and message complexity overheads. Concretely, given any distributed algorithm A that has time complexity.. and message complexity.. in the synchronous message-passing model (subject to some care in defining the model), the synchronizer provides a distributed algorithm A' that runs in the asynchronous message-passing model with time complexity T . poly(log n) and message complexity (M + m) . poly(log n). Here, n and m denote the number of nodes and edges in the network, respectively. The synchronizer is deterministic in the sense that if algorithm A is deterministic, then so is algorithm A'. Previously, only a randomized synchronizer with near-optimal overheads was known by seminal results of Awerbuch, Patt-Shamir, Peleg, and Saks [STOC 1992] and Awerbuch and Peleg [FOCS 1990]. We also point out and fix some inaccuracies in these prior works. As concrete applications of our synchronizer, we resolve some longstanding and fundamental open problems in distributed algorithms: we get the first asynchronous deterministic distributed algorithms with near-optimal time and message complexities for leader election, breadth-first search tree, and minimum spanning tree computations: these all have message complexity (O) over tilde (m) message complexity. The former two have (O) over tilde (D) time complexity, where D denotes the network diameter, and the latter has (O) over tilde (D + root n) time complexity. All these bounds are optimal up to logarithmic factors. Previously all such near-optimal algorithms were either restricted to the synchronous setting or required randomization.

关键词： synchronizer asynchronous algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: On the Limits of Information Spread by Memory-less Agents 24

Brief Announcement: On the Limits of Information Spread by M...

引用

43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024

作者： D'Archivio, Niccolò Vacus, Robin Coati Inria d'Université Côte d'Azur Sophia Antipolis France Bocconi Institute for Data Science and Analytics Milan Italy

ISBN: (纸本)9798400706684

We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifically, a group of n agents is required to adopt the correct opinion, initially held by a single informed individual, choosing from two possible opinions. In order to make decisions, agents are restricted to observing the opinions of a few randomly sampled agents, and lack the ability to communicate further and to identify the informed individual. Additionally, agents cannot retain any information from one round to the next. According to a recent publication in SODA (2024), a logarithmic convergence time without memory is achievable in the parallel setting (where agents are updated simultaneously), as long as the number of samples is at least(Formula presented.). However, determining the minimal sample size for an efficient protocol to exist remains a challenging open question. As a preliminary step towards an answer, we establish the first lower bound for this problem in the parallel setting. Specifically, we demonstrate that it is impossible for any memory-less protocol with constant sample size, to converge with high probability in less than an almost-linear number of rounds. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Decreasing Verification Radius in Local Certification 38

Brief Announcement: Decreasing Verification Radius in Local ...

引用

38th International symposium on distributed computing, DISC 2024

作者： Křišťan, Jan Matyáš Sedláček, Josef Erik Faculty of Information Technology Czech Technical University Prague Czech Republic

ISBN: (纸本)9783959773522

This paper deals with local certification, specifically locally checkable proofs: given a graph property, the task is to certify whether a graph satisfies the property. The verification of this certification needs to be done locally without the knowledge of the whole graph. We examine the trade-off between the visibility radius and the size of certificates. We describe a procedure that decreases the radius by encoding the neighbourhood of each vertex into its certificate. We also provide a corresponding lower bound on the required certificate size increase, showing that such an approach is close to optimal. © Jan Matyáš Křišťan and Josef Erik Sedláček.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Discrete Incremental Voting 23

Brief Announcement: Discrete Incremental Voting

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Cooper, Colin Radzik, Tomasz Shiraga, Takeharu Kings Coll London London England Chuo Univ Tokyo Japan

ISBN: (纸本)9798400701214

We consider a type of pull voting suitable for discrete numeric opinions which can be compared on a linear scale, for example, 1 ('disagree strongly'), 2 ('disagree'), . . . , 5 ('agree strongly'). On observing the opinion of a random neighbour, a vertex changes its opinion incrementally towards the value of the neighbour's opinion, if different. For opinions drawn from a set {1, 2, . . . , k}, the opinion of the vertex would change by +1 if the opinion of the neighbour is larger, or by -1, if it is smaller. It is not clear how to predict the outcome of this process, but we observe that the total weight of the system, that is, the sum of the individual opinions of all vertices, is a martingale. This allow us analyse the outcome of the process on some classes of dense expanders such as clique graphs k(n) and random graphs G(n,p) for suitably large p. If the average of the original opinions satisfies i <= c <= i + 1 for some integer i, then the asymptotic probability that opinion i wins is i + 1 - c, and the probability that opinion i + 1 wins is c - i. With high probability, the winning opinion cannot be other than i or i + 1. To contrast this, we show that for a path and opinions 0, 1, 2 arranged initially in non-decreasing order along the path, the outcome is very different. Any of the opinions can win with constant probability, provided that each of the two extreme opinions 0 and 2 is initially supported by a constant fraction of vertices.

关键词： Random distributed processes Pull voting

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Annual acm symposium on principles of distributed computing

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

引用

2018 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating Algorithms for distributed Systems, ApPLIED 2018, co-located with the 37th acm symposium on the principles of distributed computing, PODC 2018

ISBN: (纸本)9781450357753

The proceedings contain 9 papers. The topics discussed include: saying what you mean;towards reproducible evaluation of large-scale distributed systems;turn of the carousel – what does edge computing change for distributed applications?: research statement;towards a more reliable store-and-forward protocol for mobile text messages;logical clocks are not fair: what is fair? a case study of high-level language and optimization;an analysis of quorum-based abstractions: a case study using gorums to implement raft;data distribution method for fast giga-scale hologram generation on a multi-GPU cluster;language semantics driven design and formal analysis for distributed cyber-physical systems;and Partisan: enabling real-world protocol evaluation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

POSTER: Pattern-Aware Sparse Communication for Scalable Recommendation Model Training 24

POSTER: Pattern-Aware Sparse Communication for Scalable Reco...

引用

29th acm SIGPLAN Annual symposium on principles and Practice of Parallel Programming (PPoPP)

作者： He, Jiaao Chen, Shengqi Zhai, Jidong Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9798400704352

Recommendation models are an important category of deep learning models whose size is growing enormous. They consist of a sparse part with TBs of memory footprint and a dense part that demands PFLOPs of computing capability to train. Unfortunately, the high sparse communication cost to re-organize data for different parallel strategies of the two parts impedes the scalability in training. Based on observations of sparse access patterns, we design a two-fold fine-grained parallel strategy to accelerate sparse communication. A performance model is built to select an optimal set of items that are replicated across all GPUs so that all-to-all communication volume is reduced, while keeping memory consumption acceptable. The all-to-all overhead is further reduced by parallel scheduling techniques. In our evaluation on 32 GPUs over real-world datasets, 2.16- 16.8x end-to-end speedup is achieved over the baselines.

关键词： distributed Deep Learning Parallelism

来源：评论

学校读者我要写书评

暂无评论

From distributed Algorithms to Machine Learning and Back 23

From Distributed Algorithms to Machine Learning and Back

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

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

ISBN: (纸本)9798400701214

In the realm of computer science, it may seem that distributed computing and machine learning exist on opposite ends of the spectrum. However, there are many connections between the two domains, both in theory and practice. Recently, machine learning research has become excited about graphs. And when machine learning meets graphs, researchers familiar with distributed algorithms may experience a sense of deja vu, as many classic distributed computing paradigms are being rediscovered. It feels a bit like "machine learning + graphs = distributed algorithms." In my talk, I am going to introduce some key concepts in graph machine learning such as underreaching and oversquashing. These concepts have been known in the distributed computing community as local and congest, respectively. In the main part of the talk, I am going to present some recent breakthroughs in this exciting intersection of fields. Finally, I will also present some intriguing open problems.

关键词： Graph neural networks distributed computing networks algorithms

来源：评论

学校读者我要写书评

暂无评论

Swiper: a new paradigm for efficient weighted distributed protocols 24

Swiper: a new paradigm for efficient weighted distributed pr...

引用

43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024

作者： Tonkikh, Andrei Freitas, Luciano Ltci Télécom Paris Institut Polytechnique de Paris Palaiseau France

ISBN: (纸本)9798400706684

The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction fn of parties can be corrupted by the adversary. However, due to the infamous Sybil attack, nominal models are not sufficient to express the trust assumptions in open (i.e., permissionless) settings. Instead, permissionless systems typically operate in a weighted model, where each participant is associated with a weight and the adversary can corrupt a set of parties holding at most a fraction fw of the total *** this paper, we suggest a simple way to transform a large class of protocols designed for the nominal model into the weighted model. To this end, we formalize and solve three novel optimization problems, which we collectively call the weight reduction problems, that allow us to map large real weights into small integer weights while preserving the properties necessary for the correctness of the protocols. In all cases, we manage to keep the sum of the integer weights to be at most linear in the number of parties, resulting in extremely efficient protocols for the weighted model. Moreover, we demonstrate that, on weight distributions that emerge in practice, the sum of the integer weights tends to be far from the theoretical worst case and, sometimes, even smaller than the number of ***, for some protocols, our transformation requires an arbitrarily small reduction in resilience (i.e., fw = fn - ϵ), surprisingly, for many important problems, we manage to obtain weighted solutions with the same resilience (fw = fn) as nominal ones. Notable examples include erasure-coded distributed storage and broadcast protocols, verifiable secret sharing, and asynchronous consensus. Although there are ad-hoc weighted solutions to some of these problems, the protocols yielded by our transformations enjoy all the benefits of nominal solutions, including simplicity, efficiency, and a wider range of possible cryptographic assumpt

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

On the Power of Quantum distributed Proofs 24

On the Power of Quantum Distributed Proofs

引用

43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024

作者： Hasegawa, Atsuya Kundu, Srijita Nishimura, Harumichi The University of Tokyo Japan The Institute for Quantum Computing University of Waterloo Canada Nagoya University Japan

ISBN: (纸本)9798400706684

Quantum nondeterministic distributed computing was recently introduced as dQMA (distributed quantum Merlin-Arthur) protocols by Fraigniaud, Le Gall, Nishimura and Paz (ITCS 2021). In dQMA protocols, with the help of quantum proofs and local communication, nodes on a network verify some global property of the network. Fraigniaud et al. showed that, when the network size is small, there exists an exponential separation in proof size between distributed classical and quantum verification protocols, for the equality problem, where the verifiers check if all the data owned by a subset of them are identical. In this paper, we further investigate and characterize the power of the dQMA protocols for various decision ***, we give a more efficient dQMA protocol for the equality problem with a simpler analysis. This is done by adding a symmetrization step on each node and exploiting properties of the permutation test, which is a generalization of the SWAP test. We also show a quantum advantage for the equality problem on path networks still persists even when the network size is large, by considering "relay points"between extreme ***, we show that even in a general network, there exist efficient dQMA protocols for the ranking verification problem, the Hamming distance problem, and more problems that derive from efficient quantum one-way communication protocols. Third, in a line network, we construct an efficient dQMA protocol for any problem that has an efficient two-party QMA communication ***, we obtain the first lower bounds on the proof and communication cost of dQMA protocols. To prove a lower bound on the equality problem, we show any dQMA protocol with an entangled proof between nodes can be simulated with a dQMA protocol with a separable proof between nodes by using a QMA communication-complete problem introduced by Raz and Shpilka (CCC 2004). © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：