Fitting fuzzy measures by linear programming. Programming library fmtools

We discuss the problem of learning fuzzy measures from empirical data. Values of the discrete Choquet integral are fitted to the data in the least absolute deviation sense. This problem is solved by linear programming techniques. We consider the cases when the data are given on the numerical and interval scales. An open source programming library which facilitates calculations involving fuzzy measures and their learning from data is presented.

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 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.

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.

Using linear programming for weights identification of generalized bonferroni means in R

The generalized Bonferroni mean is able to capture some interaction effects between variables and model mandatory requirements. We present a number of weights identification algorithms we have developed in the R programming language in order to model data using the generalized Bonferroni mean subject to various preferences. We then compare its accuracy when fitting to the journal ranks dataset.

Rapid determination of protein contents in microencapsulated fish oil supplements by ATR-FTIR spectroscopy and partial least square regression (PLSR) analysis

Following the recent success in quantitative analysis of essential fatty acid compositions in a commercial microencapsulated fish oil (?EFO) supplement, we extended the application of portable attenuated total reflection Fourier transform infrared (ATR-FTIR) spectroscopic technique and partial least square regression (PLSR) analysis for rapid determination of total protein contents-the other major component in most commercial ?EFO powders. In contrast to the traditional chromatographic methodology used in a routine amino acid analysis (AAA), the ATR-FTIR spectra of the ?EFO powder can be acquired directly from its original powder form with no requirement of any sample preparation, making the technique exceptionally fast, noninvasive, and environmentally friendly as well as being cost effective and hence eminently suitable for routine use by industry. By optimizing the spectral region of interest and number of latent factors through the developed PLSR strategy, a good linear calibration model was produced as indicated by an excellent value of coefficient of determination R2 = 0.9975, using standard ?EFO powders with total protein contents in the range of 140-450 mg/g. The prediction of the protein contents acquired from an independent validation set through the optimized PLSR model was highly accurate as evidenced through (1) a good linear fitting (R2 = 0.9759) in the plot of predicted versus reference values, which were obtained from a standard AAA method, (2) lowest root mean square error of prediction (11.64 mg/g), and (3) high residual predictive deviation (6.83) ranked in very good level of predictive quality indicating high robustness and good predictive performance of the achieved PLSR calibration model. The study therefore demonstrated the potential application of the portable ATR-FTIR technique when used together with PLSR analysis for rapid online monitoring of the two major components (i.e., oil and protein contents) in finished ?EFO powders in the actual manufacturing setting.

New variable step-sizes minimizing mean-square deviation for the lms-type algorithms

The least-mean-square-type (LMS-type) algorithms are known as simple and effective adaptation algorithms. However, the LMS-type algorithms have a trade-off between the convergence rate and steady-state performance. In this paper, we investigate a new variable step-size approach to achieve fast convergence rate and low steady-state misadjustment. By approximating the optimal step-size that minimizes the mean-square deviation, we derive variable step-sizes for both the time-domain normalized LMS (NLMS) algorithm and the transform-domain LMS (TDLMS) algorithm. The proposed variable step-sizes are simple quotient forms of the filtered versions of the quadratic error and very effective for the NLMS and TDLMS algorithms. The computer simulations are demonstrated in the framework of adaptive system modeling. Superior performance is obtained compared to the existing popular variable step-size approaches of the NLMS and TDLMS algorithms. © 2014 Springer Science+Business Media New York.

Absolute freedom and major structural change

Comments on the contribution of philosopher Slavoj Zizek to the reception of the works of psychoanalyst Jacques Lacan in universities. Analysis of philosophy, religion, politics and society; Notion of an act of absolute freedom; Consequences of an act.

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.

Least squares splines with free knots: global optimization approach

Splines with free knots have been extensively studied in regard to calculating the optimal knot positions. The dependence of the accuracy of approximation on the knot distribution is highly nonlinear, and optimisation techniques face a difficult problem of multiple local minima. The domain of the problem is a simplex, which adds to the complexity. We have applied a recently developed cutting angle method of deterministic global optimisation, which allows one to solve a wide class of optimisation problems on a simplex. The results of the cutting angle method are subsequently improved by local discrete gradient method. The resulting algorithm is sufficiently fast and guarantees that the global minimum has been reached. The results of numerical experiments are presented.

Double jeopardy in Australia: the illusion of an absolute protection and the prosecution process as punishment

Outline of the nature and scope of the double jeopardy principle as it operates in the pleas in the bar and the court's discretion to prevent an abuse of the process - rationales advanced in favour of doctrine - some anomalies and implications from the claim that the double jeopardy principle is absolute - some suggestions for reform.

The cost of storing checkpoints to multiple volatile storage locations using at-least-k semantics

Using the volatile memory of other computers within a system to store checkpoints is an alternative to the traditional approach of using stable storage. The objective of this study is to develop a storage mechanism using at-least-k delivery semantics. This semantics allows data to be saved to a minimum number of computers simultaneously using group communications, without requiring that each group computer successfully acknowledge the receipt. The new storage mechanism is implemented in the GENESIS checkpointing facility v2.0. The results showed that at-least-k storage mechanisms provide low storage latency times; however, the incurred execution overheads on the applications executing within the system are higher than that when using remote stable storage to store checkpoints.

Hyperstereopsis in helmet-mounted NVDs : absolute distance perception

Modern helmet-mounted night vision devices, such as the Thales TopOwl helmet, project imagery from intensifiers mounted on the side of the helmet onto the helmet faceplate. The increased separation of the cameras induces hyperstereopsis - the exaggeration of the stereoscopic disparities that support the perception of relative depth around the point of fixation. Increased camera separation may also affect absolute depth perception, because it increases the amount of vergence (crossing) of the eyes required for binocular fusion, and because the differential perspective from the viewpoints of the two eyes is increased. The effect of hyperstereopsis on the perception of absolute distance was investigated using a large-scale stereoscopic display system. A fronto-parallel textured surface was projected at a distance of 6 metres. Three stereoscopic viewing conditions were simulated - hyperstereopsis (four times magnification), normal stereopsis, and hypostereopsis (one quarter magnification). The apparent distance of the surface was measured relative to a grid placed in a virtual "leaf room" that provided rich monocular cues, such as texture gradients and linear perspective, to absolute distance as well as veridical sterescopic disparity cues. The different stereoscopic viewing conditions had no differential effect on the apparent distance of the textured surface at this viewing distance

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.