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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Cooperative and distributed algorithms for Dynamic Fire Coverage Using a Team of UAVs

Cooperative and Distributed Algorithms for Dynamic Fire Cove...

引用

作者： Shrestha, Kripash University of Nevada Reno

学位级别：M.S., Master of Science/Master of Surgery

Recent large wildfires in the United States and subsequent damage that they have caused have increased the importance of wildfire monitoring and tracking. However, human monitoring on the ground or in the air may be too dangerous and therefore, there needs to be alternatives to monitoring wildfires. Unmanned Aerial Vehicles (UAVs) are currently being considered and used for applications such as reconnaissance, surveying, and monitoring in the spatial-time domain because they can be deployed in teams remotely to gather information and minimize the harm and risk to human operators. UAVs have been previously used in this problem domain to track and monitor wildfires with approaches such as potential fields and reinforcement learning. In this thesis, we aim to look at a team of UAVs, in a distributed approach, over an area to maximize the sensor coverage in dynamic wildfire environments and minimize the energy consumption of deployed UAVs in a network. The work implements and compares an implementation of Deb's NSGA-II to optimize potential fields, Experience Replay with Q-learning, a Deep Q-Network (DQN), and a Deep Q-Network with a state estimator (autoencoder) to track and cover wildfires. The application of this work is a not a final suggestion or an absolute solution for wildfire monitoring and tracking but instead compares the methods to declare the most promising method for future work and research.

关键词： Cooperative algorithms distributed algorithms Genetic algorithm Reinforcement learning Team of UAVs Wildfire coverage

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for computation of fair rates in multirate multicast trees

Distributed algorithms for computation of fair rates in mult...

引用

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

作者： S. Sarkar L. Tassiulas Department of Electrical and Computer Engineering and Institute for Syslcnis Research University of Maryland College Park MD USA University System of Maryland Adelphi MD US

We study fairness in arbitrary networks with multicast capabilities. Multicast traffic in Internet and ATM provides a motivation for studying these networks. A study of fairness in multicast networks poses several interesting problems, e.g., the issue of inter-session fairness in addition to that of inter-session fairness in unicast networks. We develop a mathematical framework to model the fair allocation of bandwidth in multirate multicast networks with minimum and maximum rate constraints. We present distributed algorithms for computation of maxmin fair rates allocated to various source-destination pairs.

关键词： distributed algorithms distributed computing Computer networks Multicast protocols Video sharing Intelligent networks Educational institutions IP networks Mathematical model Multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for partially clairvoyant dispatchers

Distributed algorithms for partially clairvoyant dispatchers

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： K. Subramani K. Yellajyosula A. Osman LCSEE West Virginia University Morgantown WV USA CSE University of Minnesota Minneapolis MN USA

Summary form only given. Real-time systems are finding use in complex and dynamic environments such as cruise controllers, life support systems, nuclear reactors, etc., These systems have separate components that sense, control and stabilize the environment towards achieving the mission or target. These consociate components synchronize, compute and control themselves locally or have a centralized component to do the above. distributed computing techniques improve the overall performance and reliability of large real-time systems with spread components. We propose and evaluate three distributed dispatching algorithms for partially clairvoyant schedules. For a job set of size n, the algorithms have dispatch times of O(1) per job. In the first algorithm, one processor executes all the jobs and other processors compute the dispatch functions. This scenario simplifies design and is better in situations where one processor controls all the devices. For the other algorithms, all the processors execute jobs assigned to them and compute the dispatch functions in a certain defined order; which is a plausible scenario in distributed controlling. We create various test-cases to test the algorithms due to the unavailability of benchmarks.

关键词： distributed algorithms Real time systems Control systems distributed computing Testing Centralized control Dispatching Scheduling algorithm Processor scheduling Process control

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for shortest-path, deadlock-free routing and broadcasting in a class of interconnection topologies

Distributed algorithms for shortest-path, deadlock-free rout...

引用

International Symposium on Parallel Processing

作者： J. Liu W.-J. Hsu Department of Computer Science Michigan State University East Lansing MI USA

A class of novel interconnection topologies called the generalized Fibonacci cubes is presented. The generalized Fibonacci cubes include the hypercubes, the recently proposed Fibonacci cubes (W.-J. Hsu, Proc. Int. Conf. on Parallel Processing, p.1722-3 (1991)), and some other asymmetric interconnection topologies bridging between the two mentioned above. The generalized Fibonacci cubes can serve as a framework for studying degraded hypercubes due to faulty nodes or links. Previously known algorithms for hypercubes do not generalize to this class of interconnection topologies. The authors present distributed routing and broadcasting algorithms that can be applied to all members of this class of interconnection topologies. It is shown that their distributed routing algorithm always finds a shortest and deadlock-free path. The broadcasting algorithms are designed and evaluated based on both the all-port and the 1-port communication models. The all-port broadcasting algorithm is provably optimal in terms of minimizing routing steps. An upper bound for the 1-port broadcasting algorithm is determined, which is shown to be optimal for certain cases.< >

关键词： distributed algorithms System recovery Routing Topology Broadcasting Hypercubes Parallel processing Degradation Algorithm design and analysis Upper bound

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for shortest-path, deadlock-free routing and broadcasting in Fibonacci cubes

Distributed algorithms for shortest-path, deadlock-free rout...

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： J. Liu W.-J. Hsu Department of Computer Science Michigan State University East Lansing MI USA

distributed routing and broadcasting algorithms for the Fibonacci cube are presented. The routing algorithm is shown to find shortest and deadlock-free paths. Two communication models are considered for the broadcasting. It is shown that the all-port broadcasting algorithm is optimal in terms of minimized routing steps. An upper bound is obtained for the one-port broadcasting algorithm, which is shown to be optimal for certain cases. The time complexities of the all- and one-port broadcasting algorithms are examined.< >

关键词： distributed algorithms System recovery Routing Broadcasting Hypercubes Topology Fault tolerance Application software Data communication Computer science

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for multiple mutual exclusion based on Maekawa's square root N algorithm

Distributed algorithms for multiple mutual exclusion based o...

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： M. Mizuno G. Sundar Department of Computing and Information Sciences Kansas State University Manhattan KS USA

Summary form only given. The authors have developed algorithms which expand Maekawa's square root N algorithm to handle multiple mutual exclusion (AND-synchronization) problems, in which each node obtains mutually exclusive access to a set of resources rather than to a single resource. It involves suspending a requesting process until it successfully locks several resources simultaneously. Unlike a sequence of requests for (separate) single mutual exclusion, this approach prevents deadlock. distributed multiple mutual exclusion algorithms can be used in many applications, such as updating a replicated database or as part of a deadlock-free two-phase lock protocol in a distributed environment. In a centralized system, two types of multiple mutual exclusion algorithms exist. One type of primitive (called a PBOTH primitive) prevents starvation, but resource utilization is low. Another type of primitive (called an SP/SV primitive) may cause starvation, but resource utilization is high. The authors have developed both types of distributed algorithms.< >

关键词： distributed algorithms System recovery Permission distributed computing distributed databases Protocols

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for k-truss decomposition

Distributed algorithms for k-truss decomposition

引用

IEEE International Conference on Big Data

作者： Pei-Ling Chen Chung-Kuang Chou Ming-Syan Chen Department of Electrical Engineering National Taiwan University Taipei Taiwan Research Center of Information Technology Innovation Academia Sinica Taipei Taiwan

ISBN: (纸本)9781479956678

k-truss, a type of cohesive subgraphs of a network, is an important measure for a social network graph. However, with the emergence of large online social networks, the running time of the traditional batch algorithms for k-truss decomposition is usually prohibitively long on such a graph with billions of edges and millions of vertices. Moreover, the size of a graph becomes too large to load into the main memory of a single machine. Currently, cloud computing has become an imperative way to process the big data. Thus, our aim is to design a scalable algorithm of k-truss decomposition in the scenario of cloud computing. In this paper, we first improve the existing distributed k-truss decomposition in the MapReduce framework. We then propose a theoretical basis for k-truss and use it to design an algorithm based on graph-parallel abstractions. Our experiment results show that our method in the graph-parallel abstraction significantly outperforms the methods based on MapReduce in terms of running time and disk usage.

关键词： Algorithm design and analysis Computational modeling distributed algorithms Social network services Cloud computing Google Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for secure multipath routing

Distributed algorithms for secure multipath routing

引用

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

作者： P.P.C. Lee V. Misra D. Rubenstein Department of Computer Science Columbia University New York NY USA Department of Computer Science Department of Electrical Engineering Columbia University New York NY

To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several crucial properties that differentiate itself from previous approaches. They include (1) distributed routing decisions: routing decisions are made without the centralized information of the entire network topology, (2) bandwidth-constraint adaptation: the worst-case link attack is mitigated for any feasible session throughput subject to the link-bandwidth constraints, and (3) lexicographic protection: severe link attacks are suppressed based on lexicographic optimization. We devise two algorithms for the solution, termed the bound-control algorithm and the lex-control algorithm, and prove their convergence to the respective optimal solutions. Experiments show that the bound-control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the lex-control algorithm further enhances the bound-control algorithm by countering severe single-link attacks and various models of multi-link attacks. Moreover, the lex-control algorithm offers prominent protection after only a few execution rounds. Thus, system designers can sacrifice minimal routing security for significantly improved algorithm performance when deploying the distributed secure multipath solution.

关键词： distributed algorithms Data security Routing protocols Computer crime Computer science Network topology Throughput Bandwidth Constraint optimization Optimal control

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for multicast tree construction

Distributed algorithms for multicast tree construction

引用

International Symposium on Communications Control and Signal Processing (ISCCSP)

作者： L. Gatani G. Lo Re A. Urso Viale delle Scienze DINFO Università di Palermo Palermo Italy Istituto di Calcolo e Reti ad Alte Prestazioni ICAR-CNR Palermo Italy

This paper proposes two distributed algorithms for the heuristic solution of the Steiner tree problem in networks (SPN). The problem has a practical application in the construction of a minimum cost distribution tree for multicast transmission. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Currently, given the lack of efficient distributed methods, the existing protocols build the multicast distribution tree using some selected central node. The proposed distributed algorithms allow the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithms have been implemented and tested both in simulation and on real networks, and their performance values are presented.

关键词： distributed algorithms Multicast algorithms Routing Computer networks Multicast protocols Network topology Joining processes Cost function Steiner trees distributed computing

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms in faulty networks

Distributed algorithms in faulty networks

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： T. Masuzawa K. Hagihara N. Tokura Education Center of Information Processing Osaka University Toyonaka Osaka Japan Faculty of Engineering Science Osaka University Toyonaka Osaka Japan

The authors present research on fault-tolerant distributed algorithms. The following problems in faulty networks are discussed: (1) spanning tree construction; (2) fault detection for a processor; and (3) fault detection for a link. These problems are not necessarily solvable in faulty networks. It is shown that the solvability is dependent on how much global information on the network each processor has a priori and whether the network is synchronous or not.< >

关键词： distributed algorithms Intelligent networks Network topology Fault detection Joining processes Information processing Fault tolerance Bidirectional control Algorithm design and analysis Nominations and elections

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：