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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

191 篇 期刊文献
113 篇 会议
4 篇 科技报告
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

271 篇 工学
- 162 篇 电气工程
- 110 篇 计算机科学与技术...
- 95 篇 控制科学与工程
- 54 篇 信息与通信工程
- 19 篇 软件工程
- 15 篇 石油与天然气工程
- 9 篇 仪器科学与技术
- 8 篇 动力工程及工程热...
- 5 篇 机械工程
- 5 篇 交通运输工程
- 4 篇 电子科学与技术（可...
- 4 篇 网络空间安全
- 2 篇 土木工程
- 2 篇 测绘科学与技术
- 2 篇 环境科学与工程（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
56 篇 理学
- 31 篇 数学
- 27 篇 系统科学
- 10 篇 物理学
- 5 篇 化学
- 4 篇 生物学
- 1 篇 地理学
- 1 篇 生态学
25 篇 管理学
- 23 篇 管理科学与工程(可...
- 2 篇 工商管理
- 2 篇 公共管理
5 篇 医学

主题

310 篇 consensus algori...
53 篇 blockchain
25 篇 multi-agent syst...
22 篇 sensor networks
21 篇 distributed opti...
18 篇 distributed cont...
15 篇 distributed esti...
14 篇 internet of thin...
14 篇 cooperative cont...
13 篇 wireless sensor ...
11 篇 distributed ledg...
10 篇 security
10 篇 decentralized co...
9 篇 cryptocurrency
8 篇 pbft
8 篇 networked system...
8 篇 distributed algo...
8 篇 cryptography
7 篇 networked contro...
7 篇 scalability

机构

5 篇 univ calif san d...
4 篇 univ padua dept ...
4 篇 mit informat & d...
4 篇 univ calif santa...
3 篇 univ. of padova
3 篇 johann bernoulli...
3 篇 carnegie mellon ...
3 篇 concordia univ d...
2 篇 technion israel ...
2 篇 york univ on m3j...
2 篇 univ trieste dep...
2 篇 politecn milan d...
2 篇 nirma univ inst ...
2 篇 biobio univ elec...
2 篇 telecom paristec...
2 篇 arizona state un...
2 篇 supelec gif sur ...
2 篇 north carolina s...
2 篇 univ illinois co...
2 篇 german aerosp ct...

作者

6 篇 schenato luca
6 篇 shi guodong
6 篇 barbarossa sergi...
5 篇 mohammadi arash
5 篇 varagnolo damian...
5 篇 asif amir
5 篇 johansson karl h...
5 篇 olshevsky alex
5 篇 ferrari-trecate ...
4 篇 pillonetto gianl...
4 篇 schiffer johanne...
4 篇 tsitsiklis john ...
4 篇 martinez sonia
4 篇 bullo francesco
4 篇 hachem walid
4 篇 rabbat michael g...
4 篇 bianchi pascal
4 篇 scutari gesualdo
3 篇 gianluigi pillon...
3 篇 luca schenato

语言

305 篇 英文
3 篇 其他
2 篇 中文

检索条件"主题词=Consensus Algorithms"

共 310 条记录，以下是121-130 订阅

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

详细简洁

排序：

Newton-Raphson consensus for distributed convex optimization

Newton-Raphson consensus for distributed convex optimization

引用

50th IEEE Conference of Decision and Control (CDC)/European Control Conference (ECC)

作者： Zanella, Filippo Varagnolo, Damiano Cenedese, Angelo Pillonetto, Gianluigi Schenato, Luca Univ. of Padova Italy

ISBN: (纸本)9781612848013

We study the problem of unconstrained distributed optimization in the context of multi-agents systems subject to limited communication connectivity. In particular we focus on the minimization of a sum of convex cost functions, where each component of the global function is available only to a specific agent and can thus be seen as a private local cost. The agents need to cooperate to compute the minimizer of the sum of all costs. We propose a consensus-like strategy to estimate a Newton-Raphson descending update for the local estimates of the global minimizer at each agent. In particular, the algorithm is based on the separation of time-scales principle and it is proved to converge to the global minimizer if a specific parameter that tunes the rate of convergence is chosen sufficiently small. We also provide numerical simulations and compare them with alternative distributed optimization strategies like the Alternating Direction Method of Multipliers and the Distributed Subgradient Method.

关键词： distributed optimization convex optimization consensus algorithms multi-agent systems Newton-Raphson methods

来源：评论

学校读者我要写书评

暂无评论

CONVERGENCE SPEED IN DISTRIBUTED consensus AND AVERAGING

CONVERGENCE SPEED IN DISTRIBUTED CONSENSUS AND AVERAGING

引用

45th IEEE Conference on Decision and Control

作者： Olshevsky, Alex Tsitsiklis, John N. MIT Informat & Decis Syst Lab Cambridge MA 02139 USA

We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm.

关键词： consensus algorithms distributed averaging cooperative control

来源：评论

学校读者我要写书评

暂无评论

EVENT-BASED consensus FOR A CLASS OF HETEROGENEOUS MULTI-AGENT SYSTEMS: AN LMI APPROACH

EVENT-BASED CONSENSUS FOR A CLASS OF HETEROGENEOUS MULTI-AGE...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Amini, Amir Mohammadi, Arash Asif, Amir Concordia Univ Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)9781509041176

Based on the theory of linear matrix inequalities (LMI), this paper proposes an event-based distributed consensus algorithm for linear multi-agent/sensor networks that are heterogeneous. The proposed scheme is event-based in the sense that each agent transmits its information to its neighbouring nodes only under predefined circumstances. Ensuring the stability of the closed-loop system, the Lyapunov theorem is utilized to compute design parameters (heterogeneous controller gains and transmission threshold) used in the proposed consensus algorithm. Numerical simulations demonstrate a performance gain in the convergence time and a reduction in the number of data transmissions with the proposed approach.

关键词： consensus algorithms Event-based transmission Distributed agent/sensor networks Linear Matrix Inequalities (LMIs)

来源：评论

学校读者我要写书评

暂无评论

Randomized consensus with Attractive and Repulsive Links

Randomized Consensus with Attractive and Repulsive Links

引用

52nd IEEE Annual Conference on Decision and Control (CDC)

作者： Shi, Guodong Proutiere, Alexandre Johansson, Mikael Johansson, Karl H. Royal Inst Technol ACCESS Linnaeus Ctr Sch Elect Engn S-10044 Stockholm Sweden

ISBN: (纸本)9781467357173

We study convergence properties of a randomized consensus algorithm over a graph with both attractive and repulsive links. At each time instant, a node is randomly selected to interact with a random neighbor. Depending on if the link between the two nodes belongs to a given subgraph of attractive or repulsive links, the node update follows a standard attractive weighted average or a repulsive weighted average, respectively. The repulsive update has the opposite sign of the standard consensus update. In this way, it counteracts the consensus formation and can be seen as a model of link faults or malicious attacks in a communication network, or the impact of trust and antagonism in a social network. Various probabilistic convergence and divergence conditions are established. A threshold condition for the strength of the repulsive action is given for convergence in expectation: when the repulsive weight crosses this threshold value, the algorithm transits from convergence to divergence. An explicit value of the threshold is derived for classes of attractive and repulsive graphs. The results show that a single repulsive link can sometimes drastically change the behavior of the consensus algorithm. They also explicitly show how the robustness of the consensus algorithm depends on the size and other properties of the graphs.

关键词： random networks consensus algorithms gossiping sensor networks opinion dynamics social networks

来源：评论

学校读者我要写书评

暂无评论

Ultrafast consensus in small-world networks

Ultrafast consensus in small-world networks

引用

American Control Conference 2005 (ACC)

作者： Olfati-Saber, R CALTECH Pasadena CA 91125 USA

ISBN: (纸本)0780390989

In this paper, we demonstrate a phase transition phenomenon in algebraic connectivity of small-world networks. Algebraic connectivity of a graph is the second smallest eigenvalue of its Laplacian matrix and a measure of speed of solving consensus problems in networks. We demonstrate that it is possible to dramatically increase the algebraic connectivity of a regular complex network by 1000 times or more without adding new links or nodes to the network. This implies that a consensus problem can be solved incredibly fast on certain small-world networks giving rise to a network design algorithm for ultrafast information networks. Our study relies on a procedure called "random rewiring" due to Watts & Strogatz (Nature, 1998). Extensive numerical results are provided to support our claims and conjectures. We prove that the mean of the bulk Laplacian spectrum of a complex network remains invariant under random rewiring. The same property only asymptotically holds for scale-free networks. A relationship between increasing the algebraic connectivity of complex networks and robustness to link and node failures is also shown. This is an alternative approach to the use of percolation theory for analysis of network robustness. We also show some connections between our conjectures and certain open problems in the theory of random matrices.

关键词： small-world networks networked systems consensus algorithms phase transition graph Laplacians algebraic connectivity network robustness random matrices

来源：评论

学校读者我要写书评

暂无评论

A Journey from Commit Processing in Distributed Databases to consensus in Blockchain 38

A Journey from Commit Processing in Distributed Databases to...

引用

38th IEEE International Conference on Data Engineering (ICDE)

作者： Kant, Kamal Pandey, Sarvesh Shanker, Udai MMM Univ Technol Dept Comp Sci & Engn Gorakhpur Uttar Pradesh India BHU Dept Comp Sci MMV Varanasi Uttar Pradesh India MMMUT Dept Comp Sci & Engn Gorakhpur Uttar Pradesh India

ISBN: (数字)9781665408837

ISBN: (纸本)9781665408837

Blockchain Technology (BT) is a futuristic data management technology that eliminates the intermediary/third-party/central authority as it is operated over a peer-to-peer network running cryptographic protocols. It is tamper-proof as it utilizes a cryptographic hash feature. Some other features, it offers, are transparency, security, inalterability, immutability, and decentralization;these features of the BTs have acquired the wide attention of the computing research community. While a transaction is occurring between two parties, it ensures that the trust is a consensus-driven built-in technology component instead of relying on a third party for the same. With the help of a consensus algorithm, the newly generated block is appended at the end of the already existing chain. In this paper, a thorough analysis of the various blockchain consensus algorithms is conducted including their benefits and drawbacks. Finally, it enlists the challenges and opportunities in designing blockchain consensus algorithms. Further, it proposes an idea for designing a blockchain consensus algorithm and concludes the discussion.

关键词： Blockchain Transparency Privacy Leader Selection Cryptography consensus algorithms

来源：评论

学校读者我要写书评

暂无评论

Information-weighted consensus Filtering under Limited Communication 22

Information-weighted Consensus Filtering under Limited Commu...

引用

22nd World Congress of the International Federation of Automatic Control (IFAC)

作者： Khan, Shiraz Hwang, Inseok Purdue Univ Sch Aeronaut & Astronaut W Lafayette IN 47906 USA

ISBN: (纸本)9781713872344

A distributed sensor network refers to a set of stationary or mobile agents equipped with sensors, each of which observes and estimates the state of some system, while utilizing the communication channels of the sensor network to improve the overall state estimation performance of the network. In particular, consensus-based distributed state estimation algorithms can compute accurate state estimates of the system at each agent under relaxed observability conditions, using a low communication bandwidth. A drawback of many existing consensus-based approaches is that they are developed under the presumption that a large number of consensus subiterations are used, which may not be possible in large-scale sensor networks, in the presence of communication delays and/or energy constraints. In this paper, we develop an extension of the Information-weighted consensus Filter (ICF) for the case where only a limited number of consensus subiterations are possible. Through mathematical analysis and numerical simulations, it is shown that the proposed algorithm improves upon the existing algorithms under identical computation and communication requirements. Copyright (c) 2023 The Authors.

关键词： Networked systems consensus algorithms distributed state estimation multi-agent systems wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Reaching consensus in Crowdsourced Transcription of Biocollections Information 10

Reaching Consensus in Crowdsourced Transcription of Biocolle...

引用

10th IEEE International Conference on e-Science (e-Science)

作者： Matsunaga, Andrea Mast, Austin Fortes, Jose A. B. Univ Florida Dept Elect & Comp Engn Adv Comp & Informat Syst Lab Gainesville FL 32611 USA Florida State Univ Dept Biol Sci Tallahassee FL 32306 USA

ISBN: (纸本)9781479942879

Crowdsourcing can be a cost-effective method for tackling the problem of digitizing historical biocollections data, and a number of crowdsourcing platforms have been developed to facilitate interaction with the public and to design simple "Human Intelligence Tasks". However, the problem of reaching consensus on the response of the crowd is still challenging for tasks for which a simple majority vote is inadequate. This paper (a) describes the challenges faced when trying to reach consensus on data transcribed by different workers, (b) offers consensus algorithms for textual data and a consensus-based controller to assign a dynamic number of workers per task, and (c) proposes further enhancements of future crowdsourcing tasks in order to minimize the need for complex consensus algorithms. Experiments using the proposed algorithms show up to a 45-fold increase in ability to reach consensus when compared to majority voting using exact string matching. In addition, the controller is able to decrease the crowdsourcing cost by 55% when compared to a strategy that uses a fixed number of workers.

关键词： crowdsourcing consensus algorithms digitization biocollections infrastructure biodiversity

来源：评论

学校读者我要写书评

暂无评论

Enhancing wireless networked monitoring system sustainability by multi-hop consensus algorithm 6

Enhancing wireless networked monitoring system sustainabilit...

引用

IEEE Workshop on Environmental Energy and Structural Monitoring Systems (EESMS)

作者： Frezzetti, Antonio Manfredi, Sabato Univ Naples Federico II Dept Elect Engn & Technol Informat DIETI Naples Italy

ISBN: (纸本)9781479949885

The widely studied consensus protocols have been increasingly used in industrial monitoring applications to support distributed process control. As the theoretical convergence rate covers vast interests in literature, techniques to speed up the convergence rate of consensus have been extensively explored, whereas their effects on the energetic consumption and on the sensor node technology have received a relatively lower attention. This work proposes to analyze jointly the energetic consumption and the consensus convergence rate in a Wireless Sensor Network scenario. Two different consensus techniques have been compared: the single-hop and the multi-hop algorithms. An environmental simulator has been built to validate the above techniques. Results show that multi-hop algorithm may be preferable to preserve the network lifetime, while the single-hop is more suitable in order to achieve higher speed of convergence.

关键词： Wireless Sensor networks consensus algorithms Networked Monitoring systems

来源：评论

学校读者我要写书评

暂无评论

The convergence rate of Newton-Raphson consensus optimization for quadratic cost functions

The convergence rate of Newton-Raphson consensus optimizatio...

引用

51st IEEE Annual Conference on Decision and Control (CDC)

作者： Zanella, Filippo Varagnolo, Damiano Cenedese, Angelo Pillonetto, Gianluigi Schenato, Luca Univ Padua Dept Informat Engn I-35131 Padua Italy

ISBN: (纸本)9781467320665

We consider the convergence rates of two convex optimization strategies in the context of multi agent systems, namely the Newton-Raphson consensus optimization and a distributed Gradient-Descent opportunely derived from the first. To allow analytical derivations, the convergence analyses are performed under the simplificative assumption of quadratic local cost functions. In this framework we derive sufficient conditions which guarantee the convergence of the algorithms. From these conditions we then obtain closed form expressions that can be used to tune the parameters for maximizing the rate of convergence. Despite these formulae have been derived under quadratic local cost functions assumptions, they can be used as rules-of-thumb for tuning the parameters of the algorithms in general situations.

关键词： distributed optimization convex optimization consensus algorithms multi-agent systems Newton-Raphson methods rate of convergence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：