the purpose of this paper is to introduce the concept of l-fuzzybilinear operators. we obtain a decomposition theorem for l-fuzzy bilinearoperators and then prove that a l-fuzzy bilinear operator is the same as apowerset operator for the variable-basis introduced by s.e.rodabaugh (1991).finally we discuss the continuity of l-fuzzy bilinear operators.

This paper demonstrates the redundancies concerning the increasing popular ``soft set" approaches to general topologies. It is shown that there is a complement preserving isomorphism (preserving arbitrary $widetilde{bigcup}$ and arbitrary $widetilde{bigcap}$) between the lattice ($mathcal{ST}_E(X,E),widetilde{subset}$) of all soft sets on $X$ with the whole parameter set $E$ as domains and the ...

‎let $x,y$ be normed spaces with $l(x,y)$ the space of continuous‎ ‎linear operators from $x$ into $y$‎. ‎if ${t_{j}}$ is a sequence in $l(x,y)$,‎ ‎the (bounded) multiplier space for the series $sum t_{j}$ is defined to be‎ [ ‎m^{infty}(sum t_{j})={{x_{j}}in l^{infty}(x):sum_{j=1}^{infty}%‎ ‎t_{j}x_{j}text{ }converges}‎ ‎]‎ ‎and the summing operator $s:m^{infty}(sum t_{j})rightarrow y$ associat...

Weighted composition operators appear in the study of dynamical systems and also in characterizing isometries of some classes of Banach spaces. One of the most important generalizations of weighted composition operators, are generalized weighted composition operators which in special cases of their inducing functions give different types of well-known operators like: weighted composition operat...

The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of a monad (powerset and distribution), in an obvious manner. It is shown that also quantum walks are coalgebras of a new monad, involving additional control structure. This new monad is also used to describe Turing mac...

Storytelling is seen as an effective tool to facilitate the transfer of knowledge. There are a number of story construction frameworks andits applications to construct knowledge stories in current literature but there the assessment of these applications and framework have not been emphasized. This paper presents the assessment of a story construction framework that is used as guide by construc...

ABSTRACT Speech recognition requires solving many space and time problems that can have a critical effect on the overall system performance. We describe the use of two general new algorithms [5] that transform recognition networks into equivalent ones that require much less time and space in large-vocabulary speech recognition. The new algorithms generalize classical automata determinization an...

We have been exploring the use of Web-derived knowledge bases through the development of Wikitology a hybrid knowledge base of structured and unstructured information extracted from Wikipedia augmented by RDF data from DBpedia and other Linked Open Data resources. In this paper, we describe approaches that aid in enriching Wikipedia and thus the resources that derive from Wikipedia such as the ...

We study the construction of preorders on Set-monads by the semantic ⊤⊤-lifting. We show the universal property of this construction, and characterise the class of preorders on a monad as a limit of a Card-chain. We apply these theoretical results to identifying preorders on some concrete monads, including the powerset monad, maybe monad, and their composite monad. We also relate the constructi...

In this paper, we have established bi-approximation semantics for lattice-based logics with the De Morgan negation (unbounded orthologic), and their morphisms. In addition, we have discussed the dual representation between unbounded ortholattices with strict homomorphisms and polarity frames and d-morphisms. Apart from the abstract construction of dual algebras in the series of the present auth...