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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4991-5000 订阅

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

详细简洁

排序：

A Social-based Data Forwarding Mechanism for V2V communication in VANETs

A Social-based Data Forwarding Mechanism for V2V communicati...

引用

International Conference on Communications and Networking in China (CHINACOM)

作者： Rui Tian Zhenzhen Jiao Guiyun Bian Zhiqing Huang Yibin Hou School of Software Engineering Beijing University of Technology Beijing China Beijing Engineering Research Center for IoT Software and Systems Beijing China China Academy of Information and Communications Technology Beijing China Beijing Engineering Research Center for IoT Software and Systems China

ISBN: (纸本)9781479987962

In order to deliver messages between moving vehicles in cities, this paper proposes a Social-based Data Forwarding Mechanism (SDFM) for V2V communication in VANETs. The SDFM learns vehicles' social characteristics in a distributed manner, and then transfers messages in a “Store-Carry-Forward” pattern. SDFM describes the sociality of a vehicle as centrality and community. Based on these two metrics, for each message, a vehicle forwards it to the vehicle with higher global centrality than itself till it meets a vehicle within the same community as the message's final destination, and then forwards the message to the vehicle with higher local centrality till it is finally delivered. The SDFM calculates vehicles' centralities by computing the mobile entropies of vehicles, and determines vehicles' communities by adopting a distributed K-Clique algorithm on recorded intermeeting time as well as meeting frequencies between vehicles. Experimental results show that, for civic moving vehicles, SDFM mechanism has significantly improved the message delivery ratio and the average delivery delay performances when compared with a social based routing protocol bubble rap which is designed for data forwarding in packet switch networks.

关键词： distributed algorithm Movement model Social learning V2V communication VANET vehicle V2V distributed algorithms Social Learning data forwarding Messages message passing

来源：评论

学校读者我要写书评

暂无评论

distributed Interference Pricing with MISO Channels

Distributed Interference Pricing with MISO Channels

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Changxin Shi Randall A. Berry Michael L. Honig Department of Electrical Engineering and Computer Science Northwestern University

ISBN: (纸本)9781424429257

We study a distributed algorithm for adapting transmit beamforming vectors in a multi-antenna peer-to-peer wireless network. The algorithm attempts to maximize a sum of per-user utility functions, where each user's utility is a function of his transmission rate, or equivalently the received signal-to-interference plus noise ratio (SINR). This is accomplished by exchanging interference prices, each of which represents the marginal cost of interference to a particular user. Given the interference prices, users update their beamforming vectors to maximize their utility minus the cost of interference. For a two-user system, we show that this algorithm converges for a suitable class of utility functions. Convergence of the algorithm with more than two users is illustrated numerically.

关键词： multiple-input single-output Utility functions interference interference Consumers distributed algorithms Beamforming Pricing

来源：评论

学校读者我要写书评

暂无评论

Evolution of automatic robot control with genetic programming

Evolution of automatic robot control with genetic programmin...

引用

Proceedings of the International Convention MIPRO

作者： Lovro Paić-Antunović Domagoj Jakobović Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia

This paper investigates the problem of automatic control of a robot model in an arbitrary two-dimensional environment. The robot control is based on behavior evolution with the use of genetic programming (GP). A simulation environment is developed which allows automatic synthesis of different behaviors suited to the environment and user requirements. The influence that different robot properties and learning mechanisms have on the evolved behavior are studied in depth. The results show that the presented approach is able to produce effective control procedures.

关键词： Genetic programming Robot sensing systems Robot kinematics Convergence distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

QoS routing in ad hoc networks using QOLSR with no need of explicit reservation

QoS routing in ad hoc networks using QOLSR with no need of e...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： H. Badis I. Gawedzki K. Al Agha LRI Laboratory University of Paris XI Orsay France INRIA Laboratory Le Chesnay France

Multimedia applications often require guaranteed quality of service (QoS) and resource reservation, which has raised a number of challenging technical issues for routing. We have proposed the QOLSR protocol, a QoS routing over OLSR protocol introducing metrics, such as bandwidth and delay, that are more appropriate than the hop distance. When using the QOLSR protocol, there are cases in which a source node continuously changes a flow's next hop in response to the change of available bandwidth on its path and cannot tell apart the traffic induced by itself from traffic generated by other nodes. The article describes a way to achieve QoS routing without using explicit reservation mechanisms and gives new distributed solutions to the oscillation and collision of flows. We can guarantee that the flows take the appropriate paths and avoid interferences with other existing flows. The performance of our distributed algorithm is extensively investigated by analyses, examples and simulations in both static and dynamic networks. Our results show that the gain achieved by our proposal represents an important improvement in mobile wireless ad hoc networks.

关键词： Ad hoc networks Quality of service Routing protocols Bandwidth Delay Road accidents Interference distributed algorithms Performance analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware Routing Scheme with Node Relay Willingness in Wireless Sensor Networks

An Energy-Aware Routing Scheme with Node Relay Willingness i...

引用

International Conference on Innovative Computing, Information and Control (ICICIC)

作者： Huifang Chen H. Mineno T. Mizuno Faculty of Informatics Shizuoka University Hamamatsu Shizuoka Japan Institute of Information and Communication Engineering University of Zhejiang Hangzhou China

Energy efficiency has been known as the most significant problem in all facets of the wireless sensor network operations. For energy-aware routing scheme for the wireless sensor networks, it is necessary to use sub-optimal paths occasionally to increase the survivability of networks. In this paper, we present a new network lifetime definition and formulate the energy-aware routing problem with defined network lifetime. And then we propose an energy-aware routing scheme with the node relay willingness for wireless sensor networks. It considers not only to route packets through sensor nodes that have sufficient energy reserves, but also to route packets through light-loaded nodes. Simulation results show that the proposed routing algorithm can achieve longer network lifetime than that of the routing algorithm only considering the energy reserves

关键词： Relays Wireless sensor networks Energy efficiency Ad hoc networks Routing protocols Sensor phenomena and characterization distributed algorithms Telecommunication traffic Power engineering and energy Informatics

来源：评论

学校读者我要写书评

暂无评论

Group mutual exclusion in tree networks

Group mutual exclusion in tree networks

引用

International Conference on Parallel and distributed Systems (ICPADS)

作者： J. Beauquier S. Cantarell A.K. Datta F. Petit LRI/CNRS Universite de Paris Sud France Department of Computer Science University of Nevada Las Vegas USA LaRIA Universite de Picardie Jules Verne France

The group mutual exclusion (GME) problem deals with sharing a set of (m) mutually exclusive resources among all (n) processes of a network. Processes are allowed to be in a critical section simultaneously provided they request the same resource. We present three group mutual exclusion solutions for tree networks. All three solutions do not use process identifiers, and use bounded size messages. They achieve the best context-switch complexity, which is O(min (n, m)). The first solution uses a fixed root of the tree and uses 0 to O(n) messages per critical section entry. This solution supports an unbounded degree of concurrency, thus provides the maximum resource utilization. The second solution also uses a fixed root, but uses a reduced number of messages for the critical section entry. It generates an average of O(log n) messages per critical section entry and also allows an unbounded degree of concurrency. However, the concurrency may be limited in some parts of the network. We remove the restriction of using a fixed root in the third solution in addition to maintaining all other desirable properties of the second solution.

关键词： Intelligent networks Concurrent computing Access protocols Resource management Quality of service Computer science distributed algorithms Web and internet services Web server Particle measurements

来源：评论

学校读者我要写书评

暂无评论

Fairness in Double Star Ad Hoc Networks

Fairness in Double Star Ad Hoc Networks

引用

International Conference on Networking and Services (ICNS)

作者： Abderrahim Makhlouf Marc Gilg Pascal Lorenz Doctoral School of Computer Science University of Pierre and Marie Curie Paris France University of Haute Alsace Colmar France

In an ad-hoc network, communications in the half duplex mode imply that the nodes in the Ad-Hoc network have not always fair access to the network resources. In this paper, the fair resources allocation for nodes in a double star is studied. The aim of this work is to analyse the fairness behaviour of the number of packets received by each node. A theoretical study shows in which case we can obtain fairness. Some implementation with NS2 (ns-2.31 version) enables to validate our approach and some simulations are used to illustrate a way to achieve fairness in the network by controlling the flow rates of the network.

关键词： Ad hoc networks Resource management Wireless networks distributed algorithms Scheduling algorithm Media Access Protocol Computer science Telecommunications Packaging Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

A credit-based on-demand QoS routing protocol over Bluetooth WPANs

A credit-based on-demand QoS routing protocol over Bluetooth...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Yuh-Shyan Chen Keng-Shau Liu Yun-Wei Lin Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan

ISBN: (纸本)0769523730

The quality-of-service (QoS) communication that supports mobile applications to guarantee bandwidth utilization is an important issue for Bluetooth wireless personal area networks (WPANs). In this paper, we address the problem of on-demand QoS routing with interpiconet scheduling in Bluetooth WPANs. A credit-based QoS (CQ) routing protocol is developed which considers different Bluetooth packet types because of different types of Bluetooth packets have different bandwidth utilization levels. This work improves the bandwidth utilization of Bluetooth scatternets by providing a new interpiconet scheduling scheme. Centralized and distributed algorithms are investigated in this work to improve the bandwidth utilization for the on-demand QoS routing protocol The performance analysis illustrates that our credit-based QoS routing protocol achieves enhanced performances, compared to existing QoS routing protocols.

关键词： Routing protocols Bluetooth Bandwidth Personal area networks Scheduling Wireless personal area networks Quality of service Mobile communication distributed algorithms Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

An analysis of multiprocessing speedup with emphasis on the effect of scheduling methods

An analysis of multiprocessing speedup with emphasis on the ...

引用

International Conference on distributed Computing Systems

作者： J.-J. Hwang Y.-C. Chow F.D. Anger Nat. Chiao-Tung Univ. Hsinchu Taiwan University of Florida USA Florida Institute of Technology USA

The speedup issue is reexamined for message-passing multiprocessors and computer networks in which interprocessor communication overhead is considered undesirable but significant. A unified model of speedup ) is developed for analyzing the system in terms of communication overhead, scheduling, and the application algorithm. The model can be used to assess quantitatively the impact on overall system performance of the interprocessor communication overhead and its interaction with different scheduling methods. Whereas most authors treat speedup as a measure of improved algorithms or improved systems, the presented model integrates the effects of these factors and of scheduling. Two concepts, hidden overhead and efficiency loss, are introduced to clarify the effect of the scheduling factor. The concepts are illustrated using two scheduling methods designed for use in systems with significant communication overhead.< >

关键词： Processor scheduling Velocity measurement Scheduling algorithm Computer networks Computer architecture Degradation Application software distributed algorithms Algorithm design and analysis System performance

来源：评论

学校读者我要写书评

暂无评论

Model Driven capabilities of the DA-GRS model

Model Driven capabilities of the DA-GRS model

引用

International Conference on Autonomic and Autonomous Systems (ICAS)

作者： A. Casteigts LaBRI Université Bordeaux 1 Talence France

The development of applications that target dynamic networks often addresses the same difficulties. Since the underlying network topology is unstable, the application has to handle it in a context-reactive manner, and, when possible, with algorithms that are localized and decentralized. The present paper shows how the DA-GRS model, that is a high level abstract model for localized graph algorithms, can be used to drastically improve the development time of self-organized systems. The canonical method that is proposed makes use of generic pieces of code, along with some additional code generation. All the concepts presented here are illustrated by means of a spanning forest algorithm, that can then be used by the application at a high abstraction level

关键词： Context modeling Network topology Ad hoc networks distributed algorithms Algorithm design and analysis Application software Electronic mail Mobile computing Pervasive computing Communications technology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：