Results 11 to 20 of about 467,015 (135)
Linear maps on real C* - algebras and related structures [PDF]
PhDIn this thesis we obtain new results on the structures of real C*-algebras and nonsurjective isometries between them. Some of the results have been published in [1].
Apazoglou, Maria
core +4 more sources
Inference of a probabilistic Boolean network from a single observed temporal sequence [PDF]
The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs) from observed temporal sequences of network states.
Xiao, Y. +3 more
core +4 more sources
Monoids with tests and the algebra of possibly non-halting programs [PDF]
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Marcel Jackson +3 more
core +1 more source
A note on idempotent semirings [PDF]
For a commutative semiring $S$, by an $S$-algebra we mean a commutative semiring $A$ equipped with a homomorphism $S\to A$. We show that the subvariety of $S$-algebras determined by the identities $1+2x=1$ and $x^2=x$ is closed under non-empty colimits ...
Manuela Sobral, George Janelidze
doaj +1 more source
Inferring context-sensitive probablistic boolean networks from gene expression data under multi-biological conditions [PDF]
In recent years biological microarrays have emerged as a high-throughput data acquisition technology in bioinformatics. In conjunction with this, there is an increasing need to develop frameworks for the formal analysis of biological pathways. A modeling
Marshall, Stephen, Yu, Le
core +4 more sources
Recently, the concept of r-ideal was introduced in a commutative ring and also in a commutative semigroup. Here, we provide a similar definition for r-ideal in a frame and investigate someof its properties.
Ali Akbar Estaji +2 more
doaj +1 more source
Quantum algorithms for testing and learning Boolean functions [PDF]
We discuss quantum algorithms based on the Bernstein-Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2(n) possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein-
Floess, Dominik +2 more
core +1 more source
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang +9 more
core +1 more source
Criterion for the cosemanticness of the Abelian groups in the enriched signature
In the present paper we give a criterion of the cosemanticness relative to the Jonsson spectrum of the model in the class of Abelian groups with a distinguished predicate.
A.R. Yeshkeyev +2 more
doaj +1 more source
0-Hecke Algebra Action on the Stanley-Reisner Ring of the Boolean Algebra [PDF]
We define an action of the $0$-Hecke algebra of type A on the Stanley-Reisner ring of the Boolean algebra. By studying this action we obtain a family of multivariate noncommutative symmetric functions, which specialize to the noncommutative Hall-Littlewood symmetric functions and their $(q,t)$-analogues introduced by Bergeron and Zabrocki.
openaire +7 more sources

