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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,284 篇 期刊文献
789 篇 会议
14 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

2,087 篇 distributed algo...
132 篇 distributed algo...
77 篇 wireless sensor ...
74 篇 resource allocat...
73 篇 optimization
62 篇 consensus
55 篇 convergence
55 篇 wireless sensor ...
48 篇 game theory
40 篇 fault tolerance
40 篇 self-stabilizati...
38 篇 routing
36 篇 smart grid
35 篇 nash equilibrium
33 篇 convex optimizat...
33 篇 power control
32 篇 economic dispatc...
32 篇 sensor networks
31 篇 multi-agent syst...
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,020 篇 英文
49 篇 其他
18 篇 中文
3 篇 德文
3 篇 法文
3 篇 俄文

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

共 2087 条记录，以下是2041-2050 订阅

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

详细简洁

排序：

Brief announcement: improved asynchronous group mutual exclusion in token-passing networks 05

Brief announcement: improved asynchronous group mutual exclu...

引用

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

作者： David Lin Teng-Sheng Moh Melody Moh San Jose State University San Jose CA

ISBN: (纸本)9781581139945

Group mutual exclusion (GME) was first introduced by Joung in 1998 as a generalization of the n-process mutual exclusion problem, and subsequently modeled as the Congenial Talking Philosophers problem. GME allows processes requesting for the same resource to concurrently access the shared resource. However, a process requesting a resource that is different from the one currently being used will not be able to access the requested resource at the same time. At any time, only one resource may be in *** have been two solutions to the GME problem for a ring network. The first solution proposed by Wu and Joung [2] had an unbounded message size problem, while the second solution proposed by Cantarell et. al. [1] attempted to provide an upper-bound for the message size. However, in doing so, the second solution generated an unbounded number of messages. Hence, in this work we present a GME algorithm for a token-passing network that solves both of the problems found in the two previous solutions by providing an upper bound both to the number of messages and to message size.

关键词： message-passing distributed algorithm group mutual exclusion mutual exclusion token-passing

来源：评论

学校读者我要写书评

暂无评论

The Stackelberg Power Control Game in Wireless Data Networks

The Stackelberg Power Control Game in Wireless Data Networks

引用

2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

作者： Hua Jiang Junhu Ruan School of Economics and ManagementHebei University of EngineeringHandan China School of Economics and Management Hebei University of Engineering Handan China

The Stackelberg game is introduced into the power control game,which makes all users in system work in the best equal Signal-to-interference(SIR).A new distributed algorithm based on Stackelberg Power control Game (SPG) is *** simulation results indicate the algorithm can improve the capability of the *** receive higher utility and lower transmit power relatively,the use of wireless resources become more rational and impartial,and the convergence of the algorithm is good.

关键词： stackelberg game distributed algorithm wireless data networks power control

来源：评论

学校读者我要写书评

暂无评论

A Real-time Power Allocation algorithm for Dispersed Energy Storages and Its Communication Network Design

A Real-time Power Allocation Algorithm for Dispersed Energy ...

引用

IEEE Power and Energy Society General Meeting

作者： Meidan Zhang Huanhai Xin Zehan Lu Deqiang Gan John Seuss College of Electrical Engineering Zhejiang Uni versity Hangzhou 310027 China School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA 30332 USA

ISBN: (纸本)9781479913022

The paper presents a distributed algorithm that regulates the power output of multiple geographically dispersed energy storages, which are to provide secondary control service. The proposed algorithm is based on the cooperative control principle of the network control theory and it satisfies both power balance requirement and fair utilization among the dispersed energy storages. A virtual leader embedded in one or several energy storages is necessary to receive the power command. In addition, to improve the robustness of communication network among energy storages, one optimization model is formulated to design the so-called 'N-I' abundant network, considering economic issue. Under the proposed algorithm and designed communication network, dispersed energy storages are able to have both self-organizing and adaptive coordination properties even under some adverse conditions. Simulations on the IEEE 123-bus distribution system validate the effectiveness of the proposed algorithm.

关键词： Smart Grid Communication network Dispersed energy storage Fair utilization N-I distributed algorithm energy storage networks(communications) distributed algorithms Smart grids Power output

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation in Cellular Systems for Applications with Random Parameters

Resource Allocation in Cellular Systems for Applications wit...

引用

International Conference on Computing, Networking and Communications

作者： Zaid Kbah Ahmed Abdelhadi University of New Haven Hume Center Virginia Tech

ISBN: (纸本)9781467385800

In this paper, we conduct a study to optimize resource allocation for adaptive real-time and delay-tolerant applications in cellular systems. To represent the user applications via several devices and equipment, sigmoidal-like and logarithmic utility functions are used. A fairness proportional utility functions policy approach is used to allocate the resources among the user equipment (UE)s in a utility percentage form in order to ensure a minimum level of customer satisfaction for all the subscribers. Meanwhile, the priority of resources allocation is given to the real-time applications. We measure the effect of the stochastic variations of the adaptive real-time applications on the optimal rate allocation process and compare the results of the deterministic and stochastic systems. Our work is distinct from the other resource allocation optimization works in that we use the bisection method besides convex optimization techniques to optimally allocate rates, and we present the adaptive real-time applications in a stochastic form. We use Microsoft Visual Basic for Applications with Arena Simulation Software interface to simulate the optimization problem. Finally, we present our optimization algorithm results.

关键词： Resource allocation QoS Robustness Real-time applications distributed algorithm Stochastic modeling

来源：评论

学校读者我要写书评

暂无评论

Communication Complexity Evaluation for Longestlived Directional Multicasting in WANETs

Communication Complexity Evaluation for Longestlived Directi...

引用

2008 IEEE International Conference on Communications(ICC 2008)

作者： Abdulmotaleb El Saddik Department of Computer Science University of Ottawa

We consider the problem of maximizing the multicast lifetime in wireless ad hoc networks with directional *** a simulation study,we have discovered that the existing distributed algorithm for such optimization problem may generate considerable number of control messages to build up a longest-lived multicast tree in large-scale *** may prohibit them from being used directly in ad hoc networks with limited energy and *** this paper,we would like to investigate some mechanisms to improve the communication complexity of the distributed *** explore some important properties of this optimization problem from a graph theory perspective and derive several localized operations that are especially beneficial to the resource-constrained (*** energy,memory,and computation capabilities) wireless ad hoc *** localized operations have low complexity for both memory and computation requirements at each *** simulation results show that the proposed localized operations would allow our distributed algorithms to achieve an expected linear communication complexity.

关键词： Wireless ad hoc network multicast algorithm energy efficiency distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Content Replication and Server Selection for Video-On-Demand

Joint Optimization of Content Replication and Server Selecti...

引用

IEEE International Conference on Communications

作者： Huan Huang Pengye Xia S. H. Gary Chan Guangyu Shi Hongbo Zhang Department of Compute Science and Engineering The Hong Kong University of Science and Technology Huawei Technologies Co. Ltd

ISBN: (纸本)9781457720529

We study providing large-scale video-on-demand (VoD) service to distributed users. In order to achieve scalability in user capacity and reduce the load of the core network, local servers with heterogeneous storage are deployed. Each server replicates the movie segments depending on their access probabilities. Considering the realistic scenario that underlay delay is a function of the total traffic in the link (including cross-traffic), we address two important problems to achieve low user interactive delay: 1) Which segments should each server replicate under the constraints of their capacities to achieve network-wide good locality effect? This is the so-called content replication (CR) problem;and 2) Given a number of remote servers with the requested segment, which one should serve the user? This is the so-called server selection (SS) problem. CR and SS problems couple with each other. In this paper, we propose a simple and distributed algorithm which seeks to jointly optimize CR and SS. The algorithm, termed CR-SS, achieves good caching locality by adaptively replacing segments and selecting servers with a simple lookup. Simulation results on Internet-like topologies show that CR-SS outperforms existing and state-of-the-art approaches by a wide margin, achieving substantially lower user delay.

关键词： Joint optimization distributed algorithm Content replication Server selection Video-on-demand

来源：评论

学校读者我要写书评

暂无评论

Uniform Circle Formation by Asynchronous Robots: A Fully-distributed Approach

Uniform Circle Formation by Asynchronous Robots: A Fully-Dis...

引用

International Conference on Computer Communication and Networks

作者： Shan Jiang Jiannong Cao Jia Wang Milos Stojmenovic Julien Bourgeois Hong Kong Polytechnic University Hong Kong China Singidunum University Belgrade Serbia FEMTO-ST Institute Montbeliard France

Recent advances in robotics technology have made it practical to deploy a large number of inexpensive robots in a wide range of application domains. In many of those applications, a group of autonomous robots is required to form a predefined geometric shape such as a line or a circle. This problem, namely pattern formation, is one of the most important coordination problems in multi-robot systems. A particular pattern extensively studied in literature is the uniform circle, and the corresponding problem is called uniform circle formation. In uniform circle formation, a set of simple mobile robots (asynchronous, autonomous), starting from arbitrary positions on the plane, have to arrange themselves on the vertices of a regular polygon eventually. Towards addressing the problem, existing works usually make conveniently strong assumptions, i.e., the robots are regarded as mass points and have unlimited sensing and communication range. The question of whether the robots with actual size and limited sensing and communication range could form a uniform circle, to our knowledge, has remained open. In this paper, we propose a new approach towards addressing this issue. Three phases, consensus on the circle, circle formation, and uniform transformation, constitute our approach. We propose novel distributed algorithms for convex hull construction and cardinality estimation. Simulation results, theoretical analysis, and successful deployment have shown the effectiveness and practicability of our approach.

关键词： multi-robot system uniform circle formation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Three-phase Load Flow Accommodated Large Scale Heat Pumps Based on Asynchronous Iteration Scheme

Distributed Three-phase Load Flow Accommodated Large Scale H...

引用

IEEE Conference on Energy Internet and Energy System Integration

作者： Yuntao Ju Zhinan Qi Lin Ye Jingjing Zheng Yong Yang College of Information and Electrical Engineering China Agricultural University State grid Gansu electric power research institute

ISBN: (纸本)9781538614280

With deployment of large scale distributed heat pumps, three-phase load flow considering heat pumps impact is a basic tool to analysis distribution network profile. Since there are numerous three-phase distribution network nodes and communication delay impact etc., centralized load flow and synchronous iterated load flow is difficult to achieve. Firstly, three-phase load flow with large scale heat pumps is proposed based on implicit node impedance method, secondly, asynchronous iterated load flow is proposed based on matrix-split scheme. The proposed method is suitable for distribution network distributed load flow. Finally, the proposed method is validated with IEEE 123 test feeder.

关键词： Load flow distributed algorithm Asynchronous Iteration Electric heating Three-phase unbalance

来源：评论

学校读者我要写书评

暂无评论

Decentralized algorithm for Repeating Pattern Formation by Multiple Robots

Decentralized Algorithm for Repeating Pattern Formation by M...

引用

International Conference on Parallel and distributed Systems (ICPADS)

作者： Shan Jiang Junbin Liang Jiannong Cao Jia Wang Jinlin Chen Zhixuan Liang Department of Computing The Hong Kong Polytechnic University School of Computer and Electronic Information Guangxi University

ISBN: (纸本)9781728125848

Recently, much attention is paid to multi-robot systems due to their widespread applications such as warehouse robotics, persistent surveillance, and exploration of unknown environments. Although urgently required by the applications, coordination among multiple robots remains to be challenging. Among the problems of multi-robot coordination, pattern formation serves a fundamental one. It aims to control a group of robots to form a desired shape with some certain goals such as best formation quality, minimum makespan or minimum total distance. Existing works mainly focus on the formation of certain patterns, such as repeating squares or a circle. those approaches cannot be generalized to arbitrary pattern formation. In this paper, we propose a decentralized algorithm for a multi-robot system to generate a given formation with an arbitrary repeating pattern. We introduce basic pattern graph and assembling graph to define a repeating pattern and formation quality for measurement. Towards solving the repeating pattern formation problem, our approach is divided into two phases. The robots are grouped into multiple basic patterns in the first phase, and the patterns are assembled level by level in the second phase. Simulations and real-world experiments indicate the effectiveness and practicability of our approach.

关键词： Multi-robot system Pattern formation distributed algorithm Pattern formation embryo pattern formation Cooperating robots multi-robot systems repetitive patterns distributed algorithms basic pattern formation Unknown environments Robot Decentralized Robot System

来源：评论

学校读者我要写书评

暂无评论

Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks 02

Approximating minimum size weakly-connected dominating sets ...

引用

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing

作者： Yuanzhu Peter Chen Arthur L. Liestman Simon Fraser University British Columbia Canada

ISBN: (纸本)9781581135015

We present a series of approximation algorithms for finding a smallweakly-connected dominating set (WCDS) in a given graph to be usedin clustering mobile ad hoc networks. The structure of a graph canbe simplified using WCDS's and made more succinct for routing in adhoc networks. The theoretical performance ratio of these algorithmsis O(ln Δ) compared to the minimum size WCDS, whereΔ is the maximum degree of the input graph. The first twoalgorithms are based on the centralized approximation algorithms ofGuha and Khuller cite guha-khuller-1998 for finding small connecteddominating sets (CDS's). The main contribution of this work is acompletely distributed algorithm for finding small WCDS's and theperformance of this algorithm is shown to be very close to that ofthe centralized approach. Comparisons between our work and someprevious work (CDS-based) are also given in terms of the size ofresultant dominating sets and graph connectivity degradation.

关键词： clustering weakly-connected dominating set ad hoc network dominating set distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共209页 << < 200 201 202 203 204 205 206 207 208 209 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：