recursive least squares algorithms for approximation of a multivariate nonlinear function by a fuzzy system guaranteeing monotonicity of the corresponding mapping with respect to individual inputs are presented in thi...
详细信息
ISBN:
(纸本)9781509020515
recursive least squares algorithms for approximation of a multivariate nonlinear function by a fuzzy system guaranteeing monotonicity of the corresponding mapping with respect to individual inputs are presented in this paper. Since the exact solution suffers from high computationally complexity two approximating solutions are presented as well. Two illustrative examples are given to compare the algorithms and to demonstrate the benefit of fuzzy systems preserving monotonicity.
The issues of consistency and minimal parametrization of the prewindowed prediction problem are presented in detail. The paper establishes an equivalence class between the set of p×p symmetric, positive definite ...
详细信息
ISBN:
(纸本)0080417175
The issues of consistency and minimal parametrization of the prewindowed prediction problem are presented in detail. The paper establishes an equivalence class between the set of p×p symmetric, positive definite matrices P and the set of 2×1 stable causal all-pass functions ηp(z) or McMillan degree p. The minimal parametrization of such matrices P is obtained by parametrizing ηp(z), resulting in an inherently consistent parametrization. The application to numerically stable fast least-squares filtering is highlighted.
The study investigates the design and construction processes of masonry domes built without the use of centrings. In particular, it focuses on those built using a 'compass', i.e. an erection device that simpli...
详细信息
ISBN:
(纸本)9788412110104
The study investigates the design and construction processes of masonry domes built without the use of centrings. In particular, it focuses on those built using a 'compass', i.e. an erection device that simplifies the construction process, and guarantees the bricklaying accuracy. The foundation of this research project can be found in the work of Fabrizio Carola (1931-2019) who used an erection method for masonry domes inspired by the 'Nubian vault technique'. The design and construction processes used by Carola have been analyzed with the aim of identifying a sequence of operations, which were then simulated in a digital environment by means of recursive algorithms. Finally, the study moved to the implementation of two bespoke designed contraptions for the design of non-spherical domes. The result of this study is a computational tool which can be used to design different typologies of centring-less masonry domes and simulate their construction process.
The aim of the given paper is the development of optimal and tuned models and ordinary well-known on-line procedures of unknown parameter estimation for inverse systems (IS) using current observations to be processed....
详细信息
This article presents a recursive algorithm for gradient estimation in extreme control systems based on the Kalman filter. The key features of the algorithm is a representation of the dynamic component object model in...
详细信息
ISBN:
(纸本)9781467376983
This article presents a recursive algorithm for gradient estimation in extreme control systems based on the Kalman filter. The key features of the algorithm is a representation of the dynamic component object model in the state space, as well as an approximation of the objective function Taylor series in the area which is close to extremum. Experiments show a relatively high accuracy of the estimation of gradient, as well as good noise immunity of the algorithm.
We present Huckleberry, a tool for automatically generating parallel implementations for multi-core platforms from sequential recursive divide-and-conquer programs. The recursive programming model is a good match for ...
详细信息
ISBN:
(纸本)9783981080162
We present Huckleberry, a tool for automatically generating parallel implementations for multi-core platforms from sequential recursive divide-and-conquer programs. The recursive programming model is a good match for parallel systems because it highlights the temporal and spatial locality of data use. recursive algorithms are used by Huckleberry's code generator not only to automatically divide a problem up into smaller tasks, but also to derive lower-level parts of the implementation, such as data distribution and inter-core synchronization mechanisms. We apply Huckleberry to a multicore platform based on the Cell BE processor and show how it generates parallel code for a variety of sequential benchmarks.
In the field of digital filtering, finite impulse response (FIR) filters are favored for their stable structure and linear phase characteristics. However, since conventional direct-type filters are slow in operation a...
详细信息
ISBN:
(纸本)9798350393613
In the field of digital filtering, finite impulse response (FIR) filters are favored for their stable structure and linear phase characteristics. However, since conventional direct-type filters are slow in operation and require significant hardware resources, many researchers have explored the use of recursive methods to reduce the use of adders in circuits, thereby reducing the hardware cost of digital filters. Among them, the RAG-N algorithm and the BHM algorithm are among the more well-known algorithms in the field. The focus of this study is on the quantization performance of the coefficients of finite impulse response filters and the analysis of coefficient optimization by recursive algorithms. In this paper, the structure of finite impulse response filter optimized by recursive algorithm after 8-bit, 10-bit and 12-bit quantization is firstly designed and demonstrated, and the corresponding simulation model is constructed by using Simulink on this basis. The final results show that although heuristic optimization algorithms like RAG-N and BHM can significantly reduce the use of hardware resources, the computational time of these algorithms may increase as the number of quantization bits increases, which may have an impact on the circuit design due to the increase in the logic depth and the increase in the path delay. Therefore, future research should pay more attention to these issues to improve the performance and efficiency of FIR filters.
The process of optimization of chemical/ biochemical processes can often involve multiple conflicting objectives. This gives rise to a class of problems called multi-objective optimization problems. Solving such probl...
详细信息
The process of optimization of chemical/ biochemical processes can often involve multiple conflicting objectives. This gives rise to a class of problems called multi-objective optimization problems. Solving such problems results in an infinite set of points, the Pareto set, which includes all the solutions in which no objective can be improved without worsening at least one other objective. In this paper, we propose a new strategy that is inspired by branching phenomena in nature for exploring the objective space to obtain a representation of the Pareto set. The algorithm starts from a single point in the objective space, and systematically constructs branches towards the Pareto front by solving correspondingly-modified subproblems. This process continues till points that lie at the Pareto front are obtained. This way, it ensures that no region in the objective space gets explored more than a single time. Additionally, using a proximity parameter, the branches density can be controlled, consequently leading to controlling the resolution of the Pareto front. The proposed method has been applied to a numerical bi-objective optimization problem as well as the problem of the bi-objective control of a William-Otto reactor. Results show that the new algorithm has managed to obtain a Pareto front with adaptive resolution where the areas with high trade-offs are represented with higher points density. Copyright (c) 2022 The Authors. This is an open access article under the CC BY-NC-ND license(https://***/licenses/by-nc-nd/4.0/)
The paper describes a recent progress in searching for credible, well-grounded approximation of recursive Bayesian parameter estimation which would make the Bayesian paradigm feasible for a class of nonstandard (non-l...
详细信息
ISBN:
(纸本)0080417175
The paper describes a recent progress in searching for credible, well-grounded approximation of recursive Bayesian parameter estimation which would make the Bayesian paradigm feasible for a class of nonstandard (non-linear and/or non-Gaussian) models. The presented method is based on maximum-entropy approximation of the empirical distribution of data while just a reduced (non-sufficient) data statistic is available. The statistic is chosen so to induce an equivalence relation on the set of posterior probability distributions which is compatible with the Bayes-rule action. The approximating posterior density of unknown parameters is given by the standard Bayes-rule transformation of the approximating distribution of data. Numerical implementation of the general algorithm is considered using its discrete version or prior approximation of critical steps.
暂无评论