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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Principles of safe Policy Routing Dynamics

Principles of safe Policy Routing Dynamics

引用

International Conference on Network Protocols

作者： Samuel Epstein Karim Mattar Ibrahim Matta Computer Science Department Boston University USA

We introduce the dynamic policy routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route... 详细信息

ISBN: (纸本)9781424446353

关键词： Power generation economics Guidelines Peer to peer computing Topology Economic forecasting distributed algorithms Convergence Routing protocols Internet Computer science

来源：评论

学校读者我要写书评

暂无评论

Robust Equilibria in Additively Coupled Games in Communications Networks

Robust Equilibria in Additively Coupled Games in Communicati...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Saeedeh Parsaeefard Ahmad R. Sharafat Mihaela van der Schaar Department of Electrical and Computer Engineering Tarbiat Moalem University Tehran Iran Department of Electrical Engineering University of California Los Angeles USA

We obtain the robust Nash equilibrium (RNE) for a wide range of multi-user communications networks under uncertainty by utilizing the robust optimization theory for the worst-case uncertainties. To do so, we consider the uncertainty as a distance between the estimated and the actual values of the system parameters as a general norm function, and utilize the finite-dimensions variational inequalities (VI) to derive the conditions for existence and uniqueness of RNE. Two effects of uncertainty on the performance of the system are investigated: the difference between the achieved social utility at the RNE and the Nash equilibrium (NE) of the nominal game, and the distance between the deployed strategies of users at the RNE and at the NE. We quantify these two effects for the cases of unique NE and multiple NEs, and show that when the NE is unique, the achieved social utility at the RNE is always less than that of the NE. Interestingly, the worst-case robustness approach may lead to a higher social utility at the RNE in the multiple NEs scenario. Considering uncertainty at RNE introduces coupling between users, and hence, developing distributed algorithms for reaching RNE is more challenging as compared to the NE in the nominal game. However, for some special forms of utilities and norm functions, we propose simultaneous and sequential distributed algorithms; and investigate the performance of the robust game for power control in interference channels, and for flow control in Jackson networks.

关键词： Uncertainty Games Robustness distributed algorithms Power control Optimization IEEE Communications Society

来源：评论

学校读者我要写书评

暂无评论

Channel sharing scheme for packet-switched cellular networks

Channel sharing scheme for packet-switched cellular networks

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： S. Kalyanasundaram Junyi Li E.K.P. Chong N.B. Shroff School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Bell Laboratory Lucent Technologies Inc. Holmdel USA

We study an approach for sharing channels to improve network utilization in packet-switched cellular networks. This scheme exploits unused resources in neighboring cells without the need for global coordination. We formulate a minimax approach to optimizing the allocation of channels in this sharing scheme. We develop a distributed algorithm to achieve this objective and study its convergence. We illustrate, via simulation results, that the distributed channel sharing scheme performs better than the fixed channel scheme over a wide variety of traffic conditions.

关键词： Land mobile radio cellular systems Channel allocation Throughput Minimax techniques Convergence Circuits Intelligent networks Electronic mail distributed algorithms Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Loop-expanding fast restoration

Loop-expanding fast restoration

引用

IEEE Symposium on Network Operations and Management

作者： Kil-Hung Lee Yong-Hoon Choi Jai-Yong Lee Sang-Bae Lee Network & System Laboratory Electronics Engineering Yonsei University Seoul South Korea

ISBN: (纸本)0780343514

In this presentation, we introduce a fast restoration scheme against a link or node failure. Specifically, we apply this scheme to VP (Virtual Path) restoration in ATM (Asynchronous Transfer Mode) networks. Proposed restoration scheme operates on VP-based ATM network. This scheme is a distributed algorithm performed concurrently by network nodes neighboring failed node or link. When a node or link fails, restoration is performed according to the pre-assigned local, regional, and end-to-end restoration scheme. For this, we assigned a restoration level to each network nodes and VPs, respectively. Also, we devise and construct a VP loop, and fast restoration is performed along this loop. This loop is expanded when a failure occurs, and this expanded loop is used for the restoration of the failed VP connection. We define the required VP loop architecture, restoration messages, and restoration procedures. Proposed algorithm is simulated and compared with general flooding restoration scheme. Results show that the proposed loop-expanding restoration scheme can achieve fast restoration goal with a lower burden to network.

关键词： Asynchronous transfer mode Floods distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Traffic sensitive algorithms for generating self-organizing network schedules

Traffic sensitive algorithms for generating self-organizing ...

引用

MILCOM, Military Communications Conference

作者： J. Shor T.G. Robertazzi Depertment of Computer Science SUNY at Stony Brook Stony Brook NY USA

The generation of transmission schedules for self-organizing radio networks by traffic sensitive algorithms is described. A centralized traffic algorithm is used as a basis for the comparison of other algorithms. This algorithm is based on a suggestion made by Ephremides and Truong (see IEEE INFOCOM 1988, p.1119) to construct a priority rule based on traffic requirements. Although it is not possible to implement this algorithm in a distributed form, a distributed algorithm using nodal degree to determine priority among nodes is presented and shown to produce results closer to those of the preferred traffic-based algorithm than id-number-based priority does.< >

关键词： Telecommunication traffic Scheduling algorithm Self-organizing networks Traffic control Routing Symmetric matrices distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A decentralized social algorithm for committee coordination problem

A decentralized social algorithm for committee coordination ...

引用

International Symposium on Autonomous Decentralized Systems (ISADAS)

作者： Tongjun Huang Zixue Cheng M. Osano N. Shiratori Information Systems and Technology Center University of Aizu Fukushima Japan Department of Computer Software University of Aizu Fukushima Japan Research Institute of Electrical Communication University of Tohoku Sendai Japan

We consider an extended committee coordination problem in an autonomous decentralized social environment. The basic committee coordination problem and a distributed algorithm, as a solution to this problem in a distributed environment, are presented by K.M. Chandy and J. Misra (1988). The algorithm guarantees the synchronous and exclusion properties of the problem and is fair (i.e. starvation-free) and makes progress (i.e. deadlock-free). In an autonomous decentralized social environment, besides the above mentioned properties, some social properties, such as individual preference, privacy protection, and stable assignment, are required to be considered and guaranteed. We extend the committee coordination problem by introducing some social properties, such as individual preference and stable assignment and give a decentralized social algorithm as a solution to this extended problem. The algorithm guarantees not only the synchronous and exclusion properties but also individual preference and stable assignment properties.< >

关键词： distributed algorithms System recovery Privacy Protection

来源：评论

学校读者我要写书评

暂无评论

Routing bandwidth guaranteed paths with restoration in label switched networks

Routing bandwidth guaranteed paths with restoration in label...

引用

International Conference on Network Protocols

作者： S. Norden M.M. Buddhikot M. Waldvogel S. Suri Department of Computer Science Bell Laboratories Summer Intern Washington University Saint Louis USA Lucent Bell Laboratories Center for Networking Research USA IBM Zurich Research Laboratory Switzerland Department of Computer Science University of California Santa Barbara USA

ISBN: (纸本)0769514294

Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing flexibility, predictable bandwidth usage, and quality-of-service (QoS) provisioning. This flexibility in routing enables fault-persistent QoS reservations, where connectivity, and allotted bandwidth remains available, even if some links or network nodes fail. The automatic switch-over from a now-defunct path to a new, working path is known as restoration. Restoring bandwidth-guaranteed paths requires allocation of resources on backup paths that will be used in the event of faults. In this paper, we investigate distributed algorithms for routing with backup restoration. Specifically, we propose a new concept of backup load distribution matrix that captures partial network state, greatly reducing the amount of routing information maintained and transmitted while achieving efficient bandwidth usage. We present and simulate two new distributed routing algorithms, which provide significant improvements in rejection rates and provide substantial savings in bandwidth used and call setup time compared to existing algorithms.

关键词： Routing Bandwidth Intelligent networks Switches Optical packet switching Event detection Computer science Circuit faults Resource management distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A study of token traversal strategies on tree-based backbones for mobile ad hoc - delay tolerant networks

A study of token traversal strategies on tree-based backbone...

引用

International Conference on Ultra Modern Telecommunications and Workshops (ICUMT)

作者： Apivadee Piyatumrong Pascal Bouvry Frédéric Guinand Kittichai Lavangnananda FSTC CSC Université du Luxembourg Luxembourg LITIS Le Havre University Le Havre France School of Information Technology BKK King Mongkut''s University of Technology Thailand

Tree-based backbone establishment and maintenance in mobile ad hoc - delay tolerant networks is often operated through the use of traversing tokens. A study and framework are proposed here for various token traversal strategies on tree-based backbones. The proposed strategies execute in a distributed and purely decentralized manner, and require only 1-hop knowledge. Aiming at providing the highest robustness and quality of services, these token-traversal strategies are studied in particular with an algorithm for merging and maintaining the different trees based on the quality of the nodes. For the robustness aspect, the use of a trust-based evaluation framework is assumed and the weights of the different nodes are based on their quality of cooperation. Three cost functions are implemented in order to evaluate the trust based framework proposed, including another function for evaluating tree-convergence time. Results and comparison charts are provided to illustrate the trade-off between the various strategies in terms of performance, cost (memory and communication) and robustness.

关键词： Spine Disruption tolerant networking Robustness Mobile communication distributed algorithms Ad hoc networks Information technology Quality of service Merging Cost function

来源：评论

学校读者我要写书评

暂无评论

Anode-ALM: An Aggregation-Based Application Level Multicast for Media Streaming

Anode-ALM: An Aggregation-Based Application Level Multicast ...

引用

International Symposium on Parallel Architectures, algorithms and Networks (ISPAN)

作者： Feng Liu Yuxing Peng Xicheng Lu Parallel and Distributed Processing Laboratory School of Computer Science and Technology National University of Defense Technology Changsha China

Building application level multicast (ALM) for media streaming, we had better keep the invariability of source to-end delay (S2EDelay) of any node on the tree, so as to avoid delay jitter problem. In this paper, we proposed an aggregation-based ALM architecture, which aggregates the unstable nodes within a local area into a relative stable aggregation node Anode, and then builds tree by Anodes. Anode shields node's dynamicity inside and behaves as a stable one outside. To build the architecture, we first proposed an Anode structure by n-dimension anti-cube, and proposed a distributed algorithm to bind the logic view and physical view of an Anode dynamically by the differentiation and assimilation operations, which maintain the integrality of the logic view while the physical view changes dynamically. Experiment results indicate that our algorithm can keep the S2EDelay invariability of the built ALM tree effectively.

关键词： Streaming media Anodes Delay Stability Application software Jitter distributed algorithms Logic Internet Network topology

来源：评论

学校读者我要写书评

暂无评论

Construction of low cost virtual backbone for sensor networks

Construction of low cost virtual backbone for sensor network...

引用

International Conference on Computer and Communication Technology (ICCCT)

作者： Komal Bansal Awadhesh Kumar Singh Department of Computer Engineering National Institute of Technology Kurukshetra India

Virtual backbone formation is a popular approach to reduce the routing overhead and increase the network scalability in the wireless ad hoc networks. Most of the centralized and distributed algorithms aim at minimizing the size of the virtual backbone. However, if every node of the network has a cost for handling the additional responsibilities as backbone node, goal of the backbone construction algorithm should be the minimization of the total cost. In this paper, we propose a distributed low cost backbone construction algorithm with the message complexity of O(n). Simulation results show that the proposed algorithm is cost and message efficient.

关键词： Connectors Algorithm design and analysis Wireless communication Routing distributed algorithms Approximation algorithms Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 483 484 485 486 487 488 489 490 491 492 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：