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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

63 篇 期刊文献
30 篇 会议
2 篇 学位论文

馆藏范围

95 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

85 篇 工学
- 51 篇 计算机科学与技术...
- 47 篇 电气工程
- 25 篇 信息与通信工程
- 19 篇 控制科学与工程
- 9 篇 软件工程
- 5 篇 电子科学与技术（可...
- 2 篇 测绘科学与技术
- 2 篇 交通运输工程
- 1 篇 机械工程
- 1 篇 航空宇航科学与技...
11 篇 理学
- 7 篇 数学
- 4 篇 物理学
- 1 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
5 篇 医学
- 5 篇 临床医学
4 篇 管理学
- 4 篇 管理科学与工程(可...

主题

95 篇 decentralized al...
8 篇 game theory
6 篇 stochastic optim...
5 篇 directed graphs
5 篇 multi-agent syst...
4 篇 resource managem...
4 篇 convergence
4 篇 optimization
4 篇 multi-robot syst...
4 篇 distributed syst...
4 篇 resource allocat...
4 篇 femtocell
4 篇 first-order meth...
4 篇 heuristic algori...
3 篇 reinforcement le...
3 篇 compressed sensi...
3 篇 computation offl...
3 篇 variance reducti...
3 篇 signal processin...
3 篇 collision avoida...

机构

2 篇 purdue univ sch ...
2 篇 mit dept mech en...
2 篇 tufts univ dept ...
2 篇 kth royal inst t...
2 篇 tufts univ medfo...
2 篇 tufts univ dept ...
2 篇 indian inst sci ...
2 篇 carnegie mellon ...
2 篇 syracuse univ de...
2 篇 carnegie mellon ...
2 篇 univ politecn ca...
2 篇 univ roma la sap...
1 篇 columbia univers...
1 篇 univ patras dept...
1 篇 renault sas
1 篇 cnrs lri iasi in...
1 篇 iit madras dept ...
1 篇 mit lincoln lab ...
1 篇 univ texas austi...
1 篇 department of st...

作者

5 篇 xin ran
5 篇 kar soummya
5 篇 khan usman a.
3 篇 sankar v. udaya
3 篇 sharma vinod
3 篇 dan gyorgy
3 篇 josilo sladana
3 篇 yuan sm
2 篇 takeuchi keigo
2 篇 oriolo giuseppe
2 篇 vendittelli mari...
2 篇 franchi antonio
2 篇 foo brian
2 篇 qureshi muhammad...
2 篇 perez-romero j.
2 篇 giupponi l.
2 篇 van der schaar m...
2 篇 freda luigi
2 篇 sallent o.
2 篇 scutari gesualdo

语言

94 篇 英文
1 篇 中文

检索条件"主题词=Decentralized Algorithms"

共 95 条记录，以下是61-70 订阅

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

详细简洁

排序：

Detecting Change in Snapshot Sequences

Detecting Change in Snapshot Sequences

引用

6th International Conference, GIScience 2010

作者： Shi, Mingzheng Winter, Stephan Univ Melbourne Dept Geomat Melbourne Vic 3010 Australia

ISBN: (纸本)9783642152993

Wireless sensor networks are deployed to monitor dynamic geographic phenomena, or objects, over space and time. This paper presents a new spatiotemporal data model for dynamic areal objects in sensor networks. Our model supports for the first time the analysis of change in sequences of snapshots that are captured by different granularity of observations, and our model allows both incremental and non-incremental changes. This paper focuses on detecting qualitative spatial changes, such as merge and split of areal objects. A decentralized algorithm is developed, such that spatial changes can be efficiently detected by in-network aggregation of decentralized datasets.

关键词： wireless sensor networks spatiotemporal data models decentralized algorithms qualitative spatial changes

来源：评论

学校读者我要写书评

暂无评论

decentralized beamforming for weighted sum energy efficiency maximization in MIMO systems

Decentralized beamforming for weighted sum energy efficiency...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Han, Fengxia Zhao, Shengjie Zhang, Lu Yang, Kai Shen, Jie Tongji Univ Sch Elect & Engn Shanghai Peoples R China Nokia China Off 5G Beijing Peoples R China

ISBN: (纸本)9781509050192

This paper considers a joint transceiver design for the weighed sum energy efficiency maximization problem for downlink transmissions in a multi-cell multi-user multiple-input multiple-output (MIMO) system. To make the formulated problem be more valuable in practice, a more practical power consumption model is adopted in which part of the processing power is dependent on data rate. With per-user rate requirements and per-base station (BS) power constraints, the resulting optimization problem is non-convex. A centralized solution is firstly proposed, which alternatively performs transmit beamforming optimization and receive beamforming optimization with the help of successive convex approximation (SCA) based iteration. Based on the centralized design that requires global channel state information (CSI), a more meaningful decentralized algorithm is further designed, which solves the problem with the requirement of only exchanging quite a small amount of information among BSs. Specifically, the key methodology used in the decentralized algorithm is to reformulate transmit beamforming optimization as an equivalent global consensus problem when receive beamforming is fixed as minimum mean square error (MMSE) receiver, which is solved effectively by exploiting the alternative direction method of multipliers (ADMM) technique. Numerical results demonstrate the effectiveness and superiority of our proposed algorithms, and also illustrate the impact of the rate-dependent power consumption on the energy efficiency.

关键词： Coordinated beamforming weighted sum energy efficiency maximization joint transceiver design centralized solution decentralized algorithms SCA MMSE ADMM

来源：评论

学校读者我要写书评

暂无评论

Connectivity Recovery in Epidemic Membership Protocols 8th

Connectivity Recovery in Epidemic Membership Protocols

引用

8th Annual International Conference on Internet and Distributed Computing Systems (IDCS)

作者： Poonpakdee, Pasu Di Fatta, Giuseppe Univ Reading Sch Syst Engn Reading RG6 6AY Berks England

ISBN: (纸本)9783319232379;9783319232362

Epidemic protocols are a bio-inspired communication and computation paradigm for extreme-scale network system based on randomized communication. The protocols rely on a membership service to build decentralized and random overlay topologies. In a weakly connected overlay topology, a naive mechanism of membership protocols can break the connectivity, thus impairing the accuracy of the application. This work investigates the factors in membership protocols that cause the loss of global connectivity and introduces the first topology connectivity recovery mechanism. The mechanism is integrated into the Expander Membership Protocol, which is then evaluated against other membership protocols. The analysis shows that the proposed connectivity recovery mechanism is effective in preserving topology connectivity and also helps to improve the application performance in terms of convergence speed.

关键词： Topology connectivity Expander graphs Epidemic protocols Extreme-scale computing decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

Scalable Cluster-Consistency Statistics for Robust Multi-Object Matching 9

Scalable Cluster-Consistency Statistics for Robust Multi-Obj...

引用

9th International Conference on 3D Vision (3DV)

作者： Shi, Yunpeng Li, Shaohan Maunu, Tyler Lerman, Gilad Princeton Univ Program Appl & Computat Math Princeton NJ 08544 USA Univ Minnesota Sch Math Minneapolis MN 55455 USA Brandeis Univ Dept Math Waltham MA 02254 USA

ISBN: (纸本)9781665426886

We develop new statistics for robustly filtering corrupted keypoint matches in the structure from motion pipeline. The statistics are based on consistency constraints that arise within the clustered structure of the graph of keypoint matches. The statistics are designed to give smaller values to corrupted matches and than uncorrupted matches. These new statistics are combined with an iterative reweighting scheme to filter keypoints, which can then be fed into any standard structure from motion pipeline. This filtering method can be efficiently implemented and scaled to massive datasets as it only requires sparse matrix multiplication. We demonstrate the efficacy of this method on synthetic and real structure from motion datasets and show that it achieves state-of-the-art accuracy and speed in these tasks.

关键词： decentralized algorithms image matching multi-object matching partial permutation synchronization robust statistics structure from motion

来源：评论

学校读者我要写书评

暂无评论

Considerations on Distributed Load Balancing for Fully Heterogeneous Machines: Two Particular Cases 29

Considerations on Distributed Load Balancing for Fully Heter...

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Cheriere, Nathanael Saule, Erik ENS Rennes Dept Comp Sci Rennes France Univ North Carolina Charlotte Dept Comp Sci Charlotte NC USA

ISBN: (纸本)9781467376846

When the size of parallel systems increases, centralized algorithms to schedule tasks on the system can induce a significant overhead. This is why decentralized scheduling algorithms have been developed. The most popular one certainly is work-stealing because of its interesting theoretical guarantees. Parallel systems have evolved from homogeneous clusters to fully heterogeneous ones such as GPU-accelerated clusters. We investigate in this paper decentralized scheduling algorithms for heterogeneous systems. The guarantees of work-stealing algorithms no longer hold on such systems because it is an a posteriori algorithm which highly depends on the initial distribution of work. We focus on a priori decentralized scheduling algorithms for heterogeneous systems and we propose two distributed algorithms to balance the load on unrelated machines for two particular cases. The first one exploits a low heterogeneity in the task set and reaches an approximation ratio linear in the number of types of tasks. The second one focuses on the case where the system only uses two different types of machines and we show it is a 2-approximation if the system converges. In the case it does not converge, we study the dynamic equilibrium of the system. In the homogeneous case, we numerically compute the probability density function of the load imbalance and show that the imbalance is low on average. And we show using simulation that the heterogeneous case is similar to the homogeneous case and that the imbalance is low in both cases.

关键词： Unrelated Machine Scheduling Load-Balancing decentralized algorithms Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A decentralized Interference Coordination Method for OFDMA Femtocell Networks

A Decentralized Interference Coordination Method for OFDMA F...

引用

4th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Wang, Shujun Zhang, Yuan Bi, Guangguo Southeast Univ Natl Commun Res Lab Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781467358293;9781467358309

Femtocell is an emerging technology that promises increased network capacity and enhanced indoor coverage at a low capital and operational cost. As femtocells are customer-deployed without proper network planning, their interference environment tends to be much more complicated than traditional cellular networks. In this paper, we design a decentralized asynchronous inter-cell coordination method to deal with inter-macrocell interference and inter-femtocell interference. Based on this method, we propose a hierarchical scheme to solve the cross-tier interference problems in macro/femtocell heterogeneous networks. The simulation results show that this scheme can stably allocate subcarriers among cells in a distributed manner, and that it is adaptive to traffic loads and on-offs of femtocell base stations. The target of interference coordination is achieved, and a good spatial multiplexing efficiency can be attained.

关键词： decentralized algorithms Femtocell OFDMA

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Planning and Diagnosis with Commonsense Reasoning 23

Multi-Agent Planning and Diagnosis with Commonsense Reasonin...

引用

5th International Conference on Distributed Artificial Intelligence (DAI)

作者： Son, Tran Cao Yeoh, William Stern, Roni Kalech, Meir New Mexico State Univ Las Cruces NM 88003 USA Washington Univ St Louis St Louis MO USA Bengurion Univ Negev Beer Sheva Israel

ISBN: (纸本)9798400708480

In multi-agent systems, multi-agent planning and diagnosis are two key subfields - multi-agent planning approaches identify plans for the agents to execute in order to reach their goals, and multiagent diagnosis approaches identify root causes for faults when they occur, typically by using information from the multi-agent planning model as well as the resulting multi-agent plan. However, when a plan fails during execution, the cause can often be related to some commonsense information that is neither explicitly encoded in the planning nor diagnosis problems. As such existing diagnosis approaches fail to accurately identify the root causes in such situations. To remedy this limitation, we extend the Multi-Agent STRIPS problem (a common multi-agent planning framework) to a Commonsense Multi-Agent STRIPS model, which includes commonsense fluents and axioms that may affect the classical planning problem. We show that a solution to a (classical) Multi-Agent STRIPS problem is also a solution to the commonsense variant of the same problem. Then, we propose a decentralized multi-agent diagnosis algorithm, which uses the commonsense information to diagnose faults when they occur during execution. Finally, we demonstrate the feasibility and promise of this approach on several key multiagent planning benchmarks.

关键词： Multi-Agent Systems Multi-Agent Planning Multi-Agent Diagnosis Commonsense Reasoning decentralized algorithms Answer Set Programming

来源：评论

学校读者我要写书评

暂无评论

decentralized MOTION INFERENCE AND REGISTRATION OF NEUROPIXEL DATA

DECENTRALIZED MOTION INFERENCE AND REGISTRATION OF NEUROPIXE...

引用

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

作者： Varol, Erdem Boussard, Julien Dethe, Nishchal Winter, Olivier Urai, Anne Churchland, Anne Steinmetz, Nick Paninski, Liam Champalimaud Ctr Unknown Lisbon Portugal Leiden Univ Leiden Netherlands UCLA Los Angeles CA USA Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781728176055

Multi-electrode arrays such as "Neuropixels" probes enable the study of neuronal voltage signals at high temporal and single-cell spatial resolution. However, in vivo recordings from these devices often experience some shifting of the probe (due e.g. to animal movement), resulting in poorly localized voltage readings that in turn can corrupt estimates of neural activity. We introduce a new registration method to partially correct for this motion. In contrast to previous template-based registration methods, the proposed approach is decentralized, estimating shifts of the data recorded in multiple timebins with respect to one another, and then extracting a global registration estimate from the resulting estimated shift matrix. We find that the resulting decentralized registration is more robust and accurate than previous templatebased approaches applied to both simulated and real data, but nonetheless some significant non-stationarity in the recovered neural activity remains that should be accounted for by downstream processing pipelines. Open source code is available at https://***/evarol/NeuropixelsRegistration.

关键词： Microelectrode array registration decentralized algorithms spike sorting neuroscience

来源：评论

学校读者我要写书评

暂无评论

decentralized network coding

Decentralized network coding

引用

IEEE Information Theory Workshop

作者： Fragouli, C Soljanin, E EPFL Sch Comp & Commun Sci CH-1015 Lausanne Switzerland

ISBN: (纸本)0780387201

This paper proposes deterministic algorithms for decentralized network coding. decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the network such as addition of receivers. To the best of our knowledge, these are the first deterministic decentralized algorithms proposed for network coding.

关键词： deterministic algorithms telecommunication network routing codes directed graphs network changes decentralized algorithms network nodes decentralized network coding deterministic algorithms telecommunication network routing Network coding directed graphs decentralized network node Network topology

来源：评论

学校读者我要写书评

暂无评论

Multi-Robot Expansive Planning and Trajectory Evaluation for Tracking and Localization of Marine Life 23

Multi-Robot Expansive Planning and Trajectory Evaluation for...

引用

38th Annual ACM Symposium on Applied Computing (ACM SAC)

作者： Fay, Kehlani A. Giordano, Michael Soto, Alberto Clark, Christopher M. Spurgeon, Emily Anderson, James Lowe, Christopher G. Pomona Coll Claremont CA 91711 USA Harvey Mudd Coll Claremont CA 91711 USA Calif State Univ Long Beach Long Beach CA 90840 USA

ISBN: (纸本)9781450395175

Traditional techniques for marine life tracking use stationary receivers that detect and obtain measurements from tagged animals. Recently, such static systems have been replaced by multiple mobile robots, e.g., autonomous underwater vehicles (AUVs), equipped with omni-directional hydrophones that can accurately localize marine life. In this paper, the application of homogeneous multi-AUV systems to track and localize marine life is used as a motivating example to develop new MRMP (Multi-Robot Motion Planning) algorithms. These algorithms generate trajectories that maximize a new fitness function that incorporates 1) probabilistic motion models generated from historical data of live sharks, and 2) ideal AUV formations for observing a shark from multiple sensor vantage points. The two expansive RRT variants, named Independent State Expansion (ISE) planning and Joint State Expansion (JSE) planning, differ in how new samples are randomly generated during the algorithm's random search. The fitness function was developed to quantify how accurately the positioning of AUVs would trilaterate the target animal. Through simulation, it was found that the Joint planner was 70% faster with respect to run time than Independent planner, while both could produce similar mean fitness function values. The fitness for these variants was also measured for simulations where different target motion models were used when calculating the fitness function, highlighting the improved performance when using actual target motion motion models.

关键词： Multi-robot Systems Autonomous Robots Cooperative Robots decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：