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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,315 篇 会议
152 篇 期刊文献
6 册 图书

馆藏范围

4,472 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,285 篇 工学
- 3,132 篇 计算机科学与技术...
- 1,644 篇 软件工程
- 413 篇 信息与通信工程
- 373 篇 电气工程
- 227 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 35 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
807 篇 理学
- 672 篇 数学
- 129 篇 统计学（可授理学、...
- 65 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 170 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

372 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
106 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
62 篇 computer network...
61 篇 concurrent compu...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
50 篇 algorithms
49 篇 application soft...
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
42 篇 edge computing

机构

48 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
12 篇 univ toronto on
12 篇 georgia inst tec...
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,425 篇 英文
44 篇 其他
4 篇 中文

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

共 4473 条记录，以下是61-70 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability 23

Asynchronous Wait-Free Runtime Verification and Enforcement ...

引用

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

作者： Castaneda, Armando Valeria Rodriguez, Gilde Univ Nacl Autonoma Mexico Inst Matemat Mexico City DF Mexico Univ Nacl Autonoma Mexico Posgrad Ciencia & Ingn Comp Mexico City DF Mexico

ISBN: (纸本)9798400701214

This paper studies the problem of verifying linearizability at runtime, where one seeks for a concurrent algorithm for verifying that the current execution of a given concurrent shared object implementation is linearizable. It shows that it is impossible to runtime verify linearizability for some common sequential objects, regardless of the consensus power of base objects. Then, it argues that actually a stronger version of the problem can be solved, if linearizability is verified indirectly. Namely, it shows that (1) linearizability of a class of concurrent implementations can be strongly verified using only read/write base objects (i.e. without the need of consensus), and (2) any implementation can be transformed to its counterpart in the class (which implements the same object) using only read/write objects too. As far as we know, this is the first runtime verification algorithm for any correctness condition that is fully asynchronous and fault-tolerant. As a by-product, a simple and generic methodology for deriving self-enforced linearizable implementations is obtained. This type implementations produce outputs that are guaranteed linearizable, and are able to produce a certificate of it, which allows the design of concurrent systems in a modular manner with accountable and forensic guarantees. These results hold not only for linearizability but for a correctness condition that includes generalizations of it such as set-linearizability and interval-linearizability.

关键词： Concurrent algorithms distributed runtime verification Enforcement Fault-tolerance Linearizability Lock-freedom Monitoring Shared memory Verification Wait-freedom

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds 23

Brief Announcement: Improved, Partially-Tight Multiplicity Q...

引用

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

作者： Anh Tran Talmage, Edward Bucknell Univ Lewisburg PA 17837 USA

ISBN: (纸本)9798400701214

A multiplicity queue is a concurrently-defined data type which relaxes the conditions of a linearizable FIFO queue by allowing concurrent Dequeue instances to return the same value. It would seem that this should allow faster message-passing implementations, as processes should not need to wait as long to learn about concurrent operations and previous work has shown that multiplicity queues are computationally less complex than the unrelaxed version. Intriguingly, recentwork has shown that there is, in fact, little possible speedup versus an unrelaxed queue. Seeking to understand this difference between intuition and real behavior, we increase the lower bound for uniform algorithms. Further, we outline a path toward building proofs for even higher lower bounds, hypothesizing that the worst-case time to Dequeue approaches maximum message delay, which is similar to the time required for an unrelaxed Dequeue We also give an upper bound for a special case to show that our bounds are tight at that point. To achieve our lower bounds, we use extended shifting arguments, which have been rarely used but allow larger lower bounds than traditional shifting arguments. We use these in series of inductive indistinguishability proofs which allow us to extend our proofs beyond the usual limitations of shifting arguments. This proof structure is an interesting contribution independently of the main result, as developing new lower bound proof techniques may have many uses in future work.

关键词： distributed Data Structures ADTs Lower Bounds Shifting Arguments Multiplicity Queues

来源：评论

学校读者我要写书评

暂无评论

System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models 24

System Optimizations for Enabling Training of Extreme Long S...

引用

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

作者： Jacobs, Sam Ade Tanaka, Masahiro Zhang, Chengming Zhang, Minjia Aminadabi, Reza Yazdani Song, Shuaiwen Leon Rajbhandari, Samyam He, Yuxiong Microsoft Inc Redmond United States

ISBN: (纸本)9798400706684

Computation in a typical Transformer-based large language model (LLM) can be characterized by batch size, hidden dimension, number of layers, and sequence length. Until now, system works for accelerating LLM training have focused on the first three dimensions: data parallelism for batch size, tensor parallelism for hidden size, and pipeline parallelism for model depth or layers. These widely studied forms of parallelism are not targeted or optimized for long sequence Transformer models. Given practical application needs for long sequence LLM, renewed attentions are being drawn to sequence parallelism. However, existing works in sequence parallelism are constrained by memory-communication inefficiency, limiting their scalability to long sequence large models. In this work, we introduce Ulysses, a novel, portable, and effective methodology for enabling highly efficient and scalable LLM training with extremely long sequence length. Ulysses at its core partitions input data along the sequence dimension and employs an efficient all-to-all collective communication for attention computation. Theoretical communication analysis shows that, whereas other methods incur communication overhead as sequence length increases, Ulysses maintains constant communication volume when sequence length and compute devices are increased proportionally. Furthermore, experimental evaluations show that Ulysses scales to more than 1 million context length and trains 2.5x faster with 4x longer sequence length than the existing method SOTA baseline. © 2024 Association for computing Machinery. All rights reserved.

关键词： AI/ML long context LLM HPC distributed training

来源：评论

学校读者我要写书评

暂无评论

The Computational Power of distributed Shared-Memory Models with Bounded-Size Registers 24

The Computational Power of Distributed Shared-Memory Models ...

引用

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

作者： Delporte-Gallet, Carole Fauconnier, Hugues Fraigniaud, Pierre Rajsbaum, Sergio Travers, Corentin IRIF University Paris Cité CNRS Paris France Irif and Instituto de Matemàticas Unam Mexico City Mexico Lis University Aix-Marseille CNRS Marseille France

ISBN: (纸本)9798400706684

The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (Jacm 1999) provided a topological characterization of the tasks that are wait-free solvable by processes communicating through writing and reading shared registers. This characterization assumes the use of full-information protocols, in which each time a process writes in the shared memory, it communicates everything it learned since the beginning of the execution. Thus, each register in the shared memory is of unbounded size. Whether unbounded size registers are unavoidable for the model of computation to be universal is the central question studied in this paper. More generally, when at most t out of n processes can crash, is the model with bounded size registers universal?We show that when 1 ≤ t 2, there exists a task that cannot be solved by n processes communicating via registers of size f(n) bits, but is solvable by n processes using unbounded registers. The case n = 2, t = 1, where 1-resilient computing and wait-free computing coincide, does not display the same behavior. We show that any task solvable by 2 processes in the wait-free shared-memory model with unbounded-size registers can be solved by 2 processes in the wait-free shared-memory model with constant size ***, we consider the iterated shared memory model, which has played a crucial role since Herlihy and Shavit's characterization. We show that 1-bit registers (per iteration) are sufficient for solving wait-free any task that is solvable by a full-information wait-free protocol. Therefore, while the wait-free read/write shared-memory model is known to be computationally equivalent to the iterated model, this equivalence only holds if registers are unbounded. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications 23

Efficient Distributed Decomposition and Routing Algorithms i...

引用

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

作者： Chang, Yi-Jun Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9798400701214

In the LOCAL model of distributed computing, low-diameter decomposition is an extremely useful tool in designing algorithms, as it allows us to shift from the general graph setting to the low-diameter graph setting, where brute-force information gathering can be done efficiently. Chang and Su [PODC 2022] showed that any high-conductance network excluding a fixed minor contains a high-degree vertex upsilon(star), so the entire graph topology can be gathered to upsilon(star) efficiently in the CONGEST model using expander routing. Therefore, in networks excluding a fixed minor, many problems that can be solved efficiently in LOCAL via low-diameter decomposition can also be solved efficiently in CONGEST via expander decomposition. In this work, we show improved decomposition and routing algorithms for networks excluding a fixed minor. We define an (is an element of,D, T)-decomposition of G = (V,E) as a partition of.. into clusters of diameter at most D with at most is an element of |E| inter-cluster edges such that information gathering in each cluster can be done in T rounds in parallel. We show that an (is an element of,D, T)-decomposition with D = O (is an element of(-1)) and T = min {2(O (log2 1/is an element of)) center dot O(log Delta), poly(is an element of(-1), log Delta)} can be computed deterministically in O (is an element of(- 1) log*n) + min {2(O (log2 1/is an element of)) center dot O(log Delta), poly(is an element of(-1), log Delta)} rounds in networks excluding a fixed minor in the CONGEST model. Our algorithm has a wide range of applications, including the following results in CONGEST. center dot A (1 -is an element of)-approximate maximum independent set in a network excluding a fixed minor can be computed deterministically in O (is an element of(-1) log*n) + poly(is an element of(-1)) rounds, nearly matching the Omega(is an element of(-1) log*n) lower bound of Lenzen and Wattenhofer [DISC 2008]. center dot Property testing of any additive minor-close

关键词： distributed approximation expander decomposition property testing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Unconstrained Local Search for Multilevel Graph Partitioning 24

Brief Announcement: Distributed Unconstrained Local Search f...

引用

36th acm symposium on Parallelism in Algorithms and Architectures (SPAA)

作者： Sanders, Peter Seemaier, Daniel Karlsruhe Inst Technol Karlsruhe Germany

ISBN: (纸本)9798400704161

Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a fundamental problem in computer science with numerous practical applications. While shared-memory parallel partitioners have recently matured to achieve the same quality as widely used sequential partitioners, there is still a pronounced quality gap between distributed partitioners and their sequential counterparts. In this work, we shrink this gap considerably by describing the engineering of an unconstrained local search algorithm suitable for distributed partitioners. We integrate the proposed algorithm in a distributed multilevel partitioner. Our extensive experiments show that the resulting algorithm scales to thousands of PEs while computing cuts that are, on average, only 3.5% larger than those of a state-of-the-art high-quality shared-memory partitioner. Compared to previous distributed partitioners, we obtain on average 6.8% smaller cuts than the best-performing competitor while being more than 9 times faster.

关键词： graph partitioning distributed algorithms parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

No distributed Quantum Advantage for Approximate Graph Coloring 2024

No Distributed Quantum Advantage for Approximate Graph Color...

引用

56th Annual acm symposium on Theory of computing (STOC)

作者： Coiteux-Roy, Xavier d'Amore, Francesco Gajjala, Rishikesh Kuhn, Fabian Le Gall, Francois Lievonen, Henrik Modanese, Augusto Renou, Marc-Olivier Schmid, Gustav Suomela, Jukka Tech Univ Munich Munich Germany Munich Ctr Quantum Sci & Technol Munich Germany Aalto Univ Espoo Finland Bocconi Univ BIDSA Milan Italy Univ Freiburg Freiburg Germany Nagoya Univ Nagoya Aichi Japan Inria Paris France Univ Paris Saclay Paris France Inst Polytech Paris Palaiseau France

ISBN: (纸本)9798400703836

We give an almost complete characterization of the hardness of c-coloring chi-chromatic graphs with distributed algorithms, for a wide range of models of distributed computing. In particular, we show that these problems do not admit any distributed quantum advantage. To do that: (1) We give a new distributed algorithm that finds a 2 -coloring in j -chromatic graphs in (O) over tilde (n(1/alpha)) rounds, with a = left perpendicularc-1/chi-1right perpendicular. (2) We prove that any distributed algorithm for this problem requires Omega(n(1/alpha)) rounds. Our upper bound holds in the classical, deterministic LOCAL model, while the near-matching lower bound holds in the non-signaling model. This model, introduced by Arfaoui and Fraigniaud in 2014, captures all models of distributed graph algorithms that obey physical causality;this includes not only classical deterministic LOCAL and randomized LOCAL but also quantum-LOCAL, even with a pre-shared quantum state. We also show that similar arguments can be used to prove that, e.g., 3-coloring 2-dimensional grids or 2-coloring trees remain hard problems even for the non-signaling model, and in particular do not admit any quantum advantage. Our lower-bound arguments are purely graph-theoretic at heart;no background on quantum information theory is needed to establish the proofs.

关键词： distributed computing graph coloring non-signaling model quantum advantage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：