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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

6,213 篇 distributed algo...
547 篇 wireless sensor ...
545 篇 convergence
527 篇 algorithm design...
408 篇 optimization
382 篇 computer science
369 篇 distributed comp...
362 篇 network topology
329 篇 routing
279 篇 resource managem...
219 篇 protocols
211 篇 computational mo...
206 篇 computer network...
204 篇 costs
199 篇 approximation al...
198 篇 fault tolerance
185 篇 ad hoc networks
181 篇 bandwidth
179 篇 peer to peer com...
177 篇 interference

机构

24 篇 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 篇 arizona state un...

作者

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,112 篇 英文
58 篇 其他
38 篇 中文
4 篇 德文
1 篇 法文
1 篇 葡萄牙文
1 篇 俄文
1 篇 土耳其文

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

共 6213 条记录，以下是51-60 订阅

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

详细简洁

排序：

distributed algorithms for TDMA Link Scheduling in Sensor Networks

Distributed Algorithms for TDMA Link Scheduling in Sensor Ne...

引用

26th IEEE International Parallel and distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Alsulaiman, Thamer Prasad, Sushil K. Zelikovsky, Alexander Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9780769546766

The paper is devoted to Time Division Multiple Access Link Scheduling Protocols in wireless sensor networks for full duplex (two-way) communication, where each sensor is scheduled on an incident link as a transmitter and as a receiver in two different time slots. We formulate the full duplex link scheduling problem (FDLSP) as distance-2 edge coloring in bi-directed graphs. We proves that there exists Delta-approximation algorithm for FDLSP (Delta being the maximum node degree in the network). Then, we present two distributed algorithms. The first is a synchronous algorithm based on finding maximal independent sets. The second is an asynchronous depth first search (DFS) algorithm. The maximal independent set based algorithm requires only O(Delta log*n) communication rounds (where n is the number of processors in the network) for growth bounded graphs, which is a realistic geometric model of sensor networks. For general graphs, the maximal independent set based algorithm requires O(Delta(4) + Delta(3)log*n) communication rounds, improving upon the previous best algorithm with O(n Delta(2) + n(2)m) communication rounds (where m is the number of links in the network). The asynchronous DFS based algorithm requires only O(n) communication rounds for both general and growth bounded graphs. The simulations show that the proposed algorithms assign on average equal or fewer number of time slots compared to the best known distributed algorithm while being significantly faster.

关键词： distributed algorithms Depth--first search Communication Research Sensor networks colored graph algorithms Rounding off network links

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for rate-adaptive media streams

Distributed algorithms for rate-adaptive media streams

引用

8th INFORMS Telecommunication Conference

作者： Weber, Steven Veeraraghavan, Vilas Drexel Univ Dept Elect & Comp Engn Philadelphia PA 19104 USA

Rate adaptive media streams bear similarities to both elastic (e.g., file transfer) and inelastic (e.g., voice) network traffic classes. As such a service model for streaming media should incorporate characteristics of both classes: guaranteed minimum rates (for minimally acceptable quality of service (QoS)) and an efficient mechanism for intelligently allocating excess capacity among the competing streams. In this paper we apply the system decomposition Kelly (Charging and rate control for elastic traffic. European Transactions on Communications 8:33-37, 1997) and distributed algorithms framework Kelly et al. (Rate control in communication networks: shadow prices, proportional fairness, and stability. J Oper Res Soc 49:237-252, 1998), developed by Frank Kelly et al. in the context of elastic traffic, to a service model for rate adaptive media streams. Our aim is to allocate excess capacity among competing streams so as to maximize a weighted client-average QoS, where each client QoS is defined as the time-average utility of the instantaneous received rate. We develop the corresponding system decomposition and distributed algorithms appropriate for rate adaptive media streams. Two distinct classes of distributed algorithms are derived: i) a distributed algorithm for dynamic adaptation, where the instantaneous subscription level of each stream is adjusted in response to network updates on route congestion levels, and ii) a distributed algorithm for static adaptation. The stationary point of the static adaptation algorithm is an admission policy that assigns each stream a fixed (in time) transmission rate as a function of the stream volume (the total number of bits associated with the media object). Our results, consistent with earlier work Weber and de Veciana (Rate adaptive multimedia streams: optimization and admisssion control. IEEE/ACM Trans Netw 13(6):1275-1288, December 2005a), confirm the intuitive idea that client average QoS is maximized by granting preferen

关键词： distributed algorithms streaming media rate adaptation

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for QoS in Wireless Ad Hoc Networks Under the Primary Interference Model 5

Distributed Algorithms for QoS in Wireless Ad Hoc Networks U...

引用

5th International Conference on Wireless Communications Signal Processing and Networking (IEEE WiSPNET)

作者： Ganesan, Ashwin Int Sch Engn INSOPE Mumbai Maharashtra India

ISBN: (纸本)9781728152844

Consider a wireless network consisting of a set of wireless nodes and a set of communication links, where each communication link corresponds to a pair of nodes that are within communication radius of each other. Under the primary interference model, two communication links cannot be active at the same time if they are incident to a common node. This model of interference arises in Bluetooth networks, where transmissions between a master node and slave nodes in a piconet are scheduled by time-division duplexing, and in CDMA systems when each node is equipped with a single transceiver. Each communication link has a certain minimum bandwidth quality-of-service requirement. The admission control problem is to determine whether the network has sufficient resources to satisfy the bandwidth requirements. In this work, distributed algorithms are proposed for this admission control problem, and performance guarantees of these distributed algorithms are given. If each node has knowledge of a certain global parameter, then a distributed algorithm for flow admission control is given which has the same performance as an optimal, centralized algorithm, i.e. the distributed algorithm gives a condition that is both necessary and sufficient for a set of flow rates to be feasible.

关键词： wireless ad hoc networks Bluetooth networks CDMA systems QoS primary interference model distributed algorithms graph theory imperfection ratio

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for multi-robot systems

Distributed algorithms for multi-robot systems

引用

6th International Symposium on Information Processing Sensor Networks

作者： McLurkin, James MIT CSAIL Cambridge MA 02139 USA

This demonstration showcases distributed algorithms for configuration control in multi-robot systems.. These algorithms include examples of gradient communication, clustering and dispersion, group motion, and network ... 详细信息

ISBN: (纸本)9781595936387

关键词： distributed algorithms multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Green IP Networks

Distributed Algorithms for Green IP Networks

引用

IEEE Conference on Computer Communications (INFOCOM)

作者： Bianzino, Aruna Prem Chiaraviglio, Luca Mellia, Marco Consorzio Nazl Interuniv Telecomunicaz Turin Italy

ISBN: (纸本)9781467310161

We propose a novel distributed approach to exploit sleep mode capabilities of links in an Internet Service Provider network. Differently from other works, neither a central controller, nor the knowledge of the current traffic matrix is assumed, favoring a major step towards making sleep mode enabled networks practical in the current Internet architecture. Our algorithms are able to automatically adapt the state of network links to the actual traffic in the network. Moreover, the required input parameters are intuitive and easy to set. Extensive simulations that consider a real network and traffic demand prove that our algorithms are able to follow the daily variation of traffic, reducing energy consumption up to 70% during off peak time, with little overheads and while guaranteeing Quality of Service constraints.

关键词： distributed algorithms Internet Protocol networks flow matrix central controller sleeping mode traffic network Travel demand DAILY VARIATIONS Intuitive input parameter off peak internet service providers algorithms energy consumption

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Verifying and Ensuring Strong Connectivity of Directed Networks 60

Distributed Algorithms for Verifying and Ensuring Strong Con...

引用

60th IEEE Conference on Decision and Control (CDC)

作者： Atman, Made Widhi Surya Gusrialdi, Azwirman Tampere Univ Fac Engn & Nat Sci Tampere 33014 Finland

ISBN: (纸本)9781665436595

This paper considers the problem of distributively verifying and ensuring strong connectivity of directed networks. Strong connectivity of a directed graph associated with the communication network topology is crucial in ensuring the convergence of many distributed algorithms. Specifically, inspired by maximum consensus algorithm, we first propose a distributed algorithm that enables nodes in a networked system to verify strong connectivity of a directed graph. Then, given an arbitrary weakly connected directed graph, we develop a distributed algorithm to augment additional links to ensure the directed graph's strong connectivity. Both algorithms are implemented without requiring information of the overall network topology and are scalable (linearly with the number of nodes) as they only require finite storage and converge in finite number of steps. Finally, the proposed distributed algorithms are demonstrated via several examples.

关键词： distributed algorithms finite-time strongly connected digraph max-consensus

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for the constrained quickest routing problem in multimedia communications 7

Distributed algorithms for the constrained quickest routing ...

引用

7th International Conference on Computer Communications and Networks

作者： Hung, YC Soochow Univ Dept Comp & Informat Sci Taipei Taiwan

ISBN: (纸本)0818690143

The shortest path problem is possibly the most important problem for data routing in multimedia communication. Chen and Chin have proposed a new variant of shortest path problem, termed the quickest path problem. The quickest path problem is find quickest paths in a computer network to transmit a given amount of data with minimal transmission time. The selection of quickest paths depends on both the characteristics of the computer network and the amount of data to be transmitted. The quickest path problem is to find quickest paths to send a certain amount of data through a communication network. Besides, if the quickest paths are required to go through a specified path, then the restricted problem is called the constrained quickest path problem. In this paper, some new distributed routing algorithms are developed for multimedia data transfer in an asynchronous communication network For all pairs of nodes in a network, an O(mn) messages and O(m) time distributed algorithm is first presented to find constrained quickest paths, and then an O(mn) messages and O(m) time distributed algorithm is present to enumerate the first k quickest paths.

关键词： communication networks routing algorithms distributed algorithms quickest path problem

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Fractional Coloring 28th

Distributed Algorithms for Fractional Coloring

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Bousquet, Nicolas Esperet, Louis Pirot, Francois Univ Claude Bernard Lyon 1 Lab LIRIS CNRS UMR 5205 Lyon France Univ Grenoble Alpes Lab G SCOP CNRS Grenoble France

ISBN: (纸本)9783030795269;9783030795276

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by Hasemann, Hirvonen, Rybicki and Suomela [19] that for every real alpha > 1 and integer Delta, a fractional coloring of total weight at most alpha(Delta + 1) can be obtained deterministically in a single round in graphs of maximum degree Delta, in the LOCAL model of computation. However, a major issue of this result is that the output of each vertex has unbounded size. Here we prove that even if we impose the more realistic assumption that the output of each vertex has constant size, we can find fractional colorings of total weight arbitrarily close to known tight bounds for the fractional chromatic number in several cases of interest. More precisely, we show that for any fixed epsilon > 0 and Delta, a fractional coloring of total weight at most Delta+epsilon can be found in Omega(log* n) rounds in graphs of maximum degree Delta with no K Delta+1, while finding a fractional coloring of total weight at most Delta in this case requires Omega(log log n) rounds for randomized algorithms and Omega(log n) rounds for deterministic algorithms. We also show how to obtain fractional colorings of total weight at most 2+ epsilon in grids of any fixed dimension, for any epsilon > 0, in O(log* n) rounds. Finally, we prove that in sparse graphs of large girth from any proper minor-closed family we can find a fractional coloring of total weight at most 2+ epsilon, for any epsilon > 0, in O(log n) rounds.

关键词： Fractional coloring Graph coloring distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for large-scale robotic ensembles: centrality, synchronization and self-reconfiguration

Distributed algorithms for large-scale robotic ensembles: ce...

引用

作者： Andre Naz UNIVERSITE BOURGOGNE FRANCHE-COMTE

学位级别：博士

Technological advances, especially in the miniaturization of robotic devices foreshadow the emergence of large-scale ensembles of small-size resource-constrained robots that distributively cooperate to achieve complex tasks (e. g., modular self-reconfigurable robots, swarm robotic systems, distributed microelectromechanical systems, etc.). These ensembles are formed by independent, intelligent and communicating units which act as a whole ensemble. These units cooperatively self-organize themselves to achieve common goals. These systems are thought to be more versatile and more robust than conventional robotic systems while having at the same time a lower cost. These ensembles form complex asynchronous distributed systems in which every unit is an embedded system with its own but limited capabilities. Coordination of such large- scale distributed embedded systems poses significant algorithmic issues and open new opportunities in distributed algorithms. In my thesis, I defend the idea that distributed algorithmic primitives suitable for the coordination of these ensembles should be both identified and designed. In this work, we focus on a specific class of modular robotic systems, namely large-scale distributed modular robotic ensembles composed of resource-constrained modules that are organized in a lattice structure and which can only communicate with neighboring modules. We identified and implemented three building blocks, namely centrality-based leader election, time synchronization and self-reconfiguration. We propose a collection of distributed algorithms to realize these primitives. We evaluate them using both hardware experiments and simulations on systems ranging from a dozen modules to more than ten thousand modules. We show that our algorithms scale well and are suitable for large-scale embedded distributed systems with scarce memory and computing resources.

关键词： distributed algorithms Modular robotics Centrality-based leader election Time synchronization Self-reconfiguration

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Shape Sculpting of Lattice-Arrayed Modular Robots via Hole Motion

Distributed Algorithms for Shape Sculpting of Lattice-Arraye...

引用

10th IEEE International Conference on Control and Automation (IEEE ICCA)

作者： Zhu, Jingwei Chen, Michael Z. Q. Su, Housheng Univ Hong Kong Dept Mech Engn Hong Kong Hong Kong Peoples R China Huazhong Univ Sci & Technol Dept Control Sci & Engn Huazhong Peoples R China

ISBN: (纸本)9781467347082;9781467347075

A self-reconfigurable modular robot can change its own shape by rearranging the connectivity of the modules of which it is composed. In this paper, we focus on a two-dimensional lattice-arrayed self-reconfigurable modular robotic system. Each module can move to a neighboring lattice under certain motion constraints, communicate with its neighbors and act upon local knowledge only. A scalable shape sculpting algorithm based on the manipulation of regularly shaped voids within the lattice ("holes") is given. We present detailed solutions to the conflict test and settlement problem encountered when applying this algorithm, and make improvement on the efficiency of shape sculpting. We believe that the algorithm can potentially generalize to 3D and scale to handle millions of modules.

关键词： distributed algorithms multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：