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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Self-organized Set Cover via Nash Equilibrium Learning and Selection

Self-organized Set Cover via Nash Equilibrium Learning and S...

引用

IEEE Conference on Decision and Control

作者： Changhao Sun Qingrui Zhou Xiaowei Ma Huaxin Qiu Yuting Feng Jiaxin Liu Qian Xuesen Laboratory of Space Technology China Academy of Space Technology Beijing China Nanjing Mobile Communication & Computing Innovation Institute Nanjing China Flying College Beihang University Beijing China Institute of Telecommunication and Navigation Satellite China Academy of Space Technology Beijing China

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper focuses on the weighted set cover problem in networking systems and presents a fully distributed algorithm from the perspective of Nash equilibrium learning and selection. By viewing each set as an agent, we recast the problem as a networked ordinal potential game and classify the resulting Nash equilibrium into two categories. We show that each inferior Nash equilibrium (INE) could always be improved via local action exchange and better approximations could be achieved via self-organized selection among superior Nash equilibria (SNEs). By showing the existence of an improvement path that leads any action profile to an SNE, we prove that our algorithm converges in finite time to a conventional Nash equilibrium, where the joint action is a selected SNE. Comparison experiments with typical methods demonstrate the superiority to the state of the art.

关键词： Wireless sensor networks Surveillance Games Nash equilibrium Approximation algorithms distributed algorithms Convergence

来源：评论

学校读者我要写书评

暂无评论

An Efficient Content Delivery Algorithm for Intermittently Connected Mobile Ad Hoc Networks

An Efficient Content Delivery Algorithm for Intermittently C...

引用

International Symposium on Parallel Architectures, algorithms and Programming (PAAP)

作者： Hui Tian Fenghang Yin Xianchao Zhang School of Electronic and information engineering Beijing Jiaotong University China Department of Computer Science University of Science and Technology China School of Software Dalian University of Technology China

The content dissemination among mobile users can be solved by self-facilitated mobile ad hoc networks (MANET) in an infrastructure environment. But the devices used to make up the mobile ad hoc networks usually have a limited radio transmission range, sporadic node density and power limitation, which makes MANET become intermittently connected. In this paper we focus on the content delivery problem in intermittently connected ad hoc networks (ICMANET). We propose an efficient model for this problem in ICMANET to maximize the total number of requests to be met. We have proposed a distributed algorithm based on the model which can be implemented by each node in ICMANET. We compare our algorithm with the existing ones and the simulation results demonstrate that our algorithm outperforms other algorithms significantly.

关键词： Delay Algorithm design and analysis Mobile ad hoc networks Greedy algorithms Wireless communication distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization driven data mining and credit scoring

Optimization driven data mining and credit scoring

引用

Proceedings of the IEEE/IAFE Computational Intelligence for Financial Engineering (CIFEr)

作者： R.L. Grossman H.V. Poor Magnify Inc. Oak Park IL USA Electrical Engineering Department Princeton University Princeton NJ USA

An optimization tree approach to the mining of very extensive and complex databases for performance optimizing opportunities is described. This methodology is based on a combination of three innovations: a data management system designed explicitly for data intensive computing; a distributed algorithm for growing classification and regression trees (CART); and a tree based stochastic programming paradigm for the selection of control attributes to optimize a specified objective function. This methodology provides a general technique for optimization in financial applications that is scalable as the number of objects in the database and as the number of attributes per object grow. This scalability allows for a complete data driven analysis of large scale data sets, without the need to restrict attention to sparsely sampled data sets that limits previous methods.

关键词： Data mining Databases Technological innovation Innovation management Algorithm design and analysis distributed computing distributed algorithms Classification tree analysis Regression tree analysis Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Specifying WSN Applications through Agents Based on Events and States

Specifying WSN Applications through Agents Based on Events a...

引用

International Conference on Sensor Technologies and Applications, SensorComm

作者： G. Fortino A. Garro S. Mascillaro W. Russo University of Calabria-DEIS Italy

Wireless sensor networks (WSNs) are emerging as powerful platforms for distributed embedded computing supporting a variety of high-impact applications such as disaster/crime prevention and military applications, environmental applications, health applications, and smart spaces. Programming WSNs is a complex task as system level code and application level code are often intertwined. Several programming paradigms have been to date proposed which provide programming abstractions and programming support for the development of WSN applications. In this paper we propose a specification language centered on the concept of lightweight agent based on events and states which distinctively integrates the advantages of three important paradigms and models for WSN programming: agent- based, event-driven and state-based programming. The proposed language is exemplified through a specification of the well-known EnviroTrack application.

关键词： Wireless sensor networks Specification languages Embedded computing Military computing Logic programming Intelligent sensors Application software Software systems Multiagent systems distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A Unified theory of scheduling, routing, and flow control in wireless networks

A Unified theory of scheduling, routing, and flow control in...

引用

International Conference on Network Protocols

作者： Naghmeh S. Moayedian S. Jamaloddin Golestani Electrical and Computer Engineering Department Isfahan University of Technology Isfahan Iran

ISBN: (纸本)9781424446353

A new approach to joint scheduling, flow control and routing in wireless networks, based on formulation as a convex optimization problem is presented. This approach is novel in that it integrates optimal scheduling and flow control with a modified version of minimum delay routing, resulting in significant performance advantage over alternative approaches. We come up with a distributed algorithm for implementation of the proposed scheme and show, by analysis and simulation, that the algorithm achieves fairness and/or priorities among users in accordance with pre-assigned user parameters. In sharp contrast to alternative algorithms that perform scheduling and packet routing based on per-session queue differential between adjacent nodes, our algorithm uses a complete multi-hop view of network conditions for packet routing and retains the desirable properties of minimum delay routing. As the result, it achieves queue sizes and end-to-end delays that are several times smaller, without compromising the throughput.

关键词： Routing Wireless networks Optimal scheduling Delay Scheduling algorithm Optimal control distributed algorithms Algorithm design and analysis Analytical models Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

The join problem in dynamic network algorithms

The join problem in dynamic network algorithms

引用

International Conference on Dependable Systems and Networks (DSN)

作者： K.M. Konwar D.R. Kowalski A.A. Shvartsman Department of Computer Science and Engineering University of Connecticut Storrs CT USA Instytut Informatyki University of Warszawski Warszawa Poland Max Planck Institut für Informatik Saarbruecken Germany Computer Science and Artificial Intelligence Laboratory The Stata Center MIT Cambridge MA USA

distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among the participants. Gossiping is one form of such communication pattern. In dynamic settings, the set of participants can change substantially as new participants join, and as failures and voluntary departures remove those who have joined previously. A natural question for such settings is: how soon can newly joined nodes discover each other by means of gossiping? This paper abstracts and studies the join problem for dynamic systems that use all-to-all gossip. The problem is studied in terms of join-connectivity graphs where vertices represent the participants and where each edge represents one participant's knowledge about another. Ideally, such a graph has diameter one, i.e., all participants know each other. The diameter can grow as new participants join, and as failures remove edges from the graph. Gossip helps participants discover one another, decreasing the diameter. The results describe the lower and upper bounds on the number of communication rounds such that the participants who have previously joined discover one another, under a variety of assumptions about the joining and failures. For example, in the case when new participants join at multiple participants and participants may crash, the number of rounds cannot be bounded. In the more benign cases when the failures can be controlled or when new participants join at only one participant, the bound on rounds is shown to be logarithmic in the diameter of the initial configuration.

关键词： Intelligent networks Heuristic algorithms distributed algorithms Computer science Computer networks distributed computing Artificial intelligence Laboratories Abstracts Upper bound

来源：评论

学校读者我要写书评

暂无评论

Efficient construction of connected dominating set in wireless ad hoc networks

Efficient construction of connected dominating set in wirele...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Bo Han HaoHuan Fu Lidong Lin Weijia Jia Department of Computer Engineering and Information Technology City University of Hong Kong Kowloon Hong Kong China

ISBN: (纸本)0780388151

Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.

关键词： Intelligent networks Ad hoc networks Mobile ad hoc networks Routing distributed algorithms Approximation algorithms Algorithm design and analysis Clustering algorithms Councils Network topology

来源：评论

学校读者我要写书评

暂无评论

Asynchronous implementation of failure detectors

Asynchronous implementation of failure detectors

引用

International Conference on Dependable Systems and Networks (DSN)

作者： A. Mostefaoui E. Mourgaya M. Raynal IRISA Université de Rennes Rennes France

来源：评论

学校读者我要写书评

暂无评论

Radio Resource Management for OFDMA Uplinks

Radio Resource Management for OFDMA Uplinks

引用

Quality of Service, 2006 14th IEEE International Workshop on;Princeton,NJ

作者： Patrick Hosein Huawei Technologies Company Limited San Diego CA USA

The next generation of wireless networks (4G) will use OFDMA (Orthogonal Frequency Division Multiple Access) in the reverse link. In OFDMA, the reverse link resources assigned to a user are called tiles each of which consists of a subset of consecutive subcarriers. Since at most one user is assigned to each of these tiles then reverse link transmissions within a sector are orthogonal. However, the transmission is affected by intercell interference since users in adjacent sectors may also have been assigned to the same tile. If those users in the adjacent sectors transmitted with high power then the intercell interference may severely limit the SINR achieved by the user. Therefore user transmission powers must be carefully managed to avoid excessive intercell interference. In this paper we propose a distributed algorithm for the problem and use numerical results to illustrate its performance.

关键词： Resource management Interference Tiles Downlink Energy management distributed algorithms Degradation Multiaccess communication Delay Counting circuits

来源：评论

学校读者我要写书评

暂无评论

A scalable P2P model for optimizing application layer multicast

A scalable P2P model for optimizing application layer multic...

引用

ACS/IEEE International Conference on Computer Systems and Applications

作者： Mourad Amad Ahmed Meddahi Bejaia University Algeria France

Multicast avoids sending repeated packets over the same network links and thus offers the promise of supporting multimedia streaming over wide-area networks. Previously, two opposite multicast schemes forward-path forwarding and reverse-path forwarding have been proposed on top of structured peer-to-peer (p2p) overlay networks. In this paper, we propose a new model for optimizing application layer multicast in the context of Peer-to-Peer networks (structured and unstructured). In this contribution, we consider two approaches for multicast tree construction: a "primitive " approach, and an optimized one based on a distributed algorithm. The proposed model inherits from main P2P attributes such as: scalability, fault tolerance, while taking into consideration the respective characteristics of "one to many" and "many to many" applications. We also give a performance evaluation for validation and comparison purposes. For this we consider some main existing application layer multicast protocols.

关键词： Peer to peer computing Streaming media Application software Telecommunications Context modeling distributed algorithms Scalability Fault tolerance Multicast protocols Resumes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：