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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

88 篇 期刊文献
48 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

131 篇 工学
- 82 篇 电气工程
- 67 篇 计算机科学与技术...
- 38 篇 信息与通信工程
- 22 篇 控制科学与工程
- 10 篇 石油与天然气工程
- 8 篇 交通运输工程
- 6 篇 动力工程及工程热...
- 6 篇 电子科学与技术（可...
- 6 篇 软件工程
- 3 篇 仪器科学与技术
- 3 篇 化学工程与技术
- 2 篇 机械工程
- 2 篇 土木工程
- 1 篇 材料科学与工程（可...
- 1 篇 核科学与技术
- 1 篇 环境科学与工程（可...
- 1 篇 安全科学与工程
15 篇 理学
- 7 篇 数学
- 6 篇 物理学
- 2 篇 生物学
7 篇 管理学
- 7 篇 管理科学与工程(可...
2 篇 医学
- 2 篇 基础医学(可授医学...
- 1 篇 特种医学
- 1 篇 医学技术（可授医学...
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 农学

主题

137 篇 decentralized al...
8 篇 optimization
5 篇 multi-agent syst...
4 篇 non-convex optim...
4 篇 resource managem...
4 篇 convergence
4 篇 mobile robots
4 篇 wireless sensor ...
4 篇 multi-robot syst...
4 篇 collision avoida...
4 篇 social network
4 篇 peer-to-peer com...
4 篇 task allocation
4 篇 energy efficienc...
3 篇 decentralized
3 篇 scalability
3 篇 generalized nash...
3 篇 computational co...
3 篇 algorithms
3 篇 demand response

机构

3 篇 pla univ sci & t...
3 篇 natl sun yat sen...
3 篇 carnegie mellon ...
3 篇 nanyang technol ...
3 篇 southeast univ n...
3 篇 tsinghua univ de...
2 篇 univ salerno dep...
2 篇 univ sci & techn...
2 篇 beijing inst tec...
2 篇 china acad engn ...
2 篇 tsinghua univ de...
2 篇 southwest univ c...
2 篇 tsinghua univ be...
2 篇 univ so calif de...
2 篇 xi an jiao tong ...
2 篇 univ lisbon inst...
2 篇 univ porto inesc...
2 篇 lehigh univ elec...
2 篇 vtt tech res ctr...
2 篇 univ porto fac e...

作者

3 篇 tsai shang-ho
3 篇 liu yang
3 篇 wen chao-kai
3 篇 cai yueming
3 篇 jin shi
3 篇 zheng jianchao
3 篇 amini m. hadi
3 篇 wang chang-jen
3 篇 chen xianfu
3 篇 bahrami shahab
2 篇 zhou jie
2 篇 zhang fuqing
2 篇 dong shengying
2 篇 zhang doudou
2 篇 yang bo
2 篇 kubo takeshi
2 篇 zhang tong
2 篇 tong zhang
2 篇 siano pierluigi
2 篇 feng chenyue

语言

131 篇 英文
5 篇 其他

检索条件"主题词=decentralized algorithm"

共 137 条记录，以下是91-100 订阅

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

详细简洁

排序：

decentralized intersection management through peer-to-peer technology

Decentralized intersection management through peer-to-peer t...

引用

IEEE International Conference on Peer to Peer Computing (P2P)

作者： Adams, Shawn Rutherford, Matthew J. Univ Denver Dept Comp Sci Denver CO 80208 USA

ISBN: (纸本)9781509003006

In this paper we present two new decentralized algorithms for autonomous intersection management and compare the performance of the algorithms with an established centralized solution. One of the algorithms addresses the problem through an unstructured peer-to-peer approach and the other uses a Distributed Hash Table to distribute knowledge of intersection usage among participating vehicles. We evaluate these algorithms through simulation and by comparing average delay to the performance of a centralized reservation-based algorithm. We find that in times of light congestion the decentralized algorithms perform as well as the centralized approach. During times of moderate or heavy congestion the unstructured peer-to-peer algorithm performs better than the centralized algorithm, and the DHT-based algorithm performs worse.

关键词： peer-to-peer computing road vehicles traffic engineering computing DHT-based algorithm autonomous intersection management centralized reservation-based algorithm decentralized algorithm decentralized intersection management distributed hash table heavy congestion peer-to-peer technology unstructured peer-to-peer algorithm Collision avoidance Navigation Peer-to-peer computing Robot kinematics Robot sensing systems Vehicles Peer to peer computing peer to peer Manipulator sensing systems Robot kinematics road vehicles Hash table Collision avoidance vehicle navigation algorithms Land transportation decentralized engineering computing Intersection Crossing

来源：评论

学校读者我要写书评

暂无评论

decentralized Implementation of an Optimal Energy Management Strategy in Interconnected Modular Fuel Cell Systems

Decentralized Implementation of an Optimal Energy Management...

引用

16th IEEE Vehicle Power and Propulsion Conference (VPPC)

作者： Khalatbarisoltani, Arash Boulon, Loic St-Pierre, David Lupien Hu, Xiaosong Univ Quebec Trois Rivieres Dept Elect & Comp Engn Trois Rivieres PQ Canada Univ Quebec Trois Rivieres Dept Ind Engn Trois Rivieres PQ Canada Chongqing Univ Dept Automot Engn Chongqing Peoples R China

ISBN: (纸本)9781728112497

This paper aims at designing a novel decentralized energy management strategy to optimally split the power in a modular fuel cell system (FCS). The FCS is composed of two fuel cells (FCs) in a parallel structure and a battery pack. The proposed decentralized strategy consists of two layers. Initially, a local optimization problem is solved by means of auxiliary problem principle (APP) method at each time step for each of the fuel cell modules (FCMs). Subsequently, the obtained values are broadcasted to the near FCM neighbors. At each step, the APP utilizes the power values and Lagrange parameters of the previous step shared by the sub-problem neighbors to find the solution that is the reference power for each FC. Compared to the centralized form of the APP algorithm, besides the modularity point of view, the proposed strategy is able to converge to the optimal answer faster. The final results indicate that the performance of the proposed strategy is very close to the results achieved by dynamic programming (DP).

关键词： modular system fuel cell battery energy management real-time decentralized algorithm convex quadratic programing auxiliary problem principle

来源：评论

学校读者我要写书评

暂无评论

A Game-Theoretic Approach for Optimal Base Station Sleeping in Green Cellular Networks 6

A Game-Theoretic Approach for Optimal Base Station Sleeping ...

引用

6th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Zheng, Jianchao Cai, Yueming Chen, Xianfu Li, Rongpeng Zhang, Honggang PLA Univ Sci & Technol Coll Commun Engn Nanjing 210007 Jiangsu Peoples R China VTT Tech Res Ctr Finland FI-90571 Oulu Finland Zhejiang Univ Dept Informat Sci & Elect Engn Hangzhou 310027 Zhejiang Peoples R China Univ Europeenne Bretagne Rennes France Supelec Gif Sur Yvette France

ISBN: (纸本)9781479973392

This paper proposes a distributed cooperative framework to improve the energy efficiency of green cellular networks. Based on the traffic load, neighboring base stations (BSs) cooperate to optimize the BS switching (sleeping) strategies so as to maximize the energy saving while guaranteeing users' minimal service requirements. An interaction graph is defined to capture the network impact of the BS switching operation. Then, we formulate the problem of energy saving as a constrained graphic game, where each BS acts as a game player with the constraint of traffic load. The constrained graphic game is proved to be an exact constrained potential game. Furthermore, we prove the existence of a generalized Nash equilibrium (GNE), and the best GNE coincides with the optimal solution of total energy consumption minimization. Accordingly, we design a decentralized iterative algorithm to find the best GNE (i.e., the global optimum), where only local information exchange among the neighboring BSs is needed. Simulation results finally illustrate the convergence and optimality of the proposed algorithm.

关键词： Base station sleeping distributed cooperation energy efficiency potential game generalized Nash equilibrium decentralized algorithm green cellular networks

来源：评论

学校读者我要写书评

暂无评论

Tie-Line Characteristics based Partitioning for Distributed Optimization of Power Systems

Tie-Line Characteristics based Partitioning for Distributed ...

引用

IEEE-Power-and-Energy-Society General Meeting (PESGM)

作者： Mohammadi, A. Mehrtash, M. Kargarian, A. Barati, M. Louisiana State Univ Dept Elect & Comp Engn Baton Rouge LA 70803 USA

ISBN: (纸本)9781538677032

The convergence performance of distributed optimization algorithms is of significant importance to solve optimal power flow (OPF) in a distributed fashion. In this paper, we aim to provide some insights on how to partition a power system to achieve a high convergence rate of distributed algorithms for the solution of an OPF problem. We analyzed several features of the power network to find a set of suitable partitions with the aim of convergence performance improvement. We model the grid as a graph and decompose it based on the edge betweenness graph clustering. This technique provides several partitions. To find an effective partitioning, we merge the partitions obtained by clustering technique and analyze them based on characteristics of tie-lines connecting neighboring partitions. The main goal is to find the best set of partitions with respect to the convergence speed. We deploy analytical target cascading (ATC) method to distributedly solve optimization subproblems. We test the proposed algorithm on the IEEE 118-bus system. The results show that the algorithm converges faster with a proper partitioning, whereas improper partitioning leads to a large number of iterations.

关键词： Edge Betweenness clustering decentralized algorithm Feature extraction optimal power flow

来源：评论

学校读者我要写书评

暂无评论

Spectrum Sublet Game Among Secondary Users in Cognitive Radio Networks 10th

Spectrum Sublet Game Among Secondary Users in Cognitive Radi...

引用

10th International Conference on Wireless algorithms, Systems, and Applications (WASA)

作者： Pang, Deming Zhu, Ming Hu, Gang Xu, Ming Natl Univ Def Technol Dept Network Engn Comp Sci Editorial Changsha Hunan Peoples R China

ISBN: (纸本)9783319218373;9783319218366

Dynamic spectrum sharing can improve the efficiency of spectrum utilization. Spectrum trading between primary users (PUs) and secondary users (SUs) is a popular and efficient way to fulfill this kind of spectrum sharing. In this paper we present a novel spectrum trading mechanism which operate among secondary users. More specifically, some secondary users which has leased spectrum from PUs can sublet it to other SUs to reduce their own leasing cost. Then all of the SUs can share these spectrum bands to conduct data transmission respectively. This leads to a new multi-leader multi-follower (MLMF) game which is different from existing works. The existence of Nash equilibrium of this formulated game is proven by redefining it as a shared MLMF constraint game. A decentralized algorithm is then proposed to find Nash equilibrium of this two tiers game with only local information. Simulations are provided to illustrate the convergence and effectiveness of the proposed algorithm.

关键词： Spectrum sublet Game Nash equilibrium decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

Effectiveness analysis of submarine escape mode when using abandoned communication buoy to send signals 4

Effectiveness analysis of submarine escape mode when using a...

引用

4th International Conference on Computer, Control and Robotics (ICCCR)

作者： Zhang, Doudou Jiangsu Automat Res Inst Lianyungang Peoples R China

ISBN: (纸本)9798350373141;9798350373158

The jettisoned communication buoy can provide submarine with effective covert sending capability. This paper studies the delay parameters of communication buoy and the use of escape avoidance to maintain concealment, in order to analyze the problems existing in the use of abandoned communication buoy. By studying the relationship between the parameter coefficient of the sending delay and the submarine escape speed, we can master the method of reducing the probability of submarine detection when the communication buoy sends the signal, and improve the real-time performance of the communication. The research results provide a reference for the formulation of submarine evasion scheme when the communication buoy sends signals, and are of great significance to improve the concealment efficiency of submarine.

关键词： task allocation UAV CBBA time constraints decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

Smart Information Spreading for Opinion Maximization in Social Networks

Smart Information Spreading for Opinion Maximization in Soci...

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Nayak, Anuj Hosseinalipour, Seyyedali Dai, Huaiyu North Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

ISBN: (纸本)9781728105154

The goal of opinion maximization is to maximize the positive view towards a product, an ideology or any entity among the individuals in social networks. So far, opinion maximization is mainly studied as finding a set of influential nodes for fast content dissemination in a social network. In this paper, we propose a novel approach to solve the problem, where opinion maximization is achieved through efficient information spreading. In our model, multiple sources inject information continuously into the network, while the regular nodes with heterogeneous social learning abilities spread the information to their acquaintances through gossip mechanism. One of the sources employs smart information spreading and the rest spread information randomly. We model the social interactions and evolution of opinions as a dynamic Bayesian network (DBN), using which the opinion maximization is formulated as a sequential decision problem. Since the problem is intractable, we develop multiple variants of centralized and decentralized algorithms to obtain approximate solutions. Through simulations in synthetic and real-world networks, we demonstrate two key results: 1) the proposed methods perform better than random spreading by a large margin, and 2) even though the smart source (that spreads the desired content) is unfavorably located in the network, it can outperform the contending random sources located at favorable positions.

关键词： Social network Opinion maximization Dynamic Bayesian network Q-learning decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

On meeting P2P streaming bandwidth demand with limited supplies

On meeting P2P streaming bandwidth demand with limited suppl...

引用

15th Conference on Multimedia Computing and Networking 2008

作者： Wu, Chuan Li, Baochun Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

ISBN: (纸本)9780819469908

As a basic requirement of live peer-to-peer multimedia streaming sessions, the streaming playback rate needs to be strictly enforced at each of the peers. In real-world peer-to-peer streaming sessions with very large scales, the number of streaming servers for each session may not be easily increased, leading to a limited supply of bandwidth. To scale to a large number of peers, one prefers to regulate the bandwidth usage on each of the overlay links in an optimal fashion, such that limited supplies of bandwidth may be maximally utilized. In this paper, we propose a decentralized bandwidth allocation algorithm that can be practically implemented in peer-to-peer streaming sessions. Given a mesh P2P topology, our algorithm explicitly reorganizes the bandwidth of data transmission on each overlay link, such that the streaming bandwidth demand is always guaranteed to be met at any peer in the session, without depending on any a priori knowledge of available peer upload or overlay link bandwidth. Our algorithm is especially useful when there exists no or little surplus bandwidth supply from servers or other peers. It adapts well to time-varying availability of bandwidth, and guarantees bandwidth supply for the existing peers during volatile peer dynamics. We demonstrate the effectiveness of our algorithm with in-depth simulation studies.

关键词： peer-to-peer streaming bandwidth allocation scalability decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

Grid Based 2D Navigation by a decentralized Robot System with Collison Avoidance 36

Grid Based 2D Navigation by a Decentralized Robot System wit...

引用

第36届中国控制会议

作者： Xiaotian Yang School of Electrical Engineering and Telecommunications the University of New South Wales

ISBN: (纸本)9781538629185

This paper presents a collision-free decentralized random algorithm for robots to search an unknown 2D area with *** in this paper are based on real robots instead of particles so collisions between robots are *** move along edges of a grid and randomly choose the next steps in sequence based on local sensing,communication,and the repulsive force method.A rigorous mathematical proof of convergence with probability 1 is *** a complete search of the area,an equilateral triangular grid should be used and the algorithm is compared with others in the simulation.

关键词： Grid Selection Robot Team Search decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

Resource-Aware Control via Dynamic Pricing for Congestion Game with Finite-Time Guarantees 21

Resource-Aware Control via Dynamic Pricing for Congestion Ga...

引用

21st IEEE International Workshop on Signal Processing Advances in Wireless Communications (IEEE SPAWC)

作者： Tampubolon, Ezra Ceribasic, Haris Boche, Holger Tech Univ Munich Lehrstuhl Theoret Informationstech Munich Germany Munich Ctr Quantum Sci & Technol MCQST Munich Germany

ISBN: (纸本)9781728154787

Congestion game is a widely used model for modern networked applications. A central issue in such applications is that the selfish behavior of the participants may result in resource overloading and negative externalities for the system participants. In this work, we propose a pricing mechanism that guarantees the sub-linear increase of the time-cumulative violation of the resource load constraints. The feature of our method is that it is resource-centric in the sense that it depends on the congestion state of the resources and not on specific characteristics of the system participants. This feature makes our mechanism scalable, flexible, and privacy-preserving. Moreover, we show by numerical simulations that our pricing mechanism has no significant effect on the agents' welfare in contrast to the improvement of the capacity violation.

关键词： Congestion Game Resource Allocation decentralized algorithm Mirror Descent Pricing algorithm Network Routing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：