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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,293 篇 期刊文献
792 篇 会议
14 篇 学位论文

馆藏范围

2,099 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,945 篇 工学
- 1,148 篇 计算机科学与技术...
- 968 篇 电气工程
- 614 篇 信息与通信工程
- 284 篇 控制科学与工程
- 170 篇 软件工程
- 128 篇 电子科学与技术（可...
- 79 篇 仪器科学与技术
- 69 篇 石油与天然气工程
- 51 篇 交通运输工程
- 35 篇 动力工程及工程热...
- 31 篇 机械工程
- 15 篇 土木工程
- 12 篇 测绘科学与技术
- 11 篇 航空宇航科学与技...
- 11 篇 网络空间安全
- 10 篇 化学工程与技术
- 7 篇 材料科学与工程（可...
284 篇 理学
- 205 篇 数学
- 45 篇 系统科学
- 34 篇 物理学
- 22 篇 生物学
- 20 篇 化学
- 12 篇 统计学（可授理学、...
175 篇 管理学
- 168 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
25 篇 经济学
- 18 篇 应用经济学
- 7 篇 理论经济学
24 篇 医学
- 16 篇 临床医学
- 11 篇 基础医学(可授医学...
6 篇 教育学
3 篇 农学
3 篇 军事学
3 篇 艺术学
2 篇 法学

主题

2,099 篇 distributed algo...
133 篇 distributed algo...
78 篇 wireless sensor ...
75 篇 resource allocat...
74 篇 optimization
62 篇 consensus
55 篇 convergence
55 篇 wireless sensor ...
50 篇 game theory
40 篇 fault tolerance
40 篇 self-stabilizati...
38 篇 routing
36 篇 smart grid
36 篇 nash equilibrium
33 篇 convex optimizat...
33 篇 power control
32 篇 economic dispatc...
32 篇 multi-agent syst...
32 篇 sensor networks
31 篇 leader election

机构

16 篇 princeton univ d...
14 篇 univ chinese aca...
13 篇 univ rennes 1 ir...
12 篇 tsinghua univ de...
11 篇 nanyang technol ...
11 篇 chinese acad sci...
10 篇 ohio state univ ...
10 篇 southeast univ s...
10 篇 shanghai jiao to...
9 篇 georgia state un...
9 篇 nanjing univ sta...
9 篇 univ liverpool d...
9 篇 univ houston dep...
9 篇 univ sci & techn...
9 篇 florida atlantic...
8 篇 zhejiang univ co...
8 篇 tsinghua univ de...
8 篇 nanyang technol ...
8 篇 shanghai jiao to...
8 篇 chinese univ hon...

作者

33 篇 raynal michel
20 篇 pandurangan gopa...
17 篇 yu dongxiao
16 篇 molla anisur rah...
15 篇 chiang mung
14 篇 bourgeois julien
13 篇 wu weigang
13 篇 yu jiguo
13 篇 hong yiguang
12 篇 kowalski dariusz...
12 篇 li yushuai
11 篇 masuzawa toshimi...
11 篇 chen guihai
10 篇 sau buddhadeb
10 篇 zhang huaguang
10 篇 cao jiannong
10 篇 lau francis c. m...
10 篇 raynal m
9 篇 mostefaoui achou...
9 篇 kakugawa hirotsu...

语言

2,029 篇 英文
49 篇 其他
18 篇 中文

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

共 2099 条记录，以下是1081-1090 订阅

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

详细简洁

排序：

Assembling Swarm with Limited Visibility in Presence of Line Obstacles 1st

Assembling Swarm with Limited Visibility in Presence of Line...

引用

1st International Conference on Advances in Computing and Data Sciences (ICACDS)

作者： Tokas, Pratibha Mekala, Aravind Das, Deepanwita Natl Inst Technol Burdwan 713209 W Bengal India

ISBN: (纸本)9789811054273;9789811054266

In this paper, we have proposed a distributed algorithm for assembling of swarm of autonomous mobile robots on the left boundary of a rectangular region in presence of opaque horizontal line obstacles. The robots are having limited visibility capabilities and they are randomly scattered inside the region together with the obstacles. The robots do not have any message exchange among themselves. In the proposed algorithm, the robots follow the CORDA model for computation. In addition to that, synchronous/semi-synchronous timing model and full compass model are also followed. Our algorithm guarantees successful assembling of all the robots on the left boundary of the given region in a collision free manner.

关键词： Swarm robots Assembling Passive communication Limited visibility distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Framework of Cloud Resource Allocation and Power Management Using Deep Reinforcement Learning 37

A Hierarchical Framework of Cloud Resource Allocation and Po...

引用

37th IEEE International Conference on distributed Computing Systems (ICDCS)

作者： Liu, Ning Li, Zhe Xu, Jielong Xu, Zhiyuan Lin, Sheng Qiu, Qinru Tang, Jian Wang, Yanzhi Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

ISBN: (纸本)9781538617915

Automatic decision-making approaches, such as reinforcement learning (RL), have been applied to (partially) solve the resource allocation problem adaptively in the cloud computing system. However, a complete cloud resource allocation framework exhibits high dimensions in state and action spaces, which prohibit the usefulness of traditional RL techniques. In addition, high power consumption has become one of the critical concerns in design and control of cloud computing systems, which degrades system reliability and increases cooling cost. An effective dynamic power management (DPM) policy should minimize power consumption while maintaining performance degradation within an acceptable level. Thus, a joint virtual machine (VM) resource allocation and power management framework is critical to the overall cloud computing system. Moreover, novel solution framework is necessary to address the even higher dimensions in state and action spaces. In this paper, we propose a novel hierarchical framework for solving the overall resource allocation and power management problem in cloud computing systems. The proposed hierarchical framework comprises a global tier for VM resource allocation to the servers and a local tier for distributed power management of local servers. The emerging deep reinforcement learning (DRL) technique, which can deal with complicated control problems with large state space, is adopted to solve the global tier problem. Furthermore, an autoencoder and a novel weight sharing structure are adopted to handle the high-dimensional state space and accelerate the convergence speed. On the other hand, the local tier of distributed server power managements comprises an LSTM based workload predictor and a model-free RL based power manager, operating in a distributed manner. Experiment results using actual Google cluster traces show that our proposed hierarchical framework significantly saves the power consumption and energy usage than the baseline while achieving n

关键词： Deep reinforcement learning hierarchical framework resource allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks 16

Uniform Information Exchange in Multi-channel Wireless Ad Ho...

引用

16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)

作者： Yu, Dongxiao Ning, Li Zhang, Yong Jin, Hai Wang, Yuexuan Lau, Francis C. M. Feng, Shengzhong Huazhong Univ Sci & Technol Serv Comp Technol & Syst Lab Big Data Technol & Syst Lab Clusters & Grid Comp LabSch Comp Sci & Technol Wuhan Hubei Peoples R China Chinese Acad Sci Ctr High Performance Comp Shenzhen Inst Adv Technol Shenzhen Peoples R China Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9781510855076

Information exchange is a basic primitive for maintaining the smooth running of a network or a system with multiple communicating agents. Given k packets initially stored at k nodes respectively, the problem is to disseminate the k packets to the whole network with the objective of minimizing the time used. We study this problem in single-hop multi-channel networks of n nodes, and target on devising uniform distributed protocols that do not rely on any prior knowledge of network parameters, such as the network size n or the number of packet holders k. Uniform protocols have better scalability and are more suitable for implementation in reality. Specifically, we propose a uniform distributed protocol that with high probability accomplishes the dissemination in O (k/F + F . log n) rounds, assuming F available channels. This protocol is asymptotically optimal when k is large (k >= F-2 . log n), and provides the best possible linear speedup with multiple channels comparing with the results using a single channel. To the best of our knowledge, this is the first uniform protocol for information exchange in multi-channel networks.

关键词： Information exchange multi-channel networks distributed algorithm uniform protocol

来源：评论

学校读者我要写书评

暂无评论

Optimal Energy Management Based on Users' Comfort Degree in a Microgrid 1

Optimal Energy Management Based on Users' Comfort Degree in ...

引用

1st IEEE International Conference on Energy Internet (ICEI)

作者： Zhang, WenPing Xu, Yinliang Sun Yat Sen Univ SYSU CMU Shunde Int Joint Res Inst Sch Elect & Informat Technol Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9781509057597

Demand side management (DSM) is an effective approach to reduce peak load and maintain the power supply-demand balance in a microgrid. However, most existing methods mainly minimize the electricity cost and total power loss based on the real-time price, there is little consideration of the influences to users' comfort degree. In this paper, home energy management system (HEMS) is proposed to support the load control based on users' comfort degree and utility maximization in a microgrid. This system contains four typical load models including air conditioning, lighting, electric vehicle and washing machine. Every load user aims to maximize its individual comfort d egree and minimize the electricity cost, while each generation supplier aims to maximize its total revenue received from the load users. The distributed algorithm assigns an agent to each load user (generation supplier) to compute the optimal price and load demand (power supply). Finally, the effectiveness of proposed approach is validated by simulation studies.

关键词： comfort degree distributed algorithm energy management systems microgrid

来源：评论

学校读者我要写书评

暂无评论

On output selection for a large scale networked system with constraints

On output selection for a large scale networked system with ...

引用

Chinese Automation Congress (CAC)

作者： Chen, Xiujia Zhou, Tong Tsinghua Univ Dept Automat Beijing Peoples R China Tsinghua Univ TNList Beijing Peoples R China

ISBN: (纸本)9781538635247

Based on properties of the Kalman filter, a distributed sensor placement method is proposed for output selection in a large scale networked system with sensor location constraints and/or performance constraints. This method only utilizes parameter matrices of the subsystem and its connection matrices with other subsystems to evaluate all the possible sensor locations of the large scale networked system. An attractive property of this method is that its computational efficiency is much higher than the greedy algorithm's. In addition, a lower and upper bound for the trace of the state estimation error covariance of the Kalman filter is determined to reveal the fundamental design limitations and structural design limitations. The results of numerical simulations confirm the effectiveness and the high computational efficiency of the method.

关键词： networked system Kalman filter sensor placement distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and verification of a collaborative task execution procedure using BPMN modeler

Design and verification of a collaborative task execution pr...

引用

International Conference on Advances in Computing, Communications and Informatics (ICACCI)

作者： Nath, Amar Niyogi, Rajdeep Indian Inst Technol Roorkee Roorkee 247667 Uttar Pradesh India

ISBN: (纸本)9781509063673

There are numerous situations in which collaboration of two or more agents is required to accomplish a task. The accomplishment of such task by physical agents (i.e., robots) is possible only when all the agents are at the location where the task is to be carried out. Even though, if multiple agents are available in an environment but, unlikely spread at different locations, they will not able to carry out the task. Hence, all the required agents must reach to the location where the task needs to be carried out. The current multi-agent system community assumes that the entire set of an agent is available for task execution. However, this assumption always needs not hold, as the new task may arrive at any location within the closed environment. This is an important and challenging problem to gather the required number of agents, especially when we don't know the location and time of task arrival. In this paper, we suggest a fully distributed algorithm based on explicit communication that ensures the collaborative task execution in mobile physical agent setting. Furthermore, we simulated the algorithm using Bizagi BPMN (Business Process Model and Notation) modeler which allows checking almost all execution paths of the algorithm by taking different probability distributions. The experimental results validate the correctness of the algorithm.

关键词： distributed algorithm verification BAVIN agent coordination collaborative task execution Bizagi BPMN modeler

来源：评论

学校读者我要写书评

暂无评论

A Time Hierarchy Theorem for the LOCAL Model 58

A Time Hierarchy Theorem for the LOCAL Model

引用

58th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Chang, Yi-Jun Pettie, Seth Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781538634646

The celebrated Time Hierarchy Theorem for Turing machines states, informally, that more problems can be solved given more time. The extent to which a time hierarchy-type theorem holds in the classic distributed LOCAL model has been open for many years. In particular, it is consistent with previous results that all natural problems in the LOCAL model can be classified according to a small constant number of complexities, such as O(1), O(log*n), O (log n), 2O((root log n)), etc. In this paper we establish the first time hierarchy theorem for the LOCAL model and prove that several gaps exist in the LOCAL time hierarchy. Our main results are as follows: We define an infinite set of simple coloring problems called Hierarchical 21/2-Coloring. A correctly colored graph can be confirmed by simply checking the neighborhood of each vertex, so this problem fits into the class of locally checkable labeling (LCL) problems. However, the complexity of the k-level Hierarchical 21/2-Coloring problem is circle minus(n(1/k)), for k is an element of Z(+). The upper and lower bounds hold for both general graphs and trees, and for both randomized and deterministic algorithms. Consider any LCL problem on bounded degree trees. We prove an automatic-speedup theorem that states that any randomized n(o(1))-time algorithm solving the LCL can be transformed into a deterministic O (log n)-time algorithm. Together with a previous result, this establishes that on trees, there are no natural deterministic complexities in the ranges omega(log*n)-o(log n) or omega(log n)-n(o(1)). We expose a gap in the randomized time hierarchy on general graphs. Roughly speaking, any randomized algorithm that solves an LCL problem in sublogarithmic time can be sped up to run in O(T-LLL) time, which is the complexity of the distributed Lovasz local lemma problem, currently known to be Omega (log log n) and 2(O(root log log n)) on bounded degree graphs. Finally, we revisit Naor and Stockmeyer's characterization of O(1

关键词： distributed algorithm locally checkable labeling local model time hierarchy theorem

来源：评论

学校读者我要写书评

暂无评论

Multi-robot Assembling Along a Boundary of a Given Region in Presence of Opaque Line Obstacles 2nd

引用

2nd International Conference on Intelligent Computing and Applications (ICICA)

作者： Das, Deepanwita Mukhopadhyaya, Srabani Nandi, Debashis Natl Inst Technol Mahatma Gandhi Ave Durgapur 713209 W Bengal India Birla Inst Technol Kolkata Extens Ctr Kolkata 700107 W Bengal India

ISBN: (纸本)9789811016455;9789811016448

This paper presents a distributed algorithm for assembling a swarm of autonomous mobile robots on a common boundary of a given polygonal region in presence of opaque horizontal line obstacles. Robots and obstacles are initially scattered in an unknown environment and they do not have direct communication among themselves. The algorithm guarantees successful assembling of all the robots on the left boundary of the given region within finite amount of time and without facing any collision during their movement. The intermediate distances among the assembled robots are not fixed. In this proposed algorithm, the robots follow the basic Wait-Observe-Compute-Move model together with the Full-Compass and Synchronous/Semi-synchronous timing models.

关键词： Robot swarm Assembling Passive communication distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Use of Bio-Inspired Desynchronization algorithms for Beaconing in ITS

On the Use of Bio-Inspired Desynchronization Algorithms for ...

引用

IEEE International Conference on Communications (ICC)

作者： Mouradian, Alexandre Veque, Veronique Univ Paris Saclay Univ Paris Sud Cent Supelec L2SUMR8506CNRS F-91192 Gif Sur Yvette France

ISBN: (纸本)9781467389990

Road safety applications heavily rely on periodic message exchanges known as beaconing in order to gain awareness about the current situation within the vehicle communication range. The high level of transmission contention in dense vehicular networks can induce successive beacon collisions. These collisions impede the vehicles to have an up-to-date view of the environment which can lead to bad decisions from the applications and in the worst case create car crashes. Many propositions of the literature try to tackle this problem by modifying the beacon emission period and/or power either randomly or based on the network density or other measured indicators. In this paper, we explore the possibility to use bio-inspired desynchronization algorithms to avoid beacon collisions. The main idea behind these algorithms is to make nodes converging toward a consensus where they do not emit their beacon at the same time in order to avoid collisions. We show that desynchronization algorithms, if properly implemented, can significantly reduce the probability to have large inter-beacon delays.

关键词： Anti-phase synchronization beaconing distributed algorithm Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Efficient Infrastructure Damage Detection and Localization Using Wireless Sensor Networks, with Cluster Generation for Monitoring Damage Progression 8

Efficient Infrastructure Damage Detection and Localization U...

引用

8th IEEE Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)

作者： Contreras, William Ziavras, Sotirios New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)9781538611043

Structural health monitoring (SHM) involves the development of strategies to assess the condition of instrumented engineering structures. One of the most critical applications of SHM systems is civil infrastructure. For this application, it is particularly important that SHM systems be inexpensive and easy to deploy, since the maintenance of infrastructure is often inadequately funded. Wireless sensor networks (WSN) can be very useful toward this end. We present an efficient WSN-based SHM algorithm for detecting, localizing, and monitoring the progression of damage in infrastructure applications. The algorithm utilizes a novel vibration-based pattern matching technique that is very well suited for low-power WSN nodes. During a training phase, a body of reference patterns is formed from vibrations observed at sensor nodes distributed throughout the structure. During the operational phase, observed patterns are compared to the reference patterns to determine if a match exists. Through the use of an innovative distributed algorithm, a time complexity of O(logN) is achieved for the matching process. If a match does not exist, potential damage is indicated and the reference pattern closest to the observed pattern is determined using Euclidean distance. The difference between the two patterns indicates the sensor nodes at which potential damage exists. Clusters are then formed around these sensor nodes in order to monitor the progression of local damage. Simulations are performed in MATLAB for a typical bridge deployment in order to determine the degree of overlapping that occurs as clusters are generated in response to potential damage. The simulations indicate that overlapping increases gracefully as the number of nodes experiencing damage increases.

关键词： distributed algorithm Vibration measurement Wireless sensor network Clustering algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共210页 << < 105 106 107 108 109 110 111 112 113 114 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：