Linear approximation of Karnik-Mendel type reduction algorithm

Karnik-Mendel (KM) algorithm is the most used and researched type reduction (TR) algorithm in literature. This algorithm is iterative in nature and despite consistent long term effort, no general closed form formula has been found to replace this computationally expensive algorithm. In this research work, we demonstrate that the outcome of KM algorithm can be approximated by simple linear regression techniques. Since most of the applications will have a fixed range of inputs with small scale variations, it is possible to handle those complexities in design phase and build a fuzzy logic system (FLS) with low run time computational burden. This objective can be well served by the application of regression techniques. This work presents an overview of feasibility of regression techniques for design of data-driven type reducers while keeping the uncertainty bound in FLS intact. Simulation results demonstrates the approximation error is less than 2%. Thus our work preserve the essence of Karnik-Mendel algorithm and serves the requirement of low
computational complexities.

Geometry and combinatorics of the cutting angle method

Lower approximation of Lipschitz functions plays an important role in deterministic global optimization. This article examines in detail the lower piecewise linear approximation which arises in the cutting angle method. All its local minima can be explicitly enumerated, and a special data structure was designed to process them very efficiently, improving previous results by several orders of magnitude. Further, some geometrical properties of the lower approximation have been studied, and regions on which this function is linear have been identified explicitly. Connection to a special distance function and Voronoi diagrams was established. An application of these results is a black-box multivariate random number generator, based on acceptance-rejection approach.

Review of approximate analyses of sheet forming processes

Approximate models are often used for the following purposes: in on-line control systems of metal forming processes where calculation speed is critical; to obtain quick, quantitative information on the magnitude of the main variables in the early stages of process design; to illustrate the role of the major variables in the process; as an initial check on numerical modelling; and as a basis for quick calculations on processes in teaching and training packages. The models often share many similarities; for example, an arbitrary geometric assumption of deformation giving a simplified strain distribution, simple material property descriptions - such as an elastic, perfectly plastic law - and mathematical short cuts such as a linear approximation of a polynomial expression. In many cases, the output differs significantly from experiment and performance or efficiency factors are developed by experience to tune the models. In recent years, analytical models have been widely used at Deakin University in the design of experiments and equipment and as a pre-cursor to more detailed numerical analyses. Examples that are reviewed in this paper include deformation of sandwich material having a weak, elastic core, load prediction in deep drawing, bending of strip (particularly of ageing steel where kinking may occur), process analysis of low-pressure hydroforming of tubing, analysis of the rejection rates in stamping, and the determination of constitutive models by an inverse method applied to bending tests.

Monotone approximation of aggregation operators using least squares splines

The need for monotone approximation of scattered data often arises in many problems of regression, when the monotonicity is semantically important. One such domain is fuzzy set theory, where membership functions and aggregation operators are order preserving. Least squares polynomial splines provide great flexbility when modeling non-linear functions, but may fail to be monotone. Linear restrictions on spline coefficients provide necessary and sufficient conditions for spline monotonicity. The basis for splines is selected in such a way that these restrictions take an especially simple form. The resulting non-negative least squares problem can be solved by a variety of standard proven techniques. Additional interpolation requirements can also be imposed in the same framework. The method is applied to fuzzy systems, where membership functions and aggregation operators are constructed from empirical data.

Identification of general aggregation operators by Lipschitz approximation

Aggregation operators model various operations on fuzzy sets, such as conjunction, disjunction and aver aging. The choice of aggregation operators suitable for a particular problem is frequently done by fitting the parameters of the operator to the observed data. This paper examines fitting general aggregation operators by using a new method of Lipschitz approximation.

OWA operators in linear regression and detection of outliers

We consider the use of Ordered Weighted Averaging (OWA) in linear regression. Our goal is to replace the traditional least squares, least absolute deviation, and maximum likelihood criteria with an OWA function of the residuals. We obtain several high breakdown robust regression methods as special cases (least median, least trimmed squares, trimmed likelihood methods). We also present new formulations of regression problem. OWA-based regression is particularly useful in the presence of outliers.

Methods of construction of OWA operators from data

This paper investigates the problem of obtaining the weights of the ordered weighted aggregation (OWA) operators from observations. The problem is formulated as a restricted least squares and uniform approximation problems. We take full advantage of the linearity of the problem. In the former case, a well known technique of non-negative least squares is used. In a case of uniform approximation, we employ a recently developed cutting angle method of global optimisation. Both presented methods give results superior to earlier approaches, and do not require complicated nonlinear constructions. Additional restrictions, such as degree of orness of the operator, can be easily introduced

Identification of general and double aggregation operators using monotone smoothing

Aggregation operators model various operations on fuzzy sets, such as conjunction, disjunction and averaging. Recently double aggregation operators have been introduced; they model multistep aggregation process. The choice of aggregation operators depends on the particular problem, and can be done by fitting the operator to empirical data. We examine fitting general aggregation operators by using a new method of monotone Lipschitz smoothing. We study various boundary conditions and constraints which determine specific types of aggregation.

Shape preserving approximation using least squares splines

Least squares polynomial splines are an effective tool for data fitting, but they may fail to preserve essential properties of the underlying function, such as monotonicity or convexity. The shape restrictions are translated into linear inequality conditions on spline coefficients. The basis functions are selected in such a way that these conditions take a simple form, and the problem becomes non-negative least squares problem, for which effecitive and robust methods of solution exist. Multidimensional monotone approximation is achieved by using tensor-product splines with the appropriate restrictions. Additional inter polation conditions can also be introduced. The conversion formulas to traditional B-spline representation are provided.

Pointwise construction of Lippschitz aggregation operators with specific properties

This paper describes an approach to pointwise construction of general aggregation operators, based on monotone Lipschitz approximation. The aggregation operators are constructed from a set of desired values at certain points, or from empirically collected data. It establishes tight upper and lower bounds on Lipschitz aggregation operators with a number of different properties, as well as the optimal aggregation operator, consistent with the given values. We consider conjunctive, disjunctive and idempotent n-ary aggregation operators; p-stable aggregation operators; various choices of the neutral element and annihilator; diagonal, opposite diagonal and marginal sections; bipolar and double aggregation operators. In all cases we provide either explicit formulas or deterministic numerical procedures to determine the bounds. The findings of this paper are useful for construction of aggregation operators with specified properties, especially using interpolation schemata.

Construction of aggregation functions from data using linear programming

This article examines the construction of aggregation functions from data by minimizing the least absolute deviation criterion. We formulate various instances of such problems as linear programming problems. We consider the cases in which the data are provided as intervals, and the outputs ordering needs to be preserved, and show that linear programming formulation is valid for such cases. This feature is very valuable in practice, since the standard simplex method can be used.

OWA operators in regression problems

We consider an application of fuzzy logic connectives to statistical regression. We replace the standard least squares, least absolute deviation, and maximum likelihood criteria with an ordered weighted averaging (OWA) function of the residuals. Depending on the choice of the weights, we obtain the standard regression problems, high-breakdown robust methods (least median, least trimmed squares, and trimmed likelihood methods), as well as new formulations. We present various approaches to numerical solution of such regression problems. OWA-based regression is particularly useful in the presence of outliers, and we illustrate the performance of the new methods on several instances of linear regression problems with multiple outliers.

A state space based approach in non-linear hemodynamic response modeling with fMRI data

In this paper we use the modified and integrated version of the balloon model in the analysis of fMRI data. We propose a new state space model realization for this balloon model and represent it with the standard A,B,C and D matrices widely used in system theory. A second order Padé approximation with equal numerator and denominator degree is used for the time delay approximation in the modeling of the cerebral blood flow. The results obtained through numerical solutions showed that the new state space model realization is in close agreement to the actual modified and integrated version of the balloon model. This new system theoretic formulation is likely to open doors to a novel way of analyzing fMRI data with real time robust estimators. With further development and validation, the new model has the potential to devise a generalized measure to make a significant contribution to improve the diagnosis and treatment of clinical scenarios where the brain functioning get altered. Concepts from system theory can readily be used in the analysis of fMRI data and the subsequent synthesis of filters and estimators.

Use of artificial neural networks as explicit finite difference operators

Results of a numerical exercise, substituting a numerical operator by an artificial neural network (ANN) are presented in this paper. The numerical operator used is the explicit form of the finite difference (FD) scheme. The FD scheme was used to discretize the one-dimensional transport equation, which included both the advection and dispersion terms. Inputs to the ANN are the FD representation of the transport equation, and the concentration was designated as the output. Concentration values used for training the ANN were obtained from analytical solutions. The numerical operator was reconstructed from a back calculation of the weights of the ANN. Linear transfer functions were used for this purpose. The ANN was able to accurately recover the velocity used in the training data, but not the dispersion coefficient. This capability was improved when numerical dispersion was taken into account; however, it is limited to the condition: C/P<0.5 , where C is the Courant number and P , the Peclet number (i.e., the restriction imposed by the Neumann stability condition).