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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

ABC-Center: Approximate-center election in modular robots

ABC-Center: Approximate-center election in modular robots

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： A. Naz B. Piranda S. C. Goldstein J. Bourgeois Universite de Franche-Comte FEMTO-ST Institute Montbeliard School of Computer Science Carnegie Mellon University Pittsburgh PA USA

Modular robots are composed of many independent connected modules which are able to achieve common goals through communications. Many distributed algorithms have better performance if the modules that have to communicate with all the others, are placed at the center of the system. In this paper, we propose ABC-Center, an iterative algorithm for electing an approximate-center module in modular robots. ABC-Center uses O(1) space per module and O(kd) time, where k is the number of iterations required to terminate and d the diameter of the system. We evaluated our algorithm both on hardware modular robots and in a simulator for large ensemble of robots. The average expected eccentricity of the module elected by ABC-Center is less than 1.25 blocks off for random systems composed of up to 1000 modules. Furthermore, experiments show that our algorithm terminates after a few iterations. Hence, ABC-Center is scalable and adapted to modular robots with low memory resources.

关键词： Nominations and elections Robot kinematics Bismuth distributed algorithms Approximation algorithms Robot sensing systems

来源：评论

学校读者我要写书评

暂无评论

Joint Beamforming and Power Control for Optimal SIR Assignment in Cellular Uplinks

Joint Beamforming and Power Control for Optimal SIR Assignme...

引用

IEEE International Symposium on Information Theory

作者： Tian Lan Prashanth Hande Mung Chiang Department of Electrical Engineering Princeton University NJ USA Qualcomm Flarion Technologies NJ USA

ISBN: (纸本)9781424413973;1424413974

This paper considers the nonconvex and globally coupled problem of joint antenna beamforming and transmit power control, in order to maximize the network-wide utility as a function of attained SIRs. Using a spillage-load characterization for power control [13], we assign utility as a function of attained SIRs and formulate the joint optimization as a utility maximization problem. Despite the highly coupled structure of the problem, we propose an efficient distributed algorithm that is proved to be convergent in general. Despite nonconvexity in the joint optimization, we prove global optimality in the two user case. We find in simulations the algorithm always converges to the global optimal allocation, and the Pareto-optimal tradeoff between power and antenna beamforming in maximizing network utility is illustrated.

关键词： Array signal processing Power control Iterative algorithms Optical coupling Utility programs Downlink Mobile antennas Transmitting antennas Functional programming distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Markov Approximation for Combinatorial Network Optimization

Markov Approximation for Combinatorial Network Optimization

引用

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

作者： Minghua Chen Soung Chang Liew Ziyu Shao Caihong Kai Department of Information Engineering Chinese University of Hong Kong Hong Kong China

ISBN: (纸本)9781424458363

Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distributed algorithms. The Markov approximation framework studied in this paper is a general technique for synthesizing distributed algorithms. We show that when using the log-sum-exp function to approximate the optimal value of any combinatorial problem, we end up with a solution that can be interpreted as the stationary probability distribution of a class of time- reversible Markov chains. Certain carefully designed Markov chains among this class yield distributed algorithms that solve the log-sum-exp approximated combinatorial network optimization problem. By three case studies, we illustrate that Markov approximation technique not only can provide fresh perspective to existing distributed solutions, but also can help us generate new distributed algorithms in various domains with provable performance. We believe the Markov approximation framework will find applications in many network optimization problems, and this paper serves as a call for participation.

关键词： Entropy distributed algorithms Multiaccess communication Design optimization Algorithm design and analysis Throughput Communications Society Design engineering Network synthesis Probability distribution

来源：评论

学校读者我要写书评

暂无评论

Generalized multicircumcenter trajectories for optimal design under near-independence

Generalized multicircumcenter trajectories for optimal desig...

引用

2010 49th IEEE Conference on Decision and Control

作者： Rishi Graham Jorge Cortes Department of Applied Mathematics and Statistics University of California Santa Cruz Department of Mechanical and Aerospace Engineering University of California San Diego

ISBN: (纸本)9781424477456

This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of network trajectories the maximum predictive variance of the estimator. This is a high-dimensional, multi-modal, nonsmooth optimization problem, known to be NP-hard even for static fields and discrete design spaces. Under an asymptotic regime of near-independence between distinct sample locations, we show that the solutions to a novel generalized disk-covering problem are solutions to the optimal sampling problem. This result transforms the search for the optimal trajectories into a geometric optimization problem. Constrained versions of the latter are also of interest as they can accommodate trajectories that satisfy a maximum velocity restriction on the robots. We characterize the solution for the unconstrained and constrained versions of the problem as generalized multicircumcenter trajectories, and provide distributed algorithms to find them.

关键词： trajectory Optimal design static field trajectory optimization distributed algorithms Robot Nondeterministic polynomial-time hard

来源：评论

学校读者我要写书评

暂无评论

An Effective Spanning Tree Algorithm for a Bridged LAN

An Effective Spanning Tree Algorithm for a Bridged LAN

引用

International Workshop on Advanced Communications and Applications for High Speed Networks

作者： Nen-Fu Huang Yin-Chish Cheng Department of Computer Science National Tsing Hua University Hsinchu Taiwan

来源：评论

学校读者我要写书评

暂无评论

Certificate Chain Discovery in Web of Trust for Ad Hoc Networks

Certificate Chain Discovery in Web of Trust for Ad Hoc Netwo...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Hisashi Mohri Ikuya Yasuda Yoshiaki Takata Hiroyuki Seki Graduate School of Information Science Nara Institute of Science and Technology Ikoma Nara Japan

In an ad hoc network, we cannot assume a trusted certificate authority and a centralized repository that are used in ordinary public-key infrastructure (PKI). Hence a PKI system of the Web-of-trust type in which each node can issue certificates to others in a self-organizing manner has been studied. Although this system is useful for ad hoc networks whose topology can change, it has the problem that for authentication a node needs to find a certificate-chain to the destination node. In this paper, we formally model a web-of-trust-type PKI system, define the certificate-chain discovery problem, and propose a new distributed algorithm and its modifications that solve the problem. Furthermore, we propose a measure of communication cost, and according to the measure, we compare our algorithm with an existing method.

关键词： Ad hoc networks Public key Authentication Information science Network topology distributed algorithms Costs Wireless networks Communication system security Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Optimizing Application Performance through Learning and Cooperation in a Wireless Sensor Network

Optimizing Application Performance through Learning and Coop...

引用

MILCOM, Military Communications Conference

作者： Wai-Leong Yeow Chen-Khong Tham Wai-Choong Wong NUS Graduate School of Integrative Sciences & Engineering National University of Singapore Singapore

A wireless sensor network performing surveillance in time-critical missions involving event or target tracking demands accurate ground information be delivered within a delay guarantee. Present methods solve this by using in-network fusion across all packets to reduce network load in the hope of achieving the delay guarantee. In this paper, we aim to maximize data quality from sensor fusion, while still respecting delay guarantees. The proposed method makes admission control and routing decisions using a fully distributed algorithm based on constrained Markov Decision Processes (MDPs). Cooperation is enforced through well-defined rewards and leading nodes. Assessment of data quality is derived from likelihood ratio, which is a commonly used metric in sensor fusion. We study the performance of the proposed algorithm through extensive simulations, and show that it can achieve soft delay guarantees and good data quality compared to other schemes.

关键词： Wireless sensor networks Delay Admission control Routing Sensor fusion Time factors distributed algorithms Application software Computer networks Surveillance

来源：评论

学校读者我要写书评

暂无评论

The life and times of a zookeeper 09

The life and times of a zookeeper

引用

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

作者： Flavio P. Junqueira Benjamin C. Reed Yahoo! Research Barcelona Spain Spain Yahoo! Research Santa Clara CA USA

ISBN: (纸本)9781605586069

A distributed application may comprise a range of processors, from two to thousands. For the processors of an application comprising many different machines to work together, they must often coordinate. Coordination may be as simple as agreeing upon a basic configuration, e.g., a list of server addresses and ports for example. In the context of distributed systems, even agreeing upon a basic configuration can be complicated: servers may be down during configuration changes, servers may need to adapt quickly to dynamic configuration changes, and during changes servers may have conflicting configurations. Most distributed applications also require more sophisticated coordination primitives such as leader election, group membership, and *** Yahoo!, we noticed that many distributed applications were re-implementing coordination primitives in their distributed applications. In theory, this is completely reasonable: coordination protocols are well known, and usually the coordination logic is intermingled with the application logic. In practice, the story is much different; these protocols have sometimes subtle requirements that can easily be overlooked when implementing them. Further, an application developer is usually much more interested in working on application logic than the coordination protocol that the logic depends on. We found many cases of applications whose coordination primitives were buggy, a single point of failure, poorly performing, or oversimplified; in some cases the applications suffered from all of the *** started ZooKeeper as a system that could address all these problems in a general way so that all of our applications could use it for coordination and application developers could focus on developing their applications. By providing a general system that all applications could use, we could devote the time to making it robust, fault-tolerant, and with good enough performance to be used extensively by applications. We also needed to b

关键词： fault-tolerance atomic broadcast distributed algorithms replication coordination

来源：评论

学校读者我要写书评

暂无评论

A Message-Passing Algorithm for Spectrum Access in Cognitive Radio Relay Networks

A Message-Passing Algorithm for Spectrum Access in Cognitive...

引用

Asilomar Conference on Signals, Systems and Computers

作者： Sang Hyun Lee Manohar Shamaiah Sriram Vishwanath Haris Vikalo Dept. of Electr. & Comput. Eng. Univ. of Texas at Austin Austin TX USA

ISBN: (纸本)9781467303217

This work addresses the spectrum access problem in cognitive radio relay networks. In our setup, primary users allow secondary users access to the channel (spectrum) as long as they agree to relay primary users' data in addition to their own. We desire to maximize the network usage by determining the best configuration of matching between primary users and secondary users. This problem can be formulated in a form similar to maximum weighted matching. Given this formulation, we develop an algorithm for this problem using affinity propagation that is fully distributed. We test its performance and demonstrate convergence.

关键词： Relays Message passing Cognitive radio Optimization distributed algorithms Clustering algorithms Radio transmitters

来源：评论

学校读者我要写书评

暂无评论

Maintaining Coverage by Progressive Crystal-Lattice Permutation in Mobile Wireless Sensor Networks

Maintaining Coverage by Progressive Crystal-Lattice Permutat...

引用

International Conference on Systems and Networks Communications (ICSNC)

作者： Pang-chieh Wang Ting-wei Hou Ruei-hong Yan Department of Engineering Science National Cheng Kung University Tainan Taiwan

A new distributed algorithm, called Crystal-Lattice Permutation (CLP) algorithm, is devised to approach the coverage problem in wireless sensor networks. All nodes are assumed as mobile and run the same CLP algorithm in . An initial seed triggers six neighboring nodes to move to hexagon permutation positions, which is like the Crystal-Lattice formation process in nature. These chosen nodes then become new seeds to trigger other neighboring nodes. By such a progressive process, with initial and boundary conditions, the coverage is achieved. Comparing to the Virtual Force algorithm (VFA), the CLP algorithm needs fewer nodes and takes shorter average moving distance to achieve 100% coverage in random deployment. In simulation, the CLP algorithm deployed at least 60 nodes to achieve the 100% coverage, while the VFA algorithm required more than 100 nodes, under the same assumptions. The average moving distance for each CLP node was less than a half of the VFA node. In addition, as there are n mobile nodes, the number of CLP messages is proportional to n, while VFA is proportional to n2. The CLP algorithm is robust in fault tolerance when some nodes are error in distribution.

关键词： Wireless sensor networks Energy consumption Maintenance engineering Cities and towns distributed algorithms Fault tolerance Monitoring Surveillance Temperature sensors Boundary conditions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 485 486 487 488 489 490 491 492 493 494 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：