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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Using 1D radar observations to detect a space explosion core among the explosion fragments: sequential and distributed algorithms

Using 1D radar observations to detect a space explosion core...

引用

IEEE Digital Signal Processing Workshop

作者： P. Debroux J. Boehm F. Modave V. Kreinovich G. Xiang J. Beck K. Tupelly R. Kandathi L. Longpre K. Villaverde SLAD Army Research Laboratory USA Department of Computer Science University of Texas El Paso El Paso TX USA Computer Science New Mexico State University Las Cruces NM USA

A radar observes the result of a space explosion. Due to the radar's low horizontal resolution, we get a 1D signal, x(t), representing different 2D slices. Based on these slices, we must distinguish between the body at the core of the explosion and the slowly out-moving fragments. We propose new algorithms for processing this 1D data. Since these algorithms are time-consuming, we also exploit the possibility of parallelizing these algorithms.

关键词： Explosions Spaceborne radar Radar detection distributed algorithms Computer science Space exploration Image processing Radar imaging Laboratories Signal resolution

来源：评论

学校读者我要写书评

暂无评论

Alternative decompositions and distributed algorithms for network utility maximization

Alternative decompositions and distributed algorithms for ne...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： D.P. Palomar Mung Chiang Electrical Engineering Department Princeton University NJ USA

Network utility maximization problems provide an important approach to conduct network resource management such as power and rate allocation. In the existing literature, distributed implementations are typically achieved by the means of the so-called dual decomposition technique. However, the span of decomposition possibilities includes many other elements which thus far have not been fully exploited, such as the use of the primal decomposition technique, the versatile introduction of auxiliary variables, and the potential of multilevel decompositions. This paper presents in a systematic way how to apply these decomposition techniques to network utility maximization problems. The presentation is based on a general network optimization model that unifies existing works, and then is particularized to two concrete examples of recent interest: generalized water-filling algorithms and wireless cellular downlink power control. We can thus obtain a variety of distributed algorithms with different characteristics to suit the needs of specific applications. Both primal and dual decomposition techniques are considered at many different hierarchy levels, leading to a range of choices of hybrid, multi-level, primal/dual decomposition schemes. Each particular combination provides a different distributed algorithm for resource allocation. The choice of decomposition method and distributed algorithm for a particular problem depends on factors such as the amount of signalling required for proper coordination, asymmetry of computational load, and speed of convergence

关键词： distributed algorithms Utility programs Resource management Power system modeling Concrete Cellular networks Downlink Power control distributed computing Convergence

来源：评论

学校读者我要写书评

暂无评论

Proof techniques for distributed algorithms for deadlock handling

Proof techniques for distributed algorithms for deadlock han...

引用

IEEE Southeastcon

作者： A.T. Amin M.P. Freeman Computer Science Department University of Alabama Huntsville Huntsville AL USA

The authors consider deadlock handling in distributed systems in which processes may reside at different sites interconnected by a communication network. In particular attention is given to distributed deadlock handling in which no site has the knowledge of the global state of process dependencies. A review of two distributed algorithms for deadlock handling is presented with emphasis on the proof technique. It is shown that the distributed algorithms for deadlock detection can be classified based on the technique used for dissemination of dependency information, namely, top-down or bottom-up. The algorithms when presented without details of implementation mechanisms permit proofs of correctness which are simpler.< >

关键词： distributed algorithms System recovery Resource management Communication networks Computer errors Computer science Error correction Computer networks distributed computing Terminology

来源：评论

学校读者我要写书评

暂无评论

LP-relaxation based distributed algorithms for Scheduling in Wireless Networks

LP-relaxation based Distributed Algorithms for Scheduling in...

引用

IEEE International Conference on Computer Communications

作者： Chandramani Singh Angelia Nedic R. Srikant Coordinated Science Lab University of Illinois at Urbana-Champaign Urbana IL 61801 USA

ISBN: (纸本)9781479933617

LP relaxations of Maximum Weighted Independent Set (MWIS) problems have been widely studied. A key motivation for this prior work comes from the central role that MWIS plays in designing throughput-optimal algorithms for wireless networks. However, to the best of our knowledge, the actual packet delay performance of these algorithms has not been studied in the context of wireless networks. In this paper, we first present an algorithm for solving the LP relaxation of MWIS which exhibits faster convergence to an optimal solution. Further, we show that one does not have to wait for infinite time for convergence to occur, but a simple rounding technique can be used to identify the ON/OFF states of the wireless links in finite time. As in prior work, such an approach only identifies the optimal MWIS states of some of the links in the network. Therefore, we present a scheme to combine this solution with Q-CSMA. Simulations indicate that the proposed scheme significantly improves the performance of Q-CSMA. Further, the proposed algorithm is shown to perform much better than previously suggested LP relaxation schemes due to its superior convergence properties.

关键词： Wireless networks distributed algorithms algorithms Converge network links Scheme Relaxation

来源：评论

学校读者我要写书评

暂无评论

Lifetime and Full-View Coverage Guarantees Through distributed algorithms in Camera Sensor Networks

Lifetime and Full-View Coverage Guarantees Through Distribut...

引用

IEEE International Symposium on Parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Chaoyang Li Anu G. Bourgeois Department of Computer Science Georgia State University Atlanta GA

When a vast number of camera sensors are randomly placed in a target field, how can we produce a sleep/activate schedule for camera sensors to maximize the lifetime of target coverage in the target field? This well-known problem is called Maximum Lifetime Coverage Problem (MLCP), which has been explored extensively in the literature. However, MLCP in full-view coverage camera sesnor networks are far more complicated since each target should be full-view covered by a group of camera sensors instead of a single sensor as in conventional scenarios. In this paper we address the full-view covered target problem, with the objective of maximizing the lifetime of a power constrained camera sensor network deployed for full-view coverage of targets with known location. We consider that a large number of camera sensors are placed randomly in close proximity of targets and each camera sensor sends the collected data to a base station. We define the camera sensor network lifetime as the time interval the targets are full-view covered by a camera sensor cover. Our contributions include: (1) an efficient data structure to represent a family of camera sensor cover, each of which full-view cover all targets with consideration of the lifetime of each camera sensor; (2) an energy efficient monitoring scheme where only the camera sensors from the current active set are responsible for monitoring all targets and for transmitting the collected data, while all other camera sensors are in a low-energy sleep mode; (3) formulating the maximizing camera sensor network lifetime problem into a packing linear programming problem, where a modified Garg-Konemann Algorithm to find the near optimal solution is applied.

关键词： Cameras Monitoring distributed algorithms Data structures Target recognition Thermal sensors

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity distributed algorithms for Spectrum Balancing in Multi-User DSL Networks

Low-Complexity Distributed Algorithms for Spectrum Balancing...

引用

IEEE International Conference on Communications (ICC)

作者： John Papandriopoulos Jamie S. Evans ARC Special Research Centre for Ultra-Broadband Information Networks (CUBIN) Department of Electrical and Electronic Engineering University of Melbourne VIC Australia

Dynamic Spectrum Management of Digital Subscriber Lines (DSL) has the potential to dramatically increase the capacity of the aging last-mile copper access network. This paper takes an important step toward fulfilling this potential through power spectrum balancing. We derive a novel algorithm called SCALE, that provides a significant performance improvement over the existing iterative water-filling (IWF) algorithm in multi-user DSL networks, doing so with comparable low complexity. The algorithm is easily distributed through measurement and limited message-passing with the use of a Spectrum Management Center. We outline how overhead can be managed, and show that in the limit of zero message-passing, performance reduces to IWF. Numerical convergence of SCALE was found to be extremely fast when applied to VDSL, with performance exceeding that of iterative water-filling in just a few iterations, and to over 90% of the final rate in under 5 iterations. Lastly, we return to the problem of iterative water-filling and derive a new algorithm named SCAWF that is shown to be a very simple way to waterfill, particularly suited to the multi-user context.

关键词： distributed algorithms DSL Radio spectrum management Iterative algorithms Copper Bandwidth Optical fiber networks Optical transmitters Optical fiber cables Aging

来源：评论

学校读者我要写书评

暂无评论

How to implement doubly-stochastic matrices for consensus-based distributed algorithms

How to implement doubly-stochastic matrices for consensus-ba...

引用

Sensor Array and Multichannel Signal Processing Workshop

作者： Sergio Valcarcel Macua Carlos Moreno Leon Jhoan Samuel Romero Silvana Silva Pereira Javier Zazo Alba Pagès-Zamora Roberto López-Valcarce Santiago Zazo Escuela Técnica Superior de Ingenieros de Telecomunicación Universidad Politécnica de Madrid Spain SPCOM Group Universitat Politécnica de Catalunya-Barcelona Tech Spain GPSC Universidade de Vigo Spain

Doubly-stochastic matrices are usually required by consensus-based distributed algorithms. We propose a simple and efficient protocol and present some guidelines for implementing doubly-stochastic combination matrices even in noisy, asynchronous and changing topology scenarios. The proposed ideas are validated with the deployment of a wireless sensor network, in which nodes run a distributed algorithm for robust estimation in the presence of nodes with faulty sensors.

关键词： Signal processing algorithms Topology distributed algorithms Robustness Estimation Protocols Network topology

来源：评论

学校读者我要写书评

暂无评论

Verifying fault tolerance of distributed algorithms formally-an example

Verifying fault tolerance of distributed algorithms formally...

引用

International Conference on Application of Concurrency to System Design

作者： H. Volzer Institut für Informatik Humboldt University of Berlin Berlin Germany

It is shown how fault-tolerant distributed algorithms can be formally verified using the Petri net based verification framework DAWN. A complete example study, the verification of a distributed self diagnosis algorith... 详细信息

关键词： Fault tolerance distributed algorithms Algorithm design and analysis Formal verification Fault tolerant systems Logic Protocols Computer crashes

来源：评论

学校读者我要写书评

暂无评论

Lightweight and distributed algorithms for Efficient Data-Centric Storage in Sensor Networks

Lightweight and Distributed Algorithms for Efficient Data-Ce...

引用

International Conference on Mobile and Ubiquitous Systems: Networking and Services (MobiQuitous)

作者： Ghazi Al Sukkar Hossam Afifi Sidi-Mohammed Senouci Institut National des Telecommunications Evry France France Telecom Research and Development Center Lannion France

In this paper we propose two algorithms for efficient data-centric storage in wireless sensor networks without the support of any location information system. These algorithms are intended to be applied in environments with large number of sensors where the scalability of the network has great issue. During the first algorithm, each sensor obtains a unique temporary address according to its current relative location in the network. The second algorithm is used to route data from one sensor to another, this routing algorithm only depends on the sensor's neighborhood, i.e. in order to implement the routing table each sensor needs only to exchange local information with its first hop neighbors. The forwarding process used in this algorithm resembles the one found in Pastry peer-to-peer protocol.

关键词： distributed algorithms Base stations Peer to peer computing Wireless sensor networks Routing Monitoring Energy storage Event detection Information retrieval Sensor systems

来源：评论

学校读者我要写书评

暂无评论

NETMAN: an object-oriented environment for experimenting distributed algorithms on a network of workstations 98

NETMAN: an object-oriented environment for experimenting dis...

引用

International Symposium on High Performance distributed Computing

作者： K. Naik Y. Tahara Z. Cheng Department of Computer Software University of Aizu Fukushima Japan

ISBN: (纸本)9780818685798

We present the object oriented design of a software system called NETMAN to experiment distributed algorithms on a large network of workstations. The design has been structured into three layers and a central monitoring site. We have implemented the system in Java. Two asynchronous communication primitives, SEND and RECEIVE, have been implemented using Java's remote method invocation mechanism. As an example, we executed a distributed mutual exclusion algorithm on a network of 60 workstations, and measured its performance under various scenarios.

关键词： distributed algorithms Algorithm design and analysis Workstations Computer networks distributed computing Java Object oriented modeling Delay Monitoring Software design

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：