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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

70 篇 会议
42 篇 期刊文献
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

107 篇 工学
- 106 篇 计算机科学与技术...
- 15 篇 电气工程
- 15 篇 软件工程
- 12 篇 信息与通信工程
- 4 篇 控制科学与工程
- 2 篇 电子科学与技术（可...
- 1 篇 网络空间安全
15 篇 理学
- 15 篇 数学
5 篇 管理学
- 5 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

115 篇 population proto...
28 篇 leader election
22 篇 self-stabilizati...
12 篇 distributed comp...
9 篇 majority
7 篇 chemical reactio...
7 篇 randomized algor...
6 篇 parameterized ve...
6 篇 cover time
5 篇 petri nets
5 篇 anonymous
4 篇 stabilization ti...
4 篇 finite-state
4 篇 state complexity
4 篇 distributed algo...
3 篇 transformer
3 篇 networks of mobi...
3 篇 randomised algor...
3 篇 plurality consen...
3 篇 energy consumpti...

机构

8 篇 tech univ munich...
6 篇 univ calif davis...
5 篇 univ hamburg ham...
5 篇 univ paris 11 lr...
4 篇 ecole polytech l...
4 篇 yale univ dept c...
3 篇 kings coll londo...
3 篇 tu hamburg hambu...
3 篇 univ liverpool l...
3 篇 technion israel ...
2 篇 tech univ munich...
2 篇 cnrs inria loria...
2 篇 univ nevada dept...
2 篇 univ british col...
2 篇 uhp iecn f-54506...
2 篇 univ wroclaw wro...
2 篇 inria rennes bre...
2 篇 univ paris 07 li...
2 篇 osaka univ grad ...
2 篇 mit cambridge ma...

作者

13 篇 sudo yuichi
12 篇 burman janna
12 篇 esparza javier
11 篇 beauquier joffro...
11 篇 masuzawa toshimi...
8 篇 berenbrink petra
8 篇 doty david
7 篇 jaax stefan
7 篇 aspnes james
6 篇 kakugawa hirotsu...
6 篇 kutten shay
6 篇 kaaser dominik
6 篇 ooshita fukuhito
5 篇 kling peter
5 篇 blondin michael
5 篇 eftekhari mahsa
5 篇 bournez olivier
4 篇 chen ho-lin
4 篇 gasieniec leszek
4 篇 cohen johanne

语言

114 篇 英文
1 篇 其他

检索条件"主题词=Population protocols"

共 115 条记录，以下是51-60 订阅

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

详细简洁

排序：

First Experiences with the Implementation and Evaluation of population protocols on Physical Devices

First Experiences with the Implementation and Evaluation of ...

引用

IEEE/ACM International Conference on Green Computing and Communications (GreenCom) / IEEE International Conference on Internet of Things (iThings) / 5th IEEE International Conference on Cyber, Physical and Social Computing (CPSCom)

作者： Becchetti, Luca Bergamini, Lorenzo Ficarola, Francesco Salvatore, Francesco Vitaletti, Andrea Univ Roma La Sapienza Dept Comp Control & Management Engn Rome Italy

ISBN: (纸本)9780769548654;9781467351461

In this paper we present an implementation of population protocols, a well-known fully decentralized computational model, on physical devices. We implemented the protocols sensing platforms developed with the support of the SocioPatterns research collaboration. This implementation enabled us to evaluate the protocols on a small-scale social network and thus to demonstrate their feasibility to run on real hardware platforms. To the best of our knowledge, this is the first time population protocols are implemented and tested on real physical devices. We also collected traces of social interactions to setup simulations on NetLogo, and thus enable the comparison of results obtained through simulation with those obtained in real experiments.

关键词： Social Networks population protocols Implementation

来源：评论

学校读者我要写书评

暂无评论

Black Ninjas in the Dark: Formal Analysis of population protocols 18

Black Ninjas in the Dark: Formal Analysis of Population Prot...

引用

33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) held as part of the Federated Logic Conference (FLoC)

作者： Blondin, Michael Esparza, Javier Jaax, Stefan Kucera, Antonin Tech Univ Munich Fak Informat Garching Germany Masaryk Univ Fac Informat Brno Czech Republic

In this interactive paper, which you should preferably read connected to the Internet, the Black Ninjas introduce you to population protocols, a fundamental model of distributed computation, and to recent work by the ... 详细信息

ISBN: (纸本)9781450355834

关键词： population protocols distributed computing parameterized verification

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: population protocols for Leader Election and Exact Majority with O(log² n) States and O(log² n) Convergence Time 17

Brief Announcement: Population Protocols for Leader Election...

引用

36th ACM Symposium on Principles of Distributed Computing (PODC)

作者： Bilke, Andreas Cooper, Colin Elsaesser, Robert Radzik, Tomasz Univ Salzburg Dept Comp Sci Salzburg Austria Kings Coll London Dept Informat London WC2R 2LS England

ISBN: (纸本)9781450349925

We consider the model of population protocols, which can be viewed as a sequence of random pairwise interactions of n agents (nodes). During each interaction, two agents v and w selected uniformly at random update their states on the basis of their current states, and the whole system should in long run converge towards a desired global final configuration. We study population protocols for two problems: the leader election and the exact majority voting. Both protocols use Theta(log(2) n) states per agent and run in O(log(2) n) rounds (the number of interactions divided by n), w.h.p. and in expectation, improving on the running time of the Theta(log(2) n)-state protocols proposed recently by Alistarh et al. [SODA 2017]. Our protocols are based on the idea of agents counting their local interactions and rely on the probabilistic fact that the uniform random selection would limit the divergence of the individual counts.

关键词： population protocols leader election exact majority

来源：评论

学校读者我要写书评

暂无评论

Comparison Dynamics in population protocols 21

Comparison Dynamics in Population Protocols

引用

40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)

作者： Alistarh, Dan Toepfer, Martin Uznanski, Przemyslaw IST Austria A-3400 Klosterneuburg Austria Univ Wroclaw Inst Comp Sci Wroclaw Poland

ISBN: (纸本)9781450385480

There has recently been a surge of interest in the computational and complexity properties of the population model, which assumes n anonymous, computationally-bounded nodes, interacting at random, with the goal of jointly computing global predicates. Significant work has gone towards investigating majority or consensus dynamics in this model: that is, assuming that every node is initially in one of two states X or Y, determine which state had higher initial count. In this paper, we consider a natural generalization of majority/consensus, which we call comparison: in its simplest formulation, we are given two baseline states, X-0 and Y-0, present in any initial configuration in fixed, but possibly small counts. One of these states has higher count than the other: we will assume vertical bar X-0 vertical bar >= C vertical bar Y-0 vertical bar for some constant C > 1. The challenge is to design a protocol by which nodes can quickly and reliably decide on which of the baseline states X-0 and Y-0 has higher initial count. We begin by analyzing a simple and general dynamics solving the above comparison problem, which uses O(log n) states per node, and converges in O(log n) (parallel) time, with high probability, to a state where the whole population votes on opinions X or Y at rates proportional to the initial concentrations of vertical bar X-0 vertical bar vs. vertical bar Y-0 vertical bar. We then describe how this procedure can be bootstrapped to solve comparison, i.e. have every node in the population reach the "correct" decision, with probability 1 - o(1), at the cost of O(log log n) additional states. Further, we prove that this dynamics is self-stabilizing, in the sense that it converges to the correct decision from arbitrary initial states, and leak-robust, in the sense that it can withstand spurious faulty reactions, which are known to occur in practical implementations of population protocols. Our analysis is based on a new martingale concentration result relati

关键词： population protocols Majority computation Randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast and Exact Majority in population protocols 15

Fast and Exact Majority in Population Protocols

引用

34th Annual ACM Symposium on Principles of Distributed Computing (PODC)

作者： Alistarh, Dan Gelashvili, Rati Vojnovic, Milan Microsoft Res Redmond WA 98052 USA MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450336178

population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node starts in one of two states;the goal is for all nodes to reach a correct consensus on which of the two states was initially the majority. Despite considerable research effort, known protocols for this problem are either exact but slow (taking linear parallel time to converge), or fast but approximate (with non-zero probability of error). In this paper, we show that this trade-off between precision and speed is not inherent. We present a new protocol called Average and Conquer (AVC) that solves majority exactly in expected parallel convergence time O(log n/(s epsilon) + log n log s), where n is the number of nodes, epsilon n is the initial node advantage of the majority state, and s = Omega(log n log log n) is the number of states the protocol employs. This shows that the majority problem can be solved exactly in time poly-logarithmic in n, provided that the memory per node is s = Omega(1/epsilon log n log 1/epsilon). On the negative side, we establish a lower bound of Omega(1/epsilon) on the expected parallel convergence time for the case of four memory states per node, and a lower bound of Omega(log n) parallel time for protocols using any number of memory states per node.

关键词： population protocols majority computation randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Verifying Self-stabilizing population protocols with Coq

Verifying Self-stabilizing Population Protocols with Coq

引用

3rd International Symposium on Theoretical Aspects of Software Engineering

作者： Deng, Yuxin Monin, Jean-Francois Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Univ Grenoble 1 Grenoble France

ISBN: (纸本)9780769537573

population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such protocols involve subtle arguments on infinite sequences of events. We propose a general formalization of self-stabilizing population protocols with the Coq proof assistant. It is used in reasoning about a concrete protocol for leader election in complete graphs. The protocol is formally proved to be correct for networks of arbitrarily large size. To this end we develop an appropriate theory of infinite sequences, including results for reasoning on abstractions. In addition, we provide a constructive correctness proof for a leader election protocol in directed rings. An advantage of using a constructive setting is that we get more informative proofs on the scenarios that converge to the desired configurations.

关键词： formal verification population protocols self-stabilization proof assistant Coq

来源：评论

学校读者我要写书评

暂无评论

A self-stabilizing transformer for population protocols with covering

A self-stabilizing transformer for population protocols with...

引用

11th International Symposium on Stabilization, Safety and Security of Distributed Systems

作者： Beauquier, Joffroy Burman, Janna Kutten, Shay INRIA MASCOTTE Project F-06902 Sophia Antipolis France Univ Paris 11 LRI UMR 8623 F-91405 Orsay France Technion Israel Inst Technol Dept Ind Engn & Management IL-32000 Haifa Israel

Developing self-stabilizing solutions is considered to be more challenging and complicated than developing classical solutions, where a proper initialization of the variables can be assumed. Hence, to ease the task of the developers, some automatic techniques have been proposed to design self-stabilizing algorithms. In this paper, we propose an automatic transformer for algorithms in an extended population protocol model. population protocols is a model that was introduced recently for networks with a large number of resource-limited mobile agents. We use a variant of this model. First, we assume agents having characteristics (e.g., moving speed, communication radius) affecting their intercommunication "speed", which is reflected by their cover times. Second, we assume the existence of a special agent with an unbounded memory, the base station. The automatic transformer takes as an input an algorithm solving a static problem (and meeting some additional rather natural requirements) and outputs a self-stabilizing algorithm for the same problem. The transformer is built using a re-execution approach (the technique consisting of executing an algorithm repeatedly in order to obtain its self-stabilizing version). We show that in the model we use, a transformer based on such an approach is impossible without the assumption of an unbounded memory agent. (C) 2010 Elsevier B.V. All rights reserved.

关键词： population protocols Cover time Self-stabilization Transformer

来源：评论

学校读者我要写书评

暂无评论

Efficient Size Estimation and Impossibility of Termination in Uniform Dense population protocols 19

Efficient Size Estimation and Impossibility of Termination i...

引用

38th ACM Symposium on Principles of Distributed Computing (PODC)

作者： Doty, David Eftekhari, Mahsa Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781450362177

We study uniform population protocols: networks of anonymous agents whose pairwise interactions are chosen at random, where each agent uses an identical transition algorithm that does not depend on the population size n. Many existing polylog(n) time protocols for leader election and majority computation are non-uniform: to operate correctly, they require all agents to be initialized with an approximate estimate of n (specifically, the value left perpendicularlog nright perpendicular). Our first main result is a uniform protocol for calculating log(n)+/- O(1) with high probability in O(log(2) n) time and O(log(4) n) states (O(log logn) bits of memory). The protocol is not terminating: it does not signal when the estimate is close to the true value of logn. If it could be made terminating with high probability, this would allow composition with protocols requiring a size estimate initially. We do show how our main protocol can be indirectly composed with others in a simple and elegant way, based on leaderless phase clocks, demonstrating that those protocols can in fact be made uniform. However, our second main result implies that the protocol cannot be made terminating, a consequence of a much stronger result: a uniform protocol for any task requiring more than constant time cannot be terminating even with probability bounded above 0, if infinitely many initial configurations are dense: any state present initially occupies O(n) agents. (In particular no leader is allowed.) Crucially, the result holds no matter the memory or time permitted.

关键词： population protocols size estimation termination

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Optimal Time and Space Leader Election in population protocols 20

Brief Announcement: Optimal Time and Space Leader Election i...

引用

39th Symposium on Principles of Distributed Computing

作者： Berenbrink, Petra Giakkoupis, George Kling, Peter Univ Hamburg Hamburg Germany Univ Rennes CNRS Inria IRISA Rennes France

ISBN: (纸本)9781450375825

population protocols are a model of distributed computing, where n agents with limited computational power and memory perform randomly scheduled pairwise interactions. Recently, a significant amount of work has been devoted to the study of the time and space complexity of leader election in this model. It is known that Omega(log log n) states per agent are needed to elect a leader in fewer than (Theta) over tilde (n(2)) expected interactions (Alistarh et al.;SODA'17) and that Omega(n log n) expected interactions are required regardless of the number of states (Sudo and Masuzawa;2020). On the positive side, Gasieniec and Stachowiak (SODA'18) gave the first protocol that uses an optimal Theta(log log n) number or states and elects a leader in O(n log(2) n) expected interactions. This running time was subsequently improved to O(n log n log log n) (Gasieniec et al.;SPAA'19). We provide the first leader election population protocol that is both time and space optimal, electing a leader in O(n log n) expected interactions and using Theta(log log n) states per agent. A novel component is a simple protocol that efficiently selects a small set of agents of polylog n size, given O(n(epsilon)) initially selected agents. Unlike existing approaches, which monotonically shrink this initially selected set, we first grow it in a controlled way to a specific size before shrinking it again.

关键词： population protocols leader election stabilization time

来源：评论

学校读者我要写书评

暂无评论

A Combinatorial Characterization of Self-stabilizing population protocols 1

引用

22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems

作者： Mathur, Shaan Ostrovsky, Rafail Univ Calif Los Angeles Los Angeles CA 90025 USA

ISBN: (数字)9783030643485

ISBN: (纸本)9783030643478;9783030643485

We characterize self-stabilizing functions in population protocols for complete interaction graphs. In particular, we investigate self-stabilization in systems of n finite state agents in which a malicious scheduler selects an arbitrary sequence of pairwise interactions under a global fairness condition. We show a necessary and sufficient condition for self-stabilization. Specifically we show that functions without certain set-theoretic conditions are impossible to compute in a self-stabilizing manner. Our main contribution is in the converse, where we construct a self-stabilizing protocol for all other functions that meet this characterization. Our positive construction uses Dickson's Lemma to develop the notion of the root set, a concept that turns out to fundamentally characterize self-stabilization in this model. We believe it may lend to characterizing self-stabilization in more general models as well.

关键词： population protocols Self-stabilization Anonymous Finite-state Chemical reaction networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：