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

Free knot recursive B-spline for compensation of nonlinear smart sensors

MEASUREMENT 2011年第5期44卷 888-894页

作者： Wang, Xin Wei, Guo Sun, Jinwei Harbin Inst Technol Dept Automat Testing & Control Harbin 150001 Peoples R China

Compensation of nonlinear smart sensors is an important topic that must always be considered to assure the accuracy of measurement systems. Nowadays, with the advent of microprocessor devices in smart sensors, advanced compensation algorithms can be implemented to improve the accuracy of measurement. In this paper, an inverse modeling methodology based on B-spline is proposed for the compensation of nonlinear smart sensors. To avoid complicated least squares solution of the B-spline, a training algorithm in a recursive form is proposed to reduce the training cost and make the on-chip training of B-spline available. Moreover, the choices of B-spline knots and training points are important designed parameters in this methodology. So the free knot insertion algorithm and training points' selection method are used prior to the training process to improve the accuracy of the inverse models and avoid the under and over fitting. Simulations and results are presented to validate the theoretical expectations. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Compensation Smart sensor B-spline recursive algorithm Free knot insertion algorithm Training points selection

来源：评论

学校读者我要写书评

暂无评论

Simultaneous State and Unknown Input Estimation for Complex Networks With Redundant Channels Under Dynamic Event-Triggered Mechanisms

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2022年第10期33卷 5441-5451页

作者： Li, Qi Wang, Zidong Hu, Jun Sheng, Weiguo Hangzhou Normal Univ Sch Informat Sci & Engn Hangzhou 311121 Peoples R China Brunel Univ London Dept Comp Sci Uxbridge UB8 3PH Middx England Harbin Univ Sci & Technol Dept Math Harbin 150080 Peoples R China

This article addresses the simultaneous state and unknown input estimation problem for a class of discrete time-varying complex networks (CNs) under redundant channels and dynamic event-triggered mechanisms (ETMs). The redundant channels, modeled by an array of mutually independent Bernoulli distributed stochastic variables, are exploited to enhance transmission reliability. For energy-saving purposes, a dynamic event-triggered transmission scheme is enforced to ensure that every sensor node sends its measurement to the corresponding estimator only when a certain condition holds. The primary objective of the investigation carried out is to construct a recursive estimator for both the state and the unknown input such that certain upper bounds on the estimation error covariances are first guaranteed and then minimized at each time instant in the presence of dynamic event-triggered strategies and redundant channels. By solving two series of recursive difference equations, the desired estimator gains are computed. Finally, an illustrative example is presented to show the usefulness of the developed estimator design method.

关键词： Complex networks (CNs) dynamic event-triggered mechanisms (ETMs) recursive algorithm redundant channels state and input estimations

来源：评论

学校读者我要写书评

暂无评论

Order N formulation for flexible multibody systems in tree topology: Lagrangian approach

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1997年第4期20卷 665-672页

作者： Pradhan, S Modi, VJ Misra, AK UNIV BRITISH COLUMBIA DEPT MECH ENGNVANCOUVERBC V6T 1Z4CANADA MCGILL UNIV MONTREALPQ H3A 2K6CANADA

An order N algorithm Is developed for dynamic simulation of flexible multibody systems in tree topology with open as well as closed branches. The joints between the bodies permit slew and translation degrees of freedom. Application of the chain rule of differentiation to the Lagrange equations of motion in conjunction with position and velocity transformations leads to the factorized mass matrix and an order N algorithm for the forward dynamics computation. The constrained degrees of freedom are incorporated by the Lagrange multipliers. Computation of the forward dynamics of flexible multibody systems using a Lagrangian order N method represents an innovation of considerable importance. An example of the space-platform-based mobile manipulator system complements the development.

关键词： Multibody Dynamics Rayleigh Ritz Approach Remote Manipulator System Space Stations Closed Loop Structural Damping Structural Element recursive algorithm Kinetic Energy Six Degree of Freedom

来源：评论

学校读者我要写书评

暂无评论

Generating strictly binary trees at random based on convex polygon triangulations

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2016年第3期93卷 445-452页

作者： Yu, Jing Tang, Zi-Li Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Jiangsu Peoples R China

A set of maximal non-intersecting diagonals can decompose a polygon into triangles, and the edges and diagonals can be converted into the external and internal nodes of a strictly binary tree. This paper gives algorithms to generate all types of triangulations and triangulations at random. Based on that, this paper gives an algorithm to generate strictly binary trees at random. The experimental results show that the numbers of various shapes of strictly binary trees generated are nearly equal. The algorithm to generate strictly binary trees at random can be transformed to the algorithm to randomly generate binary trees.

关键词： strictly binary tree edge diagonal binary tree recursive algorithm convex polygon triangulation node 32B25 05C05 05C85

来源：评论

学校读者我要写书评

暂无评论

D-Optimal designs for weighted polynomial regression -: A functional approach

引用

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS 2005年第4期57卷 833-844页

作者： Chang, FC Natl Sun Yat Sen Univ Dept Math Appl Kaohsiung 804 Taiwan

This paper is concerned with the problem of computing approximate Doptimal design for polynomial regression with analytic weight function on a interval [m(0) - a, m(0) + a]. It is shown that the structure of the optimal design depends on a and weight function. Moreover, the optimal support points and weights are analytic functions of a at a = 0. We make use of a Taylor expansion to provide a recursive procedure for calculating the D-optimal designs.

关键词： approximate D-optimal design Chebyshev system D-efficiency D-Equivalence Theorem implicit function theorem recursive algorithm Taylor expansion weighted polynomial regression

来源：评论

学校读者我要写书评

暂无评论

A systematic method for the hybrid dynamic modeling of open kinematic chains confined in a closed environment

引用

MULTIBODY SYSTEM DYNAMICS 2016年第1期38卷 21-42页

作者： Shafei, A. M. Shafei, H. R. Shahid Bahonar Univ Kerman Dept Mech Engn Kerman Iran

This work presents a systematic method for the dynamic modeling of multi-rigid links confined within a closed environment. The behavior of the system can be completely characterized by two different mathematical models: a set of highly coupled differential equations for modeling the confined multi-link system when it has no impact with surrounding walls;and a set of algebraic equations for expressing the collision of this open kinematic chain system with the confining surfaces. In order to avoid the Lagrangian formulation (which uses an excessive number of total and partial derivatives in deriving the governing equations of multi-rigid links), the motion equations of such a complex system are obtained according to the recursive Gibbs-Appell formulation. The main feature of this paper is the recursive approach, which is used to automatically derive the governing equations of motion. Moreover, in deriving the motion equations, the manipulators are not limited to planar motions only. In fact, for systematic modeling of the motion of a multi-rigid-link system in 3D space, two imaginary links are added to the -real links of a manipulator in order to model the spatial rotations of the system. Finally, a 2D and a 3D case studies are simulated to demonstrate the effectiveness of the proposed approach.

关键词： recursive algorithm Gibbs-Appell Finite motion Impulsive motion Closed environment

来源：评论

学校读者我要写书评

暂无评论

An efficient processor-based online generation of time-optimal trajectories

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2006年第5期14卷 966-973页

作者： Panahi, Issa M. S. Toliyat, Hamid A. Univ Texas Dept Elect Engn Richardson TX 75080 USA Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA

We present a novel method to online generation of time-optimal acceleration, velocity, and position trajectory values for servo-control systems using low-cost fixed-point processors with no on-chip multipliers. As in the case of many product designs, reducing system cost is a key constraint in our method. We address this constraint by optimizing required memory size, computational time, and introducing multiplication-free recursive algorithms most suitable for real-time implementation on low-cost microcontrollers. An efficient search algorithm is presented optimizing the trajectories with respect to total move time for any distance subject to physical constraints of the system. We also introduce a normalized set of first-order difference equations using only integer arithmetic and additions to compute the trajectory values. Complexity of the proposed method is compared with multiplication-based and lookup table methods using three popular microcontrollers with and without an on-chip hardware multiplier.

关键词： multiplication-free operation online-optimal trajectory generation position control processor-based design real-time systems recursive algorithm robot-servo control systems time-optimal control

来源：评论

学校读者我要写书评

暂无评论

SHAPE DECOMPOSITION AND REPRESENTATION USING A recursive MORPHOLOGICAL OPERATION

引用

PATTERN RECOGNITION 1995年第11期28卷 1783-1792页

作者： WANG, DM HAESECOAT, V RONSIN, J INST NATL SCI APPL AUTOMAT LABEQUIPE IMAGEF-35043 RENNESFRANCE

This paper presents a recursive morphological operation developed in order to perform efficient shape representation. This operation uses a structuring element as a geometrical primitive to evaluate the shape of an object. It results in a set of loci of the translated structuring elements that are included in the object but which do not overlap. The analysis of its computational complexity shows that it is usually less time-consuming than morphological erosion. By using this operation, an object decomposition algorithm is then developed for shape representation. It decomposes an object into a union of simple and nonoverlapping object components. The object is represented by the sizes and loci of its object components. This representation is information preserving shift and scale invariant, and non-redundant. It has been compared with skeletons, morphological decomposition, chain codes and quatrees in terms of compression ability and image processing facility. Experimental results shows that it is very compact, especially if information loss is allowed. Because of the non-overlap between object components, many image processing tasks can be easily performed by directly using this shape representation.

关键词： SHAPE REPRESENTATION OBJECT DESCRIPTION IMAGE DECOMPOSITION MATHEMATICAL MORPHOLOGY recursive algorithm DATA COMPRESSION IMAGE CODING

来源：评论

学校读者我要写书评

暂无评论

recursive computation of Tchebichef moment and its inverse transform

引用

PATTERN RECOGNITION 2006年第1期39卷 47-56页

作者： Wang, GB Wang, SG Shanghai Jiao Tong Univ Sch Mech Engn Inst Mechatron & Automat Technol Shanghai 200030 Peoples R China

Tchebichef moment is a novel set of orthogonal moment applied in the fields of image analysis and pattern recognition. Less work has been made for the computation of Tchebichef moment and its inverse moment transform. In this paper, both a direct recursive algorithm and a compact algorithm are developed for the computation of Tchebichef moment. The effective recursive algorithm for inverse Tchebichef moment transform is also presented. Clenshaw's recurrence formula was used in this paper to transform kernels of the forward and inverse Tchebichef moment transform. There is no need for the proposed algorithms to compute the Tchebichef polynomial values. The approaches presented are more efficient compared with the straightforward methods, and particularly suitable for parallel VLSI implementation due to their regular and simple filter structures. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

关键词： Tchebichef moment inverse transform recursive algorithm Clenshaw's recurrence

来源：评论

学校读者我要写书评

暂无评论

algorithm for hierarchical vector quantisation of video data

引用

IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING 1999年第4期146卷 222-228页

作者： Cockshott, P Lambert, R Univ Glasgow Dept Comp Sci Glasgow G12 8QQ Lanark Scotland Univ Strathclyde Dept Comp Sci Glasgow G1 1XH Lanark Scotland

A recursive algorithm is presented that is designed to construct quantisation tables and codebooks for the hierarchical vector quantisation of images. The algorithm is computationally inexpensive and yields high quali... 详细信息

关键词： quantisation tables high quality codebooks hierarchical vector quantisation algorithm computationally inexpensive algorithm Video signal processing computational complexity video coding image quantisation video data table lookup Data handling techniques codebooks vector quantisation image compression Image and video coding recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：