State feedback controller design for the synchronization of Boolean networks with time delays

NASA Astrophysics Data System (ADS)

Li, Fangfei; Li, Jianning; Shen, Lijuan

2018-01-01

State feedback control design to make the response Boolean network synchronize with the drive Boolean network is far from being solved in the literature. Motivated by this, this paper studies the feedback control design for the complete synchronization of two coupled Boolean networks with time delays. A necessary condition for the existence of a state feedback controller is derived first. Then the feedback control design procedure for the complete synchronization of two coupled Boolean networks is provided based on the necessary condition. Finally, an example is given to illustrate the proposed design procedure.

The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.

PubMed

Dridi, G; Julien, R; Hliwa, M; Joachim, C

2015-08-28

The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.

BoolFilter: an R package for estimation and identification of partially-observed Boolean dynamical systems.

PubMed

Mcclenny, Levi D; Imani, Mahdi; Braga-Neto, Ulisses M

2017-11-25

Gene regulatory networks govern the function of key cellular processes, such as control of the cell cycle, response to stress, DNA repair mechanisms, and more. Boolean networks have been used successfully in modeling gene regulatory networks. In the Boolean network model, the transcriptional state of each gene is represented by 0 (inactive) or 1 (active), and the relationship among genes is represented by logical gates updated at discrete time points. However, the Boolean gene states are never observed directly, but only indirectly and incompletely through noisy measurements based on expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays. The Partially-Observed Boolean Dynamical System (POBDS) signal model is distinct from other deterministic and stochastic Boolean network models in removing the requirement of a directly observable Boolean state vector and allowing uncertainty in the measurement process, addressing the scenario encountered in practice in transcriptomic analysis. BoolFilter is an R package that implements the POBDS model and associated algorithms for state and parameter estimation. It allows the user to estimate the Boolean states, network topology, and measurement parameters from time series of transcriptomic data using exact and approximated (particle) filters, as well as simulate the transcriptomic data for a given Boolean network model. Some of its infrastructure, such as the network interface, is the same as in the previously published R package for Boolean Networks BoolNet, which enhances compatibility and user accessibility to the new package. We introduce the R package BoolFilter for Partially-Observed Boolean Dynamical Systems (POBDS). The BoolFilter package provides a useful toolbox for the bioinformatics community, with state-of-the-art algorithms for simulation of time series transcriptomic data as well as the inverse process of system identification from data obtained with various expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays.

Development of Boolean calculus and its application

NASA Technical Reports Server (NTRS)

Tapia, M. A.

1979-01-01

Formal procedures for synthesis of asynchronous sequential system using commercially available edge-sensitive flip-flops are developed. Boolean differential is defined. The exact number of compatible integrals of a Boolean differential were calculated.

Boolean integral calculus

NASA Technical Reports Server (NTRS)

Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne

1988-01-01

The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.

Modeling the Normal and Neoplastic Cell Cycle with 'Realistic Boolean Genetic Networks': Their Application for Understanding Carcinogenesis and Assessing Therapeutic Strategies

NASA Technical Reports Server (NTRS)

Szallasi, Zoltan; Liang, Shoudan

2000-01-01

In this paper we show how Boolean genetic networks could be used to address complex problems in cancer biology. First, we describe a general strategy to generate Boolean genetic networks that incorporate all relevant biochemical and physiological parameters and cover all of their regulatory interactions in a deterministic manner. Second, we introduce 'realistic Boolean genetic networks' that produce time series measurements very similar to those detected in actual biological systems. Third, we outline a series of essential questions related to cancer biology and cancer therapy that could be addressed by the use of 'realistic Boolean genetic network' modeling.

Automatic query formulations in information retrieval.

PubMed

Salton, G; Buckley, C; Fox, E A

1983-07-01

Modern information retrieval systems are designed to supply relevant information in response to requests received from the user population. In most retrieval environments the search requests consist of keywords, or index terms, interrelated by appropriate Boolean operators. Since it is difficult for untrained users to generate effective Boolean search requests, trained search intermediaries are normally used to translate original statements of user need into useful Boolean search formulations. Methods are introduced in this study which reduce the role of the search intermediaries by making it possible to generate Boolean search formulations completely automatically from natural language statements provided by the system patrons. Frequency considerations are used automatically to generate appropriate term combinations as well as Boolean connectives relating the terms. Methods are covered to produce automatic query formulations both in a standard Boolean logic system, as well as in an extended Boolean system in which the strict interpretation of the connectives is relaxed. Experimental results are supplied to evaluate the effectiveness of the automatic query formulation process, and methods are described for applying the automatic query formulation process in practice.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

Cabessa, Jérémie; Villa, Alessandro E. P.

2014-01-01

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

Proposed method to construct Boolean functions with maximum possible annihilator immunity

NASA Astrophysics Data System (ADS)

Goyal, Rajni; Panigrahi, Anupama; Bansal, Rohit

2017-07-01

Nonlinearity and Algebraic(annihilator) immunity are two core properties of a Boolean function because optimum values of Annihilator Immunity and nonlinearity are required to resist fast algebraic attack and differential cryptanalysis respectively. For a secure cypher system, Boolean function(S-Boxes) should resist maximum number of attacks. It is possible if a Boolean function has optimal trade-off among its properties. Before constructing Boolean functions, we fixed the criteria of our constructions based on its properties. In present work, our construction is based on annihilator immunity and nonlinearity. While keeping above facts in mind,, we have developed a multi-objective evolutionary approach based on NSGA-II and got the optimum value of annihilator immunity with good bound of nonlinearity. We have constructed balanced Boolean functions having the best trade-off among balancedness, Annihilator immunity and nonlinearity for 5, 6 and 7 variables by the proposed method.

To Boolean or Not To Boolean.

ERIC Educational Resources Information Center

Hildreth, Charles R.

1983-01-01

This editorial addresses the issue of whether or not to provide free-text, keyword/boolean search capabilities in the information retrieval mechanisms of online public access catalogs and discusses online catalogs developed prior to 1980--keyword searching, phrase searching, and precoordination and postcoordination. (EJS)

Minimum energy control and optimal-satisfactory control of Boolean control network

NASA Astrophysics Data System (ADS)

Li, Fangfei; Lu, Xiwen

2013-12-01

In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.

Identifying a Probabilistic Boolean Threshold Network From Samples.

PubMed

Melkman, Avraham A; Cheng, Xiaoqing; Ching, Wai-Ki; Akutsu, Tatsuya

2018-04-01

This paper studies the problem of exactly identifying the structure of a probabilistic Boolean network (PBN) from a given set of samples, where PBNs are probabilistic extensions of Boolean networks. Cheng et al. studied the problem while focusing on PBNs consisting of pairs of AND/OR functions. This paper considers PBNs consisting of Boolean threshold functions while focusing on those threshold functions that have unit coefficients. The treatment of Boolean threshold functions, and triplets and -tuplets of such functions, necessitates a deepening of the theoretical analyses. It is shown that wide classes of PBNs with such threshold functions can be exactly identified from samples under reasonable constraints, which include: 1) PBNs in which any number of threshold functions can be assigned provided that all have the same number of input variables and 2) PBNs consisting of pairs of threshold functions with different numbers of input variables. It is also shown that the problem of deciding the equivalence of two Boolean threshold functions is solvable in pseudopolynomial time but remains co-NP complete.

Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks.

PubMed

Muñoz, Stalin; Carrillo, Miguel; Azpeitia, Eugenio; Rosenblueth, David A

2018-01-01

Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined "regulation" graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic) attractors. We describe Griffin , a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ "symbolic" techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as "clause learning" considerably increasing Griffin 's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin.

On the Run-Time Optimization of the Boolean Logic of a Program.

ERIC Educational Resources Information Center

Cadolino, C.; Guazzo, M.

1982-01-01

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

Boolean integral calculus for digital systems

NASA Technical Reports Server (NTRS)

Tucker, J. H.; Tapia, M. A.; Bennett, A. W.

1985-01-01

The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.

A Comparison of Two Methods for Boolean Query Relevancy Feedback.

ERIC Educational Resources Information Center

Salton, G.; And Others

1984-01-01

Evaluates and compares two recently proposed automatic methods for relevance feedback of Boolean queries (Dillon method, which uses probabilistic approach as basis, and disjunctive normal form method). Conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment. Nineteen references are included. (EJS)

Evolution of a designless nanoparticle network into reconfigurable Boolean logic

NASA Astrophysics Data System (ADS)

Bose, S. K.; Lawrence, C. P.; Liu, Z.; Makarenko, K. S.; van Damme, R. M. J.; Broersma, H. J.; van der Wiel, W. G.

2015-12-01

Natural computers exploit the emergent properties and massive parallelism of interconnected networks of locally active components. Evolution has resulted in systems that compute quickly and that use energy efficiently, utilizing whatever physical properties are exploitable. Man-made computers, on the other hand, are based on circuits of functional units that follow given design rules. Hence, potentially exploitable physical processes, such as capacitive crosstalk, to solve a problem are left out. Until now, designless nanoscale networks of inanimate matter that exhibit robust computational functionality had not been realized. Here we artificially evolve the electrical properties of a disordered nanomaterials system (by optimizing the values of control voltages using a genetic algorithm) to perform computational tasks reconfigurably. We exploit the rich behaviour that emerges from interconnected metal nanoparticles, which act as strongly nonlinear single-electron transistors, and find that this nanoscale architecture can be configured in situ into any Boolean logic gate. This universal, reconfigurable gate would require about ten transistors in a conventional circuit. Our system meets the criteria for the physical realization of (cellular) neural networks: universality (arbitrary Boolean functions), compactness, robustness and evolvability, which implies scalability to perform more advanced tasks. Our evolutionary approach works around device-to-device variations and the accompanying uncertainties in performance. Moreover, it bears a great potential for more energy-efficient computation, and for solving problems that are very hard to tackle in conventional architectures.

Boolean Classes and Qualitative Inquiry. WCER Working Paper No. 2006-3

ERIC Educational Resources Information Center

Nathan, Mitchell J.; Jackson, Kristi

2006-01-01

The prominent role of Boolean classes in qualitative data analysis software is viewed by some as an encroachment of logical positivism on qualitative research methodology. The authors articulate an embodiment perspective, in which Boolean classes are viewed as conceptual metaphors for apprehending and manipulating data, concepts, and categories in…

Algebraic model checking for Boolean gene regulatory networks.

PubMed

Tran, Quoc-Nam

2011-01-01

We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.

E-Referencer: Transforming Boolean OPACs to Web Search Engines.

ERIC Educational Resources Information Center

Khoo, Christopher S. G.; Poo, Danny C. C.; Toh, Teck-Kang; Hong, Glenn

E-Referencer is an expert intermediary system for searching library online public access catalogs (OPACs) on the World Wide Web. It is implemented as a proxy server that mediates the interaction between the user and Boolean OPACs. It transforms a Boolean OPAC into a retrieval system with many of the search capabilities of Web search engines.…

BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool

ERIC Educational Resources Information Center

Chen, T. Y.; Grant, D. D.; Lau, M. F.; Ng, S. P.; Vasa, V. R.

2006-01-01

BEAT is a Web-based system that generates fault-based test cases from Boolean expressions. It is based on the integration of our several fault-based test case selection strategies. The generated test cases are considered to be fault-based, because they are aiming at the detection of particular faults. For example, when the Boolean expression is in…

Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.

PubMed

Mori, Fumito; Mochizuki, Atsushi

2017-07-14

Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.

SETS. Set Equation Transformation System

DOE Office of Scientific and Technical Information (OSTI.GOV)

Worrell, R.B.

1992-01-13

SETS is used for symbolic manipulation of Boolean equations, particularly the reduction of equations by the application of Boolean identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze noncoherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access throughmore » nullification of sensors in its protection system.« less

Monotone Boolean approximation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hulme, B.L.

1982-12-01

This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application formore » the analysis of noncoherent fault trees and event tree sequences.« less

On spectral techniques in analysis of Boolean networks

NASA Astrophysics Data System (ADS)

Kesseli, Juha; Rämö, Pauli; Yli-Harja, Olli

2005-06-01

In this work we present results that can be used for analysis of Boolean networks. The results utilize Fourier spectra of the functions in the network. An accurate formula is given for Derrida plots of networks of finite size N based on a result on Boolean functions presented in another context. Derrida plots are widely used to examine the stability issues of Boolean networks. For the limit N→∞, we give a computationally simple form that can be used as a good approximation for rather small networks as well. A formula for Derrida plots of random Boolean networks (RBNs) presented earlier in the literature is given an alternative derivation. It is shown that the information contained in the Derrida plot is equal to the average Fourier spectrum of the functions in the network. In the case of random networks the mean Derrida plot can be obtained from the mean spectrum of the functions. The method is applied to real data by using the Boolean functions found in genetic regulatory networks of eukaryotic cells in an earlier study. Conventionally, Derrida plots and stability analysis have been computed with statistical sampling resulting in poorer accuracy.

Automatic Screening for Perturbations in Boolean Networks.

PubMed

Schwab, Julian D; Kestler, Hans A

2018-01-01

A common approach to address biological questions in systems biology is to simulate regulatory mechanisms using dynamic models. Among others, Boolean networks can be used to model the dynamics of regulatory processes in biology. Boolean network models allow simulating the qualitative behavior of the modeled processes. A central objective in the simulation of Boolean networks is the computation of their long-term behavior-so-called attractors. These attractors are of special interest as they can often be linked to biologically relevant behaviors. Changing internal and external conditions can influence the long-term behavior of the Boolean network model. Perturbation of a Boolean network by stripping a component of the system or simulating a surplus of another element can lead to different attractors. Apparently, the number of possible perturbations and combinations of perturbations increases exponentially with the size of the network. Manually screening a set of possible components for combinations that have a desired effect on the long-term behavior can be very time consuming if not impossible. We developed a method to automatically screen for perturbations that lead to a user-specified change in the network's functioning. This method is implemented in the visual simulation framework ViSiBool utilizing satisfiability (SAT) solvers for fast exhaustive attractor search.

Two classes of ODE models with switch-like behavior.

PubMed

Just, Winfried; Korb, Mason; Elbert, Ben; Young, Todd

2013-12-01

In cases where the same real-world system can be modeled both by an ODE system ⅅ and a Boolean system , it is of interest to identify conditions under which the two systems will be consistent, that is, will make qualitatively equivalent predictions. In this note we introduce two broad classes of relatively simple models that provide a convenient framework for studying such questions. In contrast to the widely known class of Glass networks, the right-hand sides of our ODEs are Lipschitz-continuous. We prove that if has certain structures, consistency between ⅅ and is implied by sufficient separation of time scales in one class of our models. Namely, if the trajectories of are "one-stepping" then we prove a strong form of consistency and if has a certain monotonicity property then there is a weaker consistency between ⅅ and . These results appear to point to more general structure properties that favor consistency between ODE and Boolean models.

Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines

DTIC Science & Technology

1989-09-01

Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines Srinivas Devadas and Kurt Keutzer F ( Abstract In this...Projects Agency under contract number N00014-87-K-0825. Author Information Devadas : Department of Electrical Engineering and Computer Science, Room 36...MA 02139; (617) 253-0292. 0 * Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines Siivas Devadas

Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space.

PubMed

Ahnert, S E; Fink, T M A

2016-07-01

Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the 'function' of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature. © 2016 The Authors.

On the inherent competition between valid and spurious inductive inferences in Boolean data

NASA Astrophysics Data System (ADS)

Andrecut, M.

Inductive inference is the process of extracting general rules from specific observations. This problem also arises in the analysis of biological networks, such as genetic regulatory networks, where the interactions are complex and the observations are incomplete. A typical task in these problems is to extract general interaction rules as combinations of Boolean covariates, that explain a measured response variable. The inductive inference process can be considered as an incompletely specified Boolean function synthesis problem. This incompleteness of the problem will also generate spurious inferences, which are a serious threat to valid inductive inference rules. Using random Boolean data as a null model, here we attempt to measure the competition between valid and spurious inductive inference rules from a given data set. We formulate two greedy search algorithms, which synthesize a given Boolean response variable in a sparse disjunct normal form, and respectively a sparse generalized algebraic normal form of the variables from the observation data, and we evaluate numerically their performance.

Inference of combinatorial Boolean rules of synergistic gene sets from cancer microarray datasets.

PubMed

Park, Inho; Lee, Kwang H; Lee, Doheon

2010-06-15

Gene set analysis has become an important tool for the functional interpretation of high-throughput gene expression datasets. Moreover, pattern analyses based on inferred gene set activities of individual samples have shown the ability to identify more robust disease signatures than individual gene-based pattern analyses. Although a number of approaches have been proposed for gene set-based pattern analysis, the combinatorial influence of deregulated gene sets on disease phenotype classification has not been studied sufficiently. We propose a new approach for inferring combinatorial Boolean rules of gene sets for a better understanding of cancer transcriptome and cancer classification. To reduce the search space of the possible Boolean rules, we identify small groups of gene sets that synergistically contribute to the classification of samples into their corresponding phenotypic groups (such as normal and cancer). We then measure the significance of the candidate Boolean rules derived from each group of gene sets; the level of significance is based on the class entropy of the samples selected in accordance with the rules. By applying the present approach to publicly available prostate cancer datasets, we identified 72 significant Boolean rules. Finally, we discuss several identified Boolean rules, such as the rule of glutathione metabolism (down) and prostaglandin synthesis regulation (down), which are consistent with known prostate cancer biology. Scripts written in Python and R are available at http://biosoft.kaist.ac.kr/~ihpark/. The refined gene sets and the full list of the identified Boolean rules are provided in the Supplementary Material. Supplementary data are available at Bioinformatics online.

Affine Equivalence and Constructions of Cryptographically Strong Boolean Functions

DTIC Science & Technology

2013-09-01

manner is crucial for today’s global citizen. We want our financial transactions over the Internet to get processed without error. Cyber warfare between...encryption and decryption processes . An asymmetric cipher uses different keys to encrypt and decrypt a message, and the connection between the encryption and...Depending on how a symmetric cipher processes a message before encryption or de- cryption, a symmetric cipher can be further classified into a block or

Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks

NASA Astrophysics Data System (ADS)

Gong, Xinwei

This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing complexity values for networks in the ordered and critical phases and for highly disordered networks, peaking somewhere in the disordered phase. Individual nodes with high complexity have, on average, a larger influence on the system dynamics. Lastly, a semi-annealed approximation that preserves the correlation between states at neighboring nodes is introduced to study a social game-inspired network model in which all links are bidirectional and all nodes have a self-input. The technique developed here is shown to yield accurate predictions of distribution of players' states, and accounts for some nontrivial collective behavior of game theoretic interest.

Computing preimages of Boolean networks.

PubMed

Klotz, Johannes; Bossert, Martin; Schober, Steffen

2013-01-01

In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.

A Boolean Consistent Fuzzy Inference System for Diagnosing Diseases and Its Application for Determining Peritonitis Likelihood

PubMed Central

Dragović, Ivana; Turajlić, Nina; Pilčević, Dejan; Petrović, Bratislav; Radojević, Dragan

2015-01-01

Fuzzy inference systems (FIS) enable automated assessment and reasoning in a logically consistent manner akin to the way in which humans reason. However, since no conventional fuzzy set theory is in the Boolean frame, it is proposed that Boolean consistent fuzzy logic should be used in the evaluation of rules. The main distinction of this approach is that it requires the execution of a set of structural transformations before the actual values can be introduced, which can, in certain cases, lead to different results. While a Boolean consistent FIS could be used for establishing the diagnostic criteria for any given disease, in this paper it is applied for determining the likelihood of peritonitis, as the leading complication of peritoneal dialysis (PD). Given that patients could be located far away from healthcare institutions (as peritoneal dialysis is a form of home dialysis) the proposed Boolean consistent FIS would enable patients to easily estimate the likelihood of them having peritonitis (where a high likelihood would suggest that prompt treatment is indicated), when medical experts are not close at hand. PMID:27069500

A stochastic and dynamical view of pluripotency in mouse embryonic stem cells

PubMed Central

Lee, Esther J.

2018-01-01

Pluripotent embryonic stem cells are of paramount importance for biomedical sciences because of their innate ability for self-renewal and differentiation into all major cell lines. The fateful decision to exit or remain in the pluripotent state is regulated by complex genetic regulatory networks. The rapid growth of single-cell sequencing data has greatly stimulated applications of statistical and machine learning methods for inferring topologies of pluripotency regulating genetic networks. The inferred network topologies, however, often only encode Boolean information while remaining silent about the roles of dynamics and molecular stochasticity inherent in gene expression. Herein we develop a framework for systematically extending Boolean-level network topologies into higher resolution models of networks which explicitly account for the promoter architectures and gene state switching dynamics. We show the framework to be useful for disentangling the various contributions that gene switching, external signaling, and network topology make to the global heterogeneity and dynamics of transcription factor populations. We find the pluripotent state of the network to be a steady state which is robust to global variations of gene switching rates which we argue are a good proxy for epigenetic states of individual promoters. The temporal dynamics of exiting the pluripotent state, on the other hand, is significantly influenced by the rates of genetic switching which makes cells more responsive to changes in extracellular signals. PMID:29451874

Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

PubMed

Zhang, Jianming; Sclaroff, Stan

2016-05-01

We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.

Network dynamics and systems biology

NASA Astrophysics Data System (ADS)

Norrell, Johannes A.

The physics of complex systems has grown considerably as a field in recent decades, largely due to improved computational technology and increased availability of systems level data. One area in which physics is of growing relevance is molecular biology. A new field, systems biology, investigates features of biological systems as a whole, a strategy of particular importance for understanding emergent properties that result from a complex network of interactions. Due to the complicated nature of the systems under study, the physics of complex systems has a significant role to play in elucidating the collective behavior. In this dissertation, we explore three problems in the physics of complex systems, motivated in part by systems biology. The first of these concerns the applicability of Boolean models as an approximation of continuous systems. Studies of gene regulatory networks have employed both continuous and Boolean models to analyze the system dynamics, and the two have been found produce similar results in the cases analyzed. We ask whether or not Boolean models can generically reproduce the qualitative attractor dynamics of networks of continuously valued elements. Using a combination of analytical techniques and numerical simulations, we find that continuous networks exhibit two effects---an asymmetry between on and off states, and a decaying memory of events in each element's inputs---that are absent from synchronously updated Boolean models. We show that in simple loops these effects produce exactly the attractors that one would predict with an analysis of the stability of Boolean attractors, but in slightly more complicated topologies, they can destabilize solutions that are stable in the Boolean approximation, and can stabilize new attractors. Second, we investigate ensembles of large, random networks. Of particular interest is the transition between ordered and disordered dynamics, which is well characterized in Boolean systems. Networks at the transition point, called critical, exhibit many of the features of regulatory networks, and recent studies suggest that some specific regulatory networks are indeed near-critical. We ask whether certain statistical measures of the ensemble behavior of large continuous networks are reproduced by Boolean models. We find that, in spite of the lack of correspondence between attractors observed in smaller systems, the statistical characterization given by the continuous and Boolean models show close agreement, and the transition between order and disorder known in Boolean systems can occur in continuous systems as well. One effect that is not present in Boolean systems, the failure of information to propagate down chains of elements of arbitrary length, is present in a class of continuous networks. In these systems, a modified Boolean theory that takes into account the collective effect of propagation failure on chains throughout the network gives a good description of the observed behavior. We find that propagation failure pushes the system toward greater order, resulting in a partial or complete suppression of the disordered phase. Finally, we explore a dynamical process of direct biological relevance: asymmetric cell division in A. thaliana. The long term goal is to develop a model for the process that accurately accounts for both wild type and mutant behavior. To contribute to this endeavor, we use confocal microscopy to image roots in a SHORT-ROOT inducible mutant. We compute correlation functions between the locations of asymmetrically divided cells, and we construct stochastic models based on a few simple assumptions that accurately predict the non-zero correlations. Our result shows that intracellular processes alone cannot be responsible for the observed divisions, and that an intercell signaling mechanism could account for the measured correlations.

"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis

PubMed Central

2011-01-01

Background In Thomas' formalism for modeling gene regulatory networks (GRNs), branching time, where a state can have more than one possible future, plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a) asynchrony, (b) incompletely specified behavior, and (c) interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because infinitely many paths may appear, limiting ordinary simulators to statistical conclusions. Model checkers for branching time, by contrast, are able to prove properties in the presence of infinitely many paths. Results We have developed Antelope ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/), a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. Antelope, by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the Arabidopsis thaliana root stem cell niche. There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a given set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it reports the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs. Antelope tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary model checkers (e.g., NuSMV) cannot. This additional expressiveness is achieved by employing a logic extending the standard Computation-Tree Logic (CTL) with hybrid-logic operators. Conclusions We illustrate the advantages of Antelope when (a) modeling incomplete networks and environment interaction, (b) exhibiting the set of all states having a given property, and (c) representing Boolean GRN properties with hybrid CTL. PMID:22192526

Two classes of ODE models with switch-like behavior

PubMed Central

Just, Winfried; Korb, Mason; Elbert, Ben; Young, Todd

2013-01-01

In cases where the same real-world system can be modeled both by an ODE system ⅅ and a Boolean system 𝔹, it is of interest to identify conditions under which the two systems will be consistent, that is, will make qualitatively equivalent predictions. In this note we introduce two broad classes of relatively simple models that provide a convenient framework for studying such questions. In contrast to the widely known class of Glass networks, the right-hand sides of our ODEs are Lipschitz-continuous. We prove that if 𝔹 has certain structures, consistency between ⅅ and 𝔹 is implied by sufficient separation of time scales in one class of our models. Namely, if the trajectories of 𝔹 are “one-stepping” then we prove a strong form of consistency and if 𝔹 has a certain monotonicity property then there is a weaker consistency between ⅅ and 𝔹. These results appear to point to more general structure properties that favor consistency between ODE and Boolean models. PMID:24244061

Theory and calculus of cubical complexes

NASA Technical Reports Server (NTRS)

Perlman, M.

1973-01-01

Combination switching networks with multiple outputs may be represented by Boolean functions. Report has been prepared which describes derivation and use of extraction algorithm that may be adapted to simplification of such simultaneous Boolean functions.

Dynamic Boolean Mathematics

ERIC Educational Resources Information Center

Bossé, Michael J.; Adu-Gyamfi, Kwaku; Chandler, Kayla; Lynch-Davis, Kathleen

2016-01-01

Dynamic mathematical environments allow users to reify mathematical concepts through multiple representations, transform mathematical relations and organically explore mathematical properties, investigate integrated mathematics, and develop conceptual understanding. Herein, we integrate Boolean algebra, the functionalities of a dynamic…

Total Parenteral Nutrition

MedlinePlus

... Boolean useRights, FileShare share, Int32 bufferSize, FileOptions options, SECURITY_ATTRIBUTES secAttrs, String msgPath, Boolean bFromProxy) at System.IO.FileStream..ctor(String path, FileMode mode, FileAccess ...

A genetic code Boolean structure. II. The genetic information system as a Boolean information system.

PubMed

Sanchez, Robersy; Grau, Ricardo

2005-09-01

A Boolean structure of the genetic code where Boolean deductions have biological and physicochemical meanings was discussed in a previous paper. Now, from these Boolean deductions we propose to define the value of amino acid information in order to consider the genetic information system as a communication system and to introduce the semantic content of information ignored by the conventional information theory. In this proposal, the value of amino acid information is proportional to the molecular weight of amino acids with a proportional constant of about 1.96 x 10(25) bits per kg. In addition to this, for the experimental estimations of the minimum energy dissipation in genetic logic operations, we present two postulates: (1) the energy Ei (i=1,2,...,20) of amino acids in the messages conveyed by proteins is proportional to the value of information, and (2) amino acids are distributed according to their energy Ei so the amino acid population in proteins follows a Boltzmann distribution. Specifically, in the genetic message carried by the DNA from the genomes of living organisms, we found that the minimum energy dissipation in genetic logic operations was close to kTLn(2) joules per bit.

Ordinary differential equations and Boolean networks in application to modelling of 6-mercaptopurine metabolism.

PubMed

Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V

2017-04-01

We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.

Improving the quantum cost of reversible Boolean functions using reorder algorithm

NASA Astrophysics Data System (ADS)

Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf

2018-05-01

This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.

Volumetric T-spline Construction Using Boolean Operations

DTIC Science & Technology

2013-07-01

SUBTITLE Volumetric T-spline Construction Using Boolean Operations 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d...Acknowledgements The work of L. Liu and Y. Zhang was supported by ONR-YIP award N00014- 10-1-0698 and an ONR Grant N00014-08-1-0653. T. J.R. Hughes was sup- 16...T-spline Construction Using Boolean Operations 17 ported by ONR Grant N00014-08-1-0992, NSF GOALI CMI-0700807/0700204, NSF CMMI-1101007 and a SINTEF

Dynamic Network-Based Epistasis Analysis: Boolean Examples

PubMed Central

Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.

2011-01-01

In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and single-path assumption, but also by demonstrating the importance of considering temporal dynamics, and specifically introducing the usefulness of Boolean network models and also reviewing some key properties of network approaches. PMID:22645556

Acoustic logic gates and Boolean operation based on self-collimating acoustic beams

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Ting; Xu, Jian-yi; Cheng, Ying, E-mail: chengying@nju.edu.cn

2015-03-16

The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logicmore » and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations.« less

Boolean networks with veto functions

NASA Astrophysics Data System (ADS)

Ebadi, Haleh; Klemm, Konstantin

2014-08-01

Boolean networks are discrete dynamical systems for modeling regulation and signaling in living cells. We investigate a particular class of Boolean functions with inhibiting inputs exerting a veto (forced zero) on the output. We give analytical expressions for the sensitivity of these functions and provide evidence for their role in natural systems. In an intracellular signal transduction network [Helikar et al., Proc. Natl. Acad. Sci. USA 105, 1913 (2008), 10.1073/pnas.0705088105], the functions with veto are over-represented by a factor exceeding the over-representation of threshold functions and canalyzing functions in the same system. In Boolean networks for control of the yeast cell cycle [Li et al., Proc. Natl. Acad. Sci. USA 101, 4781 (2004), 10.1073/pnas.0305937101; Davidich et al., PLoS ONE 3, e1672 (2008), 10.1371/journal.pone.0001672], no or minimal changes to the wiring diagrams are necessary to formulate their dynamics in terms of the veto functions introduced here.

Data-Driven Sampling Matrix Boolean Optimization for Energy-Efficient Biomedical Signal Acquisition by Compressive Sensing.

PubMed

Wang, Yuhao; Li, Xin; Xu, Kai; Ren, Fengbo; Yu, Hao

2017-04-01

Compressive sensing is widely used in biomedical applications, and the sampling matrix plays a critical role on both quality and power consumption of signal acquisition. It projects a high-dimensional vector of data into a low-dimensional subspace by matrix-vector multiplication. An optimal sampling matrix can ensure accurate data reconstruction and/or high compression ratio. Most existing optimization methods can only produce real-valued embedding matrices that result in large energy consumption during data acquisition. In this paper, we propose an efficient method that finds an optimal Boolean sampling matrix in order to reduce the energy consumption. Compared to random Boolean embedding, our data-driven Boolean sampling matrix can improve the image recovery quality by 9 dB. Moreover, in terms of sampling hardware complexity, it reduces the energy consumption by 4.6× and the silicon area by 1.9× over the data-driven real-valued embedding.

Causal structure of oscillations in gene regulatory networks: Boolean analysis of ordinary differential equation attractors.

PubMed

Sun, Mengyang; Cheng, Xianrui; Socolar, Joshua E S

2013-06-01

A common approach to the modeling of gene regulatory networks is to represent activating or repressing interactions using ordinary differential equations for target gene concentrations that include Hill function dependences on regulator gene concentrations. An alternative formulation represents the same interactions using Boolean logic with time delays associated with each network link. We consider the attractors that emerge from the two types of models in the case of a simple but nontrivial network: a figure-8 network with one positive and one negative feedback loop. We show that the different modeling approaches give rise to the same qualitative set of attractors with the exception of a possible fixed point in the ordinary differential equation model in which concentrations sit at intermediate values. The properties of the attractors are most easily understood from the Boolean perspective, suggesting that time-delay Boolean modeling is a useful tool for understanding the logic of regulatory networks.

An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications.

PubMed

Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N

2015-04-28

Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.

A transition calculus for Boolean functions. [logic circuit analysis

NASA Technical Reports Server (NTRS)

Tucker, J. H.; Bennett, A. W.

1974-01-01

A transition calculus is presented for analyzing the effect of input changes on the output of logic circuits. The method is closely related to the Boolean difference, but it is more powerful. Both differentiation and integration are considered.

Characterizing short-term stability for Boolean networks over any distribution of transfer functions

DOE PAGES

Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; ...

2016-07-05

Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.

Inferring Boolean network states from partial information

PubMed Central

2013-01-01

Networks of molecular interactions regulate key processes in living cells. Therefore, understanding their functionality is a high priority in advancing biological knowledge. Boolean networks are often used to describe cellular networks mathematically and are fitted to experimental datasets. The fitting often results in ambiguities since the interpretation of the measurements is not straightforward and since the data contain noise. In order to facilitate a more reliable mapping between datasets and Boolean networks, we develop an algorithm that infers network trajectories from a dataset distorted by noise. We analyze our algorithm theoretically and demonstrate its accuracy using simulation and microarray expression data. PMID:24006954

Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

NASA Astrophysics Data System (ADS)

Xie, Zhengwei; Qiu, Daowen; Cai, Guangya

2018-06-01

Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.

Development of Boolean calculus and its applications. [digital systems design

NASA Technical Reports Server (NTRS)

Tapia, M. A.

1980-01-01

The development of Boolean calculus for its application to developing digital system design methodologies that would reduce system complexity, size, cost, speed, power requirements, etc., is discussed. Synthesis procedures for logic circuits are examined particularly asynchronous circuits using clock triggered flip flops.

Advanced Feedback Methods in Information Retrieval.

ERIC Educational Resources Information Center

Salton, G.; And Others

1985-01-01

In this study, automatic feedback techniques are applied to Boolean query statements in online information retrieval to generate improved query statements based on information contained in previously retrieved documents. Feedback operations are carried out using conventional Boolean logic and extended logic. Experimental output is included to…

Compact universal logic gates realized using quantization of current in nanodevices.

PubMed

Zhang, Wancheng; Wu, Nan-Jian; Yang, Fuhua

2007-12-12

This paper proposes novel universal logic gates using the current quantization characteristics of nanodevices. In nanodevices like the electron waveguide (EW) and single-electron (SE) turnstile, the channel current is a staircase quantized function of its control voltage. We use this unique characteristic to compactly realize Boolean functions. First we present the concept of the periodic-threshold threshold logic gate (PTTG), and we build a compact PTTG using EW and SE turnstiles. We show that an arbitrary three-input Boolean function can be realized with a single PTTG, and an arbitrary four-input Boolean function can be realized by using two PTTGs. We then use one PTTG to build a universal programmable two-input logic gate which can be used to realize all two-input Boolean functions. We also build a programmable three-input logic gate by using one PTTG. Compared with linear threshold logic gates, with the PTTG one can build digital circuits more compactly. The proposed PTTGs are promising for future smart nanoscale digital system use.

Phase transition in NK-Kauffman networks and its correction for Boolean irreducibility

NASA Astrophysics Data System (ADS)

Zertuche, Federico

2014-05-01

In a series of articles published in 1986, Derrida and his colleagues studied two mean field treatments (the quenched and the annealed) for NK-Kauffman networks. Their main results lead to a phase transition curve Kc 2 pc(1-pc)=1 (0

Controllability and observability of Boolean networks arising from biology

NASA Astrophysics Data System (ADS)

Li, Rui; Yang, Meng; Chu, Tianguang

2015-02-01

Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.

Solving a discrete model of the lac operon using Z3

NASA Astrophysics Data System (ADS)

Gutierrez, Natalia A.

2014-05-01

A discrete model for the Lcac Operon is solved using the SMT-solver Z3. Traditionally the Lac Operon is formulated in a continuous math model. This model is a system of ordinary differential equations. Here, it was considerated as a discrete model, based on a Boolean red. The biological problem of Lac Operon is enunciated as a problem of Boolean satisfiability, and it is solved using an STM-solver named Z3. Z3 is a powerful solver that allows understanding the basic dynamic of the Lac Operon in an easier and more efficient way. The multi-stability of the Lac Operon can be easily computed with Z3. The code that solves the Boolean red can be written in Python language or SMT-Lib language. Both languages were used in local version of the program as online version of Z3. For future investigations it is proposed to solve the Boolean red of Lac Operon using others SMT-solvers as cvc4, alt-ergo, mathsat and yices.

Perturbation propagation in random and evolved Boolean networks

NASA Astrophysics Data System (ADS)

Fretter, Christoph; Szejka, Agnes; Drossel, Barbara

2009-03-01

In this paper, we investigate the propagation of perturbations in Boolean networks by evaluating the Derrida plot and its modifications. We show that even small random Boolean networks agree well with the predictions of the annealed approximation, but nonrandom networks show a very different behaviour. We focus on networks that were evolved for high dynamical robustness. The most important conclusion is that the simple distinction between frozen, critical and chaotic networks is no longer useful, since such evolved networks can display the properties of all three types of networks. Furthermore, we evaluate a simplified empirical network and show how its specific state space properties are reflected in the modified Derrida plots.

Multilayer neural networks with extensively many hidden units.

PubMed

Rosen-Zvi, M; Engel, A; Kanter, I

2001-08-13

The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is performed by general symmetric Boolean functions, whereas the hidden layer is connected to the output by either discrete or continuous couplings. Introducing an overlap in the space of Boolean functions as order parameter, the storage capacity is found to scale with the logarithm of the number of implementable Boolean functions. The generalization behavior is smooth for continuous couplings and shows a discontinuous transition to perfect generalization for discrete ones.

Comparison of stationary and oscillatory dynamics described by differential equations and Boolean maps in transcriptional regulatory circuits

NASA Astrophysics Data System (ADS)

Ye, Weiming; Li, Pengfei; Huang, Xuhui; Xia, Qinzhi; Mi, Yuanyuan; Chen, Runsheng; Hu, Gang

2010-10-01

Exploring the principle and relationship of gene transcriptional regulations (TR) has been becoming a generally researched issue. So far, two major mathematical methods, ordinary differential equation (ODE) method and Boolean map (BM) method have been widely used for these purposes. It is commonly believed that simplified BMs are reasonable approximations of more realistic ODEs, and both methods may reveal qualitatively the same essential features though the dynamical details of both systems may show some differences. In this Letter we exhaustively enumerated all the 3-gene networks and many autonomous randomly constructed TR networks with more genes by using both the ODE and BM methods. In comparison we found that both methods provide practically identical results in most of cases of steady solutions. However, to our great surprise, most of network structures showing periodic cycles with the BM method possess only stationary states in ODE descriptions. These observations strongly suggest that many periodic oscillations and other complicated oscillatory states revealed by the BM rule may be related to the computational errors of variable and time discretizations and rarely have correspondence in realistic biology transcriptional regulatory circuits.

Toxicological Tipping Points: Learning Boolean Networks from High-Content Imaging Data. (BOSC meeting)

EPA Science Inventory

The objective of this work is to elucidate biological networks underlying cellular tipping points using time-course data. We discretized the high-content imaging (HCI) data and inferred Boolean networks (BNs) that could accurately predict dynamic cellular trajectories. We found t...

Boolean linear differential operators on elementary cellular automata

NASA Astrophysics Data System (ADS)

Martín Del Rey, Ángel

2014-12-01

In this paper, the notion of boolean linear differential operator (BLDO) on elementary cellular automata (ECA) is introduced and some of their more important properties are studied. Special attention is paid to those differential operators whose coefficients are the ECA with rule numbers 90 and 150.

Describing the What and Why of Students' Difficulties in Boolean Logic

ERIC Educational Resources Information Center

Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig

2012-01-01

The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…

Evolution of canalizing Boolean networks

NASA Astrophysics Data System (ADS)

Szejka, A.; Drossel, B.

2007-04-01

Boolean networks with canalizing functions are used to model gene regulatory networks. In order to learn how such networks may behave under evolutionary forces, we simulate the evolution of a single Boolean network by means of an adaptive walk, which allows us to explore the fitness landscape. Mutations change the connections and the functions of the nodes. Our fitness criterion is the robustness of the dynamical attractors against small perturbations. We find that with this fitness criterion the global maximum is always reached and that there is a huge neutral space of 100% fitness. Furthermore, in spite of having such a high degree of robustness, the evolved networks still share many features with “chaotic” networks.

Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

DTIC Science & Technology

2015-01-01

definitions , including monomial rotation symmetric (MRS) Boolean functions and affine equivalence, and a known result for such quadratic functions...degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2

User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.

ERIC Educational Resources Information Center

Ensor, Pat

1992-01-01

Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…

Using Vector and Extended Boolean Matching in an Expert System for Selecting Foster Homes.

ERIC Educational Resources Information Center

Fox, Edward A.; Winett, Sheila G.

1990-01-01

Describes FOCES (Foster Care Expert System), a prototype expert system for choosing foster care placements for children which integrates information retrieval techniques with artificial intelligence. The use of prototypes and queries in Prolog routines, extended Boolean matching, and vector correlation are explained, as well as evaluation by…

A Construction of Boolean Functions with Good Cryptographic Properties

DTIC Science & Technology

2014-01-01

be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum

Using computer algebra and SMT solvers in algebraic biology

NASA Astrophysics Data System (ADS)

Pineda Osorio, Mateo

2014-05-01

Biologic processes are represented as Boolean networks, in a discrete time. The dynamics within these networks are approached with the help of SMT Solvers and the use of computer algebra. Software such as Maple and Z3 was used in this case. The number of stationary states for each network was calculated. The network studied here corresponds to the immune system under the effects of drastic mood changes. Mood is considered as a Boolean variable that affects the entire dynamics of the immune system, changing the Boolean satisfiability and the number of stationary states of the immune network. Results obtained show Z3's great potential as a SMT Solver. Some of these results were verified in Maple, even though it showed not to be as suitable for the problem approach. The solving code was constructed using Z3-Python and Z3-SMT-LiB. Results obtained are important in biology systems and are expected to help in the design of immune therapies. As a future line of research, more complex Boolean network representations of the immune system as well as the whole psychological apparatus are suggested.

Therapeutic target discovery using Boolean network attractors: improvements of kali

PubMed Central

Guziolowski, Carito

2018-01-01

In a previous article, an algorithm for identifying therapeutic targets in Boolean networks modelling pathological mechanisms was introduced. In the present article, the improvements made on this algorithm, named kali, are described. These improvements are (i) the possibility to work on asynchronous Boolean networks, (ii) a finer assessment of therapeutic targets and (iii) the possibility to use multivalued logic. kali assumes that the attractors of a dynamical system, such as a Boolean network, are associated with the phenotypes of the modelled biological system. Given a logic-based model of pathological mechanisms, kali searches for therapeutic targets able to reduce the reachability of the attractors associated with pathological phenotypes, thus reducing their likeliness. kali is illustrated on an example network and used on a biological case study. The case study is a published logic-based model of bladder tumorigenesis from which kali returns consistent results. However, like any computational tool, kali can predict but cannot replace human expertise: it is a supporting tool for coping with the complexity of biological systems in the field of drug discovery. PMID:29515890

3D Boolean operations in virtual surgical planning.

PubMed

Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun

2017-10-01

Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.

Generalization and capacity of extensively large two-layered perceptrons.

PubMed

Rosen-Zvi, Michal; Engel, Andreas; Kanter, Ido

2002-09-01

The generalization ability and storage capacity of a treelike two-layered neural network with a number of hidden units scaling as the input dimension is examined. The mapping from the input to the hidden layer is via Boolean functions; the mapping from the hidden layer to the output is done by a perceptron. The analysis is within the replica framework where an order parameter characterizing the overlap between two networks in the combined space of Boolean functions and hidden-to-output couplings is introduced. The maximal capacity of such networks is found to scale linearly with the logarithm of the number of Boolean functions per hidden unit. The generalization process exhibits a first-order phase transition from poor to perfect learning for the case of discrete hidden-to-output couplings. The critical number of examples per input dimension, alpha(c), at which the transition occurs, again scales linearly with the logarithm of the number of Boolean functions. In the case of continuous hidden-to-output couplings, the generalization error decreases according to the same power law as for the perceptron, with the prefactor being different.

Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

PubMed

Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

2016-11-01

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

PubMed

Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

2014-06-26

A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra

PubMed Central

2014-01-01

Background A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. Results This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. Conclusions The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem. PMID:24965213

Identification of Boolean Network Models From Time Series Data Incorporating Prior Knowledge.

PubMed

Leifeld, Thomas; Zhang, Zhihua; Zhang, Ping

2018-01-01

Motivation: Mathematical models take an important place in science and engineering. A model can help scientists to explain dynamic behavior of a system and to understand the functionality of system components. Since length of a time series and number of replicates is limited by the cost of experiments, Boolean networks as a structurally simple and parameter-free logical model for gene regulatory networks have attracted interests of many scientists. In order to fit into the biological contexts and to lower the data requirements, biological prior knowledge is taken into consideration during the inference procedure. In the literature, the existing identification approaches can only deal with a subset of possible types of prior knowledge. Results: We propose a new approach to identify Boolean networks from time series data incorporating prior knowledge, such as partial network structure, canalizing property, positive and negative unateness. Using vector form of Boolean variables and applying a generalized matrix multiplication called the semi-tensor product (STP), each Boolean function can be equivalently converted into a matrix expression. Based on this, the identification problem is reformulated as an integer linear programming problem to reveal the system matrix of Boolean model in a computationally efficient way, whose dynamics are consistent with the important dynamics captured in the data. By using prior knowledge the number of candidate functions can be reduced during the inference. Hence, identification incorporating prior knowledge is especially suitable for the case of small size time series data and data without sufficient stimuli. The proposed approach is illustrated with the help of a biological model of the network of oxidative stress response. Conclusions: The combination of efficient reformulation of the identification problem with the possibility to incorporate various types of prior knowledge enables the application of computational model inference to systems with limited amount of time series data. The general applicability of this methodological approach makes it suitable for a variety of biological systems and of general interest for biological and medical research.

Interpolation of the Extended Boolean Retrieval Model.

ERIC Educational Resources Information Center

Zanger, Daniel Z.

2002-01-01

Presents an interpolation theorem for an extended Boolean information retrieval model. Results show that whenever two or more documents are similarly ranked at any two points for a query containing exactly two terms, then they are similarly ranked at all points in between; and that results can fail for queries with more than two terms. (Author/LRW)

The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students

ERIC Educational Resources Information Center

Tomaszewski, Robert

2016-01-01

Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…

Energy and criticality in random Boolean networks

NASA Astrophysics Data System (ADS)

Andrecut, M.; Kauffman, S. A.

2008-06-01

The central issue of the research on the Random Boolean Networks (RBNs) model is the characterization of the critical transition between ordered and chaotic phases. Here, we discuss an approach based on the ‘energy’ associated with the unsatisfiability of the Boolean functions in the RBNs model, which provides an upper bound estimation for the energy used in computation. We show that in the ordered phase the RBNs are in a ‘dissipative’ regime, performing mostly ‘downhill’ moves on the ‘energy’ landscape. Also, we show that in the disordered phase the RBNs have to ‘hillclimb’ on the ‘energy’ landscape in order to perform computation. The analytical results, obtained using Derrida's approximation method, are in complete agreement with numerical simulations.

Optical programmable Boolean logic unit.

PubMed

Chattopadhyay, Tanay

2011-11-10

Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.

Boolean Dynamic Modeling Approaches to Study Plant Gene Regulatory Networks: Integration, Validation, and Prediction.

PubMed

Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R

2017-01-01

Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.

Designing Networks that are Capable of Self-Healing and Adapting

DTIC Science & Technology

2017-04-01

from statistical mechanics, combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we... principles for self-healing networks, and applications, and construct an all-possible-paths model for network adaptation. 2015-11-16 UNIT CONVERSION...combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we will undertake the fol

Equilibrium and nonequilibrium properties of Boolean decision problems on scale-free graphs with competing interactions with external biases

NASA Astrophysics Data System (ADS)

Zhu, Zheng; Andresen, Juan Carlos; Janzen, Katharina; Katzgraber, Helmut G.

2013-03-01

We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free graphs in a magnetic field. Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show, in agreement with analytical calculations, that the system exhibits a de Almeida-Thouless line. Furthermore, we study avalanches in the system at zero temperature to see if the system displays self-organized criticality. This would suggest that damage (avalanches) can spread across the whole system with nonzero probability, i.e., that Boolean decision problems on scale-free networks with competing interactions are fragile when not in thermal equilibrium.

Implementing neural nets with programmable logic

NASA Technical Reports Server (NTRS)

Vidal, Jacques J.

1988-01-01

Networks of Boolean programmable logic modules are presented as one purely digital class of artificial neural nets. The approach contrasts with the continuous analog framework usually suggested. Programmable logic networks are capable of handling many neural-net applications. They avoid some of the limitations of threshold logic networks and present distinct opportunities. The network nodes are called dynamically programmable logic modules. They can be implemented with digitally controlled demultiplexers. Each node performs a Boolean function of its inputs which can be dynamically assigned. The overall network is therefore a combinational circuit and its outputs are Boolean global functions of the network's input variables. The approach offers definite advantages for VLSI implementation, namely, a regular architecture with limited connectivity, simplicity of the control machinery, natural modularity, and the support of a mature technology.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx; Campos-Cantón, I.

We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enablemore » future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.« less

Stabilizing Motifs in Autonomous Boolean Networks and the Yeast Cell Cycle Oscillator

NASA Astrophysics Data System (ADS)

Sevim, Volkan; Gong, Xinwei; Socolar, Joshua

2009-03-01

Synchronously updated Boolean networks are widely used to model gene regulation. Some properties of these model networks are known to be artifacts of the clocking in the update scheme. Autonomous updating is a less artificial scheme that allows one to introduce small timing perturbations and study stability of the attractors. We argue that the stabilization of a limit cycle in an autonomous Boolean network requires a combination of motifs such as feed-forward loops and auto-repressive links that can correct small fluctuations in the timing of switching events. A recently published model of the transcriptional cell-cycle oscillator in yeast contains the motifs necessary for stability under autonomous updating [1]. [1] D. A. Orlando, et al. Nature (London), 4530 (7197):0 944--947, 2008.

Towards Symbolic Model Checking for Multi-Agent Systems via OBDDs

NASA Technical Reports Server (NTRS)

Raimondi, Franco; Lomunscio, Alessio

2004-01-01

We present an algorithm for model checking temporal-epistemic properties of multi-agent systems, expressed in the formalism of interpreted systems. We first introduce a technique for the translation of interpreted systems into boolean formulae, and then present a model-checking algorithm based on this translation. The algorithm is based on OBDD's, as they offer a compact and efficient representation for boolean formulae.

Feedback Controller Design for the Synchronization of Boolean Control Networks.

PubMed

Liu, Yang; Sun, Liangjie; Lu, Jianquan; Liang, Jinling

2016-09-01

This brief investigates the partial and complete synchronization of two Boolean control networks (BCNs). Necessary and sufficient conditions for partial and complete synchronization are established by the algebraic representations of logical dynamics. An algorithm is obtained to construct the feedback controller that guarantees the synchronization of master and slave BCNs. Two biological examples are provided to illustrate the effectiveness of the obtained results.

Computer Aided Instruction for a Course in Boolean Algebra and Logic Design. Final Report (Revised).

ERIC Educational Resources Information Center

Roy, Rob

The use of computers to prepare deficient college and graduate students for courses that build upon previously acquired information would solve the growing problem of professors who must spend up to one third of their class time in review of material. But examination of students who were taught Boolean Algebra and Logic Design by means of Computer…

Evolution of regulatory networks towards adaptability and stability in a changing environment

NASA Astrophysics Data System (ADS)

Lee, Deok-Sun

2014-11-01

Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

Deriving Laws from Ordering Relations

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2003-01-01

It took much effort in the early days of non-Euclidean geometry to break away from the mindset that all spaces are flat and that two distinct parallel lines do not cross. Up to that point, all that was known was Euclidean geometry, and it was difficult to imagine anything else. We have suffered a similar handicap brought on by the enormous relevance of Boolean algebra to the problems of our age-logic and set theory. Previously, I demonstrated that the algebra of questions is not Boolean, but rather is described by the free distributive algebra. To get to this stage took much effort, as many obstacles-most self-placed-had to be overcome. As Boolean algebras were all I had ever known, it was almost impossible for me to imagine working with an algebra where elements do not have complements. With this realization, it became very clear that the sum and product rules of probability theory at the most basic level had absolutely nothing to do with the Boolean algebra of logical statements. Instead, a measure of degree of inclusion can be invented for many different partially ordered sets, and the sum and product rules fall out of the associativity and distributivity of the algebra. To reinforce this very important idea, this paper will go over how these constructions are made, while focusing on the underlying assumptions. I will derive the sum and product rules for a distributive lattice in general and demonstrate how this leads to probability theory on the Boolean lattice and is related to the calculus of quantum mechanical amplitudes on the partially ordered set of experimental setups. I will also discuss the rules that can be derived from modular lattices and their relevance to the cross-ratio of projective geometry.

Identification of control targets in Boolean molecular network models via computational algebra.

PubMed

Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard

2016-09-23

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 potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

The computational core and fixed point organization in Boolean networks

NASA Astrophysics Data System (ADS)

Correale, L.; Leone, M.; Pagnani, A.; Weigt, M.; Zecchina, R.

2006-03-01

In this paper, we analyse large random Boolean networks in terms of a constraint satisfaction problem. We first develop an algorithmic scheme which allows us to prune simple logical cascades and underdetermined variables, returning thereby the computational core of the network. Second, we apply the cavity method to analyse the number and organization of fixed points. We find in particular a phase transition between an easy and a complex regulatory phase, the latter being characterized by the existence of an exponential number of macroscopically separated fixed point clusters. The different techniques developed are reinterpreted as algorithms for the analysis of single Boolean networks, and they are applied in the analysis of and in silico experiments on the gene regulatory networks of baker's yeast (Saccharomyces cerevisiae) and the segment-polarity genes of the fruitfly Drosophila melanogaster.

Observability of Boolean multiplex control networks

NASA Astrophysics Data System (ADS)

Wu, Yuhu; Xu, Jingxue; Sun, Xi-Ming; Wang, Wei

2017-04-01

Boolean multiplex (multilevel) networks (BMNs) are currently receiving considerable attention as theoretical arguments for modeling of biological systems and system level analysis. Studying control-related problems in BMNs may not only provide new views into the intrinsic control in complex biological systems, but also enable us to develop a method for manipulating biological systems using exogenous inputs. In this article, the observability of the Boolean multiplex control networks (BMCNs) are studied. First, the dynamical model and structure of BMCNs with control inputs and outputs are constructed. By using of Semi-Tensor Product (STP) approach, the logical dynamics of BMCNs is converted into an equivalent algebraic representation. Then, the observability of the BMCNs with two different kinds of control inputs is investigated by giving necessary and sufficient conditions. Finally, examples are given to illustrate the efficiency of the obtained theoretical results.

Modeling stochasticity and robustness in gene regulatory networks.

PubMed

Garg, Abhishek; Mohanram, Kartik; Di Cara, Alessandro; De Micheli, Giovanni; Xenarios, Ioannis

2009-06-15

Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.

Discrete interference modeling via boolean algebra.

PubMed

Beckhoff, Gerhard

2011-01-01

Two types of boolean functions are considered, the locus function of n variables, and the interval function of ν = n - 1 variables. A 1-1 mapping is given that takes elements (cells) of the interval function to antidual pairs of elements in the locus function, and vice versa. A set of ν binary codewords representing the intervals are defined and used to generate the codewords of all genomic regions. Next a diallelic three-point system is reviewed in the light of boolean functions, which leads to redefining complete interference by a logic function. Together with the upper bound of noninterference already defined by a boolean function, it confines the region of interference. Extensions of these two functions to any finite number of ν are straightforward, but have been also made in terms of variables taken from the inclusion-exclusion principle (expressing "at least" and "exactly equal to" a decimal integer). Two coefficients of coincidence for systems with more than three loci are defined and discussed, one using the average of several individual coefficients and the other taking as coefficient a real number between zero and one. Finally, by way of a malfunction of the mod-2 addition, it is shown that a four-point system may produce two different functions, one of which exhibiting loss of a class of odd recombinants.

Boolean decision problems with competing interactions on scale-free networks: Equilibrium and nonequilibrium behavior in an external bias

NASA Astrophysics Data System (ADS)

Zhu, Zheng; Andresen, Juan Carlos; Moore, M. A.; Katzgraber, Helmut G.

2014-02-01

We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.

Exact Algorithms for Output Encoding, State Assignment and Four-Level Boolean Minimization

DTIC Science & Technology

1989-10-01

APPROVED FOR PUBLIC DISTRIBUTION • DTIC MASSACHUSETTS INTITUTE OF TECHNOLOGY M VLSI PUBLICATIONSJAN 17 1990 VLSI Memo No. 89-569 JN. 9October 1989...nunijize large funclions exacly within reasonable amocunt. of CPt targeting twro-level logic imnplemientations involve finding ap- time. However, thle ,, m ...0(NV!) m ~iimizations . n5 10 The inptut encoding problemt can be exactly solved using mrultiple-valued Boolean nimuization. We present an exact (a) (b

Boolean logic tree of graphene-based chemical system for molecular computation and intelligent molecular search query.

PubMed

Huang, Wei Tao; Luo, Hong Qun; Li, Nian Bing

2014-05-06

The most serious, and yet unsolved, problem of constructing molecular computing devices consists in connecting all of these molecular events into a usable device. This report demonstrates the use of Boolean logic tree for analyzing the chemical event network based on graphene, organic dye, thrombin aptamer, and Fenton reaction, organizing and connecting these basic chemical events. And this chemical event network can be utilized to implement fluorescent combinatorial logic (including basic logic gates and complex integrated logic circuits) and fuzzy logic computing. On the basis of the Boolean logic tree analysis and logic computing, these basic chemical events can be considered as programmable "words" and chemical interactions as "syntax" logic rules to construct molecular search engine for performing intelligent molecular search query. Our approach is helpful in developing the advanced logic program based on molecules for application in biosensing, nanotechnology, and drug delivery.

A single-layer platform for Boolean logic and arithmetic through DNA excision in mammalian cells

PubMed Central

Weinberg, Benjamin H.; Hang Pham, N. T.; Caraballo, Leidy D.; Lozanoski, Thomas; Engel, Adrien; Bhatia, Swapnil; Wong, Wilson W.

2017-01-01

Genetic circuits engineered for mammalian cells often require extensive fine-tuning to perform their intended functions. To overcome this problem, we present a generalizable biocomputing platform that can engineer genetic circuits which function in human cells with minimal optimization. We used our Boolean Logic and Arithmetic through DNA Excision (BLADE) platform to build more than 100 multi-input-multi-output circuits. We devised a quantitative metric to evaluate the performance of the circuits in human embryonic kidney and Jurkat T cells. Of 113 circuits analysed, 109 functioned (96.5%) with the correct specified behavior without any optimization. We used our platform to build a three-input, two-output Full Adder and six-input, one-output Boolean Logic Look Up Table. We also used BLADE to design circuits with temporal small molecule-mediated inducible control and circuits that incorporate CRISPR/Cas9 to regulate endogenous mammalian genes. PMID:28346402

An Automated Design Framework for Multicellular Recombinase Logic.

PubMed

Guiziou, Sarah; Ulliana, Federico; Moreau, Violaine; Leclere, Michel; Bonnet, Jerome

2018-05-18

Tools to systematically reprogram cellular behavior are crucial to address pressing challenges in manufacturing, environment, or healthcare. Recombinases can very efficiently encode Boolean and history-dependent logic in many species, yet current designs are performed on a case-by-case basis, limiting their scalability and requiring time-consuming optimization. Here we present an automated workflow for designing recombinase logic devices executing Boolean functions. Our theoretical framework uses a reduced library of computational devices distributed into different cellular subpopulations, which are then composed in various manners to implement all desired logic functions at the multicellular level. Our design platform called CALIN (Composable Asynchronous Logic using Integrase Networks) is broadly accessible via a web server, taking truth tables as inputs and providing corresponding DNA designs and sequences as outputs (available at http://synbio.cbs.cnrs.fr/calin ). We anticipate that this automated design workflow will streamline the implementation of Boolean functions in many organisms and for various applications.

Tracking perturbations in Boolean networks with spectral methods

NASA Astrophysics Data System (ADS)

Kesseli, Juha; Rämö, Pauli; Yli-Harja, Olli

2005-08-01

In this paper we present a method for predicting the spread of perturbations in Boolean networks. The method is applicable to networks that have no regular topology. The prediction of perturbations can be performed easily by using a presented result which enables the efficient computation of the required iterative formulas. This result is based on abstract Fourier transform of the functions in the network. In this paper the method is applied to show the spread of perturbations in networks containing a distribution of functions found from biological data. The advances in the study of the spread of perturbations can directly be applied to enable ways of quantifying chaos in Boolean networks. Derrida plots over an arbitrary number of time steps can be computed and thus distributions of functions compared with each other with respect to the amount of order they create in random networks.

Emergence of diversity in homogeneous coupled Boolean networks

NASA Astrophysics Data System (ADS)

Kang, Chris; Aguilar, Boris; Shmulevich, Ilya

2018-05-01

The origin of multicellularity in metazoa is one of the fundamental questions of evolutionary biology. We have modeled the generic behaviors of gene regulatory networks in isogenic cells as stochastic nonlinear dynamical systems—coupled Boolean networks with perturbation. Model simulations under a variety of dynamical regimes suggest that the central characteristic of multicellularity, permanent spatial differentiation (diversification), indeed can arise. Additionally, we observe that diversification is more likely to occur near the critical regime of Lyapunov stability.

Adaptive Neuro-Fuzzy Determination of the Effect of Experimental Parameters on Vehicle Agent Speed Relative to Vehicle Intruder.

PubMed

Shamshirband, Shahaboddin; Banjanovic-Mehmedovic, Lejla; Bosankic, Ivan; Kasapovic, Suad; Abdul Wahab, Ainuddin Wahid Bin

2016-01-01

Intelligent Transportation Systems rely on understanding, predicting and affecting the interactions between vehicles. The goal of this paper is to choose a small subset from the larger set so that the resulting regression model is simple, yet have good predictive ability for Vehicle agent speed relative to Vehicle intruder. The method of ANFIS (adaptive neuro fuzzy inference system) was applied to the data resulting from these measurements. The ANFIS process for variable selection was implemented in order to detect the predominant variables affecting the prediction of agent speed relative to intruder. This process includes several ways to discover a subset of the total set of recorded parameters, showing good predictive capability. The ANFIS network was used to perform a variable search. Then, it was used to determine how 9 parameters (Intruder Front sensors active (boolean), Intruder Rear sensors active (boolean), Agent Front sensors active (boolean), Agent Rear sensors active (boolean), RSSI signal intensity/strength (integer), Elapsed time (in seconds), Distance between Agent and Intruder (m), Angle of Agent relative to Intruder (angle between vehicles °), Altitude difference between Agent and Intruder (m)) influence prediction of agent speed relative to intruder. The results indicated that distance between Vehicle agent and Vehicle intruder (m) and angle of Vehicle agent relative to Vehicle Intruder (angle between vehicles °) is the most influential parameters to Vehicle agent speed relative to Vehicle intruder.

Using Common Table Expressions to Build a Scalable Boolean Query Generator for Clinical Data Warehouses

PubMed Central

Harris, Daniel R.; Henderson, Darren W.; Kavuluru, Ramakanth; Stromberg, Arnold J.; Johnson, Todd R.

2015-01-01

We present a custom, Boolean query generator utilizing common-table expressions (CTEs) that is capable of scaling with big datasets. The generator maps user-defined Boolean queries, such as those interactively created in clinical-research and general-purpose healthcare tools, into SQL. We demonstrate the effectiveness of this generator by integrating our work into the Informatics for Integrating Biology and the Bedside (i2b2) query tool and show that it is capable of scaling. Our custom generator replaces and outperforms the default query generator found within the Clinical Research Chart (CRC) cell of i2b2. In our experiments, sixteen different types of i2b2 queries were identified by varying four constraints: date, frequency, exclusion criteria, and whether selected concepts occurred in the same encounter. We generated non-trivial, random Boolean queries based on these 16 types; the corresponding SQL queries produced by both generators were compared by execution times. The CTE-based solution significantly outperformed the default query generator and provided a much more consistent response time across all query types (M=2.03, SD=6.64 vs. M=75.82, SD=238.88 seconds). Without costly hardware upgrades, we provide a scalable solution based on CTEs with very promising empirical results centered on performance gains. The evaluation methodology used for this provides a means of profiling clinical data warehouse performance. PMID:25192572

Boolean Modeling of Neural Systems with Point-Process Inputs and Outputs. Part I: Theory and Simulations

PubMed Central

Marmarelis, Vasilis Z.; Zanos, Theodoros P.; Berger, Theodore W.

2010-01-01

This paper presents a new modeling approach for neural systems with point-process (spike) inputs and outputs that utilizes Boolean operators (i.e. modulo 2 multiplication and addition that correspond to the logical AND and OR operations respectively, as well as the AND_NOT logical operation representing inhibitory effects). The form of the employed mathematical models is akin to a “Boolean-Volterra” model that contains the product terms of all relevant input lags in a hierarchical order, where terms of order higher than first represent nonlinear interactions among the various lagged values of each input point-process or among lagged values of various inputs (if multiple inputs exist) as they reflect on the output. The coefficients of this Boolean-Volterra model are also binary variables that indicate the presence or absence of the respective term in each specific model/system. Simulations are used to explore the properties of such models and the feasibility of their accurate estimation from short data-records in the presence of noise (i.e. spurious spikes). The results demonstrate the feasibility of obtaining reliable estimates of such models, with excitatory and inhibitory terms, in the presence of considerable noise (spurious spikes) in the outputs and/or the inputs in a computationally efficient manner. A pilot application of this approach to an actual neural system is presented in the companion paper (Part II). PMID:19517238

Inferring Toxicological Responses of HepG2 Cells from ...

EPA Pesticide Factsheets

Understanding the dynamic perturbation of cell states by chemicals can aid in for predicting their adverse effects. High-content imaging (HCI) was used to measure the state of HepG2 cells over three time points (1, 24, and 72 h) in response to 976 ToxCast chemicals for 10 different concentrations (0.39-200µM). Cell state was characterized by p53 activation (p53), c-Jun activation (SK), phospho-Histone H2A.x (OS), phospho-Histone H3 (MA), alpha tubulin (Mt), mitochondrial membrane potential (MMP), mitochondrial mass (MM), cell cycle arrest (CCA), nuclear size (NS) and cell number (CN). Dynamic cell state perturbations due to each chemical concentration were utilized to infer coarse-grained dependencies between cellular functions as Boolean networks (BNs). BNs were inferred from data in two steps. First, the data for each state variable were discretized into changed/active (> 1 standard deviation), and unchanged/inactive values. Second, the discretized data were used to learn Boolean relationships between variables. In our case, a BN is a wiring diagram between nodes that represent 10 previously described observable phenotypes. Functional relationships between nodes were represented as Boolean functions. We found that inferred BN show that HepG2 cell response is chemical and concentration specific. We observed presence of both point and cycle BN attractors. In addition, there are instances where Boolean functions were not found. We believe that this may be either

American College of Rheumatology/European League Against Rheumatism remission criteria for rheumatoid arthritis maintain reliable performance when evaluated in 44 joints.

PubMed

Kaneko, Yuko; Kondo, Harumi; Takeuchi, Tsutomu

2013-08-01

To investigate the performance of the new remission criteria for rheumatoid arthritis (RA) in daily clinical practice and the effect of possible misclassification of remission when 44 joints are assessed. Disease activity and remission rate were calculated according to the Disease Activity Score (DAS28), Simplified Disease Activity Index (SDAI), Clinical Disease Activity Index (CDAI), and a Boolean-based definition for 1402 patients with RA in Keio University Hospital. Characteristics of patients in remission were investigated, and the number of misclassified patients was determined--those classified as being in remission based on 28-joint count but as nonremission based on a 44-joint count for each definition criterion. Of all patients analyzed, 46.6%, 45.9%, 41.0%, and 31.5% were classified as in remission in the DAS28, SDAI, CDAI, and Boolean definitions, respectively. Patients classified into remission based only on the DAS28 showed relatively low erythrocyte sedimentation rates but greater swollen joint counts than those classified into remission based on the other definitions. In patients classified into remission based only on the Boolean criteria, the mean physician global assessment was greater than the mean patient global assessment. Although 119 patients had ≤ 1 involved joint in the 28-joint count but > 1 in the 44-joint count, only 34 of these 119 (2.4% of all subjects) were found to have been misclassified into remission. In practice, about half of patients with RA can achieve clinical remission within the DAS28, SDAI, and CDAI; and one-third according to the Boolean-based definition. Patients classified in remission based on a 28-joint count may have pain and swelling in the feet, but misclassification of remission was relatively rare and was seen in only 2.4% of patients under a Boolean definition. The 28-joint count can be sufficient for assessing clinical remission based on the new remission criteria.

Random Boolean networks for autoassociative memory: Optimization and sequential learning

NASA Astrophysics Data System (ADS)

Sherrington, D.; Wong, K. Y. M.

Conventional neural networks are based on synaptic storage of information, even when the neural states are discrete and bounded. In general, the set of potential local operations is much greater. Here we discuss some aspects of the properties of networks of binary neurons with more general Boolean functions controlling the local dynamics. Two specific aspects are emphasised; (i) optimization in the presence of noise and (ii) a simple model for short-term memory exhibiting primacy and recency in the recall of sequentially taught patterns.

Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zheng, Jinbin, E-mail: jbzheng518@163.com

2014-10-06

In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.

Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.

PubMed

Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek

2015-08-07

The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.

Separating OR, SUM, and XOR Circuits.

PubMed

Find, Magnus; Göös, Mika; Järvisalo, Matti; Kaski, Petteri; Koivisto, Mikko; Korhonen, Janne H

2016-08-01

Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity: We show how to obtain matrices that admit OR-circuits of size O ( n ), but require SUM-circuits of size Ω( n 3/2 /log 2 n ).We consider the task of rewriting a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis.

Boolean gates on actin filaments

NASA Astrophysics Data System (ADS)

Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew

2016-01-01

Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications.

PyBoolNet: a python package for the generation, analysis and visualization of boolean networks.

PubMed

Klarner, Hannes; Streck, Adam; Siebert, Heike

2017-03-01

The goal of this project is to provide a simple interface to working with Boolean networks. Emphasis is put on easy access to a large number of common tasks including the generation and manipulation of networks, attractor and basin computation, model checking and trap space computation, execution of established graph algorithms as well as graph drawing and layouts. P y B ool N et is a Python package for working with Boolean networks that supports simple access to model checking via N u SMV, standard graph algorithms via N etwork X and visualization via dot . In addition, state of the art attractor computation exploiting P otassco ASP is implemented. The package is function-based and uses only native Python and N etwork X data types. https://github.com/hklarner/PyBoolNet. hannes.klarner@fu-berlin.de. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Discrete dynamic modeling of cellular signaling networks.

PubMed

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

Phase diagram of restricted Boltzmann machines and generalized Hopfield networks with arbitrary priors.

PubMed

Barra, Adriano; Genovese, Giuseppe; Sollich, Peter; Tantari, Daniele

2018-02-01

Restricted Boltzmann machines are described by the Gibbs measure of a bipartite spin glass, which in turn can be seen as a generalized Hopfield network. This equivalence allows us to characterize the state of these systems in terms of their retrieval capabilities, both at low and high load, of pure states. We study the paramagnetic-spin glass and the spin glass-retrieval phase transitions, as the pattern (i.e., weight) distribution and spin (i.e., unit) priors vary smoothly from Gaussian real variables to Boolean discrete variables. Our analysis shows that the presence of a retrieval phase is robust and not peculiar to the standard Hopfield model with Boolean patterns. The retrieval region becomes larger when the pattern entries and retrieval units get more peaked and, conversely, when the hidden units acquire a broader prior and therefore have a stronger response to high fields. Moreover, at low load retrieval always exists below some critical temperature, for every pattern distribution ranging from the Boolean to the Gaussian case.

Experimental Clocking of Nanomagnets with Strain for Ultralow Power Boolean Logic.

PubMed

D'Souza, Noel; Salehi Fashami, Mohammad; Bandyopadhyay, Supriyo; Atulasimha, Jayasimha

2016-02-10

Nanomagnetic implementations of Boolean logic have attracted attention because of their nonvolatility and the potential for unprecedented overall energy-efficiency. Unfortunately, the large dissipative losses that occur when nanomagnets are switched with a magnetic field or spin-transfer-torque severely compromise the energy-efficiency. Recently, there have been experimental reports of utilizing the Spin Hall effect for switching magnets, and theoretical proposals for strain induced switching of single-domain magnetostrictive nanomagnets, that might reduce the dissipative losses significantly. Here, we experimentally demonstrate, for the first time that strain-induced switching of single-domain magnetostrictive nanomagnets of lateral dimensions ∼200 nm fabricated on a piezoelectric substrate can implement a nanomagnetic Boolean NOT gate and steer bit information unidirectionally in dipole-coupled nanomagnet chains. On the basis of the experimental results with bulk PMN-PT substrates, we estimate that the energy dissipation for logic operations in a reasonably scaled system using thin films will be a mere ∼1 aJ/bit.

Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks

PubMed Central

Lähdesmäki, Harri; Hautaniemi, Sampsa; Shmulevich, Ilya; Yli-Harja, Olli

2006-01-01

A significant amount of attention has recently been focused on modeling of gene regulatory networks. Two frequently used large-scale modeling frameworks are Bayesian networks (BNs) and Boolean networks, the latter one being a special case of its recent stochastic extension, probabilistic Boolean networks (PBNs). PBN is a promising model class that generalizes the standard rule-based interactions of Boolean networks into the stochastic setting. Dynamic Bayesian networks (DBNs) is a general and versatile model class that is able to represent complex temporal stochastic processes and has also been proposed as a model for gene regulatory systems. In this paper, we concentrate on these two model classes and demonstrate that PBNs and a certain subclass of DBNs can represent the same joint probability distribution over their common variables. The major benefit of introducing the relationships between the models is that it opens up the possibility of applying the standard tools of DBNs to PBNs and vice versa. Hence, the standard learning tools of DBNs can be applied in the context of PBNs, and the inference methods give a natural way of handling the missing values in PBNs which are often present in gene expression measurements. Conversely, the tools for controlling the stationary behavior of the networks, tools for projecting networks onto sub-networks, and efficient learning schemes can be used for DBNs. In other words, the introduced relationships between the models extend the collection of analysis tools for both model classes. PMID:17415411

Towards data integration automation for the French rare disease registry.

PubMed

Maaroufi, Meriem; Choquet, Rémy; Landais, Paul; Jaulent, Marie-Christine

2015-01-01

Building a medical registry upon an existing infrastructure and rooted practices is not an easy task. It is the case for the BNDMR project, the French rare disease registry, that aims to collect administrative and medical data of rare disease patients seen in different hospitals. To avoid duplicating data entry for health professionals, the project plans to deploy connectors with the existing systems to automatically retrieve data. Given the data heterogeneity and the large number of source systems, the automation of connectors creation is required. In this context, we propose a methodology that optimizes the use of existing alignment approaches in the data integration processes. The generated mappings are formalized in exploitable mapping expressions. Following this methodology, a process has been experimented on specific data types of a source system: Boolean and predefined lists. As a result, effectiveness of the used alignment approach has been enhanced and more good mappings have been detected. Nonetheless, further improvements could be done to deal with the semantic issue and process other data types.

Towards data integration automation for the French rare disease registry

PubMed Central

Maaroufi, Meriem; Choquet, Rémy; Landais, Paul; Jaulent, Marie-Christine

2015-01-01

Building a medical registry upon an existing infrastructure and rooted practices is not an easy task. It is the case for the BNDMR project, the French rare disease registry, that aims to collect administrative and medical data of rare disease patients seen in different hospitals. To avoid duplicating data entry for health professionals, the project plans to deploy connectors with the existing systems to automatically retrieve data. Given the data heterogeneity and the large number of source systems, the automation of connectors creation is required. In this context, we propose a methodology that optimizes the use of existing alignment approaches in the data integration processes. The generated mappings are formalized in exploitable mapping expressions. Following this methodology, a process has been experimented on specific data types of a source system: Boolean and predefined lists. As a result, effectiveness of the used alignment approach has been enhanced and more good mappings have been detected. Nonetheless, further improvements could be done to deal with the semantic issue and process other data types. PMID:26958224

Booly: a new data integration platform.

PubMed

Do, Long H; Esteves, Francisco F; Karten, Harvey J; Bier, Ethan

2010-10-13

Data integration is an escalating problem in bioinformatics. We have developed a web tool and warehousing system, Booly, that features a simple yet flexible data model coupled with the ability to perform powerful comparative analysis, including the use of Boolean logic to merge datasets together, and an integrated aliasing system to decipher differing names of the same gene or protein. Furthermore, Booly features a collaborative sharing system and a public repository so that users can retrieve new datasets while contributors can easily disseminate new content. We illustrate the uses of Booly with several examples including: the versatile creation of homebrew datasets, the integration of heterogeneous data to identify genes useful for comparing avian and mammalian brain architecture, and generation of a list of Food and Drug Administration (FDA) approved drugs with possible alternative disease targets. The Booly paradigm for data storage and analysis should facilitate integration between disparate biological and medical fields and result in novel discoveries that can then be validated experimentally. Booly can be accessed at http://booly.ucsd.edu.

Booly: a new data integration platform

PubMed Central

2010-01-01

Background Data integration is an escalating problem in bioinformatics. We have developed a web tool and warehousing system, Booly, that features a simple yet flexible data model coupled with the ability to perform powerful comparative analysis, including the use of Boolean logic to merge datasets together, and an integrated aliasing system to decipher differing names of the same gene or protein. Furthermore, Booly features a collaborative sharing system and a public repository so that users can retrieve new datasets while contributors can easily disseminate new content. Results We illustrate the uses of Booly with several examples including: the versatile creation of homebrew datasets, the integration of heterogeneous data to identify genes useful for comparing avian and mammalian brain architecture, and generation of a list of Food and Drug Administration (FDA) approved drugs with possible alternative disease targets. Conclusions The Booly paradigm for data storage and analysis should facilitate integration between disparate biological and medical fields and result in novel discoveries that can then be validated experimentally. Booly can be accessed at http://booly.ucsd.edu. PMID:20942966

Cross-talk between Rho and Rac GTPases drives deterministic exploration of cellular shape space and morphological heterogeneity.

PubMed

Sailem, Heba; Bousgouni, Vicky; Cooper, Sam; Bakal, Chris

2014-01-22

One goal of cell biology is to understand how cells adopt different shapes in response to varying environmental and cellular conditions. Achieving a comprehensive understanding of the relationship between cell shape and environment requires a systems-level understanding of the signalling networks that respond to external cues and regulate the cytoskeleton. Classical biochemical and genetic approaches have identified thousands of individual components that contribute to cell shape, but it remains difficult to predict how cell shape is generated by the activity of these components using bottom-up approaches because of the complex nature of their interactions in space and time. Here, we describe the regulation of cellular shape by signalling systems using a top-down approach. We first exploit the shape diversity generated by systematic RNAi screening and comprehensively define the shape space a migratory cell explores. We suggest a simple Boolean model involving the activation of Rac and Rho GTPases in two compartments to explain the basis for all cell shapes in the dataset. Critically, we also generate a probabilistic graphical model to show how cells explore this space in a deterministic, rather than a stochastic, fashion. We validate the predictions made by our model using live-cell imaging. Our work explains how cross-talk between Rho and Rac can generate different cell shapes, and thus morphological heterogeneity, in genetically identical populations.

Clinical and structural remission rates increased annually and radiographic progression was continuously inhibited during a 3-year administration of tocilizumab in patients with rheumatoid arthritis: A multi-center, prospective cohort study by the Michinoku Tocilizumab Study Group.

PubMed

Hirabayashi, Yasuhiko; Munakata, Yasuhiko; Miyata, Masayuki; Urata, Yukitomo; Saito, Koichi; Okuno, Hiroshi; Yoshida, Masaaki; Kodera, Takao; Watanabe, Ryu; Miyamoto, Seiya; Ishii, Tomonori; Nakazawa, Shigeshi; Takemori, Hiromitsu; Ando, Takanobu; Kanno, Takashi; Komagamine, Masataka; Kato, Ichiro; Takahashi, Yuichi; Komatsuda, Atsushi; Endo, Kojiro; Murai, Chihiro; Takakubo, Yuya; Miura, Takao; Sato, Yukio; Ichikawa, Kazunobu; Konta, Tsuneo; Chiba, Noriyuki; Muryoi, Tai; Kobayashi, Hiroko; Fujii, Hiroshi; Sekiguchi, Yukio; Hatakeyama, Akira; Ogura, Ken; Sakuraba, Hirotake; Asano, Tomoyuki; Kanazawa, Hiroshi; Suzuki, Eiji; Takasaki, Satoshi; Asakura, Kenichi; Sugisaki, Kota; Suzuki, Yoko; Takagi, Michiaki; Nakayama, Takahiro; Watanabe, Hiroshi; Miura, Keiki; Mori, Yu

2016-11-01

To evaluate the clinical and structural efficacy of tocilizumab (TCZ) during its long-term administration in patients with rheumatoid arthritis (RA). In total, 693 patients with RA who started TCZ therapy were followed for 3 years. Clinical efficacy was evaluated by DAS28-ESR and Boolean remission rates in 544 patients. Joint damage was assessed by calculating the modified total Sharp score (mTSS) in 50 patients. When the reason for discontinuation was limited to inadequate response or adverse events, the 1-, 2-, and 3-year continuation rates were 84.0%, 76.8%, and 72.2%, respectively. The mean DAS28-ESR was initially 5.1 and decreased to 2.5 at 6 months and to 2.2 at 36 months. The Boolean remission rate was initially 0.9% and increased to 21.7% at 6 months and to 32.2% at 36 months. The structural remission rates (ΔmTSS/year ≤ 0.5) were 68.8%, 78.6%, and 88.9% within the first, second, and third years, respectively. The structural remission rate at 3 years (ΔmTSS ≤ 1.5) was 66.0%, and earlier achievement of swollen joint count (SJC) of 1 or less resulted in better outcomes. TCZ was highly efficacious, and bone destruction was strongly prevented. SJC was an easy-to-use indicator of joint destruction.

Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams

DTIC Science & Technology

1992-07-01

memories , where careful attention has been given to programming the memory management routines [Brace et al 19901. To extract maximum performance, it...OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as...indicated 3 X X2 X3 f 000 0 0 01 0X22 0 10 0 0 11 1 d 1 0 0 0 X3 X 3X 1 01 1 1 10 0 - i"o11 10o 1 1 Figure 1: Truth Table and Decison Tree Repremmtatios

Generating probabilistic Boolean networks from a prescribed transition probability matrix.

PubMed

Ching, W-K; Chen, X; Tsing, N-K

2009-11-01

Probabilistic Boolean networks (PBNs) have received much attention in modeling genetic regulatory networks. A PBN can be regarded as a Markov chain process and is characterised by a transition probability matrix. In this study, the authors propose efficient algorithms for constructing a PBN when its transition probability matrix is given. The complexities of the algorithms are also analysed. This is an interesting inverse problem in network inference using steady-state data. The problem is important as most microarray data sets are assumed to be obtained from sampling the steady-state.

Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations

NASA Astrophysics Data System (ADS)

Willemse, Tim A. C.

We introduce the concept of consistent correlations for parameterised Boolean equation systems (PBESs), motivated largely by the laborious proofs of correctness required for most manipulations in this setting. Consistent correlations focus on relating the equations that occur in PBESs, rather than their solutions. For a fragment of PBESs, consistent correlations are shown to coincide with a recently introduced form of bisimulation. Finally, we show that bisimilarity on processes induces consistent correlations on PBESs encoding model checking problems. We apply our theory to two example manipulations from the literature.

A Parallel Approach in Computing Correlation Immunity up to Six Variables

DTIC Science & Technology

2015-03-10

their nonlinearity is divisible by 4. Let CI(n, k) (respectively, BCI (n, k)) be the number of exact order k correlation im- mune, (respectively...further balanced) n-variable Boolean functions. The notations CI(n, k, d), BCI (n, k, d) restricts the previous count to degree d Boolean functions...Theorem 3. The following are true: (i) BCI (n, n, 0) = 0, CI(n, n, 0) = 2, CI(n, k, 1) = BCI (n, k, 1) = 2 ( n k+1 ) , 0 ≤ k ≤ n− 1. (ii) BCI (n, n− 2) = 2

Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder

NASA Astrophysics Data System (ADS)

Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian

2018-04-01

Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.

Preliminary Groundwater Simulations To Compare Different Reconstruction Methods of 3-d Alluvial Heterogeneity

NASA Astrophysics Data System (ADS)

Teles, V.; de Marsily, G.; Delay, F.; Perrier, E.

Alluvial floodplains are extremely heterogeneous aquifers, whose three-dimensional structures are quite difficult to model. In general, when representing such structures, the medium heterogeneity is modeled with classical geostatistical or Boolean meth- ods. Another approach, still in its infancy, is called the genetic method because it simulates the generation of the medium by reproducing sedimentary processes. We developed a new genetic model to obtain a realistic three-dimensional image of allu- vial media. It does not simulate the hydrodynamics of sedimentation but uses semi- empirical and statistical rules to roughly reproduce fluvial deposition and erosion. The main processes, either at the stream scale or at the plain scale, are modeled by simple rules applied to "sediment" entities or to conceptual "erosion" entities. The model was applied to a several kilometer long portion of the Aube River floodplain (France) and reproduced the deposition and erosion cycles that occurred during the inferred climate periods (15 000 BP to present). A three-dimensional image of the aquifer was gener- ated, by extrapolating the two-dimensional information collected on a cross-section of the floodplain. Unlike geostatistical methods, this extrapolation does not use a statis- tical spatial analysis of the data, but a genetic analysis, which leads to a more realistic structure. Groundwater flow and transport simulations in the alluvium were carried out with a three-dimensional flow code or simulator (MODFLOW), using different rep- resentations of the alluvial reservoir of the Aube River floodplain: first an equivalent homogeneous medium, and then different heterogeneous media built either with the traditional geostatistical approach simulating the permeability distribution, or with the new genetic model presented here simulating sediment facies. In the latter case, each deposited entity of a given lithology was assigned a constant hydraulic conductivity value. Results of these models have been compared to assess the value of the genetic approach and will be presented.

Robust optimization with transiently chaotic dynamical systems

NASA Astrophysics Data System (ADS)

Sumi, R.; Molnár, B.; Ercsey-Ravasz, M.

2014-05-01

Efficiently solving hard optimization problems has been a strong motivation for progress in analog computing. In a recent study we presented a continuous-time dynamical system for solving the NP-complete Boolean satisfiability (SAT) problem, with a one-to-one correspondence between its stable attractors and the SAT solutions. While physical implementations could offer great efficiency, the transiently chaotic dynamics raises the question of operability in the presence of noise, unavoidable on analog devices. Here we show that the probability of finding solutions is robust to noise intensities well above those present on real hardware. We also developed a cellular neural network model realizable with analog circuits, which tolerates even larger noise intensities. These methods represent an opportunity for robust and efficient physical implementations.

Separating OR, SUM, and XOR Circuits☆

PubMed Central

Find, Magnus; Göös, Mika; Järvisalo, Matti; Kaski, Petteri; Koivisto, Mikko; Korhonen, Janne H.

2017-01-01

Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity: We show how to obtain matrices that admit OR-circuits of size O(n), but require SUM-circuits of size Ω(n3/2/log2n).We consider the task of rewriting a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis. PMID:28529379

Logic circuits from zero forcing.

PubMed

Burgarth, Daniel; Giovannetti, Vittorio; Hogben, Leslie; Severini, Simone; Young, Michael

We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices to encode each logical bit, we obtain universal computation. We also highlight a phenomenon of "back forcing" as a property of each function. Such a phenomenon occurs in a circuit when the input of gates which have been already used at a given time step is further modified by a computation actually performed at a later stage. Finally, we show that zero forcing can be also used to implement reversible computation. The model introduced here provides a potentially new tool in the analysis of Boolean functions, with particular attention to monotonicity. Moreover, in the light of applications of zero forcing in quantum mechanics, the link with Boolean functions may suggest a new directions in quantum control theory and in the study of engineered quantum spin systems. It is an open technical problem to verify whether there is a link between zero forcing and computation with contact circuits.

Boolean dynamics of genetic regulatory networks inferred from microarray time series data

DOE PAGES

Martin, Shawn; Zhang, Zhaoduo; Martino, Anthony; ...

2007-01-31

Methods available for the inference of genetic regulatory networks strive to produce a single network, usually by optimizing some quantity to fit the experimental observations. In this paper we investigate the possibility that multiple networks can be inferred, all resulting in similar dynamics. This idea is motivated by theoretical work which suggests that biological networks are robust and adaptable to change, and that the overall behavior of a genetic regulatory network might be captured in terms of dynamical basins of attraction. We have developed and implemented a method for inferring genetic regulatory networks for time series microarray data. Our methodmore » first clusters and discretizes the gene expression data using k-means and support vector regression. We then enumerate Boolean activation–inhibition networks to match the discretized data. In conclusion, the dynamics of the Boolean networks are examined. We have tested our method on two immunology microarray datasets: an IL-2-stimulated T cell response dataset and a LPS-stimulated macrophage response dataset. In both cases, we discovered that many networks matched the data, and that most of these networks had similar dynamics.« less

Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.

PubMed

Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W C; Cao, Jinde

2015-08-28

In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results.

Verification and Optimal Control of Context-Sensitive Probabilistic Boolean Networks Using Model Checking and Polynomial Optimization

PubMed Central

Hiraishi, Kunihiko

2014-01-01

One of the significant topics in systems biology is to develop control theory of gene regulatory networks (GRNs). In typical control of GRNs, expression of some genes is inhibited (activated) by manipulating external stimuli and expression of other genes. It is expected to apply control theory of GRNs to gene therapy technologies in the future. In this paper, a control method using a Boolean network (BN) is studied. A BN is widely used as a model of GRNs, and gene expression is expressed by a binary value (ON or OFF). In particular, a context-sensitive probabilistic Boolean network (CS-PBN), which is one of the extended models of BNs, is used. For CS-PBNs, the verification problem and the optimal control problem are considered. For the verification problem, a solution method using the probabilistic model checker PRISM is proposed. For the optimal control problem, a solution method using polynomial optimization is proposed. Finally, a numerical example on the WNT5A network, which is related to melanoma, is presented. The proposed methods provide us useful tools in control theory of GRNs. PMID:24587766

Synchronization Analysis of Master-Slave Probabilistic Boolean Networks

PubMed Central

Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W. C.; Cao, Jinde

2015-01-01

In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results. PMID:26315380

A survey of SAT solver

NASA Astrophysics Data System (ADS)

Gong, Weiwei; Zhou, Xu

2017-06-01

In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design. This paper reviews the main algorithms of the SAT solver in recent years, including serial SAT algorithms, parallel SAT algorithms, SAT algorithms based on GPU, and SAT algorithms based on FPGA. The development of SAT is analyzed comprehensively in this paper. Finally, several possible directions for the development of the SAT problem are proposed.

Modeling bidirectional reflectance of forests and woodlands using Boolean models and geometric optics

NASA Technical Reports Server (NTRS)

Strahler, Alan H.; Jupp, David L. B.

1990-01-01

Geometric-optical discrete-element mathematical models for forest canopies have been developed using the Boolean logic and models of Serra. The geometric-optical approach is considered to be particularly well suited to describing the bidirectional reflectance of forest woodland canopies, where the concentration of leaf material within crowns and the resulting between-tree gaps make plane-parallel, radiative-transfer models inappropriate. The approach leads to invertible formulations, in which the spatial and directional variance provides the means for remote estimation of tree crown size, shape, and total cover from remotedly sensed imagery.

A Parallel Approach in Computing Correlation Immunity up to Six Variables

DTIC Science & Technology

2015-07-24

nonlinearity is divisible by 4. Let CI(n, k) (respectively, BCI (n, k)) be the number of exact order k corre- lation immune, (respectively, further...balanced) n-variable Boolean functions. The notations CI(n, k, d), BCI (n, k, d) restricts the previous count to degree d Boolean functions. Theorem 3...The following are true: (i) BCI (n, n, 0) = 0, CI(n, n, 0) = 2, CI(n, k, 1) = BCI (n, k, 1) = 2 ( n k+1 ) , 0 ≤ k ≤ n− 1. (ii) BCI (n, n− 2) = 2 ( n n−1

High speed all optical logic gates based on quantum dot semiconductor optical amplifiers.

PubMed

Ma, Shaozhen; Chen, Zhe; Sun, Hongzhi; Dutta, Niloy K

2010-03-29

A scheme to realize all-optical Boolean logic functions AND, XOR and NOT using semiconductor optical amplifiers with quantum-dot active layers is studied. nonlinear dynamics including carrier heating and spectral hole-burning are taken into account together with the rate equations scheme. Results show with QD excited state and wetting layer serving as dual-reservoir of carriers, as well as the ultra fast carrier relaxation of the QD device, this scheme is suitable for high speed Boolean logic operations. Logic operation can be carried out up to speed of 250 Gb/s.

Effect of remission definition on healthcare cost savings estimates for patients with rheumatoid arthritis treated with biologic therapies.

PubMed

Barnabe, Cheryl; Thanh, Nguyen Xuan; Ohinmaa, Arto; Homik, Joanne; Barr, Susan G; Martin, Liam; Maksymowych, Walter P

2014-08-01

Sustained remission in rheumatoid arthritis (RA) results in healthcare utilization cost savings. We evaluated the variation in estimates of savings when different definitions of remission [2011 American College of Rheumatology/European League Against Rheumatism Boolean Definition, Simplified Disease Activity Index (SDAI) ≤ 3.3, Clinical Disease Activity Index (CDAI) ≤ 2.8, and Disease Activity Score-28 (DAS28) ≤ 2.6] are applied. The annual mean healthcare service utilization costs were estimated from provincial physician billing claims, outpatient visits, and hospitalizations, with linkage to clinical data from the Alberta Biologics Pharmacosurveillance Program (ABioPharm). Cost savings in patients who had a 1-year continuous period of remission were compared to those who did not, using 4 definitions of remission. In 1086 patients, sustained remission rates were 16.1% for DAS28, 8.8% for Boolean, 5.5% for CDAI, and 4.2% for SDAI. The estimated mean annual healthcare cost savings per patient achieving remission (relative to not) were SDAI $1928 (95% CI 592, 3264), DAS28 $1676 (95% CI 987, 2365), and Boolean $1259 (95% CI 417, 2100). The annual savings by CDAI remission per patient were not significant at $423 (95% CI -1757, 2602). For patients in DAS28, Boolean, and SDAI remission, savings were seen both in costs directly related to RA and its comorbidities, and in costs for non-RA-related conditions. The magnitude of the healthcare cost savings varies according to the remission definition used in classifying patient disease status. The highest point estimate for cost savings was observed in patients attaining SDAI remission and the least with the CDAI; confidence intervals for these estimates do overlap. Future pharmacoeconomic analyses should employ all response definitions in assessing the influence of treatment.

Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach

NASA Astrophysics Data System (ADS)

Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru

2014-12-01

Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.

Transforming Boolean models to continuous models: methodology and application to T-cell receptor signaling

PubMed Central

Wittmann, Dominik M; Krumsiek, Jan; Saez-Rodriguez, Julio; Lauffenburger, Douglas A; Klamt, Steffen; Theis, Fabian J

2009-01-01

Background The understanding of regulatory and signaling networks has long been a core objective in Systems Biology. Knowledge about these networks is mainly of qualitative nature, which allows the construction of Boolean models, where the state of a component is either 'off' or 'on'. While often able to capture the essential behavior of a network, these models can never reproduce detailed time courses of concentration levels. Nowadays however, experiments yield more and more quantitative data. An obvious question therefore is how qualitative models can be used to explain and predict the outcome of these experiments. Results In this contribution we present a canonical way of transforming Boolean into continuous models, where the use of multivariate polynomial interpolation allows transformation of logic operations into a system of ordinary differential equations (ODE). The method is standardized and can readily be applied to large networks. Other, more limited approaches to this task are briefly reviewed and compared. Moreover, we discuss and generalize existing theoretical results on the relation between Boolean and continuous models. As a test case a logical model is transformed into an extensive continuous ODE model describing the activation of T-cells. We discuss how parameters for this model can be determined such that quantitative experimental results are explained and predicted, including time-courses for multiple ligand concentrations and binding affinities of different ligands. This shows that from the continuous model we may obtain biological insights not evident from the discrete one. Conclusion The presented approach will facilitate the interaction between modeling and experiments. Moreover, it provides a straightforward way to apply quantitative analysis methods to qualitatively described systems. PMID:19785753

The DAS28-ESR cutoff value necessary to achieve remission under the new Boolean-based remission criteria in patients receiving tocilizumab.

PubMed

Hirabayashi, Yasuhiko; Ishii, Tomonori

2013-01-01

To seek the cutoff value of the 28-joint disease activity score using erythrocyte sedimentation rate (DAS28-ESR) that is necessary to achieve remission under the new Boolean-based criteria, we analyzed the data for 285 patients with rheumatoid arthritis registered between May 2008 and November 2009 by the Michinoku Tocilizumab Study Group and observed for 1 year after receiving tocilizumab (TCZ) in real clinical practice. Remission rates under the DAS28-ESR criteria and the Boolean criteria were assessed every 6 months after the first TCZ dose. The DAS28-ESR cutoff value necessary to achieve remission under the new criteria was analyzed by receiver operating characteristic (ROC) analysis. Data were analyzed using last observation carried forward. After 12 months of TCZ use, remission was achieved in 164 patients (57.5 %) by DAS28-ESR and 71 patients (24.9 %) under the new criteria for clinical trials. CRP levels scarcely affected remission rates, and the difference between remission rates defined by DAS28-ESR and by the new criteria was mainly due to patient global assessment (PGA). Improvement of PGA was inversely related to disease duration. ROC analysis revealed that the DAS28-ESR cutoff value necessary to predict remission under the new criteria for clinical trials was 1.54, with a sensitivity of 88.7 %, specificity of 85.5 %, positive predictive value of 67.0 %, and negative predictive value of 95.8 %. A DAS28-ESR cutoff value of 1.54 may be reasonable to predict achievement of remission under the new Boolean-based criteria for clinical trials in patients receiving TCZ.

Diagnosing a Strong-Fault Model by Conflict and Consistency

PubMed Central

Zhou, Gan; Feng, Wenquan

2018-01-01

The diagnosis method for a weak-fault model with only normal behaviors of each component has evolved over decades. However, many systems now demand a strong-fault models, the fault modes of which have specific behaviors as well. It is difficult to diagnose a strong-fault model due to its non-monotonicity. Currently, diagnosis methods usually employ conflicts to isolate possible fault and the process can be expedited when some observed output is consistent with the model’s prediction where the consistency indicates probably normal components. This paper solves the problem of efficiently diagnosing a strong-fault model by proposing a novel Logic-based Truth Maintenance System (LTMS) with two search approaches based on conflict and consistency. At the beginning, the original a strong-fault model is encoded by Boolean variables and converted into Conjunctive Normal Form (CNF). Then the proposed LTMS is employed to reason over CNF and find multiple minimal conflicts and maximal consistencies when there exists fault. The search approaches offer the best candidate efficiency based on the reasoning result until the diagnosis results are obtained. The completeness, coverage, correctness and complexity of the proposals are analyzed theoretically to show their strength and weakness. Finally, the proposed approaches are demonstrated by applying them to a real-world domain—the heat control unit of a spacecraft—where the proposed methods are significantly better than best first and conflict directly with A* search methods. PMID:29596302

Enhanced groundwater recharge rates and altered recharge sensitivity to climate variability through subsurface heterogeneity

PubMed Central

Hartmann, Andreas; Gleeson, Tom; Wagener, Thorsten

2017-01-01

Our environment is heterogeneous. In hydrological sciences, the heterogeneity of subsurface properties, such as hydraulic conductivities or porosities, exerts an important control on water balance. This notably includes groundwater recharge, which is an important variable for efficient and sustainable groundwater resources management. Current large-scale hydrological models do not adequately consider this subsurface heterogeneity. Here we show that regions with strong subsurface heterogeneity have enhanced present and future recharge rates due to a different sensitivity of recharge to climate variability compared with regions with homogeneous subsurface properties. Our study domain comprises the carbonate rock regions of Europe, Northern Africa, and the Middle East, which cover ∼25% of the total land area. We compare the simulations of two large-scale hydrological models, one of them accounting for subsurface heterogeneity. Carbonate rock regions strongly exhibit “karstification,” which is known to produce particularly strong subsurface heterogeneity. Aquifers from these regions contribute up to half of the drinking water supply for some European countries. Our results suggest that water management for these regions cannot rely on most of the presently available projections of groundwater recharge because spatially variable storages and spatial concentration of recharge result in actual recharge rates that are up to four times larger for present conditions and changes up to five times larger for potential future conditions than previously estimated. These differences in recharge rates for strongly heterogeneous regions suggest a need for groundwater management strategies that are adapted to the fast transit of water from the surface to the aquifers. PMID:28242703

Enhanced Groundwater Recharge Rates and Altered Recharge Sensitivity to Climate Variability Through Subsurface Heterogeneity

NASA Technical Reports Server (NTRS)

Hartmann, Andreas; Gleeson, Tom; Wada, Yoshihide; Wagener, Thorsten

2017-01-01

Our environment is heterogeneous. In hydrological sciences, the heterogeneity of subsurface properties, such as hydraulic conductivities or porosities, exerts an important control on water balance. This notably includes groundwater recharge, which is an important variable for efficient and sustainable groundwater resources management. Current large-scale hydrological models do not adequately consider this subsurface heterogeneity. Here we show that regions with strong subsurface heterogeneity have enhanced present and future recharge rates due to a different sensitivity of recharge to climate variability compared with regions with homogeneous subsurface properties. Our study domain comprises the carbonate rock regions of Europe, Northern Africa, and the Middle East, which cover 25 of the total land area. We compare the simulations of two large-scale hydrological models, one of them accounting for subsurface heterogeneity. Carbonate rock regions strongly exhibit karstification, which is known to produce particularly strong subsurface heterogeneity. Aquifers from these regions contribute up to half of the drinking water supply for some European countries. Our results suggest that water management for these regions cannot rely on most of the presently available projections of groundwater recharge because spatially variable storages and spatial concentration of recharge result in actual recharge rates that are up to four times larger for present conditions and changes up to five times larger for potential future conditions than previously estimated. These differences in recharge rates for strongly heterogeneous regions suggest a need for groundwater management strategies that are adapted to the fast transit of water from the surface to the aquifers.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miyadera, Takayuki; Imai, Hideki; Graduate School of Science and Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551

This paper discusses the no-cloning theorem in a logicoalgebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result, indicating a relation between the cloningmore » on effect algebras and hidden variables.« less

Diagnostic reasoning techniques for selective monitoring

NASA Technical Reports Server (NTRS)

Homem-De-mello, L. S.; Doyle, R. J.

1991-01-01

An architecture for using diagnostic reasoning techniques in selective monitoring is presented. Given the sensor readings and a model of the physical system, a number of assertions are generated and expressed as Boolean equations. The resulting system of Boolean equations is solved symbolically. Using a priori probabilities of component failure and Bayes' rule, revised probabilities of failure can be computed. These will indicate what components have failed or are the most likely to have failed. This approach is suitable for systems that are well understood and for which the correctness of the assertions can be guaranteed. Also, the system must be such that changes are slow enough to allow the computation.

Computer Program Development Specification for Ada Integrated Environment. Ada Compiler Phases B5-AIE (1). COMP (1).

DTIC Science & Technology

1982-11-05

routines required by the Back End. 3.3 Detailed Functional Requirements 3.3.1 Front End 3.3.1.1 DRIVER The DRIVER is the primary user interface to the...Main 2. Exam ple" !.i ,, , ,vari able • id -: go for B Boolean Ai ’ A" ’ I type d 1 I , for Boolean I (from Standard) i I - - for A function i fuction ...TN in. If a TN cannot be allocated to the primary area of storage it needs(such as a register) it is allocated to the spill area reserved in the local

Concept locator: a client-server application for retrieval of UMLS metathesaurus concepts through complex boolean query.

PubMed

Nadkarni, P M

1997-08-01

Concept Locator (CL) is a client-server application that accesses a Sybase relational database server containing a subset of the UMLS Metathesaurus for the purpose of retrieval of concepts corresponding to one or more query expressions supplied to it. CL's query grammar permits complex Boolean expressions, wildcard patterns, and parenthesized (nested) subexpressions. CL translates the query expressions supplied to it into one or more SQL statements that actually perform the retrieval. The generated SQL is optimized by the client to take advantage of the strengths of the server's query optimizer, and sidesteps its weaknesses, so that execution is reasonably efficient.

A comparison of Boolean-based retrieval to the WAIS system for retrieval of aeronautical information

NASA Technical Reports Server (NTRS)

Marchionini, Gary; Barlow, Diane

1994-01-01

An evaluation of an information retrieval system using a Boolean-based retrieval engine and inverted file architecture and WAIS, which uses a vector-based engine, was conducted. Four research questions in aeronautical engineering were used to retrieve sets of citations from the NASA Aerospace Database which was mounted on a WAIS server and available through Dialog File 108 which served as the Boolean-based system (BBS). High recall and high precision searches were done in the BBS and terse and verbose queries were used in the WAIS condition. Precision values for the WAIS searches were consistently above the precision values for high recall BBS searches and consistently below the precision values for high precision BBS searches. Terse WAIS queries gave somewhat better precision performance than verbose WAIS queries. In every case, a small number of relevant documents retrieved by one system were not retrieved by the other, indicating the incomplete nature of the results from either retrieval system. Relevant documents in the WAIS searches were found to be randomly distributed in the retrieved sets rather than distributed by ranks. Advantages and limitations of both types of systems are discussed.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

NASA Astrophysics Data System (ADS)

Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

Intrinsic noise and deviations from criticality in Boolean gene-regulatory networks

NASA Astrophysics Data System (ADS)

Villegas, Pablo; Ruiz-Franco, José; Hidalgo, Jorge; Muñoz, Miguel A.

2016-10-01

Gene regulatory networks can be successfully modeled as Boolean networks. A much discussed hypothesis says that such model networks reproduce empirical findings the best if they are tuned to operate at criticality, i.e. at the borderline between their ordered and disordered phases. Critical networks have been argued to lead to a number of functional advantages such as maximal dynamical range, maximal sensitivity to environmental changes, as well as to an excellent tradeoff between stability and flexibility. Here, we study the effect of noise within the context of Boolean networks trained to learn complex tasks under supervision. We verify that quasi-critical networks are the ones learning in the fastest possible way -even for asynchronous updating rules- and that the larger the task complexity the smaller the distance to criticality. On the other hand, when additional sources of intrinsic noise in the network states and/or in its wiring pattern are introduced, the optimally performing networks become clearly subcritical. These results suggest that in order to compensate for inherent stochasticity, regulatory and other type of biological networks might become subcritical rather than being critical, all the most if the task to be performed has limited complexity.

On the number of different dynamics in Boolean networks with deterministic update schedules.

PubMed

Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

2013-04-01

Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

PubMed

Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

Boolean logic analysis for flow regime recognition of gas-liquid horizontal flow

NASA Astrophysics Data System (ADS)

Ramskill, Nicholas P.; Wang, Mi

2011-10-01

In order to develop a flowmeter for the accurate measurement of multiphase flows, it is of the utmost importance to correctly identify the flow regime present to enable the selection of the optimal method for metering. In this study, the horizontal flow of air and water in a pipeline was studied under a multitude of conditions using electrical resistance tomography but the flow regimes that are presented in this paper have been limited to plug and bubble air-water flows. This study proposes a novel method for recognition of the prevalent flow regime using only a fraction of the data, thus rendering the analysis more efficient. By considering the average conductivity of five zones along the central axis of the tomogram, key features can be identified, thus enabling the recognition of the prevalent flow regime. Boolean logic and frequency spectrum analysis has been applied for flow regime recognition. Visualization of the flow using the reconstructed images provides a qualitative comparison between different flow regimes. Application of the Boolean logic scheme enables a quantitative comparison of the flow patterns, thus reducing the subjectivity in the identification of the prevalent flow regime.

The relationships between low back pain and lumbar lordosis: a systematic review and meta-analysis.

PubMed

Chun, Se-Woong; Lim, Chai-Young; Kim, Keewon; Hwang, Jinseub; Chung, Sun G

2017-08-01

Clinicians regard lumbar lordotic curvature (LLC) with respect to low back pain (LBP) in a contradictory fashion. The time-honored point of view is that LLC itself, or its increment, causes LBP. On the other hand, recently, the biomechanical role of LLC has been emphasized, and loss of lordosis is considered a possible cause of LBP. The relationship between LLC and LBP has immense clinical significance, because it serves as the basis of therapeutic exercises for treating and preventing LBP. This study aimed to (1) determine the difference in LLC in those with and without LBP and (2) investigate confounding factors that might affect the association between LLC and LBP. Systematic review and meta-analysis. The inclusion criteria consisted of observational studies that included information on lumbar lordotic angle (LLA) assessed by radiological image, in both patients with LBP and healthy controls. Studies solely involving pediatric populations, or addressing spinal conditions of nondegenerative causes, were excluded. A systematic electronic search of Medline, Embase, Cochrane Library, CINAHL, Scopus, PEDro, and Web of Science using terms related to lumbar alignment and Boolean logic was performed: (lumbar lordo*) or (lumbar alignment) or (sagittal alignment) or (sagittal balance). Standardized mean differences (SMD) and 95% confidence intervals (CI) were estimated, and chi-square and I 2 statistics were used to assess within-group heterogeneity by random effects model. Additionally, the age and gender of participants, spinal disease entity, and the severity and duration of LBP were evaluated as possible confounding factors. A total of 13 studies consisting of 796 patients with LBP and 927 healthy controls were identified. Overall, patients with LBP tended to have smaller LLA than healthy controls. However, the studies were heterogeneous. In the meta-regression analysis, the factors of age, severity of LBP, and spinal disease entity were revealed to contribute significantly to variance between studies. In the subgroup analysis of the five studies that compared patients with disc herniation or degeneration with healthy controls, patients with LBP had smaller LLA (SMD: -0.94, 95% CI: -1.19 to -0.69), with sufficient homogeneity based on significance level of .1 (I 2 =45.7%, p=.118). In the six age-matched studies, patients with LBP had smaller LLA than healthy controls (SMD: -0.33, 95% CI: -0.46 to -0.21), without statistical heterogeneity (I 2 =0%, p=.916). This meta-analysis demonstrates a strong relationship between LBP and decreased LLC, especially when compared with age-matched healthy controls. Among specific diseases, LBP by disc herniation or degeneration was shown to be substantially associated with the loss of LLC. Copyright © 2017 Elsevier Inc. All rights reserved.

Boolean function applied to Mimosa pudica movements.

PubMed

De Luccia, Thiago Paes de Barros; Friedman, Pedro

2011-09-01

Seismonastic or thigmonastic movements of Mimosa pudica L. is mostly because of the fast loss of water from swollen motor cells, resulting in temporary collapse of cells and quick curvature in the parts where these cells are located. Because of this, the plant has been much studied since the 18th century, leading us to think about the classical binomial stimulus-response (action-reaction) when compared to animals. Mechanic and electrical stimuli were used to investigate the analogy of mimosa branch with an artificial neuron model and to observe the action potential propagation through the mimosa branch. Boolean function applied to the mimosa branch in analogy with an artificial neuron model is one of the peculiarities of our hypothesis.

Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Y.; Zhong, Y. P.; Deng, Y. F.

2013-12-21

Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices.

Reservoir computing with a single time-delay autonomous Boolean node

NASA Astrophysics Data System (ADS)

Haynes, Nicholas D.; Soriano, Miguel C.; Rosin, David P.; Fischer, Ingo; Gauthier, Daniel J.

2015-02-01

We demonstrate reservoir computing with a physical system using a single autonomous Boolean logic element with time-delay feedback. The system generates a chaotic transient with a window of consistency lasting between 30 and 300 ns, which we show is sufficient for reservoir computing. We then characterize the dependence of computational performance on system parameters to find the best operating point of the reservoir. When the best parameters are chosen, the reservoir is able to classify short input patterns with performance that decreases over time. In particular, we show that four distinct input patterns can be classified for 70 ns, even though the inputs are only provided to the reservoir for 7.5 ns.

Questions Revisited: A Close Examination of Calculus of Inference and Inquiry

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.; Koga, Dennis (Technical Monitor)

2003-01-01

In this paper I examine more closely the way in which probability theory, the calculus of inference, is derived from the Boolean lattice structure of logical assertions ordered by implication. I demonstrate how the duality between the logical conjunction and disjunction in Boolean algebra is lost when deriving the probability calculus. In addition, I look more closely at the other lattice identities to verify that they are satisfied by the probability calculus. Last, I look towards developing the calculus of inquiry demonstrating that there is a sum and product rule for the relevance measure as well as a Bayes theorem. Current difficulties in deriving the complete inquiry calculus will also be discussed.

Optical reversible programmable Boolean logic unit.

PubMed

Chattopadhyay, Tanay

2012-07-20

Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.

A sparse matrix algorithm on the Boolean vector machine

NASA Technical Reports Server (NTRS)

Wagner, Robert A.; Patrick, Merrell L.

1988-01-01

VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.

Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases

NASA Astrophysics Data System (ADS)

Zengler, Christoph; Küchlin, Wolfgang

We extend clause learning as performed by most modern SAT Solvers by integrating the computation of Boolean Gröbner bases into the conflict learning process. Instead of learning only one clause per conflict, we compute and learn additional binary clauses from a Gröbner basis of the current conflict. We used the Gröbner basis engine of the logic package Redlog contained in the computer algebra system Reduce to extend the SAT solver MiniSAT with Gröbner basis learning. Our approach shows a significant reduction of conflicts and a reduction of restarts and computation time on many hard problems from the SAT 2009 competition.

Adaptation and survivors in a random Boolean network.

PubMed

Nakamura, Ikuo

2002-04-01

We introduce the competitive agent with imitation strategy in a random Boolean network, in which the agent plays a competitive game that rewards those in minority. After a long time interval, the worst performer changes its strategy to the one of the best and the process is repeated. The network, initially in a chaotic state, evolves to an intermittent state and finally reaches a frozen state. Time series of survived species (whose strategies are imitated by other agents) in the system depend on the connectivity of each agent. In a system with various connectivity groups, the low connectivity groups win the minority game over the high connectivity groups. We also compared the result with mutation strategy system.

Multispecies coexistence of trees in tropical forests: spatial signals of topographic niche differentiation increase with environmental heterogeneity.

PubMed

Brown, C; Burslem, D F R P; Illian, J B; Bao, L; Brockelman, W; Cao, M; Chang, L W; Dattaraja, H S; Davies, S; Gunatilleke, C V S; Gunatilleke, I A U N; Huang, J; Kassim, A R; Lafrankie, J V; Lian, J; Lin, L; Ma, K; Mi, X; Nathalang, A; Noor, S; Ong, P; Sukumar, R; Su, S H; Sun, I F; Suresh, H S; Tan, S; Thompson, J; Uriarte, M; Valencia, R; Yap, S L; Ye, W; Law, R

2013-08-07

Neutral and niche theories give contrasting explanations for the maintenance of tropical tree species diversity. Both have some empirical support, but methods to disentangle their effects have not yet been developed. We applied a statistical measure of spatial structure to data from 14 large tropical forest plots to test a prediction of niche theory that is incompatible with neutral theory: that species in heterogeneous environments should separate out in space according to their niche preferences. We chose plots across a range of topographic heterogeneity, and tested whether pairwise spatial associations among species were more variable in more heterogeneous sites. We found strong support for this prediction, based on a strong positive relationship between variance in the spatial structure of species pairs and topographic heterogeneity across sites. We interpret this pattern as evidence of pervasive niche differentiation, which increases in importance with increasing environmental heterogeneity.

Markovian robots: Minimal navigation strategies for active particles

NASA Astrophysics Data System (ADS)

Nava, Luis Gómez; Großmann, Robert; Peruani, Fernando

2018-04-01

We explore minimal navigation strategies for active particles in complex, dynamical, external fields, introducing a class of autonomous, self-propelled particles which we call Markovian robots (MR). These machines are equipped with a navigation control system (NCS) that triggers random changes in the direction of self-propulsion of the robots. The internal state of the NCS is described by a Boolean variable that adopts two values. The temporal dynamics of this Boolean variable is dictated by a closed Markov chain—ensuring the absence of fixed points in the dynamics—with transition rates that may depend exclusively on the instantaneous, local value of the external field. Importantly, the NCS does not store past measurements of this value in continuous, internal variables. We show that despite the strong constraints, it is possible to conceive closed Markov chain motifs that lead to nontrivial motility behaviors of the MR in one, two, and three dimensions. By analytically reducing the complexity of the NCS dynamics, we obtain an effective description of the long-time motility behavior of the MR that allows us to identify the minimum requirements in the design of NCS motifs and transition rates to perform complex navigation tasks such as adaptive gradient following, detection of minima or maxima, or selection of a desired value in a dynamical, external field. We put these ideas in practice by assembling a robot that operates by the proposed minimalistic NCS to evaluate the robustness of MR, providing a proof of concept that is possible to navigate through complex information landscapes with such a simple NCS whose internal state can be stored in one bit. These ideas may prove useful for the engineering of miniaturized robots.

Phase transition of Boolean networks with partially nested canalizing functions

NASA Astrophysics Data System (ADS)

Jansen, Kayse; Matache, Mihaela Teodora

2013-07-01

We generate the critical condition for the phase transition of a Boolean network governed by partially nested canalizing functions for which a fraction of the inputs are canalizing, while the remaining non-canalizing inputs obey a complementary threshold Boolean function. Past studies have considered the stability of fully or partially nested canalizing functions paired with random choices of the complementary function. In some of those studies conflicting results were found with regard to the presence of chaotic behavior. Moreover, those studies focus mostly on ergodic networks in which initial states are assumed equally likely. We relax that assumption and find the critical condition for the sensitivity of the network under a non-ergodic scenario. We use the proposed mathematical model to determine parameter values for which phase transitions from order to chaos occur. We generate Derrida plots to show that the mathematical model matches the actual network dynamics. The phase transition diagrams indicate that both order and chaos can occur, and that certain parameters induce a larger range of values leading to order versus chaos. The edge-of-chaos curves are identified analytically and numerically. It is shown that the depth of canalization does not cause major dynamical changes once certain thresholds are reached; these thresholds are fairly small in comparison to the connectivity of the nodes.

Development of a computer-aided design software for dental splint in orthognathic surgery

NASA Astrophysics Data System (ADS)

Chen, Xiaojun; Li, Xing; Xu, Lu; Sun, Yi; Politis, Constantinus; Egger, Jan

2016-12-01

In the orthognathic surgery, dental splints are important and necessary to help the surgeon reposition the maxilla or mandible. However, the traditional methods of manual design of dental splints are difficult and time-consuming. The research on computer-aided design software for dental splints is rarely reported. Our purpose is to develop a novel special software named EasySplint to design the dental splints conveniently and efficiently. The design can be divided into two steps, which are the generation of initial splint base and the Boolean operation between it and the maxilla-mandibular model. The initial splint base is formed by ruled surfaces reconstructed using the manually picked points. Then, a method to accomplish Boolean operation based on the distance filed of two meshes is proposed. The interference elimination can be conducted on the basis of marching cubes algorithm and Boolean operation. The accuracy of the dental splint can be guaranteed since the original mesh is utilized to form the result surface. Using EasySplint, the dental splints can be designed in about 10 minutes and saved as a stereo lithography (STL) file for 3D printing in clinical applications. Three phantom experiments were conducted and the efficiency of our method was demonstrated.

Toward using games to teach fundamental computer science concepts

NASA Astrophysics Data System (ADS)

Edgington, Jeffrey Michael

Video and computer games have become an important area of study in the field of education. Games have been designed to teach mathematics, physics, raise social awareness, teach history and geography, and train soldiers in the military. Recent work has created computer games for teaching computer programming and understanding basic algorithms. We present an investigation where computer games are used to teach two fundamental computer science concepts: boolean expressions and recursion. The games are intended to teach the concepts and not how to implement them in a programming language. For this investigation, two computer games were created. One is designed to teach basic boolean expressions and operators and the other to teach fundamental concepts of recursion. We describe the design and implementation of both games. We evaluate the effectiveness of these games using before and after surveys. The surveys were designed to ascertain basic understanding, attitudes and beliefs regarding the concepts. The boolean game was evaluated with local high school students and students in a college level introductory computer science course. The recursion game was evaluated with students in a college level introductory computer science course. We present the analysis of the collected survey information for both games. This analysis shows a significant positive change in student attitude towards recursion and modest gains in student learning outcomes for both topics.

Development of a computer-aided design software for dental splint in orthognathic surgery

PubMed Central

Chen, Xiaojun; Li, Xing; Xu, Lu; Sun, Yi; Politis, Constantinus; Egger, Jan

2016-01-01

In the orthognathic surgery, dental splints are important and necessary to help the surgeon reposition the maxilla or mandible. However, the traditional methods of manual design of dental splints are difficult and time-consuming. The research on computer-aided design software for dental splints is rarely reported. Our purpose is to develop a novel special software named EasySplint to design the dental splints conveniently and efficiently. The design can be divided into two steps, which are the generation of initial splint base and the Boolean operation between it and the maxilla-mandibular model. The initial splint base is formed by ruled surfaces reconstructed using the manually picked points. Then, a method to accomplish Boolean operation based on the distance filed of two meshes is proposed. The interference elimination can be conducted on the basis of marching cubes algorithm and Boolean operation. The accuracy of the dental splint can be guaranteed since the original mesh is utilized to form the result surface. Using EasySplint, the dental splints can be designed in about 10 minutes and saved as a stereo lithography (STL) file for 3D printing in clinical applications. Three phantom experiments were conducted and the efficiency of our method was demonstrated. PMID:27966601

Development of a computer-aided design software for dental splint in orthognathic surgery.

PubMed

Chen, Xiaojun; Li, Xing; Xu, Lu; Sun, Yi; Politis, Constantinus; Egger, Jan

2016-12-14

In the orthognathic surgery, dental splints are important and necessary to help the surgeon reposition the maxilla or mandible. However, the traditional methods of manual design of dental splints are difficult and time-consuming. The research on computer-aided design software for dental splints is rarely reported. Our purpose is to develop a novel special software named EasySplint to design the dental splints conveniently and efficiently. The design can be divided into two steps, which are the generation of initial splint base and the Boolean operation between it and the maxilla-mandibular model. The initial splint base is formed by ruled surfaces reconstructed using the manually picked points. Then, a method to accomplish Boolean operation based on the distance filed of two meshes is proposed. The interference elimination can be conducted on the basis of marching cubes algorithm and Boolean operation. The accuracy of the dental splint can be guaranteed since the original mesh is utilized to form the result surface. Using EasySplint, the dental splints can be designed in about 10 minutes and saved as a stereo lithography (STL) file for 3D printing in clinical applications. Three phantom experiments were conducted and the efficiency of our method was demonstrated.

Bounds on the number of hidden neurons in three-layer binary neural networks.

PubMed

Zhang, Zhaozhi; Ma, Xiaomin; Yang, Yixian

2003-09-01

This paper investigates an important problem concerning the complexity of three-layer binary neural networks (BNNs) with one hidden layer. The neuron in the studied BNNs employs a hard limiter activation function with only integer weights and an integer threshold. The studies are focused on implementations of arbitrary Boolean functions which map from [0, 1]n into [0, 1]. A deterministic algorithm called set covering algorithm (SCA) is proposed for the construction of a three-layer BNN to implement an arbitrary Boolean function. The SCA is based on a unit sphere covering (USC) of the Hamming space (HS) which is chosen in advance. It is proved that for the implementation of an arbitrary Boolean function of n-variables (n > or = 3) by using SCA, [3L/2] hidden neurons are necessary and sufficient, where L is the number of unit spheres contained in the chosen USC of the n-dimensional HS. It is shown that by using SCA, the number of hidden neurons required is much less than that by using a two-parallel hyperplane method. In order to indicate the potential ability of three-layer BNNs, a lower bound on the required number of hidden neurons which is derived by using the method of estimating the Vapnik-Chervonenkis (VC) dimension is also given.

The value of less connected agents in Boolean networks

NASA Astrophysics Data System (ADS)

Epstein, Daniel; Bazzan, Ana L. C.

2013-11-01

In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality that help to see how agents are organized.

Stabilization of perturbed Boolean network attractors through compensatory interactions

PubMed Central

2014-01-01

Background Understanding and ameliorating the effects of network damage are of significant interest, due in part to the variety of applications in which network damage is relevant. For example, the effects of genetic mutations can cascade through within-cell signaling and regulatory networks and alter the behavior of cells, possibly leading to a wide variety of diseases. The typical approach to mitigating network perturbations is to consider the compensatory activation or deactivation of system components. Here, we propose a complementary approach wherein interactions are instead modified to alter key regulatory functions and prevent the network damage from triggering a deregulatory cascade. Results We implement this approach in a Boolean dynamic framework, which has been shown to effectively model the behavior of biological regulatory and signaling networks. We show that the method can stabilize any single state (e.g., fixed point attractors or time-averaged representations of multi-state attractors) to be an attractor of the repaired network. We show that the approach is minimalistic in that few modifications are required to provide stability to a chosen attractor and specific in that interventions do not have undesired effects on the attractor. We apply the approach to random Boolean networks, and further show that the method can in some cases successfully repair synchronous limit cycles. We also apply the methodology to case studies from drought-induced signaling in plants and T-LGL leukemia and find that it is successful in both stabilizing desired behavior and in eliminating undesired outcomes. Code is made freely available through the software package BooleanNet. Conclusions The methodology introduced in this report offers a complementary way to manipulating node expression levels. A comprehensive approach to evaluating network manipulation should take an "all of the above" perspective; we anticipate that theoretical studies of interaction modification, coupled with empirical advances, will ultimately provide researchers with greater flexibility in influencing system behavior. PMID:24885780

Disparity between ultrasound and clinical findings in psoriatic arthritis.

PubMed

Husic, Rusmir; Gretler, Judith; Felber, Anja; Graninger, Winfried B; Duftner, Christina; Hermann, Josef; Dejaco, Christian

2014-08-01

To investigate the association between psoriatic arthritis (PsA)-specific clinical composite scores and ultrasound-verified pathology as well as comparison of clinical and ultrasound definitions of remission. We performed a prospective study on 70 consecutive PsA patients. Clinical assessments included components of Disease Activity Index for Psoriatic Arthritis (DAPSA) and the Composite Psoriatic Disease Activity Index (CPDAI). Minimal disease activity (MDA) and the following remission criteria were applied: CPDAI joint, entheses and dactylitis domains (CPDAI-JED)=0, DAPSA≤3.3, Boolean's remission definition and physician-judged remission (rem-phys). B-mode and power Doppler (PD-) ultrasound findings were semiquantitatively scored at 68 joints (evaluating synovia, peritendinous tissue, tendons and bony changes) and 14 entheses. Ultrasound remission and minimal ultrasound disease activity (MUDA) were defined as PD-score=0 and PD-score ≤1, respectively, at joints, peritendinous tissue, tendons and entheses. DAPSA but not CPDAI correlated with B-mode and PD-synovitis. Ultrasound signs of enthesitis, dactylitis, tenosynovitis and perisynovitis were not linked with clinical composites. Clinical remission or MDA was observed in 15.7% to 47.1% of PsA patients. Ultrasound remission and MUDA were present in 4.3% and 20.0% of patients, respectively. Joint and tendon-related PD-scores were higher in patients with active versus inactive disease according to CPDAI-JED, DAPSA, Boolean's and rem-phys, whereas no difference was observed regarding enthesitis and perisynovitis. DAPSA≤3.3 (OR 3.9, p=0.049) and Boolean's definition (OR 4.6, p=0.03) were more useful to predict MUDA than other remission criteria. PsA-specific composite scores partially reflect ultrasound findings. DAPSA and Boolean's remission definitions better identify MUDA patients than other clinical criteria. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.

PubMed

Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence

2012-08-29

Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2) and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different) biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be translated in a set of ordinary differential equations on probability distributions. We developed a C++ software, MaBoSS, that is able to simulate such a system by applying Kinetic Monte-Carlo (or Gillespie algorithm) on the Boolean state space. This software, parallelized and optimized, computes the temporal evolution of probability distributions and estimates stationary distributions. Applications of the Boolean Kinetic Monte-Carlo are demonstrated for three qualitative models: a toy model, a published model of p53/Mdm2 interaction and a published model of the mammalian cell cycle. Our approach allows to describe kinetic phenomena which were difficult to handle in the original models. In particular, transient effects are represented by time dependent probability distributions, interpretable in terms of cell populations.

Imaging Strong Lateral Heterogeneities with USArray using Body-to-Surface Wave Scattering

NASA Astrophysics Data System (ADS)

Yu, C.; Zhan, Z.; Hauksson, E.; Cochran, E. S.

2017-12-01

Seismic scattering is commonly observed and results from wave propagation in heterogeneous medium. Yet, deterministic characterization of scatterers remains challenging. In this study, we analyze broadband waveforms recorded by the USArray across the entire conterminous US. With array analysis, we observe strong scattered surface waves following the arrival of teleseismic body waves over several hundreds of kilometers. We use back-projection to locate the body-to-surface scattering sources, and detect strong scatterers both around and within the conterminous US. For the former, strong scattering is associated with pronounced bathymetric relief, such as the Patton Escarpment in the Southern California Continental Borderland. For the latter, scatterers are consistent with sharp lateral heterogeneities, such as near the Yellowstone hotspot and Southern California fault zones. We further model the body-to-surface wave scattering using finite-difference simulations. As an example, in the Southern California Continental Borderland a simplified 2-D bathymetric and crustal model are able to predict the arrival times and amplitudes of major scatterers. The modeling also suggests a relatively low shear wave velocity in the Continental Borderland. These observation of strong body-to-surface wave scattering and waveform modeling not only helps us image sharp heterogeneities but also are useful for assessing seismic hazard, including the calibration and refinement of seismic velocity models used to locate earthquakes and simulate strong ground motions.

Relationship between QT Interval Dispersion in acute stroke and stroke prognosis: A Systematic Review

PubMed Central

Lederman, Yitzchok S.; Balucani, Clotilde; Lazar, Jason; Steinberg, Leah; Gugger, James; Levine, Steven R.

2014-01-01

Background QT dispersion (QTd) has been proposed as an indirect ECG measure of heterogeneity of ventricular repolarization. The predictive value of QTd in acute stroke remains controversial. We aimed to clarify the relationship between QTd and acute stroke and stroke prognosis. Methods A systematic review of the literature was performed using pre-specified medical subjects heading (MeSH) terms, Boolean logic and the Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA) guidelines. Eligible studies (a) included ischemic or hemorrhagic stroke and (b) provided QTd measurements. Results Two independent reviewers identified 553 publications. Sixteen articles were included in the final analysis. There were a total of 888 stroke patients: 59% ischemic and 41% hemorrhagic. There was considerable heterogeneity in study design, stroke subtypes, ECG assessment-time, control groups and comparison groups. Nine studies reported a significant association between acute stroke and baseline QTd. Two studies reported that QTd increases are specifically related to hemorrhagic strokes, involvement of the insular cortex, right-side lesions, larger strokes, and increases in 3, 4-dihydroxyphenylethylene glycol in hemorrhagic stroke. Three studies reported QTd to be an independent predictor of stroke mortality. One study each reported increases in QTd in stroke patients who developed ventricular arrhythmias and cardiorespiratory compromise. Conclusions There are few well-designed studies and considerable variability in study design in addressing the significance of QTd in acute stroke. Available data suggest that stroke is likely to be associated with increased QTd. While some evidence suggests a possible prognostic role of QTd in stroke, larger and well-designed studies need to confirm these findings. PMID:25282188

Boolean function applied to Mimosa pudica movements

PubMed Central

Friedman, Pedro

2011-01-01

Seismonastic or thigmonastic movements of Mimosa pudica L. is mostly because of the fast loss of water from swollen motor cells, resulting in temporary collapse of cells and quick curvature in the parts where these cells are located. Because of this, the plant has been much studied since the 18th century, leading us to think about the classical binomial stimulus-response (action-reaction) when compared to animals. Mechanic and electrical stimuli were used to investigate the analogy of mimosa branch with an artificial neuron model and to observe the action potential propagation through the mimosa branch. Boolean function applied to the mimosa branch in analogy with an artificial neuron model is one of the peculiarities of our hypothesis. PMID:21847029

Fisher information at the edge of chaos in random Boolean networks.

PubMed

Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail

2011-01-01

We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.

Investigating Cell Criticality

NASA Astrophysics Data System (ADS)

Serra, R.; Villani, M.; Damiani, C.; Graudenzi, A.; Ingrami, P.; Colacci, A.

Random Boolean networks provide a way to give a precise meaning to the notion that living beings are in a critical state. Some phenomena which are observed in real biological systems (distribution of "avalanches" in gene knock-out experiments) can be modeled using random Boolean networks, and the results can be analytically proven to depend upon the Derrida parameter, which also determines whether the network is critical. By comparing observed and simulated data one can then draw inferences about the criticality of biological cells, although with some care because of the limited number of experimental observations. The relationship between the criticality of a single network and that of a set of interacting networks, which simulate a tissue or a bacterial colony, is also analyzed by computer simulations.

Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions.

PubMed

Qu, Xiangmeng; Wang, Shaopeng; Ge, Zhilei; Wang, Jianbang; Yao, Guangbao; Li, Jiang; Zuo, Xiaolei; Shi, Jiye; Song, Shiping; Wang, Lihua; Li, Li; Pei, Hao; Fan, Chunhai

2017-08-02

Programmable remodelling of cell surfaces enables high-precision regulation of cell behavior. In this work, we developed in vitro constructed DNA-based chemical reaction networks (CRNs) to program on-chip cell adhesion. We found that the RGD-functionalized DNA CRNs are entirely noninvasive when interfaced with the fluidic mosaic membrane of living cells. DNA toehold with different lengths could tunably alter the release kinetics of cells, which shows rapid release in minutes with the use of a 6-base toehold. We further demonstrated the realization of Boolean logic functions by using DNA strand displacement reactions, which include multi-input and sequential cell logic gates (AND, OR, XOR, and AND-OR). This study provides a highly generic tool for self-organization of biological systems.

Reliable computation from contextual correlations

NASA Astrophysics Data System (ADS)

Oestereich, André L.; Galvão, Ernesto F.

2017-12-01

An operational approach to the study of computation based on correlations considers black boxes with one-bit inputs and outputs, controlled by a limited classical computer capable only of performing sums modulo-two. In this setting, it was shown that noncontextual correlations do not provide any extra computational power, while contextual correlations were found to be necessary for the deterministic evaluation of nonlinear Boolean functions. Here we investigate the requirements for reliable computation in this setting; that is, the evaluation of any Boolean function with success probability bounded away from 1 /2 . We show that bipartite CHSH quantum correlations suffice for reliable computation. We also prove that an arbitrarily small violation of a multipartite Greenberger-Horne-Zeilinger noncontextuality inequality also suffices for reliable computation.

The pseudo-Boolean optimization approach to form the N-version software structure

NASA Astrophysics Data System (ADS)

Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.

2015-10-01

The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality. Some additional modifications of MVP have been made to solve the problem of N-version systems design. Those algorithms take into account the discovered specific features of the objective function. The practical experiments have shown the advantage of using these algorithm modifications because of reducing a search space.

A procedure concept for local reflex control of grasping

NASA Technical Reports Server (NTRS)

Fiorini, Paolo; Chang, Jeffrey

1989-01-01

An architecture is proposed for the control of robotic devices, and in particular of anthropomorphic hands, characterized by a hierarchical structure in which every level of the architecture contains data and control function with varying degree of abstraction. Bottom levels of the hierarchy interface directly with sensors and actuators, and process raw data and motor commands. Higher levels perform more symbolic types of tasks, such as application of boolean rules and general planning operations. Layers implementation has to be consistent with the type of operation and its requirements for real time control. It is proposed to implement the rule level with a Boolean Artificial Neural Network characterized by a response time sufficient for producing reflex corrective action at the actuator level.

Robust Ground Target Detection by SAR and IR Sensor Fusion Using Adaboost-Based Feature Selection

PubMed Central

Kim, Sungho; Song, Woo-Jin; Kim, So-Hyun

2016-01-01

Long-range ground targets are difficult to detect in a noisy cluttered environment using either synthetic aperture radar (SAR) images or infrared (IR) images. SAR-based detectors can provide a high detection rate with a high false alarm rate to background scatter noise. IR-based approaches can detect hot targets but are affected strongly by the weather conditions. This paper proposes a novel target detection method by decision-level SAR and IR fusion using an Adaboost-based machine learning scheme to achieve a high detection rate and low false alarm rate. The proposed method consists of individual detection, registration, and fusion architecture. This paper presents a single framework of a SAR and IR target detection method using modified Boolean map visual theory (modBMVT) and feature-selection based fusion. Previous methods applied different algorithms to detect SAR and IR targets because of the different physical image characteristics. One method that is optimized for IR target detection produces unsuccessful results in SAR target detection. This study examined the image characteristics and proposed a unified SAR and IR target detection method by inserting a median local average filter (MLAF, pre-filter) and an asymmetric morphological closing filter (AMCF, post-filter) into the BMVT. The original BMVT was optimized to detect small infrared targets. The proposed modBMVT can remove the thermal and scatter noise by the MLAF and detect extended targets by attaching the AMCF after the BMVT. Heterogeneous SAR and IR images were registered automatically using the proposed RANdom SAmple Region Consensus (RANSARC)-based homography optimization after a brute-force correspondence search using the detected target centers and regions. The final targets were detected by feature-selection based sensor fusion using Adaboost. The proposed method showed good SAR and IR target detection performance through feature selection-based decision fusion on a synthetic database generated by OKTAL-SE. PMID:27447635

Robust Ground Target Detection by SAR and IR Sensor Fusion Using Adaboost-Based Feature Selection.

PubMed

Kim, Sungho; Song, Woo-Jin; Kim, So-Hyun

2016-07-19

Long-range ground targets are difficult to detect in a noisy cluttered environment using either synthetic aperture radar (SAR) images or infrared (IR) images. SAR-based detectors can provide a high detection rate with a high false alarm rate to background scatter noise. IR-based approaches can detect hot targets but are affected strongly by the weather conditions. This paper proposes a novel target detection method by decision-level SAR and IR fusion using an Adaboost-based machine learning scheme to achieve a high detection rate and low false alarm rate. The proposed method consists of individual detection, registration, and fusion architecture. This paper presents a single framework of a SAR and IR target detection method using modified Boolean map visual theory (modBMVT) and feature-selection based fusion. Previous methods applied different algorithms to detect SAR and IR targets because of the different physical image characteristics. One method that is optimized for IR target detection produces unsuccessful results in SAR target detection. This study examined the image characteristics and proposed a unified SAR and IR target detection method by inserting a median local average filter (MLAF, pre-filter) and an asymmetric morphological closing filter (AMCF, post-filter) into the BMVT. The original BMVT was optimized to detect small infrared targets. The proposed modBMVT can remove the thermal and scatter noise by the MLAF and detect extended targets by attaching the AMCF after the BMVT. Heterogeneous SAR and IR images were registered automatically using the proposed RANdom SAmple Region Consensus (RANSARC)-based homography optimization after a brute-force correspondence search using the detected target centers and regions. The final targets were detected by feature-selection based sensor fusion using Adaboost. The proposed method showed good SAR and IR target detection performance through feature selection-based decision fusion on a synthetic database generated by OKTAL-SE.

Emergent dynamics of spatio-temporal chaos in a heterogeneous excitable medium.

PubMed

Bittihn, Philip; Berg, Sebastian; Parlitz, Ulrich; Luther, Stefan

2017-09-01

Self-organized activation patterns in excitable media such as spiral waves and spatio-temporal chaos underlie dangerous cardiac arrhythmias. While the interaction of single spiral waves with different types of heterogeneity has been studied extensively, the effect of heterogeneity on fully developed spatio-temporal chaos remains poorly understood. We investigate how the complexity and stability properties of spatio-temporal chaos in the Bär-Eiswirth model of excitable media depend on the heterogeneity of the underlying medium. We employ different measures characterizing the chaoticity of the system and find that the spatial arrangement of multiple discrete lower excitability regions has a strong impact on the complexity of the dynamics. Varying the number, shape, and spatial arrangement of the heterogeneities, we observe strong emergent effects ranging from increases in chaoticity to the complete cessation of chaos, contrasting the expectation from the homogeneous behavior. The implications of our findings for the development and treatment of arrhythmias in the heterogeneous cardiac muscle are discussed.

Emergent dynamics of spatio-temporal chaos in a heterogeneous excitable medium

NASA Astrophysics Data System (ADS)

Bittihn, Philip; Berg, Sebastian; Parlitz, Ulrich; Luther, Stefan

2017-09-01

Self-organized activation patterns in excitable media such as spiral waves and spatio-temporal chaos underlie dangerous cardiac arrhythmias. While the interaction of single spiral waves with different types of heterogeneity has been studied extensively, the effect of heterogeneity on fully developed spatio-temporal chaos remains poorly understood. We investigate how the complexity and stability properties of spatio-temporal chaos in the Bär-Eiswirth model of excitable media depend on the heterogeneity of the underlying medium. We employ different measures characterizing the chaoticity of the system and find that the spatial arrangement of multiple discrete lower excitability regions has a strong impact on the complexity of the dynamics. Varying the number, shape, and spatial arrangement of the heterogeneities, we observe strong emergent effects ranging from increases in chaoticity to the complete cessation of chaos, contrasting the expectation from the homogeneous behavior. The implications of our findings for the development and treatment of arrhythmias in the heterogeneous cardiac muscle are discussed.

Information processing in dendrites I. Input pattern generalisation.

PubMed

Gurney, K N

2001-10-01

In this paper and its companion, we address the question as to whether there are any general principles underlying information processing in the dendritic trees of biological neurons. In order to address this question, we make two assumptions. First, the key architectural feature of dendrites responsible for many of their information processing abilities is the existence of independent sub-units performing local non-linear processing. Second, any general functional principles operate at a level of abstraction in which neurons are modelled by Boolean functions. To accommodate these assumptions, we therefore define a Boolean model neuron-the multi-cube unit (MCU)-which instantiates the notion of the discrete functional sub-unit. We then use this model unit to explore two aspects of neural functionality: generalisation (in this paper) and processing complexity (in its companion). Generalisation is dealt with from a geometric viewpoint and is quantified using a new metric-the set of order parameters. These parameters are computed for threshold logic units (TLUs), a class of random Boolean functions, and MCUs. Our interpretation of the order parameters is consistent with our knowledge of generalisation in TLUs and with the lack of generalisation in randomly chosen functions. Crucially, the order parameters for MCUs imply that these functions possess a range of generalisation behaviour. We argue that this supports the general thesis that dendrites facilitate input pattern generalisation despite any local non-linear processing within functionally isolated sub-units.

Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.

PubMed

Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

2015-11-01

We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.

Integrating Multiple Data Sources for Combinatorial Marker Discovery: A Study in Tumorigenesis.

PubMed

Bandyopadhyay, Sanghamitra; Mallik, Saurav

2018-01-01

Identification of combinatorial markers from multiple data sources is a challenging task in bioinformatics. Here, we propose a novel computational framework for identifying significant combinatorial markers ( s) using both gene expression and methylation data. The gene expression and methylation data are integrated into a single continuous data as well as a (post-discretized) boolean data based on their intrinsic (i.e., inverse) relationship. A novel combined score of methylation and expression data (viz., ) is introduced which is computed on the integrated continuous data for identifying initial non-redundant set of genes. Thereafter, (maximal) frequent closed homogeneous genesets are identified using a well-known biclustering algorithm applied on the integrated boolean data of the determined non-redundant set of genes. A novel sample-based weighted support ( ) is then proposed that is consecutively calculated on the integrated boolean data of the determined non-redundant set of genes in order to identify the non-redundant significant genesets. The top few resulting genesets are identified as potential s. Since our proposed method generates a smaller number of significant non-redundant genesets than those by other popular methods, the method is much faster than the others. Application of the proposed technique on an expression and a methylation data for Uterine tumor or Prostate Carcinoma produces a set of significant combination of markers. We expect that such a combination of markers will produce lower false positives than individual markers.

Predictive computation of genomic logic processing functions in embryonic development

PubMed Central

Peter, Isabelle S.; Faure, Emmanuel; Davidson, Eric H.

2012-01-01

Gene regulatory networks (GRNs) control the dynamic spatial patterns of regulatory gene expression in development. Thus, in principle, GRN models may provide system-level, causal explanations of developmental process. To test this assertion, we have transformed a relatively well-established GRN model into a predictive, dynamic Boolean computational model. This Boolean model computes spatial and temporal gene expression according to the regulatory logic and gene interactions specified in a GRN model for embryonic development in the sea urchin. Additional information input into the model included the progressive embryonic geometry and gene expression kinetics. The resulting model predicted gene expression patterns for a large number of individual regulatory genes each hour up to gastrulation (30 h) in four different spatial domains of the embryo. Direct comparison with experimental observations showed that the model predictively computed these patterns with remarkable spatial and temporal accuracy. In addition, we used this model to carry out in silico perturbations of regulatory functions and of embryonic spatial organization. The model computationally reproduced the altered developmental functions observed experimentally. Two major conclusions are that the starting GRN model contains sufficiently complete regulatory information to permit explanation of a complex developmental process of gene expression solely in terms of genomic regulatory code, and that the Boolean model provides a tool with which to test in silico regulatory circuitry and developmental perturbations. PMID:22927416

Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata

PubMed Central

Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

2016-01-01

We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours’ values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level. PMID:27660398

Nanotechnology publications and citations by leading countries and blocs

NASA Astrophysics Data System (ADS)

Youtie, Jan; Shapira, Philip; Porter, Alan L.

2008-08-01

This article examines the relative positions with respect to nanotechnology research publications of the European Union (EU), the United States (US), Japan, Germany, China, and three Asian Tiger nations (South Korea, Singapore, and Taiwan). The analysis uses a dataset of nanotechnology publication records for the time period 1990 through 2006 (part year) extracted from the Science Citation Index obtained through the Web of Science and was developed through a two-stage modularized Boolean approach. The results show that although the EU and the US have the highest number of nanotechnology publications, China and other Asian countries are increasing their publications rapidly, taking an ever-larger proportion of the total. When viewed in terms of the quality-based measure of citations, Asian nanotechnology researchers also show growth in recent years. However, by such citation measures, the US still maintains a strongly dominant position, followed by the EU.

Design of a Nanoscale, CMOS-Integrable, Thermal-Guiding Structure for Boolean-Logic and Neuromorphic Computation.

PubMed

Loke, Desmond; Skelton, Jonathan M; Chong, Tow-Chong; Elliott, Stephen R

2016-12-21

One of the requirements for achieving faster CMOS electronics is to mitigate the unacceptably large chip areas required to steer heat away from or, more recently, toward the critical nodes of state-of-the-art devices. Thermal-guiding (TG) structures can efficiently direct heat by "meta-materials" engineering; however, some key aspects of the behavior of these systems are not fully understood. Here, we demonstrate control of the thermal-diffusion properties of TG structures by using nanometer-scale, CMOS-integrable, graphene-on-silica stacked materials through finite-element-methods simulations. It has been shown that it is possible to implement novel, controllable, thermally based Boolean-logic and spike-timing-dependent plasticity operations for advanced (neuromorphic) computing applications using such thermal-guide architectures.

Modeling gene regulatory networks: A network simplification algorithm

NASA Astrophysics Data System (ADS)

Ferreira, Luiz Henrique O.; de Castro, Maria Clicia S.; da Silva, Fabricio A. B.

2016-12-01

Boolean networks have been used for some time to model Gene Regulatory Networks (GRNs), which describe cell functions. Those models can help biologists to make predictions, prognosis and even specialized treatment when some disturb on the GRN lead to a sick condition. However, the amount of information related to a GRN can be huge, making the task of inferring its boolean network representation quite a challenge. The method shown here takes into account information about the interactome to build a network, where each node represents a protein, and uses the entropy of each node as a key to reduce the size of the network, allowing the further inferring process to focus only on the main protein hubs, the ones with most potential to interfere in overall network behavior.

Stability of Boolean multilevel networks.

PubMed

Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir

2012-09-01

The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.

Understanding genetic regulatory networks

NASA Astrophysics Data System (ADS)

Kauffman, Stuart

2003-04-01

Random Boolean networks (RBM) were introduced about 35 years ago as first crude models of genetic regulatory networks. RBNs are comprised of N on-off genes, connected by a randomly assigned regulatory wiring diagram where each gene has K inputs, and each gene is controlled by a randomly assigned Boolean function. This procedure samples at random from the ensemble of all possible NK Boolean networks. The central ideas are to study the typical, or generic properties of this ensemble, and see 1) whether characteristic differences appear as K and biases in Boolean functions are introducted, and 2) whether a subclass of this ensemble has properties matching real cells. Such networks behave in an ordered or a chaotic regime, with a phase transition, "the edge of chaos" between the two regimes. Networks with continuous variables exhibit the same two regimes. Substantial evidence suggests that real cells are in the ordered regime. A key concept is that of an attractor. This is a reentrant trajectory of states of the network, called a state cycle. The central biological interpretation is that cell types are attractors. A number of properties differentiate the ordered and chaotic regimes. These include the size and number of attractors, the existence in the ordered regime of a percolating "sea" of genes frozen in the on or off state, with a remainder of isolated twinkling islands of genes, a power law distribution of avalanches of gene activity changes following perturbation to a single gene in the ordered regime versus a similar power law distribution plus a spike of enormous avalanches of gene changes in the chaotic regime, and the existence of branching pathway of "differentiation" between attractors induced by perturbations in the ordered regime. Noise is serious issue, since noise disrupts attractors. But numerical evidence suggests that attractors can be made very stable to noise, and meanwhile, metaplasias may be a biological manifestation of noise. As we learn more about the wiring diagram and constraints on rules controlling real genes, we can build refined ensembles reflecting these properties, study the generic properties of the refined ensembles, and hope to gain insight into the dynamics of real cells.

Electrical Circuits in the Mathematics/Computer Science Classroom.

ERIC Educational Resources Information Center

McMillan, Robert D.

1988-01-01

Shows how, with little or no electrical background, students can apply Boolean algebra concepts to design and build integrated electrical circuits in the classroom that will reinforce important ideas in mathematics. (PK)

Topological Aspects of Information Retrieval.

ERIC Educational Resources Information Center

Egghe, Leo; Rousseau, Ronald

1998-01-01

Discusses topological aspects of theoretical information retrieval, including retrieval topology; similarity topology; pseudo-metric topology; document spaces as topological spaces; Boolean information retrieval as a subsystem of any topological system; and proofs of theorems. (LRW)

Combinatorial optimization in foundry practice

NASA Astrophysics Data System (ADS)

Antamoshkin, A. N.; Masich, I. S.

2016-04-01

The multicriteria mathematical model of foundry production capacity planning is suggested in the paper. The model is produced in terms of pseudo-Boolean optimization theory. Different search optimization methods were used to solve the obtained problem.

Defining of the BDX930 Assembly Language

NASA Technical Reports Server (NTRS)

Boyer, R. S.; Moore, J. S.

1983-01-01

A definition of the BDX930 assembly language is presented. Various definition problems and suggested solutions are included. A class of defined recognizers based on boolean valued nowrecursive functions is employed in preprocessing.

Application of a Discrete Nonlinear Spectral Model to Ideal Cases of Wind Wave Generation.

DTIC Science & Technology

1982-04-01

WRITE (6965)) bBD ODRM4T (IHII C SKI ’> 3 LINS i AND WRITE PLOT TITLE (IDOCHAR S PER LINE t 10 LINES AXI4CH-,(NClkR*9) /10 dRJTE (660) (TJL..EfI),I-I...A*CaGE.D.)JPP-J>P 𔃻 I F ( 8 D Do)) jpp-j P?+2 MiFPPeE)’i)&O TO 44 73 40JT-NPr(NIN,JPP) ;o TD (72, 14,7b,7BhNOUT 44 IF(A*3)q46q4b47 46 JPP-2 ;0 TO 73...EXTEZNAL FJNrI3N LAND IJS 13 THE BOOLEAN I.EoLDGICAL$ AND 01’ Td C FULLWORD INTEGCRS. C EXTEtNAL FJN:TION LOR, I,JS 1)7 THE BOOLEAN OR OF TWO FULLWORD

Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions.

PubMed

Wijesinghe, Parami; Liyanagedera, Chamika; Roy, Kaushik

2018-05-02

Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic Tunnel Junctions (MTJs). The inherent physics of MTJs, enhanced by device level modifications, is harnessed here to emulate the intricate dynamics of an analog satisfiability (SAT) solver. In the presence of thermal noise, the MTJ based system can successfully solve Boolean satisfiability problems. Most importantly, our results exhibit that, the proposed MTJ based hardware SAT solver is capable of finding a solution to a significant fraction (at least 85%) of hard 3-SAT problems, within a time that has a polynomial relationship with the number of variables(<50).

A Semiquantitative Framework for Gene Regulatory Networks: Increasing the Time and Quantitative Resolution of Boolean Networks

PubMed Central

Kerkhofs, Johan; Geris, Liesbet

2015-01-01

Boolean models have been instrumental in predicting general features of gene networks and more recently also as explorative tools in specific biological applications. In this study we introduce a basic quantitative and a limited time resolution to a discrete (Boolean) framework. Quantitative resolution is improved through the employ of normalized variables in unison with an additive approach. Increased time resolution stems from the introduction of two distinct priority classes. Through the implementation of a previously published chondrocyte network and T helper cell network, we show that this addition of quantitative and time resolution broadens the scope of biological behaviour that can be captured by the models. Specifically, the quantitative resolution readily allows models to discern qualitative differences in dosage response to growth factors. The limited time resolution, in turn, can influence the reachability of attractors, delineating the likely long term system behaviour. Importantly, the information required for implementation of these features, such as the nature of an interaction, is typically obtainable from the literature. Nonetheless, a trade-off is always present between additional computational cost of this approach and the likelihood of extending the model’s scope. Indeed, in some cases the inclusion of these features does not yield additional insight. This framework, incorporating increased and readily available time and semi-quantitative resolution, can help in substantiating the litmus test of dynamics for gene networks, firstly by excluding unlikely dynamics and secondly by refining falsifiable predictions on qualitative behaviour. PMID:26067297

Remission of rheumatoid arthritis and potential determinants: a national multi-center cross-sectional survey.

PubMed

Wang, Guan-Ying; Zhang, Sa-Li; Wang, Xiu-Ru; Feng, Min; Li, Chun; An, Yuan; Li, Xiao-Feng; Wang, Li-Zhi; Wang, Cai-Hong; Wang, Yong-Fu; Yang, Rong; Yan, Hui-Ming; Wang, Guo-Chun; Lu, Xin; Liu, Xia; Zhu, Ping; Chen, Li-Na; Jin, Hong-Tao; Liu, Jin-Ting; Guo, Hui-Fang; Chen, Hai-Ying; Xie, Jian-Li; Wei, Ping; Wang, Jun-Xiang; Liu, Xiang-Yuan; Sun, Lin; Cui, Liu-Fu; Shu, Rong; Liu, Bai-Lu; Yu, Ping; Zhang, Zhuo-Li; Li, Guang-Tao; Li, Zhen-Bin; Yang, Jing; Li, Jun-Fang; Jia, Bin; Zhang, Feng-Xiao; Tao, Jie-Mei; Lin, Jin-Ying; Wei, Mei-Qiu; Liu, Xiao-Min; Ke, Dan; Hu, Shao-Xian; Ye, Cong; Han, Shu-Ling; Yang, Xiu-Yan; Li, Hao; Huang, Ci-Bo; Gao, Ming; Lai, Bei; Cheng, Yong-Jing; Li, Xing-Fu; Song, Li-Jun; Yu, Xiao-Xia; Wang, Ai-Xue; Wu, Li-Jun; Wang, Yan-Hua; He, Lan; Sun, Wen-Wen; Gong, Lu; Wang, Xiao-Yuan; Wang, Yi; Zhao, Yi; Li, Xiao-Xia; Wang, Yan; Zhang, Yan; Su, Yin; Zhang, Chun-Fang; Mu, Rong; Li, Zhan-Guo

2015-02-01

The aim of this study is to investigate the remission rate of rheumatoid arthritis (RA) in China and identify its potential determinants. A multi-center cross-sectional study was conducted from July 2009 to January 2012. Data were collected by face-to-face interviews of the rheumatology outpatients in 28 tertiary hospitals in China. The remission rates were calculated in 486 RA patients according to different definitions of remission: the Disease Activity Score in 28 joints (DAS28), the Simplified Disease Activity Index (SDAI), the Clinical Disease Activity Index (CDAI), and the American College of Rheumatology/European League Against Rheumatism (ACR/EULAR) Boolean definition. Potential determinants of RA remission were assessed by univariate and multivariate analyses. The remission rates of RA from this multi-center cohort were 8.6% (DAS28), 8.4% (SDAI), 8.2% (CDAI), and 6.8% (Boolean), respectively. Favorable factors associated with remission were: low Health Assessment Questionnaire (HAQ) score, absence of rheumatoid factor (RF) and anti-cyclic citrullinated peptide (anti-CCP), and treatment of methotrexate (MTX) and hydroxychloroquine (HCQ). Younger age was also predictive for the DAS28 and the Boolean remission. Multivariate analyses revealed a low HAQ score, the absence of anti-CCP, and the treatment with HCQ as independent determinants of remission. The clinical remission rate of RA patients was low in China. A low HAQ score, the absence of anti-CCP, and HCQ were significant independent determinants for RA remission.

Psychological state is related to the remission of the Boolean-based definition of patient global assessment in patients with rheumatoid arthritis.

PubMed

Fusama, Mie; Miura, Yasushi; Yukioka, Kumiko; Kuroiwa, Takanori; Yukioka, Chikako; Inoue, Miyako; Nakanishi, Tae; Murata, Norikazu; Takai, Noriko; Higashi, Kayoko; Kuritani, Taro; Maeda, Keiji; Sano, Hajime; Yukioka, Masao; Nakahara, Hideko

2015-09-01

To evaluate whether the psychological state is related to the Boolean-based definition of patient global assessment (PGA) remission in patients with rheumatoid arthritis (RA). Patients with RA who met the criteria of swollen joint count (SJC) ≤ 1, tender joint count (TJC) ≤ 1 and C-reactive protein (CRP) ≤ 1 were divided into two groups, PGA remission group (PGA ≤ 1 cm) and non-remission group (PGA > 1 cm). Anxiety was evaluated utilizing the Hospital Anxiety and Depression Scale-Anxiety (HADS-A), while depression was evaluated with HADS-Depression (HADS-D) and the Center for Epidemiologic Studies Depression Scale (CES-D). Comparison analyses were done between the PGA remission and non-remission groups in HADS-A, HADS-D and CES-D. Seventy-eight patients met the criteria for SJC ≤ 1, TJC ≤ 1 and CRP ≤ 1. There were no significant differences between the PGA remission group (n = 45) and the non-remission group (n = 33) in age, sex, disease duration and Steinbrocker's class and stage. HADS-A, HADS-D and CES-D scores were significantly lower in the PGA remission group. Patients with RA who did not meet the PGA remission criteria despite good disease condition were in a poorer psychological state than those who satisfied the Boolean-based definition of clinical remission. Psychological support might be effective for improvement of PGA, resulting in the attainment of true remission.

Automated Library System Specifications.

DTIC Science & Technology

1986-06-01

University), LIS (Georqetown Universitv Medical Center) 20 DiSTRI3UT!ON.. AVAILABILITY OF ABSTRACT 21 ABSTRACT SECURITY CLASSIFICATION :UNCLASSIFIED...Interface) acquisitions, patron access catalo. (Boolean search), authority Afiles, zana ~ezient reports. Serials control expected in 1985. INDIVIDUALIZATIOI

Coding of time-dependent stimuli in homogeneous and heterogeneous neural populations.

PubMed

Beiran, Manuel; Kruscha, Alexandra; Benda, Jan; Lindner, Benjamin

2018-04-01

We compare the information transmission of a time-dependent signal by two types of uncoupled neuron populations that differ in their sources of variability: i) a homogeneous population whose units receive independent noise and ii) a deterministic heterogeneous population, where each unit exhibits a different baseline firing rate ('disorder'). Our criterion for making both sources of variability quantitatively comparable is that the interspike-interval distributions are identical for both systems. Numerical simulations using leaky integrate-and-fire neurons unveil that a non-zero amount of both noise or disorder maximizes the encoding efficiency of the homogeneous and heterogeneous system, respectively, as a particular case of suprathreshold stochastic resonance. Our findings thus illustrate that heterogeneity can render similarly profitable effects for neuronal populations as dynamic noise. The optimal noise/disorder depends on the system size and the properties of the stimulus such as its intensity or cutoff frequency. We find that weak stimuli are better encoded by a noiseless heterogeneous population, whereas for strong stimuli a homogeneous population outperforms an equivalent heterogeneous system up to a moderate noise level. Furthermore, we derive analytical expressions of the coherence function for the cases of very strong noise and of vanishing intrinsic noise or heterogeneity, which predict the existence of an optimal noise intensity. Our results show that, depending on the type of signal, noise as well as heterogeneity can enhance the encoding performance of neuronal populations.

Self-attracting walk on heterogeneous networks

NASA Astrophysics Data System (ADS)

Kim, Kanghun; Kyoung, Jaegu; Lee, D.-S.

2016-05-01

Understanding human mobility in cyberspace becomes increasingly important in this information era. While human mobility, memory-dependent and subdiffusive, is well understood in Euclidean space, it remains elusive in random heterogeneous networks like the World Wide Web. Here we study the diffusion characteristics of self-attracting walks, in which a walker is more likely to move to the locations visited previously than to unvisited ones, on scale-free networks. Under strong attraction, the number of distinct visited nodes grows linearly in time with larger coefficients in more heterogeneous networks. More interestingly, crossovers to sublinear growths occur in strongly heterogeneous networks. To understand these phenomena, we investigate the characteristic volumes and topology of the cluster of visited nodes and find that the reinforced attraction to hubs results in expediting exploration first but delaying later, as characterized by the scaling exponents that we derive. Our findings and analysis method can be useful for understanding various diffusion processes mediated by human.

Synchronisation hubs in the visual cortex may arise from strong rhythmic inhibition during gamma oscillations.

PubMed

Folias, Stefanos E; Yu, Shan; Snyder, Abigail; Nikolić, Danko; Rubin, Jonathan E

2013-09-01

Neurons in the visual cortex exhibit heterogeneity in feature selectivity and the tendency to generate action potentials synchronously with other nearby neurons. By examining visual responses from cat area 17 we found that, during gamma oscillations, there was a positive correlation between each unit's sharpness of orientation tuning, strength of oscillations, and propensity towards synchronisation with other units. Using a computational model, we demonstrated that heterogeneity in the strength of rhythmic inhibitory inputs can account for the correlations between these three properties. Neurons subject to strong inhibition tend to oscillate strongly in response to both optimal and suboptimal stimuli and synchronise promiscuously with other neurons, even if they have different orientation preferences. Moreover, these strongly inhibited neurons can exhibit sharp orientation selectivity provided that the inhibition they receive is broadly tuned relative to their excitatory inputs. These results predict that the strength and orientation tuning of synaptic inhibition are heterogeneous across area 17 neurons, which could have important implications for these neurons' sensory processing capabilities. Furthermore, although our experimental recordings were conducted in the visual cortex, our model and simulation results can apply more generally to any brain region with analogous neuron types in which heterogeneity in the strength of rhythmic inhibition can arise during gamma oscillations. © 2013 Federation of European Neuroscience Societies and John Wiley & Sons Ltd.

Introduction to focus issue: quantitative approaches to genetic networks.

PubMed

Albert, Réka; Collins, James J; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

Modeling of the hypothalamic-pituitary-adrenal axis-mediated interaction between the serotonin regulation pathway and the stress response using a Boolean approximation: a novel study of depression

PubMed Central

2013-01-01

Major depressive disorder (MDD) is a multifactorial disorder known to be influenced by both genetic and environmental factors. MDD presents a heritability of 37%, and a genetic contribution has also been observed in studies of family members of individuals with MDD that imply that the probability of suffering the disorder is approximately three times higher if a first-degree family member is affected. Childhood maltreatment and stressful life events (SLEs) have been established as critical environmental factors that profoundly influence the onset of MDD. The serotonin pathway has been a strong candidate for genetic studies, but it only explains a small proportion of the heritability of the disorder, which implies the involvement of other pathways. The serotonin (5-HT) pathway interacts with the stress response pathway in a manner mediated by the hypothalamic-pituitary-adrenal (HPA) axis. To analyze the interaction between the pathways, we propose the use of a synchronous Boolean network (SBN) approximation. The principal aim of this work was to model the interaction between these pathways, taking into consideration the presence of selective serotonin reuptake inhibitors (SSRIs), in order to observe how the pathways interact and to examine if the system is stable. Additionally, we wanted to study which genes or metabolites have the greatest impact on model stability when knocked out in silico. We observed that the biological model generated predicts steady states (attractors) for each of the different runs performed, thereby proving that the system is stable. These attractors changed in shape, especially when anti-depressive drugs were also included in the simulation. This work also predicted that the genes with the greatest impact on model stability were those involved in the neurotrophin pathway, such as CREB, BDNF (which has been associated with major depressive disorder in a variety of studies) and TRkB, followed by genes and metabolites related to 5-HT synthesis. PMID:24093582

Structures and Boolean Dynamics in Gene Regulatory Networks

NASA Astrophysics Data System (ADS)

Szedlak, Anthony

This dissertation discusses the topological and dynamical properties of GRNs in cancer, and is divided into four main chapters. First, the basic tools of modern complex network theory are introduced. These traditional tools as well as those developed by myself (set efficiency, interset efficiency, and nested communities) are crucial for understanding the intricate topological properties of GRNs, and later chapters recall these concepts. Second, the biology of gene regulation is discussed, and a method for disease-specific GRN reconstruction developed by our collaboration is presented. This complements the traditional exhaustive experimental approach of building GRNs edge-by-edge by quickly inferring the existence of as of yet undiscovered edges using correlations across sets of gene expression data. This method also provides insight into the distribution of common mutations across GRNs. Third, I demonstrate that the structures present in these reconstructed networks are strongly related to the evolutionary histories of their constituent genes. Investigation of how the forces of evolution shaped the topology of GRNs in multicellular organisms by growing outward from a core of ancient, conserved genes can shed light upon the ''reverse evolution'' of normal cells into unicellular-like cancer states. Next, I simulate the dynamics of the GRNs of cancer cells using the Hopfield model, an infinite range spin-glass model designed with the ability to encode Boolean data as attractor states. This attractor-driven approach facilitates the integration of gene expression data into predictive mathematical models. Perturbations representing therapeutic interventions are applied to sets of genes, and the resulting deviations from their attractor states are recorded, suggesting new potential drug targets for experimentation. Finally, I extend the Hopfield model to modular networks, cyclic attractors, and complex attractors, and apply these concepts to simulations of the cell cycle process. Futher development of these and other theoretical and computational tools is necessary to analyze the deluge of experimental data produced by modern and future biological high throughput methods. (Abstract shortened by ProQuest.).

Introduction to Focus Issue: Quantitative Approaches to Genetic Networks

NASA Astrophysics Data System (ADS)

Albert, Réka; Collins, James J.; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

Early Labor Market and Debt Outcomes for Bachelor's Degree Recipients: Heterogeneity by Institution Type and Major, and Trends over Time. A CAPSEE Working Paper

ERIC Educational Resources Information Center

Scott-Clayton, Judith

2016-01-01

While research has consistently found strong positive earnings returns to the bachelor's degree, recent evidence also highlights heterogeneity in post-college outcomes. Combined with increases in the proportions of students borrowing to enroll, heterogeneity in college outcomes introduces the risk that some students with college degrees may…

Nonvolatile reconfigurable sequential logic in a HfO2 resistive random access memory array.

PubMed

Zhou, Ya-Xiong; Li, Yi; Su, Yu-Ting; Wang, Zhuo-Rui; Shih, Ling-Yi; Chang, Ting-Chang; Chang, Kuan-Chang; Long, Shi-Bing; Sze, Simon M; Miao, Xiang-Shui

2017-05-25

Resistive random access memory (RRAM) based reconfigurable logic provides a temporal programmable dimension to realize Boolean logic functions and is regarded as a promising route to build non-von Neumann computing architecture. In this work, a reconfigurable operation method is proposed to perform nonvolatile sequential logic in a HfO 2 -based RRAM array. Eight kinds of Boolean logic functions can be implemented within the same hardware fabrics. During the logic computing processes, the RRAM devices in an array are flexibly configured in a bipolar or complementary structure. The validity was demonstrated by experimentally implemented NAND and XOR logic functions and a theoretically designed 1-bit full adder. With the trade-off between temporal and spatial computing complexity, our method makes better use of limited computing resources, thus provides an attractive scheme for the construction of logic-in-memory systems.

Synthesizing Biomolecule-based Boolean Logic Gates

PubMed Central

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2012-01-01

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588

Interconnect-free parallel logic circuits in a single mechanical resonator

PubMed Central

Mahboob, I.; Flurin, E.; Nishiguchi, K.; Fujiwara, A.; Yamaguchi, H.

2011-01-01

In conventional computers, wiring between transistors is required to enable the execution of Boolean logic functions. This has resulted in processors in which billions of transistors are physically interconnected, which limits integration densities, gives rise to huge power consumption and restricts processing speeds. A method to eliminate wiring amongst transistors by condensing Boolean logic into a single active element is thus highly desirable. Here, we demonstrate a novel logic architecture using only a single electromechanical parametric resonator into which multiple channels of binary information are encoded as mechanical oscillations at different frequencies. The parametric resonator can mix these channels, resulting in new mechanical oscillation states that enable the construction of AND, OR and XOR logic gates as well as multibit logic circuits. Moreover, the mechanical logic gates and circuits can be executed simultaneously, giving rise to the prospect of a parallel logic processor in just a single mechanical resonator. PMID:21326230

Interconnect-free parallel logic circuits in a single mechanical resonator.

PubMed

Mahboob, I; Flurin, E; Nishiguchi, K; Fujiwara, A; Yamaguchi, H

2011-02-15

In conventional computers, wiring between transistors is required to enable the execution of Boolean logic functions. This has resulted in processors in which billions of transistors are physically interconnected, which limits integration densities, gives rise to huge power consumption and restricts processing speeds. A method to eliminate wiring amongst transistors by condensing Boolean logic into a single active element is thus highly desirable. Here, we demonstrate a novel logic architecture using only a single electromechanical parametric resonator into which multiple channels of binary information are encoded as mechanical oscillations at different frequencies. The parametric resonator can mix these channels, resulting in new mechanical oscillation states that enable the construction of AND, OR and XOR logic gates as well as multibit logic circuits. Moreover, the mechanical logic gates and circuits can be executed simultaneously, giving rise to the prospect of a parallel logic processor in just a single mechanical resonator.

Calculating the bidirectional reflectance of natural vegetation covers using Boolean models and geometric optics

NASA Technical Reports Server (NTRS)

Strahler, Alan H.; Li, Xiao-Wen; Jupp, David L. B.

1991-01-01

The bidirectional radiance or reflectance of a forest or woodland can be modeled using principles of geometric optics and Boolean models for random sets in a three dimensional space. This model may be defined at two levels, the scene includes four components; sunlight and shadowed canopy, and sunlit and shadowed background. The reflectance of the scene is modeled as the sum of the reflectances of the individual components as weighted by their areal proportions in the field of view. At the leaf level, the canopy envelope is an assemblage of leaves, and thus the reflectance is a function of the areal proportions of sunlit and shadowed leaf, and sunlit and shadowed background. Because the proportions of scene components are dependent upon the directions of irradiance and exitance, the model accounts for the hotspot that is well known in leaf and tree canopies.

Synthesizing biomolecule-based Boolean logic gates.

PubMed

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2013-02-15

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.

Simultaneous G-Quadruplex DNA Logic.

PubMed

Bader, Antoine; Cockroft, Scott L

2018-04-03

A fundamental principle of digital computer operation is Boolean logic, where inputs and outputs are described by binary integer voltages. Similarly, inputs and outputs may be processed on the molecular level as exemplified by synthetic circuits that exploit the programmability of DNA base-pairing. Unlike modern computers, which execute large numbers of logic gates in parallel, most implementations of molecular logic have been limited to single computing tasks, or sensing applications. This work reports three G-quadruplex-based logic gates that operate simultaneously in a single reaction vessel. The gates respond to unique Boolean DNA inputs by undergoing topological conversion from duplex to G-quadruplex states that were resolved using a thioflavin T dye and gel electrophoresis. The modular, addressable, and label-free approach could be incorporated into DNA-based sensors, or used for resolving and debugging parallel processes in DNA computing applications. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Satisfiability of logic programming based on radial basis function neural networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged

2014-07-10

In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We appliedmore » the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.« less

Some Applications Of Semigroups And Computer Algebra In Discrete Structures

NASA Astrophysics Data System (ADS)

Bijev, G.

2009-11-01

An algebraic approach to the pseudoinverse generalization problem in Boolean vector spaces is used. A map (p) is defined, which is similar to an orthogonal projection in linear vector spaces. Some other important maps with properties similar to those of the generalized inverses (pseudoinverses) of linear transformations and matrices corresponding to them are also defined and investigated. Let Ax = b be an equation with matrix A and vectors x and b Boolean. Stochastic experiments for solving the equation, which involves the maps defined and use computer algebra methods, have been made. As a result, the Hamming distance between vectors Ax = p(b) and b is equal or close to the least possible. We also share our experience in using computer algebra systems for teaching discrete mathematics and linear algebra and research. Some examples for computations with binary relations using Maple are given.

Lattice Theory, Measures and Probability

NASA Astrophysics Data System (ADS)

Knuth, Kevin H.

2007-11-01

In this tutorial, I will discuss the concepts behind generalizing ordering to measuring and apply these ideas to the derivation of probability theory. The fundamental concept is that anything that can be ordered can be measured. Since we are in the business of making statements about the world around us, we focus on ordering logical statements according to implication. This results in a Boolean lattice, which is related to the fact that the corresponding logical operations form a Boolean algebra. The concept of logical implication can be generalized to degrees of implication by generalizing the zeta function of the lattice. The rules of probability theory arise naturally as a set of constraint equations. Through this construction we are able to neatly connect the concepts of order, structure, algebra, and calculus. The meaning of probability is inherited from the meaning of the ordering relation, implication, rather than being imposed in an ad hoc manner at the start.

A solution to the surface intersection problem. [Boolean functions in geometric modeling

NASA Technical Reports Server (NTRS)

Timer, H. G.

1977-01-01

An application-independent geometric model within a data base framework should support the use of Boolean operators which allow the user to construct a complex model by appropriately combining a series of simple models. The use of these operators leads to the concept of implicitly and explicitly defined surfaces. With an explicitly defined model, the surface area may be computed by simply summing the surface areas of the bounding surfaces. For an implicitly defined model, the surface area computation must deal with active and inactive regions. Because the surface intersection problem involves four unknowns and its solution is a space curve, the parametric coordinates of each surface must be determined as a function of the arc length. Various subproblems involved in the general intersection problem are discussed, and the mathematical basis for their solution is presented along with a program written in FORTRAN IV for implementation on the IBM 370 TSO system.

Polynomial algebra of discrete models in systems biology.

PubMed

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

Graphene-based non-Boolean logic circuits

NASA Astrophysics Data System (ADS)

Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.

2013-10-01

Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.

Stage-structured transmission of phocine distemper virus in the Dutch 2002 outbreak

PubMed Central

Klepac, Petra; Pomeroy, Laura W.; Bjørnstad, Ottar N.; Kuiken, Thijs; Osterhaus, Albert D.M.E.; Rijks, Jolianne M.

2009-01-01

Heterogeneities in transmission among hosts can be very important in shaping infectious disease dynamics. In mammals with strong social organization, such heterogeneities are often structured by functional stage: juveniles, subadults and adults. We investigate the importance of such stage-related heterogeneities in shaping the 2002 phocine distemper virus (PDV) outbreak in the Dutch Wadden Sea, when more than 40 per cent of the harbour seals were killed. We do this by comparing the statistical fit of a hierarchy of models with varying transmission complexity: homogeneous versus heterogeneous mixing and density- versus frequency-dependent transmission. We use the stranding data as a proxy for incidence and use Poisson likelihoods to estimate the ‘who acquires infection from whom’ (WAIFW) matrix. Statistically, the model with strong heterogeneous mixing and density-dependent transmission was found to best describe the transmission dynamics. However, patterns of incidence support a model of frequency-dependent transmission among adults and juveniles. Based on the maximum-likelihood WAIFW matrix estimates, we use the next-generation formalism to calculate an R0 between 2 and 2.5 for the Dutch 2002 PDV epidemic. PMID:19364743

Is inversion based high resolution characterization of spatially heterogeneous river bed hydraulic conductivity needed and possible?

NASA Astrophysics Data System (ADS)

Kurtz, W.; Hendricks Franssen, H.-J.; Brunner, P.; Vereecken, H.

2013-05-01

River-aquifer exchange fluxes influence local and regional water balances and affect groundwater and river water quality and quantity. Unfortunately, river-aquifer exchange fluxes tend to be strongly spatially variable and it is an open research question to which degree river bed heterogeneity has to be represented in a~model in order to achieve reliable estimates of river-aquifer exchange fluxes. This research question is addressed in this paper with help of synthetic simulation experiments, which mimic the Limmat aquifer in Zurich (Switzerland), where river-aquifer exchange fluxes and groundwater management activities play an important role. The solution of the unsaturated-saturated subsurface hydrological flow problem including river-aquifer interaction is calculated for ten different synthetic realities where the strongly heterogeneous river bed hydraulic conductivities (L) are perfectly known. Hydraulic head data (100 in the default scenario) are sampled from the synthetic realities. In subsequent data assimilation experiments, where L is unknown now, the hydraulic head data are used as conditioning information, with help of the Ensemble Kalman Filter (EnKF). For each of the ten synthetic realities, four different ensembles of L are tested in the experiments with EnKF; one ensemble estimates high resolution L-fields with different L values for each element, and the other three ensembles estimate effective L values for 5, 3 or 2 zones. The calibration of higher resolution L-fields (i.e., fully heterogeneous or 5 zones) gives better results than the calibration of L for only 3 or 2 zones in terms of reproduction of states, stream-aquifer exchange fluxes and parameters. Effective L for a limited number of zones cannot always reproduce the true states and fluxes well and results in biased estimates of net exchange fluxes between aquifer and stream. Also in case only 10 head data are used for conditioning, the high resolution L-fields outperform the others. In case of less heterogeneous river bed hydraulic conductivities, a high-resolution characterization of L is less important. We conclude that for strongly heterogeneous river beds the commonly applied simplified representation of the streambed, with spatially homogeneous parameters or constant parameters for a few zones, might yield significant biases in the characterization of the water balance. For strongly heterogeneous river beds, we suggest to adopt a stochastic field approach to model the spatially heterogeneous river beds geostatistically. The paper illustrates that EnKF is able to calibrate such heterogeneous streambeds on the basis of hydraulic head measurements, outperforming classical approaches.

Factors associated with sustained remission in patients with rheumatoid arthritis.

PubMed

Martire, María Victoria; Marino Claverie, Lucila; Duarte, Vanesa; Secco, Anastasia; Mammani, Marta

2015-01-01

To find out the factors that are associated with sustained remission measured by DAS28 and boolean ACR EULAR 2011 criteria at the time of diagnosis of rheumatoid arthritis. Medical records of patients with rheumatoid arthritis in sustained remission according to DAS28 were reviewed. They were compared with patients who did not achieved values of DAS28<2.6 in any visit during the first 3 years after diagnosis. We also evaluated if patients achieved the boolean ACR/EULAR criteria. Variables analyzed: sex, age, smoking, comorbidities, rheumatoid factor, anti-CCP, ESR, CRP, erosions, HAQ, DAS28, extra-articular manifestations, time to initiation of treatment, involvement of large joints, number of tender joints, number of swollen joints, pharmacological treatment. Forty five patients that achieved sustained remission were compared with 44 controls. The variables present at diagnosis that significantly were associated with remission by DAS28 were: lower values of DAS28, HAQ, ESR, NTJ, NSJ, negative CRP, absence of erosions, male sex and absence of involvement of large joints. Only 24.71% achieved the boolean criteria. The variables associated with sustained remission by these criteria were: lower values of DAS28, HAQ, ESR, number of tender joints and number of swollen joints, negative CRP and absence of erosions. The factors associated with sustained remission were the lower baseline disease activity, the low degree of functional disability and lower joint involvement. We consider it important to recognize these factors to optimize treatment. Copyright © 2014 Elsevier España, S.L.U. All rights reserved.

Jimena: efficient computing and system state identification for genetic regulatory networks.

PubMed

Karl, Stefan; Dandekar, Thomas

2013-10-11

Boolean networks capture switching behavior of many naturally occurring regulatory networks. For semi-quantitative modeling, interpolation between ON and OFF states is necessary. The high degree polynomial interpolation of Boolean genetic regulatory networks (GRNs) in cellular processes such as apoptosis or proliferation allows for the modeling of a wider range of node interactions than continuous activator-inhibitor models, but suffers from scaling problems for networks which contain nodes with more than ~10 inputs. Many GRNs from literature or new gene expression experiments exceed those limitations and a new approach was developed. (i) As a part of our new GRN simulation framework Jimena we introduce and setup Boolean-tree-based data structures; (ii) corresponding algorithms greatly expedite the calculation of the polynomial interpolation in almost all cases, thereby expanding the range of networks which can be simulated by this model in reasonable time. (iii) Stable states for discrete models are efficiently counted and identified using binary decision diagrams. As application example, we show how system states can now be sampled efficiently in small up to large scale hormone disease networks (Arabidopsis thaliana development and immunity, pathogen Pseudomonas syringae and modulation by cytokinins and plant hormones). Jimena simulates currently available GRNs about 10-100 times faster than the previous implementation of the polynomial interpolation model and even greater gains are achieved for large scale-free networks. This speed-up also facilitates a much more thorough sampling of continuous state spaces which may lead to the identification of new stable states. Mutants of large networks can be constructed and analyzed very quickly enabling new insights into network robustness and behavior.

Boolean Operations with Prism Algebraic Patches

PubMed Central

Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi

2009-01-01

In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262

Computing smallest intervention strategies for multiple metabolic networks in a boolean model.

PubMed

Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya

2015-02-01

This article considers the problem whereby, given two metabolic networks N1 and N2, a set of source compounds, and a set of target compounds, we must find the minimum set of reactions whose removal (knockout) ensures that the target compounds are not producible in N1 but are producible in N2. Similar studies exist for the problem of finding the minimum knockout with the smallest side effect for a single network. However, if technologies of external perturbations are advanced in the near future, it may be important to develop methods of computing the minimum knockout for multiple networks (MKMN). Flux balance analysis (FBA) is efficient if a well-polished model is available. However, that is not always the case. Therefore, in this article, we study MKMN in Boolean models and an elementary mode (EM)-based model. Integer linear programming (ILP)-based methods are developed for these models, since MKMN is NP-complete for both the Boolean model and the EM-based model. Computer experiments are conducted with metabolic networks of clostridium perfringens SM101 and bifidobacterium longum DJO10A, respectively known as bad bacteria and good bacteria for the human intestine. The results show that larger networks are more likely to have MKMN solutions. However, solving for these larger networks takes a very long time, and often the computation cannot be completed. This is reasonable, because small networks do not have many alternative pathways, making it difficult to satisfy the MKMN condition, whereas in large networks the number of candidate solutions explodes. Our developed software minFvskO is available online.

A Note about Information Science Research.

ERIC Educational Resources Information Center

Salton, Gerard

1985-01-01

Discusses the relationship between information science research and practice and briefly describes current research on 10 topics in information retrieval literature: vector processing retrieval strategy, probabilistic retrieval models, inverted file procedures, relevance feedback, Boolean query formulations, front-end procedures, citation…

Bibliographic Instruction in the 21st Century.

ERIC Educational Resources Information Center

Poirier, Gayle

2000-01-01

Discusses bibliographic instruction in libraries. Topics include a history of bibliographic instruction; the Internet and electronic searching; librarians' use of technology; defining information needs; locating and accessing information, including classification systems and Boolean searching; evaluating information; using and communication…

Extremal Optimization for Quadratic Unconstrained Binary Problems

NASA Astrophysics Data System (ADS)

Boettcher, S.

We present an implementation of τ-EO for quadratic unconstrained binary optimization (QUBO) problems. To this end, we transform modify QUBO from its conventional Boolean presentation into a spin glass with a random external field on each site. These fields tend to be rather large compared to the typical coupling, presenting EO with a challenging two-scale problem, exploring smaller differences in couplings effectively while sufficiently aligning with those strong external fields. However, we also find a simple solution to that problem that indicates that those external fields apparently tilt the energy landscape to a such a degree such that global minima become more easy to find than those of spin glasses without (or very small) fields. We explore the impact of the weight distribution of the QUBO formulation in the operations research literature and analyze their meaning in a spin-glass language. This is significant because QUBO problems are considered among the main contenders for NP-hard problems that could be solved efficiently on a quantum computer such as D-Wave.

Correlations between dynamics and atomic structures in Cu64.5Zr35.5 metallic glass

NASA Astrophysics Data System (ADS)

Wang, C. Z.; Zhang, Y.; Zhang, F.; Mendelev, M. I.; Kramer, M. J.; Ho, K. M.

2015-03-01

The atomic structure of Cu-Zr metallic glasses (MGs) has been widely accepted to be heterogeneous and dominated by icosahedral short range order (ISRO). However, the correlations between dynamics and atomic structures in Cu-Zr MGs remain an enigma. Using molecular dynamics (MD) simulations, we investigated the correlations between dynamics and atomic structures in Cu64.5Zr35.5 MG. The atomic structures are characterized using ISRO and the Bergman-type medium range order (BMRO). The simulation and analysis results show that the majority of the mobile atoms are not involved in ISRO or BMRO, indicating that the dynamical heterogeneity has a strong correlation to structural heterogeneity. Moreover, we found that the localized soft vibration modes below 1.0 THz are mostly concentrated on the mobile atoms. The diffusion was studied using the atomic trajectory collected in an extended time interval of 1.2 μs at 700 K in MD simulations. It was found that the long range diffusion in MGs is highly heterogeneous, which is confined to the liquid-like regions and strongly avoids the ISRO and the Bergman-type MRO. All These results clearly demonstrate strong correlations between dynamics (in terms of dynamical heterogeneity and diffusion) and atomic structures in Cu64.5Zr35.5 MGs. This work was supported by the U.S. Department of Energy, Basic Energy Sciences, Division of Materials Science and Engineering under the Contract No. DE-AC02-07CH11358.

Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles

EPA Science Inventory

With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate t...

A Boolean Network Model of Nuclear Receptor Mediated Cell Cycle Progression

EPA Science Inventory

Nuclear receptors (NRs) are ligand-activated transcription factors that regulate a broad range of cellular processes. Hormones, lipids and xenobiotics have been shown to activate NRs with a range of consequences on development, metabolism, oxidative stress, apoptosis, and prolif...

A Boolean Network Model of Nuclear Receptor Mediated Cell Cycle Progression (S)

EPA Science Inventory

Nuclear receptors (NRs) are ligand-activated transcription factors that regulate a broad range of cellular processes. Hormones, lipids and xenobiotics have been shown to activate NRs with a range of consequences on development, metabolism, oxidative stress, apoptosis, and prolif...

Automatic Query Formulations in Information Retrieval.

ERIC Educational Resources Information Center

Salton, G.; And Others

1983-01-01

Introduces methods designed to reduce role of search intermediaries by generating Boolean search formulations automatically using term frequency considerations from natural language statements provided by system patrons. Experimental results are supplied and methods are described for applying automatic query formulation process in practice.…

Digital Equipment Corporation's CRDOM Software and Database Publications.

ERIC Educational Resources Information Center

Adams, Michael Q.

1986-01-01

Acquaints information professionals with Digital Equipment Corporation's compact optical disk read-only-memory (CDROM) search and retrieval software and growing library of CDROM database publications (COMPENDEX, Chemical Abstracts Services). Highlights include MicroBASIS, boolean operators, range operators, word and phrase searching, proximity…

Topics for Mathematics Clubs.

ERIC Educational Resources Information Center

Dalton, LeRoy C., Ed.; Snyder, Henry D., Ed.

The ten chapters in this booklet cover topics not ordinarily discussed in the classroom: Fibonacci sequences, projective geometry, groups, infinity and transfinite numbers, Pascal's Triangle, topology, experiments with natural numbers, non-Euclidean geometries, Boolean algebras, and the imaginary and the infinite in geometry. Each chapter is…

Seismic Modeling Of Reservoir Heterogeneity Scales: An Application To Gas Hydrate Reservoirs

NASA Astrophysics Data System (ADS)

Huang, J.; Bellefleur, G.; Milkereit, B.

2008-12-01

Natural gas hydrates, a type of inclusion compound or clathrate, are composed of gas molecules trapped within a cage of water molecules. The occurrence of gas hydrates in permafrost regions has been confirmed by core samples recovered from the Mallik gas hydrate research wells located within Mackenzie Delta in Northwest Territories of Canada. Strong vertical variations of compressional and shear sonic velocities and weak surface seismic expressions of gas hydrates indicate that lithological heterogeneities control the distribution of hydrates. Seismic scattering studies predict that typical scales and strong physical contrasts due to gas hydrate concentration will generate strong forward scattering, leaving only weak energy captured by surface receivers. In order to understand the distribution of hydrates and the seismic scattering effects, an algorithm was developed to construct heterogeneous petrophysical reservoir models. The algorithm was based on well logs showing power law features and Gaussian or Non-Gaussian probability density distribution, and was designed to honor the whole statistical features of well logs such as the characteristic scales and the correlation among rock parameters. Multi-dimensional and multi-variable heterogeneous models representing the same statistical properties were constructed and applied to the heterogeneity analysis of gas hydrate reservoirs. The petrophysical models provide the platform to estimate rock physics properties as well as to study the impact of seismic scattering, wave mode conversion, and their integration on wave behavior in heterogeneous reservoirs. Using the Biot-Gassmann theory, the statistical parameters obtained from Mallik 5L-38, and the correlation length estimated from acoustic impedance inversion, gas hydrate volume fraction in Mallik area was estimated to be 1.8%, approximately 2x108 m3 natural gas stored in a hydrate bearing interval within 0.25 km2 lateral extension and between 889 m and 1115 m depth. With parallel 3-D viscoelastic Finite Difference (FD) software, we conducted a 3D numerical experiment of near offset Vertical Seismic Profile. The synthetic results implied that the strong attenuation observed in the field data might be caused by the scattering.

Adaptiveness in monotone pseudo-Boolean optimization and stochastic neural computation.

PubMed

Grossi, Giuliano

2009-08-01

Hopfield neural network (HNN) is a nonlinear computational model successfully applied in finding near-optimal solutions of several difficult combinatorial problems. In many cases, the network energy function is obtained through a learning procedure so that its minima are states falling into a proper subspace (feasible region) of the search space. However, because of the network nonlinearity, a number of undesirable local energy minima emerge from the learning procedure, significantly effecting the network performance. In the neural model analyzed here, we combine both a penalty and a stochastic process in order to enhance the performance of a binary HNN. The penalty strategy allows us to gradually lead the search towards states representing feasible solutions, so avoiding oscillatory behaviors or asymptotically instable convergence. Presence of stochastic dynamics potentially prevents the network to fall into shallow local minima of the energy function, i.e., quite far from global optimum. Hence, for a given fixed network topology, the desired final distribution on the states can be reached by carefully modulating such process. The model uses pseudo-Boolean functions both to express problem constraints and cost function; a combination of these two functions is then interpreted as energy of the neural network. A wide variety of NP-hard problems fall in the class of problems that can be solved by the model at hand, particularly those having a monotonic quadratic pseudo-Boolean function as constraint function. That is, functions easily derived by closed algebraic expressions representing the constraint structure and easy (polynomial time) to maximize. We show the asymptotic convergence properties of this model characterizing its state space distribution at thermal equilibrium in terms of Markov chain and give evidence of its ability to find high quality solutions on benchmarks and randomly generated instances of two specific problems taken from the computational graph theory.

Discriminate the response of Acute Myeloid Leukemia patients to treatment by using proteomics data and Answer Set Programming.

PubMed

Chebouba, Lokmane; Miannay, Bertrand; Boughaci, Dalila; Guziolowski, Carito

2018-03-08

During the last years, several approaches were applied on biomedical data to detect disease specific proteins and genes in order to better target drugs. It was shown that statistical and machine learning based methods use mainly clinical data and improve later their results by adding omics data. This work proposes a new method to discriminate the response of Acute Myeloid Leukemia (AML) patients to treatment. The proposed approach uses proteomics data and prior regulatory knowledge in the form of networks to predict cancer treatment outcomes by finding out the different Boolean networks specific to each type of response to drugs. To show its effectiveness we evaluate our method on a dataset from the DREAM 9 challenge. The results are encouraging and demonstrate the benefit of our approach to distinguish patient groups with different response to treatment. In particular each treatment response group is characterized by a predictive model in the form of a signaling Boolean network. This model describes regulatory mechanisms which are specific to each response group. The proteins in this model were selected from the complete dataset by imposing optimization constraints that maximize the difference in the logical response of the Boolean network associated to each group of patients given the omic dataset. This mechanistic and predictive model also allow us to classify new patients data into the two different patient response groups. We propose a new method to detect the most relevant proteins for understanding different patient responses upon treatments in order to better target drugs using a Prior Knowledge Network and proteomics data. The results are interesting and show the effectiveness of our method.

ASP-G: an ASP-based method for finding attractors in genetic regulatory networks

PubMed Central

Mushthofa, Mushthofa; Torres, Gustavo; Van de Peer, Yves; Marchal, Kathleen; De Cock, Martine

2014-01-01

Motivation: Boolean network models are suitable to simulate GRNs in the absence of detailed kinetic information. However, reducing the biological reality implies making assumptions on how genes interact (interaction rules) and how their state is updated during the simulation (update scheme). The exact choice of the assumptions largely determines the outcome of the simulations. In most cases, however, the biologically correct assumptions are unknown. An ideal simulation thus implies testing different rules and schemes to determine those that best capture an observed biological phenomenon. This is not trivial because most current methods to simulate Boolean network models of GRNs and to compute their attractors impose specific assumptions that cannot be easily altered, as they are built into the system. Results: To allow for a more flexible simulation framework, we developed ASP-G. We show the correctness of ASP-G in simulating Boolean network models and obtaining attractors under different assumptions by successfully recapitulating the detection of attractors of previously published studies. We also provide an example of how performing simulation of network models under different settings help determine the assumptions under which a certain conclusion holds. The main added value of ASP-G is in its modularity and declarativity, making it more flexible and less error-prone than traditional approaches. The declarative nature of ASP-G comes at the expense of being slower than the more dedicated systems but still achieves a good efficiency with respect to computational time. Availability and implementation: The source code of ASP-G is available at http://bioinformatics.intec.ugent.be/kmarchal/Supplementary_Information_Musthofa_2014/asp-g.zip. Contact: Kathleen.Marchal@UGent.be or Martine.DeCock@UGent.be Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25028722

Intelligent Machines in the 21st Century: Automating the Processes of Inference and Inquiry

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2003-01-01

The last century saw the application of Boolean algebra toward the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines. in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. However, modern intelligent machines work by inferring knowledge using only their pre-programmed prior knowledge and the data provided. They lack the ability to ask questions, or request data that would aid their inferences. Recent advances in understanding the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we identified the algebra of questions as the free distributive algebra, which now allows us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper we describe this logic of inference and inquiry using the mathematics of partially ordered sets and the scaffolding of lattice theory, discuss the far-reaching implications of the methodology, and demonstrate its application with current examples in machine learning. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them to not only make inferences from data, but also decide which question to ask, experiment to perform, or measurement to take given what they have learned and what they are designed to understand.

Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model

PubMed Central

Lu, Wei; Song, Jiangning; Akutsu, Tatsuya

2015-01-01

Abstract This article considers the problem whereby, given two metabolic networks N1 and N2, a set of source compounds, and a set of target compounds, we must find the minimum set of reactions whose removal (knockout) ensures that the target compounds are not producible in N1 but are producible in N2. Similar studies exist for the problem of finding the minimum knockout with the smallest side effect for a single network. However, if technologies of external perturbations are advanced in the near future, it may be important to develop methods of computing the minimum knockout for multiple networks (MKMN). Flux balance analysis (FBA) is efficient if a well-polished model is available. However, that is not always the case. Therefore, in this article, we study MKMN in Boolean models and an elementary mode (EM)-based model. Integer linear programming (ILP)-based methods are developed for these models, since MKMN is NP-complete for both the Boolean model and the EM-based model. Computer experiments are conducted with metabolic networks of clostridium perfringens SM101 and bifidobacterium longum DJO10A, respectively known as bad bacteria and good bacteria for the human intestine. The results show that larger networks are more likely to have MKMN solutions. However, solving for these larger networks takes a very long time, and often the computation cannot be completed. This is reasonable, because small networks do not have many alternative pathways, making it difficult to satisfy the MKMN condition, whereas in large networks the number of candidate solutions explodes. Our developed software minFvskO is available online. PMID:25684199

Is high-resolution inverse characterization of heterogeneous river bed hydraulic conductivities needed and possible?

NASA Astrophysics Data System (ADS)

Kurtz, W.; Hendricks Franssen, H.-J.; Brunner, P.; Vereecken, H.

2013-10-01

River-aquifer exchange fluxes influence local and regional water balances and affect groundwater and river water quality and quantity. Unfortunately, river-aquifer exchange fluxes tend to be strongly spatially variable, and it is an open research question to which degree river bed heterogeneity has to be represented in a model in order to achieve reliable estimates of river-aquifer exchange fluxes. This research question is addressed in this paper with the help of synthetic simulation experiments, which mimic the Limmat aquifer in Zurich (Switzerland), where river-aquifer exchange fluxes and groundwater management activities play an important role. The solution of the unsaturated-saturated subsurface hydrological flow problem including river-aquifer interaction is calculated for ten different synthetic realities where the strongly heterogeneous river bed hydraulic conductivities (L) are perfectly known. Hydraulic head data (100 in the default scenario) are sampled from the synthetic realities. In subsequent data assimilation experiments, where L is unknown now, the hydraulic head data are used as conditioning information, with the help of the ensemble Kalman filter (EnKF). For each of the ten synthetic realities, four different ensembles of L are tested in the experiments with EnKF; one ensemble estimates high-resolution L fields with different L values for each element, and the other three ensembles estimate effective L values for 5, 3 or 2 zones. The calibration of higher-resolution L fields (i.e. fully heterogeneous or 5 zones) gives better results than the calibration of L for only 3 or 2 zones in terms of reproduction of states, stream-aquifer exchange fluxes and parameters. Effective L for a limited number of zones cannot always reproduce the true states and fluxes well and results in biased estimates of net exchange fluxes between aquifer and stream. Also in case only 10 head data are used for conditioning, the high-resolution characterization of L fields with EnKF is still feasible. For less heterogeneous river bed hydraulic conductivities, a high-resolution characterization of L is less important. When uncertainties in the hydraulic parameters of the aquifer are also regarded in the assimilation, the errors in state and flux predictions increase, but the ensemble with a high spatial resolution for L still outperforms the ensembles with effective L values. We conclude that for strongly heterogeneous river beds the commonly applied simplified representation of the streambed, with spatially homogeneous parameters or constant parameters for a few zones, might yield significant biases in the characterization of the water balance. For strongly heterogeneous river beds, we suggest adopting a stochastic field approach to model the spatially heterogeneous river beds geostatistically. The paper illustrates that EnKF is able to calibrate such heterogeneous streambeds on the basis of hydraulic head measurements, outperforming zonation approaches.

Quantifying the heterogeneity of the tectonic stress field using borehole data

USGS Publications Warehouse

Schoenball, Martin; Davatzes, Nicholas C.

2017-01-01

The heterogeneity of the tectonic stress field is a fundamental property which influences earthquake dynamics and subsurface engineering. Self-similar scaling of stress heterogeneities is frequently assumed to explain characteristics of earthquakes such as the magnitude-frequency relation. However, observational evidence for such scaling of the stress field heterogeneity is scarce.We analyze the local stress orientations using image logs of two closely spaced boreholes in the Coso Geothermal Field with sub-vertical and deviated trajectories, respectively, each spanning about 2 km in depth. Both the mean and the standard deviation of stress orientation indicators (borehole breakouts, drilling-induced fractures and petal-centerline fractures) determined from each borehole agree to the limit of the resolution of our method although measurements at specific depths may not. We find that the standard deviation in these boreholes strongly depends on the interval length analyzed, generally increasing up to a wellbore log length of about 600 m and constant for longer intervals. We find the same behavior in global data from the World Stress Map. This suggests that the standard deviation of stress indicators characterizes the heterogeneity of the tectonic stress field rather than the quality of the stress measurement. A large standard deviation of a stress measurement might be an expression of strong crustal heterogeneity rather than of an unreliable stress determination. Robust characterization of stress heterogeneity requires logs that sample stress indicators along a representative sample volume of at least 1 km.

On observation of local strong heterogeneity in the Earth's inner core below southeastern Asia

NASA Astrophysics Data System (ADS)

Krasnoshchekov, D. N.; Kaazik, P. B.; Ovtchinnikov, V. M.

2016-12-01

The dimensions and nature of multi-scale structural heterogeneities in the Earth's inner core (IC) provide important constraints on its mineralogy and formation history. Teleseismic body waves with turn points close to the inner core boundary (ICB) provide a unique tool for imaging the fine structure of the upper IC. In this study, we invoke differential travel times and amplitudes of PKPBC and PKPDF waveforms observed in crossing polar and equatorial paths to provide more constraints on the heterogeneity previously located in the quasi-eastern hemisphere of the IC (Kaazik et al., 2015; Krasnoshchekov et al., 2016). A more refined analysis of quasi-polar PKPBC/PKPDF amplitude ratios measured within the heterogeneity indicates that seismic attenuation is both frequency and depth dependent, and its relatively low Q-factor at 1 Hz of approximately 118 tends to grow with depth. Outside the heterogeneity, no pronounced polar-equatorial differences are observed; the estimated Q factor is about twice as large and not directionally dependent. We also analyse new differential travel times of rays that enable sampling of the anomaly at greater depths. The analysis exhibits the polar - equatorial contrasts observed in the heterogeneity terminate at approximately 520 km below the ICB, which we interpret to be its bottom. The earlier interpretation of the heterogeneity in terms of strong anisotropic volume amidst the almost isotropic eastern hemisphere of the IC can be retained, and the lower bound of anisotropy strength within the anomaly is determined to be 2%.

A Conceptual Approach to Understanding Treatment Heterogeneity in Human Capital Interventions

ERIC Educational Resources Information Center

Duncan, Greg J.; Vandell, Deborah Lowe

2012-01-01

Policy research on children is heavily balkanized by discipline. Economists bring strong experimental and quasi-experimental methods to their policy research, and recognize in their conception of causation that policies may have heterogeneous treatment impacts. But economic theories make few concrete predictions regarding either the nature of that…

Make Mine a Metasearcher, Please!

ERIC Educational Resources Information Center

Repman, Judi; Carlson, Randal D.

2000-01-01

Describes metasearch tools and explains their value in helping library media centers improve students' Web searches. Discusses Boolean queries and the emphasis on speed at the expense of comprehensiveness; and compares four metasearch tools, including the number of search engines consulted, user control, and databases included. (LRW)

Boolean Approaches in Digital Diagnosis

DTIC Science & Technology

1989-12-04

Automation Conference, pages 64-70, 1983. 16. Barry W. Johnson. Design and A nalysis of Fault-Tolerant Digital Systems. Addison- Wesley Publishing...Mitchell. On a new algebra of logic. In C.S. Peirce, edhitor, Studies in Logic. Little, Brown. Boston. 1883. 2:3. Roger S. Pressman . Softwrare Engineering

Presentation of Repeated Phrases in a Computer-Assisted Abstracting Tool Kit.

ERIC Educational Resources Information Center

Craven, Timothy C.

2001-01-01

Discusses automatic indexing methods and describes the development of a prototype computerized abstractor's assistant. Highlights include the text network management system, TEXNET; phrase selection that follows indexing; phrase display, including Boolean capabilities; results of preliminary testing; and availability of TEXNET software. (LRW)

Stochastic Pseudo-Boolean Optimization

DTIC Science & Technology

2011-07-31

Right-Hand Side,” 2009 IN- FORMS Annual Meeting, San Diego, CA, October 11-14, 2009. 113 References [1] A.-Ghouila-Houri. Caracterisation des matrices...Optimization, 10:7–21, 2005. [30] P. Camion. Caracterisation des matrices unimodulaires. Cahiers Centre Etudes Rech., 5(4), 1963. [31] P. Camion

Order or chaos in Boolean gene networks depends on the mean fraction of canalizing functions

NASA Astrophysics Data System (ADS)

Karlsson, Fredrik; Hörnquist, Michael

2007-10-01

We explore the connection between order/chaos in Boolean networks and the naturally occurring fraction of canalizing functions in such systems. This fraction turns out to give a very clear indication of whether the system possesses ordered or chaotic dynamics, as measured by Derrida plots, and also the degree of order when we compare different networks with the same number of vertices and edges. By studying also a wide distribution of indegrees in a network, we show that the mean probability of canalizing functions is a more reliable indicator of the type of dynamics for a finite network than the classical result on stability relating the bias to the mean indegree. Finally, we compare by direct simulations two biologically derived networks with networks of similar sizes but with power-law and Poisson distributions of indegrees, respectively. The biologically motivated networks are not more ordered than the latter, and in one case the biological network is even chaotic while the others are not.

Small fan-in is beautiful

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beiu, V.; Makaruk, H.E.

1997-09-01

The starting points of this paper are two size-optimal solutions: (1) one for implementing arbitrary Boolean functions; and (2) another one for implementing certain subclasses of Boolean functions. Because VLSI implementations do not cope well with highly interconnected nets -- the area of a chip grows with the cube of the fan-in -- this paper will analyze the influence of limited fan-in on the size optimality for the two solutions mentioned. First, the authors will extend a result from Horne and Hush valid for fan-in {Delta} = 2 to arbitrary fan-in. Second, they will prove that size-optimal solutions are obtainedmore » for small constant fan-ins for both constructions, while relative minimum size solutions can be obtained for fan-ins strictly lower that linear. These results are in agreement with similar ones proving that for small constant fan-ins ({Delta} = 6...9) there exist VLSI-optimal (i.e., minimizing AT{sup 2}) solutions, while there are similar small constants relating to the capacity of processing information.« less

Realisation of all 16 Boolean logic functions in a single magnetoresistance memory cell.

PubMed

Gao, Shuang; Yang, Guang; Cui, Bin; Wang, Shouguo; Zeng, Fei; Song, Cheng; Pan, Feng

2016-07-07

Stateful logic circuits based on next-generation nonvolatile memories, such as magnetoresistance random access memory (MRAM), promise to break the long-standing von Neumann bottleneck in state-of-the-art data processing devices. For the successful commercialisation of stateful logic circuits, a critical step is realizing the best use of a single memory cell to perform logic functions. In this work, we propose a method for implementing all 16 Boolean logic functions in a single MRAM cell, namely a magnetoresistance (MR) unit. Based on our experimental results, we conclude that this method is applicable to any MR unit with a double-hump-like hysteresis loop, especially pseudo-spin-valve magnetic tunnel junctions with a high MR ratio. Moreover, after simply reversing the correspondence between voltage signals and output logic values, this method could also be applicable to any MR unit with a double-pit-like hysteresis loop. These results may provide a helpful solution for the final commercialisation of MRAM-based stateful logic circuits in the near future.

Evolution of Boolean networks under selection for a robust response to external inputs yields an extensive neutral space

NASA Astrophysics Data System (ADS)

Szejka, Agnes; Drossel, Barbara

2010-02-01

We study the evolution of Boolean networks as model systems for gene regulation. Inspired by biological networks, we select simultaneously for robust attractors and for the ability to respond to external inputs by changing the attractor. Mutations change the connections between the nodes and the update functions. In order to investigate the influence of the type of update functions, we perform our simulations with canalizing as well as with threshold functions. We compare the properties of the fitness landscapes that result for different versions of the selection criterion and the update functions. We find that for all studied cases the fitness landscape has a plateau with maximum fitness resulting in the fact that structurally very different networks are able to fulfill the same task and are connected by neutral paths in network (“genotype”) space. We find furthermore a connection between the attractor length and the mutational robustness, and an extremely long memory of the initial evolutionary stage.

Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain.

PubMed

Frolov, Alexander A; Húsek, Dušan; Polyakov, Pavel Yu

2016-03-01

An usual task in large data set analysis is searching for an appropriate data representation in a space of fewer dimensions. One of the most efficient methods to solve this task is factor analysis. In this paper, we compare seven methods for Boolean factor analysis (BFA) in solving the so-called bars problem (BP), which is a BFA benchmark. The performance of the methods is evaluated by means of information gain. Study of the results obtained in solving BP of different levels of complexity has allowed us to reveal strengths and weaknesses of these methods. It is shown that the Likelihood maximization Attractor Neural Network with Increasing Activity (LANNIA) is the most efficient BFA method in solving BP in many cases. Efficacy of the LANNIA method is also shown, when applied to the real data from the Kyoto Encyclopedia of Genes and Genomes database, which contains full genome sequencing for 1368 organisms, and to text data set R52 (from Reuters 21578) typically used for label categorization.

Toward heterogeneity in feedforward network with synaptic delays based on FitzHugh-Nagumo model

NASA Astrophysics Data System (ADS)

Qin, Ying-Mei; Men, Cong; Zhao, Jia; Han, Chun-Xiao; Che, Yan-Qiu

2018-01-01

We focus on the role of heterogeneity on the propagation of firing patterns in feedforward network (FFN). Effects of heterogeneities both in parameters of neuronal excitability and synaptic delays are investigated systematically. Neuronal heterogeneity is found to modulate firing rates and spiking regularity by changing the excitability of the network. Synaptic delays are strongly related with desynchronized and synchronized firing patterns of the FFN, which indicate that synaptic delays may play a significant role in bridging rate coding and temporal coding. Furthermore, quasi-coherence resonance (quasi-CR) phenomenon is observed in the parameter domain of connection probability and delay-heterogeneity. All these phenomena above enable a detailed characterization of neuronal heterogeneity in FFN, which may play an indispensable role in reproducing the important properties of in vivo experiments.

Modeling Nuclear Receptor-Mediated Activity and Hepatotoxicity with Boolean Networks

EPA Science Inventory

Predicting the human health risk of chronic exposure to environmental contaminants remains an open problem. Chronic exposure to a wide array of chemicals – e.g., conazoles, perfluourinated chemicals and phthalates – has been associated with a range of hepatic lesions in rodents t...

Guide to Human Factors Information Sources.

DTIC Science & Technology

1984-11-01

intermediary, a computer search is sometimes unnecessary. A lucid way of presenting a search objective is either by Boolean (and/or) expressions or by Venn...1965). Human factors evaluation in system development. New York: John Wiley & Sons. 56. Murray, E. J. (1965). Sleep, dreams , and arousal. New York

Probabilistic Relational Structures and Their Applications

ERIC Educational Resources Information Center

Domotor, Zoltan

The principal objects of the investigation reported were, first, to study qualitative probability relations on Boolean algebras, and secondly, to describe applications in the theories of probability logic, information, automata, and probabilistic measurement. The main contribution of this work is stated in 10 definitions and 20 theorems. The basic…

Massive Query Resolution for Rapid Selective Dissemination of Information.

ERIC Educational Resources Information Center

Cohen, Jonathan D.

1999-01-01

Outlines an efficient approach to performing query resolution which, when matched with a keyword scanner, offers rapid selecting and routing for massive Boolean queries, and which is suitable for implementation on a desktop computer. Demonstrates the system's operation with large examples in a practical setting. (AEF)

Real time numerical shake prediction incorporating attenuation structure: a case for the 2016 Kumamoto Earthquake

NASA Astrophysics Data System (ADS)

Ogiso, M.; Hoshiba, M.; Shito, A.; Matsumoto, S.

2016-12-01

Needless to say, heterogeneous attenuation structure is important for ground motion prediction, including earthquake early warning, that is, real time ground motion prediction. Hoshiba and Ogiso (2015, AGU Fall meeting) showed that the heterogeneous attenuation and scattering structure will lead to earlier and more accurate ground motion prediction in the numerical shake prediction scheme proposed by Hoshiba and Aoki (2015, BSSA). Hoshiba and Ogiso (2015) used assumed heterogeneous structure, and we discuss the effect of them in the case of 2016 Kumamoto Earthquake, using heterogeneous structure estimated by actual observation data. We conducted Multiple Lapse Time Window Analysis (Hoshiba, 1993, JGR) to the seismic stations located on western part of Japan to estimate heterogeneous attenuation and scattering structure. The characteristics are similar to the previous work of Carcole and Sato (2010, GJI), e.g. strong intrinsic and scattering attenuation around the volcanoes located on the central part of Kyushu, and relatively weak heterogeneities in the other area. Real time ground motion prediction simulation for the 2016 Kumamoto Earthquake was conducted using the numerical shake prediction scheme with 474 strong ground motion stations. Comparing the snapshot of predicted and observed wavefield showed a tendency for underprediction around the volcanic area in spite of the heterogeneous structure. These facts indicate the necessity of improving the heterogeneous structure for the numerical shake prediction scheme.In this study, we used the waveforms of Hi-net, K-NET, KiK-net stations operated by the NIED for estimating structure and conducting ground motion prediction simulation. Part of this study was supported by the Earthquake Research Institute, the University of Tokyo cooperative research program and JSPS KAKENHI Grant Number 25282114.

Single-Cell Analysis of the Impact of Host Cell Heterogeneity on Infection with Foot-and-Mouth Disease Virus.

PubMed

Xin, Xiu; Wang, Hailong; Han, Lingling; Wang, Mingzhen; Fang, Hui; Hao, Yao; Li, Jiadai; Zhang, Hu; Zheng, Congyi; Shen, Chao

2018-05-01

Viral infection and replication are affected by host cell heterogeneity, but the mechanisms underlying the effects remain unclear. Using single-cell analysis, we investigated the effects of host cell heterogeneity, including cell size, inclusion, and cell cycle, on foot-and-mouth disease virus (FMDV) infection (acute and persistent infections) and replication. We detected various viral genome replication levels in FMDV-infected cells. Large cells and cells with a high number of inclusions generated more viral RNA copies and viral protein and a higher proportion of infectious cells than other cells. Additionally, we found that the viral titer was 10- to 100-fold higher in cells in G 2 /M than those in other cell cycle phases and identified a strong correlation between cell size, inclusion, and cell cycle heterogeneity, which all affected the infection and replication of FMDV. Furthermore, we demonstrated that host cell heterogeneity influenced the adsorption of FMDV due to differences in the levels of FMDV integrin receptors expression. Collectively, these results further our understanding of the evolution of a virus in a single host cell. IMPORTANCE It is important to understand how host cell heterogeneity affects viral infection and replication. Using single-cell analysis, we found that viral genome replication levels exhibited dramatic variability in foot-and-mouth disease virus (FMDV)-infected cells. We also found a strong correlation between heterogeneity in cell size, inclusion number, and cell cycle status and that all of these characteristics affect the infection and replication of FMDV. Moreover, we found that host cell heterogeneity influenced the viral adsorption as differences in the levels of FMDV integrin receptors' expression. This study provided new ideas for the studies of correlation between FMDV infection mechanisms and host cells. Copyright © 2018 American Society for Microbiology.

Heterogeneous Catalysis with Renewed Attention: Principles, Theories, and Concepts

ERIC Educational Resources Information Center

Dumeignil, Franck; Paul, Jean-Francois; Paul, Sebastien

2017-01-01

With the development of a strong bioeconomy sector related to the creation of next-generation biorefineries, heterogeneous catalysis is receiving renewed attention. Indeed, catalysis is at the core of biorefinery design, and many new catalysts and catalytic processes are being developed. On the one hand, they are based on knowledge acquired during…

Fourier mode analysis of slab-geometry transport iterations in spatially periodic media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Larsen, E; Zika, M

1999-04-01

We describe a Fourier analysis of the diffusion-synthetic acceleration (DSA) and transport-synthetic acceleration (TSA) iteration schemes for a spatially periodic, but otherwise arbitrarily heterogeneous, medium. Both DSA and TSA converge more slowly in a heterogeneous medium than in a homogeneous medium composed of the volume-averaged scattering ratio. In the limit of a homogeneous medium, our heterogeneous analysis contains eigenvalues of multiplicity two at ''resonant'' wave numbers. In the presence of material heterogeneities, error modes corresponding to these resonant wave numbers are ''excited'' more than other error modes. For DSA and TSA, the iteration spectral radius may occur at these resonantmore » wave numbers, in which case the material heterogeneities most strongly affect iterative performance.« less

Identifying regions of strong scattering at the core-mantle boundary from analysis of PKKP precursor energy

USGS Publications Warehouse

Rost, S.; Earle, P.S.

2010-01-01

We detect seismic scattering from the core-mantle boundary related to the phase PKKP (PK. KP) in data from small aperture seismic arrays in India and Canada. The detection of these scattered waves in data from small aperture arrays is new and allows a better characterization of the fine-scale structure of the deep Earth especially in the southern hemisphere. Their slowness vector is determined from array processing allowing location of the heterogeneities at the core-mantle boundary using back-projection techniques through 1D Earth models. We identify strong scattering at the core-mantle boundary (CMB) beneath the Caribbean, Patagonia and the Antarctic Peninsula as well as beneath southern Africa. An analysis of the scattering regions relative to sources and receivers indicates that these regions represent areas of increased scattering likely due to increased heterogeneities close to the CMB. The 1. Hz array data used in this study is most sensitive to heterogeneity with scale lengths of about 10. km. Given the small size of the scatterers, a chemical origin of the heterogeneities is likely. By comparing the location of the fine-scale heterogeneity to geodynamical models and tomographic images, we identify different scattering mechanisms in regions related to subduction (Caribbean and Patagonia) and dense thermo chemical piles (Southern Africa). ?? 2010 Elsevier B.V.

Unexpected Nongenetic Individual Heterogeneity and Trait Covariance in Daphnia and Its Consequences for Ecological and Evolutionary Dynamics.

PubMed

Cressler, Clayton E; Bengtson, Stefan; Nelson, William A

2017-07-01

Individual differences in genetics, age, or environment can cause tremendous differences in individual life-history traits. This individual heterogeneity generates demographic heterogeneity at the population level, which is predicted to have a strong impact on both ecological and evolutionary dynamics. However, we know surprisingly little about the sources of individual heterogeneity for particular taxa or how different sources scale up to impact ecological and evolutionary dynamics. Here we experimentally study the individual heterogeneity that emerges from both genetic and nongenetic sources in a species of freshwater zooplankton across a large gradient of food quality. Despite the tight control of environment, we still find that the variation from nongenetic sources is greater than that from genetic sources over a wide range of food quality and that this variation has strong positive covariance between growth and reproduction. We evaluate the general consequences of genetic and nongenetic covariance for ecological and evolutionary dynamics theoretically and find that increasing nongenetic variation slows evolution independent of the correlation in heritable life-history traits but that the impact on ecological dynamics depends on both nongenetic and genetic covariance. Our results demonstrate that variation in the relative magnitude of nongenetic versus genetic sources of variation impacts the predicted ecological and evolutionary dynamics.

Internal fracture heterogeneity in discrete fracture network modelling: Effect of correlation length and textures with connected and disconnected permeability field

NASA Astrophysics Data System (ADS)

Frampton, A.; Hyman, J.; Zou, L.

2017-12-01

Analysing flow and transport in sparsely fractured media is important for understanding how crystalline bedrock environments function as barriers to transport of contaminants, with important applications towards subsurface repositories for storage of spent nuclear fuel. Crystalline bedrocks are particularly favourable due to their geological stability, low advective flow and strong hydrogeochemical retention properties, which can delay transport of radionuclides, allowing decay to limit release to the biosphere. There are however many challenges involved in quantifying and modelling subsurface flow and transport in fractured media, largely due to geological complexity and heterogeneity, where the interplay between advective and dispersive flow strongly impacts both inert and reactive transport. A key to modelling transport in a Lagrangian framework involves quantifying pathway travel times and the hydrodynamic control of retention, and both these quantities strongly depend on heterogeneity of the fracture network at different scales. In this contribution, we present recent analysis of flow and transport considering fracture networks with single-fracture heterogeneity described by different multivariate normal distributions. A coherent triad of fields with identical correlation length and variance are created but which greatly differ in structure, corresponding to textures with well-connected low, medium and high permeability structures. Through numerical modelling of multiple scales in a stochastic setting we quantify the relative impact of texture type and correlation length against network topological measures, and identify key thresholds for cases where flow dispersion is controlled by single-fracture heterogeneity versus network-scale heterogeneity. This is achieved by using a recently developed novel numerical discrete fracture network model. Furthermore, we highlight enhanced flow channelling for cases where correlation structure continues across intersections in a network, and discuss application to realistic fracture networks using field data of sparsely fractured crystalline rock from the Swedish candidate repository site for spent nuclear fuel.

Bacteria as living patchy colloids: Phenotypic heterogeneity in surface adhesion

PubMed Central

Hermes, Michiel; Schwarz-Linek, Jana; Poon, Wilson C. K.

2018-01-01

Understanding and controlling the surface adhesion of pathogenic bacteria is of urgent biomedical importance. However, many aspects of this process remain unclear (for example, microscopic details of the initial adhesion and possible variations between individual cells). Using a new high-throughput method, we identify and follow many single cells within a clonal population of Escherichia coli near a glass surface. We find strong phenotypic heterogeneities: A fraction of the cells remain in the free (planktonic) state, whereas others adhere with an adhesion strength that itself exhibits phenotypic heterogeneity. We explain our observations using a patchy colloid model; cells bind with localized, adhesive patches, and the strength of adhesion is determined by the number of patches: Nonadherers have no patches, weak adherers bind with a single patch only, and strong adherers bind via a single or multiple patches. We discuss possible implications of our results for controlling bacterial adhesion in biomedical and other applications. PMID:29719861

Dataflow Computation for the J-Machine

DTIC Science & Technology

1990-06-01

MOVE 8. 1 CALL ClrTVCTO1 ;((:LkBEL (:LITERAL (:SYIBOL : BBD -IF-4)))) ZIDIF.4: ROVE [1,133, 3.3 ROV 13. A2 ((:TERIXATM)) SUSPEND ;((:LAEL (:LITBUAL...deftostant syn 0) (detconstant int-tag ’int) (detconatant Int 1) (detconstant id-tag ’ td ) (defconstant td 9) (Aotconstaut boolean-tag lbool

Exploiting the Maximum Entropy Principle to Increase Retrieval Effectiveness.

ERIC Educational Resources Information Center

Cooper, William S.

1983-01-01

Presents information retrieval design approach in which queries of computer-based system consist of sets of terms, either unweighted or weighted with subjective term precision estimates, and retrieval outputs ranked by probability of usefulness estimated by "maximum entropy principle." Boolean and weighted request systems are discussed.…

"Back-Stage" Dissent: Student Twitter Use Addressing Instructor Ideology

ERIC Educational Resources Information Center

Linvill, Darren L.; Boatwright, Brandon C.; Grant, Will J.

2018-01-01

In this content analysis, we explored how students address instructor ideology in the university classroom through the social media platform Twitter. We employed Boolean search operators through Salesforce Marketing Cloud Radian6 software to gather tweets and identified English language tweets by how students referenced their instructor's…

Optimization of digital designs

NASA Technical Reports Server (NTRS)

Miles, Lowell H. (Inventor); Whitaker, Sterling R. (Inventor)

2009-01-01

An application specific integrated circuit is optimized by translating a first representation of its digital design to a second representation. The second representation includes multiple syntactic expressions that admit a representation of a higher-order function of base Boolean values. The syntactic expressions are manipulated to form a third representation of the digital design.

Topology of Document Retrieval Systems.

ERIC Educational Resources Information Center

Everett, Daniel M.; Cater, Steven C.

1992-01-01

Explains the use of a topological structure to examine the closeness between documents in retrieval systems and analyzes the topological structure of a vector-space model, a fuzzy-set model, an extended Boolean model, a probabilistic model, and a TIRS (Topological Information Retrieval System) model. Proofs for the results are appended. (17…

Must "Hard Problems" Be Hard?

ERIC Educational Resources Information Center

Kolata, Gina

1985-01-01

To determine how hard it is for computers to solve problems, researchers have classified groups of problems (polynomial hierarchy) according to how much time they seem to require for their solutions. A difficult and complex proof is offered which shows that a combinatorial approach (using Boolean circuits) may resolve the problem. (JN)

The Impact of Text Browsing on Text Retrieval Performance.

ERIC Educational Resources Information Center

Bodner, Richard C.; Chignell, Mark H.; Charoenkitkarn, Nipon; Golovchinsky, Gene; Kopak, Richard W.

2001-01-01

Compares empirical results from three experiments using Text Retrieval Conference (TREC) data and search topics that involved three different user interfaces. Results show that marking Boolean queries on text, which encourages browsing, and hypertext interfaces to text retrieval systems can benefit recall and can also benefit novice users.…

LISA's Move from SilverPlatter to Bowker--Looking at the Interface.

ERIC Educational Resources Information Center

Stein, Jonathan

1994-01-01

Compares LISA (Library and Information Science Abstracts) on SilverPlatter's CD-ROM with its replacement version, Bowker-Saur's LISA Plus. Features reviewed include entry to the databases; use of Boolean search facilities; indexes and browsing; displaying and printing records; subsidiary functions; on-screen help; and interfaces. (Contains eight…

Library Dream Machines: Helping Students Master Super Online Catalogs.

ERIC Educational Resources Information Center

Webb, T. D.

1992-01-01

Describes how automation has transformed the library and how super-catalogs have affected the process of doing research. Explains how faculty and librarians can work together to help students to use the available databases effectively, by teaching them Boolean logic, standard record formats, filing rules, etc. (DMM)

Fundamentals of Digital Logic.

ERIC Educational Resources Information Center

Noell, Monica L.

This course is designed to prepare electronics personnel for further training in digital techniques, presenting need to know information that is basic to any maintenance course on digital equipment. It consists of seven study units: (1) binary arithmetic; (2) boolean algebra; (3) logic gates; (4) logic flip-flops; (5) nonlogic circuits; (6)…

Conducting a Web Search.

ERIC Educational Resources Information Center

Miller-Whitehead, Marie

Keyword and text string searches of online library catalogs often provide different results according to library and database used and depending upon how books and journals are indexed. For this reason, online databases such as ERIC often provide tutorials and recommendations for searching their site, such as how to use Boolean search strategies.…

A Hypermedia Computer-Aided Parasitology Tutoring System.

ERIC Educational Resources Information Center

Theodoropoulos, Georgios; Loumos, Vassili

A hypermedia tutoring system for teaching parasitology to college students was developed using an object oriented software development tool, Knowledge Pro. The program was designed to meet four objectives: knowledge incorporation, tutoring, indexing of key words for Boolean search, and random generation of quiz questions with instant scoring. The…

Community Information Centers and the Computer.

ERIC Educational Resources Information Center

Carroll, John M.; Tague, Jean M.

Two computer data bases have been developed by the Computer Science Department at the University of Western Ontario for "Information London," the local community information center. One system, called LONDON, permits Boolean searches of a file of 5,000 records describing human service agencies in the London area. The second system,…

Cryptographic Properties of the Hidden Weighted Bit Function

DTIC Science & Technology

2013-12-23

valid OMB control number. 1. REPORT DATE 23 DEC 2013 2. REPORT TYPE 3. DATES COVERED 00-00-2013 to 00-00-2013 4. TITLE AND SUBTITLE...K. Feng, An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity, in: IWCC 2009, In: LNCS

Assessing Institutional Ineffectiveness: A Strategy for Improvement.

ERIC Educational Resources Information Center

Cameron, Kim S.

1984-01-01

Based on the theory that institutional change and improvement are motivated more by knowledge of problems than by knowledge of successes, a fault tree analysis technique using Boolean logic for assessing institutional ineffectiveness by determining weaknesses in the system is presented. Advantages and disadvantages of focusing on weakness rather…

Subject Retrieval from Full-Text Databases in the Humanities

ERIC Educational Resources Information Center

East, John W.

2007-01-01

This paper examines the problems involved in subject retrieval from full-text databases of secondary materials in the humanities. Ten such databases were studied and their search functionality evaluated, focusing on factors such as Boolean operators, document surrogates, limiting by subject area, proximity operators, phrase searching, wildcards,…

Kolmogorov proof of the Clauser, Horne, Shimony and Holt inequalities

NASA Astrophysics Data System (ADS)

Revzen, M.

Boolean logic is used to prove the CHSH inequalities. The proof elucidates the connection between Einstein elements of reality and quantum non-locality. The violation of the CHSH inequality by quantum theory is discussed and the two-stage view of quantum measurement relevance to incompatible observables is outlined.

Stresses, deformation, and seismic events on scaled experimental faults with heterogeneous fault segments and comparison to numerical modeling

NASA Astrophysics Data System (ADS)

Buijze, Loes; Guo, Yanhuang; Niemeijer, André R.; Ma, Shengli; Spiers, Christopher J.

2017-04-01

Faults in the upper crust cross-cut many different lithologies, which cause the composition of the fault rocks to vary. Each different fault rock segment may have specific mechanical properties, e.g. there may be stronger and weaker segments, and segments prone to unstable slip or creeping. This leads to heterogeneous deformation and stresses along such faults, and a heterogeneous distribution of seismic events. We address the influence of fault variability on stress, deformation, and seismicity using a combination of scaled laboratory fault and numerical modeling. A vertical fault was created along the diagonal of a 30 x 20 x 5 cm block of PMMA, along which a 2 mm thick gouge layer was deposited. Gouge materials of different characteristics were used to create various segments along the fault; quartz (average strength, stable sliding), kaolinite (weak, stable sliding), and gypsum (average strength, unstable sliding). The sample assembly was placed in a horizontal biaxial deformation apparatus, and shear displacement was enforced along the vertical fault. Multiple observations were made: 1) Acoustic emissions were continuously recorded at 3 MHz to observe the occurrence of stick-slips (micro-seismicity), 2) Photo-elastic effects (indicative of the differential stress) were recorded in the transparent set of PMMA wall-rocks using a high-speed camera, and 3) particle tracking was conducted on a speckle painted set of PMMA wall-rocks to study the deformation in the wall-rocks flanking the fault. All three observation methods show how the heterogeneous fault gouge exerts a strong control on the fault behavior. For example, a strong, unstable segment of gypsum flanked by two weaker kaolinite segments show strong stress concentrations develop near the edges of the strong segment, with at the same time most of acoustic emissions being located at the edge of this strong segment. The measurements of differential stress, strain and acoustic emissions provide a strong means to compare the scaled experiment to modeling results. In a finite-element model we reproduce the laboratory experiments, and compare the modeled stresses and strains to the observations and we compare the nucleation of seismic instability to the location of acoustic emissions. The model aids in understanding how the stresses and strains may vary as a result of fault heterogeneity, but also as a result of the boundary conditions inherent to a laboratory setup. The scaled experimental setup and modeling results also provide a means explain and compare with observations made at a larger scale, for example geodetic and seismological measurements along crustal scale faults.

Expanding the horizons for single-cell applications on lab-on-a-chip devices.

PubMed

Kim, Soo Hyeon; Fourmy, Dominique; Fujii, Teruo

2012-01-01

Stochastic events in gene expression, protein synthesis, and metabolite synthesis or degradation lead to cellular heterogeneity essential to life. In a tissue as we see in organs, there is strong heterogeneity among the constituting cells critical to its function. Thus, there exists a strong demand to develop new micro/nanosystems that would enable us to conduct single-cell analysis. This field is rapidly growing, as exemplified below with recent emerging technologies that now reveal sensitive single-cell "omics" analysis. We describe in the review some of the most promising technologies that will certainly transform our view of biology in the near future.

Effects of Heterogeneous Social Interactions on Flocking Dynamics

NASA Astrophysics Data System (ADS)

Miguel, M. Carmen; Parley, Jack T.; Pastor-Satorras, Romualdo

2018-02-01

Social relationships characterize the interactions that occur within social species and may have an important impact on collective animal motion. Here, we consider a variation of the standard Vicsek model for collective motion in which interactions are mediated by an empirically motivated scale-free topology that represents a heterogeneous pattern of social contacts. We observe that the degree of order of the model is strongly affected by network heterogeneity: more heterogeneous networks show a more resilient ordered state, while less heterogeneity leads to a more fragile ordered state that can be destroyed by sufficient external noise. Our results challenge the previously accepted equivalence between the static Vicsek model and the equilibrium X Y model on the network of connections, and point towards a possible equivalence with models exhibiting a different symmetry.

Contagion on complex networks with persuasion

NASA Astrophysics Data System (ADS)

Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu

2016-03-01

The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense.

Contagion on complex networks with persuasion

PubMed Central

Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu

2016-01-01

The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense. PMID:27029498

Contagion on complex networks with persuasion.

PubMed

Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu

2016-03-31

The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense.

DOE Office of Scientific and Technical Information (OSTI.GOV)

J. Zhou; H. Huang; M. Deo

Log and seismic data indicate that most shale formations have strong heterogeneity. Conventional analytical and semi-analytical fracture models are not enough to simulate the complex fracture propagation in these highly heterogeneous formation. Without considering the intrinsic heterogeneity, predicted morphology of hydraulic fracture may be biased and misleading in optimizing the completion strategy. In this paper, a fully coupling fluid flow and geomechanics hydraulic fracture simulator based on dual-lattice Discrete Element Method (DEM) is used to predict the hydraulic fracture propagation in heterogeneous reservoir. The heterogeneity of rock is simulated by assigning different material force constant and critical strain to differentmore » particles and is adjusted by conditioning to the measured data and observed geological features. Based on proposed model, the effects of heterogeneity at different scale on micromechanical behavior and induced macroscopic fractures are examined. From the numerical results, the microcrack will be more inclined to form at the grain weaker interface. The conventional simulator with homogeneous assumption is not applicable for highly heterogeneous shale formation.« less

Introducing Online Bibliographic Service to its Users: The Online Presentation

ERIC Educational Resources Information Center

Crane, Nancy B.; Pilachowski, David M.

1978-01-01

A description of techniques for introducing online services to new user groups includes discussion of terms and their definitions, evolution of online searching, advantages and disadvantages of online searching, production of the data bases, search strategies, Boolean logic, costs and charges, "do's and don'ts," and a user search questionnaire. (J…

A Study of Search Intermediary Working Notes: Implications for IR System Design.

ERIC Educational Resources Information Center

Spink, Amanda; Goodrum, Abby

1996-01-01

Reports findings from an exploratory study investigating working notes created during encoding and external storage (EES) processes by human search intermediaries (librarians at the University of North Texas) using a Boolean information retrieval (IR) system. Implications for the design of IR interfaces and further research is discussed.…

Recognition vs Reverse Engineering in Boolean Concepts Learning

ERIC Educational Resources Information Center

Shafat, Gabriel; Levin, Ilya

2012-01-01

This paper deals with two types of logical problems--recognition problems and reverse engineering problems, and with the interrelations between these types of problems. The recognition problems are modeled in the form of a visual representation of various objects in a common pattern, with a composition of represented objects in the pattern.…

Target-Based Maintenance of Privacy Preserving Association Rules

ERIC Educational Resources Information Center

Ahluwalia, Madhu V.

2011-01-01

In the context of association rule mining, the state-of-the-art in privacy preserving data mining provides solutions for categorical and Boolean association rules but not for quantitative association rules. This research fills this gap by describing a method based on discrete wavelet transform (DWT) to protect input data privacy while preserving…

Information Resources Usage in Project Management Digital Learning System

ERIC Educational Resources Information Center

Davidovitch, Nitza; Belichenko, Margarita; Kravchenko, Yurii

2017-01-01

The article combines a theoretical approach to structuring knowledge that is based on the integrated use of fuzzy semantic network theory predicates, Boolean functions, theory of complexity of network structures and some practical aspects to be considered in the distance learning at the university. The paper proposes a methodological approach that…

Algebraic grid adaptation method using non-uniform rational B-spline surface modeling

NASA Technical Reports Server (NTRS)

Yang, Jiann-Cherng; Soni, B. K.

1992-01-01

An algebraic adaptive grid system based on equidistribution law and utilized by the Non-Uniform Rational B-Spline (NURBS) surface for redistribution is presented. A weight function, utilizing a properly weighted boolean sum of various flow field characteristics is developed. Computational examples are presented to demonstrate the success of this technique.

A Characterization of Banach Spaces Containing l1

PubMed Central

Rosenthal, Haskell P.

1974-01-01

It is proved that a Banach space contains a subspace isomorphic to l1 if (and only if) it has a bounded sequence with no weak-Cauchy subsequence. The proof yields that a sequence of subsets of a given set has a subsequence that is either convergent or Boolean independent. PMID:16592162

Deriving Laws from Ordering Relations

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2004-01-01

The effect of Richard T. Cox's contribution to probability theory was to generalize Boolean implication among logical statements to degrees of implication, which are manipulated using rules derived from consistency with Boolean algebra. These rules are known as the sum rule, the product rule and Bayes Theorem, and the measure resulting from this generalization is probability. In this paper, I will describe how Cox s technique can be further generalized to include other algebras and hence other problems in science and mathematics. The result is a methodology that can be used to generalize an algebra to a calculus by relying on consistency with order theory to derive the laws of the calculus. My goals are to clear up the mysteries as to why the same basic structure found in probability theory appears in other contexts, to better understand the foundations of probability theory, and to extend these ideas to other areas by developing new mathematics and new physics. The relevance of this methodology will be demonstrated using examples from probability theory, number theory, geometry, information theory, and quantum mechanics.

Networks and games for precision medicine.

PubMed

Biane, Célia; Delaplace, Franck; Klaudel, Hanna

2016-12-01

Recent advances in omics technologies provide the leverage for the emergence of precision medicine that aims at personalizing therapy to patient. In this undertaking, computational methods play a central role for assisting physicians in their clinical decision-making by combining data analysis and systems biology modelling. Complex diseases such as cancer or diabetes arise from the intricate interplay of various biological molecules. Therefore, assessing drug efficiency requires to study the effects of elementary perturbations caused by diseases on relevant biological networks. In this paper, we propose a computational framework called Network-Action Game applied to best drug selection problem combining Game Theory and discrete models of dynamics (Boolean networks). Decision-making is modelled using Game Theory that defines the process of drug selection among alternative possibilities, while Boolean networks are used to model the effects of the interplay between disease and drugs actions on the patient's molecular system. The actions/strategies of disease and drugs are focused on arc alterations of the interactome. The efficiency of this framework has been evaluated for drug prediction on a model of breast cancer signalling. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

The logical primitives of thought: Empirical foundations for compositional cognitive models.

PubMed

Piantadosi, Steven T; Tenenbaum, Joshua B; Goodman, Noah D

2016-07-01

The notion of a compositional language of thought (LOT) has been central in computational accounts of cognition from earliest attempts (Boole, 1854; Fodor, 1975) to the present day (Feldman, 2000; Penn, Holyoak, & Povinelli, 2008; Fodor, 2008; Kemp, 2012; Goodman, Tenenbaum, & Gerstenberg, 2015). Recent modeling work shows how statistical inferences over compositionally structured hypothesis spaces might explain learning and development across a variety of domains. However, the primitive components of such representations are typically assumed a priori by modelers and theoreticians rather than determined empirically. We show how different sets of LOT primitives, embedded in a psychologically realistic approximate Bayesian inference framework, systematically predict distinct learning curves in rule-based concept learning experiments. We use this feature of LOT models to design a set of large-scale concept learning experiments that can determine the most likely primitives for psychological concepts involving Boolean connectives and quantification. Subjects' inferences are most consistent with a rich (nonminimal) set of Boolean operations, including first-order, but not second-order, quantification. Our results more generally show how specific LOT theories can be distinguished empirically. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

Deeper and sparser nets are optimal

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beiu, V.; Makaruk, H.E.

1998-03-01

The starting points of this paper are two size-optimal solutions: (1) one for implementing arbitrary Boolean functions (Home and Hush, 1994); and (2) another one for implementing certain sub-classes of Boolean functions (Red`kin, 1970). Because VLSI implementations do not cope well with highly interconnected nets--the area of a chip grows with the cube of the fan-in (Hammerstrom, 1988)--this paper will analyze the influence of limited fan-in on the size optimality for the two solutions mentioned. First, the authors will extend a result from Home and Hush (1994) valid for fan-in {Delta} = 2 to arbitrary fan-in. Second, they will provemore » that size-optimal solutions are obtained for small constant fan-in for both constructions, while relative minimum size solutions can be obtained for fan-ins strictly lower that linear. These results are in agreement with similar ones proving that for small constant fan-ins ({Delta} = 6...9) there exist VLSI-optimal (i.e., minimizing AT{sup 2}) solutions (Beiu, 1997a), while there are similar small constants relating to the capacity of processing information (Miller 1956).« less

Deeper sparsely nets are size-optimal

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beiu, V.; Makaruk, H.E.

1997-12-01

The starting points of this paper are two size-optimal solutions: (i) one for implementing arbitrary Boolean functions (Horne, 1994); and (ii) another one for implementing certain sub-classes of Boolean functions (Red`kin, 1970). Because VLSI implementations do not cope well with highly interconnected nets--the area of a chip grows with the cube of the fan-in (Hammerstrom, 1988)--this paper will analyze the influence of limited fan-in on the size optimality for the two solutions mentioned. First, the authors will extend a result from Horne and Hush (1994) valid for fan-in {Delta} = 2 to arbitrary fan-in. Second, they will prove that size-optimalmore » solutions are obtained for small constant fan-in for both constructions, while relative minimum size solutions can be obtained for fan-ins strictly lower than linear. These results are in agreement with similar ones proving that for small constant fan-ins ({Delta} = 6...9) there exist VLSI-optimal (i.e. minimizing AT{sup 2}) solutions (Beiu, 1997a), while there are similar small constants relating to the capacity of processing information (Miller 1956).« less

Stability Depends on Positive Autoregulation in Boolean Gene Regulatory Networks

PubMed Central

Pinho, Ricardo; Garcia, Victor; Irimia, Manuel; Feldman, Marcus W.

2014-01-01

Network motifs have been identified as building blocks of regulatory networks, including gene regulatory networks (GRNs). The most basic motif, autoregulation, has been associated with bistability (when positive) and with homeostasis and robustness to noise (when negative), but its general importance in network behavior is poorly understood. Moreover, how specific autoregulatory motifs are selected during evolution and how this relates to robustness is largely unknown. Here, we used a class of GRN models, Boolean networks, to investigate the relationship between autoregulation and network stability and robustness under various conditions. We ran evolutionary simulation experiments for different models of selection, including mutation and recombination. Each generation simulated the development of a population of organisms modeled by GRNs. We found that stability and robustness positively correlate with autoregulation; in all investigated scenarios, stable networks had mostly positive autoregulation. Assuming biological networks correspond to stable networks, these results suggest that biological networks should often be dominated by positive autoregulatory loops. This seems to be the case for most studied eukaryotic transcription factor networks, including those in yeast, flies and mammals. PMID:25375153

Utilization of Large Scale Surface Models for Detailed Visibility Analyses

NASA Astrophysics Data System (ADS)

Caha, J.; Kačmařík, M.

2017-11-01

This article demonstrates utilization of large scale surface models with small spatial resolution and high accuracy, acquired from Unmanned Aerial Vehicle scanning, for visibility analyses. The importance of large scale data for visibility analyses on the local scale, where the detail of the surface model is the most defining factor, is described. The focus is not only the classic Boolean visibility, that is usually determined within GIS, but also on so called extended viewsheds that aims to provide more information about visibility. The case study with examples of visibility analyses was performed on river Opava, near the Ostrava city (Czech Republic). The multiple Boolean viewshed analysis and global horizon viewshed were calculated to determine most prominent features and visibility barriers of the surface. Besides that, the extended viewshed showing angle difference above the local horizon, which describes angular height of the target area above the barrier, is shown. The case study proved that large scale models are appropriate data source for visibility analyses on local level. The discussion summarizes possible future applications and further development directions of visibility analyses.

A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks.

PubMed

Laomettachit, Teeraphan; Chen, Katherine C; Baumann, William T; Tyson, John J

2016-01-01

To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a "standard component" modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with "standard components" can capture in quantitative detail many essential properties of cell cycle control in budding yeast.

A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks

PubMed Central

Laomettachit, Teeraphan; Chen, Katherine C.; Baumann, William T.

2016-01-01

To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a “standard component” modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with “standard components” can capture in quantitative detail many essential properties of cell cycle control in budding yeast. PMID:27187804

Programmable bioelectronics in a stimuli-encoded 3D graphene interface

NASA Astrophysics Data System (ADS)

Parlak, Onur; Beyazit, Selim; Tse-Sum-Bui, Bernadette; Haupt, Karsten; Turner, Anthony P. F.; Tiwari, Ashutosh

2016-05-01

The ability to program and mimic the dynamic microenvironment of living organisms is a crucial step towards the engineering of advanced bioelectronics. Here, we report for the first time a design for programmable bioelectronics, with `built-in' switchable and tunable bio-catalytic performance that responds simultaneously to appropriate stimuli. The designed bio-electrodes comprise light and temperature responsive compartments, which allow the building of Boolean logic gates (i.e. ``OR'' and ``AND'') based on enzymatic communications to deliver logic operations.The ability to program and mimic the dynamic microenvironment of living organisms is a crucial step towards the engineering of advanced bioelectronics. Here, we report for the first time a design for programmable bioelectronics, with `built-in' switchable and tunable bio-catalytic performance that responds simultaneously to appropriate stimuli. The designed bio-electrodes comprise light and temperature responsive compartments, which allow the building of Boolean logic gates (i.e. ``OR'' and ``AND'') based on enzymatic communications to deliver logic operations. Electronic supplementary information (ESI) available. See DOI: 10.1039/c6nr02355j

Counting and classifying attractors in high dimensional dynamical systems.

PubMed

Bagley, R J; Glass, L

1996-12-07

Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors does not reveal the combinatorial structure of the attractors. These points are illustrated in a reexamination of dynamics in a class of random Boolean networks considered previously by Kauffman. We also consider comparisons between dynamics in discrete networks and continuous analogues. A continuous analogue of a discrete network may have a different number of attractors for many different reasons. Some attractors in discrete networks may be associated with unstable dynamics, and several different attractors in a discrete network may be associated with a single attractor in the continuous case. Special problems in determining attractors in continuous systems arise when there is aperiodic dynamics associated with quasiperiodicity of deterministic chaos.

Similar environments but diverse fates: Responses of budding yeast to nutrient deprivation

PubMed Central

Honigberg, Saul M.

2016-01-01

Diploid budding yeast (Saccharomyces cerevisiae) can adopt one of several alternative differentiation fates in response to nutrient limitation, and each of these fates provides distinct biological functions. When different strain backgrounds are taken into account, these various fates occur in response to similar environmental cues, are regulated by the same signal transduction pathways, and share many of the same master regulators. I propose that the relationships between fate choice, environmental cues and signaling pathways are not Boolean, but involve graded levels of signals, pathway activation and master-regulator activity. In the absence of large differences between environmental cues, small differences in the concentration of cues may be reinforced by cell-to-cell signals. These signals are particularly essential for fate determination within communities, such as colonies and biofilms, where fate choice varies dramatically from one region of the community to another. The lack of Boolean relationships between cues, signaling pathways, master regulators and cell fates may allow yeast communities to respond appropriately to the wide range of environments they encounter in nature. PMID:27917388

Mood and anxiety disorders as early manifestations of medical illness: a systematic review.

PubMed

Cosci, Fiammetta; Fava, Giovanni A; Sonino, Nicoletta

2015-01-01

Affective disturbances involving alterations of mood, anxiety and irritability may be early symptoms of medical illnesses. The aim of this paper was to provide a systematic review of the literature with qualitative data synthesis. MEDLINE, PsycINFO, EMBASE, Cochrane, and ISI Web of Science were systematically searched from inception to February 2014. Search terms were 'prodrome/early symptom', combined using the Boolean 'AND' operator with 'anxiety/depression/mania/hypomania/irritability/irritable mood/hostility', combined with the Boolean 'AND' operator with 'medical illness/medical disorder'. PRISMA guidelines were followed. A total of 21 studies met the inclusion criteria and were analyzed. Depression was found to be the most common affective prodrome of medical disorders and was consistently reported in Cushing's syndrome, hypothyroidism, hyperparathyroidism, pancreatic and lung cancer, myocardial infarction, Wilson's disease, and AIDS. Mania, anxiety and irritability were less frequent. Physicians may not pursue medical workup of cases that appear to be psychiatric in nature. They should be alerted that disturbances in mood, anxiety and irritability may antedate the appearance of a medical disorder.

Two Methods for Efficient Solution of the Hitting-Set Problem

NASA Technical Reports Server (NTRS)

Vatan, Farrokh; Fijany, Amir

2005-01-01

A paper addresses much of the same subject matter as that of Fast Algorithms for Model-Based Diagnosis (NPO-30582), which appears elsewhere in this issue of NASA Tech Briefs. However, in the paper, the emphasis is more on the hitting-set problem (also known as the transversal problem), which is well known among experts in combinatorics. The authors primary interest in the hitting-set problem lies in its connection to the diagnosis problem: it is a theorem of model-based diagnosis that in the set-theory representation of the components of a system, the minimal diagnoses of a system are the minimal hitting sets of the system. In the paper, the hitting-set problem (and, hence, the diagnosis problem) is translated from a combinatorial to a computational problem by mapping it onto the Boolean satisfiability and integer- programming problems. The paper goes on to describe developments nearly identical to those summarized in the cited companion NASA Tech Briefs article, including the utilization of Boolean-satisfiability and integer- programming techniques to reduce the computation time and/or memory needed to solve the hitting-set problem.

General method to find the attractors of discrete dynamic models of biological systems.

PubMed

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

General method to find the attractors of discrete dynamic models of biological systems

NASA Astrophysics Data System (ADS)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

BoolNet--an R package for generation, reconstruction and analysis of Boolean networks.

PubMed

Müssel, Christoph; Hopfensitz, Martin; Kestler, Hans A

2010-05-15

As the study of information processing in living cells moves from individual pathways to complex regulatory networks, mathematical models and simulation become indispensable tools for analyzing the complex behavior of such networks and can provide deep insights into the functioning of cells. The dynamics of gene expression, for example, can be modeled with Boolean networks (BNs). These are mathematical models of low complexity, but have the advantage of being able to capture essential properties of gene-regulatory networks. However, current implementations of BNs only focus on different sub-aspects of this model and do not allow for a seamless integration into existing preprocessing pipelines. BoolNet efficiently integrates methods for synchronous, asynchronous and probabilistic BNs. This includes reconstructing networks from time series, generating random networks, robustness analysis via perturbation, Markov chain simulations, and identification and visualization of attractors. The package BoolNet is freely available from the R project at http://cran.r-project.org/ or http://www.informatik.uni-ulm.de/ni/mitarbeiter/HKestler/boolnet/ under Artistic License 2.0. hans.kestler@uni-ulm.de Supplementary data are available at Bioinformatics online.

Color is processed less efficiently than orientation in change detection but more efficiently in visual search.

PubMed

Huang, Liqiang

2015-05-01

Basic visual features (e.g., color, orientation) are assumed to be processed in the same general way across different visual tasks. Here, a significant deviation from this assumption was predicted on the basis of the analysis of stimulus spatial structure, as characterized by the Boolean-map notion. If a task requires memorizing the orientations of a set of bars, then the map consisting of those bars can be readily used to hold the overall structure in memory and will thus be especially useful. If the task requires visual search for a target, then the map, which contains only an overall structure, will be of little use. Supporting these predictions, the present study demonstrated that in comparison to stimulus colors, bar orientations were processed more efficiently in change-detection tasks but less efficiently in visual search tasks (Cohen's d = 4.24). In addition to offering support for the role of the Boolean map in conscious access, the present work also throws doubts on the generality of processing visual features. © The Author(s) 2015.

Distributional assumptions in food and feed commodities- development of fit-for-purpose sampling protocols.

PubMed

Paoletti, Claudia; Esbensen, Kim H

2015-01-01

Material heterogeneity influences the effectiveness of sampling procedures. Most sampling guidelines used for assessment of food and/or feed commodities are based on classical statistical distribution requirements, the normal, binomial, and Poisson distributions-and almost universally rely on the assumption of randomness. However, this is unrealistic. The scientific food and feed community recognizes a strong preponderance of non random distribution within commodity lots, which should be a more realistic prerequisite for definition of effective sampling protocols. Nevertheless, these heterogeneity issues are overlooked as the prime focus is often placed only on financial, time, equipment, and personnel constraints instead of mandating acquisition of documented representative samples under realistic heterogeneity conditions. This study shows how the principles promulgated in the Theory of Sampling (TOS) and practically tested over 60 years provide an effective framework for dealing with the complete set of adverse aspects of both compositional and distributional heterogeneity (material sampling errors), as well as with the errors incurred by the sampling process itself. The results of an empirical European Union study on genetically modified soybean heterogeneity, Kernel Lot Distribution Assessment are summarized, as they have a strong bearing on the issue of proper sampling protocol development. TOS principles apply universally in the food and feed realm and must therefore be considered the only basis for development of valid sampling protocols free from distributional constraints.

Intelligent machines in the twenty-first century: foundations of inference and inquiry.

PubMed

Knuth, Kevin H

2003-12-15

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Can electronic search engines optimize screening of search results in systematic reviews: an empirical study.

PubMed

Sampson, Margaret; Barrowman, Nicholas J; Moher, David; Clifford, Tammy J; Platt, Robert W; Morrison, Andra; Klassen, Terry P; Zhang, Li

2006-02-24

Most electronic search efforts directed at identifying primary studies for inclusion in systematic reviews rely on the optimal Boolean search features of search interfaces such as DIALOG and Ovid. Our objective is to test the ability of an Ultraseek search engine to rank MEDLINE records of the included studies of Cochrane reviews within the top half of all the records retrieved by the Boolean MEDLINE search used by the reviewers. Collections were created using the MEDLINE bibliographic records of included and excluded studies listed in the review and all records retrieved by the MEDLINE search. Records were converted to individual HTML files. Collections of records were indexed and searched through a statistical search engine, Ultraseek, using review-specific search terms. Our data sources, systematic reviews published in the Cochrane library, were included if they reported using at least one phase of the Cochrane Highly Sensitive Search Strategy (HSSS), provided citations for both included and excluded studies and conducted a meta-analysis using a binary outcome measure. Reviews were selected if they yielded between 1000-6000 records when the MEDLINE search strategy was replicated. Nine Cochrane reviews were included. Included studies within the Cochrane reviews were found within the first 500 retrieved studies more often than would be expected by chance. Across all reviews, recall of included studies into the top 500 was 0.70. There was no statistically significant difference in ranking when comparing included studies with just the subset of excluded studies listed as excluded in the published review. The relevance ranking provided by the search engine was better than expected by chance and shows promise for the preliminary evaluation of large results from Boolean searches. A statistical search engine does not appear to be able to make fine discriminations concerning the relevance of bibliographic records that have been pre-screened by systematic reviewers.

Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.

PubMed

Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu

2009-07-01

The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.

Floral Morphogenesis: Stochastic Explorations of a Gene Network Epigenetic Landscape

PubMed Central

Aldana, Maximino; Benítez, Mariana; Cortes-Poza, Yuriria; Espinosa-Soto, Carlos; Hartasánchez, Diego A.; Lotto, R. Beau; Malkin, David; Escalera Santos, Gerardo J.; Padilla-Longoria, Pablo

2008-01-01

In contrast to the classical view of development as a preprogrammed and deterministic process, recent studies have demonstrated that stochastic perturbations of highly non-linear systems may underlie the emergence and stability of biological patterns. Herein, we address the question of whether noise contributes to the generation of the stereotypical temporal pattern in gene expression during flower development. We modeled the regulatory network of organ identity genes in the Arabidopsis thaliana flower as a stochastic system. This network has previously been shown to converge to ten fixed-point attractors, each with gene expression arrays that characterize inflorescence cells and primordial cells of sepals, petals, stamens, and carpels. The network used is binary, and the logical rules that govern its dynamics are grounded in experimental evidence. We introduced different levels of uncertainty in the updating rules of the network. Interestingly, for a level of noise of around 0.5–10%, the system exhibited a sequence of transitions among attractors that mimics the sequence of gene activation configurations observed in real flowers. We also implemented the gene regulatory network as a continuous system using the Glass model of differential equations, that can be considered as a first approximation of kinetic-reaction equations, but which are not necessarily equivalent to the Boolean model. Interestingly, the Glass dynamics recover a temporal sequence of attractors, that is qualitatively similar, although not identical, to that obtained using the Boolean model. Thus, time ordering in the emergence of cell-fate patterns is not an artifact of synchronous updating in the Boolean model. Therefore, our model provides a novel explanation for the emergence and robustness of the ubiquitous temporal pattern of floral organ specification. It also constitutes a new approach to understanding morphogenesis, providing predictions on the population dynamics of cells with different genetic configurations during development. PMID:18978941

Using Synchronous Boolean Networks to Model Several Phenomena of Collective Behavior

PubMed Central

Kochemazov, Stepan; Semenov, Alexander

2014-01-01

In this paper, we propose an approach for modeling and analysis of a number of phenomena of collective behavior. By collectives we mean multi-agent systems that transition from one state to another at discrete moments of time. The behavior of a member of a collective (agent) is called conforming if the opinion of this agent at current time moment conforms to the opinion of some other agents at the previous time moment. We presume that at each moment of time every agent makes a decision by choosing from the set (where 1-decision corresponds to action and 0-decision corresponds to inaction). In our approach we model collective behavior with synchronous Boolean networks. We presume that in a network there can be agents that act at every moment of time. Such agents are called instigators. Also there can be agents that never act. Such agents are called loyalists. Agents that are neither instigators nor loyalists are called simple agents. We study two combinatorial problems. The first problem is to find a disposition of instigators that in several time moments transforms a network from a state where the majority of simple agents are inactive to a state with the majority of active agents. The second problem is to find a disposition of loyalists that returns the network to a state with the majority of inactive agents. Similar problems are studied for networks in which simple agents demonstrate the contrary to conforming behavior that we call anticonforming. We obtained several theoretical results regarding the behavior of collectives of agents with conforming or anticonforming behavior. In computational experiments we solved the described problems for randomly generated networks with several hundred vertices. We reduced corresponding combinatorial problems to the Boolean satisfiability problem (SAT) and used modern SAT solvers to solve the instances obtained. PMID:25526612

Intelligent machines in the twenty-first century: foundations of inference and inquiry

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2003-01-01

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

IL-33 and soluble ST2 levels as novel predictors for remission and progression of carotid plaque in early rheumatoid arthritis: A prospective study.

PubMed

Shen, Jiayun; Shang, Qing; Wong, Chun-Kwok; Li, Edmund K; Wang, Shang; Li, Rui-Jie; Lee, Ka-Lai; Leung, Ying-Ying; Ying, King-Yee; Yim, Cheuk-Wan; Kun, Emily W; Leung, Moon-Ho; Li, Martin; Li, Tena K; Zhu, Tracy Y; Yu, Shui-Lian; Kuan, Woon-Pang; Yu, Cheuk-Man; Tam, Lai-Shan

2015-08-01

To study the association between the baseline IL-33 and soluble ST2 (sST2) levels with disease remission and progression of carotid atherosclerosis in early rheumatoid arthritis (ERA) patients. A total of 98 ERA patients were enrolled. Disease activity and the presence of carotid plaque were evaluated at baseline and 12 months later. Plasma IL-33 and sST2 levels were determined using enzyme-linked immunosorbent assay kits. Baseline IL-33 and sST2 levels were associated with inflammatory markers and cardiovascular (CV) risk factors. Overall, 44(45%), 18(18%), and 21(21%) patients achieved remission based on 28-joint disease activity score (DAS28), Boolean, and simplified disease activity score (SDAI) criteria at 12 months, respectively. Patients with detectable IL-33 at baseline were less likely to achieve DAS28 (P = 0.010) and SDAI remission (P = 0.021), while a lower baseline sST2 level was able to predict DAS28, Boolean, and SDAI remission (P = 0.005, 0.001, and <0.001, respectively). Using multivariate analysis, a lower baseline sST2 level independently predict Boolean (OR = 0.789; P = 0.005) and SDAI remission (0.812; P = 0.008). Regarding carotid atherosclerosis, 9/98(9.2%) patients had plaque progression at 12 months. Baseline IL-33 was detectable in 8/9(89%) and 42/83(51%) of patients with and without plaque progression respectively (P = 0.029). Baseline detectable IL-33 was an independent predictor for plaque progression after adjusting for traditional CV risk factors (P = 0.017). Lower baseline sST2 levels independently predict disease remission and baseline detectable IL-33 independently predicts carotid plaque progression in ERA patients. This study suggests that inflammation induced by the IL-33/ST2 axis may play a significant role in the development of cardiovascular disease in RA. Copyright © 2015 Elsevier Inc. All rights reserved.

Molecular insights into the heterogeneous crystal growth of si methane hydrate.

PubMed

Vatamanu, Jenel; Kusalik, Peter G

2006-08-17

In this paper we report a successful molecular simulation study exploring the heterogeneous crystal growth of sI methane hydrate along its [001] crystallographic face. The molecular modeling of the crystal growth of methane hydrate has proven in the past to be very challenging, and a reasonable framework to overcome the difficulties related to the simulation of such systems is presented. Both the microscopic mechanisms of heterogeneous crystal growth as well as interfacial properties of methane hydrate are probed. In the presence of the appropriate crystal template, a strong tendency for water molecules to organize into cages around methane at the growing interface is observed; the interface also demonstrates a strong affinity for methane molecules. The maximum growth rate measured for a hydrate crystal is about 4 times higher than the value previously determined for ice I in a similar framework (Gulam Razul, M. S.; Hendry, J. G.; Kusalik, P. G. J. Chem. Phys. 2005, 123, 204722).

Heterogeneous shear elasticity of glasses: the origin of the boson peak.

PubMed

Marruzzo, Alessia; Schirmacher, Walter; Fratalocchi, Andrea; Ruocco, Giancarlo

2013-01-01

The local elasticity of glasses is known to be inhomogeneous on a microscopic scale compared to that of crystalline materials. Their vibrational spectrum strongly deviates from that expected from Debye's elasticity theory: The density of states deviates from Debye's law, the sound velocity shows a negative dispersion in the boson-peak frequency regime and there is a strong increase of the sound attenuation near the boson-peak frequency. By comparing a mean-field theory of shear-elastic heterogeneity with a large-scale simulation of a soft-sphere glass we demonstrate that the observed anomalies in glasses are caused by elastic heterogeneity. By observing that the macroscopic bulk modulus is frequency independent we show that the boson-peak-related vibrational anomalies are predominantly due to the spatially fluctuating microscopic shear stresses. It is demonstrated that the boson-peak arises from the steep increase of the sound attenuation at a frequency which marks the transition from wave-like excitations to disorder-dominated ones.

Dynamic heterogeneities and non-Gaussian behavior in two-dimensional randomly confined colloidal fluids

NASA Astrophysics Data System (ADS)

Schnyder, Simon K.; Skinner, Thomas O. E.; Thorneywork, Alice L.; Aarts, Dirk G. A. L.; Horbach, Jürgen; Dullens, Roel P. A.

2017-03-01

A binary mixture of superparamagnetic colloidal particles is confined between glass plates such that the large particles become fixed and provide a two-dimensional disordered matrix for the still mobile small particles, which form a fluid. By varying fluid and matrix area fractions and tuning the interactions between the superparamagnetic particles via an external magnetic field, different regions of the state diagram are explored. The mobile particles exhibit delocalized dynamics at small matrix area fractions and localized motion at high matrix area fractions, and the localization transition is rounded by the soft interactions [T. O. E. Skinner et al., Phys. Rev. Lett. 111, 128301 (2013), 10.1103/PhysRevLett.111.128301]. Expanding on previous work, we find the dynamics of the tracers to be strongly heterogeneous and show that molecular dynamics simulations of an ideal gas confined in a fixed matrix exhibit similar behavior. The simulations show how these soft interactions make the dynamics more heterogeneous compared to the disordered Lorentz gas and lead to strong non-Gaussian fluctuations.

Synthesis of biodiesel from pongamia oil using heterogeneous ion-exchange resin catalyst.

PubMed

Jaya, N; Selvan, B Karpanai; Vennison, S John

2015-11-01

Biodiesel is a clean-burning renewable substitute fuel for petroleum. Biodiesel could be effectively produced by transesterification reaction of triglycerides of vegetable oils with short-chain alcohols in the presence of homogeneous or heterogeneous catalysts. Conventionally, biodiesel manufacturing processes employ strong acids or bases as catalysts. But, separation of the catalyst and the by-product glycerol from the product ester is too expensive to justify the product use as an automobile fuel. Hence heterogeneous catalysts are preferred. In this study, transesterification of pongamia oil with ethanol was performed using a solid ion-exchange resin catalyst. It is a macro porous strongly basic anion exchange resin. The process parameters affecting the ethyl ester yield were investigated. The reaction conditions were optimized for the maximum yield of fatty acid ethyl ester (FAEE) of pongamia oil. The properties of FAEE were compared with accepted standards of biodiesel. Engine performance was also studied with pongamia oil diesel blend and engine emission characteristics were observed. Copyright © 2015 Elsevier Inc. All rights reserved.

Compile-Time Schedulability Analysis of Communicating Concurrent Programs

DTIC Science & Technology

2006-06-28

synchronize via the read and write operations on the FIFO channels. These operations have been implemented with the help of semaphores , which...3 1.1.2 Synchronous Dataflow . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.1.3 Boolean Dataflow...described by concurrent programs . . . . . . . . . 4 1.3 A synchronous dataflow model, its topology matrix, and repetition vector . 10 1.4 Select and

Learning Boolean Networks in HepG2 cells using ToxCast High-Content Imaging Data (SOT annual meeting)

EPA Science Inventory

Cells adapt to their environment via homeostatic processes that are regulated by complex molecular networks. Our objective was to learn key elements of these networks in HepG2 cells using ToxCast High-content imaging (HCI) measurements taken over three time points (1, 24, and 72h...

A Model of Knowledge Based Information Retrieval with Hierarchical Concept Graph.

ERIC Educational Resources Information Center

Kim, Young Whan; Kim, Jin H.

1990-01-01

Proposes a model of knowledge-based information retrieval (KBIR) that is based on a hierarchical concept graph (HCG) which shows relationships between index terms and constitutes a hierarchical thesaurus as a knowledge base. Conceptual distance between a query and an object is discussed and the use of Boolean operators is described. (25…

The Local Minima Problem in Hierarchical Classes Analysis: An Evaluation of a Simulated Annealing Algorithm and Various Multistart Procedures

ERIC Educational Resources Information Center

Ceulemans, Eva; Van Mechelen, Iven; Leenen, Iwin

2007-01-01

Hierarchical classes models are quasi-order retaining Boolean decomposition models for N-way N-mode binary data. To fit these models to data, rationally started alternating least squares (or, equivalently, alternating least absolute deviations) algorithms have been proposed. Extensive simulation studies showed that these algorithms succeed quite…

Bringing Federal Documents to the Forefront for Library Users: Selective Cataloging Using an OPAC.

ERIC Educational Resources Information Center

Oliva, Victor T.

2000-01-01

Reviews the value of federal depository document titles and discuses reasons why many are worth cataloging. Several approaches to cataloging these titles to make them more readily accessible are profiled. The Adelphi University Library (New York) has devised a system, using Boolean logic and an online public access catalog to choose which titles…

Qualitative Comparative Analysis, Necessary Conditions, and Limited Diversity: Some Problematic Consequences of Schneider and Wagemann's Enhanced Standard Analysis

ERIC Educational Resources Information Center

Cooper, Barry; Glaesser, Judith

2016-01-01

We discuss a recent development in the set theoretic analysis of data sets characterized by limited diversity. Ragin, in developing his Qualitative Comparative Analysis (QCA), developed a standard analysis that produces parsimonious, intermediate, and complex Boolean solutions of truth tables. Schneider and Wagemann argue this standard analysis…

Crisp Sets and Boolean Algebra: A Research Strategy for Student Affairs

ERIC Educational Resources Information Center

Banning, James; Eversole, Barbara; Most, David; Kuk, Linda

2008-01-01

A review of student affairs journals clearly points out that most, if not all, research strategies within the field fall within traditional approaches based on quantitative methods and, more recently, qualitative methods. The purpose of this article is not to discourage use of these time honored research strategies, but to suggest the inclusion of…

Resource heterogeneity can facilitate cooperation.

PubMed

Kun, Ádám; Dieckmann, Ulf

2013-01-01

Although social structure is known to promote cooperation, by locally exposing selfish agents to their own deeds, studies to date assumed that all agents have access to the same level of resources. This is clearly unrealistic. Here we find that cooperation can be maintained when some agents have access to more resources than others. Cooperation can then emerge even in populations in which the temptation to defect is so strong that players would act fully selfishly if their resources were distributed uniformly. Resource heterogeneity can thus be crucial for the emergence and maintenance of cooperation. We also show that resource heterogeneity can hinder cooperation once the temptation to defect is significantly lowered. In all cases, the level of cooperation can be maximized by managing resource heterogeneity.

Scattering Properties of Heterogeneous Mineral Particles with Absorbing Inclusions

NASA Technical Reports Server (NTRS)

Dlugach, Janna M.; Mishchenko, Michael I.

2015-01-01

We analyze the results of numerically exact computer modeling of scattering and absorption properties of randomly oriented poly-disperse heterogeneous particles obtained by placing microscopic absorbing grains randomly on the surfaces of much larger spherical mineral hosts or by imbedding them randomly inside the hosts. These computations are paralleled by those for heterogeneous particles obtained by fully encapsulating fractal-like absorbing clusters in the mineral hosts. All computations are performed using the superposition T-matrix method. In the case of randomly distributed inclusions, the results are compared with the outcome of Lorenz-Mie computations for an external mixture of the mineral hosts and absorbing grains. We conclude that internal aggregation can affect strongly both the integral radiometric and differential scattering characteristics of the heterogeneous particle mixtures.

Random sphere packing model of heterogeneous propellants

NASA Astrophysics Data System (ADS)

Kochevets, Sergei Victorovich

It is well recognized that combustion of heterogeneous propellants is strongly dependent on the propellant morphology. Recent developments in computing systems make it possible to start three-dimensional modeling of heterogeneous propellant combustion. A key component of such large scale computations is a realistic model of industrial propellants which retains the true morphology---a goal never achieved before. The research presented develops the Random Sphere Packing Model of heterogeneous propellants and generates numerical samples of actual industrial propellants. This is done by developing a sphere packing algorithm which randomly packs a large number of spheres with a polydisperse size distribution within a rectangular domain. First, the packing code is developed, optimized for performance, and parallelized using the OpenMP shared memory architecture. Second, the morphology and packing fraction of two simple cases of unimodal and bimodal packs are investigated computationally and analytically. It is shown that both the Loose Random Packing and Dense Random Packing limits are not well defined and the growth rate of the spheres is identified as the key parameter controlling the efficiency of the packing. For a properly chosen growth rate, computational results are found to be in excellent agreement with experimental data. Third, two strategies are developed to define numerical samples of polydisperse heterogeneous propellants: the Deterministic Strategy and the Random Selection Strategy. Using these strategies, numerical samples of industrial propellants are generated. The packing fraction is investigated and it is shown that the experimental values of the packing fraction can be achieved computationally. It is strongly believed that this Random Sphere Packing Model of propellants is a major step forward in the realistic computational modeling of heterogeneous propellant of combustion. In addition, a method of analysis of the morphology of heterogeneous propellants is developed which uses the concept of multi-point correlation functions. A set of intrinsic length scales of local density fluctuations in random heterogeneous propellants is identified by performing a Monte-Carlo study of the correlation functions. This method of analysis shows great promise for understanding the origins of the combustion instability of heterogeneous propellants, and is believed to become a valuable tool for the development of safe and reliable rocket engines.

Length scales and pinning of interfaces

PubMed Central

Tan, Likun

2016-01-01

The pinning of interfaces and free discontinuities by defects and heterogeneities plays an important role in a variety of phenomena, including grain growth, martensitic phase transitions, ferroelectricity, dislocations and fracture. We explore the role of length scale on the pinning of interfaces and show that the width of the interface relative to the length scale of the heterogeneity can have a profound effect on the pinning behaviour, and ultimately on hysteresis. When the heterogeneity is large, the pinning is strong and can lead to stick–slip behaviour as predicted by various models in the literature. However, when the heterogeneity is small, we find that the interface may not be pinned in a significant manner. This shows that a potential route to making materials with low hysteresis is to introduce heterogeneities at a length scale that is small compared with the width of the phase boundary. Finally, the intermediate setting where the length scale of the heterogeneity is comparable to that of the interface width is characterized by complex interactions, thereby giving rise to a non-monotone relationship between the relative heterogeneity size and the critical depinning stress. PMID:27002068

Heterogeneity induces rhythms of weakly coupled circadian neurons

NASA Astrophysics Data System (ADS)

Gu, Changgui; Liang, Xiaoming; Yang, Huijie; Rohling, Jos H. T.

2016-02-01

The main clock located in the suprachiasmatic nucleus (SCN) regulates circadian rhythms in mammals. The SCN is composed of approximately twenty thousand heterogeneous self-oscillating neurons, that have intrinsic periods varying from 22 h to 28 h. They are coupled through neurotransmitters and neuropeptides to form a network and output a uniform periodic rhythm. Previous studies found that the heterogeneity of the neurons leads to attenuation of the circadian rhythm with strong cellular coupling. In the present study, we investigate the heterogeneity of the neurons and of the network in the condition of constant darkness. Interestingly, we found that the heterogeneity of weakly coupled neurons enables them to oscillate and strengthen the circadian rhythm. In addition, we found that the period of the SCN network increases with the increase of the degree of heterogeneity. As the network heterogeneity does not change the dynamics of the rhythm, our study shows that the heterogeneity of the neurons is vitally important for rhythm generation in weakly coupled systems, such as the SCN, and it provides a new method to strengthen the circadian rhythm, as well as an alternative explanation for differences in free running periods between species in the absence of the daily cycle.

Effects of incomplete mixing on reactive transport in flows through heterogeneous porous media

NASA Astrophysics Data System (ADS)

Wright, Elise E.; Richter, David H.; Bolster, Diogo

2017-11-01

The phenomenon of incomplete mixing reduces bulk effective reaction rates in reactive transport. Many existing models do not account for these effects, resulting in the overestimation of reaction rates in laboratory and field settings. To date, most studies on incomplete mixing have focused on diffusive systems; here, we extend these to explore the role that flow heterogeneity has on incomplete mixing. To do this, we examine reactive transport using a Lagrangian reactive particle tracking algorithm in two-dimensional idealized heterogeneous porous media. Contingent on the nondimensional Peclet and Damköhler numbers in the system, it was found that near well-mixed behavior could be observed at late times in the heterogeneous flow field simulations. We look at three common flow deformation metrics that describe the enhancement of mixing in the flow due to velocity gradients: the Okubo-Weiss parameter (θ ), the largest eigenvalue of the Cauchy-Green strain tensor (λC), and the finite-time Lyapunov exponent (Λ ). Strong mixing regions in the heterogeneous flow field identified by these metrics were found to correspond to regions with higher numbers of reactions, but the infrequency of these regions compared to the large numbers of reactions occurring elsewhere in the domain imply that these strong mixing regions are insufficient in explaining the observed near well-mixed behavior. Since it was found that reactive transport in these heterogeneous flows could overcome the effects of incomplete mixing, we also search for a closure for the mean concentration. The conservative quantity u2¯, where u =CA-CB , was found to predict the late time scaling of the mean concentration, i.e., Ci¯˜u2¯ .

Firing rate dynamics in recurrent spiking neural networks with intrinsic and network heterogeneity.

PubMed

Ly, Cheng

2015-12-01

Heterogeneity of neural attributes has recently gained a lot of attention and is increasing recognized as a crucial feature in neural processing. Despite its importance, this physiological feature has traditionally been neglected in theoretical studies of cortical neural networks. Thus, there is still a lot unknown about the consequences of cellular and circuit heterogeneity in spiking neural networks. In particular, combining network or synaptic heterogeneity and intrinsic heterogeneity has yet to be considered systematically despite the fact that both are known to exist and likely have significant roles in neural network dynamics. In a canonical recurrent spiking neural network model, we study how these two forms of heterogeneity lead to different distributions of excitatory firing rates. To analytically characterize how these types of heterogeneities affect the network, we employ a dimension reduction method that relies on a combination of Monte Carlo simulations and probability density function equations. We find that the relationship between intrinsic and network heterogeneity has a strong effect on the overall level of heterogeneity of the firing rates. Specifically, this relationship can lead to amplification or attenuation of firing rate heterogeneity, and these effects depend on whether the recurrent network is firing asynchronously or rhythmically firing. These observations are captured with the aforementioned reduction method, and furthermore simpler analytic descriptions based on this dimension reduction method are developed. The final analytic descriptions provide compact and descriptive formulas for how the relationship between intrinsic and network heterogeneity determines the firing rate heterogeneity dynamics in various settings.

Efficacy of Thickened Liquids for Eliminating Aspiration in Head and Neck Cancer: A Systematic Review

PubMed Central

Barbon, Carly E.A.; Steele, Catriona M.

2015-01-01

Objective To appraise the current videofluoroscopic evidence on the reduction of aspiration using thickened liquids in the head and neck cancer population. Data Sources Search terms relating to deglutition or dysphagia or swallow and neoplasms and oncology or head and neck cancer and viscosity or texture and apira or residu* were combined with honey or nectar, xerostomia, respiratory aspiration using Boolean operators. Review Methods A multi-engine literature search identified 337 non-duplicate articles of which 6 were judged to be relevant. These underwent detailed review for study quality and qualitative synthesis. Results The articles reviewed in detail predominantly described heterogeneous study samples with small sample sizes, making for difficult interpretation and generalization of results. Rates of aspiration were typically not reported by bolus consistency, despite the fact that a variety of stimulus consistencies was used during VFSS. Studies confirmed that aspiration is a major concern in the head and neck cancer population and reported a trend towards more frequent aspiration post-(chemo)radiotherapy. Conclusion Overall, the literature on thickened liquids as an intervention to eliminate aspiration in the head and neck cancer population is limited. Because aspiration is known to be prevalent in the head and neck cancer population and thickened liquids are known to eliminate aspiration in other populations, it is important to determine the effectiveness of thickened liquids for reducing aspiration in the head and neck cancer population. PMID:25358345

Communication: Heterogeneous water dynamics on a clathrate hydrate lattice detected by multidimensional oxygen nuclear magnetic resonance

NASA Astrophysics Data System (ADS)

Adjei-Acheamfour, Mischa; Storek, Michael; Böhmer, Roland

2017-05-01

Previous deuteron nuclear magnetic resonance studies revealed conflicting evidence regarding the possible motional heterogeneity of the water dynamics on the hydrate lattice of an ice-like crystal. Using oxygen-17 nuclei as a sensitive quadrupolar probe, the reorientational two-time correlation function displays a clear nonexponentiality. To check whether this dispersive behavior is a consequence of dynamic heterogeneity or rather of an intrinsic nonexponentiality, a multidimensional, four-time magnetic resonance experiment was devised that is generally applicable to strongly quadrupolarly perturbed half-integer nuclei such as oxygen-17. Measurements of an appropriate four-time function demonstrate that it is possible to select a subensemble of slow water molecules. Its mean time scale is compared to theoretical predictions and evidence for significant motional heterogeneity is found.

Verification of VLSI designs

NASA Technical Reports Server (NTRS)

Windley, P. J.

1991-01-01

In this paper we explore the specification and verification of VLSI designs. The paper focuses on abstract specification and verification of functionality using mathematical logic as opposed to low-level boolean equivalence verification such as that done using BDD's and Model Checking. Specification and verification, sometimes called formal methods, is one tool for increasing computer dependability in the face of an exponentially increasing testing effort.

An Analysis of Cryptographically Significant Boolean Functions With High Correlation Immunity by Reconfigurable Computer

DTIC Science & Technology

2010-12-01

with high correlation immunity and then evaluate these functions for other desirable cryptographic features. C. METHOD The only known primary methods...out if not used) # ---------------------------------- # PRIMARY = < primary file 1> < primary file 2> #SECONDARY = <secondary file 1...finding the fuction value for a //set u and for each value of v. end end

Sequential, progressive, equal-power, reflective beam-splitter arrays

NASA Astrophysics Data System (ADS)

Manhart, Paul K.

2017-11-01

The equations to calculate equal-power reflectivity of a sequential series of beam splitters is presented. Non-sequential optical design examples are offered for uniform illumination using diode lasers. Objects created using Boolean operators and Swept Surfaces can create objects capable of reflecting light into predefined elevation and azimuth angles. Analysis of the illumination patterns for the array are also presented.

Study of Strategies Used in Online Searching: 2. Positional Logic--an Example of the Importance of Selecting the Right Boolean Operator.

ERIC Educational Resources Information Center

Oldroyd, Betty K.; Schroder, J. J.

1982-01-01

Reviews the advantages and disadvantages of different types of term combination using the positional logic capability of online information retrieval systems and describes a study in which searches for material on "microwave integrated circuits" were conducted in order to find the most economical way of generating the most relevant…

Developing and Testing an Online Tool for Teaching GIS Concepts Applied to Spatial Decision-Making

ERIC Educational Resources Information Center

Carver, Steve; Evans, Andy; Kingston, Richard

2004-01-01

The development and testing of a Web-based GIS e-learning resource is described. This focuses on the application of GIS for siting a nuclear waste disposal facility and the associated principles of spatial decision-making using Boolean and weighted overlay methods. Initial student experiences in using the system are analysed as part of a research…

An Investigation of the Mathematical Models of Piaget's Psychological Theory of Cognitive Learning. Final Report.

ERIC Educational Resources Information Center

Kalechofsky, Robert

This research paper proposes several mathematical models which help clarify Piaget's theory of cognition on the concrete and formal operational stages. Some modified lattice models were used for the concrete stage and a combined Boolean Algebra and group theory model was used for the formal stage. The researcher used experiments cited in the…

Recent development and biomedical applications of probabilistic Boolean networks

PubMed Central

2013-01-01

Probabilistic Boolean network (PBN) modelling is a semi-quantitative approach widely used for the study of the topology and dynamic aspects of biological systems. The combined use of rule-based representation and probability makes PBN appealing for large-scale modelling of biological networks where degrees of uncertainty need to be considered. A considerable expansion of our knowledge in the field of theoretical research on PBN can be observed over the past few years, with a focus on network inference, network intervention and control. With respect to areas of applications, PBN is mainly used for the study of gene regulatory networks though with an increasing emergence in signal transduction, metabolic, and also physiological networks. At the same time, a number of computational tools, facilitating the modelling and analysis of PBNs, are continuously developed. A concise yet comprehensive review of the state-of-the-art on PBN modelling is offered in this article, including a comparative discussion on PBN versus similar models with respect to concepts and biomedical applications. Due to their many advantages, we consider PBN to stand as a suitable modelling framework for the description and analysis of complex biological systems, ranging from molecular to physiological levels. PMID:23815817

Construction of a fuzzy and Boolean logic gates based on DNA.

PubMed

Zadegan, Reza M; Jepsen, Mette D E; Hildebrandt, Lasse L; Birkedal, Victoria; Kjems, Jørgen

2015-04-17

Logic gates are devices that can perform logical operations by transforming a set of inputs into a predictable single detectable output. The hybridization properties, structure, and function of nucleic acids can be used to make DNA-based logic gates. These devices are important modules in molecular computing and biosensing. The ideal logic gate system should provide a wide selection of logical operations, and be integrable in multiple copies into more complex structures. Here we show the successful construction of a small DNA-based logic gate complex that produces fluorescent outputs corresponding to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Phased-mission system analysis using Boolean algebraic methods

NASA Technical Reports Server (NTRS)

Somani, Arun K.; Trivedi, Kishor S.

1993-01-01

Most reliability analysis techniques and tools assume that a system is used for a mission consisting of a single phase. However, multiple phases are natural in many missions. The failure rates of components, system configuration, and success criteria may vary from phase to phase. In addition, the duration of a phase may be deterministic or random. Recently, several researchers have addressed the problem of reliability analysis of such systems using a variety of methods. A new technique for phased-mission system reliability analysis based on Boolean algebraic methods is described. Our technique is computationally efficient and is applicable to a large class of systems for which the failure criterion in each phase can be expressed as a fault tree (or an equivalent representation). Our technique avoids state space explosion that commonly plague Markov chain-based analysis. A phase algebra to account for the effects of variable configurations and success criteria from phase to phase was developed. Our technique yields exact (as opposed to approximate) results. The use of our technique was demonstrated by means of an example and present numerical results to show the effects of mission phases on the system reliability.

An alternative data filling approach for prediction of missing data in soft sets (ADFIS).

PubMed

Sadiq Khan, Muhammad; Al-Garadi, Mohammed Ali; Wahab, Ainuddin Wahid Abdul; Herawan, Tutut

2016-01-01

Soft set theory is a mathematical approach that provides solution for dealing with uncertain data. As a standard soft set, it can be represented as a Boolean-valued information system, and hence it has been used in hundreds of useful applications. Meanwhile, these applications become worthless if the Boolean information system contains missing data due to error, security or mishandling. Few researches exist that focused on handling partially incomplete soft set and none of them has high accuracy rate in prediction performance of handling missing data. It is shown that the data filling approach for incomplete soft set (DFIS) has the best performance among all previous approaches. However, in reviewing DFIS, accuracy is still its main problem. In this paper, we propose an alternative data filling approach for prediction of missing data in soft sets, namely ADFIS. The novelty of ADFIS is that, unlike the previous approach that used probability, we focus more on reliability of association among parameters in soft set. Experimental results on small, 04 UCI benchmark data and causality workbench lung cancer (LUCAP2) data shows that ADFIS performs better accuracy as compared to DFIS.

3D GIS spatial operation based on extended Euler operators

NASA Astrophysics Data System (ADS)

Xu, Hongbo; Lu, Guonian; Sheng, Yehua; Zhou, Liangchen; Guo, Fei; Shang, Zuoyan; Wang, Jing

2008-10-01

The implementation of 3 dimensions spatial operations, based on certain data structure, has a lack of universality and is not able to treat with non-manifold cases, at present. ISO/DIS 19107 standard just presents the definition of Boolean operators and set operators for topological relationship query, and OGC GeoXACML gives formal definitions for several set functions without implementation detail. Aiming at these problems, based mathematical foundation on cell complex theory, supported by non-manifold data structure and using relevant research in the field of non-manifold geometry modeling for reference, firstly, this paper according to non-manifold Euler-Poincaré formula constructs 6 extended Euler operators and inverse operators to carry out creating, updating and deleting 3D spatial elements, as well as several pairs of supplementary Euler operators to convenient for implementing advanced functions. Secondly, we change topological element operation sequence of Boolean operation and set operation as well as set functions defined in GeoXACML into combination of extended Euler operators, which separates the upper functions and lower data structure. Lastly, we develop underground 3D GIS prototype system, in which practicability and credibility of extended Euler operators faced to 3D GIS presented by this paper are validated.

Current-induced modulation of backward spin-waves in metallic microstructures

NASA Astrophysics Data System (ADS)

Sato, Nana; Lee, Seo-Won; Lee, Kyung-Jin; Sekiguchi, Koji

2017-03-01

We performed a propagating spin-wave spectroscopy for backward spin-waves in ferromagnetic metallic microstructures in the presence of electric-current. Even with the smaller current injection of 5× {{10}10} A m-2 into ferromagnetic microwires, the backward spin-waves exhibit a gigantic 200 MHz frequency shift and a 15% amplitude change, showing 60 times larger modulation compared to previous reports. Systematic experiments by measuring dependences on a film thickness of mirowire, on the wave-vector of spin-wave, and on the magnitude of bias field, we revealed that for the backward spin-waves a distribution of internal magnetic field generated by electric-current efficiently modulates the frequency and amplitude of spin-waves. The gigantic frequency and amplitude changes were reproduced by a micromagnetics simulation, predicting that the current-injection of 5× {{10}11} A m-2 allows 3 GHz frequency shift. The effective coupling between electric-current and backward spin-waves has a potential to build up a logic control method which encodes signals into the phase and amplitude of spin-waves. The metallic magnonics cooperating with electronics could suggest highly integrated magnonic circuits both in Boolean and non-Boolean principles.

Full-waveform Inversion of Crosshole GPR Data Collected in Strongly Heterogeneous Chalk: Challenges and Pitfalls

NASA Astrophysics Data System (ADS)

Keskinen, Johanna; Looms, Majken C.; Nielsen, Lars; Klotzsche, Anja; van der Kruk, Jan; Moreau, Julien; Stemmerik, Lars; Holliger, Klaus

2015-04-01

Chalk is an important reservoir rock for hydrocarbons and for groundwater resources for many major cities. Therefore, this rock type has been extensively investigated using both geological and geophysical methods. Many applications of crosshole GPR tomography rely on the ray approximation and corresponding inversions of first break traveltimes and/or maximum first-cycle amplitudes. Due to the inherent limitations associated with such approaches, the resulting models tend to be overly smooth and cannot adequately capture the small-scale heterogeneities. In contrast, the full-waveform inversion uses all the information contained in the data and is able to provide significantly improved images. Here, we apply full-waveform inversion to crosshole GPR data to image strong heterogeneity of the chalk related to changes in lithology and porosity. We have collected a crosshole tomography dataset in an old chalk quarry in Eastern Denmark. Based on core data (including plug samples and televiewer logging data) collected in our four ~15-m-deep boreholes and results from previous related studies, it is apparent that the studied chalk is strongly heterogeneous. The upper ~7 m consist of variable coarse-grained chalk layers with numerous flint nodules. The lower half of the studied section appears to be finer-grained and contains less flint. However, still significant porosity variations are also detected in the lower half. In general, the water-saturated (watertable depth ~2 m) chalk is characterized by high porosities, and thus low velocities and high attenuation, while the flint is essentially non-porous and has correspondingly high velocities and low attenuation. Together these characteristics form a strongly heterogeneous medium, which is challenging for the full-waveform inversion to recover. Here, we address the importance of (i) adequate starting models, both in terms of the dielectric permittivity and the electrical conductivity, (ii) the estimation of the source wavelet, (iii) and the effects of data sampling density when imaging this rock type. Moreover, we discuss the resolution of the bedding recovered by the full-waveform approach. Our results show that with proper estimates of the above-mentioned prior parameters, crosshole GPR full-waveform tomography provides high-resolution images capturing a high degree of variability that standard methods cannot resolve in chalk. This in turn makes crosshole full-waveform inversion a promising tool to support time-lapse flow modelling.

Individual heterogeneity and identifiability in capture-recapture models

USGS Publications Warehouse

Link, W.A.

2004-01-01

Individual heterogeneity in detection probabilities is a far more serious problem for capture-recapture modeling than has previously been recognized. In this note, I illustrate that population size is not an identifiable parameter under the general closed population mark-recapture model Mh. The problem of identifiability is obvious if the population includes individuals with pi = 0, but persists even when it is assumed that individual detection probabilities are bounded away from zero. Identifiability may be attained within parametric families of distributions for pi, but not among parametric families of distributions. Consequently, in the presence of individual heterogeneity in detection probability, capture-recapture analysis is strongly model dependent.

Genetic Advances in Autism: Heterogeneity and Convergence on Shared Pathways

PubMed Central

Bill, Brent R.; Geschwind, Daniel H.

2009-01-01

The autism spectrum disorders (ASD) are a heterogeneous set of developmental disorders characterized at their core by deficits in social interaction and communication. Current psychiatric nosology groups this broad set of disorders with strong genetic liability and multiple etiologies into the same diagnostic category. This heterogeneity has challenged genetic analyses. But shared patient resources, genomic technologies, more refined phenotypes, and novel computational approaches have begun to yield dividends in defining the genetic mechanisms at work. Over the last five years, a large number of autism susceptibility loci have emerged, redefining our notion of autism’s etiologies, and reframing how we think about ASD. PMID:19477629

Solute transport with time-variable flow paths during upward and downward flux in a heterogeneous unsaturated porous medium

NASA Astrophysics Data System (ADS)

Cremer, Clemens; Neuweiler, Insa; Bechtold, Michel; Vanderborght, Jan

2014-05-01

To acquire knowledge of solute transport through the unsaturated zone in the shallow subsurface is decisive to assess groundwater quality, nutrient cycling or to plan remediation strategies. The shallow subsurface is characterized by structural heterogeneity and strongly influenced by atmospheric conditions. This leads to changing flow directions, strong temporal changes in saturation and heterogeneous water fluxes during infiltration and evaporation events. Recent studies (e.g. Lehmann and Or, 2009; Bechtold et al.,2011) demonstrated the importance of lateral flow and solute transport during evaporation conditions (upward flux). The heterogeneous structure in these studies was constructed using two types of sand with strong material contrasts and arranged in parallel with a vertical orientation. Lateral transport and redistribution of solute from coarse to fine media was observed deeper in the soil column and from fine to coarse close to the soil surface. However, if boundary conditions are reversed due to precipitation, the flow field is not necessarily reversed in the same manner, resulting in entirely different transport patterns for downward and upward flow. Therefore, considering net-flow rates alone is misleading when describing transport under those conditions. In this contribution we analyze transport of a solute in the shallow subsurface to assess effects resulting from the temporal change of heterogeneous soil structures due to dynamic flow conditions. Two-dimensional numerical simulations of unsaturated flow and transport are conducted using a coupled finite volume and random walk particle tracking algorithm to quantify solute transport and leaching rates. Following previous studies (Lehmann and Or, 2009; Bechtold et al., 2011), the chosen domain is composed of two materials, coarse and fine sand, arranged in parallel with a vertical orientation. Hence, one sharp interface of strong material heterogeneity is induced. During evaporation both sands are assumed to stay under liquid-flow dominated evaporation conditions ("stage 1"). Simulations considering dynamic (infiltration-evaporation) and steady (solely infiltration) boundary conditions are carried out. The influence of dynamic boundary conditions (intensity and duration of precipitation and evaporation events) is examined in a multitude of simulations. If flow rates smaller than the saturated hydraulic conductivity of both materials are chosen to be applied as boundary condition, simulation results indicate that the flow field within the domain is exactly reversed. However, if applied flow rates exceed the saturated hydraulic conductivity of one material, the flow field is not just reversed, but different flow paths during downward and upward flow are observed. Results show the tendency of faster solute leaching under dynamic boundary conditions compared to steady infiltration conditions with the same net-infiltration rate. We use a double domain transport method as an upscaled model to reproduce vertically averaged concentration profiles with net flux only and compare the model parameters for information about flow dynamics and soil heterogeneity.

Effects of Algal Diversity on the Production of Biomass in Homogeneous and Heterogeneous Nutrient Environments: A Microcosm Experiment

PubMed Central

Weis, Jerome J.; Madrigal, Daniel S.; Cardinale, Bradley J.

2008-01-01

Background One of the most common questions addressed by ecologists over the past decade has been-how does species richness impact the production of community biomass? Recent summaries of experiments have shown that species richness tends to enhance the production of biomass across a wide range of trophic groups and ecosystems; however, the biomass of diverse polycultures only rarely exceeds that of the single most productive species in a community (a phenomenon called ‘transgressive overyielding’). Some have hypothesized that the lack of transgressive overyielding is because experiments have generally been performed in overly-simplified, homogeneous environments where species have little opportunity to express the niche differences that lead to ‘complementary’ use of resources that can enhance biomass production. We tested this hypothesis in a laboratory experiment where we manipulated the richness of freshwater algae in homogeneous and heterogeneous nutrient environments. Methodology/Principal Findings Experimental units were comprised of patches containing either homogeneous nutrient ratios (16∶1 nitrogen to phosphorus (N∶P) in all patches) or heterogeneous nutrient ratios (ranging from 4∶1 to 64∶1 N∶P across patches). After allowing 6–10 generations of algal growth, we found that algal species richness had similar impacts on biomass production in both homo- and heterogeneous environments. Although four of the five algal species showed a strong response to nutrient heterogeneity, a single species dominated algal communities in both types of environments. As a result, a ‘selection effect’–where diversity maximizes the chance that a competitively superior species will be included in, and dominate the biomass of a community–was the primary mechanism by which richness influenced biomass in both homo- and heterogeneous environments. Conclusions/Significance Our study suggests that spatial heterogeneity, by itself, is not sufficient to generate strong effects of biodiversity on productivity. Rather, heterogeneity must be coupled with variation in the relative fitness of species across patches in order for spatial niche differentiation to generate complementary resource use. PMID:18665221

Ad Hoc Information Extraction for Clinical Data Warehouses.

PubMed

Dietrich, Georg; Krebs, Jonathan; Fette, Georg; Ertl, Maximilian; Kaspar, Mathias; Störk, Stefan; Puppe, Frank

2018-05-01

Clinical Data Warehouses (CDW) reuse Electronic health records (EHR) to make their data retrievable for research purposes or patient recruitment for clinical trials. However, much information are hidden in unstructured data like discharge letters. They can be preprocessed and converted to structured data via information extraction (IE), which is unfortunately a laborious task and therefore usually not available for most of the text data in CDW. The goal of our work is to provide an ad hoc IE service that allows users to query text data ad hoc in a manner similar to querying structured data in a CDW. While search engines just return text snippets, our systems also returns frequencies (e.g. how many patients exist with "heart failure" including textual synonyms or how many patients have an LVEF < 45) based on the content of discharge letters or textual reports for special investigations like heart echo. Three subtasks are addressed: (1) To recognize and to exclude negations and their scopes, (2) to extract concepts, i.e. Boolean values and (3) to extract numerical values. We implemented an extended version of the NegEx-algorithm for German texts that detects negations and determines their scope. Furthermore, our document oriented CDW PaDaWaN was extended with query functions, e.g. context sensitive queries and regex queries, and an extraction mode for computing the frequencies for Boolean and numerical values. Evaluations in chest X-ray reports and in discharge letters showed high F1-scores for the three subtasks: Detection of negated concepts in chest X-ray reports with an F1-score of 0.99 and in discharge letters with 0.97; of Boolean values in chest X-ray reports about 0.99, and of numerical values in chest X-ray reports and discharge letters also around 0.99 with the exception of the concept age. The advantages of an ad hoc IE over a standard IE are the low development effort (just entering the concept with its variants), the promptness of the results and the adaptability by the user to his or her particular question. Disadvantage are usually lower accuracy and confidence.This ad hoc information extraction approach is novel and exceeds existing systems: Roogle [1] extracts predefined concepts from texts at preprocessing and makes them retrievable at runtime. Dr. Warehouse [2] applies negation detection and indexes the produced subtexts which include affirmed findings. Our approach combines negation detection and the extraction of concepts. But the extraction does not take place during preprocessing, but at runtime. That provides an ad hoc, dynamic, interactive and adjustable information extraction of random concepts and even their values on the fly at runtime. We developed an ad hoc information extraction query feature for Boolean and numerical values within a CDW with high recall and precision based on a pipeline that detects and removes negations and their scope in clinical texts. Schattauer GmbH.

Strong SH-to-Love wave scattering off the Southern California Continental Borderland

USGS Publications Warehouse

Yu, Chunquan; Zhan, Zhongwen; Hauksson, Egill; Cochran, Elizabeth S.

2017-01-01

Seismic scattering is commonly observed and results from wave propagation in heterogeneous medium. Yet, deterministic characterization of scatterers associated with lateral heterogeneities remains challenging. In this study, we analyze broadband waveforms recorded by the Southern California Seismic Network and observe strongly scattered Love waves following the arrival of teleseismic SH wave. These scattered Love waves travel approximately in the same (azimuthal) direction as the incident SH wave at a dominant period of ~10 s but at an apparent velocity of ~3.6 km/s as compared to the ~11 km/s for the SH wave. Back-projection suggests that this strong scattering is associated with pronounced bathymetric relief in the Southern California Continental Borderland, in particular the Patton Escarpment. Finite-difference simulations using a simplified 2-D bathymetric and crustal model are able to predict the arrival times and amplitudes of major scatterers. The modeling suggests a relatively low shear wave velocity in the Continental Borderland.

Games and Diabetes: A Review Investigating Theoretical Frameworks, Evaluation Methodologies, and Opportunities for Design Grounded in Learning Theories.

PubMed

Lazem, Shaimaa; Webster, Mary; Holmes, Wayne; Wolf, Motje

2015-09-02

Here we review 18 articles that describe the design and evaluation of 1 or more games for diabetes from technical, methodological, and theoretical perspectives. We undertook searches covering the period 2010 to May 2015 in the ACM, IEEE, Journal of Medical Internet Research, Studies in Health Technology and Informatics, and Google Scholar online databases using the keywords "children," "computer games," "diabetes," "games," "type 1," and "type 2" in various Boolean combinations. The review sets out to establish, for future research, an understanding of the current landscape of digital games designed for children with diabetes. We briefly explored the use and impact of well-established learning theories in such games. The most frequently mentioned theoretical frameworks were social cognitive theory and social constructivism. Due to the limitations of the reported evaluation methodologies, little evidence was found to support the strong promise of games for diabetes. Furthermore, we could not establish a relation between design features and the game outcomes. We argue that an in-depth discussion about the extent to which learning theories could and should be manifested in the design decisions is required. © 2015 Diabetes Technology Society.

Games and Diabetes

PubMed Central

Lazem, Shaimaa; Webster, Mary; Holmes, Wayne; Wolf, Motje

2015-01-01

Here we review 18 articles that describe the design and evaluation of 1 or more games for diabetes from technical, methodological, and theoretical perspectives. We undertook searches covering the period 2010 to May 2015 in the ACM, IEEE, Journal of Medical Internet Research, Studies in Health Technology and Informatics, and Google Scholar online databases using the keywords “children,” “computer games,” “diabetes,” “games,” “type 1,” and “type 2” in various Boolean combinations. The review sets out to establish, for future research, an understanding of the current landscape of digital games designed for children with diabetes. We briefly explored the use and impact of well-established learning theories in such games. The most frequently mentioned theoretical frameworks were social cognitive theory and social constructivism. Due to the limitations of the reported evaluation methodologies, little evidence was found to support the strong promise of games for diabetes. Furthermore, we could not establish a relation between design features and the game outcomes. We argue that an in-depth discussion about the extent to which learning theories could and should be manifested in the design decisions is required. PMID:26337753

Individual heterogeneity in reproductive rates and cost of reproduction in a long-lived vertebrate

PubMed Central

Chambert, Thierry; Rotella, Jay J; Higgs, Megan D; Garrott, Robert A

2013-01-01

Individual variation in reproductive success is a key feature of evolution, but also has important implications for predicting population responses to variable environments. Although such individual variation in reproductive outcomes has been reported in numerous studies, most analyses to date have not considered whether these realized differences were due to latent individual heterogeneity in reproduction or merely random chance causing different outcomes among like individuals. Furthermore, latent heterogeneity in fitness components might be expressed differently in contrasted environmental conditions, an issue that has only rarely been investigated. Here, we assessed (i) the potential existence of latent individual heterogeneity and (ii) the nature of its expression (fixed vs. variable) in a population of female Weddell seals (Leptonychotes weddellii), using a hierarchical modeling approach on a 30-year mark–recapture data set consisting of 954 individual encounter histories. We found strong support for the existence of latent individual heterogeneity in the population, with “robust” individuals expected to produce twice as many pups as “frail” individuals. Moreover, the expression of individual heterogeneity appeared consistent, with only mild evidence that it might be amplified when environmental conditions are severe. Finally, the explicit modeling of individual heterogeneity allowed us to detect a substantial cost of reproduction that was not evidenced when the heterogeneity was ignored. PMID:23919151

Recharge heterogeneity and high intensity rainfall events increase contamination risk for Mediterranean groundwater resources

NASA Astrophysics Data System (ADS)

Hartmann, Andreas; Jasechko, Scott; Gleeson, Tom; Wada, Yoshihide; Andreo, Bartolomé; Barberá, Juan Antonio; Brielmann, Heike; Charlier, Jean-Baptiste; Darling, George; Filippini, Maria; Garvelmann, Jakob; Goldscheider, Nico; Kralik, Martin; Kunstmann, Harald; Ladouche, Bernard; Lange, Jens; Mudarra, Matías; Francisco Martín, José; Rimmer, Alon; Sanchez, Damián; Stumpp, Christine; Wagener, Thorsten

2017-04-01

Karst develops through the dissolution of carbonate rock and results in pronounced spatiotemporal heterogeneity of hydrological processes. Karst groundwater in Europe is a major source of fresh water contributing up to half of the total drinking water supply in some countries like Austria or Slovenia. Previous work showed that karstic recharge processes enhance and alter the sensitivity of recharge to climate variability. The enhanced preferential flow from the surface to the aquifer may be followed by enhanced risk of groundwater contamination. In this study we assess the contamination risk of karst aquifers over Europe and the Mediterranean using simulated transit time distributions. Using a new type of semi-distributed model that considers the spatial heterogeneity of karst hydraulic properties, we were able to simulate karstic groundwater recharge including its heterogeneous spatiotemporal dynamics. The model is driven by gridded daily climate data from the Global Land Data Assimilation System (GLDAS). Transit time distributions are calculated using virtual tracer experiments. We evaluated our simulations by independent information on transit times derived from observed time series of water isotopes of >70 karst springs over Europe. The simulations indicate that, compared to humid, mountain and desert regions, the Mediterranean region shows a stronger risk of contamination in Europe because preferential flow processes are most pronounced given thin soil layers and the seasonal abundance of high intensity rainfall events in autumn and winter. Our modelling approach includes strong simplifications and its results cannot easily be generalized but it still highlights that the combined effects of variable climate and heterogeneous catchment properties constitute a strong risk on water quality.

Can we model solute transfer in heterogeneous soils with MIM model?

NASA Astrophysics Data System (ADS)

Ben Slimene, Erij; Lassabatere, Laurent; Winiarski, Thierry; Gourdon, Remy

2017-04-01

The fate of pollutants in the vadose zone must be understood, in particular, underneath infiltration basins for an optimum management of these plants. Stormwaters carry pollutants (heavy metals, organics, emerging pollutant like nanoparticles, etc.) and thus constitute a risk for groundwater and soil quality. Most infiltration basins are settled over highly permeable soils that exhibit a strong lithological heterogeneity. The impact of such lithological heterogeneity on flow and solute transfer has already been questioned. Previous studies have already proved that lithological heterogeneity was prone to the establishment of preferential flows. In more details, the concomitance of several materials with contrasting hydraulic properties induces funneled flow at the interfaces between less permeable and more permeable lithofacies. Solutes are then carried by water fluxes quickly along preferential flow pathways and have restricted access to zones far from these pathways. It can clearly be imagined that such pattern could be modeled by a MIM model postulating water fraction into two fractions, one mobile and the other immobile, with solute transport by convection and dispersion in mobile water fraction and solute diffusion at the interface between mobile and immobile water fractions. The application of MIM approach to the case of solute transport in strongly heterogeneous soils may be quite advantageous: simplification of the problem, fewer parameters, ease of modeling, numerical computation, gain in computation time, etc. However, such consistency has never been investigated in details. In this paper, we focus on the possibility to model solute transport in a strongly heterogeneous deposit using MIM model. The deposit has been the subject of intensive campaigns of characterization of its lithology and the hydraulic and hydrodispersive properties of its lithofacies. Numerical computations were performed for a section of deposit 13.5 m wide and 2.5 m deep. Numerical results clearly showed the establishment of preferential flows with funneling mostly under unsaturated conditions. Solute elution at 2.5 m depth was characterized and discussed as a function of solute reactivity. Solutes breakthrough curves show clear evidence of MIM like pattern. In this paper, we clearly demonstrate that MIM model accurately reproduces solute elution at 2.5m depths but also at different depths. MIM approach accuracy is ensured provided that related parameters are optimized as a function of depth, hydric and hydraulic conditions and the contrast in hydraulic parameters of the lithofacies that constitute the deposit.

Are recent empirical directivity models sufficient in capturing near-fault directivity effect?

NASA Astrophysics Data System (ADS)

Chen, Yen-Shin; Cotton, Fabrice; Pagani, Marco; Weatherill, Graeme; Reshi, Owais; Mai, Martin

2017-04-01

It has been widely observed that the ground motion variability in the near field can be significantly higher than that commonly reported in published GMPEs, and this has been suggested to be a consequence of directivity. To capture the spatial variation in ground motion amplitude and frequency caused by the near-fault directivity effect, several models for engineering applications have been developed using empirical or, more recently, the combination of empirical and simulation data. Many research works have indicated that the large velocity pulses mainly observed in the near-field are primarily related to slip heterogeneity (i.e., asperities), suggesting that the slip heterogeneity is a more dominant controlling factor than the rupture velocity or source rise time function. The first generation of broadband directivity models for application in ground motion prediction do not account for heterogeneity of slip and rupture speed. With the increased availability of strong motion recordings (e.g., NGA-West 2 database) in the near-fault region, the directivity models moved from broadband to narrowband models to include the magnitude dependence of the period of the rupture directivity pulses, wherein the pulses are believed to be closely related to the heterogeneity of slip distribution. After decades of directivity models development, does the latest generation of models - i.e. the one including narrowband directivity models - better capture the near-fault directivity effects, particularly in presence of strong slip heterogeneity? To address this question, a set of simulated motions for an earthquake rupture scenario, with various kinematic slip models and hypocenter locations, are used as a basis for a comparison with the directivity models proposed by the NGA-West 2 project for application with ground motion prediction equations incorporating a narrowband directivity model. The aim of this research is to gain better insights on the accuracy of narrowband directivity models under conditions commonly encountered in the real world. Our preliminary result shows that empirical models including directivity factors better predict physics based ground-motion and their spatial variability than classical empirical models. However, the results clearly indicate that it is still a challenge for the directivity models to capture the strong directivity effect if a high level of slip heterogeneity is involved during the source rupture process.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

NASA Astrophysics Data System (ADS)

Lin, Guang; Liu, Jiangguo; Mu, Lin; Ye, Xiu

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors. We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.

Impact of heterogeneity and socioeconomic factors on individual behavior in decentralized sharing ecosystems.

PubMed

Gavaldà-Miralles, Arnau; Choffnes, David R; Otto, John S; Sánchez, Mario A; Bustamante, Fabián E; Amaral, Luís A N; Duch, Jordi; Guimerà, Roger

2014-10-28

Tens of millions of individuals around the world use decentralized content distribution systems, a fact of growing social, economic, and technological importance. These sharing systems are poorly understood because, unlike in other technosocial systems, it is difficult to gather large-scale data about user behavior. Here, we investigate user activity patterns and the socioeconomic factors that could explain the behavior. Our analysis reveals that (i) the ecosystem is heterogeneous at several levels: content types are heterogeneous, users specialize in a few content types, and countries are heterogeneous in user profiles; and (ii) there is a strong correlation between socioeconomic indicators of a country and users behavior. Our findings open a research area on the dynamics of decentralized sharing ecosystems and the socioeconomic factors affecting them, and may have implications for the design of algorithms and for policymaking.

Quantifying Performance Bias in Label Fusion

DTIC Science & Technology

2012-08-21

detect ), may provide the end-user with the means to appropriately adjust the performance and optimal thresholds for performance by fusing legacy systems...boolean combination of classification systems in ROC space: An application to anomaly detection with HMMs. Pattern Recognition, 43(8), 2732-2752. 10...Shamsuddin, S. (2009). An overview of neural networks use in anomaly intrusion detection systems. Paper presented at the Research and Development (SCOReD

Correlation Immunity, Avalanche Features, and Other Cryptographic Properties of Generalized Boolean Functions

DTIC Science & Technology

2017-09-01

information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and...maintaining the data needed, and completing and reviewing the collection of information . Send comments regarding this burden estimate or any other aspect...of this collection of information , including suggestions for reducing this burden to Washington headquarters Services, Directorate for Information

Further Results on Constructions of Generalized Bent Boolean Functions

DTIC Science & Technology

2016-03-01

China; 2Naval Postgraduate School, Applied Mathematics Department, Monterey, CA 93943, USA; 3Science and Technology on Communication Security...in 1976 as an interesting combinatorial object with the important property of having op- timal nonlinearity [1]. Since bent functions have many...77–94 10 Zhao Y, Li H L. On bent functions with some symmet- ric properties. Discret Appl Math, 2006, 154: 2537– 2543

INM Integrated Noise Model Version 2. Programmer’s Guide

DTIC Science & Technology

1979-09-01

cost, turnaround time, and system-dependent limitations. 3.2 CONVERSION PROBLEMS Item Item Item No. Desciption Category 1 BLOCK DATA Initialization IBM ...Restricted 2 Boolean Operations Differences Call Statement Parameters Extensions 4 Data Initialization IBM Restricted 5 ENTRY Differences 6 EQUIVALENCE...Machine Dependent 7 Format: A CDC Extension 8 Hollerith Strings IBM Restricted 9 Hollerith Variables IBM Restricted 10 Identifier Names CDC Extension

A Mathematical Analysis of Semantic Maps, with Theoretical and Applied Implications for Blended Learning Software

ERIC Educational Resources Information Center

Tang, Michael; David, Hyerle; Byrne, Roxanne; Tran, John

2012-01-01

This paper is a mathematical (Boolean) analysis a set of cognitive maps called Thinking Maps[R], based on Albert Upton's semantic principles developed in his seminal works, Design for Thinking (1961) and Creative Analysis (1961). Albert Upton can be seen as a brilliant thinker who was before his time or after his time depending on the future of…

Generalized Boolean Functions as Combiners

DTIC Science & Technology

2017-06-01

unable to find an analytically way of calculating a number for the complexity. Given the data we presented, there is not a obvious way to predict what...including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the...backbone of many computer functions. Cryptography drives online commerce and allows privileged information safe transit between two parties as well as many

Real People Don't Do Boolean: How To Teach End Users To Find High-Quality Information on the Internet.

ERIC Educational Resources Information Center

Vine, Rita

2001-01-01

Explains how to train users in effective Web searching. Discusses challenges of teaching Web information retrieval; a framework for information searching; choosing the right search tools for users; the seven-step lesson planning process; tips for delivering group Internet training; and things that help people work faster and smarter on the Web.…

Generalized Flip-Flop Input Equations Based on a Four-Valued Boolean Algebra

NASA Technical Reports Server (NTRS)

Tucker, Jerry H.; Tapia, Moiez A.

1996-01-01

A procedure is developed for obtaining generalized flip-flop input equations, and a concise method is presented for representing these equations. The procedure is based on solving a four-valued characteristic equation of the flip-flop, and can encompass flip-flops that are too complex to approach intuitively. The technique is presented using Karnaugh maps, but could easily be implemented in software.

An expert system design to diagnose cancer by using a new method reduced rule base.

PubMed

Başçiftçi, Fatih; Avuçlu, Emre

2018-04-01

A Medical Expert System (MES) was developed which uses Reduced Rule Base to diagnose cancer risk according to the symptoms in an individual. A total of 13 symptoms were used. With the new MES, the reduced rules are controlled instead of all possibilities (2 13 = 8192 different possibilities occur). By controlling reduced rules, results are found more quickly. The method of two-level simplification of Boolean functions was used to obtain Reduced Rule Base. Thanks to the developed application with the number of dynamic inputs and outputs on different platforms, anyone can easily test their own cancer easily. More accurate results were obtained considering all the possibilities related to cancer. Thirteen different risk factors were determined to determine the type of cancer. The truth table produced in our study has 13 inputs and 4 outputs. The Boolean Function Minimization method is used to obtain less situations by simplifying logical functions. Diagnosis of cancer quickly thanks to control of the simplified 4 output functions. Diagnosis made with the 4 output values obtained using Reduced Rule Base was found to be quicker than diagnosis made by screening all 2 13 = 8192 possibilities. With the improved MES, more probabilities were added to the process and more accurate diagnostic results were obtained. As a result of the simplification process in breast and renal cancer diagnosis 100% diagnosis speed gain, in cervical cancer and lung cancer diagnosis rate gain of 99% was obtained. With Boolean function minimization, less number of rules is evaluated instead of evaluating a large number of rules. Reducing the number of rules allows the designed system to work more efficiently and to save time, and facilitates to transfer the rules to the designed Expert systems. Interfaces were developed in different software platforms to enable users to test the accuracy of the application. Any one is able to diagnose the cancer itself using determinative risk factors. Thereby likely to beat the cancer with early diagnosis. Copyright © 2018 Elsevier B.V. All rights reserved.

Realisation of all 16 Boolean logic functions in a single magnetoresistance memory cell

NASA Astrophysics Data System (ADS)

Gao, Shuang; Yang, Guang; Cui, Bin; Wang, Shouguo; Zeng, Fei; Song, Cheng; Pan, Feng

2016-06-01

Stateful logic circuits based on next-generation nonvolatile memories, such as magnetoresistance random access memory (MRAM), promise to break the long-standing von Neumann bottleneck in state-of-the-art data processing devices. For the successful commercialisation of stateful logic circuits, a critical step is realizing the best use of a single memory cell to perform logic functions. In this work, we propose a method for implementing all 16 Boolean logic functions in a single MRAM cell, namely a magnetoresistance (MR) unit. Based on our experimental results, we conclude that this method is applicable to any MR unit with a double-hump-like hysteresis loop, especially pseudo-spin-valve magnetic tunnel junctions with a high MR ratio. Moreover, after simply reversing the correspondence between voltage signals and output logic values, this method could also be applicable to any MR unit with a double-pit-like hysteresis loop. These results may provide a helpful solution for the final commercialisation of MRAM-based stateful logic circuits in the near future.Stateful logic circuits based on next-generation nonvolatile memories, such as magnetoresistance random access memory (MRAM), promise to break the long-standing von Neumann bottleneck in state-of-the-art data processing devices. For the successful commercialisation of stateful logic circuits, a critical step is realizing the best use of a single memory cell to perform logic functions. In this work, we propose a method for implementing all 16 Boolean logic functions in a single MRAM cell, namely a magnetoresistance (MR) unit. Based on our experimental results, we conclude that this method is applicable to any MR unit with a double-hump-like hysteresis loop, especially pseudo-spin-valve magnetic tunnel junctions with a high MR ratio. Moreover, after simply reversing the correspondence between voltage signals and output logic values, this method could also be applicable to any MR unit with a double-pit-like hysteresis loop. These results may provide a helpful solution for the final commercialisation of MRAM-based stateful logic circuits in the near future. Electronic supplementary information (ESI) available. See DOI: 10.1039/c6nr03169b

A Note on a Sampling Theorem for Functions over GF(q)n Domain

NASA Astrophysics Data System (ADS)

Ukita, Yoshifumi; Saito, Tomohiko; Matsushima, Toshiyasu; Hirasawa, Shigeichi

In digital signal processing, the sampling theorem states that any real valued function ƒ can be reconstructed from a sequence of values of ƒ that are discretely sampled with a frequency at least twice as high as the maximum frequency of the spectrum of ƒ. This theorem can also be applied to functions over finite domain. Then, the range of frequencies of ƒ can be expressed in more detail by using a bounded set instead of the maximum frequency. A function whose range of frequencies is confined to a bounded set is referred to as bandlimited function. And a sampling theorem for bandlimited functions over Boolean domain has been obtained. Here, it is important to obtain a sampling theorem for bandlimited functions not only over Boolean domain (GF(q)n domain) but also over GF(q)n domain, where q is a prime power and GF(q) is Galois field of order q. For example, in experimental designs, although the model can be expressed as a linear combination of the Fourier basis functions and the levels of each factor can be represented by GF(q)n, the number of levels often take a value greater than two. However, the sampling theorem for bandlimited functions over GF(q)n domain has not been obtained. On the other hand, the sampling points are closely related to the codewords of a linear code. However, the relation between the parity check matrix of a linear code and any distinct error vectors has not been obtained, although it is necessary for understanding the meaning of the sampling theorem for bandlimited functions. In this paper, we generalize the sampling theorem for bandlimited functions over Boolean domain to a sampling theorem for bandlimited functions over GF(q)n domain. We also present a theorem for the relation between the parity check matrix of a linear code and any distinct error vectors. Lastly, we clarify the relation between the sampling theorem for functions over GF(q)n domain and linear codes.

Evolutionary mixed games in structured populations: Cooperation and the benefits of heterogeneity

NASA Astrophysics Data System (ADS)

Amaral, Marco A.; Wardil, Lucas; Perc, Matjaž; da Silva, Jafferson K. L.

2016-04-01

Evolutionary games on networks traditionally involve the same game at each interaction. Here we depart from this assumption by considering mixed games, where the game played at each interaction is drawn uniformly at random from a set of two different games. While in well-mixed populations the random mixture of the two games is always equivalent to the average single game, in structured populations this is not always the case. We show that the outcome is, in fact, strongly dependent on the distance of separation of the two games in the parameter space. Effectively, this distance introduces payoff heterogeneity, and the average game is returned only if the heterogeneity is small. For higher levels of heterogeneity the distance to the average game grows, which often involves the promotion of cooperation. The presented results support preceding research that highlights the favorable role of heterogeneity regardless of its origin, and they also emphasize the importance of the population structure in amplifying facilitators of cooperation.

Evolutionary mixed games in structured populations: Cooperation and the benefits of heterogeneity.

PubMed

Amaral, Marco A; Wardil, Lucas; Perc, Matjaž; da Silva, Jafferson K L

2016-04-01

Evolutionary games on networks traditionally involve the same game at each interaction. Here we depart from this assumption by considering mixed games, where the game played at each interaction is drawn uniformly at random from a set of two different games. While in well-mixed populations the random mixture of the two games is always equivalent to the average single game, in structured populations this is not always the case. We show that the outcome is, in fact, strongly dependent on the distance of separation of the two games in the parameter space. Effectively, this distance introduces payoff heterogeneity, and the average game is returned only if the heterogeneity is small. For higher levels of heterogeneity the distance to the average game grows, which often involves the promotion of cooperation. The presented results support preceding research that highlights the favorable role of heterogeneity regardless of its origin, and they also emphasize the importance of the population structure in amplifying facilitators of cooperation.

Titanium Dioxide as a Catalyst Support in Heterogeneous Catalysis

PubMed Central

Bagheri, Samira; Muhd Julkapli, Nurhidayatullaili; Bee Abd Hamid, Sharifah

2014-01-01

The lack of stability is a challenge for most heterogeneous catalysts. During operations, the agglomeration of particles may block the active sites of the catalyst, which is believed to contribute to its instability. Recently, titanium oxide (TiO2) was introduced as an alternative support material for heterogeneous catalyst due to the effect of its high surface area stabilizing the catalysts in its mesoporous structure. TiO2 supported metal catalysts have attracted interest due to TiO2 nanoparticles high activity for various reduction and oxidation reactions at low pressures and temperatures. Furthermore, TiO2 was found to be a good metal oxide catalyst support due to the strong metal support interaction, chemical stability, and acid-base property. The aforementioned properties make heterogeneous TiO2 supported catalysts show a high potential in photocatalyst-related applications, electrodes for wet solar cells, synthesis of fine chemicals, and others. This review focuses on TiO2 as a support material for heterogeneous catalysts and its potential applications. PMID:25383380

Dynamic heterogeneity in crossover spin facilitated model of supercooled liquid and fractional Stokes-Einstein relation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Choi, Seo-Woo; Kim, Soree; Jung, YounJoon, E-mail: yjjung@snu.ac.kr

Kinetically constrained models have gained much interest as models that assign the origins of interesting dynamic properties of supercooled liquids to dynamical facilitation mechanisms that have been revealed in many experiments and numerical simulations. In this work, we investigate the dynamic heterogeneity in the fragile-to-strong liquid via Monte Carlo method using the model that linearly interpolates between the strong liquid-like behavior and the fragile liquid-like behavior by an asymmetry parameter b. When the asymmetry parameter is sufficiently small, smooth fragile-to-strong transition is observed both in the relaxation time and the diffusion constant. Using these physical quantities, we investigate fractional Stokes-Einsteinmore » relations observed in this model. When b is fixed, the system shows constant power law exponent under the temperature change, and the exponent has the value between that of the Frederickson-Andersen model and the East model. Furthermore, we investigate the dynamic length scale of our systems and also find the crossover relation between the relaxation time. We ascribe the competition between energetically favored symmetric relaxation mechanism and entropically favored asymmetric relaxation mechanism to the fragile-to-strong crossover behavior.« less

Identifying the influential aquifer heterogeneity factor on nitrate reduction processes by numerical simulation

NASA Astrophysics Data System (ADS)

Jang, E.; He, W.; Savoy, H.; Dietrich, P.; Kolditz, O.; Rubin, Y.; Schüth, C.; Kalbacher, T.

2017-01-01

Nitrate reduction reactions in groundwater systems are strongly influenced by various aquifer heterogeneity factors that affect the transport of chemical species, spatial distribution of redox reactive substances and, as a result, the overall nitrate reduction efficiency. In this study, we investigated the influence of physical and chemical aquifer heterogeneity, with a focus on nitrate transport and redox transformation processes. A numerical modeling study for simulating coupled hydrological-geochemical aquifer heterogeneity was conducted in order to improve our understanding of the influence of the aquifer heterogeneity on the nitrate reduction reactions and to identify the most influential aquifer heterogeneity factors throughout the simulation. Results show that the most influential aquifer heterogeneity factors could change over time. With abundant presence of electron donors in the high permeable zones (initial stage), physical aquifer heterogeneity significantly influences the nitrate reduction since it enables the preferential transport of nitrate to these zones and enhances mixing of reactive partners. Chemical aquifer heterogeneity plays a comparatively minor role. Increasing the spatial variability of the hydraulic conductivity also increases the nitrate removal efficiency of the system. However, ignoring chemical aquifer heterogeneity can lead to an underestimation of nitrate removals in long-term behavior. With the increase of the spatial variability of the electron donor, i.e. chemical heterogeneity, the number of the ;hot spots; i.e. zones with comparably higher reactivity, should also increase. Hence, nitrate removal efficiencies will also be spatially variable but overall removal efficiency will be sustained if longer time scales are considered and nitrate fronts reach these high reactivity zones.

Using the heterogeneity distribution in Earth's mantle to study structure and flow

NASA Astrophysics Data System (ADS)

Rost, S.; Frost, D. A.; Bentham, H. L.

2016-12-01

The Earth's interior contains heterogeneities on many scale-lengths ranging from continent sized structures such as Large-Low Shear Velocity Provinces (LLSVPs) to grain-sized anomalies resolved using geochemistry. Sources of heterogeneity in Earth's mantle are for example the recycling of crustal material through the subduction process as well as partial melting and compositional variations. The subduction and recycling of oceanic crust throughout Earth's history leads to strong heterogeneities in the mantle that can be detected using seismology and geochemistry. Current models of mantle convection show that the subducted crustal material can be long-lived and is transported passively throughout the mantle by convective flows. Settling and entrainment is dependent on the density structure of the heterogeneity. Imaging heterogeneities throughout the mantle therefore allows imaging mantle flow especially in areas of inhibited flow due to e.g. viscosity changes or changes in composition or dynamics. The short-period seismic wavefield is dominated by scattered seismic energy partly originating from scattering at small-scale heterogeneities in Earth's mantle. Using specific raypath configurations we are able to sample different depths throughout Earth's mantle for the existence and properties of heterogeneities. These scattering probes show distinct variations in energy content with frequency indicating dominant heterogeneity length-scales in the mantle. We detect changes in heterogeneity structure both in lateral and radial directions. The radial heterogeneity structure requires changes in mantle structure at depths of 1000 km and 1800 to 2000 km that could indicate a change in viscosity structure in the mid mantle partly changing the flow of subducted crustal material into the deep mantle. Lateral changes in heterogeneity structure close to the core mantle boundary indicate lateral transport inhibited by the compositional anomalies of the LLSVPs.

Impact of heterogeneity and socioeconomic factors on individual behavior in decentralized sharing ecosystems

PubMed Central

Gavaldà-Miralles, Arnau; Choffnes, David R.; Otto, John S.; Sánchez, Mario A.; Bustamante, Fabián E.; Amaral, Luís A. N.; Duch, Jordi; Guimerà, Roger

2014-01-01

Tens of millions of individuals around the world use decentralized content distribution systems, a fact of growing social, economic, and technological importance. These sharing systems are poorly understood because, unlike in other technosocial systems, it is difficult to gather large-scale data about user behavior. Here, we investigate user activity patterns and the socioeconomic factors that could explain the behavior. Our analysis reveals that (i) the ecosystem is heterogeneous at several levels: content types are heterogeneous, users specialize in a few content types, and countries are heterogeneous in user profiles; and (ii) there is a strong correlation between socioeconomic indicators of a country and users behavior. Our findings open a research area on the dynamics of decentralized sharing ecosystems and the socioeconomic factors affecting them, and may have implications for the design of algorithms and for policymaking. PMID:25288755

Characterizing heterogeneous dynamics at hydrated electrode surfaces.

PubMed

Willard, Adam P; Limmer, David T; Madden, Paul A; Chandler, David

2013-05-14

In models of Pt 111 and Pt 100 surfaces in water, motions of molecules in the first hydration layer are spatially and temporally correlated. To interpret these collective motions, we apply quantitative measures of dynamic heterogeneity that are standard tools for considering glassy systems. Specifically, we carry out an analysis in terms of mobility fields and distributions of persistence times and exchange times. In so doing, we show that dynamics in these systems is facilitated by transient disorder in frustrated two-dimensional hydrogen bonding networks. The frustration is the result of unfavorable geometry imposed by strong metal-water bonding. The geometry depends upon the structure of the underlying metal surface. Dynamic heterogeneity of water on the Pt 111 surface is therefore qualitatively different than that for water on the Pt 100 surface. In both cases, statistics of this ad-layer dynamic heterogeneity responds asymmetrically to applied voltage.

Characterizing heterogeneous dynamics at hydrated electrode surfaces

NASA Astrophysics Data System (ADS)

Willard, Adam P.; Limmer, David T.; Madden, Paul A.; Chandler, David

2013-05-01

In models of Pt 111 and Pt 100 surfaces in water, motions of molecules in the first hydration layer are spatially and temporally correlated. To interpret these collective motions, we apply quantitative measures of dynamic heterogeneity that are standard tools for considering glassy systems. Specifically, we carry out an analysis in terms of mobility fields and distributions of persistence times and exchange times. In so doing, we show that dynamics in these systems is facilitated by transient disorder in frustrated two-dimensional hydrogen bonding networks. The frustration is the result of unfavorable geometry imposed by strong metal-water bonding. The geometry depends upon the structure of the underlying metal surface. Dynamic heterogeneity of water on the Pt 111 surface is therefore qualitatively different than that for water on the Pt 100 surface. In both cases, statistics of this ad-layer dynamic heterogeneity responds asymmetrically to applied voltage.

Performance of Between-Study Heterogeneity Measures in the Cochrane Library.

PubMed

Ma, Xiaoyue; Lin, Lifeng; Qu, Zhiyong; Zhu, Motao; Chu, Haitao

2018-05-29

The growth in comparative effectiveness research and evidence-based medicine has increased attention to systematic reviews and meta-analyses. Meta-analysis synthesizes and contrasts evidence from multiple independent studies to improve statistical efficiency and reduce bias. Assessing heterogeneity is critical for performing a meta-analysis and interpreting results. As a widely used heterogeneity measure, the I statistic quantifies the proportion of total variation across studies that is due to real differences in effect size. The presence of outlying studies can seriously exaggerate the I statistic. Two alternative heterogeneity measures, the Ir and Im, have been recently proposed to reduce the impact of outlying studies. To evaluate these measures' performance empirically, we applied them to 20,599 meta-analyses in the Cochrane Library. We found that the Ir and Im have strong agreement with the I, while they are more robust than the I when outlying studies appear.

Ovarian Cancer Risk Factors by Histologic Subtype: An Analysis From the Ovarian Cancer Cohort Consortium.

PubMed

Wentzensen, Nicolas; Poole, Elizabeth M; Trabert, Britton; White, Emily; Arslan, Alan A; Patel, Alpa V; Setiawan, V Wendy; Visvanathan, Kala; Weiderpass, Elisabete; Adami, Hans-Olov; Black, Amanda; Bernstein, Leslie; Brinton, Louise A; Buring, Julie; Butler, Lesley M; Chamosa, Saioa; Clendenen, Tess V; Dossus, Laure; Fortner, Renee; Gapstur, Susan M; Gaudet, Mia M; Gram, Inger T; Hartge, Patricia; Hoffman-Bolton, Judith; Idahl, Annika; Jones, Michael; Kaaks, Rudolf; Kirsh, Victoria; Koh, Woon-Puay; Lacey, James V; Lee, I-Min; Lundin, Eva; Merritt, Melissa A; Onland-Moret, N Charlotte; Peters, Ulrike; Poynter, Jenny N; Rinaldi, Sabina; Robien, Kim; Rohan, Thomas; Sandler, Dale P; Schairer, Catherine; Schouten, Leo J; Sjöholm, Louise K; Sieri, Sabina; Swerdlow, Anthony; Tjonneland, Anna; Travis, Ruth; Trichopoulou, Antonia; van den Brandt, Piet A; Wilkens, Lynne; Wolk, Alicja; Yang, Hannah P; Zeleniuch-Jacquotte, Anne; Tworoger, Shelley S

2016-08-20

An understanding of the etiologic heterogeneity of ovarian cancer is important for improving prevention, early detection, and therapeutic approaches. We evaluated 14 hormonal, reproductive, and lifestyle factors by histologic subtype in the Ovarian Cancer Cohort Consortium (OC3). Among 1.3 million women from 21 studies, 5,584 invasive epithelial ovarian cancers were identified (3,378 serous, 606 endometrioid, 331 mucinous, 269 clear cell, 1,000 other). By using competing-risks Cox proportional hazards regression stratified by study and birth year and adjusted for age, parity, and oral contraceptive use, we assessed associations for all invasive cancers by histology. Heterogeneity was evaluated by likelihood ratio test. Most risk factors exhibited significant heterogeneity by histology. Higher parity was most strongly associated with endometrioid (relative risk [RR] per birth, 0.78; 95% CI, 0.74 to 0.83) and clear cell (RR, 0.68; 95% CI, 0.61 to 0.76) carcinomas (P value for heterogeneity [P-het] < .001). Similarly, age at menopause, endometriosis, and tubal ligation were only associated with endometrioid and clear cell tumors (P-het ≤ .01). Family history of breast cancer (P-het = .008) had modest heterogeneity. Smoking was associated with an increased risk of mucinous (RR per 20 pack-years, 1.26; 95% CI, 1.08 to 1.46) but a decreased risk of clear cell (RR, 0.72; 95% CI, 0.55 to 0.94) tumors (P-het = .004). Unsupervised clustering by risk factors separated endometrioid, clear cell, and low-grade serous carcinomas from high-grade serous and mucinous carcinomas. The heterogeneous associations of risk factors with ovarian cancer subtypes emphasize the importance of conducting etiologic studies by ovarian cancer subtypes. Most established risk factors were more strongly associated with nonserous carcinomas, which demonstrate challenges for risk prediction of serous cancers, the most fatal subtype. © 2016 by American Society of Clinical Oncology.

Large-scale compositional heterogeneity in the Earth's mantle

NASA Astrophysics Data System (ADS)

Ballmer, M.

2017-12-01

Seismic imaging of subducted Farallon and Tethys lithosphere in the lower mantle has been taken as evidence for whole-mantle convection, and efficient mantle mixing. However, cosmochemical constraints point to a lower-mantle composition that has a lower Mg/Si compared to upper-mantle pyrolite. Moreover, geochemical signatures of magmatic rocks indicate the long-term persistence of primordial reservoirs somewhere in the mantle. In this presentation, I establish geodynamic mechanisms for sustaining large-scale (primordial) heterogeneity in the Earth's mantle using numerical models. Mantle flow is controlled by rock density and viscosity. Variations in intrinsic rock density, such as due to heterogeneity in basalt or iron content, can induce layering or partial layering in the mantle. Layering can be sustained in the presence of persistent whole mantle convection due to active "unmixing" of heterogeneity in low-viscosity domains, e.g. in the transition zone or near the core-mantle boundary [1]. On the other hand, lateral variations in intrinsic rock viscosity, such as due to heterogeneity in Mg/Si, can strongly affect the mixing timescales of the mantle. In the extreme case, intrinsically strong rocks may remain unmixed through the age of the Earth, and persist as large-scale domains in the mid-mantle due to focusing of deformation along weak conveyor belts [2]. That large-scale lateral heterogeneity and/or layering can persist in the presence of whole-mantle convection can explain the stagnation of some slabs, as well as the deflection of some plumes, in the mid-mantle. These findings indeed motivate new seismic studies for rigorous testing of model predictions. [1] Ballmer, M. D., N. C. Schmerr, T. Nakagawa, and J. Ritsema (2015), Science Advances, doi:10.1126/sciadv.1500815. [2] Ballmer, M. D., C. Houser, J. W. Hernlund, R. Wentzcovitch, and K. Hirose (2017), Nature Geoscience, doi:10.1038/ngeo2898.

Ovarian Cancer Risk Factors by Histologic Subtype: An Analysis From the Ovarian Cancer Cohort Consortium

PubMed Central

Poole, Elizabeth M.; Trabert, Britton; White, Emily; Arslan, Alan A.; Patel, Alpa V.; Setiawan, V. Wendy; Visvanathan, Kala; Weiderpass, Elisabete; Adami, Hans-Olov; Black, Amanda; Bernstein, Leslie; Brinton, Louise A.; Buring, Julie; Butler, Lesley M.; Chamosa, Saioa; Clendenen, Tess V.; Dossus, Laure; Fortner, Renee; Gapstur, Susan M.; Gaudet, Mia M.; Gram, Inger T.; Hartge, Patricia; Hoffman-Bolton, Judith; Idahl, Annika; Jones, Michael; Kaaks, Rudolf; Kirsh, Victoria; Koh, Woon-Puay; Lacey, James V.; Lee, I-Min; Lundin, Eva; Merritt, Melissa A.; Onland-Moret, N. Charlotte; Peters, Ulrike; Poynter, Jenny N.; Rinaldi, Sabina; Robien, Kim; Rohan, Thomas; Sandler, Dale P.; Schairer, Catherine; Schouten, Leo J.; Sjöholm, Louise K.; Sieri, Sabina; Swerdlow, Anthony; Tjonneland, Anna; Travis, Ruth; Trichopoulou, Antonia; van den Brandt, Piet A.; Wilkens, Lynne; Wolk, Alicja; Yang, Hannah P.; Zeleniuch-Jacquotte, Anne; Tworoger, Shelley S.

2016-01-01

Purpose An understanding of the etiologic heterogeneity of ovarian cancer is important for improving prevention, early detection, and therapeutic approaches. We evaluated 14 hormonal, reproductive, and lifestyle factors by histologic subtype in the Ovarian Cancer Cohort Consortium (OC3). Patients and Methods Among 1.3 million women from 21 studies, 5,584 invasive epithelial ovarian cancers were identified (3,378 serous, 606 endometrioid, 331 mucinous, 269 clear cell, 1,000 other). By using competing-risks Cox proportional hazards regression stratified by study and birth year and adjusted for age, parity, and oral contraceptive use, we assessed associations for all invasive cancers by histology. Heterogeneity was evaluated by likelihood ratio test. Results Most risk factors exhibited significant heterogeneity by histology. Higher parity was most strongly associated with endometrioid (relative risk [RR] per birth, 0.78; 95% CI, 0.74 to 0.83) and clear cell (RR, 0.68; 95% CI, 0.61 to 0.76) carcinomas (P value for heterogeneity [P-het] < .001). Similarly, age at menopause, endometriosis, and tubal ligation were only associated with endometrioid and clear cell tumors (P-het ≤ .01). Family history of breast cancer (P-het = .008) had modest heterogeneity. Smoking was associated with an increased risk of mucinous (RR per 20 pack-years, 1.26; 95% CI, 1.08 to 1.46) but a decreased risk of clear cell (RR, 0.72; 95% CI, 0.55 to 0.94) tumors (P-het = .004). Unsupervised clustering by risk factors separated endometrioid, clear cell, and low-grade serous carcinomas from high-grade serous and mucinous carcinomas. Conclusion The heterogeneous associations of risk factors with ovarian cancer subtypes emphasize the importance of conducting etiologic studies by ovarian cancer subtypes. Most established risk factors were more strongly associated with nonserous carcinomas, which demonstrate challenges for risk prediction of serous cancers, the most fatal subtype. PMID:27325851

Mach wave properties in the presence of source and medium heterogeneity

NASA Astrophysics Data System (ADS)

Vyas, J. C.; Mai, P. M.; Galis, M.; Dunham, Eric M.; Imperatori, W.

2018-06-01

We investigate Mach wave coherence for kinematic supershear ruptures with spatially heterogeneous source parameters, embedded in 3D scattering media. We assess Mach wave coherence considering: 1) source heterogeneities in terms of variations in slip, rise time and rupture speed; 2) small-scale heterogeneities in Earth structure, parameterized from combinations of three correlation lengths and two standard deviations (assuming von Karman power spectral density with fixed Hurst exponent); and 3) joint effects of source and medium heterogeneities. Ground-motion simulations are conducted using a generalized finite-difference method, choosing a parameterization such that the highest resolved frequency is ˜5 Hz. We discover that Mach wave coherence is slightly diminished at near fault distances (< 10 km) due to spatially variable slip and rise time; beyond this distance the Mach wave coherence is more strongly reduced by wavefield scattering due to small-scale heterogeneities in Earth structure. Based on our numerical simulations and theoretical considerations we demonstrate that the standard deviation of medium heterogeneities controls the wavefield scattering, rather than the correlation length. In addition, we find that peak ground accelerations in the case of combined source and medium heterogeneities are consistent with empirical ground motion prediction equations for all distances, suggesting that in nature ground shaking amplitudes for supershear ruptures may not be elevated due to complexities in the rupture process and seismic wave-scattering.

Proceedings of the Annual Ada Software Engineering Education and Training Symposium (4th) Held in Houston, Texas on June 13-15, 1989

DTIC Science & Technology

1989-06-01

Canfields, SevenUp, CocaCola , none); type Ounces is range 0 .. 20; type PriceType is digits 2 range 0.0 .. 0.75; type ContainerType is (bottle, can...brand of the soda (Shasta, CocaCola , etc.) function IsDiet(TheSoda : Soda) return boolean; -- return TRUE if the soda is a diet soda, FALSE otherwise

What Is the Unit of Visual Attention? Object for Selection, but Boolean Map for Access

ERIC Educational Resources Information Center

Huang, Liqiang

2010-01-01

In the past 20 years, numerous theories and findings have suggested that the unit of visual attention is the object. In this study, I first clarify 2 different meanings of unit of visual attention, namely the unit of access in the sense of measurement and the unit of selection in the sense of division. In accordance with this distinction, I argue…

The Event Based Language and Its Multiple Processor Implementations.

DTIC Science & Technology

1980-01-01

10 6.1 "Recursive" Linear Fibonacci ................................................ 105 6.2 The Readers Writers Problem...kinds. Examples of such systems are: C.mmp [Wu-72], Pluribus [He-73], Data Flow [ De -75], the boolean n-cube parallel machine [Su-77], and the MuNet [Wa...concurrency within programs; therefore, we hate concentrated on two types of systems which seem suitable: a processor network, and a data flow processor [ De -77

Standards for the Mobility Common Operational Picture (M-COP): Elements of Ground Vehicle Maneuver

DTIC Science & Technology

2007-07-01

saturated 0009 waterlogged 0010 wet Surface_Slippery Indication that a surface is slippery . Examples: wet grass, and wet clay soil. 1 boolean...Enumeration Values or Units† 0022 cypress 0023 deciduous_unspecified 0024 dry_crops 0025 elm 0026 eucalyptus 0027 evergreen_unspecified 0028 filao...internal structural material. 1 integer 0024 concrete_steel 0137 steel 0155 wood Surface_Slippery Indication that a surface is slippery

Solving Semantic Searches for Source Code

DTIC Science & Technology

2012-11-01

but of input and expected output pairs. In this domain, those inputs take the form of strings and outputs could be one of sev- eral datatypes ...for some relaxation of CPi that yields C ′ Pi . Encoding weakening is performed by systematically making the constraints on a particular datatype ...the datatypes that can hold concrete or symbolic values: integers, characters, booleans, and strings. The Java implementation uses all the data types

Image Filtering with Boolean and Statistical Operators.

DTIC Science & Technology

1983-12-01

S3(2) COMPLEX AMAT(256, 4). BMAT (256. 4). CMAT(256. 4) CALL IOF(3. MAIN. AFLNM. DFLNI, CFLNM. MS., 82, S3) CALL OPEN(1.AFLNM* 1.IER) CALL CHECKC!ER...RDBLK(2. 6164. MAT. 16, IER) CALL CHECK(IER) DO I K-1. 4 DO I J-1.256 CMAT(J. K)-AMAT(J. K)’. BMAT (J. K) I CONTINUE S CALL WRBLK(3. 164!. CMAT. 16. IER

Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation.

PubMed

Dutta, Sourav; Zografos, Odysseas; Gurunarayanan, Surya; Radu, Iuliana; Soree, Bart; Catthoor, Francky; Naeemi, Azad

2017-12-19

Surface-plasmon-polariton waves propagating at the interface between a metal and a dielectric, hold the key to future high-bandwidth, dense on-chip integrated logic circuits overcoming the diffraction limitation of photonics. While recent advances in plasmonic logic have witnessed the demonstration of basic and universal logic gates, these CMOS oriented digital logic gates cannot fully utilize the expressive power of this novel technology. Here, we aim at unraveling the true potential of plasmonics by exploiting an enhanced native functionality - the majority voter. Contrary to the state-of-the-art plasmonic logic devices, we use the phase of the wave instead of the intensity as the state or computational variable. We propose and demonstrate, via numerical simulations, a comprehensive scheme for building a nanoscale cascadable plasmonic majority logic gate along with a novel referencing scheme that can directly translate the information encoded in the amplitude and phase of the wave into electric field intensity at the output. Our MIM-based 3-input majority gate displays a highly improved overall area of only 0.636 μm 2 for a single-stage compared with previous works on plasmonic logic. The proposed device demonstrates non-Boolean computational capability and can find direct utility in highly parallel real-time signal processing applications like pattern recognition.

Specialty functions singularity mechanics problems

NASA Technical Reports Server (NTRS)

Sarigul, Nesrin

1989-01-01

The focus is in the development of more accurate and efficient advanced methods for solution of singular problems encountered in mechanics. At present, finite element methods in conjunction with special functions, boolean sum and blending interpolations are being considered. In dealing with systems which contain a singularity, special finite elements are being formulated to be used in singular regions. Further, special transition elements are being formulated to couple the special element to the mesh that models the rest of the system, and to be used in conjunction with 1-D, 2-D and 3-D elements within the same mesh. Computational simulation with a least squares fit is being utilized to construct special elements, if there is an unknown singularity in the system. A novel approach is taken in formulation of the elements in that: (1) the material properties are modified to include time, temperature, coordinate and stress dependant behavior within the element; (2) material properties vary at nodal points of the elements; (3) a hidden-symbolic computation scheme is developed and utilized in formulating the elements; and (4) special functions and boolean sum are utilized in order to interpolate the field variables and their derivatives along the boundary of the elements. It may be noted that the proposed methods are also applicable to fluids and coupled problems.

Pseudomonas Genome Database: facilitating user-friendly, comprehensive comparisons of microbial genomes.

PubMed

Winsor, Geoffrey L; Van Rossum, Thea; Lo, Raymond; Khaira, Bhavjinder; Whiteside, Matthew D; Hancock, Robert E W; Brinkman, Fiona S L

2009-01-01

Pseudomonas aeruginosa is a well-studied opportunistic pathogen that is particularly known for its intrinsic antimicrobial resistance, diverse metabolic capacity, and its ability to cause life threatening infections in cystic fibrosis patients. The Pseudomonas Genome Database (http://www.pseudomonas.com) was originally developed as a resource for peer-reviewed, continually updated annotation for the Pseudomonas aeruginosa PAO1 reference strain genome. In order to facilitate cross-strain and cross-species genome comparisons with other Pseudomonas species of importance, we have now expanded the database capabilities to include all Pseudomonas species, and have developed or incorporated methods to facilitate high quality comparative genomics. The database contains robust assessment of orthologs, a novel ortholog clustering method, and incorporates five views of the data at the sequence and annotation levels (Gbrowse, Mauve and custom views) to facilitate genome comparisons. A choice of simple and more flexible user-friendly Boolean search features allows researchers to search and compare annotations or sequences within or between genomes. Other features include more accurate protein subcellular localization predictions and a user-friendly, Boolean searchable log file of updates for the reference strain PAO1. This database aims to continue to provide a high quality, annotated genome resource for the research community and is available under an open source license.

Process-driven inference of biological network structure: feasibility, minimality, and multiplicity

NASA Astrophysics Data System (ADS)

Zeng, Chen

2012-02-01

For a given dynamic process, identifying the putative interaction networks to achieve it is the inference problem. In this talk, we address the computational complexity of inference problem in the context of Boolean networks under dominant inhibition condition. The first is a proof that the feasibility problem (is there a network that explains the dynamics?) can be solved in polynomial-time. Second, while the minimality problem (what is the smallest network that explains the dynamics?) is shown to be NP-hard, a simple polynomial-time heuristic is shown to produce near-minimal solutions, as demonstrated by simulation. Third, the theoretical framework also leads to a fast polynomial-time heuristic to estimate the number of network solutions with reasonable accuracy. We will apply these approaches to two simplified Boolean network models for the cell cycle process of budding yeast (Li 2004) and fission yeast (Davidich 2008). Our results demonstrate that each of these networks contains a giant backbone motif spanning all the network nodes that provides the desired main functionality, while the remaining edges in the network form smaller motifs whose role is to confer stability properties rather than provide function. Moreover, we show that the bioprocesses of these two cell cycle models differ considerably from a typically generated process and are intrinsically cascade-like.

Comparison of Control Approaches in Genetic Regulatory Networks by Using Stochastic Master Equation Models, Probabilistic Boolean Network Models and Differential Equation Models and Estimated Error Analyzes

NASA Astrophysics Data System (ADS)

Caglar, Mehmet Umut; Pal, Ranadip

2011-03-01

Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.

An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.

PubMed

Jiang, Han; Li, Xue; Xu, Qiuliang

2016-12-01

The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.

Classification scheme and prevention measures for caught-in-between occupational fatalities.

PubMed

Chi, Chia-Fen; Lin, Syuan-Zih

2018-04-01

The current study analyzed 312 caught-in-between fatalities caused by machinery and vehicles. A comprehensive and mutually exclusive coding scheme was developed to analyze and code each caught-in-between fatality in terms of age, gender, experience of the victim, type of industry, source of injury, and causes for these accidents. Boolean algebra analysis was applied on these 312 caught-in-between fatalities to derive minimal cut set (MCS) causes associated with each source of injury. Eventually, contributing factors and common accident patterns associated with (1) special process machinery including textile, printing, packaging machinery, (2) metal, woodworking, and special material machinery, (3) conveyor, (4) vehicle, (5) crane, (6) construction machinery, and (7) elevator can be divided into three major groups through Boolean algebra and MCS analysis. The MCS causes associated with conveyor share the same primary causes as those of the special process machinery including textile, printing, packaging and metal, woodworking, and special material machinery. These fatalities can be eliminated by focusing on the prevention measures associated with lack of safeguards, working on a running machine or process, unintentional activation, unsafe posture or position, unsafe clothing, and defective safeguards. Other precise and effective intervention can be developed based on the identified groups of accident causes associated with each source of injury. Copyright © 2017 Elsevier Ltd. All rights reserved.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, Guang; Liu, Jiangguo; Mu, Lin

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors.more » We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.« less

Structure and Filling Characteristics of Paleokarst Reservoirs in the Northern Tarim Basin, Revealed by Outcrop, Core and Borehole Images

NASA Astrophysics Data System (ADS)

Tian, Fei; Lu, Xinbian; Zheng, Songqing; Zhang, Hongfang; Rong, Yuanshuai; Yang, Debin; Liu, Naigui

2017-06-01

The Ordovician paleokarst reservoirs in the Tahe oilfield, with burial depths of over 5300 m, experienced multiple phases of geologic processes and exhibit strong heterogeneity. Core testing can be used to analyse the characteristics of typical points at the centimetre scale, and seismic datasets can reveal the macroscopic outlines of reservoirs at the >10-m scale. However, neither method can identify caves, cave fills and fractures at the meter scale. Guided by outcrop investigations and calibrations based on core sample observations, this paper describes the interpretation of high longitudinal resolution borehole images, the identification of the characteristics of caves, cave fills (sedimentary, breccia and chemical fills) and fractures in single wells, and the identification of structures and fill characteristics at the meter scale in the strongly heterogeneous paleokarst reservoirs. The paleogeomorphology, a major controlling factor in the distribution of paleokarst reservoirs, was also analysed. The results show that one well can penetrate multiple cave layers of various sizes and that the caves are filled with multiple types of fill. The paleogeomorphology can be divided into highlands, slopes and depressions, which controlled the structure and fill characteristics of the paleokarst reservoirs. The results of this study can provide fundamental meter-scale datasets for interpreting detailed geologic features of deeply buried paleocaves, can be used to connect core- and seismic-scale interpretations, and can provide support for the recognition and development of these strongly heterogeneous reservoirs.

Bridging micro to macroscale fracture properties in highly heterogeneous brittle solids: weak pinning versus fingering

NASA Astrophysics Data System (ADS)

Vasoya, Manish; Lazarus, Véronique; Ponson, Laurent

2016-10-01

The effect of strong toughness heterogeneities on the macroscopic failure properties of brittle solids is investigated in the context of planar crack propagation. The basic mechanism at play is that the crack is locally slowed down or even trapped when encountering tougher material. The induced front deformation results in a selection of local toughness values that reflect at larger scale on the material resistance. To unravel this complexity and bridge micro to macroscale in failure of strongly heterogeneous media, we propose a homogenization procedure based on the introduction of two complementary macroscopic properties: An apparent toughness defined from the loading required to make the crack propagate and an effective fracture energy defined from the rate of energy released by unit area of crack advance. The relationship between these homogenized properties and the features of the local toughness map is computed using an iterative perturbation method. This approach is applied to a circular crack pinned by a periodic array of obstacles invariant in the radial direction, which gives rise to two distinct propagation regimes: A weak pinning regime where the crack maintains a stationary shape after reaching an equilibrium position and a fingering regime characterized by the continuous growth of localized regions of the fronts while the other parts remain trapped. Our approach successfully bridges micro to macroscopic failure properties in both cases and illustrates how small scale heterogeneities can drastically affect the overall failure response of brittle solids. On a broader perspective, we believe that our approach can be used as a powerful tool for the rational design of heterogeneous brittle solids and interfaces with tailored failure properties.

Geomagnetic Secular Variation Prediction with Thermal Heterogeneous Boundary Conditions

NASA Astrophysics Data System (ADS)

Kuang, W.; Tangborn, A.; Jiang, W.

2011-12-01

It has long been conjectured that thermal heterogeneity at the core-mantle boundary (CMB) affects the geodynamo substantially. The observed two pairs of steady and strong magnetic flux lobes near the Polar Regions and the low secular variation in the Pacific over the past 400 years (and perhaps longer) are likely the consequences of this CMB thermal heterogeneity. There are several studies on the impact of the thermal heterogeneity with numerical geodynamo simulations. However, direct correlation between the numerical results and the observations is found very difficult, except qualitative comparisons of certain features in the radial component of the magnetic field at the CMB. This makes it difficult to assess accurately the impact of thermal heterogeneity on the geodynamo and the geomagnetic secular variation. We revisit this problem with our MoSST_DAS system in which geomagnetic data are assimilated with our geodynamo model to predict geomagnetic secular variations. In this study, we implement a heterogeneous heat flux across the CMB that is chosen based on the seismic tomography of the lowermost mantle. The amplitude of the heat flux (relative to the mean heat flux across the CMB) varies in the simulation. With these assimilation studies, we will examine the influences of the heterogeneity on the forecast accuracies, e.g. the accuracies as functions of the heterogeneity amplitude. With these, we could be able to assess the model errors to the true core state, and thus the thermal heterogeneity in geodynamo modeling.

Single-molecule resolution of protein dynamics on polymeric membrane surfaces: the roles of spatial and population heterogeneity.

PubMed

Langdon, Blake B; Mirhossaini, Roya B; Mabry, Joshua N; Sriram, Indira; Lajmi, Ajay; Zhang, Yanxia; Rojas, Orlando J; Schwartz, Daniel K

2015-02-18

Although polymeric membranes are widely used in the purification of protein pharmaceuticals, interactions between biomolecules and membrane surfaces can lead to reduced membrane performance and damage to the product. In this study, single-molecule fluorescence microscopy provided direct observation of bovine serum albumin (BSA) and human monoclonal antibody (IgG) dynamics at the interface between aqueous buffer and polymeric membrane materials including regenerated cellulose and unmodified poly(ether sulfone) (PES) blended with either polyvinylpyrrolidone (PVP), polyvinyl acetate-co-polyvinylpyrrolidone (PVAc-PVP), or polyethylene glycol methacrylate (PEGM) before casting. These polymer surfaces were compared with model surfaces composed of hydrophilic bare fused silica and hydrophobic trimethylsilane-coated fused silica. At extremely dilute protein concentrations (10(-3)-10(-7) mg/mL), protein surface exchange was highly dynamic with protein monomers desorbing from the surface within ∼1 s after adsorption. Protein oligomers (e.g., nonspecific dimers, trimers, or larger aggregates), although less common, remained on the surface for 5 times longer than monomers. Using newly developed super-resolution methods, we could localize adsorption sites with ∼50 nm resolution and quantify the spatial heterogeneity of the various surfaces. On a small anomalous subset of the adsorption sites, proteins adsorbed preferentially and tended to reside for significantly longer times (i.e., on "strong" sites). Proteins resided for shorter times overall on surfaces that were more homogeneous and exhibited fewer strong sites (e.g., PVAc-PVP/PES). We propose that strong surface sites may nucleate protein aggregation, initiated preferentially by protein oligomers, and accelerate ultrafiltration membrane fouling. At high protein concentrations (0.3-1.0 mg/mL), fewer strong adsorption sites were observed, and surface residence times were reduced. This suggests that at high concentrations, adsorbed proteins block strong sites from further protein adsorption. Importantly, this demonstrates that strong binding sites can be modified by changing solution conditions. Membrane surfaces are intrinsically heterogeneous; by employing single-molecule techniques, we have provided a new framework for understanding protein interactions with such surfaces.

Linking potential heat source and sink to urban heat island: Heterogeneous effects of landscape pattern on land surface temperature.

PubMed

Li, Weifeng; Cao, Qiwen; Lang, Kun; Wu, Jiansheng

2017-05-15

Rapid urbanization has significantly contributed to the development of urban heat island (UHI). Regulating landscape composition and configuration would help mitigate the UHI in megacities. Taking Shenzhen, China, as a case study area, we defined heat source and heat sink and identified strong and weak sources as well as strong and weak sinks according to the natural and socioeconomic factors influencing land surface temperature (LST). Thus, the potential thermal contributions of heat source and heat sink patches were differentiated. Then, the heterogeneous effects of landscape pattern on LST were examined by using semiparametric geographically weighted regression (SGWR) models. The results showed that landscape composition has more significant effects on thermal environment than configuration. For a strong source, the percentage of patches has a positive impact on LST. Additionally, when mosaicked with some heat sink, even a small improvement in the degree of dispersion of a strong source helps to alleviate UHI. For a weak source, the percentage and density of patches have positive impacts on LST. For a strong sink, the percentage, density, and degree of aggregation of patches have negative impacts on LST. The effects of edge density and patch shape complexity vary spatially with the fragmentation of a strong sink. Similarly, the impacts of a weak sink are mainly exerted via the characteristics of percent, density, and shape complexity of patches. Copyright © 2017 Elsevier B.V. All rights reserved.

Guild-specific responses of avian species richness to LiDAR-derived habitat heterogeneity

USGS Publications Warehouse

Weisberg, Peter J.; Dilts, Thomas E.; Becker, Miles E.; Young, Jock S.; Wong-Kone, Diane C.; Newton, Wesley E.; Ammon, Elisabeth M.

2014-01-01

Ecological niche theory implies that more heterogeneous habitats have the potential to support greater biodiversity. Positive heterogeneity-diversity relationships have been found for most studies investigating animal taxa, although negative relationships also occur and the scale dependence of heterogeneity-diversity relationships is little known. We investigated multi-scale, heterogeneity-diversity relationships for bird communities in a semi-arid riparian landscape, using airborne LiDAR data to derive key measures of structural habitat complexity. Habitat heterogeneity-diversity relationships were generally positive, although the overall strength of relationships varied across avian life history guilds (R2 range: 0.03–0.41). Best predicted were the species richness indices of cavity nesters, habitat generalists, woodland specialists, and foliage foragers. Heterogeneity-diversity relationships were also strongly scale-dependent, with strongest associations at the 200-m scale (4 ha) and weakest associations at the 50-m scale (0.25 ha). Our results underscore the value of LiDAR data for fine-grained quantification of habitat structure, as well as the need for biodiversity studies to incorporate variation among life-history guilds and to simultaneously consider multiple guild functional types (e.g. nesting, foraging, habitat). Results suggest that certain life-history guilds (foliage foragers, cavity nesters, woodland specialists) are more susceptible than others (ground foragers, ground nesters, low nesters) to experiencing declines in local species richness if functional elements of habitat heterogeneity are lost. Positive heterogeneity-diversity relationships imply that riparian conservation efforts need to not only provide high-quality riparian habitat locally, but also to provide habitat heterogeneity across multiple scales.

Guild-specific responses of avian species richness to LiDAR-derived habitat heterogeneity

NASA Astrophysics Data System (ADS)

Weisberg, Peter J.; Dilts, Thomas E.; Becker, Miles E.; Young, Jock S.; Wong-Kone, Diane C.; Newton, Wesley E.; Ammon, Elisabeth M.

2014-08-01

Ecological niche theory implies that more heterogeneous habitats have the potential to support greater biodiversity. Positive heterogeneity-diversity relationships have been found for most studies investigating animal taxa, although negative relationships also occur and the scale dependence of heterogeneity-diversity relationships is little known. We investigated multi-scale, heterogeneity-diversity relationships for bird communities in a semi-arid riparian landscape, using airborne LiDAR data to derive key measures of structural habitat complexity. Habitat heterogeneity-diversity relationships were generally positive, although the overall strength of relationships varied across avian life history guilds (R2 range: 0.03-0.41). Best predicted were the species richness indices of cavity nesters, habitat generalists, woodland specialists, and foliage foragers. Heterogeneity-diversity relationships were also strongly scale-dependent, with strongest associations at the 200-m scale (4 ha) and weakest associations at the 50-m scale (0.25 ha). Our results underscore the value of LiDAR data for fine-grained quantification of habitat structure, as well as the need for biodiversity studies to incorporate variation among life-history guilds and to simultaneously consider multiple guild functional types (e.g. nesting, foraging, habitat). Results suggest that certain life-history guilds (foliage foragers, cavity nesters, woodland specialists) are more susceptible than others (ground foragers, ground nesters, low nesters) to experiencing declines in local species richness if functional elements of habitat heterogeneity are lost. Positive heterogeneity-diversity relationships imply that riparian conservation efforts need to not only provide high-quality riparian habitat locally, but also to provide habitat heterogeneity across multiple scales.

Mesoscale Computational Investigation of Shocked Heterogeneous Materials with Application to Large Impact Craters

NASA Technical Reports Server (NTRS)

Crawford, D. A.; Barnouin-Jha, O. S.; Cintala, M. J.

2003-01-01

The propagation of shock waves through target materials is strongly influenced by the presence of small-scale structure, fractures, physical and chemical heterogeneities. Pre-existing fractures often create craters that appear square in outline (e.g. Meteor Crater). Reverberations behind the shock from the presence of physical heterogeneity have been proposed as a mechanism for transient weakening of target materials. Pre-existing fractures can also affect melt generation. In this study, we are attempting to bridge the gap in numerical modeling between the micro-scale and the continuum, the so-called meso-scale. To accomplish this, we are developing a methodology to be used in the shock physics hydrocode (CTH) using Monte-Carlo-type methods to investigate the shock properties of heterogeneous materials. By comparing the results of numerical experiments at the micro-scale with experimental results and by using statistical techniques to evaluate the performance of simple constitutive models, we hope to embed the effect of physical heterogeneity into the field variables (pressure, stress, density, velocity) allowing us to directly imprint the effects of micro-scale heterogeneity at the continuum level without incurring high computational cost.

Reporting heterogeneity in self-assessed health among elderly Europeans.

PubMed

Pfarr, Christian; Schmid, Andreas; Schneider, Udo

2012-10-05

Self-assessed health (SAH) is a frequently used measure of individuals' health status. It is also prone to reporting heterogeneity. To control for reporting heterogeneity objective measures of true health need to be included in an analysis. The topic becomes even more complex for cross-country comparisons, as many key variables tend to vary strongly across countries, influenced by cultural and institutional differences. This study aims at exploring the key drivers for reporting heterogeneity in SAH in an international context. To this end, country specific effects are accounted for and the objective health measure is concretized, distinguishing effects of mental and physical health conditions. We use panel data from the SHARE-project which provides a rich dataset on the elderly European population. To obtain distinct indicators for physical and mental health conditions two indices are constructed. Finally, to identify potential reporting heterogeneity in SAH a generalized ordered probit model is estimated. We find evidence that in addition to health behaviour, health care utilization, mental and physical health condition as well as country characteristics affect reporting behaviour. We conclude that observed and unobserved heterogeneity play an important role when analysing SAH and have to be taken into account.

Convergence and divergence in gesture repertoires as an adaptive mechanism for social bonding in primates.

PubMed

Roberts, Anna Ilona; Roberts, Sam George Bradley

2017-11-01

A key challenge for primates living in large, stable social groups is managing social relationships. Chimpanzee gestures may act as a time-efficient social bonding mechanism, and the presence (homogeneity) and absence (heterogeneity) of overlap in repertoires in particular may play an important role in social bonding. However, how homogeneity and heterogeneity in the gestural repertoire of primates relate to social interaction is poorly understood. We used social network analysis and generalized linear mixed modelling to examine this question in wild chimpanzees. The repertoire size of both homogeneous and heterogeneous visual, tactile and auditory gestures was associated with the duration of time spent in social bonding behaviour, centrality in the social bonding network and demography. The audience size of partners who displayed similar or different characteristics to the signaller (e.g. same or opposite age or sex category) also influenced the use of homogeneous and heterogeneous gestures. Homogeneous and heterogeneous gestures were differentially associated with the presence of emotional reactions in response to the gesture and the presence of a change in the recipient's behaviour. Homogeneity and heterogeneity of gestural communication play a key role in maintaining a differentiated set of strong and weak social relationships in complex, multilevel societies.

A new approach to tracer transport analysis: From fracture systems to strongly heterogeneous porous media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsang, Chin-Fu

Many current development and utilization of groundwater resources include a study of their flow and transport properties. These properties are needed in evaluating possible changes in groundwater quality and potential transport of hazardous solutes through the groundwater system. Investigation of transport properties of fractured rocks is an active area of research. Most of the current approaches to the study of flow and transport in fractured rocks cannot be easily used for analysis of tracer transport field data. A new approach is proposed based on a detailed study of transport through a fracture of variable aperture. This is a two-dimensional stronglymore » heterogeneous permeable system. It is suggested that tracer breakthrough curves can be analyzed based on an aperture or permeability probability distribution function that characterizes the tracer flow through the fracture. The results are extended to a multi-fracture system and can be equally applied to a strongly heterogeneous porous medium. Finally, the need for multi-point or line and areal tracer injection and observation tests is indicated as a way to avoid the sensitive dependence of point measurements on local permeability variability. 30 refs., 15 figs.« less

Stochasticity versus determinism: consequences for realistic gene regulatory network modelling and evolution.

PubMed

Jenkins, Dafyd J; Stekel, Dov J

2010-02-01

Gene regulation is one important mechanism in producing observed phenotypes and heterogeneity. Consequently, the study of gene regulatory network (GRN) architecture, function and evolution now forms a major part of modern biology. However, it is impossible to experimentally observe the evolution of GRNs on the timescales on which living species evolve. In silico evolution provides an approach to studying the long-term evolution of GRNs, but many models have either considered network architecture from non-adaptive evolution, or evolution to non-biological objectives. Here, we address a number of important modelling and biological questions about the evolution of GRNs to the realistic goal of biomass production. Can different commonly used simulation paradigms, in particular deterministic and stochastic Boolean networks, with and without basal gene expression, be used to compare adaptive with non-adaptive evolution of GRNs? Are these paradigms together with this goal sufficient to generate a range of solutions? Will the interaction between a biological goal and evolutionary dynamics produce trade-offs between growth and mutational robustness? We show that stochastic basal gene expression forces shrinkage of genomes due to energetic constraints and is a prerequisite for some solutions. In systems that are able to evolve rates of basal expression, two optima, one with and one without basal expression, are observed. Simulation paradigms without basal expression generate bloated networks with non-functional elements. Further, a range of functional solutions was observed under identical conditions only in stochastic networks. Moreover, there are trade-offs between efficiency and yield, indicating an inherent intertwining of fitness and evolutionary dynamics.

Ship Detection from Ocean SAR Image Based on Local Contrast Variance Weighted Information Entropy

PubMed Central

Huang, Yulin; Pei, Jifang; Zhang, Qian; Gu, Qin; Yang, Jianyu

2018-01-01

Ship detection from synthetic aperture radar (SAR) images is one of the crucial issues in maritime surveillance. However, due to the varying ocean waves and the strong echo of the sea surface, it is very difficult to detect ships from heterogeneous and strong clutter backgrounds. In this paper, an innovative ship detection method is proposed to effectively distinguish the vessels from complex backgrounds from a SAR image. First, the input SAR image is pre-screened by the maximally-stable extremal region (MSER) method, which can obtain the ship candidate regions with low computational complexity. Then, the proposed local contrast variance weighted information entropy (LCVWIE) is adopted to evaluate the complexity of those candidate regions and the dissimilarity between the candidate regions with their neighborhoods. Finally, the LCVWIE values of the candidate regions are compared with an adaptive threshold to obtain the final detection result. Experimental results based on measured ocean SAR images have shown that the proposed method can obtain stable detection performance both in strong clutter and heterogeneous backgrounds. Meanwhile, it has a low computational complexity compared with some existing detection methods. PMID:29652863

Density Scaling of Glassy Dynamics and Dynamic Heterogeneities in Glass-forming Liquids.

NASA Astrophysics Data System (ADS)

Hu, Yuan-Chao; Yang, Yong; Wang, Wei-Hua

The discovery of density scaling in strongly correlating systems is an important progress for understanding the dynamic behaviors of supercooled liquids. Here we found for a ternary metallic glass-forming liquid, it is not strongly correlating thermodynamically, but its average dynamics, dynamic heterogeneities and static structure are still well described by density scaling with the same scaling exponent γ. As an intrinsic material constant stemming from the fundamental interatomic interactions, γ is theoretically predicted from the thermodynamic fluctuations of potential energy and the virial. Although γ is conventionally understood merely from the repulsive part of the inter-particle potentials, the strong correlation between γ and the Grüneisen parameter up to the accuracy of the Dulong-Petit approximation demonstrates the important roles of anharmonicity and attractive force of the interatomic potential in governing glass transition of metallic glass-formers. The supercooled dynamics and density scaling behaviors will also be discussed in model glass-forming liquids with tunable attractive potentials to further quantify the nonperturbative roles of attractive interactions. We acknowledge the support from ''Peter Ho Conference Scholarships'' of City University of Hong Kong.

Optimized ECC Implementation for Secure Communication between Heterogeneous IoT Devices.

PubMed

Marin, Leandro; Pawlowski, Marcin Piotr; Jara, Antonio

2015-08-28

The Internet of Things is integrating information systems, places, users and billions of constrained devices into one global network. This network requires secure and private means of communications. The building blocks of the Internet of Things are devices manufactured by various producers and are designed to fulfil different needs. There would be no common hardware platform that could be applied in every scenario. In such a heterogeneous environment, there is a strong need for the optimization of interoperable security. We present optimized elliptic curve Cryptography algorithms that address the security issues in the heterogeneous IoT networks. We have combined cryptographic algorithms for the NXP/Jennic 5148- and MSP430-based IoT devices and used them to created novel key negotiation protocol.

Heterogeneous Organo-Catalysis: Sustainable Pathways to ...

EPA Pesticide Factsheets

Glucose and fructose are among the most abundant plant-derived materials1 and have been converted into useful building units often used in the drug discovery and polymer architecture.2 Unfortunately, most of these conversions require mineral acids and complex heterogeneous catalysis systems which suffer from the diminished activity and recyclability issues.3 Herein, we report a highly reactive and inexpensive heterogeneous sulfonated graphitic carbon nitride (Sg-CN), endowed with strong acidity that readily transforms carbohydrates to furanics. The ready availability and benign nature of the material and its stability over the several reaction cycles renders this catalyst very useful in organic synthesis, polymer industry and in the preparation of drug precursors. Poster presentation at the 253rd American Chemical Society (ACS) National meeting in San Francisco, CA

Examining the Heterogeneous Genome Content of Multipartite Viruses BMV and CCMV by Native Mass Spectrometry

NASA Astrophysics Data System (ADS)

van de Waterbeemd, Michiel; Snijder, Joost; Tsvetkova, Irina B.; Dragnea, Bogdan G.; Cornelissen, Jeroen J.; Heck, Albert J. R.

2016-06-01

Since the concept was first introduced by Brian Chait and co-workers in 1991, mass spectrometry of proteins and protein complexes under non-denaturing conditions (native MS) has strongly developed, through parallel advances in instrumentation, sample preparation, and data analysis tools. However, the success rate of native MS analysis, particularly in heterogeneous mega-Dalton (MDa) protein complexes, still strongly depends on careful instrument modification. Here, we further explore these boundaries in native mass spectrometry, analyzing two related endogenous multipartite viruses: the Brome Mosaic Virus (BMV) and the Cowpea Chlorotic Mottle Virus (CCMV). Both CCMV and BMV are approximately 4.6 megadalton (MDa) in mass, of which approximately 1 MDA originates from the genomic content of the virion. Both viruses are produced as mixtures of three particles carrying different segments of the genome, varying by approximately 0.1 MDA in mass (~2%). This mixture of particles poses a challenging analytical problem for high-resolution native MS analysis, given the large mass scales involved. We attempt to unravel the particle heterogeneity using both Q-TOF and Orbitrap mass spectrometers extensively modified for analysis of very large assemblies. We show that manipulation of the charging behavior can provide assistance in assigning the correct charge states. Despite their challenging size and heterogeneity, we obtained native mass spectra with resolved series of charge states for both BMV and CCMV, demonstrating that native MS of endogenous multipartite virions is feasible.

Calibration of an Unsteady Groundwater Flow Model for a Complex, Strongly Heterogeneous Aquifer

NASA Astrophysics Data System (ADS)

Curtis, Z. K.; Liao, H.; Li, S. G.; Phanikumar, M. S.; Lusch, D.

2016-12-01

Modeling of groundwater systems characterized by complex three-dimensional structure and heterogeneity remains a significant challenge. Most of today's groundwater models are developed based on relatively simple conceptual representations in favor of model calibratibility. As more complexities are modeled, e.g., by adding more layers and/or zones, or introducing transient processes, more parameters have to be estimated and issues related to ill-posed groundwater problems and non-unique calibration arise. Here, we explore the use of an alternative conceptual representation for groundwater modeling that is fully three-dimensional and can capture complex 3D heterogeneity (both systematic and "random") without over-parameterizing the aquifer system. In particular, we apply Transition Probability (TP) geostatistics on high resolution borehole data from a water well database to characterize the complex 3D geology. Different aquifer material classes, e.g., `AQ' (aquifer material), `MAQ' (marginal aquifer material'), `PCM' (partially confining material), and `CM' (confining material), are simulated, with the hydraulic properties of each material type as tuning parameters during calibration. The TP-based approach is applied to simulate unsteady groundwater flow in a large, complex, and strongly heterogeneous glacial aquifer system in Michigan across multiple spatial and temporal scales. The resulting model is calibrated to observed static water level data over a time span of 50 years. The results show that the TP-based conceptualization enables much more accurate and robust calibration/simulation than that based on conventional deterministic layer/zone based conceptual representations.

Ferromagnetic transition in a simple variant of the Ising model on multiplex networks

NASA Astrophysics Data System (ADS)

Krawiecki, A.

2018-02-01

Multiplex networks consist of a fixed set of nodes connected by several sets of edges which are generated separately and correspond to different networks ("layers"). Here, a simple variant of the Ising model on multiplex networks with two layers is considered, with spins located in the nodes and edges corresponding to ferromagnetic interactions between them. Critical temperatures for the ferromagnetic transition are evaluated for the layers in the form of random Erdös-Rényi graphs or heterogeneous scale-free networks using the mean-field approximation and the replica method, from the replica symmetric solution. Both methods require the use of different "partial" magnetizations, associated with different layers of the multiplex network, and yield qualitatively similar results. If the layers are strongly heterogeneous the critical temperature differs noticeably from that for the Ising model on a network being a superposition of the two layers, evaluated in the mean-field approximation neglecting the effect of the underlying multiplex structure on the correlations between the degrees of nodes. The critical temperature evaluated from the replica symmetric solution depends sensitively on the correlations between the degrees of nodes in different layers and shows satisfactory quantitative agreement with that obtained from Monte Carlo simulations. The critical behavior of the magnetization for the model with strongly heterogeneous layers can depend on the distributions of the degrees of nodes and is then determined by the properties of the most heterogeneous layer.

Multiple recharge processes to heterogeneous Mediterranean coastal aquifers and implications on recharge rates evolution in time

NASA Astrophysics Data System (ADS)

Santoni, S.; Huneau, F.; Garel, E.; Celle-Jeanton, H.

2018-04-01

Climate change is nowadays widely considered to have major effects on groundwater resources. Climatic projections suggest a global increase in evaporation and higher frequency of strong rainfall events especially in Mediterranean context. Since evaporation is synonym of low recharge conditions whereas strong rainfall events are more favourable to recharge in heterogeneous subsurface contexts, a lack of knowledge remains then on the real ongoing and future drinking groundwater supply availability at aquifers scale. Due to low recharge potential and high inter-annual climate variability, this issue is strategic for the Mediterranean hydrosystems. This is especially the case for coastal aquifers because they are exposed to seawater intrusion, sea-level rise and overpumping risks. In this context, recharge processes and rates were investigated in a Mediterranean coastal aquifer with subsurface heterogeneity located in Southern Corsica (France). Aquifer recharge rates from combining ten physical and chemical methods were computed. In addition, hydrochemical and isotopic investigations were carried out through a monthly two years monitoring combining major ions and stable isotopes of water in rain, runoff and groundwater. Diffuse, focused, lateral mountain system and irrigation recharge processes were identified and characterized. A predominant focused recharge conditioned by subsurface heterogeneity is evidenced in agreement with variable but highly favourable recharge rates. The fast water transfer from the surface to the aquifer implied by this recharge process suggests less evaporation, which means higher groundwater renewal and availability in such Mediterranean coastal aquifers.

Overload cascading failure on complex networks with heterogeneous load redistribution

NASA Astrophysics Data System (ADS)

Hou, Yueyi; Xing, Xiaoyun; Li, Menghui; Zeng, An; Wang, Yougui

2017-09-01

Many real systems including the Internet, power-grid and financial networks experience rare but large overload cascading failures triggered by small initial shocks. Many models on complex networks have been developed to investigate this phenomenon. Most of these models are based on the load redistribution process and assume that the load on a failed node shifts to nearby nodes in the networks either evenly or according to the load distribution rule before the cascade. Inspired by the fact that real power-grid tends to place the excess load on the nodes with high remaining capacities, we study a heterogeneous load redistribution mechanism in a simplified sandpile model in this paper. We find that weak heterogeneity in load redistribution can effectively mitigate the cascade while strong heterogeneity in load redistribution may even enlarge the size of the final failure. With a parameter θ to control the degree of the redistribution heterogeneity, we identify a rather robust optimal θ∗ = 1. Finally, we find that θ∗ tends to shift to a larger value if the initial sand distribution is homogeneous.

Spatially: resolved heterogeneous dynamics in a strong colloidal gel

NASA Astrophysics Data System (ADS)

Buzzaccaro, Stefano; Alaimo, Matteo David; Secchi, Eleonora; Piazza, Roberto

2015-05-01

We re-examine the classical problem of irreversible colloid aggregation, showing that the application of Digital Fourier Imaging (DFI), a class of optical correlation methods that combine the power of light scattering and imaging, allows one to pick out novel useful evidence concerning the restructuring processes taking place in a strong colloidal gel. In particular, the spatially-resolved displacement fields provided by DFI strongly suggest that the temporally-intermittent local rearrangements taking place in the course of gel ageing are characterized by very long-ranged spatial correlations.

On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mikhailov, Kirill A; Raigorodskii, Andrei M

2009-12-31

A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles.

Representing Network Trust and Using It to Improve Anonymous Communication

DTIC Science & Technology

2014-07-01

identified by that behavior . References 1. Augustin, B., Krishnamurthy, B., Willinger, W.: IXPs: Mapped? In: Internet Mea- surement Conference ( IMC ’09...empty attributes (e.g., labeling countries by their larger geographic region). The user’s beliefs may incorporate boolean predicates that are evaluated on...and behaviors are. The most useful information about Tor relays for setting a default level of trust is probably relay longevity. Running a relay in

Co Modeling and Co Synthesis of Safety Critical Multi threaded Embedded Software for Multi Core Embedded Platforms

DTIC Science & Technology

2017-03-20

computation, Prime Implicates, Boolean Abstraction, real- time embedded software, software synthesis, correct by construction software design , model...types for time -dependent data-flow networks". J.-P. Talpin, P. Jouvelot, S. Shukla. ACM-IEEE Conference on Methods and Models for System Design ...information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing   data sources, gathering and

Integrated-Circuit Pseudorandom-Number Generator

NASA Technical Reports Server (NTRS)

Steelman, James E.; Beasley, Jeff; Aragon, Michael; Ramirez, Francisco; Summers, Kenneth L.; Knoebel, Arthur

1992-01-01

Integrated circuit produces 8-bit pseudorandom numbers from specified probability distribution, at rate of 10 MHz. Use of Boolean logic, circuit implements pseudorandom-number-generating algorithm. Circuit includes eight 12-bit pseudorandom-number generators, outputs are uniformly distributed. 8-bit pseudorandom numbers satisfying specified nonuniform probability distribution are generated by processing uniformly distributed outputs of eight 12-bit pseudorandom-number generators through "pipeline" of D flip-flops, comparators, and memories implementing conditional probabilities on zeros and ones.

The phase topology of a special case of Goryachev integrability in rigid body dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ryabov, P. E., E-mail: orelryabov@mail.ru

2014-07-31

The phase topology of a special case of Goryachev integrability in the problem of motion of a rigid body in a fluid is investigated using the method of Boolean functions, which was developed by Kharlamov for algebraically separated systems. The bifurcation diagram of the moment map is found and the Fomenko invariant, which classifies the systems up to rough Liouville equivalence, is specified. Bibliography: 15 titles. (paper)

Logic, Probability, and Human Reasoning

DTIC Science & Technology

2015-01-01

Reasoning with exceptions: an event-related brain potentials study. J. Cogn . Neurosci . 23, 471 480 40 Baggio, G. et al. (2014) Logic as Marr’s...Johnson-Laird, P.N. (2013) Strategic changes in problem solving. J. Cogn . Psychol. 25, 165 173 5 Khemlani, S.S. et al. (2013) Kinematic mental simulations...and its application to Boolean systems. J. Cogn . Psychol. 25, 365 389 7 Beth, E.W. and Piaget, J. (1966) Mathematical Epistemology and Psychology

JPRS Report, Science & Technology. China.

DTIC Science & Technology

1989-03-29

Commun ., Vol COM-29, No 6, pp 895-901, June 1981. [4] R.C. Titsworth , "A Boolean-Function-Multiplexed Telemetry System," IEEE Trans, on SET, pp 42...Reagents 39 Gene-Engineered Human Epithelium Growth Factor (hEGF) 39 Superfine Snake Venom 39 COMPUTERS Ai Computer System LISP-MI [Zheng Shouqi, et...XUEBAO, No 3, Jun 88] 134 Coordinated Development of Microwave, Optical Communications [Zhang Xu; DIANXIN KUAIBAO, No 11, Nov 88] 143 Error

An optical deoxyribonucleic acid-based half-subtractor.

PubMed

Yang, Chia-Ning; Chen, Yi-Li; Lin, Hung-Yin; Hsu, Chun-Yu

2013-10-09

This study introduces an optical DNA-based logic circuit that mimics a half-subtractor. The system contains an Au-surface immobilized molecular-beacon molecule that serves as a dual-gate molecule and outputs two series of fluorescence signals following Boolean INH and XOR patterns after interacting with one or two single-stranded DNA molecules as input. To the best of our knowledge, the system reported herein is rather concise compared to other molecular logic gate systems.

Novel Prostate Cancer Pathway Modeling using Boolean Implication

DTIC Science & Technology

2012-09-01

cause of cancer deaths in men. Diagnosis and pathogenesis of this disease is poorly understood. Prostate specific antigen (PSA) test is still the... specific database, I combined 14 different datasets (global prostate cancer database, total n=891) that are in Affymetrix U133A (n=456), U133A 2.0...immunohistochemistry and flow cytometry are limited by the availability of antigen - specific monoclonal antibodies and by the small number of parallel

Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer

DTIC Science & Technology

2012-03-01

and Budget, Paperwork Reduction Project (0704-0188) Washington DC 20503. 1. AGENCY USE ONLY (Leave blank) 2 . REPORT DATE March 2012 3. REPORT... CA 93943-5000 8. PERFORMING ORGANIZATION REPORT NUMBER 9. SPONSORING /MONITORING AGENCY NAME(S) AND ADDRESS(ES) N/A 10. SPONSORING...developed for this conversion. This reduced form requires many fewer gates and has ( )n delay versus ( 2 ) n delay for a full transeunt triangle

Effect of matrix chemical heterogeneity on effective filler interactions in model polymer nanocomposites

NASA Astrophysics Data System (ADS)

Hall, Lisa; Schweizer, Kenneth

2010-03-01

The microscopic Polymer Reference Interaction Site Model theory has been applied to spherical and rodlike fillers dissolved in three types of chemically heterogeneous polymer melts: alternating AB copolymer, random AB copolymers, and an equimolar blend of two homopolymers. In each case, one monomer species adsorbs more strongly on the filler mimicking a specific attraction, while all inter-monomer potentials are hard core which precludes macrophase or microphase separation. Qualitative differences in the filler potential-of-mean force are predicted relative to the homopolymer case. The adsorbed bound layer for alternating copolymers exhibits a spatial moduluation or layering effect but is otherwise similar to that of the homopolymer system. Random copolymers and the polymer blend mediate a novel strong, long-range bridging interaction between fillers at moderate to high adsorption strengths. The bridging strength is a non-monotonic function of random copolymer composition, reflecting subtle competing enthalpic and entropic considerations.

Effects of physical and geochemical heterogeneities on mineral transformation and biomass accumulation during biostimulation experiments at Rifle, Colorado.

PubMed

Li, Li; Steefel, Carl I; Kowalsky, Michael B; Englert, Andreas; Hubbard, Susan S

2010-03-01

Electron donor amendment for bioremediation often results in precipitation of secondary minerals and the growth of biomass, both of which can potentially change flow paths and the efficacy of bioremediation. Quantitative estimation of precipitate and biomass distribution has remained challenging, partly due to the intrinsic heterogeneities of natural porous media and the scarcity of field data. In this work, we examine the effects of physical and geochemical heterogeneities on the spatial distributions of mineral precipitates and biomass accumulated during a biostimulation field experiment near Rifle, Colorado. Field bromide breakthrough data were used to infer a heterogeneous distribution of hydraulic conductivity through inverse transport modeling, while the solid phase Fe(III) content was determined by assuming a negative correlation with hydraulic conductivity. Validated by field aqueous geochemical data, reactive transport modeling was used to explicitly keep track of the growth of the biomass and to estimate the spatial distribution of precipitates and biomass. The results show that the maximum mineral precipitation and biomass accumulation occurs in the vicinity of the injection wells, occupying up to 5.4vol.% of the pore space, and is dominated by reaction products of sulfate reduction. Accumulation near the injection wells is not strongly affected by heterogeneities present in the system due to the ubiquitous presence of sulfate in the groundwater. However, accumulation in the down-gradient regions is dominated by the iron-reducing reaction products, whose spatial patterns are strongly controlled by both physical and geochemical heterogeneities. Heterogeneities can lead to localized large accumulation of mineral precipitates and biomass, increasing the possibility of pore clogging. Although ignoring the heterogeneities of the system can lead to adequate prediction of the average behavior of sulfate-reducing related products, it can also lead to an overestimation of the overall accumulation of iron-reducing bacteria, as well as the rate and extent of iron reduction. Surprisingly, the model predicts that the total amount of uranium being reduced in the heterogeneous 2D system was similar to that in the 1D homogeneous system, suggesting that the overall uranium bioremediation efficacy may not be significantly affected by the heterogeneities of Fe(III) content in the down-gradient regions. Rather, the characteristics close to the vicinity of the injection wells might be crucial in determining the overall efficacy of uranium bioremediation. These findings have important implications not only for uranium bioremediation at the Rifle site and for bioremediation of other redox sensitive contaminants at sites with similar characteristics, but also for the development of optimal amendment delivery strategies in other settings. Copyright 2009 Elsevier B.V. All rights reserved.

Constraints on small-scale heterogeneity in the lowermost mantle from observations of near podal PcP precursors

NASA Astrophysics Data System (ADS)

Zhang, Baolong; Ni, Sidao; Sun, Daoyuan; Shen, Zhichao; Jackson, Jennifer M.; Wu, Wenbo

2018-05-01

Volumetric heterogeneities on large (∼>1000 km) and intermediate scales (∼>100 km) in the lowermost mantle have been established with seismological approaches. However, there are controversies regarding the level of heterogeneity in the lowermost mantle at small scales (a few kilometers to tens of kilometers), with lower bound estimates ranging from 0.1% to a few percent. We take advantage of the small amplitude PcP waves at near podal distances (0-12°) to constrain the level of small-scale heterogeneity within 250 km above the CMB. First, we compute short period synthetic seismograms with a finite difference code for a series of volumetric heterogeneity models in the lowermost mantle, and find that PcP is not identifiable if the small-scale heterogeneity in the lowermost mantle is above 2.5%. We then use a functional form appropriate for coda decay to suppress P coda contamination. By comparing the corrected envelope of PcP and its precursors with synthetic seismograms, we find that perturbations of small-scale (∼8 km) heterogeneity in the lowermost mantle is ∼0.2-0.5% beneath regions of the China-Myanmar border area, Okhotsk Sea and South America. Whereas strong perturbations (∼1.0%) are found beneath Central America. In the regions studied, we find that this particular type of small-scale heterogeneity in the lowermost mantle is weak, yet there are some regions requiring heterogeneity up to 1.0%. Where scattering is stronger, such as under Central America, more chemically complex mineral assemblages may be present at the core-mantle boundary.

Spatial heterogeneity study of vegetation coverage at Heihe River Basin

NASA Astrophysics Data System (ADS)

Wu, Lijuan; Zhong, Bo; Guo, Liyu; Zhao, Xiangwei

2014-11-01

Spatial heterogeneity of the animal-landscape system has three major components: heterogeneity of resource distributions in the physical environment, heterogeneity of plant tissue chemistry, heterogeneity of movement modes by the animal. Furthermore, all three different types of heterogeneity interact each other and can either reinforce or offset one another, thereby affecting system stability and dynamics. In previous studies, the study areas are investigated by field sampling, which costs a large amount of manpower. In addition, uncertain in sampling affects the quality of field data, which leads to unsatisfactory results during the entire study. In this study, remote sensing data is used to guide the sampling for research on heterogeneity of vegetation coverage to avoid errors caused by randomness of field sampling. Semi-variance and fractal dimension analysis are used to analyze the spatial heterogeneity of vegetation coverage at Heihe River Basin. The spherical model with nugget is used to fit the semivariogram of vegetation coverage. Based on the experiment above, it is found, (1)there is a strong correlation between vegetation coverage and distance of vegetation populations within the range of 0-28051.3188m at Heihe River Basin, but the correlation loses suddenly when the distance greater than 28051.3188m. (2)The degree of spatial heterogeneity of vegetation coverage at Heihe River Basin is medium. (3)Spatial distribution variability of vegetation occurs mainly on small scales. (4)The degree of spatial autocorrelation is 72.29% between 25% and 75%, which means that spatial correlation of vegetation coverage at Heihe River Basin is medium high.

Ventilation heterogeneity is a major determinant of airway hyperresponsiveness in asthma, independent of airway inflammation

PubMed Central

Downie, Sue R; Salome, Cheryl M; Verbanck, Sylvia; Thompson, Bruce; Berend, Norbert; King, Gregory G

2007-01-01

Background Airway hyperresponsiveness is the ability of airways to narrow excessively in response to inhaled stimuli and is a key feature of asthma. Airway inflammation and ventilation heterogeneity have been separately shown to be associated with airway hyperresponsiveness. A study was undertaken to establish whether ventilation heterogeneity is associated with airway hyperresponsiveness independently of airway inflammation in subjects with asthma and to determine the effect of inhaled corticosteroids on this relationship. Methods Airway inflammation was measured in 40 subjects with asthma by exhaled nitric oxide, ventilation heterogeneity by multiple breath nitrogen washout and airway hyperresponsiveness by methacholine challenge. In 18 of these subjects with uncontrolled symptoms, measurements were repeated after 3 months of treatment with inhaled beclomethasone dipropionate. Results At baseline, airway hyperresponsiveness was independently predicted by airway inflammation (partial r2 = 0.20, p<0.001) and ventilation heterogeneity (partial r2 = 0.39, p<0.001). Inhaled corticosteroid treatment decreased airway inflammation (p = 0.002), ventilation heterogeneity (p = 0.009) and airway hyperresponsiveness (p<0.001). After treatment, ventilation heterogeneity was the sole predictor of airway hyperresponsiveness (r2 = 0.64, p<0.001). Conclusions Baseline ventilation heterogeneity is a strong predictor of airway hyperresponsiveness, independent of airway inflammation in subjects with asthma. Its persistent relationship with airway hyperresponsiveness following anti‐inflammatory treatment suggests that it is an important independent determinant of airway hyperresponsiveness. Normalisation of ventilation heterogeneity is therefore a potential goal of treatment that may lead to improved long‐term outcomes. PMID:17311839

[Living donors for kidney transplantation: ethical and legal challenges].

PubMed

Mamzer-Bruneel, Marie-France; Fournier, Catherine; Legendre, Christophe

2010-05-01

Living donor kidney transplantation has developed very heterogeneously worldwide despite excellent results and without taking into account the context of global organ shortage. Such a heterogeneity highlights persistent ethical issues, whereas organ trafficking is emerging as an organized transplant tourism reinforcing the need for strong national legal frameworks. Despite its powerful regulation system, which ensures standardization, transparency and accountability of support for donation, France remains reluctant to enlarge the circle of legal donors, whereas it would be the first step to give a greater role to living organ donation.

Oblique contractional reactivation of inherited heterogeneities: Cause for arcuate orogens

PubMed Central

Sokoutis, D.; Willingshofer, E.; Brun, J.‐P.; Gueydan, F.; Cloetingh, S.

2017-01-01

Abstract We use lithospheric‐scale analog models to study the reactivation of pre‐existing heterogeneities under oblique shortening and its relation to the origin of arcuate orogens. Reactivation of inherited rheological heterogeneities is an important mechanism for localization of deformation in compressional settings and consequent initiation of contractional structures during orogenesis. However, the presence of an inherited heterogeneity in the lithosphere is in itself not sufficient for its reactivation once the continental lithosphere is shortened. The heterogeneity orientation is important in determining if reactivation occurs and to which extent. This study aims at giving insights on this process by means of analog experiments in which a linear lithospheric heterogeneity trends with various angles to the shortening direction. In particular, the key parameter investigated is the orientation (angle α) of a strong domain (SD) with respect to the shortening direction. Experimental results show that angles α ≥ 75° (high obliquity) allow for reactivation along the entire SD and the development of a linear orogen. For α ≤ 60° (low obliquity) the models are characterized by the development of an arcuate orogen, with the SD remaining partially non‐reactivated. These results provide a new mechanism for the origin of some arcuate orogens, in which orocline formation was not driven by indentation or subduction processes, but by oblique shortening of inherited heterogeneities, as exemplified by the Ouachita orogen of the southern U.S. PMID:28670046

Controlling false-negative errors in microarray differential expression analysis: a PRIM approach.

PubMed

Cole, Steve W; Galic, Zoran; Zack, Jerome A

2003-09-22

Theoretical considerations suggest that current microarray screening algorithms may fail to detect many true differences in gene expression (Type II analytic errors). We assessed 'false negative' error rates in differential expression analyses by conventional linear statistical models (e.g. t-test), microarray-adapted variants (e.g. SAM, Cyber-T), and a novel strategy based on hold-out cross-validation. The latter approach employs the machine-learning algorithm Patient Rule Induction Method (PRIM) to infer minimum thresholds for reliable change in gene expression from Boolean conjunctions of fold-induction and raw fluorescence measurements. Monte Carlo analyses based on four empirical data sets show that conventional statistical models and their microarray-adapted variants overlook more than 50% of genes showing significant up-regulation. Conjoint PRIM prediction rules recover approximately twice as many differentially expressed transcripts while maintaining strong control over false-positive (Type I) errors. As a result, experimental replication rates increase and total analytic error rates decline. RT-PCR studies confirm that gene inductions detected by PRIM but overlooked by other methods represent true changes in mRNA levels. PRIM-based conjoint inference rules thus represent an improved strategy for high-sensitivity screening of DNA microarrays. Freestanding JAVA application at http://microarray.crump.ucla.edu/focus

Emerging Utility of Virtual Reality as a Multidisciplinary Tool in Clinical Medicine.

PubMed

Pourmand, Ali; Davis, Steven; Lee, Danny; Barber, Scott; Sikka, Neal

2017-10-01

Among the more recent products borne of the evolution of digital technology, virtual reality (VR) is gaining a foothold in clinical medicine as an adjunct to traditional therapies. Early studies suggest a growing role for VR applications in pain management, clinical skills training, cognitive assessment and cognitive therapy, and physical rehabilitation. To complete a review of the literature, we searched PubMed and MEDLINE databases with the following search terms: "virtual reality," "procedural medicine," "oncology," "physical therapy," and "burn." We further limited our search to publications in the English language. Boolean operators were used to combine search terms. The included search terms yielded 97 potential articles, of which 45 were identified as meeting study criteria, and are included in this review. These articles provide data, which strongly support the hypothesis that VR simulations can enhance pain management (by reducing patient perception of pain and anxiety), can augment clinical training curricula and physical rehabilitation protocols (through immersive audiovisual environments), and can improve clinical assessment of cognitive function (through improved ecological validity). Through computer-generated, life-like digital landscapes, VR stands to change the current approach to pain management, medical training, neurocognitive diagnosis, and physical rehabilitation. Additional studies are needed to help define best practices in VR utilization, and to explore new therapeutic uses for VR in clinical practice.

Red flags on pinkwashed drinks: contradictions and dangers in marketing alcohol to prevent cancer.

PubMed

Mart, Sarah; Giesbrecht, Norman

2015-10-01

To document alcohol products and promotions that use the pink ribbon symbol and related marketing materials that associate alcohol brands with breast cancer charities, awareness and survivors. We conducted a basic Boolean public internet search for alcohol products with pink ribbon/breast cancer awareness marketing campaigns. There is strong and growing evidence of alcohol as a contributing cause of several types of cancer, including breast cancer. There is no U-shaped curve for cancer, and threshold of elevated relative risk is as low as one drink a day for certain cancers. We found 17 examples of alcohol product campaigns with websites, press releases and social media posts, along with news articles and blog posts from industry and non-profit organizations regarding alcohol products associated with breast cancer causes and charities. Various cancer charities have entered into alliances with sectors of the alcohol industry that raise funds for breast cancer research, treatment or prevention by promoting the purchase of certain alcoholic beverages. Some alcohol corporations use pink ribbons and other breast cancer-related images, messages and user-generated media to market a product that contributes to cancer disease and death. Therefore, cancer charities should adopt policies to separate them from alliances with the alcohol industry. © 2015 Society for the Study of Addiction.

Topological methods for the comparison of structures using LDR-brachytherapy of the prostate as an example.

PubMed

Schiefer, H; von Toggenburg, F; Seelentag, W W; Plasswilm, L; Ries, G; Schmid, H-P; Leippold, T; Krusche, B; Roth, J; Engeler, D

2009-08-21

The dose coverage of low dose rate (LDR)-brachytherapy for localized prostate cancer is monitored 4-6 weeks after intervention by contouring the prostate on computed tomography and/or magnetic resonance imaging sets. Dose parameters for the prostate (V100, D90 and D80) provide information on the treatment quality. Those depend strongly on the delineation of the prostate contours. We therefore systematically investigated the contouring process for 21 patients with five examiners. The prostate structures were compared with one another using topological procedures based on Boolean algebra. The coincidence number C(V) measures the agreement between a set of structures. The mutual coincidence C(i, j) measures the agreement between two structures i and j, and the mean coincidence C(i) compares a selected structure i with the remaining structures in a set. All coincidence parameters have a value of 1 for complete coincidence of contouring and 0 for complete absence. The five patients with the lowest C(V) values were discussed, and rules for contouring the prostate have been formulated. The contouring and assessment were repeated after 3 months for the same five patients. All coincidence parameters have been improved after instruction. This shows objectively that training resulted in more consistent contouring across examiners.

Light-induced heterogeneous reactions of NO2 on indoor surfaces: How they affect the balance of nitrous acid

NASA Astrophysics Data System (ADS)

Gomez Alvarez, E.; Soergel, M.; Bassil, S.; Zetzsch, C.; Gligorovski, S.; Wortham, H.

2011-12-01

Nitrous acid (HONO) is an important indoor pollutant. The adverse health effects due to the formation of nitrosamines are well known. HONO acts as a nitrosating agent after wall reactions of HONO with nicotine [Sleiman et al., 2010]. Indoor air can be surprisingly rich in HONO (homes with fireplaces, stoves, gas heating and cooking) and also surfaces are abundant. High HONO concentrations have been measured in indoor environments, from the direct emissions and heterogeneous reactions of NO2 in darkness. However, the measured HONO concentrations do not correspond to the HONO levels determined by the models [Carslaw, 2007]. We have tested in a flow tube reactor on-line coupled to a NOx analyzer and a sensitive Long Path Absorption Photometry instrument, the behaviour of various indoor surfaces towards NO2 under simulated solar light irradiation (λ= 300-700 nm). Our study has allowed us to obtain a deeper knowledge on the mechanisms of heterogeneous formation of HONO, quantifying the dependence of HONO formation on behalf of NO2 concentration and relative humidity and the enhancement of HONO formation in the presence of light. Pyrex, acidic detergent, alkaline detergent, paint and lacquer were tested on behalf of their heterogeneous reactivity towards NO2 in the absence and in presence of light. The results obtained demonstrated that indoor surfaces are photo-chemically active under atmospherically relevant conditions. The strongly alkaline surfaces (such as certain types of detergent) show a strong long-term uptake capacity. However, other surfaces such as detergents with a more acidic character released HONO. In some cases such as paint and varnish, a strong HONO release with light was detected, which was significantly higher than that obtained over clean glass surfaces. Certain organics present on their composition could exert a photo-sensitizing effect that may explain their increased reactivity. Unfortunately, the final balance points towards an important net production of HONO from organics usually applied on different indoor surfaces that add to the very powerful HONO production simply due to heterogeneous reactivity on bare indoor surfaces. The results of this study add to the increasing concern over the reactivity in indoor environments and in particular from the point of view of HONO formation kinetics.

Reduced negativity effect in older adults' memory for emotional pictures: the heterogeneity-homogeneity list paradigm.

PubMed

Grühn, Daniel; Scheibe, Susanne; Baltes, Paul B

2007-09-01

Using the heterogeneity-homogeneity list paradigm, the authors investigated 48 young adults' (20-30 years) and 48 older adults' (65-75 years) recognition memory for emotional pictures. The authors obtained no evidence for a positivity bias in older adults' memory: Age differences were primarily driven by older adults' diminished ability to remember negative pictures. The authors further found a strong effect of list types: Pictures, particularly neutral ones, were better recognized in homogeneous (blocked) lists than in heterogeneous (mixed) ones. Results confirm those of a previous study by D. Grühn, J. Smith, and P. B. Baltes (2005) that used a different type of to-be-remembered material, that is, pictures instead of words. (PsycINFO Database Record (c) 2007 APA, all rights reserved).

Optimized ECC Implementation for Secure Communication between Heterogeneous IoT Devices

PubMed Central

Marin, Leandro; Piotr Pawlowski, Marcin; Jara, Antonio

2015-01-01

The Internet of Things is integrating information systems, places, users and billions of constrained devices into one global network. This network requires secure and private means of communications. The building blocks of the Internet of Things are devices manufactured by various producers and are designed to fulfil different needs. There would be no common hardware platform that could be applied in every scenario. In such a heterogeneous environment, there is a strong need for the optimization of interoperable security. We present optimized elliptic curve Cryptography algorithms that address the security issues in the heterogeneous IoT networks. We have combined cryptographic algorithms for the NXP/Jennic 5148- and MSP430-based IoT devices and used them to created novel key negotiation protocol. PMID:26343677

Boolean and brain-inspired computing using spin-transfer torque devices

NASA Astrophysics Data System (ADS)

Fan, Deliang

Several completely new approaches (such as spintronic, carbon nanotube, graphene, TFETs, etc.) to information processing and data storage technologies are emerging to address the time frame beyond current Complementary Metal-Oxide-Semiconductor (CMOS) roadmap. The high speed magnetization switching of a nano-magnet due to current induced spin-transfer torque (STT) have been demonstrated in recent experiments. Such STT devices can be explored in compact, low power memory and logic design. In order to truly leverage STT devices based computing, researchers require a re-think of circuit, architecture, and computing model, since the STT devices are unlikely to be drop-in replacements for CMOS. The potential of STT devices based computing will be best realized by considering new computing models that are inherently suited to the characteristics of STT devices, and new applications that are enabled by their unique capabilities, thereby attaining performance that CMOS cannot achieve. The goal of this research is to conduct synergistic exploration in architecture, circuit and device levels for Boolean and brain-inspired computing using nanoscale STT devices. Specifically, we first show that the non-volatile STT devices can be used in designing configurable Boolean logic blocks. We propose a spin-memristor threshold logic (SMTL) gate design, where memristive cross-bar array is used to perform current mode summation of binary inputs and the low power current mode spintronic threshold device carries out the energy efficient threshold operation. Next, for brain-inspired computing, we have exploited different spin-transfer torque device structures that can implement the hard-limiting and soft-limiting artificial neuron transfer functions respectively. We apply such STT based neuron (or 'spin-neuron') in various neural network architectures, such as hierarchical temporal memory and feed-forward neural network, for performing "human-like" cognitive computing, which show more than two orders of lower energy consumption compared to state of the art CMOS implementation. Finally, we show the dynamics of injection locked Spin Hall Effect Spin-Torque Oscillator (SHE-STO) cluster can be exploited as a robust multi-dimensional distance metric for associative computing, image/ video analysis, etc. Our simulation results show that the proposed system architecture with injection locked SHE-STOs and the associated CMOS interface circuits can be suitable for robust and energy efficient associative computing and pattern matching.

Regional Differences in the Growing Incidence of Dengue Fever in Vietnam Explained by Weather Variability

PubMed Central

Vu, Ha Hai; Okumura, Junko; Hashizume, Masahiro; Tran, Duong Nhu; Yamamoto, Taro

2014-01-01

Dengue fever is a major health problem in Vietnam, but its incidence differs from province to province. To understand this at the local level, we assessed the effect of four weather components (humidity, rainfall, temperature and sunshine) on the number of dengue cases in nine provinces of Vietnam. Monthly data from 1999 to 2009 were analysed by time-series regression using negative binomial models. A test for heterogeneity was applied to assess the weather-dengue association in the provinces. Those associations were significantly heterogeneous (for temperature, humidity, and sunshine: P < 0.001 heterogeneity test; for rainfall: P = 0.018 heterogeneity test). This confirms that weather components strongly affect dengue transmission at a lag time of 0 to 3 months, with considerable variation in their influence among different areas in Vietnam. This finding may promote the strategic prevention of dengue disease by suggesting specific plans at the local level, rather than a nationally unified approach. PMID:24808744

Recrystallization texture in nickel heavily deformed by accumulative roll bonding

NASA Astrophysics Data System (ADS)

Mishin, O. V.; Zhang, Y. B.; Godfrey, A.

2017-07-01

The recrystallization behavior of Ni processed by accumulative roll bonding to a total accumulated von Mises strain of 4.8 has been examined, and analyzed with respect to heterogeneity in the deformation microstructure. The regions near the bonding interface are found to be more refined and contain particle deformation zones around fragments of the steel wire brush used to prepare the surface for bonding. Sample-scale gradients are also observed, manifested as differences between the subsurface, intermediate and central layers, where the distributions of texture components are different. These heterogeneities affect the progress of recrystallization. While the subsurface and near-interface regions typically contain lower frequencies of cube-oriented grains than anywhere else in the sample, a strong cube texture forms in the sample during recrystallization, attributed to both a high nucleation rate and fast growth rate of cube-oriented grains. The observations highlight the sensitivity of recrystallization to heterogeneity in the deformation microstructure and demonstrate the importance of characterizing this heterogeneity over several length scales.

Demonstration of Inexact Computing Implemented in the JPEG Compression Algorithm using Probabilistic Boolean Logic applied to CMOS Components

DTIC Science & Technology

2015-12-24

Signal to Noise Ratio SPICE Simulation Program with Integrated Circuit Emphasis TIFF Tagged Image File Format USC University of Southern California xvii...sources can create errors in digital circuits. These effects can be simulated using Simulation Program with Integrated Circuit Emphasis ( SPICE ) or...compute summary statistics. 4.1 Circuit Simulations Noisy analog circuits can be simulated in SPICE or Cadence SpectreTM software via noisy voltage