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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,043 篇 会议
2,101 篇 期刊文献
26 篇 学位论文

馆藏范围

6,170 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,869 篇 工学
- 2,120 篇 计算机科学与技术...
- 1,869 篇 电气工程
- 957 篇 信息与通信工程
- 902 篇 控制科学与工程
- 389 篇 软件工程
- 151 篇 仪器科学与技术
- 147 篇 电子科学与技术（可...
- 135 篇 机械工程
- 70 篇 交通运输工程
- 39 篇 石油与天然气工程
- 21 篇 网络空间安全
- 20 篇 动力工程及工程热...
- 15 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 8 篇 材料科学与工程（可...
- 7 篇 航空宇航科学与技...
654 篇 理学
- 344 篇 数学
- 269 篇 系统科学
- 70 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
234 篇 管理学
- 226 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
36 篇 医学
- 31 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
2 篇 农学
1 篇 艺术学

主题

6,170 篇 distributed algo...
552 篇 convergence
544 篇 wireless sensor ...
533 篇 algorithm design...
414 篇 optimization
382 篇 computer science
366 篇 distributed comp...
363 篇 network topology
331 篇 routing
279 篇 resource managem...
217 篇 protocols
215 篇 computational mo...
210 篇 computer network...
206 篇 costs
202 篇 approximation al...
197 篇 fault tolerance
187 篇 ad hoc networks
183 篇 bandwidth
180 篇 peer to peer com...
179 篇 interference

机构

24 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
15 篇 univ liverpool d...
14 篇 suny stony brook...
14 篇 swiss fed inst t...
14 篇 purdue univ sch ...
13 篇 northeastern uni...
12 篇 univ penn dept e...
12 篇 department of el...
12 篇 weizmann inst sc...
11 篇 department of in...
11 篇 georgia state un...
11 篇 purdue univ sch ...
11 篇 univ cyprus dept...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
22 篇 notarstefano giu...
21 篇 hong yiguang
20 篇 dagdeviren orhan
20 篇 scutari gesualdo
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 khan usman a.
16 篇 schmid stefan
16 篇 sharma gokarna
15 篇 peleg david
15 篇 korman amos
15 篇 navarra alfredo
15 篇 mou shaoshuai
15 篇 zeng xianlin
15 篇 cortes jorge

语言

6,066 篇 英文
59 篇 其他
38 篇 中文
3 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

检索条件"主题词=distributed algorithms"

共 6170 条记录，以下是1611-1620 订阅

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

详细简洁

排序：

Privary Preserving distributed Average Consensus via Homomorphic Encryption 57

Privary Preserving Distributed Average Consensus via Homomor...

引用

57th IEEE Conference on Decision and Control (CDC)

作者： Hadjicostis, Christoforos N. Univ Cyprus Dept Elect & Comp Engn Nicosia Cyprus

ISBN: (纸本)9781538613955

We develop and analyze a distributed nonlinear iterative algorithm that enables the components of a multicomponent system, each with some integer initial value, to asymptotically reach average consensus on their initial values, without having to reveal to other components the specific value they contribute to the average calculation. In particular, we assume an arbitrary communication topology captured by a strongly connected digraph, in which certain nodes (components) might be curious but not malicious (i.e., they execute the proposed protocol correctly, but try to identify the initial values of other nodes). We first discuss how a distributed algorithm that operates exclusively on integer values can be used to obtain the average of the node values. We then describe how this algorithm can be adjusted using homomorphic encryption to allow the nodes to obtain the average of their initial values while ensuring their privacy, at least assuming the presence of a trusted node.

关键词： Encryption Privacy Protocols Topology distributed algorithms Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Strong consistency of the distributed stochastic gradient algorithm

Strong consistency of the distributed stochastic gradient al...

引用

IEEE Annual Conference on Decision and Control

作者： Die Gan Zhixin Liu Key Laboratory of Systems and Control Chinese Academy of Sciences

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

With the development of computer science and communication, the sensor networks are widely applied due to the advantages of flexibility, fault tolerance, and ease of deployment. In this paper, a distributed stochastic gradient (SG) algorithm is proposed where the distributed estimators are aimed to collectively estimate an unknown time-invariant parameter from a set of noisy measurements obtained by distributed sensors. The proposed distributed SG algorithm combines the consensus strategy of the estimation of neighbors with the diffusion of regression vectors. The cooperative excitation condition is introduced, under which the strong consistency can be established for the distributed SG algorithm, without relying on the independency and stationarity assumptions of regression vectors which are commonly used in existing literature.

关键词： Manganese Signal processing algorithms Convergence Estimation Symmetric matrices Eigenvalues and eigenfunctions distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Fixed-Time distributed Algorithm for Economic Dispatch in Smart Grid

Fixed-Time Distributed Algorithm for Economic Dispatch in Sm...

引用

Chinese Automation Congress (CAC)

作者： Hui Li Ying-Jiang Zhou Guo-Ping Jiang Sheng-Yu Ge Shuai Zhou Department of Automation and Artificial Intelligence Nanjing University of Posts and Telecommunications Nanjing P. R. China

The power dispatch is the key to guarantee the operation stability of power grid, with development of society, Along with societys development progress, scholars begin to realize gradually, the traditional economic dispatching method already could not meet the needs. Under this background, distributed economic dispatch has received more and more attention from scholars. This paper proposes a distributed economic dispatch algorithm, and this algorithm can realize fixed-time convergence and minimize the total system cost for economic dispatch on the prerequisite of the balance between demand side and supply side. Under the fixed-time stability theory, when the initial states is bounded, the fixed-time algorithm can be proved. Finally, some cases are simulated to illustrate efficiency of the algorithm we proposed.

关键词： Economics Smart grids Generators distributed algorithms Convergence Laplace equations Power system stability

来源：评论

学校读者我要写书评

暂无评论

Trekking Based distributed Algorithm for Opportunistic Spectrum Access in Infrastructure-less Network 16

Trekking Based Distributed Algorithm for Opportunistic Spect...

引用

16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Kumar, Rohit Yadav, A. Darak, S. J. Hanawal, Manjesh K. NIT Delhi Dept Elect & Commun Engn Delhi 110040 India Texas A&M Univ Elect & Comp Engn College Stn TX 77843 USA IIIT Delhi Dept Elect & Commun Engn Delhi 110020 India Indian Inst Technol Ind Engn & Operat Res IEOR Grp Bombay 460076 Maharashtra India

ISBN: (纸本)9783903176003

An opportunistic spectrum access (OSA) in the infrastructure-less network has received significant attention in last few years due to their ability to improve spectrum utilization as well as usefulness in the infrastructure-less networks established for disaster relief and military applications. The main research problem for feasible implementation of such network is to achieve coordination among secondary users (SUs) (i.e. unlicensed users). Existing algorithms incur a significant number of collisions which in turn require retransmissions and hence, lead to inefficient use of battery power, spectrum and time. In this paper, we set-up the problem as a multi-player Bandit and develop a new distributed algorithm which allows SUs to select one of the top channels with a significantly fewer number of collisions. We show that the proposed algorithm has constant regret with high confidence. We validate our claims and the superiority of the proposed algorithm over existing state-of-theart algorithms through the exhaustive simulated experiments as well as a realistic USRP based experiments in the real radio environment.

关键词： Channel estimation Throughput Batteries distributed algorithms Heuristic algorithms Electronic mail Channel allocation

来源：评论

学校读者我要写书评

暂无评论

A Primal Decomposition Method with Suboptimality Bounds for distributed Mixed-Integer Linear Programming 57

A Primal Decomposition Method with Suboptimality Bounds for ...

引用

57th IEEE Conference on Decision and Control (CDC)

作者： Camisa, Andrea Notarnicola, Ivano Notarstefano, Giuseppe Univ Salento Dept Engn Lecce Italy Univ Bologna Dept Elect Elect & Informat Engn Bologna Italy

ISBN: (纸本)9781538613955

In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints. MILPs are NP-hard problems and several challenges arise in a distributed framework, so that looking for suboptimal solutions is of interest. To achieve this goal, the presence of a linear coupling calls for tailored decomposition approaches. We propose a fully distributed algorithm based on a primal decomposition approach and a suitable tightening of the coupling constraints. Agents repeatedly update local allocation vectors, which converge to an optimal resource allocation of an approximate version of the original problem. Based on such allocation vectors, agents are able to (locally) compute a mixed-integer solution, which is guaranteed to be feasible after a sufficiently large time. Asymptotic and finite-time suboptimality bounds are established for the computed solution. Numerical simulations highlight the efficacy of the proposed methodology.

关键词： Resource management distributed algorithms Couplings Heuristic algorithms Optimization Approximation algorithms Smart grids

来源：评论

学校读者我要写书评

暂无评论

A Consensus-based Approach for distributed Quickest Detection of Significant Events in Networks

A Consensus-based Approach for Distributed Quickest Detectio...

引用

Asilomar Conference on Signals, Systems & Computers

作者： Jian Li Don Towsley Shaofeng Zou Venugopal V. Veeravalli Gabriela Ciocarlie Binghamton University-SUNY University of Massachusetts Amherst University at Buffalo University of Illinois at Urbana-Champaign SRI International

ISBN: (数字)9781728143002

ISBN: (纸本)9781728143019

This paper studies the problem of quickest detection of significant events in networks, where nodes undergo a change in the data generating the distributions of their observations due to events that occurred at some unknown time. Events can propagate dynamically along edges in the network to affect more nodes over time; however, the propagation dynamics are assumed to be unknown. A consensus-based distributed-detection algorithm is proposed to detect a "significant" event, i.e., at least η nodes have been affected by the event, as quickly as possible, subject to false alarm constraints. It is shown that the proposed distributed algorithm achieves an equivalent performance to that of a centralized algorithm, which was shown to be first-order asymptotically optimal, as the false alarm rate goes to zero. Finally, numerical experiments are provided to evaluate the efficiency of the proposed algorithm.

关键词： distributed algorithms Heuristic algorithms Delays Change detection algorithms Image edge detection Sensors Convergence

来源：评论

学校读者我要写书评

暂无评论

distributed Energy-Adaptive Aggregation Scheduling with Coverage Guarantee For Battery-Free Wireless Sensor Networks

Distributed Energy-Adaptive Aggregation Scheduling with Cove...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Kunyi Chen Hong Gao Zhipeng Cai Quan Chen Jianzhong Li Harbin Institute of Technology Georgia State University Guangdong University of Technology

Thanks to the recent advances in energy-harvesting devices, nodes equipped with such devices are produced and enable Wireless Sensor Networks (WSNs) to be energy self-sustainable. Such networks are named as Battery-Free WSNs (BF-WSNs). Data aggregation is an essential operation in WSNs, and the Minimum Latency Aggregation Scheduling (MLAS) problem which seeks a collision-free aggregation scheduling with the minimum latency has been well studied in Battery-Powered WSNs (BP-WSN). In BP-WSNs, latency is mainly caused by the time overhead in collision-avoiding. However, the time-consumption for node recharging is the main cause of latency in BF-WSNs. Moreover, the collisions are time-independent while the recharge rate is time-varying. Therefore, the previous algorithms are not suitable for BF-WSNs. In addition, if aggregating data from all nodes, the latency would be determined by the node with the lowest recharge rate. Thus, we propose to aggregate a subset of nodes which can meet the given coverage quality requirement. Meanwhile, the aggregation tree and scheduling strategy should be adaptive to the current energy condition. We formulate this problem and propose a distributed algorithm which can select nodes adaptively according to their energy condition and schedule these nodes to achieve the minimum latency, simultaneously. To the best of our knowledge, it is the first distributed algorithm to solve the MLAS problem with coverage guarantee in BF-WSNs. The simulation results verify that our algorithm can reduce aggregation latency effectively, especially in bad energy condition.

关键词： Wireless sensor networks Schedules Monitoring Energy consumption Interference distributed algorithms Data aggregation

来源：评论

学校读者我要写书评

暂无评论

distributed Learning over Time-Varying Graphs with Adversarial Agents

Distributed Learning over Time-Varying Graphs with Adversari...

引用

International Conference on Information Fusion

作者： Pooja Vyavahare Lili Su Nitin H. Vaidya Indian Institute of Technology Tirupati Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Georgetown University

ISBN: (数字)9780996452786

ISBN: (纸本)9781728118406

In this work, we study the problem of non-Bayesian learning in time-varying (dynamic) networks when there are some adversarial (faulty) agents in the network. The set of faulty agents is fixed across time. The connectivity graph of the network is changing at each time step and is unknown to the agents. In every time step, each non-faulty agent collects partial information about an unknown state of the environment. Each non-faulty agent tries to estimate the true state of the environment by iteratively sharing information with its neighbors at each time step. We first present an analysis of a distributed algorithm in static communication network with faulty agents which does not require the network to achieve consensus. Existing algorithms in this setting require that all non-faulty agents in the network should be able to achieve consensus via local information exchange. We then extend this analysis to dynamic networks with relaxed network condition. We show that if every non-faulty agent can receive enough information (via iteratively communicating with neighbors) to differentiate the true state of the world from other possible states then it can indeed learn the true state.

关键词： Communication networks Graph theory Multi-agent systems Network theory (graphs) Time-varying systems distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A Scalable distributed algorithm for Least Squares Solutions in Double-layered Multi-agent Networks

A Scalable Distributed algorithm for Least Squares Solutions...

引用

American Control Conference

作者： Xuan Wang Shaoshuai Mou School of Aeronautics and Astronautics Purdue University West Lafayette IN 47906 USA

ISBN: (纸本)9781538679012;9781538679265

In this paper, we propose a scalable distributed algorithm for double-layered multi-agent network to cooperatively find the least square solutions to an over-determined linear equation. Compared with existing consensus-based distributed linear equation solvers, the double-layered network structure allows us to implement two types of coordination, namely consensus and conservation, simultaneously. As a result, the proposed algorithm has achieved better scalability in the sense that each agent does not need to know a full row of the overall equation. The convergence of our algorithm is exponential, which has been validated by both analytical proof and numerical simulations.

关键词： NETWORKING AGENT distributed algorithms Scalability Linear equation algorithms Agents Network

来源：评论

学校读者我要写书评

暂无评论

Data Attack Method in Completely distributed Control Mode Based on DC-OPF

Data Attack Method in Completely Distributed Control Mode Ba...

引用

Sustainable Power and Energy Conference (iSPEC)

作者： Liyuan Jin Yiqun Song Key Laboratory of Control of Power Transmission and Transformation Ministry of Education Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781728149318

Aiming at the completely distributed control mode that adapts to the problem of high penetration of renewable energy access, the paper points out the possibility of data attack and proposes a data attack method based on DC-OPF distributed algorithm. The impact mechanism of this data attack method is analyzed, and the way to formulate the optimal data attack plan is proposed. Finally, simulation results show that in the completely distributed control mode, all nodes have the possibility of implementing data attacks driven by economic interests, and points out the necessity of market supervision to regulate the behavior of nodes.

关键词： high penetration of renewable energy cyber-physic coupling DC-OPF distributed algorithm data attack distributed algorithms decentralised control Control modes impact mechanism Simulation results Ganglia

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 158 159 160 161 162 163 164 165 166 167 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：