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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,032 篇 会议
2,167 篇 期刊文献
34 篇 学位论文

馆藏范围

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

日期分布

学科分类号

3,925 篇 工学
- 2,158 篇 计算机科学与技术...
- 1,870 篇 电气工程
- 955 篇 信息与通信工程
- 908 篇 控制科学与工程
- 407 篇 软件工程
- 156 篇 仪器科学与技术
- 155 篇 电子科学与技术（可...
- 137 篇 机械工程
- 72 篇 交通运输工程
- 40 篇 石油与天然气工程
- 21 篇 动力工程及工程热...
- 21 篇 网络空间安全
- 16 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 9 篇 材料科学与工程（可...
- 8 篇 航空宇航科学与技...
690 篇 理学
- 371 篇 数学
- 274 篇 系统科学
- 77 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
233 篇 管理学
- 225 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
37 篇 医学
- 32 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
3 篇 农学
2 篇 艺术学
1 篇 法学

主题

6,233 篇 distributed algo...
545 篇 wireless sensor ...
543 篇 convergence
526 篇 algorithm design...
409 篇 optimization
381 篇 computer science
372 篇 distributed comp...
361 篇 network topology
328 篇 routing
279 篇 resource managem...
219 篇 protocols
210 篇 computational mo...
207 篇 computer network...
202 篇 costs
199 篇 approximation al...
199 篇 fault tolerance
186 篇 ad hoc networks
181 篇 bandwidth
179 篇 wireless network...
178 篇 peer to peer com...

机构

25 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 univ liverpool d...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
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 篇 shanghai jiao to...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
21 篇 hong yiguang
21 篇 notarstefano giu...
21 篇 scutari gesualdo
20 篇 dagdeviren orhan
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 cortes jorge
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

语言

6,128 篇 英文
62 篇 其他
38 篇 中文
4 篇 德文
1 篇 法文
1 篇 葡萄牙文
1 篇 俄文
1 篇 土耳其文

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

共 6233 条记录，以下是4951-4960 订阅

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

详细简洁

排序：

Reliable broadcast in the crash-recovery model

Reliable broadcast in the crash-recovery model

引用

Reliable distributed Systems

作者： R. Boichat R. Guerraoui Communication Systems Department Swiss Federal Institute of Technology Lausanne Switzerland

The paper addresses the problem of broadcasting messages in a reliable manner within a practical asynchronous system where processes and channels may crash and recover. In this crash-recovery model, we present meaningful specifications of reliable broadcast and we describe algorithms that implement those specifications. Our approach is modular and incremental. It is modular in the sense that we give the properties of reliable broadcast separately, and then consider their composition. It is incremental in the sense that we show how to automatically transform any reliable broadcast algorithm that implements a given specification into one that implements a stronger specification. In particular we show how to reuse, in a crash-recovery model, reliable broadcast algorithms that were initially designed in a simpler crash-stop model.

关键词： Broadcasting Computer crashes Reliability theory Broadcast technology Communication systems Algorithm design and analysis distributed computing Intersymbol interference distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Collaborative Resource Management for Video Over Wireless Multi-Hop Mesh Networks

Collaborative Resource Management for Video Over Wireless Mu...

引用

IEEE International Conference on Image Processing

作者： Nicholas Mastronarde Deepak S. Turaga Mihaela van der Schaar Electrical and Computer Engineering University of California Davis USA IBM Research Hawthorne NY USA Electrical Engineering University of California Los Angeles USA

In this paper, we consider the problem of real-time multimedia transmission among several peers (users). The peers use a heterogeneous wireless multi-hop mesh network for the delivery of these high-bandwidth streams. One of the main challenges of the considered problem is the division of the scarce wireless resources among the various peers. To address this problem, we propose an efficient, distributed and collaborative framework for wireless resource exchanges that enables peers to divide available wireless resources among themselves based on their quality of service (QoS) requirements, the underlying channel conditions and network topology. The scalable coding of the video content and decomposition of video flows into various sub-flows (priorities) allow peers to transfer the video at different quality levels, depending on the network load. Users collaboratively decide which of their sub-flows to admit, and which paths these sub-flows should be transmitted on in order to maximize a system defined utility. Our results show that with user collaboration, these distributed algorithms provide system and user performance comparable to a centralized exhaustive implementation.

关键词： Collaboration Resource management Spread spectrum communication Mesh networks Network topology Aggregates Streaming media distributed algorithms Physical layer Wireless networks

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient distributed routing algorithm for Wireless Sensor Networks

An energy-efficient distributed routing algorithm for Wirele...

引用

Second International Conference on Communications and Electronics

作者： Hugues Smeets Kris Steenhaut Ann Nowe ETRO Department and COMO Laboratory Vrije Universiteit Brussel Brussels Belgium

This paper presents a simple routing protocol based on topology control and cost-forwarding that improves the life-time of a Wireless Sensor Network in the usual convergecast pattern, by allowing the nodes to choose between two predefined power-levels to forward data towards the sink. The proposed protocol takes advantage of non-homogeneous topologies, where the nodes are grouped in clouds. Nodes use the highest power only when necessary, like for bridging the distance between two clouds. Within the clouds, only low-power links are used. The underlying distributed algorithm is shown to converge and finds, for each node of the network, an efficient path to the sink.

关键词： Energy efficiency Routing Wireless sensor networks Network topology Costs Broadcasting Clouds Power control distributed algorithms Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Reliable relaying with uncertain knowledge

Reliable relaying with uncertain knowledge

引用

International Conference on Game Theory for Networks, GameNets

作者： Jiwoong Lee Jean Walrand Department of Electrical Engineering and Computer Sciences University of California Berkeley Berkeley CA USA

The motivation for this paper is to analyze the effect of information uncertainty on the design and performance of protocols. The paper considers two types of situations. The first is when different nodes in the network have bounded knowledge about what other nodes know. The second, called common knowledge about inconsistent beliefs, is when the information is inconsistent but everyone knows it. Situations of bounded or inconsistent information arise naturally in networks because the state of these systems changes and nodes take time to learn of those changes. The specific problem that the paper explores is the relaying of packets in a simple butterfly network. Despite its apparent simplicity, this problem enables to illustrate key features of situations of uncertain knowledge that arise in networks. The paper presents two impossibility facts and one possibility fact, in the latter of which a scheme that enables optimal coordination given persisting imperfection in knowledge is introduced.

关键词： Relays Routing protocols Nominations and elections Information analysis Performance analysis Uncertainty Delay Network topology Convergence distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

EM2NET: An Energy-Saving Explicit Multicast Protocol for MANETs

EM2NET: An Energy-Saving Explicit Multicast Protocol for MAN...

引用

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

作者： Abderrahim Benslimane Cedric Ferrari Abdelhakim Hafid Computer Science Laboratory University of Avignon Avignon France Network Research Laboratory University of Montreal Montreal Canada

In this paper, we propose a new explicit multicast protocol for MANET, called EM2NET. The objective of EM2NET is to efficiently support large number of small multicast groups in MANETs. EM2NET strikes a nice balance between the characteristics of explicit multicast protocols (e.g., Xcast and E2M) and these of tree/mesh-based multicast protocols (e.g., ODMRP and MAODV). Indeed, it combines the encoding of destinations addresses in the packet header and the maintenance of multicast state information in carefully selected nodes. Simulations show that EM2NET outperforms (a) explicit multicast protocols and (b) tree/mesh based protocols in the case of small size multicast groups.

关键词： Multicast protocols Encoding Routing Ad hoc networks Computer science Laboratories Mobile ad hoc networks distributed algorithms Load management Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd 07

Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-w...

引用

IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT)

作者： Muhammed Basharu Ines Arana Hatem Ahriz University College Cork Ireland School of Computing RGU Aberdeen UK

ISBN: (纸本)9780769530277

We present multi-DisPeL, a penalty-based local search distributed algorithm which is able to solve coarse-grained distributed constraint satisfaction problems (DisCSPs) efficiently. Multi-DisPeL uses penalties on values in order to escape local optima during problem solving rather than the popular weights on constraints. We also introduce DisBO-wd, a stochastic algorithm based on DisBO (distributed breakout) which includes a weight decay mechanism. We compare multi-DisPeL and DisBO-wd with other algorithms and show, empirically, that they are more efficient and at least as effective as state of the art algorithms in some problem classes.

关键词： Costs System recovery distributed computing Problem-solving Iterative algorithms Intelligent agent Educational institutions distributed algorithms Stochastic processes Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Decentralised Minimum-Time Average Consensus in Digraphs

Decentralised Minimum-Time Average Consensus in Digraphs

引用

IEEE Annual Conference on Decision and Control

作者： Themistoklis Charalambous Ye Yuan Tao Yang Wei Pan Christoforos N. Hadjicostis Michael Johansson ACCESS Linnaeus Center School of Electrical Engineering KTH-Royal Institute of Technology SE-100 44 Stockholm Sweden Control Group Department of Engineering University of Cambridge Cambridge UK Department of Bioengineering Imperial College London London UK Department of Electrical and Computer Engineering University of Cyprus Nicosia Cyprus

ISBN: (纸本)9781467357159

distributed algorithms for average consensus in directed graphs are typically asymptotic in the literature. In this work, we propose a protocol to distributively reach average consensus in a finite number of steps on interconnection topologies that form strongly connected directed graphs (digraphs). The average consensus value can be computed, based exclusively on local observations at each component, by running a protocol that requires each component to observe and store its own value over a finite and minimal number of steps, and to have knowledge of the number of its out-going links (i.e., the number of components to which it sends information). The proposed algorithm is demonstrated via illustrative examples.

关键词： directed graphs distributed algorithms Finite

来源：评论

学校读者我要写书评

暂无评论

Node-level energy management for sensor networks in the presence of multiple applications

Node-level energy management for sensor networks in the pres...

引用

IEEE International Conference on Pervasive Computing and Communications (PerCom)

作者： A. Boulis M.B. Srivastava Networked and Embedded System Laboratory (NESL) EE Department University of California Los Angeles USA

Energy related research in wireless ad hoc sensor networks (WASNs) is focusing on energy saving techniques in the application-, protocol-, service-, or hardware-level. Little has been done to manage the finite amount of energy for a given (possibly optimally-designed) set of applications, protocols and hardware. Given multiple candidate applications (i.e., distributed algorithms in a WASN) of different energy costs and different user rewards, how does one manage a finite energy amount? Where does one provide energy, so as to maximize the useful work done (i.e. maximize user rewards)? We formulate the problem at the node-level, by having system-level "hints" from the applications. In order to tackle the central problem we first identify the energy consumption patterns of applications in WASNs, we propose ways for real-time measurements of the energy consumption by individual applications, and we solve the problem of estimating the extra energy consumption that a new application brings to a set of executing applications. Having these tools at our disposal, and by properly abstracting the problem we present an optimal admission control policy and a post-admission policing mechanism at the node-level. The admission policy can achieve up to 48% increase in user rewards compared to the absence of energy management, for a variety of application mixes.

关键词： Energy management Intelligent networks Wireless sensor networks Energy consumption Costs Sensor systems and applications Protocols Hardware distributed algorithms Energy measurement

来源：评论

学校读者我要写书评

暂无评论

Analyzing self-stabilization with finite-state machine model

Analyzing self-stabilization with finite-state machine model

引用

International Conference on distributed Computing Systems

作者： Su-Chu Hsu Shing-Tsaan Huang Institute of Computer Science National Tsing Hua University Hsinchu Taiwan

An approach to analyzing self-stabilization based on the finite-state machine model is presented. A finite-state machine is used to model the behavior of each node in a distributed system. when the self-stabilizing algorithms are applied. The approach is useful for analyzing the correctness of self-stabilizing algorithms and their time complexity. A self-stabilizing algorithm for finding maximal matching is used as an example to show how the finite-state machine model is applied. A simpler proof for the correctness and an upper bound of the time complexity tighter than the one proved by a variant function are attained.< >

关键词： Protocols Algorithm design and analysis Computer science Upper bound distributed algorithms Fault detection Fault tolerant systems Councils Contracts Tree data structures

来源：评论

学校读者我要写书评

暂无评论

Resilient Consensus of Double-Integrator Multi-Agent Networks with Communication Delays

Resilient Consensus of Double-Integrator Multi-Agent Network...

引用

IEEE Annual Conference on Decision and Control

作者： Seyed Mehran Dibaji Hideaki Ishii Department of Computational Intelligence and Systems Science Tokyo Institute of Technology Yokohama 226-8502 Japan

ISBN: (纸本)9781479978878

We consider a multi-agent network of second-order dynamics and study its resilient consensus taking account of cyber security issues. In our setting, some of the agents may be malicious whose aim is to prevent other normal agents from reaching consensus. They may do so by not following the given control laws and behaving arbitrarily. It is assumed that the total number of such agents in the network is known. The normal agents are equipped with a simple algorithm where neighbors taking the largest and smallest values are ignored to avoid being influenced by malicious agents. We address this problem when the inter-agent communication have bounded time-varying delays with an emphasis on networks of vehicles. Topological conditions in terms of graph robustness are developed.

关键词： Delays Robustness Vehicle dynamics Vehicles distributed algorithms Computer science Safety

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：