For a Banach algebra $fA$, we introduce ~$c.c(fA)$, the set of all $phiin fA^*$ such that $theta_phi:fAto  fA^*$ is a completely continuous operator, where $theta_phi$ is defined by $theta_phi(a)=acdotphi$~~ for all $ain fA$. We call $fA$, a completely continuous Banach algebra if $c.c(fA)=fA^*$. We give some examples of completely continuous Banach algebras and a sufficient condition for an o...

In this paper we look at the K-theory of a specific C*-algebra closely related to the irrational rotation algebra. Also it is shown that any automorphism of a C*-algebra A induces group automorphisms of K_{1}(A) amd K_{0}(A) in an obvious way. An interesting problem for any C*-algebra A is to find out whether, given an automorphism of K_{0}(A) and an automorphism of K_{1}(A), we can lift them t...

a heyting algebra is a distributive lattice with implication and a dual $bck$-algebra is an algebraic system having as models logical systems equipped with implication. the aim of this paper is to investigate the relation of heyting algebras between dual $bck$-algebras. we define notions of $i$-invariant and $m$-invariant on dual $bck$-semilattices and prove that a heyting semilattice is equiva...

in this paper we continue development of formal theory of a special class offuzzy logics, called eq-logics. unlike fuzzy logics being extensions of themtl-logic in which the basic connective is implication, the basic connective ineq-logics is equivalence. therefore, a new algebra of truth values calledeq-algebra was developed. this is a lower semilattice with top element endowed with two binary...

It is shown that every  almost linear bijection $h : Arightarrow B$ of a unital $C^*$-algebra $A$ onto a unital$C^*$-algebra $B$ is a $C^*$-algebra isomorphism when $h(3^n u y) = h(3^n u) h(y)$ for allunitaries  $u in A$, all $y in A$, and all $nin mathbb Z$, andthat almost linear continuous bijection $h : A rightarrow B$ of aunital $C^*$-algebra $A$ of real rank zero onto a unital$C^*$-algebra...

There exist many formalisms for modeling the behavior of (software) systems. These formalisms serve different purposes. Process algebras are used for algebraic and axiomatic reasoning about the behavior of distributed systems. UML state machines are suitable for automatic software generation. We have developed a transformation from the process algebra ACP into UML state machines to enable autom...

Based on max-plus algebra, a class of discrete event processes can be described by linear recursive equations[1]. Such a system exhibits asymptotic periodic behavior, and its performance can be evaluated by calculating the eigenvalue of the system matrix in max-plus algebra. On the other hand, control techniques based on switching among different controllers have been explored extensively in re...

In this paper, we give three functors $mathfrak{P}$, $[cdot]_K$ and $mathfrak{F}$ on the category of C$^ast$-algebras. The functor $mathfrak{P}$ assigns to each C$^ast$-algebra $mathcal{A}$ a pre-C$^ast$-algebra $mathfrak{P}(mathcal{A})$ with completion $[mathcal{A}]_K$. The functor $[cdot]_K$ assigns to each C$^ast$-algebra $mathcal{A}$ the Cauchy extension $[mathcal{A}]_K$ of $mathcal{A}$ by ...

Let $A$ be a Banach algebra and $E$ be a Banach $A$-bimodule then $S = A oplus E$, the $l^1$-direct sum of $A$ and $E$ becomes a module extension Banach algebra when equipped with the algebras product $(a,x).(a^prime,x^prime)= (aa^prime, a.x^prime+ x.a^prime)$. In this paper, we investigate $triangle$-amenability for these Banach algebras and we show that for discrete inverse semigroup $S$ with...

Trust models have been touted to facilitate cooperation among unknown entities. Existing behavior-based trust models typically include a fixed evaluation scheme to derive the trustworthiness of an entity from knowledge about its behavior in previous interactions. This paper in turn proposes a framework for behavior-based trust models for open environments with the following distinctive characte...