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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

PODC 2013 - proceedings of the 2013 acm symposium on principles of distributed computing

PODC 2013 - Proceedings of the 2013 ACM Symposium on Princip...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

ISBN: (纸本)9781450320658

The proceedings contain 54 papers. The topics discussed include: distributed computing theory for wireless networks and mobile systems;pragmatic primitives for non-blocking data structures;the SkipTrie: low-depth concurrent search without rebalancing;optimal deterministic routing and sorting on the congested clique;Byzantine vector consensus in complete graphs;fast Byzantine agreement in dynamic networks;synchronous Byzantine agreement with nearly a cubic number of communication bits;how to meet asynchronously at polynomial cost;on the complexity of universal leader election;on the complexity of universal leader election;on minimum interaction time for continuous distributed interactive computing;scalable anonymous communication with Byzantine adversary;brokerage and closure in a strategic model of social capital;and feedback from nature: an optimal distributed algorithm for maximal independent set selection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Colorless Tasks and Extension-Based Proofs 38

Brief Announcement: Colorless Tasks and Extension-Based Proo...

引用

38th International symposium on distributed computing, DISC 2024

作者： Shi, Yusong Liu, Weidong Department of Computer Science and Technology Tsinghua University Beijing China Zhongguancun Laboratory Beijing China

ISBN: (纸本)9783959773522

The concept of extension-based proofs models the idea of a valency argument, which is widely used in distributed computing. Extension-based proofs are limited in power: it has been shown that there is no extension-based proof of the impossibility of a wait-free protocol for (n, k)-set agreement among n > k ≥ 2 processes. There are only a few tasks that have been proven to have no extension-based proof of the impossibility, since the techniques in these works are closely related to the specific task. We give a necessary and sufficient condition for colorless tasks to have no extension-based proofs of the impossibility of wait-free protocols in the NIIS model. We introduce a general adversarial strategy decoupled from any concrete task specification. In this strategy, some properties of the chromatic subdivision that is widely used in distributed computing are proved. © Yusong Shi and Weidong Liu.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Towards a Comprehensive Approach to Resource and Conflict Management in Cloud-Edge Settings 24

Towards a Comprehensive Approach to Resource and Conflict Ma...

引用

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

作者： Massa, Jacopo Univ Pisa Dept Comp Sci Pisa Italy CNR ISTI Pisa Italy

ISBN: (纸本)9798400704130

As the Internet of Things (IoT) gains popularity, the multitude of connected devices accessing computing facilities along the Cloud-IoT continuum has risen rapidly. This growth has prompted an increase in IoT-based applications and the data they process. These applications often carry specific Quality of Service (QoS) requirements, necessitating the research of strategic management for services and data, coupled with routes across the IoT and application components. Concurrently, our research explores the integration of Intent-Based Networking (IBN) principles to manage data flows and resolve conflicts among stakeholders sharing the same infrastructure. This dual-focus approach aims to support the effective placement and management of multi-service applications on Cloud-IoT resources, considering QoS, data characteristics, and resource conflict detection and resolution. This work outlines our primary objectives and shares findings from our ongoing research.

关键词： Cloud computing Intent-Based Networking Network resources allocation Constraint and logic languages

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Model Checking on Graphs of Bounded Treedepth 24

Brief Announcement: Distributed Model Checking on Graphs of ...

引用

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

作者： Fomin, Fedor V. Fraigniaud, Pierre Montealegre, Pedro Rapaport, Ivan Todinca, Ioan University of Bergen Bergen Norway Université Paris Cité CNRS Paris France Universidad Adolfo Ibañez Santiago Chile Universidad de Chile Santiago Chile Université d'Orléans Insa Cvl Orléans France

ISBN: (纸本)9798400706684

We establish that every monadic second-order logic (MSO) formula on graphs with bounded treedepth is decidable in a constant number of rounds within the CONGEST model. To our knowledge, this marks the first meta-theorem regarding distributed model-checking. Various optimization problems on graphs are expressible in MSO. Examples include determining whether a graph G has a clique of size k, whether it admits a coloring with k colors, whether it contains a graph H as a subgraph or minor, or whether terminal vertices in G could be connected via vertex-disjoint paths. Our meta-theorem significantly enhances the work of Bousquet et al. [PODC 2022], which was focused on distributed certification of MSO on graphs with bounded treedepth. Moreover, our results can be extended to solving optimization and counting problems expressible in MSO, in graphs of bounded treedepth. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Content-Oblivious Leader Election on Rings 24

Brief Announcement: Content-Oblivious Leader Election on Rin...

引用

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

作者： Frei, Fabian Gelles, Ran Ghazy, Ahmed Nolin, Alexandre Cispa Helmholtz Center for Information Security Saarbrücken Germany Bar-Ilan University Ramat Gan Israel

ISBN: (纸本)9798400706684

In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content of all messages across all channels. In a recent work, Censor-Hillel, Cohen, Gelles, and Sela (distributed computing, 2023) showed how to perform arbitrary computations in a content-oblivious way in 2-edge connected networks but only if the network has a distinguished node (called root) to initiate the *** goal is to remove this assumption, which was conjectured to be necessary. Achieving this goal essentially reduces to performing a content-oblivious leader election since an elected leader can then serve as the root required to perform arbitrary content-oblivious computations. We focus on ring networks, which are the simplest 2-edge connected graphs. On oriented rings, we obtain a leader election algorithm with message complexity O(n · IDmax), where IDmax is the maximal assigned ID. As it turns out, this dependency on IDmax is inherent: we show a lower bound of ω(n log(IDmax/n)) messages for content-oblivious leader election algorithms. We also extend our results to non-oriented rings, where nodes cannot tell which channel leads to which neighbor. In this case, however, the algorithm does not terminate but only reaches quiescence. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID distributed Model 24

Universally Optimal Information Dissemination and Shortest P...

引用

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

作者： Chang, Yi-Jun Hecht, Oren Leitersdorf, Dean Schneider, Philipp National University of Singapore Singapore Technion Israel University of Bern Switzerland

ISBN: (纸本)9798400706684

In most modern networks, nodes have access to various modes of communication each with different characteristics. In this work we consider the Hybrid model of distributed computing, introduced recently by Augustine, Hinnenthal, Kuhn, Scheideler, and Schneider (SODA 2020), where nodes have access to two different communication modes: high-bandwidth local communication along the edges of the graph and low-bandwidth all-to-all communication, capturing the non-uniform nature of modern communication networks. It is noteworthy that the Hybrid model in its most general form covers most of the classical distributed models as marginal *** work in Hybrid has focused on showing existentially optimal algorithms, meaning there exists a pathological family of instances on which no algorithm can do better. This neglects the fact that such worst-case instances often do not appear or can be actively avoided in practice. In this work, we focus on the notion of universal optimality, first raised by Garay, Kutten, and Peleg (FOCS 1993). Roughly speaking, a universally optimal algorithm is one that, given any input graph, runs as fast as the best algorithm designed specifically for that *** show the first universally optimal algorithms in Hybrid, up to polylogarithmic factors. We present universally optimal solutions for fundamental tools that solve information dissemination problems, such as broadcasting and unicasting multiple messages in a Hybrid network. Furthermore, we demonstrate these tools for information dissemination can be used to obtain universally optimal solutions for various shortest paths problems in Hybrid. A major conceptual contribution of this work is the conception of a new graph parameter called neighborhood quality that captures the inherent complexity of many fundamental graph problems in the Hybrid model. We also develop new existentially optimal shortest paths algorithms in Hybrid, which are utilized as key subroutines in our universally optimal al

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Studying Latency and Throughput Constraints for Geo-distributed Data in the National Science Data Fabric 23

Studying Latency and Throughput Constraints for Geo-Distribu...

引用

32nd International symposium on High-Performance Parallel and distributed computing (HPDC) part of the acm Federated computing Research Conference (FCRC)

作者： Luettgau, Jakob Martinez, Heberth Tarcea, Glenn Scorzelli, Giorgio Pascucci, Valerio Taufer, Michela Univ Tennessee Knoxville TN 37916 USA Univ Michigan Ann Arbor MI 48109 USA Univ Utah Salt Lake City UT USA

ISBN: (纸本)9798400701559

The National Science Data Fabric (NSDF) is our solution to the problem of addressing the data-sharing needs of the growing data science community. NSDF is designed to make sharing data across geographically distributed sites easier for users who lack technical expertise and infrastructure. By developing an easy-to-install software stack, we promote the FAIR data-sharing principles in NSDF while leveraging existing high-speed data transfer infrastructures such as Globus and XRootD. This work shows how we leverage latency and throughput information between geo-distributed NSDF sites with NSDF entry points to optimize the automatic coordination of data placement and transfer across the data fabric, which can further improve the efficiency of data sharing.

关键词： High-performance computing Cloud computing Data democratization PerfSonar XRootD

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Improved Consensus in Quantum Networks 23

Brief Announcement: Improved Consensus in Quantum Networks

引用

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

作者： Hajiaghayi, MohammadTaghi Kowalski, Dariusz R. Olkowski, Jan Univ Maryland College Pk MD 20742 USA Augusta Univ Augusta GA USA

ISBN: (纸本)9798400701214

Fault-tolerant consensus is about reaching agreement on some of the input values in a limited time by non-faulty autonomous processes, despite of failures of processes or communication medium. This problem is particularly challenging and costly against an adaptive adversary with full information. Bar-Joseph and Ben-Or [7] (PODC'98) were the first who proved an absolute lower bound Omega(root n/log n) on expected time complexity of consensus in any classic (i.e., randomized or deterministic) message-passing network with n processes succeeding with probability 1 against such a strong adaptive adversary crashing processes. Seminal work of Ben-Or and Hassidim [8] (STOC'05) broke the Omega(root n/log n) barrier for consensus in classic (deterministic and randomized) networks by employing quantum computing. They showed an (expected) constant-time quantum algorithm for a linear number of crashes t < n/3. In this paper, we improve upon that seminalwork by reducing the number of quantum and communication bits to an arbitrarily small polynomial, and even more, to a polylogarithmic number - though, the latter in the cost of a slightly larger polylogarithmic time (still exponentially smaller than the time lower bound Omega(root n/log n)) for classic computation).

关键词： distributed algorithms quantum algorithms adaptive adversary crash failures Consensus quantum common coin approximate counting

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: The MBroadcast Abstraction 23

Brief Announcement: The MBroadcast Abstraction

引用

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

作者： Depres, Mathilde Mostefaoui, Achour Perrin, Matthieu Raynal, Michel Univ Paris Saclay ENS Paris Saclay F-91190 Gif Sur Yvette France Nantes Univ LS2N F-44322 Nantes France Univ Rennes IRISA Inria CNRS F-35042 Rennes France

ISBN: (纸本)9798400701214

This short article presents a new communication abstraction denoted Mutual Broadcast (in short MBroadcast). It provides each pair of processes with the following property (called mutual ordering): for any pair of processes p and p ', if p broadcasts a message m and p' broadcasts a message m', it is not possible for p to deliver first (its message) m and then m' while p' delivers first (its message) m' and then m. The computability power of this broadcast abstraction is the same as the one of an atomic read/write register. Interestingly, it constitutes the first characterization of RW registers in terms of (binary) message patterns.

关键词： Asynchrony Atomicity Broadcast abstraction Characterization Crash failure distributed Computability Message-passing Message pattern Quorum Read/write pattern Read/Write register Two-process communication

来源：评论

学校读者我要写书评

暂无评论

distributed Symmetry Breaking on Power Graphs via Sparsification 23

Distributed Symmetry Breaking on Power Graphs via Sparsifica...

引用

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

作者： Maus, Yannic Peltonen, Saku Uitto, Jara Graz Univ Technol Graz Austria Aalto Univ Espoo Finland

ISBN: (纸本)9798400701214

In this paper we present efficient distributed algorithms for classical symmetry breaking problems, maximal independent sets (MIS) and ruling sets, in power graphs. We work in the standard CONGEST model of distributed message passing, where the communication network is abstracted as a graph G. Typically, the problem instance in CONGEST is identical to the communication network G, that is, we perform the symmetry breaking in G. In this work, we consider a setting where the problem instance corresponds to a power graph G(k), where each node of the communication network G is connected to all of its k-hop neighbors. A beta-ruling set is a set of non-adjacent nodes such that each node in.. has a ruling neighbor within beta hops;a natural generalization of an MIS. On top of being a natural family of problems, ruling sets (in power graphs) are well-motivated through their applications in the powerful shattering framework [BEPS Jacm'16, Ghaffari SODA'19] (and others). We present randomized algorithms for computing maximal independent sets and ruling sets of G(k) in essentially the same time as they can be computed in G. Our main contribution is a deterministic poly(k, logn) time algorithm for computing k-ruling sets of G(k), which (for k > 1) improves exponentially on the current state-of-the-art runtimes. Our main technical ingredient for this result is a deterministic sparsification procedure which may be of independent interest. We also revisit the shattering algorithm for MIS [BEPS J'acm'16] and present different approaches for the post-shattering phase. Our solutions are algorithmically and analytically simpler (also in the LOCAL model) than existing solutions and obtain the same runtime as [Ghaffari SODA'16].

关键词： distributed algorithm CONGEST model maximal independent set ruling sets power graphs sparsification shattering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：