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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem

A Linear Network Code Construction for General Integer Conne...

引用

IEEE Global Communications Conference

作者： Ying Cui Muriel Medard Dhaivat Pandya Edmund Yeh Douglas Leith Ken Duffy Shanghai Jiao Tong Univ. MIT Northeastern Univ. Trinity College Dublin Maynooth University

ISBN: (纸本)9781479959532

The problem of finding network codes for general connections is inherently difficult. Resource minimization for general connections with network coding is further complicated. Existing methods for identifying solutions mainly rely on very restricted classes of network codes, and are almost all centralized. In this paper, we introduce linear network mixing coefficients for code constructions of general connections that generalize random linear network coding (RLNC) for multicast connections. For such code constructions, we pose the problem of cost minimization for the subgraph involved in the coding solution and relate this minimization to a Constraint Satisfaction Problem (CSP) which we show can be simplified to have a moderate number of constraints. While CSPs are NP-complete in general, we present a probabilistic distributed algorithm with almost sure convergence in finite time by applying Communication Free Learning (CFL). Our approach allows fairly general coding across flows, guarantees no greater cost than routing, and shows a possible distributed implementation. Numerical results illustrate the performance improvement of our approach over existing methods.

关键词： Network coding Minimization Linear codes Probabilistic logic distributed algorithms Convergence

来源：评论

学校读者我要写书评

暂无评论

Fairness in a Static Wireless Network

Fairness in a Static Wireless Network

引用

International Conference on Systems and Networks Communications (ICSNC)

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

In a wireless network the communication works in half duplex mode and nodes that can interfere together. In this context, fairness is not obvious. This paper will focus on fairness in the received packets by each node. Fairness is evaluated for a static network topology called Star Network. Some simulations are used to illustrate a way to get fairness in the network by controlling the flow rates of the network.

关键词： Wireless networks Ad hoc networks Context Network topology distributed algorithms Throughput Computer science Telecommunications Media Access Protocol Wireless application protocol

来源：评论

学校读者我要写书评

暂无评论

An Open Simulator Architecture for Heterogeneous Self-Organizing Networks

An Open Simulator Architecture for Heterogeneous Self-Organi...

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： Jaco Kruger Desanka Polajnar Jernej Polajnar Department of Computer Science University of Northern British Columbia Prince George BC Canada

With the maturing of research in wireless sensor networks (WSN) and the more recent advances in wireless sensor and actor networks (WSAN), there has been an increasing interest in heterogeneous self-organizing networks with multiple types of nodes that possess different capabilities and perform diverse tasks in the network's deployment, maintenance, and application functionalities. This paper explores the conceptual and architectural challenges in the design of generic tools for modeling and simulation of such systems. It first addresses the modeling issues, including the diversity of node types and capabilities, the variety of possible abstractions, and the need for vertical cross-layer integration. After a brief review of the solutions in some existing simulation systems, the paper outlines an open architectural platform incorporating the facilities for: definition of potential capabilities of network elements; formation of node types with selected capabilities and behavioral algorithms; formation of relevant environment models; configuration and initialization of the network and its environment; and scenario definition, execution and monitoring

关键词： Self-organizing networks Wireless sensor networks Computer science Electronic mail Biological system modeling Analytical models Sensor systems Intelligent sensors distributed algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Some practical issues in the design of fault-tolerant multiprocessors

Some practical issues in the design of fault-tolerant multip...

引用

International Symposium on Fault-Tolerant Computing (FTCS)

作者： S. Dutt J.P. Hayes Department of Electrical Engineering University of Minnesota Minneapolis MN USA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A node-covering approach to fault-tolerant design is generalized to apply to a wide class of multiprocessor structures whose structure and failure mechanisms are represented by arbitrary graphs. Several new types of covering graphs are defined, which lead to various design tradeoffs. A new technique for incremental design, using a class of switch implementations that reduce a system's interconnection costs, is presented. The reduction of other cost factors is addressed, including VLSI layout area minimization, efficient transfer of state information during recovery, and the efficient use of local spares. A fast and distributed algorithm for reconfiguration around faults is presented. A review of the general node covering theory is included, focusing on how it models the important practical features of fault-tolerant systems.< >

关键词： Fault tolerance Switches Fault tolerant systems Multiprocessing systems Military computing Costs Very large scale integration Large-scale systems Computer architecture distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Memory-adaptive parallel sparse Cholesky factorization

Memory-adaptive parallel sparse Cholesky factorization

引用

Scalable High Performance Computing Conference

作者： K. Eswar Chua-Huang Huang P. Sadayappan Department of Computer and Information Science Ohio State Uinversity Columbia OH USA

The problem of Cholesky factorization of sparse positive-definite matrices on distributed-memory multiprocessors is considered. A column-based algorithm with the ability to adapt to the amount of memory available on each processor is presented. Exploiting the available memory allows the local computation on each processor to be ordered so that good local efficiencies and dynamic load balance are achieved. A proof that this distributed algorithm is deadlock-free is given. Experimental results of an implementation of this algorithm on an Intel iPSC/860 multiprocessor system are reported.< >

关键词： Partitioning algorithms Aggregates Sparse matrices System recovery Multiprocessing systems distributed computing Information science distributed algorithms Data structures

来源：评论

学校读者我要写书评

暂无评论

On maximizing lifetime of multicast trees in wireless ad hoc networks

On maximizing lifetime of multicast trees in wireless ad hoc...

引用

International Conference on Parallel Processing (ICPP)

作者： B. Wang S.K.S. Gupta Department of Computer Science and Engineering Arizona State University Tempe AZ USA

We present a distributed algorithm called L-REMiTfor extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multicast tree is the duration from the formation of the tree to the time when the first node fails due to battery energy exhaustion. L-REMiT assumes that the energy consumed to forward a packet is proportional to the forwarding distance and that WANET nodes can dynamically adjust their transmission power. The task of extending the lifetime of a multicast tree is formulated as the task of extending the lifetime of bottleneck nodes in the tree. The number of multicast packets which a bottleneck node can forward, as determined by its residual battery energy and the distance of its farthest child node, is minimum over all the nodes in the multicast tree. Lifetime of a bottleneck node is improved by reassigning its farthest children to other nodes in the tree with the goal of improving the lifetime of the multicast tree. Nodes only require information from their neighbors for refining the tree in a distributed manner. Simulation results show that L-REMiT has low overhead and performs better than BIP/MIP and EWMA algorithms

关键词： Intelligent networks Ad hoc networks Multicast algorithms Batteries Broadcasting Multicast protocols Energy efficiency Partitioning algorithms distributed algorithms Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

On Automatic Verification of Self-stabilizing Population Protocols

On Automatic Verification of Self-stabilizing Population Pro...

引用

第二届IFIP/IEEE软件工程理论基础国际研讨会(TASE 2008)(Second IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering)

作者： Jun Pang Zhengqin Luo Yuxin Deng University of Luxembourg Computer Science and Communications L-1359 Luxembourg Shanghai Jiao Tong University Department of Computer Science and Engineering 200240 Shanghai China

The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with each other to carry out a computation. The interactions of nodes are subject to a fairness constraint. One essential property of population protocols is that all nodes must eventually converge to the correct output value (or configuration). In this paper, we aim to automatically verify self-stabilizing population protocols for leader election and token circulation in the Spin model checker [8]. We report our verification results and discuss the issue of modeling strong fairness constraints in Spin.

关键词： Protocols distributed algorithms Formal verification Computer networks Mobile ad hoc networks Nominations and elections State-space methods Computer science Mobile computing Software engineering

来源：评论

学校读者我要写书评

暂无评论

A reliable delivery protocol based on competition and cooperation for wireless sensor networks

A reliable delivery protocol based on competition and cooper...

引用

International Conference on Advanced Computer Control, ICACC

作者： YuKai Li Yan Bai Jian Zhang Yanbo Cui Department of Automation North China Electric Power University Beijing China

ISBN: (纸本)9781424458455;9781424458486;9781424458479;9781424458462

Wireless sensor networks (WSNs) usually work under harsh environment, so high packet loss rate is induced by the unreliable and error-prone wireless links. To cope with the problem, a competition and cooperation based reliable forwarding protocol (CCRF) is proposed. In CCRF, the characteristic of dense deployment of sensor nodes and broadcast feature of the wireless channel in WSN are utilized. Specifically, adjacent nodes along the path spontaneously constitute a receiving cluster in data forwarding and then data reception and acknowledgement are executed by the means of cooperation among the cluster members to enhance data forwarding reliability and to reduce energy consumption caused by redundant transmission. In the routing, distributed fuzzy integral assessment algorithm is adopted, by which differentiated priorities of the clusters along the path are allocated in accordance with the resource condition including forwarding reliability, forwarding distance per hop and remaining energy and next-hop receiving cluster in possession of optimal resource is dynamically selected through back-off competition to achieve the efficient transmission. The NS2 simulation result further corroborate its superior integrated performance compared with homogeneous protocols.

关键词： Wireless application protocol Wireless sensor networks Data communication Routing protocols Energy consumption Broadcasting Telecommunication network reliability Automation Floods distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Experimental comparison of a directed and a non-directed potential field approach to formation navigation

Experimental comparison of a directed and a non-directed pot...

引用

IEEE International Symposium on Computational Intelligence in Robotics and Automation (CIRA)

作者： F.E. Schneider D. Wildermuth Research Establishment for Applied Sciences (FGAN) Wachtberg Germany

The field of multirobot systems (MRS) is continuously drawing more attention. The DARPA SDR program and the RoboSoccer/RobotRescue contests have shown the great potential of this field. One of the increasingly popular uses of the field of MRS is in communication and sensor-networks. These applications require a task depended navigation. The MRS sub-problem of formation navigation is predestined for this purpose. This paper presents an improvement of the classical potential field approach for motion co-ordination in formations of MRS. The approach is briefly compared to related work. For the subtask of moving in formation, a solution based on a directed potential field is presented. Different forces belonging to other robots, obstacles and the aspired shape of formation are combined and used to move each robot to its desired position inside the formation. While moving in formation, the group is able to avoid obstacles and approach towards a specified target. First experiments that show the differences and improvements in comparison to the classical method are presented.

关键词： Navigation Robot kinematics Robot sensing systems Orbital robotics Shape Communication networks Mobile robots Multirobot systems Mathematical model distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

On the Dynamic Formation of Cooperative Multipoint Transmissions in Small Cell Networks

On the Dynamic Formation of Cooperative Multipoint Transmiss...

引用

Institute of Electrical and Electronics Engineers Globecom Workshops

作者： Francesco Pantisano Mehdi Bennis Walid Saacl Roberto Verdone Matti Latva-aho CWC - Center for Wireless Communications Electrical and Computer Engineering Department University of Miami Dipartimento di Elettronica ed Informazione - DEI University of Bologna

ISBN: (纸本)9781467349420

The ever-growing data rate requirements of next-generation mobile networks mandate a highly efficient exploitation of the spectral and energy resources. In this respect, a key technology which can allow high quality-of-service provisioning with reasonable energy expenditures is given by the deployment of Coordinated Multi-point (CoMP) transmissions for small cells. While the benefits of CoMP have been explored in the literature, little has been done to study how a network can adaptively decide on whether or not to adopt CoMP. To this end, in this paper, we propose a cooperative framework for small cell networks, in which groups of small cells dynamically decide when to perform CoMP transmission while optimizing the tradeoff between rate improvement and energy consumption. We formulate the problem as a dynamic coalitional game with the small base stations as players, and we provide a distributed algorithm that allows the small cells to self-organize into CoMP-based coalitions. The resulting network partition represents the ε-core of the game, which is a key solution concept for dynamic coalition games. Simulation results show that the proposed dynamic coalition formation algorithm leads to a significant gain of up to 41% sum rate to transmit power ratio in the small cell tier.

关键词： multipoint Game theory Transmissions Biological neural networks solution concept Cells Energy Expenditure Game animals Key technology editing distributed algorithms BASE STATION Energy sources Network tradeoffs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：