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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

EDGELESS: A Software Architecture for Stateful FaaS at the Edge 24

EDGELESS: A Software Architecture for Stateful FaaS at the E...

引用

33rd International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Cicconetti, Claudio Carlini, Emanuele Hetzel, Raphael Mortier, Richard Paradell, Antonio Sauer, Markus CNR Pisa Italy Tech Univ Munich TUM Sch CIT Munich Germany Univ Cambridge Cambridge England Worldline Barcelona Spain Siemens AG Munich Germany

EDGELESS is a serverless platform targeting edge computing that supports widely distributed deployments using heterogeneous devices. We present its components, architecture, and programming model. Our working prototyp... 详细信息

ISBN: (纸本)9798400704130

关键词： serverless computing edge computing cloud-continuum resource-constrained devices

来源：评论

学校读者我要写书评

暂无评论

Even-Cycle Detection in the Randomized and Quantum CONGEST Model 24

Even-Cycle Detection in the Randomized and Quantum CONGEST M...

引用

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

作者： Fraigniaud, Pierre Luce, Maël Magniez, Frederic Todinca, Ioan Université Paris Cité CNRS IRIF Paris France Université d'Orléans INSA-Centre Val de Loire LIFO Orléans France

ISBN: (纸本)9798400706684

We show that, for every k ≥ 2, C2k-freeness can be decided in O(n1 - 1/k) rounds in the CONGEST model by a randomized Monte-Carlo distributed algorithm with one-sided error probability 1/3. This matches the best round-complexities of previously known algorithms for k ϵ {2, 3, 4, 5} by Drucker et al. [PODC'14] and Censor-Hillel et al. [DISC'20], but improves the complexities of the known algorithms for k > 5 by Eden et al. [DISC'19], which were essentially of the form Õ (n1 - 2/k2). Our algorithm uses colored BFS-explorations with threshold, but with an original global approach that enables to overcome a recent impossibility result by Fraigniaud et al. [SIROCCO'23] about using colored BFS-exploration with local threshold for detecting *** also show how to quantize our algorithm for achieving a round-complexity Õ(n1/2 - 1/2k) in the quantum setting for deciding C2k freeness. Furthermore, this allows us to improve the known quantum complexities of the simpler problem of detecting cycles of length at most 2k by van Apeldoorn and de Vos [PODC'22]. Our quantization is in two steps. First, the congestion of our randomized algorithm is reduced, to the cost of reducing its success probability too. Second, the success probability is boosted using a new quantum framework derived from sequential algorithms, namely Monte-Carlo quantum amplification. © 2024 Association for computing Machinery. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations 23

Brief Announcement: Breaking the f+1 Barrier: Executing Paym...

引用

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

作者： Bazzi, Rida Tucci-Piergiovanni, Sara Arizona State Univ Tempe AZ 85287 USA Univ Paris Saclay CEA List Palaiseau France

ISBN: (纸本)9798400701214

We consider the problem of validating payment transactions in an asynchronous system in which up to f validators are subject to Byzantine failures under the control of an adaptive adversary. It was shown that this problem can be solved without consensus by using byzantine quorum systems - requiring full-quorum validation, i.e. at least 2f + 1 validations per transaction. We show that it is possible to validate transactions in parallel with less than f validations per transaction if each transaction spends no more that a small fraction of an initial balance. Our solution relies on (k(1), k(2))-quorum systems, a novel class of quorum systems that we introduce in this paper. Under an adaptive adversary, these systems can be used to allow k(1) transactions to be validated and prevent more than k(2)' > k(2) transactions from being validated, the difference k(2)' - k(2) being dependent on the quorum system's validation slack, which we define in this paper. Using (k(1), k(2))-quorum systems, a payer can execute multiple partial spending transactions to spend a portion of its initial balance with less than full quorum validation - less than f validations per transaction - then reclaim any remaining funds using one fully validated transaction, which we call a settlement transaction.

关键词： distributed Systems Blockchain Quorums Fault Tolerance

来源：评论

学校读者我要写书评

暂无评论

Efficient Bounded Timestamping from Standard Synchronization Primitives 23

Efficient Bounded Timestamping from Standard Synchronization...

引用

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

作者： Bashari, Benyamin Jamadi, Ali Woelfel, Philipp Univ Calgary Calgary AB Canada

ISBN: (纸本)9798400701214

Bounded timestamps [10, 20] allow a temporal ordering of events in executions of concurrent algorithms. They are a fundamental and well studied building block used in many shared memory algorithms. A concurrent timestamp system keeps track of.. timestamps, which is usually greater or equal to the number of processes in the system, n. A process may, at any point, obtain a new timestamp, and later determine a total order of all process's most recent timestamps. Known timestamp algorithms do not scale well in the number of processes. Getting a new timestamp takes at least a linear number of steps, and a lower bound by Israeli and Li [20] implies that each timestamp needs to be represented by at least Omega(m) bits. We introduce a slightly different semantics for timestamping, where there is no fixed timestamp value associated with an event. A process can execute operation updateTS() to update its latest timestamp, associating it with the (linearization) point of that operation, and isEarlier(p,q) to determine the temporal order of the latest updateTS() operations executed by processes p and q. Since no static timestamp value is returned by updateTS(), the lower bound of Israeli and Li does not apply. We present efficient linearizable and wait-free implementations of these methods using a single bounded fetch-and-add object and O(n(2)) bounded compare-and-swap objects, which are available on standard hardware. The step complexity of each method call is constant, and base objects need only store O (log n) bits.

关键词： timestamping shared memory concurrency distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Decentralized distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs 38

Decentralized Distributed Graph Coloring II: Degree+1-Colori...

引用

38th International symposium on distributed computing, DISC 2024

作者： Flin, Maxime Halldórsson, Magnús M. Nolin, Alexandre Reykjavík University Iceland CISPA Helmholtz Center for Information Security Saarbrücken Germany

ISBN: (纸本)9783959773522

Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph H to be colored is locally embedded within the communication graph G. Besides generalizing classical distributed graph coloring (where H = G), this captures other previously studied settings, including cluster graphs and power graphs. We find that the complexity of coloring a virtual graph depends linearly on the edge congestion of its embedding. The main question of interest is how fast we can color virtual graphs of constant congestion. We find that, surprisingly, these graphs can be colored nearly as fast as ordinary graphs. Namely, we give a O(log4 log n)-round algorithm for the deg+1-coloring problem, where each node is assigned more colors than its degree. This can be viewed as a case where a distributed graph problem can be solved even when the operation of each node is decentralized. © Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Simpler and More General distributed Coloring Based on Simple List Defective Coloring Algorithms 24

Brief Announcement: Simpler and More General Distributed Col...

引用

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

作者： Fuchs, Marc Kuhn, Fabian University of Freiburg Germany

ISBN: (纸本)9798400706684

In this paper, we give list coloring variants of simple iterative defective coloring algorithms. Formally, in a list defective coloring instance, each node v of a graph is given a list Lv of colors and a list of allowed defects dv(x) for the colors. Each node v needs to be colored with a color x ϵ Lv such that at most dv(x) neighbors (or outneighbors) of v also pick the same color *** a defect parameter d, it is known that by making two sweeps in opposite order over the nodes of an edge-oriented graph with maximum outdegree β, one can compute a coloring with O(β2/d2) colors such that every node has at most d outneighbors of the same color. We generalize this and show that if all nodes have lists of size p2 and ĝv : ςxϵLv(dv(x) + 1) > p · β, we can make two sweeps of the nodes such that at the end, each node v has chosen a color x ϵ Lv for which at most dv(x) outneighbors of v are colored with color x. Our algorithm is simpler and computationally significantly more efficient than existing algorithms for similar list defective coloring problems. We show that the above result can in particular be used to obtain an alternative [EQUATION]-round algorithm for the (Δ+ 1)-coloring problem in the CONGEST *** neighborhood independence θ of a graph is the maximum number of pairwise non-adjacent neighbors of some node of the graph. Notable examples of graphs of bounded neighborhood independence are the line graphs of bounded-rank hypergraphs. It is well known that by doing a single sweep over the nodes of a graph of neighborhood independence θ, one can compute a d-defective coloring with O(θ · δ/d) colors. We extend this approach to the list defective coloring setting and use it to obtain a recursive (Δ+ 1)-coloring algorithm with a round complexity that is parameterized by the neighborhood independence θ. In particular, if θ = O(1), we get an (log δ)O(log log δ) + O(log∗n)-round algorithm to compute a (Δ+ 1)-coloring. The algorithm generalizes an algorithm from [Balliu

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

distributed Self-Stabilizing MIS with Few States and Weak Communication 23

Distributed Self-Stabilizing MIS with Few States and Weak Co...

引用

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

作者： Giakkoupis, George Ziccardi, Isabella Univ Rennes Inria CNRS IRISA Rennes France Bocconi Univ Milan Italy

ISBN: (纸本)9798400701214

We study a simple random process that computes a maximal independent set (MIS) on a general n-vertex graph. Each vertex has a binary state, black or white, where black indicates inclusion into the MIS. The vertex states are arbitrary initially, and are updated in parallel: In each round, every vertex whose state is "inconsistent" with its neighbors, i.e., it is black and has a black neighbor, or it is white and all neighbors are white, changes its state with probability 1/2. The process stabilizes with probability 1 on any graph, and the resulting set of black vertices is an MIS. We show that the expected stabilization time is O(log n) on certain graph families, such as cliques and graphs of bounded arboricity. Our main result is that the process stabilizes in poly(log n) rounds w.h.p. on G(n,p) random graphs, for 0 <= p <= poly(log n) . n(-1/2) or p >= 1/poly(log n). Further, we propose an extension of this process, with larger but still constant vertex state space, which stabilizes in poly(log n) rounds on G(n,p) w.h.p., for all 1 <= p <= 1. Both processes readily translate into distributed/parallel MIS algorithms, which are self-stabilizing, use constant space (and constant random bits per round), and assume restricted communication as in the beeping or the synchronous stone age models. To the best of our knowledge, no previously known MIS algorithm is self-stabilizing, uses constant space and constant randomness, and stabilizes in poly(log n) rounds on G(n,p) random graphs.

关键词： maximal independent set parallel/distributed algorithms self-stabilizing algorithms beeping model

来源：评论

学校读者我要写书评

暂无评论

Fully Local Succinct distributed Arguments 38

Fully Local Succinct Distributed Arguments

引用

38th International symposium on distributed computing, DISC 2024

作者： Tshuva, Eden Aldema Oshman, Rotem Tel Aviv University Israel

ISBN: (纸本)9783959773522

distributed certification is a proof system for detecting illegal network states or improper execution of distributed algorithms. A certification scheme consists of a proving algorithm, which assigns a certificate to each node, and a verification algorithm where nodes use these certificates to decide whether to accept or reject. The system must ensure that all nodes accept if and only if the network is in a legal state, adhering to the principles of completeness and soundness. The main goal is to design a scheme where the verification process is local and the certificates are succinct, while using as efficient as possible proving algorithm. In cryptographic proof systems, the soundness requirement is often relaxed to computational soundness, where soundness is guaranteed only against computationally bounded adversaries. Computationally sound proof systems are called arguments. Recently, Aldema Tshuva, Boyle, Cohen, Moran, and Oshman (TCC 2023) showed that succinct distributed arguments can be used to enable any polynomially bounded distributed algorithm to certify its execution with polylogarithmic-length certificates. However, their approach required a global communication phase, adding O(D) communication rounds in networks of diameter D, which limits its applicability to local algorithms. In this work, we give the first construction of a fully local succinct distributed argument system, where the prover and the verifier are both local. We show that a distributed algorithm that runs in R rounds, has polynomial local computation, and messages of B bits each can be compiled into a self-certifying algorithm that runs in R + polylog(n) rounds and sends messages of size B + polylog(n), with certificates of length polylog(n). This construction has several applications, including self-certification for local algorithms, ongoing certification of long-lived algorithms, and efficient local mending of the certificates when the network changes. © Eden Aldema Tshuva and Rotem O

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

distributed MIS in O (log log n) Awake Complexity 23

Distributed MIS in O (log log n) Awake Complexity

引用

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

作者： Dufoulon, Fabien Moses, William K., Jr. Pandurangan, Gopal Univ Houston Houston TX 77004 USA Univ Durham Durham England

ISBN: (纸本)9798400701214

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best known (randomized) MIS algorithms have O (log n) round complexity on general graphs [Luby, STOC 1986] (where n is the number of nodes), while the best known lower bound is Omega(root logn/log logn) [Kuhn, Moscibroda, Wattenhofer, Jacm 2016]. Breaking past the O (log n) round complexity upper bound or showing stronger lower bounds have been longstanding open problems. E nergy is a premium resource in various settings such as batterypowered wireless networks and sensor networks. The bulk of the energy is used by nodes when they are awake, i.e., when they are sending, receiving, and even just listening for messages. On the other hand, when a node is sleeping, it does not perform any communication and thus spends very little energy. Several recent works have addressed the problem of designing energy-efficient distributed algorithms for various fundamental problems. These algorithms operate by minimizing the number of rounds in which any node is awake, also called the (worst-case) awake complexity. An intriguing open question is whether one can design a distributed MIS algorithm that has significantly smaller awake complexity compared to existing algorithms. In particular, the question of obtaining a distributed MIS algorithm with o (log n) awake complexity was left open in [Chatterjee, Gmyr, Pandurangan, PODC 2020]. Our main contribution is to show that MIS can be computed in awake complexity that is exponentially better compared to the best known round complexity of O( log n) and also bypassing its fundamental Omega(root logn/log log n) round complexity lower bound exponentially. Specifically, we show that MIS can be computed by a randomized distributed (Monte Carlo) algorithm in O (log log n) awake complexity with high probability.1 However, this algorithm has a round complexity that is O ( poly

关键词： Maximal Independent Set Sleeping model energy-efficient awake complexity round complexity trade-offs

来源：评论

学校读者我要写书评

暂无评论

Completing the Node-Averaged Complexity Landscape of LCLs on Trees 24

Completing the Node-Averaged Complexity Landscape of LCLs on...

引用

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

作者： Balliu, Alkida Brandt, Sebastian Kuhn, Fabian Olivetti, Dennis Schmid, Gustav Gran Sasso Science Institute L'Aquila Italy Cispa Helmholtz Center for Information Security Saarbrücken Germany University of Freiburg Freiburg Germany

ISBN: (纸本)9798400706684

The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to understand the complexity landscape of locally checkable labelings (LCLs) on families of bounded-degree graphs. Particularly interesting in this context is the family of bounded-degree trees as there, for the worst-case complexity, we know a complete characterization of the possible complexities and structures of LCL problems. A first step for the node-averaged complexity case has been achieved recently [DISC '23], where the authors in particular showed that in bounded-degree trees, there is a large complexity gap: There are no LCL problems with a deterministic node-averaged complexity between ω(log∗n) and no(1). For randomized algorithms, they even showed that the node-averaged complexity is either O(1) or nω(1). In this work we fill in the remaining gaps and give a complete description of the node-averaged complexity landscape of LCLs on bounded-degree trees. Our contributions are threefold.•On bounded-degree trees, there is no LCL with a node-averaged complexity between ω(1) and (log∗n)o(1).•For any constants 0 1 2 ≤ 1 and ϵ > 0, there exists a constant c and an LCL problem with node-averaged complexity between ω((log∗n)c) and O((log∗n)c+ϵ).•For any constants 0 0, there exists an LCL problem with node-averaged complexity Φ(nx) for some x ϵ [α, α + ϵ]. © 2024 Association for computing Machinery. All rights reserved.

关键词： locally checkable labelings node-averaged complexity distributed complexity theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：