Search results for "boolean"
showing 10 items of 98 documents
High-Performance Biocomputing in Synthetic Biology-Integrated Transcriptional and Metabolic Circuits
2019
Biocomputing uses molecular biology parts as the hardware to implement computational devices. By following pre-defined rules, often hard-coded into biological systems, these devices are able to process inputs and return outputs-thus computing information. Key to the success of any biocomputing endeavor is the availability of a wealth of molecular tools and biological motifs from which functional devices can be assembled. Synthetic biology is a fabulous playground for such purpose, offering numerous genetic parts that allow for the rational engineering of genetic circuits that mimic the behavior of electronic functions, such as logic gates. A grand challenge, as far as biocomputing is concer…
Identification of control targets in Boolean molecular network models via computational algebra
2015
Motivation: Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The pot…
Neuronal Cytoskeleton in Intellectual Disability: From Systems Biology and Modeling to Therapeutic Opportunities
2021
Intellectual disability (ID) is a pathological condition characterized by limited intellectual functioning and adaptive behaviors. It affects 1–3% of the worldwide population, and no pharmacological therapies are currently available. More than 1000 genes have been found mutated in ID patients pointing out that, despite the common phenotype, the genetic bases are highly heterogeneous and apparently unrelated. Bibliomic analysis reveals that ID genes converge onto a few biological modules, including cytoskeleton dynamics, whose regulation depends on Rho GTPases transduction. Genetic variants exert their effects at different levels in a hierarchical arrangement, starting from the molecular lev…
Compound conditionals as random quantities and Boolean algebras
2022
Conditionals play a key role in different areas of logic and probabilistic reasoning, and they have been studied and formalised from different angles. In this paper we focus on the de Finetti's notion of conditional as a three-valued object, with betting-based semantics, and its related approach as random quantity as mainly developed by two of the authors. Compound conditionals have been studied in the literature, but not in full generality. In this paper we provide a natural procedure to explicitly attach conditional random quantities to arbitrary compound conditionals that also allows us to compute their previsions. By studying the properties of these random quantities, we show that, in f…
Estimation of fibre orientation from digital images
2001
In this paper, estimation of fibre orientation is studied for fibre systems observable as a blurred greyscale image. The estimation method is based on scaled variograms observed along a set of sampling lines in different directions. The parameters of the orientation distribution are obtained numerically. Simulated data are used to study the statistical properties of the method.
Forcing for First-Order Languages from the Perspective of Rasiowa–Sikorski Lemma
2017
The paper is concerned with the problem of building models for first-order languages from the perspective of the classic paper of Rasiowa and Sikorski [9]. The central idea, developed in this paper, consists in constructing first-order models from individual variables. The key notion of a Rasiowa–Sikorski set of formulas for an arbitrary countable language L is examined. Each Rasiowa–Sikorski set defines a countable model for L . Conversely, every countable model for L is determined by a Rasiowa–Sikorski set. The focus is on constructing Rasiowa–Sikorski sets by applying forcing techniques restricted to Boolean algebras arising from the subsets of the set of atomic formulas of L .
Conditioning on MV-algebras and additive measures —I
1997
Abstract We present a lattice-ordered semigroup approach for the foundation of conditional events which covers the special situations where the underlying (unconditional) events are Boolean or fuzzy, respectively. Our proposal is quite different from other, ring theoretical, approaches. The problem of extending additivity of uncertainty measures from unconditional to conditional events will be discussed.
On Conditioning Operators
1999
The construction of conditional events (so-called measure-free conditioning) has a long history and is one of the fundamental problems in non-deterministic system theory (cf. [6]). In particular, the iteration of measure-free conditioning is still an open problem. The present paper tries to make a contribution to this question. In particular, we give an axiomatic introduction of conditioning operators which act as binary operations on the universe of events. The corresponding axiom system of this type of operators focus special attention on the intuitive understanding that the event ‘α given β’ is somewhere in “between” ‘α and β’ and ‘β implies α’. A detailed motivation of these axioms can …
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
Precīzie kvantu algoritmi, izmantojot 1-kvantu-vaicājuma izsaukumus
2018
Darbā ir analizēti zināmi unikāli precīzie kvantu algoritmi, kuru īpašības ir atšķirīgas no citiem literatūrā atrodamiem algoritmiem, un uzsākts pētīt iespējas vispārināt šajos algoritmos esošos paņēmienus. Darbā ir noformulēts jauns skaitļošanas modelis, kas ir saistīts ar precīzo kvantu vaicājumu modeli. Veikti skaitliski aprēķini, lai palīdzētu saprast jaunā modeļa iespējas un ierobežojumus. Izteiktas hipotēzes un virzieni, kādos turpināt analīzi un pētījumu.