On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An algorithm for the divisors of monic polynomials over a commutative ring

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R₀ ⊕ … ⊕ R_m (m ≤ deg f), associated to a fundamental system of idempotents e₀, … , e_m, such that the component of f in each R_i[X] has degree coefficient which is a unit of R_i. We propose to give an algorithm to explicitly find such a decomposition. Moreover, we extend this result to divisors of doubly monic Laurent polynomials.     

Prederivations of Lie Algebras and Isometries of Bi-invariant Lie Group

Lie groups with bi-invariant semi-Riemannian metrics are considered. We study the decomposition of the algebra of prederivations of a direct sum of Lie algebras and derive some results on the isotropy group of a bi-invariant product Lie group. We also give necessary and sufficient conditions to ensure that all isometries of a complex Lie group, endowed with a bi-invariant Norden metric, are holomorphic.     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.     

具有奇异值分解性质的代数

设F为一个域,R为一个带有对合的F-代数,如果R上每一个矩阵都有奇异值分解(简称SVD),则称R为一个有SVD性质的F-代数.本文指出:R为一个有SVD性质的F-代数的充要条件是:R同构于R~+,或R~+上二次扩域,或R~+上四元数体((-1,-1)/R~+),其中R~+为R的对称元集合,并且R~+为一个Galois序闭域.     

THE RADICALS OF HOPF MODULE ALGEBRAS

ＴＨＥＲＡＤＩＣＡＬＳＯＦＨＯＰＦＭＯＤＵＬＥＡＬＧＥＢＲＡＳＺＨＡＮＧＳＨＯＵＣＨＵＡＮ＊ＡｂｓｔｒａｃｔＴｈｅｃｈａｒａｃｔｅｒｉｚａｔｉｏｎｏｆＨ－ｐｒｉｍｅｒａｄｉｃａｌｉｓｇｉｖｅｎｉｎｍａｎｙｗａｙｓ．Ｍｅａｎｔｉｍｅ，ｔｈｅｒｅｌａｔｉ...     

Topological Simplicity of a Certain LF-Algebra

We show that the LF-algebra considered by Akkar and Nacir in [1] is topologically simple.     

Interpolation of positive operators

We study problems of interpolation of positive linear operators in couples of ordered Banach spaces. From this viewpoint, we study couples of noncommutative spaces L ₁, L _∞ associated with weights and traces on von Neumann algebras.     

在可交换四元数空间中的双曲方程的特征边值问题

讨论了一阶和二阶双曲复方程的特征边值问题.对其中两种线性方程,分别在不同的情况下获得通解和可解条件.而对于拟线性的二阶双曲复方程,证明了解的存在性和唯一性.     

A parametric representation of linguistic hedges in Zadeh’s fuzzy logic

This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced.