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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

6,230 篇 distributed algo...
545 篇 convergence
545 篇 wireless sensor ...
526 篇 algorithm design...
411 篇 optimization
381 篇 computer science
371 篇 distributed comp...
363 篇 network topology
329 篇 routing
279 篇 resource managem...
219 篇 protocols
210 篇 computational mo...
207 篇 computer network...
202 篇 costs
199 篇 approximation al...
199 篇 fault tolerance
185 篇 ad hoc networks
181 篇 bandwidth
179 篇 peer to peer com...
177 篇 interference

机构

25 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
15 篇 univ liverpool d...
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,125 篇 英文
62 篇 其他
38 篇 中文
4 篇 德文
1 篇 法文
1 篇 葡萄牙文
1 篇 俄文
1 篇 土耳其文

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

共 6230 条记录，以下是371-380 订阅

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

详细简洁

排序：

D-FW: Communication efficient distributed algorithms for high-dimensional sparse optimization

D-FW: Communication efficient distributed algorithms for hig...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jean Lafond Hoi-To Wai Eric Moulines Institut Mines-Telecom CNRS LTCI Paris France School of ECEE Arizona State Univ AZ USA CMAP Ecole Polytechnique Palaiseau France

ISBN: (纸本)9781479999897

We propose distributed algorithms for high-dimensional sparse optimization. In many applications, the parameter is sparse but high-dimensional. This is pathological for existing distributed algorithms as the latter require an information exchange stage involving transmission of the full parameter, which may not be sparse during the intermediate steps of optimization. The novelty of this work is to develop communication efficient algorithms using the stochastic Frank-Wolfe (sFW) algorithm, where the gradient computation is inexact but controllable. For star network topology, we propose an algorithm with low communication cost and establishes its convergence. The proposed algorithm is then extended to perform decentralized optimization on general network topology. Numerical experiments are conducted to verify our findings.

关键词： Optimization Signal processing algorithms Convergence distributed algorithms Network topology Stochastic processes Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Explicit Combinatorial Structures for Cooperative distributed algorithms

Explicit Combinatorial Structures for Cooperative Distribute...

引用

International Conference on distributed Computing Systems

作者： D. Kowalski P.M. Musial A.A. Shvartsman Instytut Informatyki Uniwersytet Warszawski Warszawa Poland Department of Computer Science & Engineering University of Connecticut Storrs CT USA Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA USA

Cooperation in distributed settings often involves activities that must be performed at least once by the participating processors. When processor failures or delays occur, it becomes unavoidable that some tasks are done redundantly. To make efficient use of the available processors, several distributed algorithms schedule the activities of the processors in terms of permutations of tasks that need to be performed at least once. This paper presents the first explicit practical deterministic construction of sets of permutations with certain combinatorial properties that immediately make practical several deterministic distributed algorithms. These algorithms solve a variety of problems, for example, cooperation in shared-memory and message-passing settings, and the gossip problem. Prior to this work, the most efficient algorithms for some of these problems were primarily of theoretical interest - they relied on permutations that are known to exist, but very expensive to construct, with the cost of construction being at least exponential in the size of the permutations. In this paper, the explicitly constructed permutations are ultimately used directly to produce practical instances of several classes of efficient deterministic algorithms. Most importantly, for all of these algorithms, the schedule construction cost is reduced from exponential to polynomial, at the expense of slight detuning, at most polylogarithmic, of the efficiency of these algorithms

关键词： distributed algorithms distributed computing Processor scheduling Computer science Costs Scheduling algorithm Polynomials Delay Artificial intelligence Collaboration

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient distributed algorithms for Solving Linear Algebraic Equations over Directed Graphs

Communication-Efficient Distributed Algorithms for Solving L...

引用

IEEE Conference on Decision and Control

作者： Ji Liu Brian D. O. Anderson Stony Brook University Research School of Electrical Energy and Material Engineering Australian National University Canberra Australia Hangzhou Dianzi University China Data61-CSIRO in Canberra Australia

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

This paper presents two communication-efficient distributed algorithms for solving linear algebraic equations of the form Ax = b, which has at least one solution, among a network of m> 1 agents. Each agent knows only a subset of the rows of the partitioned matrix [A b] and recursively updates its estimate of a solution by utilizing information received only from its neighbors. Neighbor relations are characterized by a fixed directed graph. The first algorithm aims to reduce communication costs at each iteration, in which each agent broadcasts the entries of its estimate in a cyclic manner, instead of broadcasting the entire vector of its estimate. It is shown that for any strongly connected neighbor graph, the algorithm causes all agents' estimates to converge to the same solution to Ax = b exponentially fast. The second algorithm reduces the vector size of each agent's estimate by exploiting the sparsity of the matrix A. It is shown that the algorithm causes each agent's estimate to converge to a specific part of the same solution to Ax = b corresponding to its own interest exponentially fast for a certain class of directed graphs.

关键词： Directed graphs distributed algorithms Kernel Partitioning algorithms Eigenvalues and eigenfunctions Australia Symmetric matrices

来源：评论

学校读者我要写书评

暂无评论

Iterative distributed algorithms for real-time available transfer capability assessment of multiarea power systems

Iterative distributed algorithms for real-time available tra...

引用

IEEE General Meeting Power& Energy Society

作者： Jian-Hong Liu Chia-Chi Chu National Tsing Hua University Hsinchu TW

ISBN: (纸本)9781538622131;9781538622124

This paper studies iterative distributed algorithms for real-time available transfer capability (ATC) assessment in energy management systems of multiarea power systems. Since ATC calculations can be modeled as a special nonlinear optimal power-flow problem, iterative decomposition-coordination approaches based on constrained augmented Lagrangian methods can be applied. One special distributed scheme, called the auxiliary problem principle method, will be studied for distributed ATC assessment in this paper. A computation framework of this distributed algorithm is investigated. System partition with nonoverlapping and boundary sub-systems will also be studied. Simulations of several IEEE test systems will be conducted to validate the feasibility and the correctness of this distributed ATC. In addition, the real-time monitoring and reaction mechanism of this distributed algorithm will also be demonstrated by numerical experiments.

关键词： distributed algorithms Real-time systems Iterative algorithms Power systems Computational modeling Energy management

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Performance of distributed algorithms 07

Analyzing the Performance of Distributed Algorithms

引用

Performance Metrics for Intelligent Systems Workshop

作者： Robert N. Lass Evan A. Sultanik William C. Regli Drexel University Philadelphia PA

ISBN: (纸本)9781595938541

A large class of problems in multiagent systems can be solved by distributed constraint optimization (DCOP). Several algorithms have been created to solve these problems, however, no extensive evaluation of current DCOP algorithms on live networks exists in the literature. This paper uses DCOPolis--a framework for comparing and deploying DCOP software in heterogeneous environments--to contribute an analysis of two state-of-the-art DCOP algorithms solving a number of different problem types. Then, we use this empirical validation to evaluate the use of both cycle-based runtime and concurrent constraint checks.

关键词： distributed algorithms algorithms Constrained optimization BISTABILITY Runtime

来源：评论

学校读者我要写书评

暂无评论

Designing efficient distributed algorithms using sampling techniques

Designing efficient distributed algorithms using sampling te...

引用

International Symposium on Parallel Processing

作者： S. Rajasekaran D.S.L. Wei University of Florida USA University of Aizu Aizu Japan

Shows the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that, by using sampling techniques, selection can be done on some networks in such a way that the message complexity is independent of the cardinality of the set (file), provided the file size is polynomial in the network size. For example, given a file F of size n and an integer k (1/spl les/k/spl les/n), on a p-processor de Bruijn network our deterministic selection algorithm can find the kth smallest key from F using O(p log/sup 3/p) messages and with a communication delay of O(log/sup 3/p), and our randomized selection algorithm can finish the same task using only O(p) messages and a communication delay of O(log p) with high probability, provided the file size is polynomial in network size. Our randomized selection outperforms the existing approaches in terms of both message complexity and communication delay. The property that the number of messages needed and the communication delay are independent of the size of the file makes our distributed selection schemes extremely attractive in such domains as very large database systems. Making use of our selection algorithms to select pivot element(s), we also develop a near-optimal quicksort-based sorting scheme and a nearly-optimal enumeration sorting scheme for sorting large distributed files on the hypercube and de Bruijn networks. Our algorithms are fully distributed without any a priori central control.

关键词： Algorithm design and analysis distributed algorithms Sampling methods Delay Sorting distributed computing Polynomials Hypercubes Computer networks Database systems

来源：评论

学校读者我要写书评

暂无评论

An approach for facilitating the development of visual simulations of parallel and distributed algorithms

An approach for facilitating the development of visual simul...

引用

International Conference on Signals, Circuits and Systems, SCS

作者： Ashraf Abu Baker Borislav Milanovic Qi Wang Department of Computer Graphics Goethe-Universität Frankfurt am Main Frankfurt Germany

ISBN: (纸本)9781424443970;9781424443987

Parallel and distributed algorithms constitute an advanced topic in theoretical and practical computer science that has gained much interest recently. It is generally known that studying and teaching the fundamentals of parallel algorithm's concepts present a constant challenge to both learners and educators. Due to the additional abstract concepts applied in the implementation of parallel algorithms, designing visualisations of parallel algorithms is far more arduous than visualising sequential algorithms (single process). At the same time, the pedagogical gain of parallel algorithm visualisations is much higher than that of sequential ones. In this paper we introduce a new approach to minimising the effort needed to create effective visual simulations of parallel and distributed algorithms.

关键词： distributed algorithms Parallel algorithms Computer graphics Data visualization Education Algorithm design and analysis Instruments Circuits and systems Computational modeling Yarn

来源：评论

学校读者我要写书评

暂无评论

DMIP3S: distributed algorithms for power-conserving multicasting in static wireless ad hoc networks

DMIP3S: distributed algorithms for power-conserving multicas...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Dazhen Pan P. Mavinkurve H.Q. Ngo V. Verma A. Chandak Computer Science and Engineering Department State University of New York University at Buffalo Amherst NY USA

In a static wireless ad hoc network, given a distinguished source node, and a subset of nodes called multicast group members, the minimum-energy multicast problem is to assign appropriate power levels to nodes in the network so that all group members are reachable from the source, and the total power usage is as small as possible. Computing effective power assignments and the multicast trees in a distributed manner is a major challenge. We devise two distributed algorithms for this problem. The central idea is called incremental power with potential power saving (IP3S). One algorithm, called DMIP3S (distributed multicast IP3S), is for small multicast groups and the other one, called P-DIP3S (pruning version of distributed IP3S), is for larger groups. Extensive simulations show that our distributed algorithms work even better than most known centralized ones. As far as we know, these are the first distributed algorithms for this problem.

关键词： distributed algorithms Intelligent networks Ad hoc networks Multicast algorithms Broadcasting Mobile ad hoc networks Mobile communication Computer science Power engineering and energy distributed computing

来源：评论

学校读者我要写书评

暂无评论

Parallel and distributed algorithms and implementations: time based mutual exclusion 09

Parallel and distributed algorithms and implementations: tim...

引用

Proceedings of the 2009 Spring Simulation Multiconference

作者： Syed S. Rizvi Hemen Patel Khaled Elleithy University of Bridgeport Bridgeport CT

A parallel algorithm is required to satisfy mutual exclusion in order to execute all processes properly. To execute Mutual exclusion, there must be required to satisfy these two conditions: synchronization and concurrent execution of all processes. Though failure of process inside the critical region may occur and that makes all other processes to wait until that process exit or stop using that critical region. This may lead to infinite time of wait for other process. This problem might be solved by time based mutual exclusion. In this paper we will present one solution for such failure. We create a new data structure of every critical region which is shared by other processes in the parallel and distributed environment. We introduce timestamp based data structure which tries to recover from such process failure. This timestamp based data structure has certain attributes based on that attributed we will recover from the failure of that process.

关键词： distributed algorithms parallel systems time based mutual exclusion

来源：评论

学校读者我要写书评

暂无评论

On node state reconstruction for fault tolerant distributed algorithms

On node state reconstruction for fault tolerant distributed ...

引用

Reliable distributed Systems

作者： M. Okun A. Barak Computer Science Institute Hebrew University of Jerusalem Jerusalem Israel

One of the main methods for achieving fault tolerance in distributed systems is recovery of the state of failed components. Though generic recovery methods like checkpointing and message logging exist, in many cases the recovery has to be application specific. In this paper we propose a general model for a node state reconstruction after crash failures. In our model the reconstruction operation is defined only by the requirements it fulfills, without referring to the specific application dependent way it is performed. The model provides a framework for formal treatment of algorithm-specific and system-specific recovery procedures. It is used to specify node state reconstruction procedures for several widely used distributed algorithms and systems, as well as to prove their correctness.

关键词： Fault tolerance distributed algorithms Computer crashes Fault tolerant systems Checkpointing Switches Computer science Algorithm design and analysis Software algorithms Hardware

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：