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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,074 篇 工学
- 1,045 篇 计算机科学与技术...
- 459 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 76 篇 控制科学与工程
- 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...
88 篇 distributed algo...
79 篇 distributed comp...
31 篇 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
19 篇 message passing
18 篇 distributed grap...
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 ...
7 篇 ben gurion univ ...
6 篇 cispa helmholtz ...
6 篇 national univers...
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...
5 篇 ecole polytech f...

作者

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,356 篇 英文
6 篇 其他
1 篇 中文

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

共 1363 条记录，以下是91-100 订阅

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

详细简洁

排序：

Speedup of distributed Algorithms for Power Graphs in the CONGEST Model 38

Speedup of Distributed Algorithms for Power Graphs in the CO...

引用

38th International symposium on distributed computing, DISC 2024

作者： Barenboim, Leonid Goldenberg, Uri Open University of Israel Ra’anana Israel Ben-Gurion University of the Negev Beersheba Israel

ISBN: (纸本)9783959773522

We obtain improved distributed algorithms in the CONGEST message-passing setting for problems on power graphs of an input graph G. This includes Coloring, Maximal Independent Set, and related problems. For R = f(∆k, n), we develop a general deterministic technique that transforms R-round LOCAL model algorithms for Gk with certain properties into O(R · ∆k/2-1)-round CONGEST algorithms for Gk. This improves the previously-known running time for such transformation, which was O(R · ∆k-1). Consequently, for problems that can be solved by algorithms with the required properties and within polylogarithmic number of rounds, we obtain quadratic improvement for Gk and exponential improvement for G2. We also obtain significant improvements for problems with larger number of rounds in G. Notable implications of our technique are the following deterministic distributed algorithms: We devise a distributed algorithm for O(∆4)-coloring of G2 whose number of rounds is O(log ∆ + log∗ n). This improves exponentially (in terms of ∆) the best previously-known deterministic result of Halldorsson, Kuhn and Maus.[25] that required O(∆ + log∗ n) rounds, and the standard simulation of Linial [30] algorithm in Gk that required O(∆ · log∗ n) rounds. We devise an algorithm for O(∆2)-coloring of G2 with O(∆ · log ∆ + log∗ n) rounds, and (∆2 + 1)-coloring with O(∆1.5 · log ∆ + log∗ n) rounds. This improves quadratically, and by a power of 4/3, respectively, the best previously-known results of Halldorsson, Khun and Maus. [25]. For k > 2, our running time for O(∆2k)-coloring of Gk is O(k · ∆k/2-1 · log ∆ · log∗ n). Our running time for O(∆k)-coloring of Gk is Õ(k · ∆k-1 · log∗ n). This improves best previously-known results quadratically, and by a power of 3/2, respectively. For constant k > 2, our upper bound for O(∆2k)-coloring of Gk nearly matches the lower bound of Fraigniaud, Halldorsson and Nolin. [16] for checking the correctness of a coloring in Gk © Leonid Barenboim and Uri Goldenberg.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model 22

Brief Announcement: Near Optimal Bounds for Replacement Path...

引用

acm symposium on principles of distributed computing (PODC)

作者： Manoharan, Vignesh Ramachandran, Vijaya Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450392624

We present round complexity results in the CONGEST model for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these fundamental problems in both directed and undirected graphs, weighted and unweighted. Many of our results are optimal to within a polylog factor: For an.. -node graph.. we establish near linear lower and upper bounds for RPaths if.. is directed andweighted, and forMWC and ANSC if.. is weighted, directed or undirected;near root n lower and upper bounds for undirected weighted RPaths;and Theta(D) bound for undirected unweighted RPaths. We also present lower and upper bounds for approximation: a (2 - ( 1/g))-approximation algorithm for undirected unweighted MWC that runs in O-similar to (root n +D) rounds, improving on the previous best bound of O-similar to (root ng +D) rounds, where.. is the MWC length, and a ( 1 +epsilon)-approximation algorithm for directed weighted RPaths and (2 +epsilon)-approximation for weighted undirected MWC, for any constant epsilon > 0, that beat the round complexity lower bound for an exact solution.

关键词： distributed algorithms CONGEST lower bounds replacement paths minimum weight cycle

来源：评论

学校读者我要写书评

暂无评论

distributed Computations in Fully-Defective Networks 22

Distributed Computations in Fully-Defective Networks

引用

acm symposium on principles of distributed computing (PODC)

作者： Censor-Hillel, Keren Cohen, Shir Gelles, Ran Sela, Gal Technion Haifa Israel Bar Ilan Univ Ramat Gan Israel

ISBN: (纸本)9781450392624

We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is too harsh for any reliable communication, we show how to simulate any algorithm for a noiseless setting over any fully-defective setting, given that the network is 2-edge connected. We prove that if the network is not 2-edge connected, no non-trivial computation in the fully-defective setting is possible. The key structural property of 2-edge-connected graphs that we leverage is the existence of an oriented (non-simple) cycle that goes through all nodes [Robbins, 1939]. The core of our technical contribution is presenting a construction of such a Robbins cycle in fully-defective networks, and showing how to communicate over it despite total message corruption. These are obtained in a content-oblivious manner, since nodes must ignore the content of received messages.

关键词： Fully-defective Networks Noise Resilience Robbins' Theorem

来源：评论

学校读者我要写书评

暂无评论

Encrypted distributed Systems 22

Encrypted Distributed Systems

引用

acm symposium on principles of distributed computing (PODC)

作者： Kamara, Seny MongoDB Atlanta GA 30305 USA Brown Univ Providence RI 02912 USA

ISBN: (纸本)9781450392624

distributed computing is at the heart of modern system architectures and infrastructures. But as security and privacy have increasingly become critical to every organization, modern cryptography is making its way into core systems. In this talk, I will describe work that focuses on using modern cryptographic techniques in large scale practical distributed systems in order to improve their security and privacy guarantees. I will show how both cryptographic techniques and distributed systems need to be adapted to make this work and how to think about the security of these new encrypted distributed systems.

关键词： Cryptography distributed systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds 22

Brief Announcement: Distributed MST Computation in the Sleep...

引用

acm symposium on principles of distributed computing (PODC)

作者： Augustine, John Moses, William K., Jr. Pandurangan, Gopal Indian Inst Technol Madras Chennai India Univ Houston Houston TX USA

ISBN: (纸本)9781450392624

We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in (O) over tilde (D + root n) rounds in the standard CONGEST model (where n is the network size and D is the network diameter) and this is essentially the best possible round complexity (up to logarithmic factors). However, in resource-constrained networks such as wireless ad hoc and sensor networks, nodes spending so much time can lead to significant spending of resources such as energy. Motivated by the above consideration, we study distributed algorithms for MST under the sleeping model [Chatterjee et al., PODC 2020], a model for design and analysis of resource-efficient distributed algorithms. In the sleeping model, a node can be in one of two modes in any round - sleeping or awake (unlike the traditional model where nodes are always awake). Only the rounds in which a node is awake are counted, while sleeping rounds are ignored. A node spends resources only in the awake rounds and hence the main goal is to minimize the awake complexity of a distributed algorithm, the worst-case number of rounds any node is awake. We present distributed MST algorithms that have optimal awake complexity with a matching lower bound. We also show that our awake-optimal algorithms have essentially the best possible round complexity by presenting a lower bound on the product of the awake and round complexity of any distributed algorithm (including randomized).

关键词： Minimum Spanning Tree Sleeping model energy-efficient awake complexity round complexity trade-offs

来源：评论

学校读者我要写书评

暂无评论

A Next Generation Architecture for Internet of Things in the Automotive Supply Chain for Electric Vehicles 24

A Next Generation Architecture for Internet of Things in the...

引用

2024 International symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile computing, MobiHoc 2024

作者： Kapsalis, Panagiotis Rimassa, Giovanni Zeydan, Engin Via, Selva Risso, Fulvio Giovanni Chiasserini, Carla Fabiana Vivo, Giulio Martel Innovate Zürich Switzerland Castelldefels Spain Politechnico di Torino Turin Italy Centro Ricerche FIAT SCpA Turin Italy

ISBN: (纸本)9798400705212

This paper presents a next-generation architecture that focuses on the advancement of edge computing and Internet of Things (IoT) technologies in the context of the automotive supply value chain for electric vehicles (EVs). First, we outline the general architecture design, the specific layers and their goals. Based on the principles of the proposed architecture, we also give a use case for improving the traceability, monitoring and efficiency of EV battery transportation using innovative approaches in federated data spaces, AI-powered inference and orchestration of a multi-objective computational continuum. The automotive supply chain use case is presented with potential Key Performance Indicators (KPIs) while emphasizing the potential impact on operational efficiency, cost reduction and sustainability. By addressing the current limitations in distributed intelligence, data governance, and cross-domain interoperability, we emphasize the importance of real-time data processing, dynamic field governance, and energy-efficient machine learning in the context of the electric vehicle supply chain. At the end of the paper, a discussion and comparative analysis highlights the advances over existing technologies and frameworks and identifies future directions to further improve innovations and applications in this area. © 2024 Copyright held by the owner/author(s).

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

The Landscape of distributed Complexities on Trees and Beyond 22

The Landscape of Distributed Complexities on Trees and Beyon...

引用

acm symposium on principles of distributed computing (PODC)

作者： Grunau, Christoph Rozhon, Vaclav Brandt, Sebastian Swiss Fed Inst Technol Zurich Switzerland CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany

ISBN: (纸本)9781450392624

We study the local complexity landscape of locally checkable labeling (LCL) problems on constant-degree graphs with a focus on complexities below log* n. Our contribution is threefold: (1) Our main contribution is that we complete the classification of the complexity landscape of LCL problems on trees in the LOCAL model, by proving that every LCL problem with local complexity o (log* n) has actually complexityO(1). This result improves upon the previous speedup result from o (log log* n) to O(1) by [Chang, Pettie, FOCS 2017]. (2) In the related LCA and VOLUME models [Alon, Rubinfeld, Vardi, Xie, SODA 2012, Rubinfeld, Tamir, Vardi, Xie, 2011, Rosenbaum, Suomela, PODC 2020],we prove the same speedup from o (log* n) to O(1) for all constant-degree graphs. (3) Similarly, we complete the classification of the LOCAL complexity landscape of oriented d-dimensional grids by proving that any LCL problem with local complexity o (log* n) has actually complexity O(1). This improves upon the previous speed-up from o ((d)root log* n) by Suomela, explained in [Chang, Pettie, FOCS 2017].

关键词： graph problems LCL problems distributed complexity theory locality LOCAL model volume model gap result

来源：评论

学校读者我要写书评

暂无评论

Deterministic Near-Optimal distributed Listing of Cliques 22

Deterministic Near-Optimal Distributed Listing of Cliques

引用

41st acm symposium on principles of distributed computing, PODC 2022

作者： Censor-Hillel, Keren Leitersdorf, Dean Vulakh, David Technion - Israel Institute of Technology Haifa Israel Massachusetts Institute of Technology CambridgeMA United States

ISBN: (纸本)9781450392624

The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether deterministic algorithms can be as efficient as their randomized counterparts, where the latter are known to be tight up to polylogarithmic factors. We give deterministic distributed algorithms for listing cliques of size p in n1 - 2/p + o(1) rounds in the Congest model. For triangles, our n1/3+o(1) round complexity improves upon the previous state of the art of n2/3+o(1) rounds [Chang and Saranurak, FOCS 2020]. For cliques of size p ≥ 4, ours are the first non-trivial deterministic distributed algorithms. Given known lower bounds, for all values p ≥ 3 our algorithms are tight up to a no(1) subpolynomial factor, which comes from the deterministic routing procedure we use. © 2022 acm.

关键词： congest distributed graph algorithms cliques

来源：评论

学校读者我要写书评

暂无评论

From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good 22

From Switch Scheduling to Datacenter Scheduling: Matching-Co...

引用

acm symposium on principles of distributed computing (PODC)

作者： Agarwal, Rachit Rajakrishnan, Shijin Shmoys, David B. Cornell Univ Ithaca NY 14850 USA

ISBN: (纸本)9781450392624

Packet scheduling over a switch (interconnect) fabric is a wellstudied problem in distributed computing, with known near-optimal distributed bipartite matching based protocols. We initiate a theoretical study of distributed flow scheduling in datacenter networks. Building upon the observation that modern datacenter networks use Clos-like topologies similar to switch fabrics, we introduce a new k-sparse flow-matching (k-SFM) problem, a variant of the classical matching problem that captures the unique constraints imposed by flow scheduling in datacenter networks. In the k-SFM problem, we are given a weighted graph and an integer k. The goal is to assign a fractional flow value to each edge under the following three constraints: (1) for each edge, the assigned flow value is no greater than its input weight;(2) for each vertex, the sum of flow values assigned to edges incident to the vertex is at most the capacity of the vertex;and (3) for each vertex, at most k incident edges are assigned a non-zero flow value. The goal is to compute a feasible solution with the largest total fractional weight. We design centralized and distributed algorithms for the k-SFM problem on bipartite graphs. For the centralized setting, we present a greedy 1/2-approximation algorithm. For the distributed setting, we present three algorithms under the CONGEST model: a randomized 1/4-approximation algorithm that runs in O(k log n) rounds, a randomized Omega(1)-approximation algorithm that runs in O(log k log n) rounds, and a deterministic 1/(4 + epsilon)-approximation algorithm that runs in O(k log(2) n log(1/epsilon)) rounds. The key idea in all of our algorithms is that existing approaches for computing maximum-weight matching can be used as a "coordination" mechanism, alongside local and greedy decisions on updating residual weights, to design near-optimal algorithms for the k-SFM problem.

关键词： Datacenter networks Flowscheduling protocols distributed Matching Algorithms

来源：评论

学校读者我要写书评

暂无评论

A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement 22

A Speedup Theorem for Asynchronous Computation with Applicat...

引用

acm symposium on principles of distributed computing (PODC)

作者： Fraigniaud, Pierre Paz, Ami Rajsbaum, Sergio Univ Paris Cite IRIF Paris France CNRS Paris France Univ Nacl Autonoma Mexico Inst Matemat Mexico City Mexico

ISBN: (纸本)9781450392624

We study two fundamental problems of distributed computing, consensus and approximate agreement, through a novel approach for proving lower bounds and impossibility results, that we call the asynchronous speedup theorem. For a given n-process task Pi and a given computational model M, we define a new task, called the closure of Pi with respect to M. The asynchronous speedup theorem states that if a task Pi is solvable in t >= 1 rounds in M, then its closure w.r.t. M is solvable in t - 1 rounds in... We prove this theorem for iterated models, as long as the model allows solo executions. We illustrate the power of our asynchronous speedup theorem by providing a new proof of the wait-free impossibility of consensus using read/write registers, and a new proof of the wait-free impossibility of solving consensus using registers and test&set objects for n > 2. The proof is merely by showing that, in each case, the closure of consensus (w.r.t. the corresponding model) is consensus itself. Our main application is the study of the power of additional objects, namely test&set and binary consensus, for wait-free solving approximate agreement faster. By analyzing the closure of approximate agreement w.r.t. each of the two models, we show that while these objects are more powerful than read/write registers from the computability perspective, they are not more powerful as far as helping solving approximate agreement faster is concerned.

关键词： Lower Bounds distributed Algorithms Consensus Approximate Agreement Combinatorial Topology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共137页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：