In last ten years many mathematicians have studied properties of BL-algebras endowed with a topology. For example A. Di Nola and L. Leustean cite{dn} studied compact representations of BL-algebras, L. C. Ciungu cite{ciu} investigated some concepts of convergence in the class of perfect BL-algebras, J. Mi Ko and Y. C. Kim cite{jun} studied relationships between closure operators and BL-algebras,...

In this paper, we first derive some results by using the Gelfand spectrum and spectrum in FLM algebras. Then, the characterizations of multiplicative linear mappings are also discussed in these algebras.

The paper presents a modification of the Frechet distance for nonisomorphic trees. While classical between trees is undefined, new measure called similarity tree to reference given that defined wider class A polynomial-time algorithm determine whether one tree’s another less than number.

The notion of $f$-derivations of UP-algebras is introduced, some useful examples are discussed, and related properties are investigated. Moreover, we show that the fixed set and the kernel of $f$-derivations are UP-subalgebras of UP-algebras,and also give examples to show that the two sets are not UP-ideals of UP-algebras in general.

 We study the notion of bounded approximate Connes-amenability for‎ ‎dual Banach algebras and characterize this type of algebras in terms‎ ‎of approximate diagonals‎. ‎We show that bounded approximate‎ ‎Connes-amenability of dual Banach algebras forces them to be unital‎. ‎For a separable dual Banach algebra‎, ‎we prove that bounded‎ ‎approximate Connes-amenability implies sequential approximat...

Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Function (ODF) is used to describe the probability of the fiber direction. Fisher information metric has been constructed for probability density family in Information Geometry theory and it has been successfully applied fo...

In this paper, we propose a novel technique for post-layout delay optimization. This technique identi es the Boolean space corresponding to late arriving transitions at the outputs of delay-critical subcircuits within the given circuit. There transitions are eliminated from the outputs by implementing the corresponding logic separately and merging them with the original circuit through some con...