We study observables as r-D-homomorphisms de®ned on Boolean D-posets of subsets into a Boolean Dposet. We show that given an atomic r-complete Boolean D-poset P with the countable set of atoms there exist a r-complete Boolean D-poset of subsets S and a r-D-homomorphism h from S onto P, more precisely we can choose S ˆ B…R†, which gives an analogy of the Loomis± Sikorski representation theorem f...

introduction drastic model is an index and overlapping model that has been designed for producing vulnerability scores for different points by combining several thematic layers. overlapping distinguished methods are themost applicable methods for evaluatingvulnerability of aquifers because they are cheap, they can directly reach a defined goal, the used data in the methods are accessible or can...

Abstract— Sequential circuits are the important components of a computer system as they process binary data and buffers binary output for the next period.. Sequential circuits are the interconnection of logic gates and Flip Flops and the buffering of binary output for the next period is carried out by the Flip Flops by their inherent feedback mechanism. Sequential circuits basically process bin...

Fuzzy Boolean Networks are Boolean networks with nature like characteristics, such as organization of neurons on cards or areas, random individual connections, structured meshes of links between cards. They also share with natural systems some interesting properties: relative noise immunity, capability of approximate reasoning and learning from sets of experiments. An interesting problem relate...

Based on the idea that the closer the query terms are in a document, the more relevant this document is, we experiment an IR method based on a fuzzy proximity degree of the query term occurences in a document to compute its relevance to the query. Our model is able to deal with Boolean queries, but contrary to the traditional extensions of the basic Boolean IR model, it does not explicitly use ...

different industrial decision makers and managers in our country, try to select and organize locations for aggregating industrial units, estates and areas with respect to land use planning visions and industrial development strategies. in this regard, considering large quantity of the input data and diverse criteria affecting this application, it is complicated and difficult to optimally make d...

Aim of this paper is to address the problem of learning Boolean functions from training data with missing values. We present an extension of the BRAIN algorithm, called U-BRAIN (Uncertainty-managing Batch Relevancebased Artificial INtelligence), conceived for learning DNF Boolean formulas from partial truth tables, possibly with uncertain values or missing bits. Such an algorithm is obtained fr...

Barycentric algebras have seen widespread application in the modeling of convex sets, semilattices, and quantum mechanics. Recently, they were developed further to encompass Boolean logic and if-then-else algebras. This paper discusses an application of barycentric algebras to systems biology. Here, they provide a calculus for the conversion from simplified Boolean models of gene transcription ...

Based on the idea that the closer the query terms in a document are, the more relevant this document is, we propose a information retrieval method based on a fuzzy proximity degree of term occurences to compute document relevance to a query. Our model is able to deal with Boolean queries, but contrary to the traditional extensions of the basic Boolean information retrieval model, it does not ex...