The paper addresses the problem of extending aggregation operators typically defined on [0, 1] to the symmetric interval [−1, 1], where the “0” value plays a particular role (neutral value). We distinguish the cases where aggregation operators are associative or not. In the former case, the “0” value may play the role of neutral or absorbant element, leading to pseudo-addition and pseudo-multip...

The ILIAS system consists of a. sequential language for matrix computations, a compiler translating a. source program into ILIAS pseudo code and a parallel interpreter for this code. The pseudo code is independent of a target architecturej it merely specifies scalar and matrix computations. We present the ILIAS language and discuss its implementation on a square torus network of transputers. Su...

In this paper we first introduce a new multiplication on triangular Banach algebras. Then we study their Arens regularity as well as their topological centers . In this paper we first introduce a new multiplication on triangular Banach algebras. Then we study their Arens regularity as well as their topological centers . In this paper we first introduce a new multiplication on triangular Banach ...

The “x2 mod N” generator, also known as the BBS generator [2], has a strong theoretical foundation from the computational complexity theory and the number theory. Proofs were given that, under certain reasonable assumptions on which modern cryptography heavily relies, the BBS pseudo-random sequences would pass any feasible statistical test. Unfortunately, the algorithm was found to be too slow ...

The accuracy of the multiplication depends on the precision of the multiplier. The variable precision floating point multiplier will have more accuracy when compared with the fixed precision multiplier. In this paper a variable precision floating point multiplier is considered. An effective BIST test pattern generator for variable precision floating point multiplier is proposed. A BIST TPG cons...

The first paper in this series initiated a study of Sylow theory for quasigroups and Latin squares, based on orbits of the left multiplication group. The current paper is based on socalled pseudo-orbits, which are formed by the images of a subset under the set of left translations. The two approaches agree for groups, but differ in the general case. Subsets are described as sectional if the pse...

Let be a module over commutative ring with identity. Before studying the concept of Strongly Pseudo Nearly Semi-2-Absorbing submodule, we need to mention ideal and basics that you study submodule. Also, introduce several characteristics submodule in classes multiplication modules other types modules. We also had no luck because is not ideal. it noted under conditions, which this faithful module...

Commutator properties are established for periodic smoothest splines (on uniform meshes) operated on by certain pseudo-diierential operators. The commutation involves the operations of multiplication by a smooth function, and application of the operator of orthogonal projection onto a spline space; or the orthogonal projection is replaced by a discrete version of orthogonal projection obtained ...

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

A Las Vegas randomized algorithm is given to compute the Hermite normal form of a nonsingular integer matrix dimension n . The uses quadratic multiplication and cubic has running time bounded by O ( 3 (log + log || ||) 2 ) bit operations, where = max ij | denotes largest entry in absolute value. variant that pseudo-linear 1 o (1) exponent `` (1)′′ captures additional factors \(c_1 (\log n)^{c_2...