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

State estimation for asynchronous multirate multisensor dynamic systems with missing measurements

IET SIGNAL PROCESSING 2010年第6期4卷 728-739页

作者： Yan, L. P. Zhou, D. H. Fu, M. Y. Xia, Y. Q. Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China

This study is concerned with the state estimation problem for a kind of asynchronous multirate multisensor dynamic system, where observations from different sensors are randomly missing. The system is described at the highest sampling rate with different sensors observing a single target independently with multiple sampling rates. The optimal state estimate is obtained by use of the multiscale system theory and the modified Kalman filter. This study extends the federated Kalman filter to the case of asynchronous multirate multisensor dynamic systems with measurements randomly missing. The presented algorithm is proven to be effective in the sense of linear minimum mean squared error. The feasibility and efficiency of the algorithm are illustrated by a numerical simulation example.

关键词： Kalman filters multi sensor Dynamic systems Asynchronous State estimation Systems Theory Mean square error algorithm efficiency numerical simulation

来源：评论

学校读者我要写书评

暂无评论

The Chebyshev-Shamanskii Method for Solving Systems of Nonlinear Equations

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2013年第1期157卷 148-167页

作者： Kchouk, Bilel Dussault, Jean-Pierre Univ Sherbrooke Dept Math Sherbrooke PQ J1K 2R1 Canada Univ Sherbrooke Dept Comp Sci Sherbrooke PQ J1K 2R1 Canada

We present a method, based on the Chebyshev third-order algorithm and accelerated by a Shamanskii-like process, for solving nonlinear systems of equations. We show that this new method has a quintic convergence order. We will also focus on efficiency of high-order methods and more precisely on our new Chebyshev-Shamanskii method. We also identify the optimal use of the same Jacobian in the Shamanskii process applied to the Chebyshev method. Some numerical illustrations will confirm our theoretical analysis.

关键词： Newton method Chebyshev method Shamanskii process algorithm efficiency Automatic differentiation

来源：评论

学校读者我要写书评

暂无评论

Acceleration strategies based on bubble-type adaptive mesh refinement method

引用

MATHEMATICS AND COMPUTERS IN SIMULATION 2020年 170卷 143-163页

作者： Guo, Wei Nie, Yufeng Zhang, Weiwei Northwestern Polytech Univ Res Ctr Computat Sci Xian 710129 Shaanxi Peoples R China

Although the adaptive mesh refinement method based on bubble placement can generate a high-quality mesh, the efficiency of bubble placement method remains to be improved. In this study several acceleration strategies are proposed to reduce the cost of simulation. The specific strategies are given as follows: in order to reduce the number of simulation rounds, the bubbles at the new refinement level are added in advance according to the estimated bubble distribution;multilevel time step is adopted for time integration and the time step is defined separately for moving bubbles and oscillating bubbles;a scheme for setting cell length adaptively is proposed and the cell searching method is modified to improve the efficiency of establishing adjacent list;efficiency of updating bubble size is also enhanced by promoting the localization process. Numerical examples illustrate that the computing cost can significantly decrease by 70% via adopting the strategies above, while keeping the mesh quality unchanged compared with the traditional method. It shows that those strategies are efficient and suitable for adaptive mesh refinement. (C) 2019 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.

关键词： Bubble packing method Adaptive mesh refinement Multilevel adaptive algorithm Node distribution estimation algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

NUMERICAL-SIMULATION OF TRANSIENT STABILITY OF POWER-SYSTEMS BY AN ADAPTIVE RUNGE-KUTTA METHOD

引用

ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK 1995年第6期75卷 471-480页

作者： ZHU, N JACKIEWICZ, Z BOSE, A TYLAVSKY, DJ ARIZONA STATE UNIV DEPT ELECT ENGNTEMPEAZ 85287 ARIZONA STATE UNIV DEPT MATHTEMPEAZ 85287

A new algorithm for the transient stability simulation of power systems, which are represented by a set of nonlinear differential and algebraic equations, is proposed. This algorithm is based on the adaptive continuous Runge-Kutta method of order three with a step changing strategy based on estimation of the local discretization error by an embedded two-step Runge-Kutta method of order four. A sift time threshold and a dead band are used to improve both the accuracy and efficiency of the algorithm. This method was tested on the 118 bus power system with 19 generators and was sound faster than the usually preferred method based on a simultaneous approach. A bigger speedup is expected for larger systems.

关键词： discretization error Runge-Kutta methods power systems differential algebraic equations Dead band algorithm efficiency stability simulation

来源：评论

学校读者我要写书评

暂无评论

Fast SVM training algorithm with decomposition on very large data sets

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2005年第4期27卷 603-618页

作者： Dong, JX Krzyzak, A Suen, CY Concordia Univ Dept Comp Sci & Software Engn Ctr Pattern Recognit & Machine Intelligence Montreal PQ H3G 1M8 Canada

Training a support vector machine on a data set of huge size with thousands of classes is a challenging problem. This paper proposes an efficient algorithm to solve this problem. The key idea is to introduce a parallel optimization step to quickly remove most of the nonsupport vectors, where block diagonal matrices are used to approximate the original kernel matrix so that the original problem can be split into hundreds of subproblems which can be solved more efficiently. In addition, some effective strategies such as kernel caching and efficient computation of kernel matrix are integrated to speed up the training process. Our analysis of the proposed algorithm shows that its time complexity grows linearly with the number of classes and size of the data set. In the experiments, many appealing properties of the proposed algorithm have been investigated and the results show that the proposed algorithm has a much better scaling capability than Libsvm, SVMlight, and SVMTorch. Moreover, the good generalization performances on several large databases have also been achieved.

关键词： support vector machines (SVMs) algorithm design and analysis algorithm efficiency machine learning handwritten character recognition

来源：评论

学校读者我要写书评

暂无评论

APPLICATION OF PARALLEL-PROCESSING TO ROBOTIC COMPUTATIONAL TASKS

引用

INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH 1995年第1期14卷 76-86页

作者： NABHAN, TM ZOMAYA, AY Department of Electrical and Electronic Engineering University of Western Australia Nedlands Perth 6009 Australia (09) 380 3875

Robotic tasks (e.g., kinematics and dynamics) are computationally expensive. The majority of these tasks must be computed in real-time to meet the high sampling rate modes of operations. Recently parallel processing has been used to speed up these computations. In this work, we propose a graph-based algorithm to map computational tasks onto multiple instruction-multiple data (MIMD) type of architectures. The algorithm automatically generates the task graph of a given task. Then an annealing procedure is used to allocate the generated subtasks to different processors, taking into account the network topology and the communication constraints. Moreover, the proposed technique is simple, flexible, and computationally viable. The efficiency of the algorithm is demonstrated by a case study with good results.

关键词： Real time task graphs multiple instruction multiple datastream (mimd) Network topology PARALLEL PROCESSING (COMPUTERS) Religious Missions Case studies algorithm efficiency kinematics

来源：评论

学校读者我要写书评

暂无评论

Overview of Path-Planning and Obstacle Avoidance algorithms for UAVs: A Comparative Study

引用

UNMANNED SYSTEMS 2018年第2期6卷 95-118页

作者： Radmanesh, Mohammadreza Kumar, Manish Guentert, Paul H. Sarim, Mohammad Univ Cincinnati Dept Mech & Mat Engn Cincinnati OH 45221 USA

Unmanned aerial vehicles (UAVs) have recently attracted the attention of researchers due to their numerous potential civilian applications. However, current robot navigation technologies need further development for efficient application to various scenarios. One key issue is the "Sense and Avoid" capability, currently of immense interest to researchers. Such a capability is required for safe operation of UAVs in civilian domain. For autonomous decision making and control of UAVs, several path-planning and navigation algorithms have been proposed. This is a challenging task to be carried out in a 3D environment, especially while accounting for sensor noise, uncertainties in operating conditions, and real-time applicability. Heuristic and non-heuristic or exact techniques are the two solution methodologies that categorize path-planning algorithms. The aim of this paper is to carry out a comprehensive and comparative study of existing UAV path-planning algorithms for both methods. Three different obstacle scenarios test the performance of each algorithm. We have compared the computational time and solution optimality, and tested each algorithm with variations in the availability of global and local obstacle information.

关键词： UAV path-planning obstacle avoidance sense and avoid algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

A Robust Homotopy Continuation Method for Seeking All Real Roots of Unconstrained Systems of Nonlinear Algebraic and Transcendental Equations

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2011年第15期50卷 8892-8900页

作者： Rahimian, Saeed Khaleghi Jalali, Farhang Seader, J. D. White, R. E. Univ Utah Dept Chem Engn Salt Lake City UT 84112 USA Univ S Carolina Dept Chem Engn Columbia SC 29208 USA Univ Tehran Chem Engn Dept Tehran Iran

A new homotopy developed for finding all real roots to a single nonlinear equation is extended to a system of nonlinear algebraic and transcendental equations written as f{x} = 0 to find all real roots, including those on isolas. To reach roots that may lie on isolas, the functions are squared. This causes all roots to be bifurcation points that are connected to each other through stemming branches. As a result, a new system of homotopy functions, including numerous bifurcation points, is formed as H{x,t} = (x - x(0)) (1 + f(2) - t), where x(0) is the starting point. Because the functions are squared, many systems of equations must be solved to find a starting point on a reduced system of homotopy functions written as H{x,t} = 1 + f(2) - t. Therefore, robustness is achieved at the expense of increased computation time. To improve the efficiency of the algorithm, the Levenberg-Marquardt method is used to find the starting point for the reduced homotopy system by solving a system of nonlinear equations with the degree of freedom equal to one. Then, a continuation method is used to track the paths from the resulting starting point to seek at least one root. Because all roots are bifurcation points, tracking the stemming branches from each subsequent root is the final step. The new algorithm was able to find successfully all the reported roots for 20 test problems that included a variety of algebraic and transcendental terms. In some cases additional roots were obtained.

关键词： algorithm efficiency Transcendental nonlinear equations Homotopy bifurcation point Algebra BIFURCATION test problem

来源：评论

学校读者我要写书评

暂无评论

RETRACTED: A novel registration and super-resolution jointed paradigm for medical images under internet of thing environment (Retracted article. See SEP, 2022)

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第5期78卷 5107-5135页

作者： Lin, Yu Yang, Jie Mi, Jing Yang, Jingjing Zhang, Xiao Hebei North Univ Zhangjiakou 075000 Hebei Peoples R China

This paper proposes a novel registration and super-resolution jointed paradigm for medical images under the Internet of thing environment. In the medical image processing, the matching issue is one catches wide attention with the domain of research. Image registration technique can be divided into similarity measure, optimization, geometric transformation, and interpolation, etc. As the first essential clue of our model, we propose the novel registration algorithm based on energy feature extraction. Generally, the matching energy function by the similarity measurement and a penalty constitution is called the external force and endogenic force separately. The matching is an external force and endogenic force mutual competition, eventually achieves the balanced process. Furtherly, we integrate the game analysis and area feature selection to achieve the better image super-resolution mode through the pretreatment of the image to change the initial value, so as to achieve the purpose of improving the performance. Besides the algorithm level innovation, we integrate the GPU and the IOT to construct the hardware based implementation of the proposed medical image processing system. The latency of registers to read and write data across a GPU's entire storage system is minimal, it is private to each thread, and can only be accessed by its owning thread. For each thread, the local memory is also private and it is often used to deal with the problem of overflow register, reducing the buffer overflow caused by the entire application of a substantial decline in the possibility and shared memory is visible to all threads within the thread block. We then achieve the optimal integration of IOT and GPU. The experimental result proves the robustness of the method.

关键词： Medical image Image registration Image super-resolution Internet of things Data storage algorithm efficiency Jointed paradigm

来源：评论

学校读者我要写书评

暂无评论

A New PSO-based algorithm for Two-Dimensional Non-Guillotine Non-Oriented Cutting Stock Problem

引用

APPLIED ARTIFICIAL INTELLIGENCE 2017年第4期31卷 376-393页

作者： Ayadi, Omar Masmoudi, Malek Ben Ameur, Mariem Masmoudi, Faouzi Univ Sfax Dept Genie Mecan Ecole Natl Ingn Sfax Unite Mecan Modelisat & Prod Sfax Tunisia Univ Lyon F-42023 St Etienne France Univ St Etienne F-42000 St Etienne France IUT Roanne LASPI F-42334 Roanne France

In this paper, a new algorithm is proposed for the two-dimensional non-guillotine non-oriented cutting stock problem. The considered problem consists of cutting small rectangular pieces of predetermined sizes from large but finite rectangular plates. The objective is to generate cutting patterns that minimize the unused area and fulfill customer orders. The proposed algorithm is a combination of a new particle swarm optimization approach with a heuristic criterion inspired from the literature. The algorithm is tested on twenty-two instances divided into two sets. Corresponding results show the algorithm efficiency in optimizing the trim loss that is comprised between 2.6% and 7.8% for all considered instances.

关键词： bin packing Particle swarm optimization algorithms algorithm efficiency non-oriented

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：