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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Robust Average Consensus over Packet Dropping Links: Analysis via Coefficients of Ergodicity

Robust Average Consensus over Packet Dropping Links: Analysi...

引用

IEEE Annual Conference on Decision and Control

作者： Nitin H. Vaidya Christoforos N. Hadjicostis Alejandro D. Dominguez-Garcia ECE Department of the University of Illinois at Urbana-Champaign ECE Department of the University of Cyprus

ISBN: (纸本)9781467320658

We consider a networked system in which each component (node) iteratively exchanges information with its neighbors according to an arbitrary, possibly directed topology. Based on an iterative exchange of (local and possibly directed) information, we develop an average-consensus distributed algorithm that is robust to unreliable (packet-dropping) communication links. By introducing virtual nodes, we show that the execution of the proposed algorithm is mathematically equivalent to a finite inhomogenous Markov chain. Then, by using coefficients of ergodicity, we can prove convergence of the robust distributed algorithm to the exact average, in the presence of packet drops and under a very broad set of conditions.

关键词： distributed algorithms Packet Coefficients Legal Executions Robustness Analysis Mentoring Telecommunication links Converge

来源：评论

学校读者我要写书评

暂无评论

Agents Based Service Restoration in Electrical Secondary Distribution Network

Agents Based Service Restoration in Electrical Secondary Dis...

引用

International Conference on Systems and Informatics (ICSAI)

作者： Rukia J. Mwifunyi Nerey H. Mvungi Mussa M. Kissaka University of Dares Salaam Dar es Salaam Tanzania University of Dar es Salaam Dar es Salaam Tanzania

ISBN: (数字)9781728152561

ISBN: (纸本)9781728152578

Service Restoration (SR) is one of the fundamental functionalities of distribution management system during fault management process. Several approaches have been devised to solve the SR problem on distribution network including centralized and distributed approaches. Most of the existing studies focused on the service restoration in the medium voltage network with very few focusing on the Secondary Distribution Network (SDN). In most countries including Tanzania, the service restoration is accomplished manually through relying on operational experiences, rated capacity of the transformers and peak hour demand for decision making. This study aimed at designing distributed algorithm based on multiagent system for SR in the SDN. The study has been conducted through intensive literature review together with focus group discussion with key stakeholders from utility company, study visits to the Tanzania SDN in Dar es Salaam region and interviews with the technical people. SDN with three transformers rated at 315kVA, 200kVA and 100kVA have been chosen as the pilot site for designing the distributed algorithm. The designed algorithm includes designing of multiagent system, objective functions to be optimized and design for the equipment specifications and power system network topology to support SR. Four agents namely, Control Agent, Grid Agent, Load Agent and Switch Agent have been found to be optimal for the SR process. The designed restoration process mainly focuses on load transfer to the nearby transformer and load shedding. The future work will focus on real implementation of the designed algorithm and consideration of the integration of the renewable distributed generations.

关键词： Switches Decision making Decentralized control Switching circuits distributed algorithms Multi-agent systems Linear programming

来源：评论

学校读者我要写书评

暂无评论

An Efficient Pricing Based Protocol for Broadcasting in Wireless Ad hoc Networks

An Efficient Pricing Based Protocol for Broadcasting in Wire...

引用

International Conference on Communication Systems Software and Middleware (COMSWARE)

作者： N.R. Suri Y. Narahari D. Manjunath Department of Computer Science and Automation Indian Institute of Science Bangalore India Networks Architecture Laboratory Electrical and Communications Engineering Indian Institute of Science Bangalore India

In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called immediate predecessor node pricing mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol

关键词： Pricing Wireless application protocol Broadcasting Mobile ad hoc networks Game theory Power system reliability Intelligent networks Costs distributed computing distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Reverse Link Rate Control algorithms with Utility Function Model for CDMA2000 1x EV-DO Systems

Reverse Link Rate Control Algorithms with Utility Function M...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Liu Bingzhang Zhang Yong Xin Zhang Dacheng Yang Wireless Theories and Technologies (WT&T) Beijing University of Posts and Telecommunications Beijing China Beijing University of Posts and Telecommunications Beijing Beijing CN

This paper focuses on the research of distributed rate control algorithms for the reverse link of 1times EV-DO systems. First, following the basic idea proposed by Kelly (1997), a utility maximization system model is formulated. The objective of the rate control algorithms is to make the system converge to the optimal state of the system model. We investigate the performance of two distributed rate control algorithms: the conventional distributed rate control (CDRC) algorithm and the modified distributed rate control (MDRC) algorithm. The CDRC is based on the MAC algorithm in CDMA2000 1times EV-DO Standard (2005). With the CDRC, we give our conclusions as how to design the specific functions of the algorithm according to the utility functions to ensure the objective mentioned above. The MDRC is a new proposed algorithm based on the optimal solution of the system problem which can also ensure the objective. Our numerical simulation results give the performance comparisons between them and validate our deduction.

关键词： distributed control Resource management Telecommunication control Algorithm design and analysis Numerical simulation Convergence Student members Paper technology Optimal control distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Self-Stabilizing Small k-Dominating Sets

Self-Stabilizing Small k-Dominating Sets

引用

International Conference on Networking and Computing (ICNC)

作者： Stephane Devismes Karel Heurtefeux Yvan Rivierre Ajoy K. Datta Lawrence L. Larmore VERIMAG Laboratory Université Joseph Fourier Grenoble France School of Computer Science University of Nevada Las Vegas USA

A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, recovers in finite time without external (e.g., human) intervention. In this paper, we propose a distributed asynchronous silent self-stabilizing algorithm for finding a minimal k-dominating set of at most [n/(k+1)] processes in an arbitrary identified network of size n. We propose a transformer that allows our algorithm work under an unfair daemon (the weakest scheduling assumption). The complexity of our solution is in O(n) rounds and O(Dn 2 ) steps using O(log n + k log n/k) bits per process where D is the diameter of the network.

关键词： Algorithm design and analysis Vegetation Complexity theory Upper bound Computational modeling distributed algorithms Nominations and elections

来源：评论

学校读者我要写书评

暂无评论

Autonomous end to end QoS monitoring

Autonomous end to end QoS monitoring

引用

Workshop on End-to-End Monitoring Techniques and Services

作者： C. Elster D. Raz R. Wolff Computer Science Department Technion-Israel Institute of Technology Haifa Israel CSEE Department University of Maryland Baltimore County USA

Verifying that each flow in the network satisfies its QoS requirements is one of the biggest scalability challenges in the current DiffServ architecture. This task is usually performed by a centralized allocation entity that monitors the flows' QoS parameters. Efficient detection of problematic flows is even more challenging when considering aggregated information such as the end to end delay suffered by packets belonging to a specific flow. Known oblivious and reactive monitoring techniques do not scale well when the number of flows and the length of their paths increase, and when the network load increases. This is due both to load on the centralized bandwidth allocation entity and to the excessive number of monitoring and control messages needed. We propose a new monitoring paradigm termed autonomous monitoring, in which the network itself (i.e. the routers along the flow path) is responsible to discover when a violation of the SLA occurs (or is soon to occur). Only in such cases the centralized allocation entity is notified, and can take the required actions. We study the performance of this new distributed algorithm through theoretical analysis and extensive simulations. Our results indicate that in addition to dramatically reducing the load from the centralized allocation entity, the amount of network traffic needed is relatively small and thus the new monitoring scheme scales well.

关键词： Monitoring Scalability Diffserv networks Delay Channel allocation Centralized control distributed algorithms Performance analysis Algorithm design and analysis Analytical models

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Leader Election in IoT Networks: A Cloud Storage Perspective

Energy-Efficient Leader Election in IoT Networks: A Cloud St...

引用

IEEE International Conference on Utility and Cloud Computing (UCC)

作者： Ahcene Bounceur Saadat M. Alhashmi Foudil Mir Kara Mostefa College of Computing and Informatics University of Sharjah Sharjah UAE LIMED Laboratory Faculty of Exact Sciences University of Bejaia Bejaia Algeria Interdisciplinary Research Center for Intelligent Secure Systems KFUPM Dhahran KSA

ISBN: (数字)9798350367201

ISBN: (纸本)9798350367218

In a distributed environment where IoT devices collaborate on shared datasets, it is vital to establish a secure and efficient turn-taking process for data updates. Unlike centralized systems, where mutexes can effectively manage access to shared resources, distributed systems require alternative solutions. This is where distributed locks and leader election mechanisms are critical in maintaining order and consistency. The DoTRo (Dominating Tree Routing) Leader Election Algorithm stands out as a promising solution specifically designed for IoT applications, owing to its low power consumption. Remarkably, this algorithm achieves an impressive (85%) reduction in energy usage compared to traditional methods, making it highly efficient for resource-constrained environments. This paper explores the implementation of the DoTRo algorithm within the context of cloud storage, providing a detailed case study highlighting its effectiveness in managing data updates while minimizing energy consumption in distributed IoT settings. Through this examination, we aim to underscore the importance of innovative algorithms like DoTRo in optimizing performance and sustainability in future IoT applications.

关键词： Cloud computing Energy consumption Power demand Voting distributed databases Routing Energy efficiency Internet of Things Sustainable development distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Persistence and communication state transfer in an asynchronous pipe mechanism

Persistence and communication state transfer in an asynchron...

引用

International Conference on Parallel and distributed Systems (ICPADS)

作者： Philip Chan David Abramson MESSAGE Laboratory Caulfi eld School of Information Technology Monash University Caulfield VIC Australia

Emergent wide-area distributed systems like computational grids present opportunities for large scientific applications. On these systems, communication mechanisms have to deal with dynamic resource availability and occurrence of network failures. In this paper, we present the design and implementation of an asynchronous and persistent pipe mechanism, called pi-channels. These communication issues are addressed by combining adaptive caching with data streaming for efficient and fault-tolerant communication. We present the underlying distributed algorithm that implements (a) caching of pipe data segments; (b) asynchronous operation; and (c) re-establishment of connections when a peer leaves and rejoins the computation - part of a communication state transfer mechanism. This makes it possible for different segments (from cache and from writer) of the pipe data to be concurrently streamed to the migrated reader, reducing the retrieval time. Finally, we present some performance results showing the benefits of asynchronous operation.

关键词： Grid computing TCPIP distributed computing Availability Peer to peer computing Computer networks distributed algorithms Pipelines Fault tolerant systems Protocols

来源：评论

学校读者我要写书评

暂无评论

Democracy in Markov chains and its preservation under local perturbations

Democracy in Markov chains and its preservation under local ...

引用

2010 49th IEEE Conference on Decision and Control

作者： Fabio Fagnani Jean-Charles Delvenne Dipartimento di Matematica Politecnico di Torino Italy Department of Mathematics Facultes Universitaires Notre-Dame de la Paix Belgium

ISBN: (纸本)9781424477456

A sequence of irreducible Markov chains with increasing state cardinality is called democratic if the sequence of corresponding invariant probabilities converges to 0 uniformly. Democracy is a relevant property which naturally shows up when we deal with distributed algorithms like consensus or with opinion dynamic models: it says that each agent measure/opinion is going to play a negligible role in the asymptotic behavior of the global system. Simple random walks on undirected graphs of bounded degree and increasing cardinality are one of the simplest examples of democratic chains. Similar examples can be built considering more general time-reversible chains. In this paper we prove a general result which says that, under some technical assumptions, perturbing the transition probabilities from a finite number of vertices of a time-reversible democratic sequence of chains, democracy is preserved. We want to stress the fact that the local perturbation in general breaks the time-reversibility of the chains. The main technical assumption needed in our result is the irreducibility of the limit Markov chains and we show with an example that this assumption is indeed necessary.

关键词： Democracy Markov chain Tree graphs TRANSITION PROBABILITIES distributed algorithms perturbation asymptotic behavior base number

来源：评论

学校读者我要写书评

暂无评论

On network traffic concentration and updating interval for proactive recovery method against large-scale network failures

On network traffic concentration and updating interval for p...

引用

Australasian Telecommunication Networks and Applications Conference, ATNAC

作者： Takuro Horie Go Hasegawa Satoshi Kamei Masayuki Murata Graduate School of Information Science and Technology Osaka University Suita Japan Cybermedia Center Osaka University Toyonaka Osaka Japan NTT Service Integration Laboratories NTT Corporation Musashino Tokyo Japan

Proactive recovery methods from network failures, based on multiple routing configurations, are effective for quick failure recovery, as compared with reactive recovery methods. However, there are two major problems, especially when we consider recovering from large-scale network failures: updating interval for recalculation of routing configurations against network growth, and network traffic concentration on specific nodes and links after recovering failures. In this paper, we first propose a light-weight and distributed algorithm for updating routing configurations when new nodes and links join the network, which does not need overall recalculation. We then evaluate the proactive recovery method for large-scale network failures, with proposed algorithm from the viewpoint of above two problems. Through numerical evaluation results, we find that to maintain the recovery performance, we should recalculate the routing configurations when the network grows by roughly 5-10%. We also present that the degree of network traffic concentration decreases when we employ a hop-by-hop selection mechanism of routing configuration.

关键词： Telecommunication traffic Large-scale systems Routing Electronic mail Network topology Convergence Large scale integration Information science Laboratories distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：