Multi-wavelets from B-spline super-functions with approximation order

Approximation order is an important feature of all wavelets. It implies that polynomials up to degree p−1 are in the space spanned by the scaling function(s). In the scalar case, the scalar sum rules determine the approximation order or the left eigenvectors of the infinite down-sampled convolution matrix H determine the combinations of scaling functions required to produce the desired polynomial. For multi-wavelets the condition for approximation order is similar to the conditions in the scalar case. Generalized left eigenvectors of the matrix H_f; a finite portion of H determines the combinations of scaling functions that produce the desired superfunction from which polynomials of desired degree can be reproduced. The superfunctions in this work are taken to be B-splines. However, any refinable function can serve as the superfunction. The condition of approximation order is derived and new, symmetric, compactly supported and orthogonal multi-wavelets with approximation orders one, two, three and four are constructed.

Generalized Bonferroni mean operators in multi-criteria aggregation

In this paper we provide a systematic investigation of a family of composed aggregation functions which generalize the Bonferroni mean. Such extensions of the Bonferroni mean are capable of modeling the concepts of hard and soft partial conjunction and disjunction as well as that of k-tolerance and k-intolerance. There are several interesting special cases with quite an intuitive interpretation for application.

Construction of wavelets and multiwavelets basis : a generalized method

Multiwavelets are wavelets with multiplicity r, that is r scaling functions and r wavelets, which define multiresolution analysis similar to scalar wavelets. They are advantageous over scalar wavelets since they simultaneously posse symmetry and orthogonality. In this work, a new method for constructing multiwavelets with any approximation order is presented. The method involves the derivation of a matrix equation for the desired approximation order. The condition for approximation order is similar to the conditions in the scalar case. Generalized left eigenvectors give the combinations of scaling functions required to reconstruct the desired spline or super function. The method is demonstrated by constructing a specific class of symmetric and non-symmetric multiwavelets with different approximation orders, which include Geranimo-Hardin-Massopust (GHM), Daubechies and Alperts like multi-wavelets, as parameterized solutions. All multi-wavelets constructed in this work, posses the good properties of orthogonality, approximation order and short support.

On extending generalized Bonferroni means to Atanassov orthopairs in decision making contexts

Extensions of aggregation functions to Atanassov orthopairs (often referred to as intuitionistic fuzzy sets or AIFS) usually involve replacing the standard arithmetic operations with those defined for the membership and non-membership orthopairs. One problem with such constructions is that the usual choice of operations has led to formulas which do not generalize the aggregation of ordinary fuzzy sets (where the membership and non-membership values add to 1). Previous extensions of the weighted arithmetic mean and ordered weighted averaging operator also have the absorbent element 〈1,0〉, which becomes particularly problematic in the case of the Bonferroni mean, whose generalizations are useful for modeling mandatory requirements. As well as considering the consistency and interpretability of the operations used for their construction, we hold that it is also important for aggregation functions over higher order fuzzy sets to exhibit analogous behavior to their standard definitions. After highlighting the main drawbacks of existing Bonferroni means defined for Atanassov orthopairs and interval data, we present two alternative methods for extending the generalized Bonferroni mean. Both lead to functions with properties more consistent with the original Bonferroni mean, and which coincide in the case of ordinary fuzzy values.

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.

Modelling grouped survival times in toxicological studies using generalized additive models

A method for combining a proportional-hazards survival time model with a bioassay model where the log-hazard function is modelled as a linear or smoothing spline function of log-concentration combined with a smoothing spline function of time is described. The combined model is fitted to mortality numbers, resulting from survival times that are grouped due to a common set of observation times, using Generalized Additive Models (GAMs). The GAM fits mortalities as conditional binomials using an approximation to the log of the integral of the hazard function and is implemented using freely-available, general software for fitting GAMs. Extensions of the GAM are described to allow random effects to be fitted and to allow for time-varying concentrations by replacing time with a calibrated cumulative exposure variable with calibration parameter estimated using profile likelihood. The models are demonstrated using data from a studies of a marine and a, previously published, freshwater taxa. The marine study involved two replicate bioassays of the effect of zinc exposure on survival of an Antarctic amphipod, Orchomenella pinguides. The other example modelled survival of the daphnid, Daphnia magna, exposed to potassium dichromate and was fitted by both the GAM and the process-based DEBtox model. The GAM fitted with a cubic regression spline in time gave a 61 % improvement in fit to the daphnid data compared to DEBtox due to a non-monotonic hazard function. A simulation study using each of these hazard functions as operating models demonstrated that the GAM is overall more accurate in recovering lethal concentration values across the range of forms of the underlying hazard function compared to DEBtox and standard multiple endpoint probit analyses.

Weakly monotonic averaging functions

Monotonicity with respect to all arguments is fundamental to the definition of aggregation functions. It is also a limiting property that results in many important nonmonotonic averaging functions being excluded from the theoretical framework. This work proposes a definition for weakly monotonic averaging functions, studies some properties of this class of functions, and proves that several families of important nonmonotonic means are actually weakly monotonic averaging functions. Specifically, we provide sufficient conditions for weak monotonicity of the Lehmer mean and generalized mixture operators. We establish weak monotonicity of several robust estimators of location and conditions for weak monotonicity of a large class of penalty-based aggregation functions. These results permit a proof of the weak monotonicity of the class of spatial-tonal filters that include important members such as the bilateral filter and anisotropic diffusion. Our concept of weak monotonicity provides a sound theoretical and practical basis by which (monotonic) aggregation functions and nonmonotonic averaging functions can be related within the same framework, allowing us to bridge the gap between these previously disparate areas of research.