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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

84 篇 会议
8 篇 期刊文献

馆藏范围

92 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

67 篇 工学
- 62 篇 计算机科学与技术...
- 35 篇 软件工程
- 9 篇 信息与通信工程
- 6 篇 控制科学与工程
- 4 篇 电气工程
- 3 篇 网络空间安全
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
24 篇 理学
- 22 篇 数学
- 8 篇 统计学（可授理学、...
- 3 篇 物理学
- 2 篇 系统科学
- 1 篇 化学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学

主题

21 篇 distributed comp...
11 篇 distributed comp...
6 篇 computer science
5 篇 distributed algo...
4 篇 causal consisten...
4 篇 cloud computing
3 篇 algorithms
3 篇 computational mo...
3 篇 testing
3 篇 cryptography
2 篇 fault-tolerant d...
2 篇 automated verifi...
2 篇 partial synchron...
2 篇 reliability
2 篇 replication
2 篇 theorem proving
2 篇 approximation al...
2 篇 bandwidth
2 篇 consensus
2 篇 radio network

机构

2 篇 univ oxford oxfo...
2 篇 cispa helmholtz ...
2 篇 univ nova lisboa...
2 篇 mit cambridge ma...
2 篇 ist austria aust...
2 篇 imdea software i...
2 篇 mit comp sci & a...
2 篇 department of co...
2 篇 shanghai jiao to...
2 篇 university of fr...
2 篇 mit csail boston...
2 篇 univ paris 06 un...
2 篇 cnrs ens inria f...
1 篇 department of co...
1 篇 computer science...
1 篇 johns hopkins un...
1 篇 princeton univ d...
1 篇 icsi berkeley ca...
1 篇 univ neuchatel i...
1 篇 département d'in...

作者

4 篇 guerraoui rachid
3 篇 kuhn fabian
3 篇 fauconnier hugue...
3 篇 fraigniaud pierr...
2 篇 lesani mohsen
2 篇 todinca ioan
2 篇 kouznetsov petr
2 篇 dragoi cezara
2 篇 toueg sam
2 篇 ferreira carla
2 篇 delporte-gallet ...
2 篇 zufferey damien
2 篇 gotsman alexey
2 篇 wattenhofer roge...
2 篇 shapiro marc
2 篇 brian harvey
2 篇 chlipala adam
2 篇 luke segars
2 篇 henzinger thomas...
2 篇 tiffany barnes

语言

84 篇 英文
8 篇 其他

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

共 92 条记录，以下是21-30 订阅

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

详细简洁

排序：

Experimental Validation of a Performance Model for a distributed Recoverable Boeing 747 Flight Control System Subject to Digital Upsets

Experimental Validation of a Performance Model for a Distrib...

引用

SSST 2011 - 43rd IEEE Southeastern symposium on System Theory

作者： Wang, Rui Gray, W. Steven Gonzalez, Oscar R. Old Dominion Univ Dept Elect & Comp Engn Norfolk VA 23529 USA

ISBN: (纸本)9781424495931

This paper describes a High Intensity Radiated Fields experiment conducted at the NASA Langley Research Center to validate a tracking performance model for a Boeing 747 digital flight control system implemented on a distributed recoverable computing platform which is subject to upsets. While the upset data does not appear to be Markov, it is found that a burst model for the upset process can be introduced so that a Markov jump-linear performance model can reliably provide an upper bound on the tracking error of the system.

关键词： Flight control systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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: Optimally work-competitive scheduling for cooperative computing with merging groups

Brief Announcement: Optimally work-competitive scheduling fo...

引用

proceedings of the Twenty - First Annual acm symposium on principles of distributed computing PODC 2002

作者： Georgiou, Chryssis Russell, Alexander Shvartsman, Alex A. Department of Computer Science University of Connecticut 191 Auditorium Rd. Unit 3155 Storrs CT 06269 United States

The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous processors start performing tasks in isolation and where an adversary can force an arbitrary pattern of merges. Following a merge, processors are able to share their knowledge about the computational progress prior to the merge.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

STOC'11 - proceedings of the 43rd acm symposium on Theory of computing

STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of...

引用

ISBN: (纸本)9781450306911

The proceedings contain 84 papers. The topics discussed include: social networks spread rumors in sublogarithmic time;quantum one-way communication can be exponentially stronger than classical communication;cover times, blanket times, and majorizing measures;the equivalence of the random oracle model and the ideal cipher model, revisited;limits of provable security from standard assumptions;an impossibility result for truthful combinatorial auctions with submodular valuations;towards coding for maximum errors in interactive communication;rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm;pseudorandom generators for combinatorial shapes;electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs;subexponential lower bounds for randomized pivoting rules for the simplex algorithm;distributed verification and hardness of distributed approximation;and the topology of wireless communication.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Selfish caching in distributed systems: A game-theoretic analysis

Selfish caching in distributed systems: A game-theoretic ana...

引用

proceedings of the 23rd Annual acm symposium on principles of distributed computing

作者： Chun, Byung-Gon Barreno, Marco Chaudhuri, Kamalika Papadimitriou, Christos H. Wee, Hoeteck Kubiatowicz, John Computer Science Division University of California Berkeley

We analyze replication of resources by server nodes that act selfishly, using a game-theoretic approach. We refer to this as the selfish caching problem. In our model, nodes incur either cost for replicating resources or cost for access to a remote replica. We show the existence of pure strategy Nash equilibria and investigate the price of anarchy, which is the relative cost of the lack of coordination. The price of anarchy can be high due to undersupply problems, but with certain network topologies it has better bounds. With a payment scheme the game can always implement the social optimum in the best case by giving servers incentive to replicate.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

What cannot be computed locally! 04

What cannot be computed locally!

引用

proceedings of the 23rd Annual acm symposium on principles of distributed computing

作者： Kuhn, Fabian Moscibroda, Thomas Wattenhofer, Roger Dept. of Computer Science ETH Zurich 8092 Zurich Switzerland

ISBN: (纸本)9781581138023

We give time lower bounds for the distributed approximation of minimum vertex cover (MVC) and related problems such as minimum dominating set (MDS). In k communication rounds, MVC and MDS can only be approximated by factors Ω(nc/k2,/k) and Ω(Δ1/k/k) for some constant c, where n and Δ denote the number of nodes and the largest degree in the graph. The number of rounds required in order to achieve a constant or even only a polylogarithmic approximation ratio is at least Ω(√log n/ log log n) and Ω(log Δ/ log log Δ). By a simple reduction, the latter lower bounds also hold for the construction of maximal matchings and maximal independent sets.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Conference Record of the Annual acm symposium on principles of Programming Languages

Conference Record of the Annual ACM Symposium on Principles ...

引用

43rd Annual acm SIGPLAN-SIGACT symposium on principles of Programming Languages, POPL 2016

ISBN: (纸本)9781450335492

The proceedings contain 61 papers. The topics discussed include: programming the world of uncertain things;type theory in type theory using quotient inductive types;system F-omega with equirecursive types for datatype-generic programming;a theory of effects and resources: adjunction models and polarized calculi;temporal verification of higher-order functional programs;scaling network verification using symmetry and surgery;model checking for symbolic-heap separation logic with inductive predicates;reducing crash recoverability to reachability;query-guided maximum satisfiability;string solving with word equations and transducers: towards a logic for analyzing mutation XSS;symbolic computation of differential equivalences;and unboundedness and downward closures of higher-order pushdown automata.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：