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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,944 篇 工学
- 1,147 篇 计算机科学与技术...
- 968 篇 电气工程
- 614 篇 信息与通信工程
- 285 篇 控制科学与工程
- 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,096 篇 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,028 篇 英文
48 篇 其他
18 篇 中文
3 篇 德文
3 篇 法文
3 篇 俄文

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

共 2096 条记录，以下是1911-1920 订阅

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

详细简洁

排序：

Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks

Self-stabilizing weight-based clustering algorithm for ad ho...

引用

2nd International Workshop on algorithmic Aspects of Wireless Sensor Networks

作者： Johnen, Colette Nguyen, Le Huy Univ Paris 11 CNRS UMR 8623 LRI Batiment 490 F-91405 Orsay France

ISBN: (纸本)9783540690856

Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a fixed infrastructure. Fast self-reconfiguration and power efficiency are very important property on any sensor network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering increases the scalability and the energy efficiency of communication among the sensors. A self-stabilizing algorithm, regardless of the initial system state, converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing algorithms are adapted highly dynamic networks. In. this paper we present a Self-stabilizing Clustering algorithm for Ad hoc sensor network. Our algorithm adapts faster than other algorithms to topology changes.

关键词： self-stabilization distributed algorithm clustering sensor network

来源：评论

学校读者我要写书评

暂无评论

Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks

Efficient Construction of Weakly-Connected Dominating Set fo...

引用

IEEE Global Telecommunications Conference (GLOBECOM 06)

作者： Han, Bo Jia, Weijia City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781424403561

In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is more suitable for cluster formation is the weakly-connected dominating set (WCDS). We propose an area based distributed algorithm for WCDS formation with time and message complexity O(n). In this Area algorithm, we partition the wireless nodes into different areas, use some deterministic criteria to select the nodes for the WCDS in each area and adjust the area borders by adding additional nodes to the final WCDS. The effectiveness of our algorithm is confirmed through analysis and comprehensive simulation study.

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

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Self-stabilizing spanning tree algorithm for large scale systems

Brief announcement: Self-stabilizing spanning tree algorithm...

引用

8th International Symposium on Stabilization, Safety and Security of distributed Systems (SSS 2006)

作者： Herault, Thomas Lemarinier, Pierre Peres, Olivier Pilard, Laurence Beauquier, Joffroy Univ Paris 11 LRI Bat 490 F-91405 Orsay France

ISBN: (纸本)3540490183

We introduce a self-stabilizing algorithm that builds and maintains a spanning tree topology on any large scale system. We assume that the existing topology is a complete graph and that nodes may arrive or leave at any time. To cope with the large number of processes of a grid or a peer to peer system, we limit the memory usage of each process to a small constant number of variables, combining this with previous results concerning failure detectors and resource discovery.

关键词： distributed algorithm large scale systems self-stabilization spanning tree construction failure detectors

来源：评论

学校读者我要写书评

暂无评论

Mcore: A simple structure for effective overlay multicast on mobile ad hoc networks

Mcore: A simple structure for effective overlay multicast on...

引用

18th IASTED International Conference on Parallel and distributed Computing and Systems

作者： Li, Yamin Peng, Shietung Chu, Wanming Hosei Univ Dept Comp Sci Tokyo 1848584 Japan Univ Aizu Dept Comp Hardware Aizu Wakamatsu Fukushima 9658580 Japan

ISBN: (纸本)9780889866386

Overlay multicast protocol constructs a virtual mesh spanning all member nodes of a multicast group and employs standard unicast routing to fulfill multicast functionality on application layer. The advantages of this approach are simplicity and flexibility. However, efficiency and stability are the issues that must be addressed as the size of the multicast group grows in the mobile ad hoc networks (MANETs). In this paper, we propose an effective structure for overlay multicast to solve these problems in MANETs. Instead of using a spanning tree on the virtual mesh, we adopt a simple structure called MCore for multicast. An MCore is a path that minimizes the sum of the distances of all vertices to the path plus the length of the path. The MCore is more stable and easier to maintain than the spanning tree in MANETs. The simulation results show that our approach handles the flexibility and mobility issues in overlay multicast protocols effectively for large multicast group size.

关键词： mobile ad hoc networks (MANETs) multicast overlay mesh efficiency stability distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Layering as optimization decomposition: Questions and answers

Layering as optimization decomposition: Questions and answer...

引用

IEEE Military Communications Conference (MILCOM 2006)

作者： Chiang, Mung Low, Steven H. Calderbank, A. Robert Doyle, John C. Princeton Univ Dept Elect Engn Princeton NJ 08544 USA CALTECH Comp Sci & Elect Engn Dept Pasadena CA 91125 USA Princeton Univ Elect Engn & Math Dept Princeton NJ 08544 USA CALTECH Ctrl & Dynam Syst Dept Pasadena CA USA

ISBN: (纸本)9781424406173

Network protocols in layered architectures have historically been obtained on an ad-hoc basis, and much of the recent cross-layer designs are conducted through piecemeal approaches. Network protocols may instead be holistically analyzed and systematically designed as distributed solutions to some global optimization problems in the form of generalized Network Utility Maximization (NUM), providing insight on what they optimize and on the structures of network protocol stacks. In the form of 10 Questions and Answers, this paper presents a short survey of the recent efforts towards a systematic understanding of "layering" as "optimization decomposition". The overall communication network is modeled by a generalized NUM problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems. Furthermore, there are many alternative decompositions, each leading to a different layering architecture. Industry adoption of this unifying framework has also started. Here we summarize the current status of horizontal decomposition into distributed computation and vertical decomposition into functional modules such as congestion control, routing, scheduling, random access, power control, and coding. We also discuss under-explored future research directions in this area. More importantly than proposing any particular cross-layer design, this framework is working towards a mathematical foundation of network architectures and the design process of modularization.

关键词： adaptive coding cross-layer design congestion control distributed algorithm Lagrange duality MAC network architecture network utility maximization optimization power control reverse engineering routing TCP/IP scheduling stochastic control wireless ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

All k-bounded policies are equivalent for self-stabilization

All <i>k</i>-bounded policies are equivalent for self-stabil...

引用

8th International Symposium on Stabilization, Safety and Security of distributed Systems (SSS 2006)

作者： Beauquier, Joffroy Johnen, Colette Messika, Stephane Univ Paris 11 CNRS LRI Bat 490 F-91405 Orsay France

ISBN: (纸本)3540490183

We reduce the problem of proving the convergence of a randomized self-stabilizing algorithm under k-bounded policies to the convergence of the same algorithm under a specific policy. As a consequence, all k-bounded schedules are equivalent: a given algorithm is self-stabilizing under one of them if and only if it is self-stabilizing under any of them.

关键词： randomized algorithms distributed algorithm self-stabilizing system scheduler

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Cooperative Routing in Multi-hop Wireless Ad Hoc Networks

<bold>Energy-Efficient Cooperative Routing in Multi-hop </bo...

引用

25th IEEE International Performance Computing and Communications Conference

作者： Li, Fulu Wu, Kui Lippman, Andrew MIT Media Lab Cambridge MA 02139 USA Univ Victoria Dept Comp Sci Victoria BC V8W 2Y2 Canada

ISBN: (纸本)1424401976

We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i.e., using cooperative radio transmission to find the best route with the minimum energy cost from a source node to a destination node, is NP-cornplete. We thus propose a Cooperative Shortest Path (CSP) algorithm that uses the Dijkstra's algorithm as the basic building block and reflects the cooperative transmission properties in the relaxation procedure. Simulation results show that with more nodes added in the network, our approach achieves more energy saving compared to traditional non-cooperative shortest path algorithms. Another interesting observation is that the proposed algorithm achieves better fairness among different nodes with denser networks. Implementation issues are also discussed.

关键词： cooperative routing energy efficiency wireless networks complexity theory distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust self-stabilizing clustering algorithm

引用

10th International Conference on Principles of distributed Systems

作者： Johnen, Colette Nguyen, Le Huy Univ Paris 11 CNRS UMR 8623 LRI Batiment 490 F-91405 Orsay France

ISBN: (纸本)9783540499909

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists in partitioning network nodes into groups called clusters, giving a hierarchical organization of the network. A self-stabilizing algorithm, regardless of the initial system configuration, converges to legitimates configurations without external intervention. Due to this property, self-stabilizing algorithms tolerate transient faults. In this paper we present a robust self-stabilizing clustering algorithm for ad hoc network. The robustness property guarantees that, starting from an arbitrary configuration, in one round, network is partitioned into clusters. After that, the network stays partitioned during the convergence phase toward a legitimate configuration where the clusters partition ensures that any neighborhood has at most k clusterheads (k is a given parameter).

关键词： self-stabilization distributed algorithm clustering ad hoc networking

来源：评论

学校读者我要写书评

暂无评论

Layering as optimization decomposition: Current status and open issues

Layering as optimization decomposition: Current status and o...

引用

40th Annual Conference on Information Sciences and Systems (CISS)

作者： Chiang, Mung Low, Steven H. Calderbank, A. Robert Doyle, John C. Princeton Univ Dept Elect Engn Princeton NJ 08544 USA CALTECH Dept Comp Sci & Elect Engn Pasadena CA 91125 USA Princeton Univ Dept Elect Engn & Math Princeton NJ 08544 USA CALTECH Control & Dynam Syst Dept Pasadena CA 91125 USA

ISBN: (纸本)1424403499

Net work protocols in layered architectures have historically been obtained on an ad-hoe basis, and much or the recent cross-layer designs are conducted through piecemeal approaches. Network protocols may instead be holistically analyzed and systematically designed as distributed solutions to some global optimization problems in the form of generalized Network Utility Maximization (NUM), providing insight on what they optimize and structures of the network protocol stack. This paper presents a short survey of the recent efforts towards a systematic understanding or "layering" as "optimization decomposition", where the overall communication network is modeled by a generalized NUM problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems. Furthermore, there are many alternative decompositions, each leading to a different layering architecture. Industry adoption of this unifying framework has also started. Here we summarize the current status of horizontal decomposition into distributed computation and vertical decomposition into functional modules such as congestion control, routing, scheduling, random access, power control, and coding. Key messages and methodologies arising out of many recent work are listed. Then we present a list of challenging open issues in this area and the initial progress made on some of them.

关键词： adaptive coding cross-layer design congestion control distributed algorithm Lagrange duality MAC network utility maximization optimization power control reverse engineering routing TCP/IP scheduling stochastic control wireless ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

On self-stabilizing search trees

引用

20th International Symposium on distributed Computing

作者： Bein, Doina Datta, Ajoy K. Larmore, Lawrence L. Univ Nevada Las Vegas NV 89154 USA

ISBN: (纸本)3540446249

We introduce a self-stabilizing data structure, which we call either a min-max search tree or a max-min search tree (both abbreviated (MST)-S-2), depending on whether the root has the minimum or the maximum value in the tree. Our structure is a refinement of the standard min-max heap (or max-min heap), with additional property that every value in the left subtree of a node is less than or equal to every value in the right subtree of that node. The (MST)-S-2 has all the power of a binary search tree and all the power of a min-max heap, combined;with the additional feature that maintaining balance is easy. We give a self-stabilizing algorithm for reorganizing the values of an asynchronous network with a binary tree topology into an (MST)-S-2 in O(n) rounds. We then give an algorithm for reorganizing an asynchronous network with a binary tree topology, which is already in (MST)-S-2 order, into binary search tree order in O(h) rounds. This result answers an open problem posed in [3].

关键词： distributed algorithm Min-max heap Search tree Self-stabilization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共210页 << < 188 189 190 191 192 193 194 195 196 197 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：