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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

3,869 篇 工学
- 2,120 篇 计算机科学与技术...
- 1,869 篇 电气工程
- 957 篇 信息与通信工程
- 902 篇 控制科学与工程
- 389 篇 软件工程
- 151 篇 仪器科学与技术
- 147 篇 电子科学与技术（可...
- 135 篇 机械工程
- 70 篇 交通运输工程
- 39 篇 石油与天然气工程
- 21 篇 网络空间安全
- 20 篇 动力工程及工程热...
- 15 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 8 篇 材料科学与工程（可...
- 7 篇 航空宇航科学与技...
654 篇 理学
- 344 篇 数学
- 269 篇 系统科学
- 70 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
234 篇 管理学
- 226 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
36 篇 医学
- 31 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
2 篇 农学
1 篇 艺术学

主题

6,170 篇 distributed algo...
552 篇 convergence
544 篇 wireless sensor ...
533 篇 algorithm design...
414 篇 optimization
382 篇 computer science
366 篇 distributed comp...
363 篇 network topology
331 篇 routing
279 篇 resource managem...
217 篇 protocols
215 篇 computational mo...
210 篇 computer network...
206 篇 costs
202 篇 approximation al...
197 篇 fault tolerance
187 篇 ad hoc networks
183 篇 bandwidth
180 篇 peer to peer com...
179 篇 interference

机构

24 篇 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 篇 univ cyprus dept...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
22 篇 notarstefano giu...
21 篇 hong yiguang
20 篇 dagdeviren orhan
20 篇 scutari gesualdo
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
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
15 篇 cortes jorge

语言

6,066 篇 英文
59 篇 其他
38 篇 中文
3 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

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

共 6170 条记录，以下是1701-1710 订阅

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

详细简洁

排序：

A MULTICORE CONVEX OPTIMIZATION ALGORITHM WITH APPLICATIONS TO VIDEO RESTORATION 25

A MULTICORE CONVEX OPTIMIZATION ALGORITHM WITH APPLICATIONS ...

引用

25th IEEE International Conference on Image Processing (ICIP)

作者： Abboud, Feriel Chouzenoux, Emilie Pesquet, Jean-Christophe Talbot, Hugues WITBE France Puteaux La Defense France Univ Paris Saclay Cent Supelec INRIA Saclay CVN Paris France Univ Paris Est Marne La Vallee ESIEE CNRS LIGMUMR 8049 Champs Sur Marne France

ISBN: (纸本)9781479970612

In this paper, we present a new distributed algorithm for minimizing a sum of non-necessarily differentiable convex functions composed with arbitrary linear operators. The overall cost function is assumed strongly convex. Each involved function is associated with a node of a hypergraph having the ability to communicate with neighboring nodes sharing the same hyperedge. Our algorithm relies on a primal-dual splitting strategy with established convergence guarantees. We show how it can be efficiently implemented to take full advantage of a multicore architecture. The good numerical performance of the proposed approach is illustrated in a problem of video sequence denoising, where a significant speedup is achieved.

关键词： convex optimization distributed algorithms proximal methods video processing parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Complete Visitability for Autonomous Robots on Graphs 32

Complete Visitability for Autonomous Robots on Graphs

引用

32nd IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Aljohani, Aisha Poudel, Pavan Sharma, Gokarna Kent State Univ Dept Comp Sci Kent OH 44242 USA

ISBN: (纸本)9781538643686

We consider the distributed setting of N autonomous mobile robots operating on graphs following Look-Compute-Move cycles and communicating with other robots using colored lights under the robots with lights model. We assume obstructed visibility under which a robot cannot see another robot if a third robot is positioned between them on the straight line connecting them. We introduce and study the fundamental problem of repositioning N robots on the nodes of a graph so that each robot has a path to all others without visiting an intermediate node that is occupied by any other robot (which we call the COMPLETE VISITABILITY problem). This problem is of interest due to its relationship to the problems of information collection, scattering, flocking, and dispersion on graphs. This problem generalizes the COMPLETE VISIBILITY problem studied in the literature, where the goal was to reposition the robots on a plane so that each robot sees all others. We have the following four results: We first show that it is impossible to solve COMPLETE VISITABILITY on arbitrary graphs, irrespective of the number of colors, time, and the robot activation setting (fully synchronous, semi-synchronous, or asynchronous). We then give an algorithm that solves COMPLETE VISITABILITY on grid graphs using 7 colors in the semi-synchronous setting. The algorithm uses 6 colors in the fully synchronous setting. The algorithm is collision-free. We then show that the total number of moves by any robot is O(h) and the runtime is O(h(2)) in our algorithm, where h denotes the number of layers of robots in the initial configuration. We also show that the number of moves bound is asymptotically tight and any COMPLETE VISITABILITY algorithm has runtime Omega(h) in grid graphs. We finally show that the algorithm and bounds for grid graphs extend to hexagonal tessellation graphs under chirality - robots agree on left and right directions.

关键词： distributed algorithms mobile agents lights graphs visibility collisions visitability obstruction

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance Performance of Self-stabilizing Independent Set algorithms on a Covering-Based Problem: The Case of Link Monitoring in WSNs 5

Fault Tolerance Performance of Self-stabilizing Independent ...

引用

5th International Conference on Electrical and Electronics Engineering (ICEEE)

作者： Yigit, Yasin Ileri, Can Umut Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

ISBN: (纸本)9781538663929

Vertex cover (VC) is one of the most fundamental graph-theoretical problems and has been widely used in wireless sensor networks (WSNs), particularly for the link monitoring problem. It is well known that a solution to the independent set problem (IS), which is another fundamental graph-theoretical problem, is complement of a VC. Self-stabilization is an important concept for designing fault tolerance systems. There have been many self-stabilizing VC and IS algorithms in the field. Even though a self-stabilizing IS algorithm can provide VC solutions, it does not give a theoretical guarantee on approximation ratio. In this work, we focus on practical fault tolerance performance of self-stabilizing IS algorithms in case of a vertex cover problem, particularly link monitoring in WSNs. We implement all existing self-stabilizing VC and IS algorithms and make simulations assuming a WSN in which nodes run synchronously. Results show that self-stabilizing IS algorithms in general are able to find better covers than VC algorithms, as they provide roughly 15% smaller solution sets. Furthermore, IS algorithms that run under distributed scheduler converges to a desired configuration in considerably less number of rounds than VC algorithms.

关键词： self-stabilization fault tolerance wireless sensor networks vertex cover independent set distributed algorithms link monitoring

来源：评论

学校读者我要写书评

暂无评论

Exact Implementation of Abstract MAC Layer via Carrier Sensing

Exact Implementation of Abstract MAC Layer via Carrier Sensi...

引用

37th IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Yu, Dongxiao Zhang, Yong Huang, Yuyao Jin, Hai Yu, Jiguo Hua, Qiang-Sheng Huazhong Univ Sci & Technol Sch Comp Sci & Technol Cluster & Grid Comp Lab Serv Comp Technol & Syst LabBig Data Technol & S Wuhan 430074 Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Qufu Normal Univ Sch Informat Sci & Engn Rizhao 276826 Peoples R China

ISBN: (纸本)9781538641286

In this paper, we present the first algorithm for exactly implementing the abstract MAC (absMAC) layer in the physical SINR model. The absMac layer, first presented by Kuhn et al. in [15], provides reliable local broadcast communication, with timing guarantees stated in terms of a collection of abstract delay functions, such that high-level algorithms can be designed in terms of these functions, independent of specific channel behavior. The implementation of absMAC layer is to design a distributed algorithm for the local broadcast communication primitives over a particular communication model that defines concrete channel behaviors, and the objective is minimizing the bounds of the abstract delay functions. Halldorsson et al. [10] have shown that in the standard SINR model (synchronous communication, without physical carrier sensing or location information), there cannot be efficient exact implementations. In this work, we show that physical carrier sensing, a commonly seen function performed by wireless devices, can help get efficient exact implementation algorithms. Specifically, we propose an algorithm that exactly implements the absMAC layer. The algorithm provides asymptotically optimal bounds fur both acknowledgement and progress functions defined in the absMAC layer. Our algorithm can lead to many new faster algorithms for solving high-level problems in the SINR model. We demonstrate this by giving algorithms for problems of Consensus, Multi-Message Broadcast and Single-Message Broadcast. It deserves to point out that our implementation algorithm is designed based on an optimal algorithm for a General Local Broadcast (GLB) problem, which takes the number of distinct messages into consideration for the first time. The GLB algorithm can handle much more communication scenarios apart from those defined in the absMAC layer. Simulation results show that our proposed algorithms perform well in reality.

关键词： Interference Signal to noise ratio Sensors Delays Wireless sensor networks distributed algorithms Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

FLiMS: Fast Lightweight Merge Sorter 17

FLiMS: Fast Lightweight Merge Sorter

引用

17th International Conference on Field-Programmable Technology (FPT)

作者： Papaphilippou, Philippos Brooks, Chris Luk, Wayne Imperial Coll London Dept Comp London England Dunnhumby Sci Innovat London England

ISBN: (纸本)9781728102139

We have developed a highly-efficient and simple parallel hardware design for merging two sorted lists residing in banked (or multi-ported) memory. The FPGA implementation uses half the hardware resources required for implementing the current state-of-the-art architecture. This is achieved with better performance and half the latency, for the same amount of parallelism. The challenges for the merge operations in FPGAs have been the low clock frequency due to the feedback datapath of the merger being the critical path for timing, and also the high resource utilisation in recent attempts to eliminate/remove the feedback datapath. Our solution uses a modified version of the bitonic merge block, as found in a bitonic sorter, repurposed for performing parallel merge for streaming data. As with the state-of-the-art, it can be considered feedback-less since it only nests one parallel comparison for any desired level of parallelism. This leads to high operating frequency designs, 1.3 times higher than the previous best on our test platform. Since the new design uses 2 times fewer hardware resources, it allows more parallelism and leaves room for additional logic.

关键词： bitonic merge bitonic sort merge join parallel FPGA databases operators distributed algorithms Zynq SIMD

来源：评论

学校读者我要写书评

暂无评论

Cooperative Guidance Law with Multiple Missiles Against a Maneuvering Target

Cooperative Guidance Law with Multiple Missiles Against a Ma...

引用

Chinese Automation Congress (CAC)

作者： Cheng, Haoyu Fang, Yangwang Ouyang, Chuyue Huang, Hanqiao Fu, Wenxing Northwestern Polytech Univ Sch Astronaut Xian 710072 Shaanxi Peoples R China Northwestern Polytech Univ Unmanned Syst Res Inst Xian 710072 Shaanxi Peoples R China

ISBN: (纸本)9781728113128

The problem of simultaneous attack of multiple missiles against a maneuvering target is considered in this paper. In order to improve the operational effectiveness and reduce the communication burden, it is supposed that the missile can communicate with its neighbors. Consider the unknown maneuverability of the target, the cooperative is composed of two components, one is used for time coordination and the other is used for target capture. The uncertain maneuverability of the target is estimated by the aid of extended state observer and compensated in the distributed algorithms. In the end, a numerical example is given to illustrated the effectiveness and superiorities of the proposed method.

关键词： Cooperative Guidance distributed algorithms Simultaneous Attack Extended State Observer Uncertain Maneuverability

来源：评论

学校读者我要写书评

暂无评论

Scalable k-Means Clustering via Lightweight Coresets 18

Scalable <i>k</i>-Means Clustering via Lightweight Coresets

引用

24th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)

作者： Bachem, Olivier Lucic, Mario Krause, Andreas Swiss Fed Inst Technol Zurich Switzerland Google Brain Mountain View CA 94043 USA

ISBN: (纸本)9781450355520

Coresets are compact representations of data sets such that models trained on a coreset are provably competitive with models trained on the full data set. As such, they have been successfully used to scale up clustering models to massive data sets. While existing approaches generally only allow for multiplicative approximation errors, we propose a novel notion of lightweight coresets that allows for both multiplicative and additive errors. We provide a single algorithm to construct lightweight coresets for k-means clustering as well as soft and hard Bregman clustering. The algorithm is substantially faster than existing constructions, embarrassingly parallel, and the resulting coresets are smaller. We further show that the proposed approach naturally generalizes to statistical k-means clustering and that, compared to existing results, it can be used to compute smaller summaries for empirical risk minimization. In extensive experiments, we demonstrate that the proposed algorithm outperforms existing data summarization strategies in practice.

关键词： clustering coresets big data distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-layer Decomposition of Optimal Resource Sharing Problems 57

Multi-layer Decomposition of Optimal Resource Sharing Proble...

引用

57th IEEE Conference on Decision and Control (CDC)

作者： Karakoc, Nurullah Scaglione, Anna Nedic, Angelia Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85281 USA

ISBN: (纸本)9781538613955

We describe a distributed framework for resource sharing problems that we face in communications, microeconomics and various networking applications. In particular, we consider a hierarchical multi-layer decomposition for network utility maximization (NUM), where functionalities are assigned to different layers. The proposed methodology creates solutions having central management and distributed computations. The technique aims to respond to the dynamics of the network by decreasing the communication cost, while shifting more computational load to the edges of the network. The main contribution of this work is the provision of a detailed analysis under the assumption that the network changes are in the same time-scale with the convergence time of the algorithms used for local computations. For this scenario, assuming strong concavity and smoothness of the users' objective functions, we present convergence rates for each layer.

关键词： Convergence Resource management Optimization distributed algorithms Indexes Delays Economics

来源：评论

学校读者我要写书评

暂无评论

Streaming and Batch algorithms for Truss Decomposition

Streaming and Batch Algorithms for Truss Decomposition

引用

First International Conference on Graph Computing (GC)

作者： Venkata Rohit Jakkula George Karypis University of Minnesota - Twin Cities Minneapolis Minnesota

ISBN: (数字)9781728141299

ISBN: (纸本)9781728152080

Truss decomposition is a method used to analyze large sparse graphs in order to identify successively better connected subgraphs. Since in many domains the underlying graph changes over time, its associated truss decomposition needs to be updated as well. This work focuses on the problem of incrementally updating an existing truss decomposition and makes the following three significant contributions. First, it presents a theory that identifies how the truss decomposition can change as new edges get added. Second, it develops an efficient incremental algorithm that incorporates various optimizations to update the truss decomposition after every edge addition. These optimizations are designed to reduce the number of edges that are explored by the algorithm. Third, it extends this algorithm to batch updates (i.e., where the truss decomposition needs to be updated after a set of edges are added), which reduces the overall computations that need to be performed. We evaluated the performance of our algorithms on real-world datasets. Our incremental algorithm achieves over 250000x average speedup for inserting an edge in a graph with 10 million edges relative to the non-incremental algorithm. Further, our experiments on batch updates show that our batch algorithm consistently performs better than the incremental algorithm.

关键词： Image edge detection Social network services Urban areas Optimization Proteins Parallel algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 167 168 169 170 171 172 173 174 175 176 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：