In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model,...

The expressiveness of Boolean Algebras is significantly extended by the Boolean Differential Calculus (BDC). The additionally defined differentials of Boolean variables, differentials and further differential operators of Boolean functions as well as several derivative operations of Boolean functions allow to model changes of function values together with changes of the values of variables and ...

Optimal Positioning of Middle Schools within the City of Dehdasht through a Combination of Boolean Logic and FAHP M.A. Firoozi, Ph.D. P. Rahmaani N. Hosseini Shahpariyaan M. Fereydoonnejaad Optimal positioning of schools is of much interest to planners because the rapid increase in population and structural changes within the cities could lead to distribution problems if not fo...

We consider an n-ary random Boolean function f such that Pr[f(α̃) = 1] = p for α̃ ∈ {0, 1} and study its geometric model, the so called interval graph. The interval graph of a Boolean function was introduced by Sapozhenko and has been used in construction of schemes realizing Boolean functions. Using this model, we estimate the number of maximal intervals intersecting a given maximal interval of ...

In the first part of this Thesis we develop the theory of locally boolean domains and bistable maps (as introduced in [Lai05b]) and show that the category of locally boolean domains and bistable maps is equivalent to the category of Curien-Lamarche games and observably sequential functions (cf. [CCF94]). Further we show that the category of locally boolean domains has inverse limits of ω-chains...

one for each variable. These transition functions map an input of the Boolean variables in X to a Boolean value (0 or 1). We call a Boolean vector x(t) = (x1(t), . . . , xn(t)) the state of the network at time t. Then, the next state of the network x(t+ 1) is calculated by applying all transition functions fi(x(t)). In a biological context, genes can be modeled as Boolean variables (active/expr...

This paper is concerned with systematically exploring and evaluating a range of possible boolean retrieval strategies for use within a Question Answering (QA) system. We firstly set out two evaluation metrics — coverage and recall — which are specifically designed for use in evaluating retrieval performance in a QA context, and apply these measure in quantifying the performance of some standard...

This paper provides a refinement of the minimum DNA computational model by [OR98b], which assumes the smallest set of permissible biochemical operations. The power of the refined model is characterized in terms of standard Boolean circuit complexity classes.

Boolean programs are a popular abstract domain for static-analysisbased software model checking. Yet little is known about the complexity of model checking for this model of computation. This paper aims to fill this void by providing a comprehensive study of the worst-case complexity of several basic analyses of Boolean programs, including reachability analysis, cycle detection, LTL, CTL, and C...