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

IEEE Conference on Decision and Control

作者： Allahyar Montazeri Johann Reger Control Engineering Group at Ilmenau University of Technology Gustav-Kirchhoff-Str.1 D-98693 Ilmenau Germany

ISBN: (纸本)9781612848006

In this paper, a robust adaptive algorithm for active noise and vibration control applications is proposed and the robust stability of the algorithm is analyzed using a combination of the small gain theorem and Popov's hyper-stability theorem. The algorithm is developed based on the so-called Filtered-x RLS algorithm in the modified form. In design and analysis of the algorithm, it is assumed that the estimated model of the secondary path is associated with a set of uncertainties of additive structure;and sufficient conditions for stability of the algorithm are derived. In fact, by introducing a stabilizing filter, the aim is to design this filter in a way that the achieved sufficient conditions for robust stability are satisfied. The employed method is to transform the proposed control structure to an equivalent output error identification problem, and then formulate the governing adaptive algorithm in a way that is representable as a feedback control problem. In view of this approach, sufficient conditions for robust stability of the adaptive algorithm will be equivalent to find the conditions for the stability of the established feedback control system. The technique applied here to this end is established on the energy conservation relation that is valid for the general data models in adaptive filters.

关键词： Robust stability Sufficient conditions algorithms vibration control Control Architecture Energy conservation feedback control Self tuning small gain theorem Feedback control systems analysis of algorithm adaptive filters Road Filters

来源：评论

学校读者我要写书评

暂无评论

Vehicle Detection Based on Spatial-Temporal Connection Background Subtraction

Vehicle Detection Based on Spatial-Temporal Connection Backg...

引用

第八届IEEE信息与自动化国际会议(ICIC 2011)

作者： Chao Wang Zhan Song Guilin University of Electronic Technology GuilinChina Shenzhen Institutes of Advanced TechnologyC Shenzhen Institutes of Advanced Technology Chinese Academy of SciencesShenzhen China The Chinese U

ISBN: (纸本)9781457702686

This paper describes an application of computer vision techniques to road *** could detect and track vehicles in real traffic scenes to generate meaningful traffic parameters as well as new metrics suitable for improved automated *** paper adopts spatial-temporal connection method to detect the *** use background subtraction based on Gaussian mixture modelling to extract the foreground,next update the foreground by spatial *** results and analysis of the algorithm are presented in this paper.

关键词： Gaussian mixture method background subtraction spatial-temporal combination Vehicle detection Subtraction joining method vehicle analysis of algorithm Gaussian elimination Traffic APPLIED COMPUTER SCIENCE

来源：评论

学校读者我要写书评

暂无评论

An attack-aware routing algorithm based on immune artificial fish swarm optimization in optical networks

An attack-aware routing algorithm based on immune artificial...

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Qian Wang Qi-wu Wu Department of Information Engineering Engineering University of Armed Police Force China

ISBN: (纸本)9781510802704

For multicast security routing in optical network, through the adoption of maximum light path attack radius MaxLAR criterion, Combined with the advantages of the immune algorithm and artificial fish algorithm, this paper proposes a new attack-aware routing algorithm based on immune artificial fish swarm optimization in optical networks. The algorithm can find out the smallest light path attack radius in light paths under the given condition, can enhance the capacity of optical network attack prevention, can reduce the light damage by the potential physical-layer attacks. Through algorithm analysis, we can show that the algorithm is feasible, and have achieved good performance.

关键词： Immune artificial fish swarm MaxLAR Multicast routing Optical network Fiber optic networks Particle swarm optimization analysis of algorithm Routing algorithms light damage Immunity

来源：评论

学校读者我要写书评

暂无评论

Packet Scheduling for On-Demand Data Services to High-Speed Trains over Wireless Links

Packet Scheduling for On-Demand Data Services to High-Speed ...

引用

IEEE Global Communications Conference

作者： Tianyi Chen Hangguan Shan Xin Wang Department of Communication Science and Engineering Fudan University Department of Information Science and Electronic Engineering Zhejiang University

ISBN: (纸本)9781479913510

In this paper, we consider a cellular/infostation integrated network which supports on-demand data service delivery over a wireless link to users in a high-speed train. For the requests with different lifetimes and prices that they are willing to pay, we develop the optimal packet schedule that aims at earning the maximum revenue. To this end, we formulate the problem as an integer linear program (ILP) which is in general NP-hard. However, by exploring the special structure of the formulated ILP, we show that this problem can be turned into a P problem that admits efficient solvers. Specifically, we propose a novel Checker algorithm and prove that this algorithm is guaranteed to find the offline optimal schedule for the intended problem in polynomial time, when the number of total requests is proportional to the length of the total transmission time span. Based on the relevant insights, a class of efficient online Checker algorithms are then developed to approach the optimal schedule when a-priori knowledge of service demands and/or wireless channel capacities is not available in practical systems. It is shown that these online algorithms have a competitive ratio of 1/2, i.e., total revenue earned by them is at least half as much as the revenue earned by offline optimal schedule. Simulation results are provided to demonstrate the merit of the proposed algorithms.

关键词： On-demand services Packet schedule Wireless link Integer linear program algorithm analysis analysis of algorithm wireless high-speed train Integer linear programming Radio links data services packet schedule REVENUE algorithms checker

来源：评论

学校读者我要写书评

暂无评论

Parallelization of the Kalman Filter for Banded Systems on Multicore Computational Platforms

Parallelization of the Kalman Filter for Banded Systems on M...

引用

IEEE Annual Conference on Decision and Control

作者： Olov Rosen Alexander Medvedev Institution of Information Technology Department of System and Control Uppsala University

ISBN: (纸本)9781467320658

Parallel implementation of the Kalman filter (KF), with emphasis on multicore architecture implementation is investigated. It is shown that KF provides enough parallelizm to achieve linear speedup in the number of cores used. A computationally efficient implementation that exhibit good scalability properties is presented. The implementation is based on the assumption of a banded system matrix. Both time-varying and invariant systems can be generally transformed to a realization with a banded system matrix. An analysis of the algorithm that provides guidelines to the choice of implementation hardware to meet a desired performance is also given.

关键词： parallelization Multi-core processors KF Kalman filters analysis of algorithm Platform

来源：评论

学校读者我要写书评

暂无评论

Analyzing real-time systems 00

Analyzing real-time systems

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Jurgen Ruf Thomas Kropf Wilhelm-Schickard-Institute University of Tübingen Sand 13 72076 Tübingen Germany

ISBN: (纸本)0769505376

Temporal logic model checking is a technique for the automatic verification of systems against specifications. Besides the correctness of safety and liveness properties it is often important to determine critical answer and delay times of systems, especially if they are embedded in a real-time environment. In this paper we present an approach which allows the verification as well as the timing analysis of real-time systems. The systems are described as networks of communicating time-extended finite state machines (I/O-interval structures). We use a compact symbolic representation to obtain efficient analysis algorithms.

关键词： real-time systems time series analysis Model checking Verification accuracy class verification system Specifications finite state machines analysis of algorithm Temporal logic

来源：评论

学校读者我要写书评

暂无评论

The Effect of a Capacity Constraint on the Minimal Cost of a Partition

引用

Journal of the ACM (JACM) 1975年第4期22卷 441-449页

作者： Wong, C.K. Easton, M.C. IBM Thomas J. Watson Research Center Yorktown Heights NY 10598 P O. Box 218 United States

A recent paper by Chandra and Wong considered the problem of finding a partition of nonnegatlve numbers into m groups to minimize a certain cost, the sum of the squares of the group sums. One apphcatlon of thin problem is m allocation of data records to disks to minimize arm contention, under certain assumptions about record accessing behavior In the paper by Chandra and Wong it was assumed that the dmk capacltms were so large that capacity constraints could be ignored Consideration of the effect of such constraints, assuming equal-razed data records and equalsized dmks, leads to the problem of partitioning numbers (which represent access probabihtles) into m groups of at most k numbers each A practical method for partltmmng is shown to ymld a cost no more than of the minimal cost without the constraint on group size (Cases are constructed that approach this limit asymptotically ) Therefore, within the context of the model, increasing the disk capacity (keeping the number of arms fixed) and arbitrarily changing the partitmn cannot reduce the arm contention cost below 75 percent of that achieved on the existing system with the suggested partition The result also shows that the proposed partition has a cost for the constrained problem at most of the minimal cost for the constrained problem However, the exact worst-case performance is not yet known except in the case when the group size is 2. In that case, the proposed partition is actually optimal. © 1975, ACM. All rights reserved.

关键词： analysis of algorithm data set allocation disk arm contention effect of capacity constraint heuristics near-optimal algorithms NP-complete problem partitions

来源：评论

学校读者我要写书评

暂无评论

Two-Dimensional Voronoi Diagrams in the L_p-Metric

引用

Journal of the ACM (JACM) 1980年第4期27卷 604-618页

作者： Lee, D.T. University of Illinois Urbana-Champaign Urbana Illinois United States Department of Electrical Engineering and Computer Science Northwestern University Evanston IL 60201 United States

The Voronoi diagram, also known as the Thiessen diagram, for a set of N points in the Cartesian plane in which the L,-metnc is the distance measure, where p is a real number between 1 and 0o inclusive, is defined, and an algorithm for constructing the dmgram m O(NlogN) tune is presented This algonthm uses the divide-and-conquer technique. Many proximity problems revolving a set of points, such as finding the nearest neighbor of a given point, finding the minimum spamung tree, findmg the smallest circle (m the Lp-metric) enclosing the point set, etc., can be solved very efficiently via the diagram The running time of the algorithm presented is also shown to be optimal to within a constant factor. © 1980, ACM. All rights reserved.

关键词： analysis of algorithm computational complexity computational geometry divide-and-conquer Lpmetric Voronoi diagram

来源：评论

学校读者我要写书评

暂无评论

MSE-Based Orthogonal Beamformer Design for Interference Alignment in a MU-MIMO Cellular Network

MSE-Based Orthogonal Beamformer Design for Interference Alig...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

作者： Mohammad Ali Torabi Jean-Francois Frigon Christian Cardinal Department of Electrical Engineering Ecole Polytechnique de Montreal

ISBN: (纸本)9781457713460

In this paper we consider an Interference Alignment (IA) approach for intercell interference coordination for the downlink of a MIMO multi-user cellular network. We determine the maximum degrees of freedom (DoF) of the network and give the feasibility proof of perfect IA. Furthermore, we consider the problem of approximate IA and the Mean-Squared Error (MSE) based optimization of the transmit and receive beamforming matrices with the orthogonality constraints and the per-antenna transmit power constraint. Iterative algorithms are presented to solve the corresponding MSE problems. Simulation results and convergence analysis of the algorithms are also discussed. The results indicate that it is feasible to significantly increase the network capacity using the proposed IA approach.

关键词： INFORMATION ASSURANCE analysis of algorithm Mean square error network capacity inter-cell interference TRANSMITTING Cells

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：