Walker et al. ([18], [19]) defined two families of binary operations on M (set of functions of [0,1] in [0,1]), and they determined that, under certain conditions, those operations are t-norms (triangular norm) or t-conorms on L (all the normal and convex functions of M). We define binary operations on M, more general than those given by Walker et al., and we study many properties of these gene...

In this paper we study a generalization of a submeasure notion which is related to a probabilistic concept, especially to Menger spaces where triangular norms play a crucial role. The resulting notion of a τT -submeasure is suitable for modeling those situations in which we have only probabilistic information about the measure of the set. We characterize a class of universal τT -submeasures (i....

We adopt the coding/decoding method of image processing based on the direct and inverse fuzzy transforms defined in previous papers. We have considered 100 images of sizes 256 × 256 (pixels) extracted from the wellknown database Corel Galery (Arizona Directory). A comparison with the coding/decoding method based on the fuzzy relation equations with the Lukasiewicz triangular norm is also presen...

We address the minimum-time guidance problem for the so-called isotropic rocket in the presence of wind under an explicit constraint on the acceleration norm. We consider the guidance problem to a prescribed terminal position and a circular target set with a free terminal velocity in both cases. We employ standard techniques from optimal control theory to characterize the structure of the optim...

We continue to develop a construction of an L-fuzzy valued measure by extending a measure defined on a σalgebra of crisp sets to an L-fuzzy valued measure defined on a TM-tribe in the case when operations with L-sets and L-fuzzy numbers are defined by using the minimum triangular norm TM . We introduce an L-fuzzy valued integral over an L-set with respect to an L-fuzzy valued measure, consider ...

The construction of a smooth surface from an irregular mesh in space is considered. The mesh vertices can either be interpolated or approximated as a control net. A collection of triangular B6zier patches results from a local, affine invariant and visually smooth interpolation scheme that can represent surfaces of arbitrary topological type. It is based on a domain 4-split. Beside the surface c...

This paper extends the author’s earlier work on the Law of Large Numbers for fuzzy numbers [2] to the case where the fuzzy numbers are of type L-R. Namely, we shall define a class of Archimedean triangular norms in which the equality lim n→∞ Nes(mn − ≤ ηn ≤ mn + = 1, for any > 0, holds for all sequences of fuzzy numbers, ξi = (Mi, α, β)LR, i ∈ N, with twice differentiable and concave shape func...

The identification of multivariable state space models in innovation form is solved in a subspace identification framework using convex nuclear norm optimization. The convex optimization approach allows to include constraints on the unknown matrices in the data-equation characterizing subspace identification methods, such as the lower triangular block-Toeplitz of weighting matrices constructed ...

In this paper we introduce a new decomposition called the pivoted QLP decomposition. It is computed by applying pivoted orthogonal triangulariza-tion to the columns of the matrix X in question to get an upper triangular factor R and then applying the same procedure to the rows of R to get a lower triangular matrix L. The diagonal elements of R are called the R-values of X; those of L are called...

We present a family of algorithms for computing symmetric rank-revealing VSV decompositions, based on triangular factorization of the matrix. The VSV decomposition consists of a middle symmetric matrix that reveals the numerical rank in having three blocks with small norm, plus an orthogonalmatrix whose columns span approximations to the numerical range and null space. We show that for semi-de ...