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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

19 篇 会议

馆藏范围

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

日期分布

学科分类号

19 篇 工学
- 17 篇 电气工程
- 8 篇 控制科学与工程
- 7 篇 信息与通信工程
- 4 篇 计算机科学与技术...
- 1 篇 电子科学与技术（可...
- 1 篇 软件工程
7 篇 理学
- 4 篇 系统科学
- 2 篇 物理学
- 1 篇 数学
- 1 篇 统计学（可授理学、...
1 篇 医学
- 1 篇 临床医学

主题

19 篇 approximation al...
6 篇 signal processin...
4 篇 optimization
3 篇 task analysis
3 篇 minimization
3 篇 estimation
2 篇 programming
2 篇 delays
2 篇 convergence
2 篇 robots
2 篇 computational mo...
1 篇 parallel algorit...
1 篇 conferences
1 篇 runtime
1 篇 neurons
1 篇 routing
1 篇 message systems
1 篇 memory managemen...
1 篇 hidden markov mo...
1 篇 noise measuremen...

机构

1 篇 suny stony brook...
1 篇 department of el...
1 篇 wake forest univ...
1 篇 indiana univ blo...
1 篇 bournemouth univ...
1 篇 los alamos natl ...
1 篇 purdue univ dept...
1 篇 oslo & akershus ...
1 篇 australian natl ...
1 篇 ucl dept elect &...
1 篇 pacific northwes...
1 篇 univ texas austi...
1 篇 univ appl sci aa...
1 篇 univ texas dalla...
1 篇 electrical and c...
1 篇 department of ec...
1 篇 purdue univ dept...
1 篇 nanyang technol ...
1 篇 tel aviv univ sc...
1 篇 speech and signa...

作者

1 篇 li jiandong
1 篇 ballard grey
1 篇 chai wei koong
1 篇 liang hsin-ying
1 篇 song jiongjiong
1 篇 nasir baris
1 篇 lee seungjae
1 篇 raphaeli dan
1 篇 afrasiyabi arman
1 篇 chang huibin
1 篇 firoz jesun saha...
1 篇 cordes sven
1 篇 lagoa constantin...
1 篇 blicharski peter
1 篇 chu hung-chi
1 篇 riazanov andrii
1 篇 yang binxu
1 篇 sheng min
1 篇 rouse kathryn
1 篇 pavlou george

语言

19 篇 英文

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

共 19 条记录，以下是1-10 订阅

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

详细简洁

排序：

Heatmapping of People Involved in Group Activities 16

Heatmapping of People Involved in Group Activities

引用

16th IAPR International Conference on Machine Vision Applications (MVA)

作者： Sendo, Kohei Ukita, Norimichi Toyota Technol Inst Nagoya Aichi Japan

ISBN: (纸本)9784901122184

This paper proposes a method for heatmapping people who are involved in a group activity. Such people grouping is useful for understanding group activities. In prior work, people grouping is performed based on simple inflexible rules and schemes (e.g., based on proximity among people and with models representing only a constant number of people). Our proposed heatmapping method can group any number of people who dynamically change their deployment. A deep network for this method consists of two input streams (i.e., RGB and human bounding-box images). This network outputs a heatmap representing pixelwise confidence values of the people grouping. Extensive exploration of appropriate parameters was conducted in order to optimize the input bounding-box images. As a result, we demonstrate the effectiveness of the proposed method for heatmapping people involved in group activities.

关键词： Task analysis Unmanned aerial vehicles Delays Edge computing Trajectory Downlink approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

Analysis Of Sine Precision Influence On DOA Estimation Using The MUSIC Algorithm 20

Analysis Of Sine Precision Influence On DOA Estimation Using...

引用

20th International Radar Symposium (IRS)

作者： Cordes, Sven Gligorevic, Snjezana Blicharski, Peter EPOS Embedded Core & Power Syst GmbH & Co KG Duisburg Germany Univ Appl Sci Aachen Aachen Germany

ISBN: (纸本)9783736998605

In this paper, a simulation of the effects of approximation errors on multiple signal classification for direction of arrival estimation is presented. The focus lies on computer approximations of sine and cosine. Two possible error sources are highlighted, discussed and their effects estimated by constraining the approximation precision. The simulation results are then evaluated with an emphasis on optimized calculation times while maintaining good angle estimation results.

关键词： Direction-of-arrival estimation Estimation Multiple signal classification Phased arrays approximation error Signal processing algorithms approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

How many robots are enough: A multi-objective genetic algorithm for the single-objective time-limited complete coverage problem

How many robots are enough: A multi-objective genetic algori...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Zhou, Xing Wang, Huaimin Ding, Bo Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781538630815

Complete coverage, which is the foundation of many robotic applications, aims to cover an area as quickly as possible. This study investigates the time-limited version of multi-robot complete coverage problem, that is, to find the least number of robots and allocate tasks properly to them such that they can finish a known mission within the time limit. This version of problem can be tackled straightforwardly based on optimizing the task-allocation to a fixed number of robots and enumerating the number. However, the number-fixed problem is NP-hard and the existing algorithm for the number-fixed problem allows intersecting tasks (possibly causing robots' interference) and endures high approximation factor. In this study, the time-limited complete coverage problem is tackled with a multi-objective approach, instead of enumerating robots' number and optimizing each number-fixed problem one by one. The multi-objective GA, Mofint, at first estimates the lower and upper bounds of the number of robots. It abstracts each task as a weighted node of a graph. Then, Mofint evolves individuals, each individual being a forest containing a certain number (within the bounds) of non-intersecting trees. Mofint can finally obtain higher precision than existing work with less time: the approximation factor for Mofint is 1.1 to 1.5 times the ideal allocation when robots' number is fixed, while for existing work is 1.5 to 2. Due to its higher precision, the least number of robots obtained in the experiments by Mofint is 0.6 times of existing work.

关键词： Robots Vegetation Task analysis Genetic algorithms Resource management Optimization approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

algorithms for Fault-Tolerant Placement of Stateful Virtualized Network Functions

Algorithms for Fault-Tolerant Placement of Stateful Virtuali...

引用

IEEE International Conference on Communications (ICC) / Workshop on Integrating UAVs into 5G

作者： Yang, Binxu Xu, Zichuan Chai, Wei Koong Liang, Weifa Tuncer, Daphne Galis, Alex Pavlou, George UCL Dept Elect & Elect Engn London England Dalian Univ Technol Sch Software Dalian 116621 Peoples R China Bournemouth Univ Dept Comp & Informat Poole Dorset England Australian Natl Univ Res Sch Comp Sci Canberra ACT 2601 Australia

ISBN: (纸本)9781538631805

Traditional network functions (NFs) such as firewalls are implemented in costly dedicated hardware. By decoupling NFs from physical devices, network function virtualization enables virtual network functions (VNF) to run in virtual machines (VMs). However, VNFs are vulnerable to various faults such as software and hardware failures. To enhance VNF fault tolerance, the deployment of backup VNFs in stand-by VM instances is necessary. In case of stateful VNFs, stand-by instances require constant state updates from active instances during its operation. This will guarantee a correct and seamless handover from failed instances to stand-by instances after failures. Nevertheless, such state updates to stand-by instances could consume significant network bandwidth resources and lead to potential admission failures for VNF requests. In this paper, we study the fault-tolerant VNF placement problem with the optimization objective of admitting as many requests as possible. In particular, the VNF placement of active/stand-by instances, the request routing paths to active instances, and state transfer paths to stand-by instances are jointly considered. We devise an efficient heuristic algorithm to solve this problem, and propose a bicriteria approximation algorithm with performance guarantees for a special case of the problem. Simulations with realistic settings show that our algorithms can significantly improve the request admission rate compared to conventional approaches.

关键词： Fault tolerance Fault tolerant systems Delays Bandwidth Routing Software approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

Simulation-Based Policy Gradient and Its Building Control Application

Simulation-Based Policy Gradient and Its Building Control Ap...

引用

American Control Conference

作者： Lee, Donghwan Lee, Seungjae Karava, Panagiota Hu, Jianghai Univ Illinois Dept Mech Sci & Engn Urbana IL 61801 USA Purdue Univ Dept Elect & Comp Engn W Lafayette IN 47906 USA Purdue Univ Dept Civil Engn W Lafayette IN 47906 USA

ISBN: (纸本)9781538654286

The goal of this paper is to study the potential applicability of a stochastic approximation-based policy gradient method for optimal office building HVAC (Heating, Ventilation, and Air Conditioning) control systems. A real-world building thermal dynamics with occupant interactions is the main focus of this paper. It is a complex stochastic system in the sense that its statistical properties depend on its state variables. In this case, existing approaches, for instance, stochastic model predictive control methods, cannot be applied to optimal control designs. As a remedy, we approximate the gradient of the cost function using simulations and use a gradient descent type algorithm to design a suboptimal control policy. We assess its performance through a simulation study of building HVAC systems.

关键词： Buildings Stochastic processes Optimal control Hidden Markov models Stochastic systems approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

Distributed Efficient Optimization for General Network Cost Minimization Problems

Distributed Efficient Optimization for General Network Cost ...

引用

IEEE International Conference on Communications (ICC) / Workshop on Integrating UAVs into 5G

作者： Cao, Xuanyu Liu, K. J. Ray Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia PA USA

ISBN: (纸本)9781538631805

In this work, we study a generic network cost minimization problem, in which every node has a local decision vector to determine. Each node incurs a cost depending on its decision vector and each link also incurs a cost depending on the decision vectors of its two end nodes. All nodes cooperate to minimize the overall network cost. To obtain a decentralized algorithm for this problem, we resort to the distributed alternating direction method of multipliers (DADMM). However, each iteration of the DADMM involves solving a local optimization problem at each node, leading to intractable computational burden in many circumstances. As such, we propose a distributed linearized ADMM (DLADMM) algorithm, in which each iteration only involves closed-form computations and avoids local optimization problems. This greatly reduces the computational complexity and makes the proposed DLADMM amenable to devices with low computational capability, such as vastly deployed sensors, to which the computationally intensive traditional DADMM is not applicable. We prove that the DLADMM converges to an optimal point when the local cost functions are convex and have Lipschitz continuous gradients. Linear convergence rate of the DLADMM is also established if the local cost functions are further strongly convex. Numerical experiments are conducted to corroborate the effectiveness of the DLADMM and we observe that the DLADMM has similar convergence performance as DADMM does while the former enjoys much lower computational overhead.

关键词： Cost function Minimization Convergence Signal processing algorithms Sensors approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

Verification of Markov Decision Processes with Risk-Sensitive Measures

Verification of Markov Decision Processes with Risk-Sensitiv...

引用

American Control Conference

作者： Cubuktepe, Murat Topcu, Ufuk Univ Texas Austin Dept Aerosp Engn & Engn Mech 201 E 24th St Austin TX 78712 USA

ISBN: (纸本)9781538654286

We develop a method for computing policies in Markov decision processes with risk-sensitive measures subject to temporal logic constraints. Specifically, we use a particular risk-sensitive measure from cumulative prospect theory, which has been previously adopted in psychology and economics. The nonlinear transformation of the probabilities and utility functions yields a nonlinear programming problem, which makes computation of optimal policies typically challenging. We show that this nonlinear weighting function can be accurately approximated by the difference of two convex functions. This observation enables efficient policy computation using convex-concave programming. We demonstrate the effectiveness of the approach on several scenarios.

关键词： Markov processes Convex functions Weight measurement Programming Dynamic programming Loss measurement approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product 32

Communication Lower Bounds for Matricized Tensor Times Khatr...

引用

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

作者： Ballard, Grey Rouse, Kathryn Knight, Nicholas Wake Forest Univ Dept Comp Sci Winston Salem NC 27109 USA NYU Dept Math New York NY USA

ISBN: (纸本)9781538643686

The matricized-tensor times Khatri-Rao product (MTTKRP) computation is the typical bottleneck in algorithms for computing a CP decomposition of a tensor. In order to develop high performance sequential and parallel algorithms, we establish communication lower bounds that identify how much data movement is required for this computation in the case of dense tensors. We also present sequential and parallel algorithms that attain the lower bounds and are therefore communication optimal. In particular, we show that the structure of the computation allows for less communication than the straightforward approach of casting the computation as a matrix multiplication operation.

关键词： Tensile stress Matrix decomposition Computational modeling Program processors Optimization Parallel algorithms approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

Empirical Studies on Phase Retrieval 13

Empirical Studies on Phase Retrieval

引用

13th IEEE Image, Video, and Multidimensional Signal Processing Workshop (IVMSP)

作者： Hart, Russell Chang, Huibin Lou, Yifei Univ Texas Dallas Math Sci Richardson TX 75080 USA Tianjin Normal Univ Sch Math Sci Tianjin 300387 Peoples R China

ISBN: (纸本)9781538609514

In phase retrieval, the signal is recovered from magnitude data that can be collected in various ways, ranging from the Fourier transform to general linear transform. Through experimental observation, we address the questions: (1) which sampling method, given the number of measurements versus signal size, best recovers the underlying signal? and (2) for each sampling method which recovery algorithm maximizes recovery success? Our empirical results contribute to better characterizing the phase retrieval problem.

关键词： Discrete Fourier transforms Erbium Atmospheric measurements Particle measurements Phase measurement Convergence approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

ROBUST LOW COMPLEXITY DIGITAL SELF INTERFERENCE CANCELLATION FOR MULTI CHANNEL FULL DUPLEX SYSTEMS 20

ROBUST LOW COMPLEXITY DIGITAL SELF INTERFERENCE CANCELLATION...

引用

IEEE Statistical Signal Processing Workshop (SSP)

作者： Shayovitz, Shachar Raphaeli, Dan Tel Aviv Univ Sch Elect Engn Tel Aviv Israel

ISBN: (纸本)9781538615713

Self interference in a communications system occurs when there is electromagnetic coupling between the transmission (TX) and reception (RX) radio frequency (RF) chains or antennas. This coupling degrades the system's RX sensitivity to incoming signals. In this paper a low complexity technique for self interference cancellation in multi channel systems is presented. In this scenario, multiple carriers at overlapping arbitrary bandwidths and powers are simultaneously received and transmitted by the system. Traditional algorithms for self-interference mitigation based on Recursive Least Squares (RLS) and Least Mean Squares (LMS), fail to provide sufficient rejection since the incoming signal is not spectrally white, which is critical for their performance. The proposed algorithm mitigates the interference by modeling the incoming multi carrier signal as an Auto-Regressive (AR) process and jointly estimates the AR parameters and self interference. The resulting algorithm can be implemented using a low complexity architecture comprised of only two RLS modules. The main advantage of the proposed technique over RLS and LMS is the robustness to the spectrum of arbitrary incoming signals and improved rejection levels of over 10dB. All of this is achieved while not compromising on low latency constraints.

关键词： Interference cancellation Signal processing algorithms Estimation Minimization Robustness approximation algorithms"

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：