State feedback control design for Boolean networks.

PubMed

Liu, Rongjie; Qian, Chunjiang; Liu, Shuqian; Jin, Yu-Fang

2016-08-26

Driving Boolean networks to desired states is of paramount significance toward our ultimate goal of controlling the progression of biological pathways and regulatory networks. Despite recent computational development of controllability of general complex networks and structural controllability of Boolean networks, there is still a lack of bridging the mathematical condition on controllability to real boolean operations in a network. Further, no realtime control strategy has been proposed to drive a Boolean network. In this study, we applied semi-tensor product to represent boolean functions in a network and explored controllability of a boolean network based on the transition matrix and time transition diagram. We determined the necessary and sufficient condition for a controllable Boolean network and mapped this requirement in transition matrix to real boolean functions and structure property of a network. An efficient tool is offered to assess controllability of an arbitrary Boolean network and to determine all reachable and non-reachable states. We found six simplest forms of controllable 2-node Boolean networks and explored the consistency of transition matrices while extending these six forms to controllable networks with more nodes. Importantly, we proposed the first state feedback control strategy to drive the network based on the status of all nodes in the network. Finally, we applied our reachability condition to the major switch of P53 pathway to predict the progression of the pathway and validate the prediction with published experimental results. This control strategy allowed us to apply realtime control to drive Boolean networks, which could not be achieved by the current control strategy for Boolean networks. Our results enabled a more comprehensive understanding of the evolution of Boolean networks and might be extended to output feedback control design.

The Boolean Is Dead, Long Live the Boolean! Natural Language versus Boolean Searching in Introductory Undergraduate Instruction

ERIC Educational Resources Information Center

Lowe, M. Sara; Maxson, Bronwen K.; Stone, Sean M.; Miller, Willie; Snajdr, Eric; Hanna, Kathleen

2018-01-01

Boolean logic can be a difficult concept for first-year, introductory students to grasp. This paper compares the results of Boolean and natural language searching across several databases with searches created from student research questions. Performance differences between databases varied. Overall, natural search language is at least as good as…

TemperSAT: A new efficient fair-sampling random k-SAT solver

NASA Astrophysics Data System (ADS)

Fang, Chao; Zhu, Zheng; Katzgraber, Helmut G.

The set membership problem is of great importance to many applications and, in particular, database searches for target groups. Recently, an approach to speed up set membership searches based on the NP-hard constraint-satisfaction problem (random k-SAT) has been developed. However, the bottleneck of the approach lies in finding the solution to a large SAT formula efficiently and, in particular, a large number of independent solutions is needed to reduce the probability of false positives. Unfortunately, traditional random k-SAT solvers such as WalkSAT are biased when seeking solutions to the Boolean formulas. By porting parallel tempering Monte Carlo to the sampling of binary optimization problems, we introduce a new algorithm (TemperSAT) whose performance is comparable to current state-of-the-art SAT solvers for large k with the added benefit that theoretically it can find many independent solutions quickly. We illustrate our results by comparing to the currently fastest implementation of WalkSAT, WalkSATlm.

Computational complexity of Boolean functions

NASA Astrophysics Data System (ADS)

Korshunov, Aleksei D.

2012-02-01

Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.

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.

Cryptographic Boolean Functions with Biased Inputs

DTIC Science & Technology

2015-07-31

theory of random graphs developed by Erdős and Rényi [2]. The graph properties in a random graph expressed as such Boolean functions are used by...distributed Bernoulli variates with the parameter p. Since our scope is within the area of cryptography , we initiate an analysis of cryptographic...Boolean functions with biased inputs, which we refer to as µp-Boolean functions, is a common generalization of Boolean functions which stems from the

Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.

PubMed

Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj

2016-01-01

The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.

A Simple Blueprint for Automatic Boolean Query Processing.

ERIC Educational Resources Information Center

Salton, G.

1988-01-01

Describes a new Boolean retrieval environment in which an extended soft Boolean logic is used to automatically construct queries from original natural language formulations provided by users. Experimental results that compare the retrieval effectiveness of this method to conventional Boolean and vector processing are discussed. (27 references)…

Optimal stabilization of Boolean networks through collective influence

NASA Astrophysics Data System (ADS)

Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming

2018-03-01

Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.

Effect of memory in non-Markovian Boolean networks illustrated with a case study: A cell cycling process

NASA Astrophysics Data System (ADS)

Ebadi, H.; Saeedian, M.; Ausloos, M.; Jafari, G. R.

2016-11-01

The Boolean network is one successful model to investigate discrete complex systems such as the gene interacting phenomenon. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self-organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function —one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of the yeast cell cycle network, we discover a power-law-like memory with a more robust dynamics than the Markovian dynamics.

On the Computation of Comprehensive Boolean Gröbner Bases

NASA Astrophysics Data System (ADS)

Inoue, Shutaro

We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.

Mining TCGA Data Using Boolean Implications

PubMed Central

Sinha, Subarna; Tsang, Emily K.; Zeng, Haoyang; Meister, Michela; Dill, David L.

2014-01-01

Boolean implications (if-then rules) provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression) from the glioblastoma (GBM) and ovarian serous cystadenoma (OV) data sets from The Cancer Genome Atlas (TCGA). We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/. PMID:25054200

Synchronization of coupled large-scale Boolean networks

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

Li, Fangfei, E-mail: li-fangfei@163.com

2014-03-15

This paper investigates the complete synchronization and partial synchronization of two large-scale Boolean networks. First, the aggregation algorithm towards large-scale Boolean network is reviewed. Second, the aggregation algorithm is applied to study the complete synchronization and partial synchronization of large-scale Boolean networks. Finally, an illustrative example is presented to show the efficiency of the proposed results.

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.

Quantifying color variation: Improved formulas for calculating hue with segment classification.

PubMed

Smith, Stacey D

2014-03-01

Differences in color form a major component of biological variation, and quantifying these differences is the first step to understanding their evolutionary and ecological importance. One common method for measuring color variation is segment classification, which uses three variables (chroma, hue, and brightness) to describe the height and shape of reflectance curves. This study provides new formulas for calculating hue (the variable that describes the "type" of color) to give correct values in all regions of color space. • Reflectance spectra were obtained from the literature, and chroma, hue, and brightness were computed for each spectrum using the original formulas as well as the new formulas. Only the new formulas result in correct values in the blue-green portion of color space. • Use of the new formulas for calculating hue will result in more accurate color quantification for a broad range of biological applications.

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.

Quantifying color variation: Improved formulas for calculating hue with segment classification1

PubMed Central

Smith, Stacey D.

2014-01-01

• Premise of the study: Differences in color form a major component of biological variation, and quantifying these differences is the first step to understanding their evolutionary and ecological importance. One common method for measuring color variation is segment classification, which uses three variables (chroma, hue, and brightness) to describe the height and shape of reflectance curves. This study provides new formulas for calculating hue (the variable that describes the “type” of color) to give correct values in all regions of color space. • Methods and Results: Reflectance spectra were obtained from the literature, and chroma, hue, and brightness were computed for each spectrum using the original formulas as well as the new formulas. Only the new formulas result in correct values in the blue-green portion of color space. • Conclusions: Use of the new formulas for calculating hue will result in more accurate color quantification for a broad range of biological applications. PMID:25202612

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)

Solving satisfiability problems using a novel microarray-based DNA computer.

PubMed

Lin, Che-Hsin; Cheng, Hsiao-Ping; Yang, Chang-Biau; Yang, Chia-Ning

2007-01-01

An algorithm based on a modified sticker model accompanied with an advanced MEMS-based microarray technology is demonstrated to solve SAT problem, which has long served as a benchmark in DNA computing. Unlike conventional DNA computing algorithms needing an initial data pool to cover correct and incorrect answers and further executing a series of separation procedures to destroy the unwanted ones, we built solutions in parts to satisfy one clause in one step, and eventually solve the entire Boolean formula through steps. No time-consuming sample preparation procedures and delicate sample applying equipment were required for the computing process. Moreover, experimental results show the bound DNA sequences can sustain the chemical solutions during computing processes such that the proposed method shall be useful in dealing with large-scale problems.

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…

Formula Budgeting and the Financing of Public Higher Education: Panacea or Nemesis for the 1980s? The AIR Professional File No. 3, Fall 1979.

ERIC Educational Resources Information Center

Gross, Francis M.

Formula budgeting in the financing of public higher education is examined. Budget formulas are defined as a means of applying predetermined average cost rates to quantifiable institutional program measures in order to calculate the dollar resource requirements for a future year. Seven characteristics of budget formulas are described: (1) their…

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.

Gains and Pitfalls of Quantifier Elimination as a Teaching Tool

ERIC Educational Resources Information Center

Oldenburg, Reinhard

2015-01-01

Quantifier Elimination is a procedure that allows simplification of logical formulas that contain quantifiers. Many mathematical concepts are defined in terms of quantifiers and especially in calculus their use has been identified as an obstacle in the learning process. The automatic deduction provided by quantifier elimination thus allows…

Improvements in metabolic flux analysis using carbon bond labeling experiments: bondomer balancing and Boolean function mapping.

PubMed

Sriram, Ganesh; Shanks, Jacqueline V

2004-04-01

The biosynthetically directed fractional (13)C labeling method for metabolic flux evaluation relies on performing a 2-D [(13)C, (1)H] NMR experiment on extracts from organisms cultured on a uniformly labeled carbon substrate. This article focuses on improvements in the interpretation of data obtained from such an experiment by employing the concept of bondomers. Bondomers take into account the natural abundance of (13)C; therefore many bondomers in a real network are zero, and can be precluded a priori--thus resulting in fewer balances. Using this method, we obtained a set of linear equations which can be solved to obtain analytical formulas for NMR-measurable quantities in terms of fluxes in glycolysis and the pentose phosphate pathways. For a specific case of this network with four degrees of freedom, a priori identifiability of the fluxes was shown possible for any set of fluxes. For a more general case with five degrees of freedom, the fluxes were shown identifiable for a representative set of fluxes. Minimal sets of measurements which best identify the fluxes are listed. Furthermore, we have delineated Boolean function mapping, a new method to iteratively simulate bondomer abundances or efficiently convert carbon skeleton rearrangement information to mapping matrices. The efficiency of this method is expected to be valuable while analyzing metabolic networks which are not completely known (such as in plant metabolism) or while implementing iterative bondomer balancing methods.

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

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.

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

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.

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.

Mean-intercept anisotropy analysis of porous media. II. Conceptual shortcomings of the MIL tensor definition and Minkowski tensors as an alternative.

PubMed

Klatt, Michael A; Schröder-Turk, Gerd E; Mecke, Klaus

2017-07-01

Structure-property relations, which relate the shape of the microstructure to physical properties such as transport or mechanical properties, need sensitive measures of structure. What are suitable fabric tensors to quantify the shape of anisotropic heterogeneous materials? The mean intercept length is among the most commonly used characteristics of anisotropy in porous media, e.g., of trabecular bone in medical physics. Yet, in this series of two papers we demonstrate that it has conceptual shortcomings that limit the validity of its results. We test the validity of general assumptions regarding the properties of the mean-intercept length tensor using analytical formulas for the mean-intercept lengths in anisotropic Boolean models (derived in part I of this series), augmented by numerical simulations. We discuss in detail the functional form of the mean intercept length as a function of the test line orientations. As the most prominent result, we find that, at least for the example of overlapping grains modeling porous media, the polar plot of the mean intercept length is in general not an ellipse and hence not represented by a second-rank tensor. This is in stark contrast to the common understanding that for a large collection of grains the mean intercept length figure averages to an ellipse. The standard mean intercept length tensor defined by a least-square fit of an ellipse is based on a model mismatch, which causes an intrinsic lack of accuracy. Our analysis reveals several shortcomings of the mean intercept length tensor analysis that pose conceptual problems and limitations on the information content of this commonly used analysis method. We suggest the Minkowski tensors from integral geometry as alternative sensitive measures of anisotropy. The Minkowski tensors allow for a robust, comprehensive, and systematic approach to quantify various aspects of structural anisotropy. We show the Minkowski tensors to be more sensitive, in the sense, that they can quantify the remnant anisotropy of structures not captured by the mean intercept length analysis. If applied to porous tissue and microstructures, this improved structure characterization can yield new insights into the relationships between geometry and material properties. © 2017 American Association of Physicists in Medicine.

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

Parallelization of combinatorial search when solving knapsack optimization problem on computing systems based on multicore processors

NASA Astrophysics Data System (ADS)

Rahman, P. A.

2018-05-01

This scientific paper deals with the model of the knapsack optimization problem and method of its solving based on directed combinatorial search in the boolean space. The offered by the author specialized mathematical model of decomposition of the search-zone to the separate search-spheres and the algorithm of distribution of the search-spheres to the different cores of the multi-core processor are also discussed. The paper also provides an example of decomposition of the search-zone to the several search-spheres and distribution of the search-spheres to the different cores of the quad-core processor. Finally, an offered by the author formula for estimation of the theoretical maximum of the computational acceleration, which can be achieved due to the parallelization of the search-zone to the search-spheres on the unlimited number of the processor cores, is also given.

Post optimization paradigm in maximum 3-satisfiability logic programming

NASA Astrophysics Data System (ADS)

Mansor, Mohd. Asyraf; Sathasivam, Saratha; Kasihmuddin, Mohd Shareduwan Mohd

2017-08-01

Maximum 3-Satisfiability (MAX-3SAT) is a counterpart of the Boolean satisfiability problem that can be treated as a constraint optimization problem. It deals with a conundrum of searching the maximum number of satisfied clauses in a particular 3-SAT formula. This paper presents the implementation of enhanced Hopfield network in hastening the Maximum 3-Satisfiability (MAX-3SAT) logic programming. Four post optimization techniques are investigated, including the Elliot symmetric activation function, Gaussian activation function, Wavelet activation function and Hyperbolic tangent activation function. The performances of these post optimization techniques in accelerating MAX-3SAT logic programming will be discussed in terms of the ratio of maximum satisfied clauses, Hamming distance and the computation time. Dev-C++ was used as the platform for training, testing and validating our proposed techniques. The results depict the Hyperbolic tangent activation function and Elliot symmetric activation function can be used in doing MAX-3SAT logic programming.

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

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.

Lung nodule malignancy classification using only radiologist-quantified image features as inputs to statistical learning algorithms: probing the Lung Image Database Consortium dataset with two statistical learning methods.

PubMed

Hancock, Matthew C; Magnan, Jerry F

2016-10-01

In the assessment of nodules in CT scans of the lungs, a number of image-derived features are diagnostically relevant. Currently, many of these features are defined only qualitatively, so they are difficult to quantify from first principles. Nevertheless, these features (through their qualitative definitions and interpretations thereof) are often quantified via a variety of mathematical methods for the purpose of computer-aided diagnosis (CAD). To determine the potential usefulness of quantified diagnostic image features as inputs to a CAD system, we investigate the predictive capability of statistical learning methods for classifying nodule malignancy. We utilize the Lung Image Database Consortium dataset and only employ the radiologist-assigned diagnostic feature values for the lung nodules therein, as well as our derived estimates of the diameter and volume of the nodules from the radiologists' annotations. We calculate theoretical upper bounds on the classification accuracy that are achievable by an ideal classifier that only uses the radiologist-assigned feature values, and we obtain an accuracy of 85.74 [Formula: see text], which is, on average, 4.43% below the theoretical maximum of 90.17%. The corresponding area-under-the-curve (AUC) score is 0.932 ([Formula: see text]), which increases to 0.949 ([Formula: see text]) when diameter and volume features are included and has an accuracy of 88.08 [Formula: see text]. Our results are comparable to those in the literature that use algorithmically derived image-based features, which supports our hypothesis that lung nodules can be classified as malignant or benign using only quantified, diagnostic image features, and indicates the competitiveness of this approach. We also analyze how the classification accuracy depends on specific features and feature subsets, and we rank the features according to their predictive power, statistically demonstrating the top four to be spiculation, lobulation, subtlety, and calcification.

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

Attractor controllability of Boolean networks by flipping a subset of their nodes

NASA Astrophysics Data System (ADS)

Rafimanzelat, Mohammad Reza; Bahrami, Fariba

2018-04-01

The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.

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.

The formulaic schema in the minds of two generations of native speakers

PubMed Central

Van Lancker Sidtis, Diana; Cameron, Krista; Bridges, Kelly; Sidtis, John J.

2015-01-01

Schemata are expressions that are fixed except for slots available for novel words (I’m not a ______ person). Our goals were to quantify speakers’ knowledge, examine semantic flexibility in open slots, and compare performance data in two generations of speakers using cloze procedures in formulaic expressions, schemata open slots, fixed portions of schemata, and novel sentences. Fewer unique words appeared for the schemata-fixed and formulaic exemplars, reflecting speakers’ knowledge of these utterances; the most semantic categories appeared for schemata-open responses. Age groups did not differ. Schemata exemplify creative interplay between novel lexical retrieval and fixed formulaic expression. PMID:26392923

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.

COMPLEXITY&APPROXIMABILITY OF QUANTIFIED&STOCHASTIC CONSTRAINT SATISFACTION PROBLEMS

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

Hunt, H. B.; Marathe, M. V.; Stearns, R. E.

2001-01-01

Let D be an arbitrary (not necessarily finite) nonempty set, let C be a finite set of constant symbols denoting arbitrary elements of D, and let S and T be an arbitrary finite set of finite-arity relations on D. We denote the problem of determining the satisfiability of finite conjunctions of relations in S applied to variables (to variables and symbols in C) by SAT(S) (by SATc(S).) Here, we study simultaneously the complexity of decision, counting, maximization and approximate maximization problems, for unquantified, quantified and stochastically quantified formulas. We present simple yet general techniques to characterize simultaneously, the complexity ormore » efficient approximability of a number of versions/variants of the problems SAT(S), Q-SAT(S), S-SAT(S),MAX-Q-SAT(S) etc., for many different such D,C ,S, T. These versions/variants include decision, counting, maximization and approximate maximization problems, for unquantified, quantified and stochastically quantified formulas. Our unified approach is based on the following two basic concepts: (i) strongly-local replacements/reductions and (ii) relational/algebraic represent ability. Some of the results extend the earlier results in [Pa85,LMP99,CF+93,CF+94O]u r techniques and results reported here also provide significant steps towards obtaining dichotomy theorems, for a number of the problems above, including the problems MAX-&-SAT( S), and MAX-S-SAT(S). The discovery of such dichotomy theorems, for unquantified formulas, has received significant recent attention in the literature [CF+93,CF+94,Cr95,KSW97]« less

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.

Two-photon microscopy measurement of cerebral metabolic rate of oxygen using periarteriolar oxygen concentration gradients.

PubMed

Sakadžić, Sava; Yaseen, Mohammad A; Jaswal, Rajeshwer; Roussakis, Emmanuel; Dale, Anders M; Buxton, Richard B; Vinogradov, Sergei A; Boas, David A; Devor, Anna

2016-10-01

The cerebral metabolic rate of oxygen ([Formula: see text]) is an essential parameter for evaluating brain function and pathophysiology. However, the currently available approaches for quantifying [Formula: see text] rely on complex multimodal imaging and mathematical modeling. Here, we introduce a method that allows estimation of [Formula: see text] based on a single measurement modality-two-photon imaging of the partial pressure of oxygen ([Formula: see text]) in cortical tissue. We employed two-photon phosphorescence lifetime microscopy (2PLM) and the oxygen-sensitive nanoprobe PtP-C343 to map the tissue [Formula: see text] distribution around cortical penetrating arterioles. [Formula: see text] is subsequently estimated by fitting the changes of tissue [Formula: see text] around arterioles with the Krogh cylinder model of oxygen diffusion. We measured the baseline [Formula: see text] in anesthetized rats and modulated tissue [Formula: see text] levels by manipulating the depth of anesthesia. This method provides [Formula: see text] measurements localized within [Formula: see text] and it may provide oxygen consumption measurements in individual cortical layers or within confined cortical regions, such as in ischemic penumbra and the foci of functional activation.

Sub-diffusive scattering parameter maps recovered using wide-field high-frequency structured light imaging.

PubMed

Kanick, Stephen Chad; McClatchy, David M; Krishnaswamy, Venkataramanan; Elliott, Jonathan T; Paulsen, Keith D; Pogue, Brian W

2014-10-01

This study investigates the hypothesis that structured light reflectance imaging with high spatial frequency patterns [Formula: see text] can be used to quantitatively map the anisotropic scattering phase function distribution [Formula: see text] in turbid media. Monte Carlo simulations were used in part to establish a semi-empirical model of demodulated reflectance ([Formula: see text]) in terms of dimensionless scattering [Formula: see text] and [Formula: see text], a metric of the first two moments of the [Formula: see text] distribution. Experiments completed in tissue-simulating phantoms showed that simultaneous analysis of [Formula: see text] spectra sampled at multiple [Formula: see text] in the frequency range [0.05-0.5] [Formula: see text] allowed accurate estimation of both [Formula: see text] in the relevant tissue range [0.4-1.8] [Formula: see text], and [Formula: see text] in the range [1.4-1.75]. Pilot measurements of a healthy volunteer exhibited [Formula: see text]-based contrast between scar tissue and surrounding normal skin, which was not as apparent in wide field diffuse imaging. These results represent the first wide-field maps to quantify sub-diffuse scattering parameters, which are sensitive to sub-microscopic tissue structures and composition, and therefore, offer potential for fast diagnostic imaging of ultrastructure on a size scale that is relevant to surgical applications.

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.

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.

A reporter gene assay for the detection of phytoestrogens in traditional Chinese medicine.

PubMed

Miller-Martini, D M; Chan, R Y; Ip, N Y; Sheu, S J; Wong, Y H

2001-09-01

Bupleurum & Peony Formula (Jia Wei Xiao Yao San) is a herbal formula which possesses a clinical history for the treatment of menopausal syndrome and menstrual irregularity. The present investigation reports the ability to monitor the formula's phytoestrogen content that will allow for the implementation of a standardization protocol that is based on a quantifiable biological response. Utilizing an oestrogen-sensitive chimeric receptor/reporter gene element which has been stably transfected into HeLa cells, the botanical formula was shown to induce the expression of the reporter gene, luciferase, in a dose dependent manner. Pretreatment of the HeLa cells with the botanical formula produced a 5-fold increase in bioluminescence compared with the control. Additionally, our studies showed that the response of the cells, when challenged by the botanical formula, was oestrogen specific. Pretreatment of the cells with tamoxifen effectively blocked the activation of the chimeric oestrogen receptor by the botanical formula. The cell line provides a sensitive assay that can easily detect the presence of phytoestrogens in complex botanical formulas. Copyright 2001 John Wiley & Sons, Ltd.

Formulaic Language in Alzheimer’s Disease

PubMed Central

Bridges, Kelly Ann; Van Lancker Sidtis, Diana

2013-01-01

Background Studies of productive language in Alzheimer’s disease (AD) have focused on formal testing of syntax and semantics but have directed less attention to naturalistic discourse and formulaic language. Clinical observations suggest that individuals with AD retain the ability to produce formulaic language long after other cognitive abilities have deteriorated. Aims This study quantifies production of formulaic expressions in the spontaneous speech of individuals with AD. Persons with early- and late-onset forms of the disease were compared. Methods & Procedures Conversational language samples of individuals with early- (n = 5) and late-onset (n = 6) AD and healthy controls (n = 5) were analyzed to determine whether formulaic language, as measured by the number of words in formulaic expressions, differs between groups. Outcomes & Results Results indicate that individuals with AD, regardless of age of onset, used significantly more formulaic expressions than healthy controls. The early- and late-onset AD groups did not differ on formulaic language measures. Conclusions These findings contribute to a dual process model of cerebral function, which proposes differing processing principles for formulaic and novel expressions. In this model, subcortical areas, which remain intact into late in the progression of Alzheimer’s disease, play an important role in the production of formulaic language. Applications to clinical practice include identifying preserved formulaic language and providing informed counseling to patient and family. PMID:24187417

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.

Impact of climate seasonality on catchment yield: A parameterization for commonly-used water balance formulas

NASA Astrophysics Data System (ADS)

de Lavenne, Alban; Andréassian, Vazken

2018-03-01

This paper examines the hydrological impact of the seasonality of precipitation and maximum evaporation: seasonality is, after aridity, a second-order determinant of catchment water yield. Based on a data set of 171 French catchments (where aridity ranged between 0.2 and 1.2), we present a parameterization of three commonly-used water balance formulas (namely, Turc-Mezentsev, Tixeront-Fu and Oldekop formulas) to account for seasonality effects. We quantify the improvement of seasonality-based parameterization in terms of the reconstitution of both catchment streamflow and water yield. The significant improvement obtained (reduction of RMSE between 9 and 14% depending on the formula) demonstrates the importance of climate seasonality in the determination of long-term catchment water balance.

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.

A Northern Territory Approach to Quantifying "Access Disadvantage" to Educational Services in Remote and Rural Australia.

ERIC Educational Resources Information Center

Griffith, D. A.

The Griffith Service Access Frame (GSAF) is a model used for quantifying the access disadvantage to educational services of remote and rural areas in Australia. The model was specifically developed to assist policymakers and administrators in allocating resources. The problem with the current funding formula used by the Australian federal…

High-speed spatial frequency domain imaging of rat cortex detects dynamic optical and physiological properties following cardiac arrest and resuscitation.

PubMed

Wilson, Robert H; Crouzet, Christian; Torabzadeh, Mohammad; Bazrafkan, Afsheen; Farahabadi, Maryam H; Jamasian, Babak; Donga, Dishant; Alcocer, Juan; Zaher, Shuhab M; Choi, Bernard; Akbari, Yama; Tromberg, Bruce J

2017-10-01

Quantifying rapidly varying perturbations in cerebral tissue absorption and scattering can potentially help to characterize changes in brain function caused by ischemic trauma. We have developed a platform for rapid intrinsic signal brain optical imaging using macroscopically structured light. The device performs fast, multispectral, spatial frequency domain imaging (SFDI), detecting backscattered light from three-phase binary square-wave projected patterns, which have a much higher refresh rate than sinusoidal patterns used in conventional SFDI. Although not as fast as "single-snapshot" spatial frequency methods that do not require three-phase projection, square-wave patterns allow accurate image demodulation in applications such as small animal imaging where the limited field of view does not allow single-phase demodulation. By using 655, 730, and 850 nm light-emitting diodes, two spatial frequencies ([Formula: see text] and [Formula: see text]), three spatial phases (120 deg, 240 deg, and 360 deg), and an overall camera acquisition rate of 167 Hz, we map changes in tissue absorption and reduced scattering parameters ([Formula: see text] and [Formula: see text]) and oxy- and deoxyhemoglobin concentration at [Formula: see text]. We apply this method to a rat model of cardiac arrest (CA) and cardiopulmonary resuscitation (CPR) to quantify hemodynamics and scattering on temporal scales ([Formula: see text]) ranging from tens of milliseconds to minutes. We observe rapid concurrent spatiotemporal changes in tissue oxygenation and scattering during CA and following CPR, even when the cerebral electrical signal is absent. We conclude that square-wave SFDI provides an effective technical strategy for assessing cortical optical and physiological properties by balancing competing performance demands for fast signal acquisition, small fields of view, and quantitative information content.

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.

A Semi-Empirical Formula of the Dependence of the Fluorescence Intensity of Naphthalene on Temperature and the Oxygen Concentration

NASA Astrophysics Data System (ADS)

An, B.; Wang, Z.-G.; Yang, L.-C.; Li, X.-P.

2017-09-01

Two-ring aromatics, such as naphthalene, are important fluorescent components of kerosene in the planar laser-induced fluorescent (PLIF) technique. Quantifying measurements of kerosene vapor concentrations by PLIF require a prior knowledge of the fluorescence intensity of naphthalene over a wide temperature and oxygen concentration range. To promote the application of PLIF, a semi-empirical formula based on the collision theory and experimental data at the laser wavelength of 266 nm and a pressure of 0.1 MPa is established to predict the fluorescence intensity of naphthalene at different temperatures and oxygen concentrations. This formula takes vibrational states, temperature, and oxygen quenching into account. Verified by published experimental data, the formula can predict the fluorescence intensity of naphthalene with an error less than 9%.

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…

Performance of the ATLAS track reconstruction algorithms in dense environments in LHC Run 2.

PubMed

Aaboud, M; Aad, G; Abbott, B; Abdallah, J; Abdinov, O; Abeloos, B; Abidi, S H; AbouZeid, O S; Abraham, N L; Abramowicz, H; Abreu, H; Abreu, R; Abulaiti, Y; Acharya, B S; Adachi, S; Adamczyk, L; Adelman, J; Adersberger, M; Adye, T; Affolder, A A; Agatonovic-Jovin, T; Agheorghiesei, C; Aguilar-Saavedra, J A; Ahlen, S P; Ahmadov, F; Aielli, G; Akatsuka, S; Akerstedt, H; Åkesson, T P A; Akimov, A V; Alberghi, G L; Albert, J; Albicocco, P; Alconada Verzini, M J; Aleksa, M; Aleksandrov, I N; Alexa, C; Alexander, G; Alexopoulos, T; Alhroob, M; Ali, B; Aliev, M; Alimonti, G; Alison, J; Alkire, S P; Allbrooke, B M M; Allen, B W; Allport, P P; Aloisio, A; Alonso, A; Alonso, F; Alpigiani, C; Alshehri, A A; Alstaty, M; Alvarez Gonzalez, B; Álvarez Piqueras, D; Alviggi, M G; Amadio, B T; Amaral Coutinho, Y; Amelung, C; Amidei, D; Santos, S P Amor Dos; Amorim, A; Amoroso, S; Amundsen, G; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, J K; Anderson, K J; Andreazza, A; Andrei, V; Angelidakis, S; Angelozzi, I; Angerami, A; Anisenkov, A V; Anjos, N; Annovi, A; Antel, C; Antonelli, M; Antonov, A; Antrim, D J; Anulli, F; Aoki, M; Aperio Bella, L; Arabidze, G; Arai, Y; Araque, J P; Araujo Ferraz, V; Arce, A T H; Ardell, R E; Arduh, F A; Arguin, J-F; Argyropoulos, S; Arik, M; Armbruster, A J; Armitage, L J; Arnaez, O; Arnold, H; Arratia, M; Arslan, O; Artamonov, A; Artoni, G; Artz, S; Asai, S; Asbah, N; Ashkenazi, A; Asquith, L; Assamagan, K; Astalos, R; Atkinson, M; Atlay, N B; Augsten, K; Avolio, G; Axen, B; Ayoub, M K; Azuelos, G; Baas, A E; Baca, M J; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Bagnaia, P; Bahrasemani, H; Baines, J T; Bajic, M; Baker, O K; Baldin, E M; Balek, P; Balli, F; Balunas, W K; Banas, E; Banerjee, Sw; Bannoura, A A E; Barak, L; Barberio, E L; Barberis, D; Barbero, M; Barillari, T; Barisits, M-S; Barklow, T; Barlow, N; Barnes, S L; Barnett, B M; Barnett, R M; Barnovska-Blenessy, Z; Baroncelli, A; Barone, G; Barr, A J; Barranco Navarro, L; Barreiro, F; Barreiro Guimarães da Costa, J; Bartoldus, R; Barton, A E; Bartos, P; Basalaev, A; Bassalat, A; Bates, R L; Batista, S J; Batley, J R; Battaglia, M; Bauce, M; Bauer, F; Bawa, H S; Beacham, J B; Beattie, M D; Beau, T; Beauchemin, P H; Bechtle, P; Beck, H P; Becker, K; Becker, M; Beckingham, M; Becot, C; Beddall, A J; Beddall, A; Bednyakov, V A; Bedognetti, M; Bee, C P; Beermann, T A; Begalli, M; Begel, M; Behr, J K; Bell, A S; Bella, G; Bellagamba, L; Bellerive, A; Bellomo, M; Belotskiy, K; Beltramello, O; Belyaev, N L; Benary, O; Benchekroun, D; Bender, M; Bendtz, K; Benekos, N; Benhammou, Y; Benhar Noccioli, E; Benitez, J; Benjamin, D P; Benoit, M; Bensinger, J R; Bentvelsen, S; Beresford, L; Beretta, M; Berge, D; Bergeaas Kuutmann, E; Berger, N; Beringer, J; Berlendis, S; Bernard, N R; Bernardi, G; Bernius, C; Bernlochner, F U; Berry, T; Berta, P; Bertella, C; Bertoli, G; Bertolucci, F; Bertram, I A; Bertsche, C; Bertsche, D; Besjes, G J; Bessidskaia Bylund, O; Bessner, M; Besson, N; Betancourt, C; Bethani, A; Bethke, S; Bevan, A J; Beyer, J; Bianchi, R M; Biebel, O; Biedermann, D; Bielski, R; Biesuz, N V; Biglietti, M; Billoud, T R V; Bilokon, H; Bindi, M; Bingul, A; Bini, C; Biondi, S; Bisanz, T; Bittrich, C; Bjergaard, D M; Black, C W; Black, J E; Black, K M; Blair, R E; Blazek, T; Bloch, I; Blocker, C; Blue, A; Blum, W; Blumenschein, U; Blunier, S; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Bock, C; Boehler, M; Boerner, D; Bogavac, D; Bogdanchikov, A G; Bohm, C; Boisvert, V; Bokan, P; Bold, T; Boldyrev, A S; Bolz, A E; Bomben, M; Bona, M; Boonekamp, M; Borisov, A; Borissov, G; Bortfeldt, J; Bortoletto, D; Bortolotto, V; Boscherini, D; Bosman, M; Bossio Sola, J D; Boudreau, J; Bouffard, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Boutle, S K; Boveia, A; Boyd, J; Boyko, I R; Bracinik, J; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Breaden Madden, W D; Brendlinger, K; Brennan, A J; Brenner, L; Brenner, R; Bressler, S; Briglin, D L; Bristow, T M; Britton, D; Britzger, D; Brochu, F M; Brock, I; Brock, R; Brooijmans, G; Brooks, T; Brooks, W K; Brosamer, J; Brost, E; Broughton, J H; de Renstrom, P A Bruckman; Bruncko, D; Bruni, A; Bruni, G; Bruni, L S; Brunt, B H; Bruschi, M; Bruscino, N; Bryant, P; Bryngemark, L; Buanes, T; Buat, Q; Buchholz, P; Buckley, A G; Budagov, I A; Buehrer, F; Bugge, M K; Bulekov, O; Bullock, D; Burch, T J; Burckhart, H; Burdin, S; Burgard, C D; Burger, A M; Burghgrave, B; Burka, K; Burke, S; Burmeister, I; Burr, J T P; Busato, E; Büscher, D; Büscher, V; Bussey, P; Butler, J M; Buttar, C M; Butterworth, J M; Butti, P; Buttinger, W; Buzatu, A; Buzykaev, A R; Cabrera Urbán, S; Caforio, D; Cairo, V M; Cakir, O; Calace, N; Calafiura, P; Calandri, A; Calderini, G; Calfayan, P; Callea, G; Caloba, L P; Calvente Lopez, S; Calvet, D; Calvet, S; Calvet, T P; Camacho Toro, R; Camarda, S; Camarri, P; Cameron, D; Caminal Armadans, R; Camincher, C; Campana, S; Campanelli, M; Camplani, A; Campoverde, A; Canale, V; Cano Bret, M; Cantero, J; Cao, T; Capeans Garrido, M D M; Caprini, I; Caprini, M; Capua, M; Carbone, R M; Cardarelli, R; Cardillo, F; Carli, I; Carli, T; Carlino, G; Carlson, B T; Carminati, L; Carney, R M D; Caron, S; Carquin, E; Carrá, S; Carrillo-Montoya, G D; Carvalho, J; Casadei, D; Casado, M P; Casolino, M; Casper, D W; Castelijn, R; Castillo Gimenez, V; Castro, N F; Catinaccio, A; Catmore, J R; Cattai, A; Caudron, J; Cavaliere, V; Cavallaro, E; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Celebi, E; Ceradini, F; Cerda Alberich, L; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cervelli, A; Cetin, S A; Chafaq, A; Chakraborty, D; Chan, S K; Chan, W S; Chan, Y L; Chang, P; Chapman, J D; Charlton, D G; Chau, C C; Chavez Barajas, C A; Che, S; Cheatham, S; Chegwidden, A; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, H; Chen, S; Chen, S; Chen, X; Chen, Y; Cheng, H C; Cheng, H J; Cheplakov, A; Cheremushkina, E; Cherkaoui El Moursli, R; Chernyatin, V; Cheu, E; Chevalier, L; Chiarella, V; Chiarelli, G; Chiodini, G; Chisholm, A S; Chitan, A; Chiu, Y H; Chizhov, M V; Choi, K; Chomont, A R; Chouridou, S; Christodoulou, V; Chromek-Burckhart, D; Chu, M C; Chudoba, J; Chuinard, A J; Chwastowski, J J; Chytka, L; Ciftci, A K; Cinca, D; Cindro, V; Cioara, I A; Ciocca, C; Ciocio, A; Cirotto, F; Citron, Z H; Citterio, M; Ciubancan, M; Clark, A; Clark, B L; Clark, M R; Clark, P J; Clarke, R N; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Colasurdo, L; Cole, B; Colijn, A P; Collot, J; Colombo, T; Conde Muiño, P; Coniavitis, E; Connell, S H; Connelly, I A; Constantinescu, S; Conti, G; Conventi, F; Cooke, M; Cooper-Sarkar, A M; Cormier, F; Cormier, K J R; Corradi, M; Corriveau, F; Cortes-Gonzalez, A; Cortiana, G; Costa, G; Costa, M J; Costanzo, D; Cottin, G; Cowan, G; Cox, B E; Cranmer, K; Crawley, S J; Creager, R A; Cree, G; Crépé-Renaudin, S; Crescioli, F; Cribbs, W A; Cristinziani, M; Croft, V; Crosetti, G; Cueto, A; Cuhadar Donszelmann, T; Cukierman, A R; Cummings, J; Curatolo, M; Cúth, J; Czirr, H; Czodrowski, P; D'amen, G; D'Auria, S; D'eramo, L; D'Onofrio, M; Da Cunha Sargedas De Sousa, M J; Via, C Da; Dabrowski, W; Dado, T; Dai, T; Dale, O; Dallaire, F; Dallapiccola, C; Dam, M; Dandoy, J R; Daneri, M F; Dang, N P; Daniells, A C; Dann, N S; Danninger, M; Hoffmann, M Dano; Dao, V; Darbo, G; Darmora, S; Dassoulas, J; Dattagupta, A; Daubney, T; Davey, W; David, C; Davidek, T; Davies, M; Davis, D R; Davison, P; Dawe, E; Dawson, I; De, K; de Asmundis, R; De Benedetti, A; De Castro, S; De Cecco, S; De Groot, N; de Jong, P; De la Torre, H; De Lorenzi, F; De Maria, A; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Vasconcelos Corga, K; De Vivie De Regie, J B; Dearnaley, W J; Debbe, R; Debenedetti, C; Dedovich, D V; Dehghanian, N; Deigaard, I; Del Gaudio, M; Del Peso, J; Prete, T Del; Delgove, D; Deliot, F; Delitzsch, C M; Dell'Acqua, A; Dell'Asta, L; Dell'Orso, M; Della Pietra, M; Della Volpe, D; Delmastro, M; Delporte, C; Delsart, P A; DeMarco, D A; Demers, S; Demichev, M; Demilly, A; Denisov, S P; Denysiuk, D; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deterre, C; Dette, K; Devesa, M R; Deviveiros, P O; Dewhurst, A; Dhaliwal, S; Di Bello, F A; Di Ciaccio, A; Di Ciaccio, L; Di Clemente, W K; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Micco, B; Di Nardo, R; Di Petrillo, K F; Di Simone, A; Di Sipio, R; Di Valentino, D; Diaconu, C; Diamond, M; Dias, F A; Diaz, M A; Diehl, E B; Dietrich, J; Díez Cornell, S; Dimitrievska, A; Dingfelder, J; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; Djuvsland, J I; do Vale, M A B; Dobos, D; Dobre, M; Doglioni, C; Dolejsi, J; Dolezal, Z; Donadelli, M; Donati, S; Dondero, P; Donini, J; Dopke, J; Doria, A; Dova, M T; Doyle, A T; Drechsler, E; Dris, M; Du, Y; Duarte-Campderros, J; Dubreuil, A; Duchovni, E; Duckeck, G; Ducourthial, A; Ducu, O A; Duda, D; Dudarev, A; Dudder, A Chr; Duffield, E M; Duflot, L; Dührssen, M; Dumancic, M; Dumitriu, A E; Duncan, A K; Dunford, M; Duran Yildiz, H; Düren, M; Durglishvili, A; Duschinger, D; Dutta, B; Dyndal, M; Eckardt, C; Ecker, K M; Edgar, R C; Eifert, T; Eigen, G; Einsweiler, K; Ekelof, T; Kacimi, M El; Kosseifi, R El; Ellajosyula, V; Ellert, M; Elles, S; Ellinghaus, F; Elliot, A A; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Endner, O C; Ennis, J S; Erdmann, J; Ereditato, A; Ernis, G; Ernst, M; Errede, S; Escalier, M; Escobar, C; Esposito, B; Estrada Pastor, O; Etienvre, A I; Etzion, E; Evans, H; Ezhilov, A; Ezzi, M; Fabbri, F; Fabbri, L; Facini, G; Fakhrutdinov, R M; Falciano, S; Falla, R J; Faltova, J; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farina, C; Farina, E M; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Faucci Giannelli, M; Favareto, A; Fawcett, W J; Fayard, L; Fedin, O L; Fedorko, W; Feigl, S; Feligioni, L; Feng, C; Feng, E J; Feng, H; Fenton, M J; Fenyuk, A B; Feremenga, L; Fernandez Martinez, P; Fernandez Perez, S; Ferrando, J; Ferrari, A; Ferrari, P; Ferrari, R; Ferreira de Lima, D E; Ferrer, A; Ferrere, D; Ferretti, C; Fiedler, F; Filipčič, A; Filipuzzi, M; Filthaut, F; Fincke-Keeler, M; Finelli, K D; Fiolhais, M C N; Fiorini, L; Fischer, A; Fischer, C; Fischer, J; Fisher, W C; Flaschel, N; Fleck, I; Fleischmann, P; Fletcher, R R M; Flick, T; Flierl, B M; Flores Castillo, L R; Flowerdew, M J; Forcolin, G T; Formica, A; Förster, F A; Forti, A; Foster, A G; Fournier, D; Fox, H; Fracchia, S; Francavilla, P; Franchini, M; Franchino, S; Francis, D; Franconi, L; Franklin, M; Frate, M; Fraternali, M; Freeborn, D; Fressard-Batraneanu, S M; Freund, B; Froidevaux, D; Frost, J A; Fukunaga, C; Fusayasu, T; Fuster, J; Gabaldon, C; Gabizon, O; Gabrielli, A; Gabrielli, A; Gach, G P; Gadatsch, S; Gadomski, S; Gagliardi, G; Gagnon, L G; Galea, C; Galhardo, B; Gallas, E J; Gallop, B J; Gallus, P; Galster, G; Gan, K K; Ganguly, S; Gao, Y; Gao, Y S; Garay Walls, F M; García, C; García Navarro, J E; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Gascon Bravo, A; Gasnikova, K; Gatti, C; Gaudiello, A; Gaudio, G; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Gee, C N P; Geisen, J; Geisen, M; Geisler, M P; Gellerstedt, K; Gemme, C; Genest, M H; Geng, C; Gentile, S; Gentsos, C; George, S; Gerbaudo, D; Gershon, A; Geßner, G; Ghasemi, S; Ghneimat, M; Giacobbe, B; Giagu, S; Giannetti, P; Gibson, S M; Gignac, M; Gilchriese, M; Gillberg, D; Gilles, G; Gingrich, D M; Giokaris, N; Giordani, M P; Giorgi, F M; Giraud, P F; Giromini, P; Giugni, D; Giuli, F; Giuliani, C; Giulini, M; Gjelsten, B K; Gkaitatzis, S; Gkialas, I; Gkougkousis, E L; Gkountoumis, P; Gladilin, L K; Glasman, C; Glatzer, J; Glaysher, P C F; Glazov, A; Goblirsch-Kolb, M; Godlewski, J; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gonçalo, R; Goncalves Gama, R; Goncalves Pinto Firmino Da Costa, J; Gonella, G; Gonella, L; Gongadze, A; González de la Hoz, S; Gonzalez-Sevilla, S; Goossens, L; Gorbounov, P A; Gordon, H A; Gorelov, I; Gorini, B; Gorini, E; Gorišek, A; Goshaw, A T; Gössling, C; Gostkin, M I; Gottardo, C A; Goudet, C R; Goujdami, D; Goussiou, A G; Govender, N; Gozani, E; Graber, L; Grabowska-Bold, I; Gradin, P O J; Gramling, J; Gramstad, E; Grancagnolo, S; Gratchev, V; Gravila, P M; Gray, C; Gray, H M; Greenwood, Z D; Grefe, C; Gregersen, K; Gregor, I M; Grenier, P; Grevtsov, K; Griffiths, J; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grivaz, J-F; Groh, S; Gross, E; Grosse-Knetter, J; Grossi, G C; Grout, Z J; Grummer, A; Guan, L; Guan, W; Guenther, J; Guescini, F; Guest, D; Gueta, O; Gui, B; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gumpert, C; Guo, J; Guo, W; Guo, Y; Gupta, R; Gupta, S; Gustavino, G; Gutierrez, P; Gutierrez Ortiz, N G; Gutschow, C; Guyot, C; Guzik, M P; Gwenlan, C; Gwilliam, C B; Haas, A; Haber, C; Hadavand, H K; Haddad, N; Hadef, A; Hageböck, S; Hagihara, M; Hakobyan, H; Haleem, M; Haley, J; Halladjian, G; Hallewell, G D; Hamacher, K; Hamal, P; Hamano, K; Hamilton, A; Hamity, G N; Hamnett, P G; Han, L; Han, S; Hanagaki, K; Hanawa, K; Hance, M; Haney, B; Hanke, P; Hansen, J B; Hansen, J D; Hansen, M C; Hansen, P H; Hara, K; Hard, A S; Harenberg, T; Hariri, F; Harkusha, S; Harrington, R D; Harrison, P F; Hartmann, N M; Hasegawa, M; Hasegawa, Y; Hasib, A; Hassani, S; Haug, S; Hauser, R; Hauswald, L; Havener, L B; Havranek, M; Hawkes, C M; Hawkings, R J; Hayakawa, D; Hayden, D; Hays, C P; Hays, J M; Hayward, H S; Haywood, S J; Head, S J; Heck, T; Hedberg, V; Heelan, L; Heidegger, K K; Heim, S; Heim, T; Heinemann, B; Heinrich, J J; Heinrich, L; Heinz, C; Hejbal, J; Helary, L; Held, A; Hellman, S; Helsens, C; Henderson, R C W; Heng, Y; Henkelmann, S; Henriques Correia, A M; Henrot-Versille, S; Herbert, G H; Herde, H; Herget, V; Hernández Jiménez, Y; Herr, H; Herten, G; Hertenberger, R; Hervas, L; Herwig, T C; Hesketh, G G; Hessey, N P; Hetherly, J W; Higashino, S; Higón-Rodriguez, E; Hill, E; Hill, J C; Hiller, K H; Hillier, S J; Hils, M; Hinchliffe, I; Hirose, M; Hirschbuehl, D; Hiti, B; Hladik, O; Hoad, X; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoenig, F; Hohn, D; Holmes, T R; Homann, M; Honda, S; Honda, T; Hong, T M; Hooberman, B H; Hopkins, W H; Horii, Y; Horton, A J; Hostachy, J-Y; Hou, S; Hoummada, A; Howarth, J; Hoya, J; Hrabovsky, M; Hrdinka, J; Hristova, I; Hrivnac, J; Hryn'ova, T; Hrynevich, A; Hsu, P J; Hsu, S-C; Hu, Q; Hu, S; Huang, Y; Hubacek, Z; Hubaut, F; Huegging, F; Huffman, T B; Hughes, E W; Hughes, G; Huhtinen, M; Huo, P; Huseynov, N; Huston, J; Huth, J; Iacobucci, G; Iakovidis, G; Ibragimov, I; Iconomidou-Fayard, L; Idrissi, Z; Iengo, P; Igonkina, O; Iizawa, T; Ikegami, Y; Ikeno, M; Ilchenko, Y; Iliadis, D; Ilic, N; Introzzi, G; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Isacson, M F; Ishijima, N; Ishino, M; Ishitsuka, M; Issever, C; Istin, S; Ito, F; Iturbe Ponce, J M; Iuppa, R; Iwasaki, H; Izen, J M; Izzo, V; Jabbar, S; Jackson, P; Jacobs, R M; Jain, V; Jakobi, K B; Jakobs, K; Jakobsen, S; Jakoubek, T; Jamin, D O; Jana, D K; Jansky, R; Janssen, J; Janus, M; Janus, P A; Jarlskog, G; Javadov, N; Javůrek, T; Javurkova, M; Jeanneau, F; Jeanty, L; Jejelava, J; Jelinskas, A; Jenni, P; Jeske, C; Jézéquel, S; Ji, H; Jia, J; Jiang, H; Jiang, Y; Jiang, Z; Jiggins, S; Jimenez Pena, J; Jin, S; Jinaru, A; Jinnouchi, O; Jivan, H; Johansson, P; Johns, K A; Johnson, C A; Johnson, W J; Jon-And, K; Jones, R W L; Jones, S D; Jones, S; Jones, T J; Jongmanns, J; Jorge, P M; Jovicevic, J; Ju, X; Rozas, A Juste; Köhler, M K; Kaczmarska, A; Kado, M; Kagan, H; Kagan, M; Kahn, S J; Kaji, T; Kajomovitz, E; Kalderon, C W; Kaluza, A; Kama, S; Kamenshchikov, A; Kanaya, N; Kanjir, L; Kantserov, V A; Kanzaki, J; Kaplan, B; Kaplan, L S; Kar, D; Karakostas, K; Karastathis, N; Kareem, M J; Karentzos, E; Karpov, S N; Karpova, Z M; Karthik, K; Kartvelishvili, V; Karyukhin, A N; Kasahara, K; Kashif, L; Kass, R D; Kastanas, A; Kataoka, Y; Kato, C; Katre, A; Katzy, J; Kawade, K; Kawagoe, K; Kawamoto, T; Kawamura, G; Kay, E F; Kazanin, V F; Keeler, R; Kehoe, R; Keller, J S; Kempster, J J; Kendrick, J; Keoshkerian, H; Kepka, O; Kerševan, B P; Kersten, S; Keyes, R A; Khader, M; Khalil-Zada, F; Khanov, A; Kharlamov, A G; Kharlamova, T; Khodinov, A; Khoo, T J; Khovanskiy, V; Khramov, E; Khubua, J; Kido, S; Kilby, C R; Kim, H Y; Kim, S H; Kim, Y K; Kimura, N; Kind, O M; King, B T; Kirchmeier, D; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kitali, V; Kiuchi, K; Kivernyk, O; Kladiva, E; Klapdor-Kleingrothaus, T; Klein, M H; Klein, M; Klein, U; Kleinknecht, K; Klimek, P; Klimentov, A; Klingenberg, R; Klingl, T; Klioutchnikova, T; Kluge, E-E; Kluit, P; Kluth, S; Kneringer, E; Knoops, E B F G; Knue, A; Kobayashi, A; Kobayashi, D; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koffas, T; Koffeman, E; Köhler, N M; Koi, T; Kolb, M; Koletsou, I; Komar, A A; Komori, Y; Kondo, T; Kondrashova, N; Köneke, K; König, A C; Kono, T; Konoplich, R; Konstantinidis, N; Kopeliansky, R; Koperny, S; Kopp, A K; Korcyl, K; Kordas, K; Korn, A; Korol, A A; Korolkov, I; Korolkova, E V; Kortner, O; Kortner, S; Kosek, T; Kostyukhin, V V; Kotwal, A; Koulouris, A; Kourkoumeli-Charalampidi, A; Kourkoumelis, C; Kourlitis, E; Kouskoura, V; Kowalewska, A B; Kowalewski, R; Kowalski, T Z; Kozakai, C; Kozanecki, W; Kozhin, A S; Kramarenko, V A; Kramberger, G; Krasnopevtsev, D; Krasny, M W; Krasznahorkay, A; Krauss, D; Kremer, J A; Kretzschmar, J; Kreutzfeldt, K; Krieger, P; Krizka, K; Kroeninger, K; Kroha, H; Kroll, J; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Krumnack, N; Kruse, M C; Kubota, T; Kucuk, H; Kuday, S; Kuechler, J T; Kuehn, S; Kugel, A; Kuger, F; Kuhl, T; Kukhtin, V; Kukla, R; Kulchitsky, Y; Kuleshov, S; Kulinich, Y P; Kuna, M; Kunigo, T; Kupco, A; Kupfer, T; Kuprash, O; Kurashige, H; Kurchaninov, L L; Kurochkin, Y A; Kurth, M G; Kus, V; Kuwertz, E S; Kuze, M; Kvita, J; Kwan, T; Kyriazopoulos, D; La Rosa, A; La Rosa Navarro, J L; La Rotonda, L; Lacasta, C; Lacava, F; Lacey, J; Lacker, H; Lacour, D; Ladygin, E; Lafaye, R; Laforge, B; Lagouri, T; Lai, S; Lammers, S; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lanfermann, M C; Lang, V S; Lange, J C; Langenberg, R J; Lankford, A J; Lanni, F; Lantzsch, K; Lanza, A; Lapertosa, A; Laplace, S; Laporte, J F; Lari, T; Manghi, F Lasagni; Lassnig, M; Laurelli, P; Lavrijsen, W; Law, A T; Laycock, P; Lazovich, T; Lazzaroni, M; Le, B; Le Dortz, O; Le Guirriec, E; Le Quilleuc, E P; LeBlanc, M; LeCompte, T; Ledroit-Guillon, F; Lee, C A; Lee, G R; Lee, S C; Lee, L; Lefebvre, B; Lefebvre, G; Lefebvre, M; Legger, F; Leggett, C; Lehan, A; Lehmann Miotto, G; Lei, X; Leight, W A; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Leney, K J C; Lenz, T; Lenzi, B; Leone, R; Leone, S; Leonidopoulos, C; Lerner, G; Leroy, C; Lesage, A A J; Lester, C G; Levchenko, M; Levêque, J; Levin, D; Levinson, L J; Levy, M; Lewis, D; Li, B; Li, H; Li, L; Li, Q; Li, S; Li, X; Li, Y; Liang, Z; Liberti, B; Liblong, A; Lie, K; Liebal, J; Liebig, W; Limosani, A; Lin, S C; Lin, T H; Lindquist, B E; Lionti, A E; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lister, A; Litke, A M; Liu, B; Liu, H; Liu, H; Liu, J K K; Liu, J; Liu, J B; Liu, K; Liu, L; Liu, M; Liu, Y L; Liu, Y; Livan, M; Lleres, A; Llorente Merino, J; Lloyd, S L; Lo, C Y; Sterzo, F Lo; Lobodzinska, E M; Loch, P; Loebinger, F K; Loesle, A; Loew, K M; Loginov, A; Lohse, T; Lohwasser, K; Lokajicek, M; Long, B A; Long, J D; Long, R E; Longo, L; Looper, K A; Lopez, J A; Lopez Mateos, D; Lopez Paz, I; Solis, A Lopez; Lorenz, J; Lorenzo Martinez, N; Losada, M; Lösel, P J; Lou, X; Lounis, A; Love, J; Love, P A; Lu, H; Lu, N; Lu, Y J; Lubatti, H J; Luci, C; Lucotte, A; Luedtke, C; Luehring, F; Lukas, W; Luminari, L; Lundberg, O; Lund-Jensen, B; Luzi, P M; Lynn, D; Lysak, R; Lytken, E; Lyubushkin, V; Ma, H; Ma, L L; Ma, Y; Maccarrone, G; Macchiolo, A; Macdonald, C M; Maček, B; Machado Miguens, J; Madaffari, D; Madar, R; Mader, W F; Madsen, A; Maeda, J; Maeland, S; Maeno, T; Maevskiy, A S; Magerl, V; Mahlstedt, J; Maiani, C; Maidantchik, C; Maier, A A; Maier, T; Maio, A; Majersky, O; Majewski, S; Makida, Y; Makovec, N; Malaescu, B; Malecki, Pa; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyukov, S; Mamuzic, J; Mancini, G; Mandelli, L; Mandić, I; Maneira, J; Manhaes de Andrade Filho, L; Manjarres Ramos, J; Mann, A; Manousos, A; Mansoulie, B; Mansour, J D; Mantifel, R; Mantoani, M; Manzoni, S; Mapelli, L; Marceca, G; March, L; Marchese, L; Marchiori, G; Marcisovsky, M; Marjanovic, M; Marley, D E; Marroquim, F; Marsden, S P; Marshall, Z; Martensson, M U F; Marti-Garcia, S; Martin, C B; Martin, T A; Martin, V J; Martin Dit Latour, B; Martinez, M; Martinez Outschoorn, V I; Martin-Haugh, S; Martoiu, V S; Martyniuk, A C; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Massa, L; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Mättig, P; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Maznas, I; Mazza, S M; Mc Fadden, N C; Goldrick, G Mc; Mc Kee, S P; McCarn, A; McCarthy, R L; McCarthy, T G; McClymont, L I; McDonald, E F; Mcfayden, J A; Mchedlidze, G; McMahon, S J; McNamara, P C; McPherson, R A; Meehan, S; Megy, T J; Mehlhase, S; Mehta, A; Meideck, T; Meier, K; Meirose, B; Melini, D; Mellado Garcia, B R; Mellenthin, J D; Melo, M; Meloni, F; Menary, S B; Meng, L; Meng, X T; Mengarelli, A; Menke, S; Meoni, E; Mergelmeyer, S; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, J-P; Meyer, J; Meyer Zu Theenhausen, H; Miano, F; Middleton, R P; Miglioranzi, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Milesi, M; Milic, A; Miller, D W; Mills, C; Milov, A; Milstead, D A; Minaenko, A A; Minami, Y; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Minegishi, Y; Ming, Y; Mir, L M; Mistry, K P; Mitani, T; Mitrevski, J; Mitsou, V A; Miucci, A; Miyagawa, P S; Mizukami, A; Mjörnmark, J U; Mkrtchyan, T; Mlynarikova, M; Moa, T; Mochizuki, K; Mogg, P; Mohapatra, S; Molander, S; Moles-Valls, R; Monden, R; Mondragon, M C; Mönig, K; Monk, J; Monnier, E; Montalbano, A; Montejo Berlingen, J; Monticelli, F; Monzani, S; Moore, R W; Morange, N; Moreno, D; Moreno Llácer, M; Morettini, P; Morgenstern, S; Mori, D; Mori, T; Morii, M; Morinaga, M; Morisbak, V; Morley, A K; Mornacchi, G; Morris, J D; Morvaj, L; Moschovakos, P; Mosidze, M; Moss, H J; Moss, J; Motohashi, K; Mount, R; Mountricha, E; Moyse, E J W; Muanza, S; Mudd, R D; Mueller, F; Mueller, J; Mueller, R S P; Muenstermann, D; Mullen, P; Mullier, G A; Munoz Sanchez, F J; Murray, W J; Musheghyan, H; Muškinja, M; Myagkov, A G; Myska, M; Nachman, B P; Nackenhorst, O; Nagai, K; Nagai, R; Nagano, K; Nagasaka, Y; Nagata, K; Nagel, M; Nagy, E; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Naranjo Garcia, R F; Narayan, R; Narrias Villar, D I; Naryshkin, I; Naumann, T; Navarro, G; Nayyar, R; Neal, H A; Nechaeva, P Yu; Neep, T J; Negri, A; Negrini, M; Nektarijevic, S; Nellist, C; Nelson, A; Nelson, M E; Nemecek, S; Nemethy, P; Nessi, M; Neubauer, M S; Neumann, M; Newman, P R; Ng, T Y; Nguyen Manh, T; Nickerson, R B; Nicolaidou, R; Nielsen, J; Nikolaenko, V; Nikolic-Audit, I; Nikolopoulos, K; Nilsen, J K; Nilsson, P; Ninomiya, Y; Nisati, A; Nishu, N; Nisius, R; Nitsche, I; Nobe, T; Noguchi, Y; Nomachi, M; Nomidis, I; Nomura, M A; Nooney, T; Nordberg, M; Norjoharuddeen, N; Novgorodova, O; Nowak, S; Nozaki, M; Nozka, L; Ntekas, K; Nurse, E; Nuti, F; O'connor, K; O'Neil, D C; O'Rourke, A A; O'Shea, V; Oakham, F G; Oberlack, H; Obermann, T; Ocariz, J; Ochi, A; Ochoa, I; Ochoa-Ricoux, J P; Oda, S; Odaka, S; Ogren, H; Oh, A; Oh, S H; Ohm, C C; Ohman, H; Oide, H; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Oleiro Seabra, L F; Olivares Pino, S A; Oliveira Damazio, D; Olszewski, A; Olszowska, J; Onofre, A; Onogi, K; Onyisi, P U E; Oppen, H; Oreglia, M J; Oren, Y; Orestano, D; Orlando, N; Orr, R S; Osculati, B; Ospanov, R; Otero Y Garzon, G; Otono, H; Ouchrif, M; Ould-Saada, F; Ouraou, A; Oussoren, K P; Ouyang, Q; Owen, M; Owen, R E; Ozcan, V E; Ozturk, N; Pachal, K; Pacheco Pages, A; Pacheco Rodriguez, L; Padilla Aranda, C; Pagan Griso, S; Paganini, M; Paige, F; Palacino, G; Palazzo, S; Palestini, S; Palka, M; Pallin, D; Panagiotopoulou, E St; Panagoulias, I; Pandini, C E; Panduro Vazquez, J G; Pani, P; Panitkin, S; Pantea, D; Paolozzi, L; Papadopoulou, Th D; Papageorgiou, K; Paramonov, A; Paredes Hernandez, D; Parker, A J; Parker, M A; Parker, K A; Parodi, F; Parsons, J A; Parzefall, U; Pascuzzi, V R; Pasner, J M; Pasqualucci, E; Passaggio, S; Pastore, Fr; Pataraia, S; Pater, J R; Pauly, T; Pearson, B; Pedraza Lopez, S; Pedro, R; Peleganchuk, S V; Penc, O; Peng, C; Peng, H; Penwell, J; Peralva, B S; Perego, M M; Perepelitsa, D V; Perini, L; Pernegger, H; Perrella, S; Peschke, R; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petroff, P; Petrolo, E; Petrov, M; Petrucci, F; Pettersson, N E; Peyaud, A; Pezoa, R; Phillips, F H; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Piccaro, E; Pickering, M A; Piegaia, R; Pilcher, J E; Pilkington, A D; Pin, A W J; Pinamonti, M; Pinfold, J L; Pirumov, H; Pitt, M; Plazak, L; Pleier, M-A; Pleskot, V; Plotnikova, E; Pluth, D; Podberezko, P; Poettgen, R; Poggi, R; Poggioli, L; Pohl, D; Polesello, G; Poley, A; Policicchio, A; Polifka, R; Polini, A; Pollard, C S; Polychronakos, V; Pommès, K; Ponomarenko, D; Pontecorvo, L; Pope, B G; Popeneciu, G A; Poppleton, A; Pospisil, S; Potamianos, K; Potrap, I N; Potter, C J; Poulard, G; Poulsen, T; Poveda, J; Pozo Astigarraga, M E; Pralavorio, P; Pranko, A; Prell, S; Price, D; Price, L E; Primavera, M; Prince, S; Proklova, N; Prokofiev, K; Prokoshin, F; Protopopescu, S; Proudfoot, J; Przybycien, M; Puri, A; Puzo, P; Qian, J; Qin, G; Qin, Y; Quadt, A; Queitsch-Maitland, M; Quilty, D; Raddum, S; Radeka, V; Radescu, V; Radhakrishnan, S K; Radloff, P; Rados, P; Ragusa, F; Rahal, G; Raine, J A; Rajagopalan, S; Rangel-Smith, C; Rashid, T; Raspopov, S; Ratti, M G; Rauch, D M; Rauscher, F; Rave, S; Ravinovich, I; Rawling, J H; Raymond, M; Read, A L; Readioff, N P; Reale, M; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reed, R G; Reeves, K; Rehnisch, L; Reichert, J; Reiss, A; Rembser, C; Ren, H; Rescigno, M; Resconi, S; Resseguie, E D; Rettie, S; Reynolds, E; Rezanova, O L; Reznicek, P; Rezvani, R; Richter, R; Richter, S; Richter-Was, E; Ricken, O; Ridel, M; Rieck, P; Riegel, C J; Rieger, J; Rifki, O; Rijssenbeek, M; Rimoldi, A; Rimoldi, M; Rinaldi, L; Ripellino, G; Ristić, B; Ritsch, E; Riu, I; Rizatdinova, F; Rizvi, E; Rizzi, C; Roberts, R T; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Rocco, E; Roda, C; Rodina, Y; Rodriguez Bosca, S; Rodriguez Perez, A; Rodriguez Rodriguez, D; Roe, S; Rogan, C S; Røhne, O; Roloff, J; Romaniouk, A; Romano, M; Romano Saez, S M; Romero Adam, E; Rompotis, N; Ronzani, M; Roos, L; Rosati, S; Rosbach, K; Rose, P; Rosien, N-A; Rossi, E; Rossi, L P; Rosten, J H N; Rosten, R; Rotaru, M; Roth, I; Rothberg, J; Rousseau, D; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rühr, F; Ruiz-Martinez, A; Rurikova, Z; Rusakovich, N A; Russell, H L; Rutherfoord, J P; Ruthmann, N; Ryabov, Y F; Rybar, M; Rybkin, G; Ryu, S; Ryzhov, A; Rzehorz, G F; Saavedra, A F; Sabato, G; Sacerdoti, S; Sadrozinski, H F-W; Sadykov, R; Safai Tehrani, F; Saha, P; Sahinsoy, M; Saimpert, M; Saito, M; Saito, T; Sakamoto, H; Sakurai, Y; Salamanna, G; Salazar Loyola, J E; Salek, D; De Bruin, P H Sales; Salihagic, D; Salnikov, A; Salt, J; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sammel, D; Sampsonidis, D; Sampsonidou, D; Sánchez, J; Sanchez Martinez, V; Sanchez Pineda, A; Sandaker, H; Sandbach, R L; Sander, C O; Sandhoff, M; Sandoval, C; Sankey, D P C; Sannino, M; Sansoni, A; Santoni, C; Santonico, R; Santos, H; Santoyo Castillo, I; Sapronov, A; Saraiva, J G; Sarrazin, B; Sasaki, O; Sato, K; Sauvan, E; Savage, G; Savard, P; Savic, N; Sawyer, C; Sawyer, L; Saxon, J; Sbarra, C; Sbrizzi, A; Scanlon, T; Scannicchio, D A; Scarcella, M; Scarfone, V; Schaarschmidt, J; Schacht, P; Schachtner, B M; Schaefer, D; Schaefer, L; Schaefer, R; Schaeffer, J; Schaepe, S; Schaetzel, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Scharf, V; Schegelsky, V A; Scheirich, D; Schernau, M; Schiavi, C; Schier, S; Schildgen, L K; Schillo, C; Schioppa, M; Schlenker, S; Schmidt-Sommerfeld, K R; Schmieden, K; Schmitt, C; Schmitt, S; Schmitz, S; Schnoor, U; Schoeffel, L; Schoening, A; Schoenrock, B D; Schopf, E; Schott, M; Schouwenberg, J F P; Schovancova, J; Schramm, S; Schuh, N; Schulte, A; Schultens, M J; Schultz-Coulon, H-C; Schulz, H; Schumacher, M; Schumm, B A; Schune, Ph; Schwartzman, A; Schwarz, T A; Schweiger, H; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Sciandra, A; Sciolla, G; Scuri, F; Scutti, F; Searcy, J; Seema, P; Seidel, S C; Seiden, A; Seixas, J M; Sekhniaidze, G; Sekhon, K; Sekula, S J; Semprini-Cesari, N; Senkin, S; Serfon, C; Serin, L; Serkin, L; Sessa, M; Seuster, R; Severini, H; Sfiligoj, T; Sforza, F; Sfyrla, A; Shabalina, E; Shaikh, N W; Shan, L Y; Shang, R; Shank, J T; Shapiro, M; Shatalov, P B; Shaw, K; Shaw, S M; Shcherbakova, A; Shehu, C Y; Shen, Y; Sherafati, N; Sherwood, P; Shi, L; Shimizu, S; Shimmin, C O; Shimojima, M; Shipsey, I P J; Shirabe, S; Shiyakova, M; Shlomi, J; Shmeleva, A; Shoaleh Saadi, D; Shochet, M J; Shojaii, S; Shope, D R; Shrestha, S; Shulga, E; Shupe, M A; Sicho, P; Sickles, A M; Sidebo, P E; Sideras Haddad, E; Sidiropoulou, O; Sidoti, A; Siegert, F; Sijacki, Dj; Silva, J; Silverstein, S B; Simak, V; Simic, Lj; Simion, S; Simioni, E; Simmons, B; Simon, M; Sinervo, P; Sinev, N B; Sioli, M; Siragusa, G; Siral, I; Sivoklokov, S Yu; Sjölin, J; Skinner, M B; Skubic, P; Slater, M; Slavicek, T; Slawinska, M; Sliwa, K; Slovak, R; Smakhtin, V; Smart, B H; Smiesko, J; Smirnov, N; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, J W; Smith, M N K; Smith, R W; Smizanska, M; Smolek, K; Snesarev, A A; Snyder, I M; Snyder, S; Sobie, R; Socher, F; Soffer, A; Søgaard, A; Soh, D A; Sokhrannyi, G; Solans Sanchez, C A; Solar, M; Soldatov, E Yu; Soldevila, U; Solodkov, A A; Soloshenko, A; Solovyanov, O V; Solovyev, V; Sommer, P; Son, H; Sopczak, A; Sosa, D; Sotiropoulou, C L; Soualah, R; Soukharev, A M; South, D; Sowden, B C; Spagnolo, S; Spalla, M; Spangenberg, M; Spanò, F; Sperlich, D; Spettel, F; Spieker, T M; Spighi, R; Spigo, G; Spiller, L A; Spousta, M; St Denis, R D; Stabile, A; Stamen, R; Stamm, S; Stanecka, E; Stanek, R W; Stanescu, C; Stanitzki, M M; Stapf, B S; Stapnes, S; Starchenko, E A; Stark, G H; Stark, J; Stark, S H; Staroba, P; Starovoitov, P; Stärz, S; Staszewski, R; Steinberg, P; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stewart, G A; Stockton, M C; Stoebe, M; Stoicea, G; Stolte, P; Stonjek, S; Stradling, A R; Straessner, A; Stramaglia, M E; Strandberg, J; Strandberg, S; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Stroynowski, R; Strubig, A; Stucci, S A; Stugu, B; Styles, N A; Su, D; Su, J; Suchek, S; Sugaya, Y; Suk, M; Sulin, V V; Sultan, Dms; Sultansoy, S; Sumida, T; Sun, S; Sun, X; Suruliz, K; Suster, C J E; Sutton, M R; Suzuki, S; Svatos, M; Swiatlowski, M; Swift, S P; Sykora, I; Sykora, T; Ta, D; Tackmann, K; Taenzer, J; Taffard, A; Tafirout, R; Tahirovic, E; Taiblum, N; Takai, H; Takashima, R; Takasugi, E H; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A A; Tanaka, J; Tanaka, M; Tanaka, R; Tanaka, S; Tanioka, R; Tannenwald, B B; Tapia Araya, S; Tapprogge, S; Tarem, S; Tartarelli, G F; Tas, P; Tasevsky, M; Tashiro, T; Tassi, E; Tavares Delgado, A; Tayalati, Y; Taylor, A C; Taylor, G N; Taylor, P T E; Taylor, W; Teixeira-Dias, P; Temple, D; Ten Kate, H; Teng, P K; Teoh, J J; Tepel, F; Terada, S; Terashi, K; Terron, J; Terzo, S; Testa, M; Teuscher, R J; Theveneaux-Pelzer, T; Thomas, J P; Thomas-Wilsker, J; Thompson, P D; Thompson, A S; Thomsen, L A; Thomson, E; Tibbetts, M J; Ticse Torres, R E; Tikhomirov, V O; Tikhonov, Yu A; Timoshenko, S; Tipton, P; Tisserant, S; Todome, K; Todorova-Nova, S; Tojo, J; Tokár, S; Tokushuku, K; Tolley, E; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Tong, B; Tornambe, P; Torrence, E; Torres, H; Torró Pastor, E; Toth, J; Touchard, F; Tovey, D R; Treado, C J; Trefzger, T; Tresoldi, F; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Trischuk, W; Trocmé, B; Trofymov, A; Troncon, C; Trottier-McDonald, M; Trovatelli, M; Truong, L; Trzebinski, M; Trzupek, A; Tsang, K W; Tseng, J C-L; Tsiareshka, P V; Tsipolitis, G; Tsirintanis, N; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsui, K M; Tsukerman, I I; Tsulaia, V; Tsuno, S; Tsybychev, D; Tu, Y; Tudorache, A; Tudorache, V; Tulbure, T T; Tuna, A N; Tupputi, S A; Turchikhin, S; Turgeman, D; Turk Cakir, I; Turra, R; Tuts, P M; Ucchielli, G; Ueda, I; Ughetto, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Unverdorben, C; Urban, J; Urquijo, P; Urrejola, P; Usai, G; Usui, J; Vacavant, L; Vacek, V; Vachon, B; Vadla, K O H; Vaidya, A; Valderanis, C; Valdes Santurio, E; Valente, M; Valentinetti, S; Valero, A; Valéry, L; Valkar, S; Vallier, A; Valls Ferrer, J A; Van Den Wollenberg, W; van der Graaf, H; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; van Woerden, M C; Vanadia, M; Vandelli, W; Vaniachine, A; Vankov, P; Vardanyan, G; Vari, R; Varnes, E W; Varni, C; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vasquez, J G; Vasquez, G A; Vazeille, F; Vazquez Schroeder, T; Veatch, J; Veeraraghavan, V; Veloce, L M; Veloso, F; Veneziano, S; Ventura, A; Venturi, M; Venturi, N; Venturini, A; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, A T; Vermeulen, J C; Vetterli, M C; Viaux Maira, N; Viazlo, O; Vichou, I; Vickey, T; Vickey Boeriu, O E; Viehhauser, G H A; Viel, S; Vigani, L; Villa, M; Villaplana Perez, M; Vilucchi, E; Vincter, M G; Vinogradov, V B; Vishwakarma, A; Vittori, C; Vivarelli, I; Vlachos, S; Vlasak, M; Vogel, M; Vokac, P; Volpi, G; von der Schmitt, H; von Toerne, E; Vorobel, V; Vorobev, K; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Vranjes Milosavljevic, M; Vrba, V; Vreeswijk, M; Vuillermet, R; Vukotic, I; Wagner, P; Wagner, W; Wagner-Kuhr, J; Wahlberg, H; Wahrmund, S; Wakabayashi, J; Walder, J; Walker, R; Walkowiak, W; Wallangen, V; Wang, C; Wang, C; Wang, F; Wang, H; Wang, H; Wang, J; Wang, J; Wang, Q; Wang, R; Wang, S M; Wang, T; Wang, W; Wang, W; Wang, Z; Wanotayaroj, C; Warburton, A; Ward, C P; Wardrope, D R; Washbrook, A; Watkins, P M; Watson, A T; Watson, M F; Watts, G; Watts, S; Waugh, B M; Webb, A F; Webb, S; Weber, M S; Weber, S W; Weber, S A; Webster, J S; Weidberg, A R; Weinert, B; Weingarten, J; Weirich, M; Weiser, C; Weits, H; Wells, P S; Wenaus, T; Wengler, T; Wenig, S; Wermes, N; Werner, M D; Werner, P; Wessels, M; Weston, T D; Whalen, K; Whallon, N L; Wharton, A M; White, A S; White, A; White, M J; White, R; Whiteson, D; Whitmore, B W; Wickens, F J; Wiedenmann, W; Wielers, M; Wiglesworth, C; Wiik-Fuchs, L A M; Wildauer, A; Wilk, F; Wilkens, H G; Williams, H H; Williams, S; Willis, C; Willocq, S; Wilson, J A; Wingerter-Seez, I; Winkels, E; Winklmeier, F; Winston, O J; Winter, B T; Wittgen, M; Wobisch, M; Wolf, T M H; Wolff, R; Wolter, M W; Wolters, H; Wong, V W S; Worm, S D; Wosiek, B K; Wotschack, J; Wozniak, K W; Wu, M; Wu, S L; Wu, X; Wu, Y; Wyatt, T R; Wynne, B M; Xella, S; Xi, Z; Xia, L; Xu, D; Xu, L; Yabsley, B; Yacoob, S; Yamaguchi, D; Yamaguchi, Y; Yamamoto, A; Yamamoto, S; Yamanaka, T; Yamatani, M; Yamauchi, K; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, Y; Yang, Z; Yao, W-M; Yap, Y C; Yasu, Y; Yatsenko, E; Yau Wong, K H; Ye, J; Ye, S; Yeletskikh, I; Yigitbasi, E; Yildirim, E; Yorita, K; Yoshihara, K; Young, C; Young, C J S; Yu, J; Yu, J; Yuen, S P Y; Yusuff, I; Zabinski, B; Zacharis, G; Zaidan, R; Zaitsev, A M; Zakharchuk, N; Zalieckas, J; Zaman, A; Zambito, S; Zanzi, D; Zeitnitz, C; Zemaityte, G; Zemla, A; Zeng, J C; Zeng, Q; Zenin, O; Ženiš, T; Zerwas, D; Zhang, D; Zhang, F; Zhang, G; Zhang, H; Zhang, J; Zhang, L; Zhang, L; Zhang, M; Zhang, P; Zhang, R; Zhang, R; Zhang, X; Zhang, Y; Zhang, Z; Zhao, X; Zhao, Y; Zhao, Z; Zhemchugov, A; Zhou, B; Zhou, C; Zhou, L; Zhou, M; Zhou, M; Zhou, N; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhukov, K; Zibell, A; Zieminska, D; Zimine, N I; Zimmermann, C; Zimmermann, S; Zinonos, Z; Zinser, M; Ziolkowski, M; Živković, L; Zobernig, G; Zoccoli, A; Zou, R; Zur Nedden, M; Zwalinski, L

2017-01-01

With the increase in energy of the Large Hadron Collider to a centre-of-mass energy of 13 [Formula: see text] for Run 2, events with dense environments, such as in the cores of high-energy jets, became a focus for new physics searches as well as measurements of the Standard Model. These environments are characterized by charged-particle separations of the order of the tracking detectors sensor granularity. Basic track quantities are compared between 3.2 fb[Formula: see text] of data collected by the ATLAS experiment and simulation of proton-proton collisions producing high-transverse-momentum jets at a centre-of-mass energy of 13 [Formula: see text]. The impact of charged-particle separations and multiplicities on the track reconstruction performance is discussed. The track reconstruction efficiency in the cores of jets with transverse momenta between 200 and 1600 [Formula: see text] is quantified using a novel, data-driven, method. The method uses the energy loss, [Formula: see text], to identify pixel clusters originating from two charged particles. Of the charged particles creating these clusters, the measured fraction that fail to be reconstructed is [Formula: see text] and [Formula: see text] for jet transverse momenta of 200-400 [Formula: see text] and 1400-1600 [Formula: see text], respectively.

Quantification of motion of the thoracic aorta after ascending aortic repair of type-A dissection.

PubMed

Suh, Ga-Young; Fleischmann, Dominik; Beygui, Ramin E; Cheng, Christopher P

2017-05-01

To quantify cardiac and respiratory deformations of the thoracic aorta after ascending aortic graft repair. Eight patients were scanned with cardiac-resolved computed tomography angiography during inspiratory/expiratory breath-holds. Aortic centerlines and lumen were extracted to compute the arclength, curvature, angulation, and cross-section shape. From systole to diastole, the angle of graft [Formula: see text] arch increased by 2.4[Formula: see text] ± 1.8[Formula: see text] (P < 0.01) and the angle of arch [Formula: see text] descending aorta decreased by 2.4[Formula: see text] ± 2.6[Formula: see text] (P < 0.05), while the effective diameter of the proximal arch decreased by 2.4 ± 1.9% (P < 0.01), a greater change than those of the graft or distal arch (P < 0.05). From inspiration to expiration, the angle of graft [Formula: see text] arch increased by 2.8[Formula: see text] ± 2.6[Formula: see text] (P < 0.02) with the peak curvature increase (P < 0.05). Shorter graft length was correlated with greater cardiac-induced graft [Formula: see text] arch angulation, and longer graft length was correlated with greater respiratory-induced arch [Formula: see text] descending aorta angulation (R [Formula: see text] 0.50). The thoracic aorta changed curvature and angulation with cardiac and respiratory influences, driven by aortic root and arch motion. The thoracic aortic geometry and deformation are correlated with the ascending aortic graft length.

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.

Quantifying uncertainty in climate change science through empirical information theory.

PubMed

Majda, Andrew J; Gershgorin, Boris

2010-08-24

Quantifying the uncertainty for the present climate and the predictions of climate change in the suite of imperfect Atmosphere Ocean Science (AOS) computer models is a central issue in climate change science. Here, a systematic approach to these issues with firm mathematical underpinning is developed through empirical information theory. An information metric to quantify AOS model errors in the climate is proposed here which incorporates both coarse-grained mean model errors as well as covariance ratios in a transformation invariant fashion. The subtle behavior of model errors with this information metric is quantified in an instructive statistically exactly solvable test model with direct relevance to climate change science including the prototype behavior of tracer gases such as CO(2). Formulas for identifying the most sensitive climate change directions using statistics of the present climate or an AOS model approximation are developed here; these formulas just involve finding the eigenvector associated with the largest eigenvalue of a quadratic form computed through suitable unperturbed climate statistics. These climate change concepts are illustrated on a statistically exactly solvable one-dimensional stochastic model with relevance for low frequency variability of the atmosphere. Viable algorithms for implementation of these concepts are discussed throughout the paper.

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.

Boolean network representation of contagion dynamics during a financial crisis

NASA Astrophysics Data System (ADS)

Caetano, Marco Antonio Leonel; Yoneyama, Takashi

2015-01-01

This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.

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.

Toward Question-Asking Machines: The Logic of Questions and the Inquiry Calculus

NASA Technical Reports Server (NTRS)

Knuth,Kevin H.

2005-01-01

For over a century, the study of logic has focused on the algebra of logical statements. This work, first performed by George Boole, has led to the development of modern computers, and was shown by Richard T. Cox to be the foundation of Bayesian inference. Meanwhile the logic of questions has been much neglected. For our computing machines to be truly intelligent, they need to be able to ask relevant questions. In this paper I will show how the Boolean lattice of logical statements gives rise to the free distributive lattice of questions thus defining their algebra. Furthermore, there exists a quantity analogous to probability, called relevance, which quantifies the degree to which one question answers another. I will show that relevance is not only a natural generalization of information theory, but also forms its foundation.

Complexity of generic biochemical circuits: topology versus strength of interactions.

PubMed

Tikhonov, Mikhail; Bialek, William

2016-12-06

The historical focus on network topology as a determinant of biological function is still largely maintained today, illustrated by the rise of structure-only approaches to network analysis. However, biochemical circuits and genetic regulatory networks are defined both by their topology and by a multitude of continuously adjustable parameters, such as the strength of interactions between nodes, also recognized as important. Here we present a class of simple perceptron-based Boolean models within which comparing the relative importance of topology versus interaction strengths becomes a quantitatively well-posed problem. We quantify the intuition that for generic networks, optimization of interaction strengths is a crucial ingredient of achieving high complexity, defined here as the number of fixed points the network can accommodate. We propose a new methodology for characterizing the relative role of parameter optimization for topologies of a given class.

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.

Just How Bright Is a Laser?

ERIC Educational Resources Information Center

Van Baak, David A.

1995-01-01

Attempts to quantify the subjective sensation of brightness of the spot projected by a helium-neon laser and compares this with conventional sources of light. Provides an exercise in using the blackbody radiation formulas. (JRH)

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

Regional lung ventilation and perfusion by electrical impedance tomography compared to single-photon emission computed tomography.

PubMed

Hentze, Benjamin; Muders, Thomas; Luepschen, Henning; Maripuu, Enn; Hedenstierna, Göran; Putensen, Christian; Walter, Marian; Leonhardt, Steffen

2018-06-20

Electrical impedance tomography (EIT) is a noninvasive imaging modality that allows real-time monitoring of regional lung ventilation ([Formula: see text]) in intensive care patients at bedside. However, for improved guidance of ventilation therapy it would be beneficial to obtain regional ventilation-to-perfusion ratio ([Formula: see text]) by EIT. In order to further explore the feasibility, we first evaluate a model-based approach, based on semi-negative matrix factorization and a gamma-variate model, to extract regional lung perfusion ([Formula: see text]) from EIT measurements. Subsequently, a combined validation of both [Formula: see text] and [Formula: see text] measured by EIT against single-photon emission computed tomography (SPECT) is performed on data acquired as part of a porcine animal trial. Four pigs were ventilated at two different levels of positive end-expiratory pressure (PEEP 0 and 15 cm H 2 O, respectively) in randomized order. Repeated injections of an EIT contrast agent (NaCl 10%) and simultaneous SPECT measurements of [Formula: see text] (81 m Kr gas) and [Formula: see text] (99 m Tc-labeled albumin) were performed. Both [Formula: see text] and [Formula: see text] from EIT and SPECT were compared by correlation analysis. Very strong (r 2   =  0.94 to 0.95) correlations were found for [Formula: see text] and [Formula: see text] in the dorsal-ventral direction at both PEEP levels. Moderate (r 2   =  0.36 to 0.46) and moderate to strong (r 2   =  0.61 to 0.82) correlations resulted for [Formula: see text] and [Formula: see text] in the right-left direction, respectively. The results of combined validation indicate that monitoring of [Formula: see text] and [Formula: see text] by EIT is possible. However, care should be taken when trying to quantify [Formula: see text] by EIT, as imaging artefacts and model bias may void necessary spatial matching.

Evaluation of Method-Specific Extraction Variability for the Measurement of Fatty Acids in a Candidate Infant/Adult Nutritional Formula Reference Material.

PubMed

Place, Benjamin J

2017-05-01

To address community needs, the National Institute of Standards and Technology has developed a candidate Standard Reference Material (SRM) for infant/adult nutritional formula based on milk and whey protein concentrates with isolated soy protein called SRM 1869 Infant/Adult Nutritional Formula. One major component of this candidate SRM is the fatty acid content. In this study, multiple extraction techniques were evaluated to quantify the fatty acids in this new material. Extraction methods that were based on lipid extraction followed by transesterification resulted in lower mass fraction values for all fatty acids than the values measured by methods utilizing in situ transesterification followed by fatty acid methyl ester extraction (ISTE). An ISTE method, based on the identified optimal parameters, was used to determine the fatty acid content of the new infant/adult nutritional formula reference material.

Energy decomposition analysis of single bonds within Kohn-Sham density functional theory.

PubMed

Levine, Daniel S; Head-Gordon, Martin

2017-11-28

An energy decomposition analysis (EDA) for single chemical bonds is presented within the framework of Kohn-Sham density functional theory based on spin projection equations that are exact within wave function theory. Chemical bond energies can then be understood in terms of stabilization caused by spin-coupling augmented by dispersion, polarization, and charge transfer in competition with destabilizing Pauli repulsions. The EDA reveals distinguishing features of chemical bonds ranging across nonpolar, polar, ionic, and charge-shift bonds. The effect of electron correlation is assessed by comparison with Hartree-Fock results. Substituent effects are illustrated by comparing the C-C bond in ethane against that in bis(diamantane), and dispersion stabilization in the latter is quantified. Finally, three metal-metal bonds in experimentally characterized compounds are examined: a [Formula: see text]-[Formula: see text] dimer, the [Formula: see text]-[Formula: see text] bond in dizincocene, and the Mn-Mn bond in dimanganese decacarbonyl.

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.

Establishing the diffuse correlation spectroscopy signal relationship with blood flow.

PubMed

Boas, David A; Sakadžić, Sava; Selb, Juliette; Farzam, Parisa; Franceschini, Maria Angela; Carp, Stefan A

2016-07-01

Diffuse correlation spectroscopy (DCS) measurements of blood flow rely on the sensitivity of the temporal autocorrelation function of diffusively scattered light to red blood cell (RBC) mean square displacement (MSD). For RBCs flowing with convective velocity [Formula: see text], the autocorrelation is expected to decay exponentially with [Formula: see text], where [Formula: see text] is the delay time. RBCs also experience shear-induced diffusion with a diffusion coefficient [Formula: see text] and an MSD of [Formula: see text]. Surprisingly, experimental data primarily reflect diffusive behavior. To provide quantitative estimates of the relative contributions of convective and diffusive movements, we performed Monte Carlo simulations of light scattering through tissue of varying vessel densities. We assumed laminar vessel flow profiles and accounted for shear-induced diffusion effects. In agreement with experimental data, we found that diffusive motion dominates the correlation decay for typical DCS measurement parameters. Furthermore, our model offers a quantitative relationship between the RBC diffusion coefficient and absolute tissue blood flow. We thus offer, for the first time, theoretical support for the empirically accepted ability of the DCS blood flow index ([Formula: see text]) to quantify tissue perfusion. We find [Formula: see text] to be linearly proportional to blood flow, but with a proportionality modulated by the hemoglobin concentration and the average blood vessel diameter.

Occurrence of 3-monochloropropanediol esters and glycidyl esters in commercial infant formulas in the United States.

PubMed

Leigh, Jessica; MacMahon, Shaun

2017-03-01

This work presents occurrence data for fatty acid esters of 3-chloro-1,2-propanediol (3-MCPD) and glycidol in 98 infant formula samples purchased in the United States. These contaminants are considered potentially carcinogenic and/or genotoxic, making their presence in refined oils and foods a potential health risk. Recently, attention has focused on methodology to quantify MCPD and glycidyl esters in infant formula for risk-assessment purposes. Occurrence data for 3-MCPD and glycidyl esters were produced using a procedure for extracting fat from infant formula and an LC-MS/MS method for analysing fat extracts for intact esters. Infant formulas were produced by seven manufacturers, five of which use palm oil and/or palm olein in their formulations. In formulas containing palm/palm olein, concentrations for bound 3-MCPD and glycidol ranged from 0.021 to 0.92 mg kg - 1 (ppm) and from < LOQ to 0.40 mg kg - 1 (ppm), respectively. Formulas not containing palm/palm olein, bound 3-MCPD and glycidol concentrations ranged from 0.072 to 0.16 mg kg - 1 (ppm) and from 0.005 to 0.15 mg kg - 1 (ppm), respectively. Although formulas from manufacturers A and G did not contain palm/palm olein, formulas from manufacturer E (containing palm olein) had the lowest concentrations of bound 3-MCPD and glycidol, demonstrating the effectiveness of industrial mitigation strategies.

Development of an active food packaging system with antioxidant properties based on green tea extract.

PubMed

Carrizo, Daniel; Gullo, Giuseppe; Bosetti, Osvaldo; Nerín, Cristina

2014-01-01

A formula including green tea extract (GTE) was developed as an active food packaging material. This formula was moulded to obtain an independent component/device with antioxidant properties that could be easily coupled to industrial degassing valves for food packaging in special cases. GTE components (i.e., gallic acid, catechins and caffeine) were identified and quantified by HPLC-UV and UPLC-MS and migration/diffusion studies were carried out. Antioxidant properties of the formula alone and formula-valve were measured with static and dynamic methods. The results showed that the antioxidant capacity (scavenging of free radicals) of the new GTE formula was 40% higher than the non-active system (blank). This antioxidant activity increased in parallel with the GTE concentration. The functional properties of the industrial target valve (e.g., flexibility) were studied for different mixtures of GTE, and good results were found with 17% (w/w) of GTE. This new active formula can be an important addition for active packaging applications in the food packaging industry, with oxidative species-scavenging capacity, thus improving the safety and quality for the consumer and extending the shelf-life of the packaged food.

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.

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.

Origins of Chaos in Autonomous Boolean Networks

NASA Astrophysics Data System (ADS)

Socolar, Joshua; Cavalcante, Hugo; Gauthier, Daniel; Zhang, Rui

2010-03-01

Networks with nodes consisting of ideal Boolean logic gates are known to display either steady states, periodic behavior, or an ultraviolet catastrophe where the number of logic-transition events circulating in the network per unit time grows as a power-law. In an experiment, non-ideal behavior of the logic gates prevents the ultraviolet catastrophe and may lead to deterministic chaos. We identify certain non-ideal features of real logic gates that enable chaos in experimental networks. We find that short-pulse rejection and the asymmetry between the logic states tends to engender periodic behavior. On the other hand, a memory effect termed ``degradation'' can generate chaos. Our results strongly suggest that deterministic chaos can be expected in a large class of experimental Boolean-like networks. Such devices may find application in a variety of technologies requiring fast complex waveforms or flat power spectra. The non-ideal effects identified here also have implications for the statistics of attractors in large complex networks.

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.

You Cannot Step Into the Same River Twice: When Power Analyses Are Optimistic.

PubMed

McShane, Blakeley B; Böckenholt, Ulf

2014-11-01

Statistical power depends on the size of the effect of interest. However, effect sizes are rarely fixed in psychological research: Study design choices, such as the operationalization of the dependent variable or the treatment manipulation, the social context, the subject pool, or the time of day, typically cause systematic variation in the effect size. Ignoring this between-study variation, as standard power formulae do, results in assessments of power that are too optimistic. Consequently, when researchers attempting replication set sample sizes using these formulae, their studies will be underpowered and will thus fail at a greater than expected rate. We illustrate this with both hypothetical examples and data on several well-studied phenomena in psychology. We provide formulae that account for between-study variation and suggest that researchers set sample sizes with respect to our generally more conservative formulae. Our formulae generalize to settings in which there are multiple effects of interest. We also introduce an easy-to-use website that implements our approach to setting sample sizes. Finally, we conclude with recommendations for quantifying between-study variation. © The Author(s) 2014.

A Mathematical Model of Anthrax Transmission in Animal Populations.

PubMed

Saad-Roy, C M; van den Driessche, P; Yakubu, Abdul-Aziz

2017-02-01

A general mathematical model of anthrax (caused by Bacillus anthracis) transmission is formulated that includes live animals, infected carcasses and spores in the environment. The basic reproduction number [Formula: see text] is calculated, and existence of a unique endemic equilibrium is established for [Formula: see text] above the threshold value 1. Using data from the literature, elasticity indices for [Formula: see text] and type reproduction numbers are computed to quantify anthrax control measures. Including only herbivorous animals, anthrax is eradicated if [Formula: see text]. For these animals, oscillatory solutions arising from Hopf bifurcations are numerically shown to exist for certain parameter values with [Formula: see text] and to have periodicity as observed from anthrax data. Including carnivores and assuming no disease-related death, anthrax again goes extinct below the threshold. Local stability of the endemic equilibrium is established above the threshold; thus, periodic solutions are not possible for these populations. It is shown numerically that oscillations in spore growth may drive oscillations in animal populations; however, the total number of infected animals remains about the same as with constant spore growth.

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

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

On Weak and Strong 2k- bent Boolean Functions

DTIC Science & Technology

2016-01-01

U.S.A. Email: pstanica@nps.edu Abstract—In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent...denotes the complex conjugate of z. An important tool in our analysis is the discrete Fourier transform , known in Boolean functions literature, as Walsh...Hadamard, or Walsh–Hadamard transform , which is the func- tion Wf : Fn2 → C, defined by Wf (u) = 2− n 2 ∑ x∈Vn (−1)f(x)⊕u·x. Any f ∈ Bn can be

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.

Photons, photon jets, and dark photons at 750 GeV and beyond.

PubMed

Dasgupta, Basudeb; Kopp, Joachim; Schwaller, Pedro

2016-01-01

In new physics searches involving photons at the LHC, one challenge is to distinguish scenarios with isolated photons from models leading to "photon jets". For instance, in the context of the 750 GeV diphoton excess, it was pointed out that a true diphoton resonance [Formula: see text] can be mimicked by a process of the form [Formula: see text], where S is a new scalar with a mass of 750 GeV and a is a light pseudoscalar decaying to two collinear photons. Photon jets can be distinguished from isolated photons by exploiting the fact that a large fraction of photons convert to an [Formula: see text] pair inside the inner detector. In this note, we quantify this discrimination power, and we study how the sensitivity of future searches differs for photon jets compared to isolated photons. We also investigate how our results depend on the lifetime of the particle(s) decaying to the photon jet. Finally, we discuss the extension to [Formula: see text], where there are no photons at all but the dark photon [Formula: see text] decays to [Formula: see text] pairs. Our results will be useful in future studies of the putative 750 GeV signal, but also more generally in any new physics search involving hard photons.

Lattice QCD and the timelike pion form factor.

PubMed

Meyer, Harvey B

2011-08-12

We present a formula that allows one to calculate the pion form factor in the timelike region 2m(π) ≤ √(s) ≤ 4m(π) in lattice QCD. The form factor quantifies the contribution of two-pion states to the vacuum polarization. It must be known very accurately in order to reduce the theoretical uncertainty on the anomalous magnetic moment of the muon. At the same time, the formula constitutes a rare example where, in a restricted kinematic regime, the spectral function of a conserved current can be determined from Euclidean observables without an explicit analytic continuation.

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

Experimentally quantifying anion polarizability at the air/water interface.

PubMed

Tong, Yujin; Zhang, Igor Ying; Campen, R Kramer

2018-04-03

The adsorption of large, polarizable anions from aqueous solution on the air/water interface controls important atmospheric chemistry and is thought to resemble anion adsorption at hydrophobic interfaces generally. While the favourability of adsorption of such ions is clear, quantifying adsorption thermodynamics has proven challenging because it requires accurate description of the structure of the anion and its solvation shell at the interface. In principle anion polarizability offers a structural window, but to the best of our knowledge there has so far been no experimental technique that allowed its characterization with interfacial specificity. Here, we meet this challenge using interface-specific vibrational spectroscopy of Cl-O vibrations of the [Formula: see text] anion at the air/water interface and report that the interface breaks the symmetry of the anion, the anisotropy of [Formula: see text]'s polarizability tensor is more than two times larger than in bulk water and concentration dependent, and concentration-dependent polarizability changes are consistent with correlated changes in surface tension.

Cloud effects on ultraviolet photoclimatology

NASA Technical Reports Server (NTRS)

Green, A. E. S.; Spinhirne, J. D.

1978-01-01

The purpose of this study is to quantify for the needs of photobiology the influence of clouds upon the ultraviolet spectral irradiance reaching the ground. Towards this end, analytic formulas are developed which approximately characterize the influence of clouds upon total solar radiation. These may be used in conjunction with a solar pyranometer to assign an effective visual optical depth for the cloud cover. A formula is also developed which characterizes the influence of the optical depth of clouds upon the UV spectral irradiance in the 280-340 nm region. Thus total solar energy observations to assign cloud optical properties can be used to calculate the UV spectral irradiance at the ground in the presence of these clouds. As incidental by-products of this effort, convenient formulas are found for the direct and diffuse components of total solar energy.

Cariogenic potential of cows', human and infant formula milks and effect of fluoride supplementation.

PubMed

Peres, Regina Celia Rocha; Coppi, Luciane Cristina; Volpato, Maria Cristina; Groppo, Francisco Carlos; Cury, Jaime Aparecido; Rosalen, Pedro Luiz

2009-02-01

The aim of the present study was to evaluate the cariogenicity of cows', human and infant formula milks, supplemented or not with fluoride, in rats. Sixty female Wistar rats were desalivated and infected with Streptococcus sobrinus 6715.Animals were divided into six groups: group 1, sterilised deionised distilled water (SDW; negative control); group 2, 5 % sucrose added to SDW (positive control); group 3, human milk; group 4, cows' milk; group 5, Ninho(R) formula reconstituted with SDW; group 6, Ninho(R) formula reconstituted with 10 parts per million F and SDW. At day 21 the animals were killed and their jaws removed to quantify total cultivable microbiota, Strep. sobrinus and dental caries. The concentration of carbohydrate and fluoride in the milks was analysed. The Kruskal-Wallis test (alpha = 5 %) was used to analyse the data. The caries score by the milk formula was as high as that provoked by sucrose. Regarding smooth-surface caries, human milk was statistically more cariogenic than cows' milk, which did not differ from the SDW and the Ninho(R) with fluoride (P>0.05). Groups 2-6 showed higher Strep. sobrinus counts when compared with the negative control group (P < 0.05) but no statistically significant difference was found among them (P>0.05). HPLC analysis showed that infant formula had 9.3 % sucrose and 3.6 % reducing sugars. The infant formula should be considered cariogenic due to the sugars found in it, but fluoride supplementation reduced its cariogenic effect. The human milk was more cariogenic than the cows' milk but not as much as the formula milk.

Emphysema on Thoracic CT and Exercise Ventilatory Inefficiency in Mild-to-Moderate COPD.

PubMed

Jones, Joshua H; Zelt, Joel T; Hirai, Daniel M; Diniz, Camilla V; Zaza, Aida; O'Donnell, Denis E; Neder, J Alberto

2017-04-01

There is growing evidence that emphysema on thoracic computed tomography (CT) is associated with poor exercise tolerance in COPD patients with only mild-to-moderate airflow obstruction. We hypothesized that an excessive ventilatory response to exercise (ventilatory inefficiency) would underlie these abnormalities. In a prospective study, 19 patients (FEV 1 = 82 ± 13%, 12 Global Initiative for Chronic Obstructive Lung Disease (GOLD) stage 1) and 26 controls underwent an incremental exercise test. Ventilatory inefficiency was assessed by the ventilation ([Formula: see text]E)/CO 2 output ([Formula: see text]CO 2 ) nadir. Pulmonary blood flow (PBF) in a submaximal test was calculated by inert gas rebreathing. Emphysema was quantified as % of attenuation areas below 950 HU. Patients typically presented with centrilobular emphysema (76.8 ± 10.1% of total emphysema) in the upper lobes (upper/total lung ratio = 0.82 ± 0.04). They had lower peak oxygen uptake ([Formula: see text]O 2 ), higher [Formula: see text]E/[Formula: see text]CO 2 nadir, and greater dyspnea scores than controls (p < 0.05). Lower peak [Formula: see text]O 2 and worse dyspnea were found in patients with higher [Formula: see text]E/[Formula: see text]CO 2 nadirs (≥30). Patients had blunted increases in PBF from rest to iso-[Formula: see text]O 2 exercise (p < 0.05). Higher [Formula: see text]E/[Formula: see text]CO 2 nadir in COPD was associated with emphysema severity (r = 0.63) which, in turn, was related to reduced lung diffusing capacity (r = -0.72) and blunted changes in PBF from rest to exercise (r = -0.69) (p < 0.01). Ventilation "wasted" in emphysematous areas is associated with impaired exercise ventilatory efficiency in mild-to-moderate COPD. Exercise ventilatory inefficiency links structure (emphysema) and function (D L CO) to a key clinical outcome (poor exercise tolerance) in COPD patients with only modest spirometric abnormalities.

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.

Free kappa light chains in cerebrospinal fluid as a biomarker to assess risk conversion to multiple sclerosis.

PubMed

Menéndez-Valladares, P; García-Sánchez, M I; Cuadri Benítez, P; Lucas, M; Adorna Martínez, M; Carranco Galán, V; García De Veas Silva, J L; Bermudo Guitarte, C; Izquierdo Ayuso, G

2015-01-01

Multiple sclerosis (MS) initiates with a first attack or clinically isolated syndrome (CIS). The importance of an early treatment in MS leads to the search, as soon as possible, for novel biomarkers which can predict conversion from CIS to MS. The purpose of this study was to assess the predictive value of the kappa index ([Formula: see text] index), using kappa free light light chains ([Formula: see text]FLCs) in cerebrospinal fluid (CSF), for the conversion of CIS patients to MS, and compare its accuracy with other parameters used in clinical practice. FLC levels were analysed in CSF from 176 patients: 70 as control group, 77 CIS, and 29 relapsing-remitting MS. FLC levels were quantified by nephelometry. [Formula: see text] Index sensitivity and specificity (93.1%; 95.7%) was higher than those from the immunoglobulin G (IgG) index (75.9%; 94.3%), and lower than those from oligoclonal IgG bands (OCGBs) (96.5%; 98.6%). The optimal cut-off for [Formula: see text] index was 10.62. Most of the CIS patients with [Formula: see text] index >10.62 presented OCGBs, IgG index >0.56 and fulfilled magnetic resonance imaging (MRI) criteria. CIS patients above [Formula: see text] index cut-off of 10.62 present 7.34-fold risk of conversion to MS than CIS below this value. The [Formula: see text] index correlated with positive OCGBs, IgG index above 0.56 and MRI criteria.

Quantifying the Workload of Subject Bibliographers in Collection Development.

ERIC Educational Resources Information Center

Metz, Paul

1991-01-01

Discussion of the role of subject bibliographers in collection development activities focuses on an approach developed at Virginia Polytechnic and State Institute to provide a formula for estimating the collection development workload of subject bibliographers. Workload standards and matrix models of organizational structures are discussed, and…

Disordered crystals from first principles I: Quantifying the configuration space

NASA Astrophysics Data System (ADS)

Kühne, Thomas D.; Prodan, Emil

2018-04-01

This work represents the first chapter of a project on the foundations of first-principle calculations of the electron transport in crystals at finite temperatures. We are interested in the range of temperatures, where most electronic components operate, that is, room temperature and above. The aim is a predictive first-principle formalism that combines ab-initio molecular dynamics and a finite-temperature Kubo-formula for homogeneous thermodynamic phases. The input for this formula is the ergodic dynamical system (Ω , G , dP) defining the thermodynamic crystalline phase, where Ω is the configuration space for the atomic degrees of freedom, G is the space group acting on Ω and dP is the ergodic Gibbs measure relative to the G-action. The present work develops an algorithmic method for quantifying (Ω , G , dP) from first principles. Using the silicon crystal as a working example, we find the Gibbs measure to be extremely well characterized by a multivariate normal distribution, which can be quantified using a small number of parameters. The latter are computed at various temperatures and communicated in the form of a table. Using this table, one can generate large and accurate thermally-disordered atomic configurations to serve, for example, as input for subsequent simulations of the electronic degrees of freedom.

Quantitative Assessment of Emphysema Severity in Histological Lung Analysis.

PubMed

Marcos, J Víctor; Muñoz-Barrutia, Arrate; Ortiz-de-Solórzano, Carlos; Cristóbal, Gabriel

2015-10-01

Emphysema is a characteristic component of chronic obstructive pulmonary disease (COPD), which has been pointed out as one of the main causes of mortality for the next years. Animal models of emphysema are employed to study the evolution of this disease as well as the effect of treatments. In this context, measures such as the mean linear intercept [Formula: see text] and the equivalent diameter [Formula: see text] have been proposed to quantify the airspace enlargement associated with emphysematous lesions in histological sections. The parameter [Formula: see text], which relates the second and the third moments of the variable [Formula: see text], has recently shown to be a robust descriptor of airspace enlargement. However, the value of [Formula: see text] does not provide a direct evaluation of emphysema severity. In our research, we suggest a Bayesian approach to map [Formula: see text] onto a novel emphysema severity index (SI) reflecting the probability for a lung area to be emphysematous. Additionally, an image segmentation procedure was developed to compute the severity map of a lung section using the SI function. Severity maps corresponding to 54 lung sections from control mice, mice induced with mild emphysema and mice induced with severe emphysema were computed, revealing differences between the distribution of SI in the three groups. The proposed methodology could then assist in the quantification of emphysema severity in animal models of pulmonary disease.

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.

Phylogenetics beyond biology.

PubMed

Retzlaff, Nancy; Stadler, Peter F

2018-06-21

Evolutionary processes have been described not only in biology but also for a wide range of human cultural activities including languages and law. In contrast to the evolution of DNA or protein sequences, the detailed mechanisms giving rise to the observed evolution-like processes are not or only partially known. The absence of a mechanistic model of evolution implies that it remains unknown how the distances between different taxa have to be quantified. Considering distortions of metric distances, we first show that poor choices of the distance measure can lead to incorrect phylogenetic trees. Based on the well-known fact that phylogenetic inference requires additive metrics, we then show that the correct phylogeny can be computed from a distance matrix [Formula: see text] if there is a monotonic, subadditive function [Formula: see text] such that [Formula: see text] is additive. The required metric-preserving transformation [Formula: see text] can be computed as the solution of an optimization problem. This result shows that the problem of phylogeny reconstruction is well defined even if a detailed mechanistic model of the evolutionary process remains elusive.

An investigation into the fatty acid content of selected fish-based commercial infant foods in the UK and the impact of commonly practiced re-heating treatments used by parents for the preparation of infant formula milks.

PubMed

Loughrill, Emma; Zand, Nazanin

2016-04-15

The importance of dietary lipids during infancy is paramount for rapid growth and development. Linoleic acid (LA), α-linolenic acid (ALA), eicosapentaenoic acid (EPA), docosahexaenoic acid (DHA) and arachidonic acid (AA) were quantified using RP-HPLC with charged aerosol detection in a range of complementary infant foods and formula milk. Total daily intake of fatty acids for infants aged 6-9 months was calculated based on the consumption of complementary infant foods and formula milk. Total daily intakes of ALA, AA and DHA were below, whereas LA was above the recommended intake. This provides scope for product optimisation, to improve the nutritive value of commercial infant food products. The impact of re-heating treatments by parents on fatty acid content of formula milk was investigated and statistically significant changes were observed. Furthermore, the transparency of the labelling information declared by the manufacturers was within recommendations despite a degree of significant variation. Copyright © 2015 Elsevier Ltd. All rights reserved.

The Value of Accuracy in Information for Planning and Control

ERIC Educational Resources Information Center

Higgins, J. C.

1974-01-01

The author discusses some approaches to assessing the impact of inaccurate information when the planning system involves formulae of the management accounting type or models of the operational research variety. The most appropriate method for quantifying information value in management information systems is through Bayesian analysis and decision…

Satellite interference analysis and simulation using personal computers

NASA Astrophysics Data System (ADS)

Kantak, Anil

1988-03-01

This report presents the complete analysis and formulas necessary to quantify the interference experienced by a generic satellite communications receiving station due to an interfering satellite. Both satellites, the desired as well as the interfering satellite, are considered to be in elliptical orbits. Formulas are developed for the satellite look angles and the satellite transmit angles generally related to the land mask of the receiving station site for both satellites. Formulas for considering Doppler effect due to the satellite motion as well as the Earth's rotation are developed. The effect of the interfering-satellite signal modulation and the Doppler effect on the power received are considered. The statistical formulation of the interference effect is presented in the form of a histogram of the interference to the desired signal power ratio. Finally, a computer program suitable for microcomputers such as IBM AT is provided with the flowchart, a sample run, results of the run, and the program code.

Dramatic effects of speech task on motor and linguistic planning in severely dysfluent parkinsonian speech

PubMed Central

Van Lancker Sidtis, Diana; Cameron, Krista; Sidtis, John J.

2015-01-01

In motor speech disorders, dysarthric features impacting intelligibility, articulation, fluency, and voice emerge more saliently in conversation than in repetition, reading, or singing. A role of the basal ganglia in these task discrepancies has been identified. Further, more recent studies of naturalistic speech in basal ganglia dysfunction have revealed that formulaic language is more impaired than novel language. This descriptive study extends these observations to a case of severely dysfluent dysarthria due to a parkinsonian syndrome. Dysfluencies were quantified and compared for conversation, two forms of repetition, reading, recited speech, and singing. Other measures examined phonetic inventories, word forms, and formulaic language. Phonetic, syllabic, and lexical dysfluencies were more abundant in conversation than in other task conditions. Formulaic expressions in conversation were reduced compared to normal speakers. A proposed explanation supports the notion that the basal ganglia contribute to formulation of internal models for execution of speech. PMID:22774929

Satellite Interference Analysis and Simulation Using Personal Computers

NASA Technical Reports Server (NTRS)

Kantak, Anil

1988-01-01

This report presents the complete analysis and formulas necessary to quantify the interference experienced by a generic satellite communications receiving station due to an interfering satellite. Both satellites, the desired as well as the interfering satellite, are considered to be in elliptical orbits. Formulas are developed for the satellite look angles and the satellite transmit angles generally related to the land mask of the receiving station site for both satellites. Formulas for considering Doppler effect due to the satellite motion as well as the Earth's rotation are developed. The effect of the interfering-satellite signal modulation and the Doppler effect on the power received are considered. The statistical formulation of the interference effect is presented in the form of a histogram of the interference to the desired signal power ratio. Finally, a computer program suitable for microcomputers such as IBM AT is provided with the flowchart, a sample run, results of the run, and the program code.

Non-breast milk feeding in developing countries: challenge from microbial and chemical contaminants.

PubMed

Weisstaub, Gerardo; Uauy, Ricardo

2012-01-01

Complementary foods based on cow's milk or gruels consumed by children in developing countries are often contaminated by bacteria during preparation, and ambient temperature rapidly increases microbial load. Thus infant formula or other weaning foods may cause diarrhea in young infants accounting for 25-33% of all deaths <5 years globally. Environmental chemicals such as metals (As, Pb, Cu) and nitrates can cause vomiting/diarrhea. Polychlorinated biphenyls derived from plastics, present in formula and/or breast milk, are endocrine disruptors (the potential threats are not fully quantifiable). The prevailing view is that benefits from breastfeeding outweigh potential risks. Copyright © 2012 S. Karger AG, Basel.

Comparison of stool microbiota compositions, stool alpha1-antitrypsin and calprotectin concentrations, and diarrhoeal morbidity of Indonesian infants fed breast milk or probiotic/prebiotic-supplemented formula.

PubMed

Oswari, Hanifah; Prayitno, Lamtorogung; Dwipoerwantoro, Pramita G; Firmansyah, Agus; Makrides, Maria; Lawley, Blair; Kuhn-Sherlock, Barbara; Cleghorn, Geoffrey; Tannock, Gerald W

2013-12-01

The composition of faecal microbiota of babies is known to be influenced by diet. Faecal calprotectin and α1-antitrypsin concentrations may be associated with mucosal permeability and inflammation. We aimed to assess whether there was any difference after consumption of a probiotic/prebiotic formula on faecal microbiota composition, calprotectin and α1-antitrypsin levels, and diarrhoea in comparison with breast milk-fed Indonesian infants. One hundred sixty infants, 2 to 6 weeks old, were recruited to the study. They were either breastfed or formula fed (80 per group). Faecal samples were collected at recruitment and 3 months later. Bacterial groups characteristic of the human faecal microbiota were quantified in faeces by quantitative polymerase chain reaction. Calprotectin and α1-antitrypsin concentrations were measured using commercial kits. Details of diarrhoeal morbidity were documented and rated for severity. The compositions of the faecal microbiota of formula-fed compared with breast milk-fed children were similar except that the probiotic strain Bifidobacterium animalis subsp. lactis DR10 was more abundant after 3 months consumption of the formula. Alpha1-antitrypsin levels were higher in breastfed compared with formula-fed infants. The occurrence of diarrhoea did not differ between the groups of babies. Feeding Indonesian babies with a probiotic/prebiotic formula did not produce marked differences in the composition of the faecal microbiota in comparison with breast milk. Detrimental effects of formula feeding on biomarkers of mucosal health were not observed. © 2013 The Authors. Journal of Paediatrics and Child Health © 2013 Paediatrics and Child Health Division (Royal Australasian College of Physicians).

Sensitivity analysis of non-cohesive sediment transport formulae

NASA Astrophysics Data System (ADS)

Pinto, Lígia; Fortunato, André B.; Freire, Paula

2006-10-01

Sand transport models are often based on semi-empirical equilibrium transport formulae that relate sediment fluxes to physical properties such as velocity, depth and characteristic sediment grain sizes. In engineering applications, errors in these physical properties affect the accuracy of the sediment fluxes. The present analysis quantifies error propagation from the input physical properties to the sediment fluxes, determines which ones control the final errors, and provides insight into the relative strengths, weaknesses and limitations of four total load formulae (Ackers and White, Engelund and Hansen, van Rijn, and Karim and Kennedy) and one bed load formulation (van Rijn). The various sources of uncertainty are first investigated individually, in order to pinpoint the key physical properties that control the errors. Since the strong non-linearity of most sand transport formulae precludes analytical approaches, a Monte Carlo method is validated and used in the analysis. Results show that the accuracy in total sediment transport evaluations is mainly determined by errors in the current velocity and in the sediment median grain size. For the bed load transport using the van Rijn formula, errors in the current velocity alone control the final accuracy. In a final set of tests, all physical properties are allowed to vary simultaneously in order to analyze the combined effect of errors. The combined effect of errors in all the physical properties is then compared to an estimate of the errors due to the intrinsic limitations of the formulae. Results show that errors in the physical properties can be dominant for typical uncertainties associated with these properties, particularly for small depths. A comparison between the various formulae reveals that the van Rijn formula is more sensitive to basic physical properties. Hence, it should only be used when physical properties are known with precision.

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.

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.

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.

Design and Implementation of Performance Metrics for Evaluation of Assessments Data

ERIC Educational Resources Information Center

Ahmed, Irfan; Bhatti, Arif

2016-01-01

Evocative evaluation of assessment data is essential to quantify the achievements at course and program levels. The objective of this paper is to design performance metrics and respective formulas to quantitatively evaluate the achievement of set objectives and expected outcomes at the course levels for program accreditation. Even though…

Gaussian intrinsic entanglement for states with partial minimum uncertainty

NASA Astrophysics Data System (ADS)

Mišta, Ladislav; Baksová, Klára

2018-01-01

We develop a recently proposed theory of a quantifier of bipartite Gaussian entanglement called Gaussian intrinsic entanglement (GIE) [L. Mišta, Jr. and R. Tatham, Phys. Rev. Lett. 117, 240505 (2016), 10.1103/PhysRevLett.117.240505]. Gaussian intrinsic entanglement provides a compromise between computable and physically meaningful entanglement quantifiers and so far it has been calculated for two-mode Gaussian states including all symmetric partial minimum-uncertainty states, weakly mixed asymmetric squeezed thermal states with partial minimum uncertainty, and weakly mixed symmetric squeezed thermal states. We improve the method of derivation of GIE and show that all previously derived formulas for GIE of weakly mixed states in fact hold for states with higher mixedness. In addition, we derive analytical formulas for GIE for several other classes of two-mode Gaussian states with partial minimum uncertainty. Finally, we show that, like for all previously known states, also for all currently considered states the GIE is equal to Gaussian Rényi-2 entanglement of formation. This finding strengthens a conjecture about the equivalence of GIE and Gaussian Rényi-2 entanglement of formation for all bipartite Gaussian states.

Quantitative analysis of the major constituents in Chinese medicinal preparation SuoQuan formulae by ultra fast high performance liquid chromatography/quadrupole tandem mass spectrometry

PubMed Central

2013-01-01

Background The SuoQuan formulae containing Fructus Alpiniae Oxyphyllae has been used to combat the urinary incontinence symptoms including frequency, urgency and nocturia for hundreds of years in China. However, the chemical information was not well characterized. The quality control marker constituent only focused on one single compound in the current Chinese Pharmacopeia. Hence it is prudent to identify and quantify the main constituents in this herbal product. This study aimed to analyze the main constituents using ultra-fast performance liquid chromatography coupled to tandem mass spectrometry (UFLC-MS/MS). Results Fourteen phytochemicals originated from five chemical classes constituents were identified by comparing the molecular mass, fragmentation pattern and retention time with those of the reference standards. A newly developed UFLC-MS/MS was validated demonstrating that the new assay was valid, reproducible and reliable. This method was successfully applied to simultaneously quantify the fourteen phytochemicals. Notably, the content of these constituents showed significant differences in three pharmaceutical preparations. The major constituent originated from each of chemical class was isolinderalactone, norisoboldine, nootkatone, yakuchinone A and apigenin-4’,7-dimethylther, respectively. The variation among these compounds was more than 1000 times. Furthermore, the significant content variation between the two different Suoquan pills was also observed. Conclusion The proposed method is sensitive and reliable; hence it can be used to analyze a variety of SuoQuan formulae products produced by different pharmaceutical manufacturers. PMID:23899222

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.

Influence of Convection and Aerosol Pollution on Ice Cloud Particle Effective Radius

NASA Technical Reports Server (NTRS)

Jiang, J. H.; Su, H.; Zhai, C.; Massie, S. T.; Schoeberl, M. R.; Colarco, P. R.; Platnick, S.; Gu, Y.; Liou, K.-N.

2011-01-01

Satellite observations show that ice cloud effective radius (r(sub e)) increases with ice water content (IWC) but decreases with aerosol optical thickness (AOT). Using least-squares fitting to the observed data, we obtain an analytical formula to describe the variations of r(sub e) with IWC and AOT for several regions with distinct characteristics of r(sub e) -IWC-AOT relationships. As IWC directly relates to convective strength and AOT represents aerosol loading, our empirical formula provides a means to quantify the relative roles of dynamics and aerosols in controlling r(sub e) in different geographical regions, and to establish a framework for parameterization of aerosol effects on r(sub e) in climate models.

[Concordance of glomerular filtration rate with creatinine clearance in 24-hour urine and Schwartz and Schwartz updated].

PubMed

Salazar-Gutiérrez, María Luisa; Ochoa-Ponce, Cristina; Lona-Reyes, Juan Carlos; Gutiérrez-Íñiguez, Sara Ivonne

Reference methods for the quantification of the glomerular filtration rate (GFR) are difficult to use in clinical practice; formulas for evaluating GFR based on serum creatinine (SCr) and/or creatinine clearance are used. The aim of this study was to quantify the correlation and concordance of GFR with creatinine clearance in 24-hour urine (GFR24) and Schwartz and Schwartz updated formulas. Cross-sectional study involving healthy pediatric patients and with chronic kidney disease (CKD) from 5 to 16.9 years. Linear correlation between GFR 24 and two formulas was evaluated with the Pearson correlation coefficient (r) and intraclass correlation coefficient (ICC). We studied 134 patients, of which 59.7% were male. Mean age was 10.8 years. The average GFR24 was 140.34ml/min/1.73m 2 ; 34.3% (n=46) had GFR <90ml/min/1.73m 2 . Moderate linear correlation between GFR24 and Schwartz (r= 0.63) and Schwartz updated (r= 0.65) formulas was observed. There was good concordance between the GFR24 and Schwartz (ICC= 0.77) and updated Schwartz (ICC= 0.77) formulas. Schwartz classical formula in patients with GFR24 ≥ 90ml/min/1.73m 2 estimated higher values, while Schwartz updated underestimated values. There is moderate correlation and good concordance between the GFR24 and Schwartz and Schwartz updated formulas. The concordance was better in patients with obesity and lower in women, patients with hyperfiltration and normal weight. Copyright © 2016 Hospital Infantil de México Federico Gómez. Publicado por Masson Doyma México S.A. All rights reserved.

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.

Quantifying dispersal of southern pine beetles with mark-recapture experiments and a diffusion model

Treesearch

P. Turchin; W.T. Thoeny

1993-01-01

Pest management decisions should take into consideration quantitative information on dispersal of insect pests, but such information is often lacking.The goal of this study was to measure intraforest dispersal in the southern pine beetle (SPB).We developed an analytical formula for interpreting data from mark-recapture studies of insect dispersal.The proposed...

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.

Jeagle: a JAVA Runtime Verification Tool

NASA Technical Reports Server (NTRS)

DAmorim, Marcelo; Havelund, Klaus

2005-01-01

We introduce the temporal logic Jeagle and its supporting tool for runtime verification of Java programs. A monitor for an Jeagle formula checks if a finite trace of program events satisfies the formula. Jeagle is a programming oriented extension of the rule-based powerful Eagle logic that has been shown to be capable of defining and implementing a range of finite trace monitoring logics, including future and past time temporal logic, real-time and metric temporal logics, interval logics, forms of quantified temporal logics, and so on. Monitoring is achieved on a state-by-state basis avoiding any need to store the input trace. Jeagle extends Eagle with constructs for capturing parameterized program events such as method calls and method returns. Parameters can be the objects that methods are called upon, arguments to methods, and return values. Jeagle allows one to refer to these in formulas. The tool performs automated program instrumentation using AspectJ. We show the transformational semantics of Jeagle.

Relationships Between Dissolved Organic Matter Composition and Photochemistry in Lakes of Diverse Trophic Status.

PubMed

Maizel, Andrew C; Li, Jing; Remucal, Christina K

2017-09-05

The North Temperate Lakes Long-Term Ecological Research site includes seven lakes in northern Wisconsin that vary in hydrology, trophic status, and landscape position. We examine the molecular composition of dissolved organic matter (DOM) within these lakes using Fourier transform-ion cyclotron resonance mass spectrometry (FT-ICR MS) and quantify DOM photochemical activity using probe compounds. Correlations between the relative intensity of individual molecular formulas and reactive species production demonstrate the influence of DOM composition on photochemistry. For example, highly aromatic, tannin-like formulas correlate positively with triplet formation rates, but negatively with triplet quantum yields, as waters enriched in highly aromatic formulas exhibit much higher rates of light absorption, but only slightly higher rates of triplet production. While commonly utilized optical properties also correlate with DOM composition, the ability of FT-ICR MS to characterize DOM subpopulations provides unique insight into the mechanisms through which DOM source and environmental processing determine composition and photochemical activity.

Resource competition induces heterogeneity and can increase cohort survivorship: selection-event duration matters.

PubMed

Gosselin, Jennifer L; Anderson, James J

2013-12-01

Determining when resource competition increases survivorship can reveal processes underlying population dynamics and reinforce the importance of heterogeneity among individuals in conservation. We ran an experiment mimicking the effects of competition in a growing season on survivorship during a selection event (e.g., overwinter starvation, drought). Using a model fish species (Poecilia reticulata), we studied how food availability and competition affect mass in a treatment stage, and subsequently survivorship in a challenge stage of increased temperature and starvation. The post-treatment mean mass was strongly related to the mean time to mortality and mass at mortality at all levels of competition. However, competition increased variance in mass and extended the right tail of the survivorship curve, resulting in a greater number of individuals alive beyond a critical temporal threshold ([Formula: see text]) than without competition. To realize the benefits from previously experienced competition, the duration of the challenge ([Formula: see text]) following the competition must exceed the critical threshold [Formula: see text] (i.e., competition increases survivorship when [Formula: see text]). Furthermore, this benefit was equivalent to increasing food availability by 20 % in a group without competition in our experiment. The relationship of [Formula: see text] to treatment and challenge conditions was modeled by characterizing mortality through mass loss in terms of the stochastic rate of loss of vitality (individual's survival capacity). In essence, when the duration of a selection event exceeds [Formula: see text], competition-induced heterogeneity buffers against mortality through overcompensation processes among individuals of a cohort. Overall, our study demonstrates an approach to quantify how early life stage heterogeneity affects survivorship.

Three-dimensional ultrasound measurements of carotid vessel wall and plaque thickness and their relationship with pulmonary abnormalities in ex-smokers without airflow limitation.

PubMed

Cheng, Jieyu; Pike, Damien; Chow, Tommy W S; Kirby, Miranda; Parraga, Grace; Chiu, Bernard

2016-09-01

The relationship between carotid disease and modestly abnormal airflow in ex-smokers without chronic obstructive pulmonary disease (COPD) is not well-understood. We generated 3D ultrasound measurements of carotid vessel-wall-plus-plaque thickness (VWT) and vessel wall volume (VWV) to quantify and evaluate such carotid ultrasound measurements in ex- and never-smokers without airflow limitation. These patients did not fulfill the diagnostic criteria for COPD. We also investigated the relationship of carotid atherosclerosis with pulmonary phenotypes of COPD. We evaluated 61 subjects without a clinical diagnosis of pulmonary or vascular diseases including 34 never-smokers (72 ± 6 year) and 27 ex-smokers (73 ± 9 year). We measured mean VWT ([Formula: see text]) and mean VWT specific to carotid regions-of-interest ([Formula: see text]) and evaluated potential differences between ex- and never-smokers. Carotid ultrasound and pulmonary disease measurement relationships were also evaluated using correlation coefficients (r) and multivariate regression analyses. Ex-smokers had a significantly greater [Formula: see text] (p = 0.003) and [Formula: see text] (p < 0.00001) than never-smokers, whereas a significant difference between the two groups was not detected by VWV (p = 1.0). There were significant correlations between the ventilation defect percent (VDP) measured by MRI with [Formula: see text] (r = 0.42, p = 0.001) and [Formula: see text] (r = 0.56, p = 0.00001). Multivariate regression models showed that VDP significantly predicted [Formula: see text] (β = 0.38, p = 0.004) and [Formula: see text] (β = 0.50, p = 0.00001). VWT-based measurements detected differences in vessel-wall-plus-plaque burden in ex- and never-smokers, which were not revealed using VWV. There were significant correlations between cardiovascular and pulmonary disease biomarkers in these ex-smokers who did not have a clinical diagnosis of pulmonary or carotid disease.

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.

Determination of muon momentum in the MicroBooNE LArTPC using an improved model of multiple Coulomb scattering

NASA Astrophysics Data System (ADS)

Abratenko, P.; Acciarri, R.; Adams, C.; An, R.; Anthony, J.; Asaadi, J.; Auger, M.; Bagby, L.; Balasubramanian, S.; Baller, B.; Barnes, C.; Barr, G.; Bass, M.; Bay, F.; Bishai, M.; Blake, A.; Bolton, T.; Bugel, L.; Camilleri, L.; Caratelli, D.; Carls, B.; Castillo Fernandez, R.; Cavanna, F.; Chen, H.; Church, E.; Cianci, D.; Cohen, E.; Collin, G. H.; Conrad, J. M.; Convery, M.; Crespo-Anadón, J. I.; Del Tutto, M.; Devitt, D.; Dytman, S.; Eberly, B.; Ereditato, A.; Escudero Sanchez, L.; Esquivel, J.; Fleming, B. T.; Foreman, W.; Furmanski, A. P.; Garcia-Gamez, D.; Garvey, G. T.; Genty, V.; Goeldi, D.; Gollapinni, S.; Graf, N.; Gramellini, E.; Greenlee, H.; Grosso, R.; Guenette, R.; Hackenburg, A.; Hamilton, P.; Hen, O.; Hewes, J.; Hill, C.; Ho, J.; Horton-Smith, G.; Huang, E.-C.; James, C.; de Vries, J. Jan; Jen, C.-M.; Jiang, L.; Johnson, R. A.; Joshi, J.; Jostlein, H.; Kaleko, D.; Kalousis, L. N.; Karagiorgi, G.; Ketchum, W.; Kirby, B.; Kirby, M.; Kobilarcik, T.; Kreslo, I.; Laube, A.; Li, Y.; Lister, A.; Littlejohn, B. R.; Lockwitz, S.; Lorca, D.; Louis, W. C.; Luethi, M.; Lundberg, B.; Luo, X.; Marchionni, A.; Mariani, C.; Marshall, J.; Martinez Caicedo, D. A.; Meddage, V.; Miceli, T.; Mills, G. B.; Moon, J.; Mooney, M.; Moore, C. D.; Mousseau, J.; Murrells, R.; Naples, D.; Nienaber, P.; Nowak, J.; Palamara, O.; Paolone, V.; Papavassiliou, V.; Pate, S. F.; Pavlovic, Z.; Piasetzky, E.; Porzio, D.; Pulliam, G.; Qian, X.; Raaf, J. L.; Rafique, A.; Rochester, L.; von Rohr, C. Rudolf; Russell, B.; Schmitz, D. W.; Schukraft, A.; Seligman, W.; Shaevitz, M. H.; Sinclair, J.; Snider, E. L.; Soderberg, M.; Söldner-Rembold, S.; Soleti, S. R.; Spentzouris, P.; Spitz, J.; St. John, J.; Strauss, T.; Szelc, A. M.; Tagg, N.; Terao, K.; Thomson, M.; Toups, M.; Tsai, Y.-T.; Tufanli, S.; Usher, T.; Van de Water, R. G.; Viren, B.; Weber, M.; Wickremasinghe, D. A.; Wolbers, S.; Wongjirad, T.; Woodruff, K.; Yang, T.; Yates, L.; Zeller, G. P.; Zennamo, J.; Zhang, C.

2017-10-01

We discuss a technique for measuring a charged particle's momentum by means of multiple Coulomb scattering (MCS) in the MicroBooNE liquid argon time projection chamber (LArTPC). This method does not require the full particle ionization track to be contained inside of the detector volume as other track momentum reconstruction methods do (range-based momentum reconstruction and calorimetric momentum reconstruction). We motivate use of this technique, describe a tuning of the underlying phenomenological formula, quantify its performance on fully contained beam-neutrino-induced muon tracks both in simulation and in data, and quantify its performance on exiting muon tracks in simulation. Using simulation, we have shown that the standard Highland formula should be re-tuned specifically for scattering in liquid argon, which significantly improves the bias and resolution of the momentum measurement. With the tuned formula, we find agreement between data and simulation for contained tracks, with a small bias in the momentum reconstruction and with resolutions that vary as a function of track length, improving from about 10% for the shortest (one meter long) tracks to 5% for longer (several meter) tracks. For simulated exiting muons with at least one meter of track contained, we find a similarly small bias, and a resolution which is less than 15% for muons with momentum below 2 GeV/c. Above 2 GeV/c, results are given as a first estimate of the MCS momentum measurement capabilities of MicroBooNE for high momentum exiting tracks.

Determination of muon momentum in the MicroBooNE LArTPC using an improved model of multiple Coulomb scattering

DOE PAGES

Abratenko, P.

2017-10-18

Here, we discuss a technique for measuring a charged particle's momentum by means of multiple Coulomb scattering (MCS) in the MicroBooNE liquid argon time projection chamber (LArTPC). This method does not require the full particle ionization track to be contained inside of the detector volume as other track momentum reconstruction methods do (range-based momentum reconstruction and calorimetric momentum reconstruction). We motivate use of this technique, describe a tuning of the underlying phenomenological formula, quantify its performance on fully contained beam-neutrino-induced muon tracks both in simulation and in data, and quantify its performance on exiting muon tracks in simulation. Using simulation,more » we have shown that the standard Highland formula should be re-tuned specifically for scattering in liquid argon, which significantly improves the bias and resolution of the momentum measurement. With the tuned formula, we find agreement between data and simulation for contained tracks, with a small bias in the momentum reconstruction and with resolutions that vary as a function of track length, improving from about 10% for the shortest (one meter long) tracks to 5% for longer (several meter) tracks. For simulated exiting muons with at least one meter of track contained, we find a similarly small bias, and a resolution which is less than 15% for muons with momentum below 2 GeV/c. Above 2 GeV/c, results are given as a first estimate of the MCS momentum measurement capabilities of MicroBooNE for high momentum exiting tracks.« less

Determination of muon momentum in the MicroBooNE LArTPC using an improved model of multiple Coulomb scattering

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

Abratenko, P.

Here, we discuss a technique for measuring a charged particle's momentum by means of multiple Coulomb scattering (MCS) in the MicroBooNE liquid argon time projection chamber (LArTPC). This method does not require the full particle ionization track to be contained inside of the detector volume as other track momentum reconstruction methods do (range-based momentum reconstruction and calorimetric momentum reconstruction). We motivate use of this technique, describe a tuning of the underlying phenomenological formula, quantify its performance on fully contained beam-neutrino-induced muon tracks both in simulation and in data, and quantify its performance on exiting muon tracks in simulation. Using simulation,more » we have shown that the standard Highland formula should be re-tuned specifically for scattering in liquid argon, which significantly improves the bias and resolution of the momentum measurement. With the tuned formula, we find agreement between data and simulation for contained tracks, with a small bias in the momentum reconstruction and with resolutions that vary as a function of track length, improving from about 10% for the shortest (one meter long) tracks to 5% for longer (several meter) tracks. For simulated exiting muons with at least one meter of track contained, we find a similarly small bias, and a resolution which is less than 15% for muons with momentum below 2 GeV/c. Above 2 GeV/c, results are given as a first estimate of the MCS momentum measurement capabilities of MicroBooNE for high momentum exiting tracks.« less

A review of physically based models for soil erosion by water

NASA Astrophysics Data System (ADS)

Le, Minh-Hoang; Cerdan, Olivier; Sochala, Pierre; Cheviron, Bruno; Brivois, Olivier; Cordier, Stéphane

2010-05-01

Physically-based models rely on fundamental physical equations describing stream flow and sediment and associated nutrient generation in a catchment. This paper reviews several existing erosion and sediment transport approaches. The process of erosion include soil detachment, transport and deposition, we present various forms of equations and empirical formulas used when modelling and quantifying each of these processes. In particular, we detail models describing rainfall and infiltration effects and the system of equations to describe the overland flow and the evolution of the topography. We also present the formulas for the flow transport capacity and the erodibility functions. Finally, we present some recent numerical schemes to approach the shallow water equations and it's coupling with infiltration and erosion source terms.

The reliability and validity of fatigue measures during multiple-sprint work: an issue revisited.

PubMed

Glaister, Mark; Howatson, Glyn; Pattison, John R; McInnes, Gill

2008-09-01

The ability to repeatedly produce a high-power output or sprint speed is a key fitness component of most field and court sports. The aim of this study was to evaluate the validity and reliability of eight different approaches to quantify this parameter in tests of multiple-sprint performance. Ten physically active men completed two trials of each of two multiple-sprint running protocols with contrasting recovery periods. Protocol 1 consisted of 12 x 30-m sprints repeated every 35 seconds; protocol 2 consisted of 12 x 30-m sprints repeated every 65 seconds. All testing was performed in an indoor sports facility, and sprint times were recorded using twin-beam photocells. All but one of the formulae showed good construct validity, as evidenced by similar within-protocol fatigue scores. However, the assumptions on which many of the formulae were based, combined with poor or inconsistent test-retest reliability (coefficient of variation range: 0.8-145.7%; intraclass correlation coefficient range: 0.09-0.75), suggested many problems regarding logical validity. In line with previous research, the results support the percentage decrement calculation as the most valid and reliable method of quantifying fatigue in tests of multiple-sprint performance.

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.

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.

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

Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces

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

Vourdas, A.

2014-08-15

The orthocomplemented modular lattice of subspaces L[H(d)], of a quantum system with d-dimensional Hilbert space H(d), is considered. A generalized additivity relation which holds for Kolmogorov probabilities is violated by quantum probabilities in the full lattice L[H(d)] (it is only valid within the Boolean subalgebras of L[H(d)]). This suggests the use of more general (than Kolmogorov) probability theories, and here the Dempster-Shafer probability theory is adopted. An operator D(H{sub 1},H{sub 2}), which quantifies deviations from Kolmogorov probability theory is introduced, and it is shown to be intimately related to the commutator of the projectors P(H{sub 1}),P(H{sub 2}), to the subspacesmore » H{sub 1}, H{sub 2}. As an application, it is shown that the proof of the inequalities of Clauser, Horne, Shimony, and Holt for a system of two spin 1/2 particles is valid for Kolmogorov probabilities, but it is not valid for Dempster-Shafer probabilities. The violation of these inequalities in experiments supports the interpretation of quantum probabilities as Dempster-Shafer probabilities.« less

Cybernetic systems based on inductive logic

NASA Astrophysics Data System (ADS)

Fry, Robert L.

2001-05-01

Recent work in the area of inductive logic suggests that cybernetics might be quantified and reduced to engineering practice. If so, then there are considerable implications for engineering, science, and other fields. This paper attempts to capture the essential ideas of cybernetics cast in the light of inductive logic. The described inductive logic extends conventional logic by adding a conjugate logical domain of questions to the logical domain of assertions intrinsic to Boolean Algebra with which most are familiar. This was first posited and developed by Richard Cox. Interestingly enough, these two logical domains, one of questions and the other of assertions, only exist relative to one another with each possessing natural measures of entropy and probability, respectively. Examples are given that highlight the utility of cybernetic approaches to neuroscience, algorithm design, system engineering, and the design and understanding of defensive and offensive systems. For example, the application of cybernetic approaches to defense systems suggests that these systems possess a wavefunction which like quantum mechanics, collapses when we ``look'' through the eyes of the system sensors such as radars and optical sensors. .

Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.

PubMed

Aono, Masashi; Naruse, Makoto; Kim, Song-Ju; Wakabayashi, Masamitsu; Hori, Hirokazu; Ohtsu, Motoichi; Hara, Masahiko

2013-06-18

Biologically inspired computing devices and architectures are expected to overcome the limitations of conventional technologies in terms of solving computationally demanding problems, adapting to complex environments, reducing energy consumption, and so on. We previously demonstrated that a primitive single-celled amoeba (a plasmodial slime mold), which exhibits complex spatiotemporal oscillatory dynamics and sophisticated computing capabilities, can be used to search for a solution to a very hard combinatorial optimization problem. We successfully extracted the essential spatiotemporal dynamics by which the amoeba solves the problem. This amoeba-inspired computing paradigm can be implemented by various physical systems that exhibit suitable spatiotemporal dynamics resembling the amoeba's problem-solving process. In this Article, we demonstrate that photoexcitation transfer phenomena in certain quantum nanostructures mediated by optical near-field interactions generate the amoebalike spatiotemporal dynamics and can be used to solve the satisfiability problem (SAT), which is the problem of judging whether a given logical proposition (a Boolean formula) is self-consistent. SAT is related to diverse application problems in artificial intelligence, information security, and bioinformatics and is a crucially important nondeterministic polynomial time (NP)-complete problem, which is believed to become intractable for conventional digital computers when the problem size increases. We show that our amoeba-inspired computing paradigm dramatically outperforms a conventional stochastic search method. These results indicate the potential for developing highly versatile nanoarchitectonic computers that realize powerful solution searching with low energy consumption.

[Phytic phosphorus and phytase activity in cereal-based infant formulas].

PubMed

Ojeda, Alvaro; Villavicencio, Iraidis; Linares, Zoraida

2012-12-01

Phytic acid is an organic acid present in cereal grains. The phosphorus inside its molecule (PPhy) is not available because of its low solubility, though the bioavailability could be increased by the activity of phytase enzymes (PhyA). With the purpose of quantifying the PPhy and PhyA in supplements manufactured from cereals and intended for lactating infants, five formulas of wide distribution in local markets were selected and identified depending on the main vegetable ingredients as A (rice), T (wheat), ATS (rice, wheat and soy isolate), ATM (rice, wheat and maize) and ATMS (rice, wheat, maize and soy isolate). Five samples were taken from each formula, each one corresponded to a commercial brand (400 to 500 g), coming from different batches and before their expiration date. The crude protein ranged from 7.2 to 16.8%, with de highest value for ATS and the lowest for T and ATM (P < 0.01). Ether extract varied from 0.31 to 0.75%, while the calcium: phosphorus ratio from 1.6 for ATM, to 1.1 for the rest. The PPhy was 61.5% of the total phosphorus in T, with differences (P < 0.01) compared to the other formulas (39.9 +/- 6.8%). PhyA was only detected in ATS, T and ATM (152, 300 and 570 U/kg, respectively). The chemical composition complied with the manufacturer report, with a high content of PPhy and PhyA associated to the wheat presence in the formula.

Comparison of mass spectrometry-based electronic nose and solid phase microextraction gas chromatography-mass spectrometry technique to assess infant formula oxidation.

PubMed

Fenaille, François; Visani, Piero; Fumeaux, René; Milo, Christian; Guy, Philippe A

2003-04-23

Two headspace techniques based on mass spectrometry detection (MS), electronic nose, and solid phase microextraction coupled to gas chromatography-mass spectrometry (SPME-GC/MS) were evaluated for their ability to differentiate various infant formula powders based on changes of their volatiles upon storage. The electronic nose gave unresolved MS fingerprints of the samples gas phases that were further submitted to principal component analysis (PCA). Such direct MS recording combined to multivariate treatment enabled a rapid differentiation of the infant formulas over a 4 week storage test. Although MS-based electronic nose advantages are its easy-to-use aspect and its meaningful data interpretation obtained with a high throughput (100 samples per 24 h), its greatest disadvantage is that the present compounds could not be identified and quantified. For these reasons, a SPME-GC/MS measurement was also investigated. This technique allowed the identification of saturated aldehydes as the main volatiles present in the headspace of infant milk powders. An isotope dilution assay was further developed to quantitate hexanal as a potential indicator of infant milk powder oxidation. Thus, hexanal content was found to vary from roughly 500 and 3500 microg/kg for relatively non-oxidized and oxidized infant formulas, respectively.

Morphology and the gradient of a symmetric potential predict gait transitions of dogs.

PubMed

Wilshin, Simon; Haynes, G Clark; Porteous, Jack; Koditschek, Daniel; Revzen, Shai; Spence, Andrew J

2017-08-01

Gaits and gait transitions play a central role in the movement of animals. Symmetry is thought to govern the structure of the nervous system, and constrain the limb motions of quadrupeds. We quantify the symmetry of dog gaits with respect to combinations of bilateral, fore-aft, and spatio-temporal symmetry groups. We tested the ability of symmetries to model motion capture data of dogs walking, trotting and transitioning between those gaits. Fully symmetric models performed comparably to asymmetric with only a [Formula: see text] increase in the residual sum of squares and only one-quarter of the parameters. This required adding a spatio-temporal shift representing a lag between fore and hind limbs. Without this shift, the symmetric model residual sum of squares was [Formula: see text] larger. This shift is related to (linear regression, [Formula: see text], [Formula: see text]) dog morphology. That this symmetry is respected throughout the gaits and transitions indicates that it generalizes outside a single gait. We propose that relative phasing of limb motions can be described by an interaction potential with a symmetric structure. This approach can be extended to the study of interaction of neurodynamic and kinematic variables, providing a system-level model that couples neuronal central pattern generator networks and mechanical models.

Properties and relative measure for quantifying quantum synchronization

NASA Astrophysics Data System (ADS)

Li, Wenlin; Zhang, Wenzhao; Li, Chong; Song, Heshan

2017-07-01

Although quantum synchronization phenomena and corresponding measures have been widely discussed recently, it is still an open question how to characterize directly the influence of nonlocal correlation, which is the key distinction for identifying classical and quantum synchronizations. In this paper, we present basic postulates for quantifying quantum synchronization based on the related theory in Mari's work [Phys. Rev. Lett. 111, 103605 (2013), 10.1103/PhysRevLett.111.103605], and we give a general formula of a quantum synchronization measure with clear physical interpretations. By introducing Pearson's parameter, we show that the obvious characteristics of our measure are the relativity and monotonicity. As an example, the measure is applied to describe synchronization among quantum optomechanical systems under a Markovian bath. We also show the potential by quantifying generalized synchronization and discrete variable synchronization with this measure.

Locomotor Muscle Fatigue Does Not Alter Oxygen Uptake Kinetics during High-Intensity Exercise.

PubMed

Hopker, James G; Caporaso, Giuseppe; Azzalin, Andrea; Carpenter, Roger; Marcora, Samuele M

2016-01-01

The [Formula: see text] slow component ([Formula: see text]) that develops during high-intensity aerobic exercise is thought to be strongly associated with locomotor muscle fatigue. We sought to experimentally test this hypothesis by pre-fatiguing the locomotor muscles used during subsequent high-intensity cycling exercise. Over two separate visits, eight healthy male participants were asked to either perform a non-metabolically stressful 100 intermittent drop-jumps protocol (pre-fatigue condition) or rest for 33 min (control condition) according to a random and counterbalanced order. Locomotor muscle fatigue was quantified with 6-s maximal sprints at a fixed pedaling cadence of 90 rev·min -1 . Oxygen kinetics and other responses (heart rate, capillary blood lactate concentration and rating of perceived exertion, RPE) were measured during two subsequent bouts of 6 min cycling exercise at 50% of the delta between the lactate threshold and [Formula: see text] determined during a preliminary incremental exercise test. All tests were performed on the same cycle ergometer. Despite significant locomotor muscle fatigue ( P = 0.03), the [Formula: see text] was not significantly different between the pre-fatigue (464 ± 301 mL·min -1 ) and the control (556 ± 223 mL·min -1 ) condition ( P = 0.50). Blood lactate response was not significantly different between conditions ( P = 0.48) but RPE was significantly higher following the pre-fatiguing exercise protocol compared with the control condition ( P < 0.01) suggesting higher muscle recruitment. These results demonstrate experimentally that locomotor muscle fatigue does not significantly alter the [Formula: see text] kinetic response to high intensity aerobic exercise, and challenge the hypothesis that the [Formula: see text] is strongly associated with locomotor muscle fatigue.

Comparison of lipases for in vitro models of gastric digestion: lipolysis using two infant formulas as model substrates.

PubMed

Sassene, P J; Fanø, M; Mu, H; Rades, T; Aquistapace, S; Schmitt, B; Cruz-Hernandez, C; Wooster, T J; Müllertz, A

2016-09-14

The aim of this study was to find a lipase suitable as a surrogate for Human Gastric Lipase (HGL), since the development of predictive gastrointestinal lipolysis models are hampered by the lack of a lipase with similar digestive properties as HGL. Three potential surrogates for HGL; Rhizopus Oryzae Lipase (ROL), Rabbit Gastric Lipase (RGL) and recombinant HGL (rHGL), were used to catalyze the in vitro digestion of two infant formulas (a medium-chain triacylglyceride enriched formula (MC-IF) and a predominantly long-chain triacylglyceride formula (LC-IF)). Digesta were withdrawn after 0, 5, 15, 30, 60 min of gastric digestion and after 90 or 180 min of intestinal digestion with or without the presence of pancreatic enzymes, respectively. The digesta were analyzed by scanning electron microscopy and gas chromatography to quantify the release of fatty acids (FAs). Digestions of both formulas, catalyzed by ROL, showed that the extent of gastric digestion was higher than expected from previously published in vivo data. ROL was furthermore insensitive to FA chain length and all FAs were released at the same pace. RGL and rHGL favoured the release of MC-FAs in both formulas, but rHGL did also release some LC-FAs during digestion of MC-IF, whereas RGL only released MC-FAs. Digestion of a MC-IF by HGL in vivo showed that MC-FAs are preferentially released, but some LC-FAs are also released. Thus of the tested lipase rHGL replicated the digestive properties of HGL the best and is a suitable surrogate for HGL for use in in vitro gastrointestinal lipolysis models.

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.

Blood flow mechanics and oxygen transport and delivery in the retinal microcirculation: multiscale mathematical modeling and numerical simulation.

PubMed

Causin, Paola; Guidoboni, Giovanna; Malgaroli, Francesca; Sacco, Riccardo; Harris, Alon

2016-06-01

The scientific community continues to accrue evidence that blood flow alterations and ischemic conditions in the retina play an important role in the pathogenesis of ocular diseases. Many factors influence retinal hemodynamics and tissue oxygenation, including blood pressure, blood rheology, oxygen arterial permeability and tissue metabolic demand. Since the influence of these factors on the retinal circulation is difficult to isolate in vivo, we propose here a novel mathematical and computational model describing the coupling between blood flow mechanics and oxygen ([Formula: see text]) transport in the retina. Albeit in a simplified manner, the model accounts for the three-dimensional anatomical structure of the retina, consisting in a layered tissue nourished by an arteriolar/venular network laying on the surface proximal to the vitreous. Capillary plexi, originating from terminal arterioles and converging into smaller venules, are embedded in two distinct tissue layers. Arteriolar and venular networks are represented by fractal trees, whereas capillary plexi are represented using a simplified lumped description. In the model, [Formula: see text] is transported along the vasculature and delivered to the tissue at a rate that depends on the metabolic demand of the various tissue layers. First, the model is validated against available experimental results to identify baseline conditions. Then, a sensitivity analysis is performed to quantify the influence of blood pressure, blood rheology, oxygen arterial permeability and tissue oxygen demand on the [Formula: see text] distribution within the blood vessels and in the tissue. This analysis shows that: (1) systemic arterial blood pressure has a strong influence on the [Formula: see text] profiles in both blood and tissue; (2) plasma viscosity and metabolic consumption rates have a strong influence on the [Formula: see text] tension at the level of the retinal ganglion cells; and (3) arterial [Formula: see text] permeability has a strong influence on the [Formula: see text] saturation in the retinal arterioles.

Analytical probabilistic modeling of RBE-weighted dose for ion therapy.

PubMed

Wieser, H P; Hennig, P; Wahl, N; Bangert, M

2017-11-10

Particle therapy is especially prone to uncertainties. This issue is usually addressed with uncertainty quantification and minimization techniques based on scenario sampling. For proton therapy, however, it was recently shown that it is also possible to use closed-form computations based on analytical probabilistic modeling (APM) for this purpose. APM yields unique features compared to sampling-based approaches, motivating further research in this context. This paper demonstrates the application of APM for intensity-modulated carbon ion therapy to quantify the influence of setup and range uncertainties on the RBE-weighted dose. In particular, we derive analytical forms for the nonlinear computations of the expectation value and variance of the RBE-weighted dose by propagating linearly correlated Gaussian input uncertainties through a pencil beam dose calculation algorithm. Both exact and approximation formulas are presented for the expectation value and variance of the RBE-weighted dose and are subsequently studied in-depth for a one-dimensional carbon ion spread-out Bragg peak. With V and B being the number of voxels and pencil beams, respectively, the proposed approximations induce only a marginal loss of accuracy while lowering the computational complexity from order [Formula: see text] to [Formula: see text] for the expectation value and from [Formula: see text] to [Formula: see text] for the variance of the RBE-weighted dose. Moreover, we evaluated the approximated calculation of the expectation value and standard deviation of the RBE-weighted dose in combination with a probabilistic effect-based optimization on three patient cases considering carbon ions as radiation modality against sampled references. The resulting global γ-pass rates (2 mm,2%) are [Formula: see text]99.15% for the expectation value and [Formula: see text]94.95% for the standard deviation of the RBE-weighted dose, respectively. We applied the derived analytical model to carbon ion treatment planning, although the concept is in general applicable to other ion species considering a variable RBE.

Carbohydrate maldigestion induces necrotizing enterocolitis in preterm pigs

PubMed Central

Thymann, Thomas; Møller, Hanne K.; Stoll, Barbara; Støy, Ann Cathrine F.; Buddington, Randal K.; Bering, Stine B.; Jensen, Bent B.; Olutoye, Oluyinka O.; Siggers, Richard H.; Mølbak, Lars; Sangild, Per T.

2009-01-01

Necrotizing enterocolitis (NEC) remains the most severe gastrointestinal disorder in preterm infants. It is associated with the initiation of enteral nutrition and may be related to immature carbohydrate digestive capacity. We tested the hypothesis that a formula containing maltodextrin vs. a formula containing lactose as the principal source of carbohydrate would predispose preterm pigs to a higher NEC incidence. Cesarean-derived preterm pigs were given total parenteral nutrition for 48 h followed by total enteral nutrition with a lactose-based (n = 11) or maltodextrin-based (n = 11) formula for 36 h. A higher incidence (91% vs. 27%) and severity (score of 3.3 vs. 1.8) of NEC were observed in the maltodextrin than in the lactose group. This higher incidence of NEC in the maltodextrin group was associated with significantly lower activities of lactase, maltase, and aminopeptidase; reduced villus height; transiently reduced in vivo aldohexose uptake; and reduced ex vivo aldohexose uptake capacity in the middle region of the small intestine. Bacterial diversity was low for both diets, but alterations in bacterial composition and luminal concentrations of short-chain fatty acids were observed in the maltodextrin group. In a second study, we quantified net portal absorption of aldohexoses (glucose and galactose) during acute jejunal infusion of a maltodextrin- or a lactose-based formula (n = 8) into preterm pigs. We found lower net portal aldohexose absorption (4% vs. 42%) and greater intestinal recovery of undigested carbohydrate (68% vs. 27%) in pigs acutely perfused with the maltodextrin-based formula than those perfused with the lactose-based formula. The higher digestibility of the lactose than the maltodextrin in the formulas can be attributed to a 5- to 20-fold higher hydrolytic activity of tissue-specific lactase than maltases. We conclude that carbohydrate maldigestion is sufficient to increase the incidence and severity of NEC in preterm pigs. PMID:19808655

Low laser power micro-Raman study of Co{sub (1−x)}Mn{sub (x)}Fe{sub 2}O{sub 4} prepared by flash combustion method

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

Baraliya, J. D.

2016-05-23

Manganese substituted Cobalt ferrites of composition with nominal formula Co{sub (1−x)}Mn{sub (x)}Fe{sub 2}O{sub 4} (x = 0.0, 0.2, 0.4, 0.6, 0.8, 1.0) prepared by the Flash Combustion Method(FCM). The single phase spinel formation of nano ferrites was confirmed by X-ray diffraction techniques and micro - Raman spectroscopy. The particle size calculated from the Scherrer formula varied within 13 to 17 nm. Lattice parameter, nano particle size, and cation distribution were quantified as a function of the Mn-content in the range x = 0.0 to 1.0. Micro-Raman spectroscopic studies yielded convincing evidence for a transformation of the structure.

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.

Construction and analysis of gene-gene dynamics influence networks based on a Boolean model.

PubMed

Mazaya, Maulida; Trinh, Hung-Cuong; Kwon, Yung-Keun

2017-12-21

Identification of novel gene-gene relations is a crucial issue to understand system-level biological phenomena. To this end, many methods based on a correlation analysis of gene expressions or structural analysis of molecular interaction networks have been proposed. They have a limitation in identifying more complicated gene-gene dynamical relations, though. To overcome this limitation, we proposed a measure to quantify a gene-gene dynamical influence (GDI) using a Boolean network model and constructed a GDI network to indicate existence of a dynamical influence for every ordered pair of genes. It represents how much a state trajectory of a target gene is changed by a knockout mutation subject to a source gene in a gene-gene molecular interaction (GMI) network. Through a topological comparison between GDI and GMI networks, we observed that the former network is denser than the latter network, which implies that there exist many gene pairs of dynamically influencing but molecularly non-interacting relations. In addition, a larger number of hub genes were generated in the GDI network. On the other hand, there was a correlation between these networks such that the degree value of a node was positively correlated to each other. We further investigated the relationships of the GDI value with structural properties and found that there are negative and positive correlations with the length of a shortest path and the number of paths, respectively. In addition, a GDI network could predict a set of genes whose steady-state expression is affected in E. coli gene-knockout experiments. More interestingly, we found that the drug-targets with side-effects have a larger number of outgoing links than the other genes in the GDI network, which implies that they are more likely to influence the dynamics of other genes. Finally, we found biological evidences showing that the gene pairs which are not molecularly interacting but dynamically influential can be considered for novel gene-gene relationships. Taken together, construction and analysis of the GDI network can be a useful approach to identify novel gene-gene relationships in terms of the dynamical influence.

Implications of immortal person-time when outcomes are nonfatal.

PubMed

Liang, Caihua; Seeger, John D; Dore, David D

2016-03-01

The amount of immortal time bias in studies with nonfatal outcomes is unclear. To quantify the magnitude of bias from mishandling of immortal person-time in studies of nonfatal outcomes. We derived formulas for quantifying bias from misclassified or excluded immortal person-time in settings with nonfatal outcomes, assuming a constant rate of outcome. In the situation of misclassified or excluded immortal person-time, the quantification includes the immortal time and corresponding events mistakenly attributed to the exposed group (misclassified) or excluded from study (excluded) that must be attributed to the comparison group. With misclassified immortal person-time, the magnitude of bias varies according to the incidence rate ratio of immortal time and comparison group as well as the rate ratio of immortal time and exposed group: toward null for both ratios less than 1, no bias for both ratios equal to 1, away from null for both ratios greater than 1. For one ratio less than 1 and the other greater than 1, the direction and magnitude of bias can be obtained from the formula provided. With excluded immortal person-time, the magnitude of bias is associated with the incidence rate ratio of immortal time and comparison group: toward null for the ratio less than 1, no bias for the ratio equal to 1, and away from null for the ratio greater than 1. Bias due to immortal person-time in studies with nonfatal outcomes can vary widely and can be quantified under assumptions that apply to many studies. Copyright © 2016 Elsevier Inc. All rights reserved.

A Practical and Time-Efficient High-Intensity Interval Training Program Modifies Cardio-Metabolic Risk Factors in Adults with Risk Factors for Type II Diabetes.

PubMed

Phillips, Bethan E; Kelly, Benjamin M; Lilja, Mats; Ponce-González, Jesús Gustavo; Brogan, Robert J; Morris, David L; Gustafsson, Thomas; Kraus, William E; Atherton, Philip J; Vollaard, Niels B J; Rooyackers, Olav; Timmons, James A

2017-01-01

Regular physical activity (PA) can reduce the risk of developing type 2 diabetes, but adherence to time-orientated (150 min week -1 or more) PA guidelines is very poor. A practical and time-efficient PA regime that was equally efficacious at controlling risk factors for cardio-metabolic disease is one solution to this problem. Herein, we evaluate a new time-efficient and genuinely practical high-intensity interval training (HIT) protocol in men and women with pre-existing risk factors for type 2 diabetes. One hundred eighty-nine sedentary women ( n  = 101) and men ( n  = 88) with impaired glucose tolerance and/or a body mass index >27 kg m -2 [mean (range) age: 36 (18-53) years] participated in this multi-center study. Each completed a fully supervised 6-week HIT protocol at work-loads equivalent to ~100 or ~125% [Formula: see text]. Change in [Formula: see text] was used to monitor protocol efficacy, while Actiheart™ monitors were used to determine PA during four, weeklong, periods. Mean arterial (blood) pressure (MAP) and fasting insulin resistance [homeostatic model assessment (HOMA)-IR] represent key health biomarker outcomes. The higher intensity bouts (~125% [Formula: see text]) used during a 5-by-1 min HIT protocol resulted in a robust increase in [Formula: see text] (136 participants, +10.0%, p  < 0.001; large size effect). 5-by-1 HIT reduced MAP (~3%; p  < 0.001) and HOMA-IR (~16%; p  < 0.01). Physiological responses were similar in men and women while a sizeable proportion of the training-induced changes in [Formula: see text], MAP, and HOMA-IR was retained 3 weeks after cessation of training. The supervised HIT sessions accounted for the entire quantifiable increase in PA, and this equated to 400 metabolic equivalent (MET) min week -1 . Meta-analysis indicated that 5-by-1 HIT matched the efficacy and variability of a time-consuming 30-week PA program on [Formula: see text], MAP, and HOMA-IR. With a total time-commitment of <15 min per session and reliance on a practical ergometer protocol, 5-by-1 HIT offers a new solution to modulate cardio-metabolic risk factors in adults with pre-existing risk factors for type 2 diabetes while approximately meeting the MET min week -1 PA guidelines. Long-term randomized controlled studies will be required to quantify the ability for 5-by-1 HIT to reduce the incidence of type 2 diabetes, while strategies are required to harmonize the adaptations to exercise across individuals.

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.

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.

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.

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

Thomas, Sylvia -Monique; Wilson, Kathryn; Koch-Muller, Monika

Majoritic garnet, characterized by an excess of silicon (>3 Si per formula unit), is considered one of the major phases of the Earth’s transition zone from 410-660 km depth. Quantifying the H 2O content of nominally anhydrous mantle minerals is necessary to evaluate their water storage capacity from experiments and modeling the Earth’s deep water cycle. We present mineral-specific infrared absorption coefficients for the purpose of quantifying the amount of water incorporated into majorite as hydroxyl point defects. A suite of majoritic garnet samples with varying proportions of Si, Fe, Al, Cr and H 2O was synthesized at conditions ofmore » 18-19 GPa and 1500-1800°C. Single-crystals were characterized using X-ray diffraction, electron microprobe analysis, secondary Ion Mass spectrometry (SIMS), IR, Raman and Mössbauer spectroscopy. We utilize SIMS and Raman spectroscopy in combination with IR spectroscopy to provide IR absorption coefficients for water in majoritic garnets with the general mineral formula (Mg,Fe) 3(Si,Mg,Fe,Al,Cr) 2[SiO4] 3. Furthermore, the IR absorption coefficient for majoritic garnet in the OH stretching region is frequency-dependent and ranges from 10 470 ± 3100 Lmol-1cm-2 to 23 400 ± 2300 Lmol -1cm -2.« less

An Integrated Strategy for Global Qualitative and Quantitative Profiling of Traditional Chinese Medicine Formulas: Baoyuan Decoction as a Case

NASA Astrophysics Data System (ADS)

Ma, Xiaoli; Guo, Xiaoyu; Song, Yuelin; Qiao, Lirui; Wang, Wenguang; Zhao, Mingbo; Tu, Pengfei; Jiang, Yong

2016-12-01

Clarification of the chemical composition of traditional Chinese medicine formulas (TCMFs) is a challenge due to the variety of structures and the complexity of plant matrices. Herein, an integrated strategy was developed by hyphenating ultra-performance liquid chromatography (UPLC), quadrupole time-of-flight (Q-TOF), hybrid triple quadrupole-linear ion trap mass spectrometry (Qtrap-MS), and the novel post-acquisition data processing software UNIFI to achieve automatic, rapid, accurate, and comprehensive qualitative and quantitative analysis of the chemical components in TCMFs. As a proof-of-concept, the chemical profiling of Baoyuan decoction (BYD), which is an ancient TCMF that is clinically used for the treatment of coronary heart disease that consists of Ginseng Radix et Rhizoma, Astragali Radix, Glycyrrhizae Radix et Rhizoma Praeparata Cum Melle, and Cinnamomi Cortex, was performed. As many as 236 compounds were plausibly or unambiguously identified, and 175 compounds were quantified or relatively quantified by the scheduled multiple reaction monitoring (sMRM) method. The findings demonstrate that the strategy integrating the rapidity of UNIFI software, the efficiency of UPLC, the accuracy of Q-TOF-MS, and the sensitivity and quantitation ability of Qtrap-MS provides a method for the efficient and comprehensive chemome characterization and quality control of complex TCMFs.

Quantification of water in majoritic garnet

DOE PAGES

Thomas, Sylvia -Monique; Wilson, Kathryn; Koch-Muller, Monika; ...

2015-05-01

Majoritic garnet, characterized by an excess of silicon (>3 Si per formula unit), is considered one of the major phases of the Earth’s transition zone from 410-660 km depth. Quantifying the H 2O content of nominally anhydrous mantle minerals is necessary to evaluate their water storage capacity from experiments and modeling the Earth’s deep water cycle. We present mineral-specific infrared absorption coefficients for the purpose of quantifying the amount of water incorporated into majorite as hydroxyl point defects. A suite of majoritic garnet samples with varying proportions of Si, Fe, Al, Cr and H 2O was synthesized at conditions ofmore » 18-19 GPa and 1500-1800°C. Single-crystals were characterized using X-ray diffraction, electron microprobe analysis, secondary Ion Mass spectrometry (SIMS), IR, Raman and Mössbauer spectroscopy. We utilize SIMS and Raman spectroscopy in combination with IR spectroscopy to provide IR absorption coefficients for water in majoritic garnets with the general mineral formula (Mg,Fe) 3(Si,Mg,Fe,Al,Cr) 2[SiO4] 3. Furthermore, the IR absorption coefficient for majoritic garnet in the OH stretching region is frequency-dependent and ranges from 10 470 ± 3100 Lmol-1cm-2 to 23 400 ± 2300 Lmol -1cm -2.« less

Comparison of Molecular Species Distribution of DHA-Containing Triacylglycerols in Milk and Different Infant Formulas by Liquid Chromatography-Mass Spectrometry.

PubMed

Liu, Zhiqian; Cocks, Benjamin G; Rochfort, Simone

2016-03-16

Long-chain polyunsaturated fatty acids (LC-PUFA) are an important nutritional lipid and have potential in being able to promote human health. Docosahexaenoic acid (DHA, C22:6ω3) is often added in infant formulas to meet the nutritional requirement of formula-fed infants. A comprehensive survey on DHA-containing triacylglycerol (DHA-TAG) molecular species has been conducted for seven infant formulas (IFs) sourced from Australia, Europe, and the USA as well as bovine milk and human milk. Using LC-triple quadrupole MS and LC-LTQ-orbitrap MS we were able to identify and quantify 56 DHA-TAG species in these samples; the fatty acid structure of these species was assigned using their MS(2) spectra. The species composition of DHA-TAG was found to be different between bovine milk, human milk, and IFs and also between different brands of IFs. Bovine milk and human milk contain DHA-TAG of smaller molecular size (728-952 Da), whereas five out of the seven IF samples contain species of broader mass range (from 728 to 1035 Da). Our study indicates that two types of DHA were used in the seven IF products surveyed and that there is very large difference in molecular species distribution in different IF products that may influence the fine nutritional profile and biological functions of IF products.

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

Entanglement spectrum degeneracy and the Cardy formula in 1+1 dimensional conformal field theories

NASA Astrophysics Data System (ADS)

Alba, Vincenzo; Calabrese, Pasquale; Tonni, Erik

2018-01-01

We investigate the effect of a global degeneracy in the distribution of the entanglement spectrum in conformal field theories in one spatial dimension. We relate the recently found universal expression for the entanglement Hamiltonian to the distribution of the entanglement spectrum. The main tool to establish this connection is the Cardy formula. It turns out that the Affleck-Ludwig non-integer degeneracy, appearing because of the boundary conditions induced at the entangling surface, can be directly read from the entanglement spectrum distribution. We also clarify the effect of the non-integer degeneracy on the spectrum of the partial transpose, which is the central object for quantifying the entanglement in mixed states. We show that the exact knowledge of the entanglement spectrum in some integrable spin-chains provides strong analytical evidences corroborating our results.

Age Estimation of African Lions Panthera leo by Ratio of Tooth Areas

PubMed Central

Ikanda, Dennis; Ferrante, Luigi; Chardonnet, Philippe; Mesochina, Pascal; Cameriere, Roberto

2016-01-01

Improved age estimation of African lions Panthera leo is needed to address a number of pressing conservation issues. Here we present a formula for estimating lion age to within six months of known age based on measuring the extent of pulp closure from X-rays, or Ratio Of tooth AReas (ROAR). Derived from measurements taken from lions aged 3–13 years for which exact ages were known, the formula explains 92% of the total variance. The method of calculating the pulp/tooth area ratio, which has been used extensively in forensic science, is novel in the study of lion aging. As a quantifiable measure, ROAR offers improved lion age estimates for population modeling and investigations of age-related mortality, and may assist national and international wildlife authorities in judging compliance with regulatory measures involving age. PMID:27089506

Age Estimation of African Lions Panthera leo by Ratio of Tooth Areas.

PubMed

White, Paula A; Ikanda, Dennis; Ferrante, Luigi; Chardonnet, Philippe; Mesochina, Pascal; Cameriere, Roberto

2016-01-01

Improved age estimation of African lions Panthera leo is needed to address a number of pressing conservation issues. Here we present a formula for estimating lion age to within six months of known age based on measuring the extent of pulp closure from X-rays, or Ratio Of tooth AReas (ROAR). Derived from measurements taken from lions aged 3-13 years for which exact ages were known, the formula explains 92% of the total variance. The method of calculating the pulp/tooth area ratio, which has been used extensively in forensic science, is novel in the study of lion aging. As a quantifiable measure, ROAR offers improved lion age estimates for population modeling and investigations of age-related mortality, and may assist national and international wildlife authorities in judging compliance with regulatory measures involving age.

EAGLE Monitors by Collecting Facts and Generating Obligations

NASA Technical Reports Server (NTRS)

Barrnger, Howard; Goldberg, Allen; Havelund, Klaus; Sen, Koushik

2003-01-01

We present a rule-based framework, called EAGLE, that has been shown to be capable of defining and implementing a range of finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time and metric temporal logics, interval logics, forms of quantified temporal logics, and so on. A monitor for an EAGLE formula checks if a finite trace of states satisfies the given formula. We present, in details, an algorithm for the synthesis of monitors for EAGLE. The algorithm is implemented as a Java application and involves novel techniques for rule definition, manipulation and execution. Monitoring is achieved on a state-by-state basis avoiding any need to store the input trace of states. Our initial experiments have been successful as EAGLE detected a previously unknown bug while testing a planetary rover controller.

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.

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.

Altered Micro-RNA Degradation Promotes Tumor Heterogeneity: A Result from Boolean Network Modeling.

PubMed

Wu, Yunyi; Krueger, Gerhard R F; Wang, Guanyu

2016-02-01

Cancer heterogeneity may reflect differential dynamical outcomes of the regulatory network encompassing biomolecules at both transcriptional and post-transcriptional levels. In other words, differential gene-expression profiles may correspond to different stable steady states of a mathematical model for simulation of biomolecular networks. To test this hypothesis, we simplified a regulatory network that is important for soft-tissue sarcoma metastasis and heterogeneity, comprising of transcription factors, micro-RNAs, and signaling components of the NOTCH pathway. We then used a Boolean network model to simulate the dynamics of this network, and particularly investigated the consequences of differential miRNA degradation modes. We found that efficient miRNA degradation is crucial for sustaining a homogenous and healthy phenotype, while defective miRNA degradation may lead to multiple stable steady states and ultimately to carcinogenesis and heterogeneity. Copyright© 2016 International Institute of Anticancer Research (Dr. John G. Delinassios), All rights reserved.

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.

Notes on modified trace distance measure of coherence

NASA Astrophysics Data System (ADS)

Chen, Bin; Fei, Shao-Ming

2018-05-01

We investigate the modified trace distance measure of coherence recently introduced in Yu et al. [Phys. Rev. A 94, 060302(R), 2016]. We show that for any single-qubit state, the modified trace norm of coherence is equal to the l1-norm of coherence. For any d-dimensional quantum system, an analytical formula of this measure for a class of maximally coherent mixed states is provided. The trade-off relation between the coherence quantified by the new measure and the mixedness quantified by the trace norm is also discussed. Furthermore, we explore the relation between the modified trace distance measure of coherence and other measures such as the l1-norm of coherence and the geometric measure of coherence.

Success factors for reducing maternal and child mortality

PubMed Central

Schweitzer, Julian; Bishai, David; Chowdhury, Sadia; Caramani, Daniele; Frost, Laura; Cortez, Rafael; Daelmans, Bernadette; de Francisco, Andres; Adam, Taghreed; Cohen, Robert; Alfonso, Y Natalia; Franz-Vasdeki, Jennifer; Saadat, Seemeen; Pratt, Beth Anne; Eugster, Beatrice; Bandali, Sarah; Venkatachalam, Pritha; Hinton, Rachael; Murray, John; Arscott-Mills, Sharon; Axelson, Henrik; Maliqi, Blerta; Sarker, Intissar; Lakshminarayanan, Rama; Jacobs, Troy; Jacks, Susan; Mason, Elizabeth; Ghaffar, Abdul; Mays, Nicholas; Presern, Carole; Bustreo, Flavia

2014-01-01

Abstract Reducing maternal and child mortality is a priority in the Millennium Development Goals (MDGs), and will likely remain so after 2015. Evidence exists on the investments, interventions and enabling policies required. Less is understood about why some countries achieve faster progress than other comparable countries. The Success Factors for Women’s and Children’s Health studies sought to address this knowledge gap using statistical and econometric analyses of data from 144 low- and middle-income countries (LMICs) over 20 years; Boolean, qualitative comparative analysis; a literature review; and country-specific reviews in 10 fast-track countries for MDGs 4 and 5a. There is no standard formula – fast-track countries deploy tailored strategies and adapt quickly to change. However, fast-track countries share some effective approaches in addressing three main areas to reduce maternal and child mortality. First, these countries engage multiple sectors to address crucial health determinants. Around half the reduction in child mortality in LMICs since 1990 is the result of health sector investments, the other half is attributed to investments made in sectors outside health. Second, these countries use strategies to mobilize partners across society, using timely, robust evidence for decision-making and accountability and a triple planning approach to consider immediate needs, long-term vision and adaptation to change. Third, the countries establish guiding principles that orient progress, align stakeholder action and achieve results over time. This evidence synthesis contributes to global learning on accelerating improvements in women’s and children’s health towards 2015 and beyond. PMID:25110379

Success factors for reducing maternal and child mortality.

PubMed

Kuruvilla, Shyama; Schweitzer, Julian; Bishai, David; Chowdhury, Sadia; Caramani, Daniele; Frost, Laura; Cortez, Rafael; Daelmans, Bernadette; de Francisco, Andres; Adam, Taghreed; Cohen, Robert; Alfonso, Y Natalia; Franz-Vasdeki, Jennifer; Saadat, Seemeen; Pratt, Beth Anne; Eugster, Beatrice; Bandali, Sarah; Venkatachalam, Pritha; Hinton, Rachael; Murray, John; Arscott-Mills, Sharon; Axelson, Henrik; Maliqi, Blerta; Sarker, Intissar; Lakshminarayanan, Rama; Jacobs, Troy; Jack, Susan; Jacks, Susan; Mason, Elizabeth; Ghaffar, Abdul; Mays, Nicholas; Presern, Carole; Bustreo, Flavia

2014-07-01

Reducing maternal and child mortality is a priority in the Millennium Development Goals (MDGs), and will likely remain so after 2015. Evidence exists on the investments, interventions and enabling policies required. Less is understood about why some countries achieve faster progress than other comparable countries. The Success Factors for Women's and Children's Health studies sought to address this knowledge gap using statistical and econometric analyses of data from 144 low- and middle-income countries (LMICs) over 20 years; Boolean, qualitative comparative analysis; a literature review; and country-specific reviews in 10 fast-track countries for MDGs 4 and 5a. There is no standard formula--fast-track countries deploy tailored strategies and adapt quickly to change. However, fast-track countries share some effective approaches in addressing three main areas to reduce maternal and child mortality. First, these countries engage multiple sectors to address crucial health determinants. Around half the reduction in child mortality in LMICs since 1990 is the result of health sector investments, the other half is attributed to investments made in sectors outside health. Second, these countries use strategies to mobilize partners across society, using timely, robust evidence for decision-making and accountability and a triple planning approach to consider immediate needs, long-term vision and adaptation to change. Third, the countries establish guiding principles that orient progress, align stakeholder action and achieve results over time. This evidence synthesis contributes to global learning on accelerating improvements in women's and children's health towards 2015 and beyond.

Influence of accurate and inaccurate 'split-time' feedback upon 10-mile time trial cycling performance.

PubMed

Wilson, Mathew G; Lane, Andy M; Beedie, Chris J; Farooq, Abdulaziz

2012-01-01

The objective of the study is to examine the impact of accurate and inaccurate 'split-time' feedback upon a 10-mile time trial (TT) performance and to quantify power output into a practically meaningful unit of variation. Seven well-trained cyclists completed four randomised bouts of a 10-mile TT on a SRM™ cycle ergometer. TTs were performed with (1) accurate performance feedback, (2) without performance feedback, (3) and (4) false negative and false positive 'split-time' feedback showing performance 5% slower or 5% faster than actual performance. There were no significant differences in completion time, average power output, heart rate or blood lactate between the four feedback conditions. There were significantly lower (p < 0.001) average [Formula: see text] (ml min(-1)) and [Formula: see text] (l min(-1)) scores in the false positive (3,485 ± 596; 119 ± 33) and accurate (3,471 ± 513; 117 ± 22) feedback conditions compared to the false negative (3,753 ± 410; 127 ± 27) and blind (3,772 ± 378; 124 ± 21) feedback conditions. Cyclists spent a greater amount of time in a '20 watt zone' 10 W either side of average power in the negative feedback condition (fastest) than the accurate feedback (slowest) condition (39.3 vs. 32.2%, p < 0.05). There were no significant differences in the 10-mile TT performance time between accurate and inaccurate feedback conditions, despite significantly lower average [Formula: see text] and [Formula: see text] scores in the false positive and accurate feedback conditions. Additionally, cycling with a small variation in power output (10 W either side of average power) produced the fastest TT. Further psycho-physiological research should examine the mechanism(s) why lower [Formula: see text] and [Formula: see text] scores are observed when cycling in a false positive or accurate feedback condition compared to a false negative or blind feedback condition.

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.

On the Wiener Polarity Index of Lattice Networks.

PubMed

Chen, Lin; Li, Tao; Liu, Jinfeng; Shi, Yongtang; Wang, Hua

2016-01-01

Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications. Research on this topic relies on finding a suitable measure and use this measure to quantify network robustness. A number of distance-based graph invariants, also known as topological indices, have recently been incorporated as descriptors of complex networks. Among them the Wiener type indices are the most well known and commonly used such descriptors. As one of the fundamental variants of the original Wiener index, the Wiener polarity index has been introduced for a long time and known to be related to the cluster coefficient of networks. In this paper, we consider the value of the Wiener polarity index of lattice networks, a common network structure known for its simplicity and symmetric structure. We first present a simple general formula for computing the Wiener polarity index of any graph. Using this formula, together with the symmetric and recursive topology of lattice networks, we provide explicit formulas of the Wiener polarity index of the square lattices, the hexagonal lattices, the triangular lattices, and the 33 ⋅ 42 lattices. We also comment on potential future research topics.

Escape rate for nonequilibrium processes dominated by strong non-detailed balance force

NASA Astrophysics Data System (ADS)

Tang, Ying; Xu, Song; Ao, Ping

2018-02-01

Quantifying the escape rate from a meta-stable state is essential to understand a wide range of dynamical processes. Kramers' classical rate formula is the product of an exponential function of the potential barrier height and a pre-factor related to the friction coefficient. Although many applications of the rate formula focused on the exponential term, the prefactor can have a significant effect on the escape rate in certain parameter regions, such as the overdamped limit and the underdamped limit. There have been continuous interests to understand the effect of non-detailed balance on the escape rate; however, how the prefactor behaves under strong non-detailed balance force remains elusive. In this work, we find that the escape rate formula has a vanishing prefactor with decreasing friction strength under the strong non-detailed balance limit. We both obtain analytical solutions in specific examples and provide a derivation for more general cases. We further verify the result by simulations and propose a testable experimental system of a charged Brownian particle in electromagnetic field. Our study demonstrates that a special care is required to estimate the effect of prefactor on the escape rate when non-detailed balance force dominates.

Associations between Infant Feeding Practices and Length, Weight, and Disease in Developing Countries

PubMed Central

Yarnoff, Benjamin O.; Allaire, Benjamin T.; Detzel, Patrick

2013-01-01

The health benefits of exclusive breastfeeding are well-known, but the relative detrimental impacts of other foods on infant health are unknown. Because infants in developing countries are fed a wide range of food, quantifying the burden of these diverse feeding practices on infant health is essential for public health policy. We used data from the Demographic Health Survey from 20 developing countries over multiple years to examine the independent association of six different types of food (exclusive breastfeeding, non-exclusive breastfeeding, infant formula, milk liquids, non-milk liquids, and solid foods) with five measures of infant health (length, weight, diarrhea, fever, and cough). We estimated associations with regression analysis, controlling for confounding factors with infant, mother, and household factors and community-year fixed effects. We used these estimates in a simulation model to quantify the burden of different combinations of food on infant health. We show that for an infant younger than 6 months old, following current guidelines and exclusively breastfeeding instead of giving the infant solid foods may increase length by 0.75 cm and weight by 0.25 kg and decrease diarrhea, fever, and cough prevalence by 8, 12, and 11%, respectively. We found that the burden on infant health of some feeding practices is less than others. Although all other feeding practices are associated with worse health outcomes than exclusive breastfeeding, breastfeeding supplemented with liquids has a lower burden on infant health than solid foods and infant formula has a lower burden than milk or non-milk liquids as measured by four of five health metrics. Providing specific quantified burden estimates of these practices can help inform public health policy related to infant feeding practices. PMID:24400267

Modeling of chromosome intermingling by partially overlapping uniform random polygons.

PubMed

Blackstone, T; Scharein, R; Borgo, B; Varela, R; Diao, Y; Arsuaga, J

2011-03-01

During the early phase of the cell cycle the eukaryotic genome is organized into chromosome territories. The geometry of the interface between any two chromosomes remains a matter of debate and may have important functional consequences. The Interchromosomal Network model (introduced by Branco and Pombo) proposes that territories intermingle along their periphery. In order to partially quantify this concept we here investigate the probability that two chromosomes form an unsplittable link. We use the uniform random polygon as a crude model for chromosome territories and we model the interchromosomal network as the common spatial region of two overlapping uniform random polygons. This simple model allows us to derive some rigorous mathematical results as well as to perform computer simulations easily. We find that the probability that one uniform random polygon of length n that partially overlaps a fixed polygon is bounded below by 1 − O(1/√n). We use numerical simulations to estimate the dependence of the linking probability of two uniform random polygons (of lengths n and m, respectively) on the amount of overlapping. The degree of overlapping is parametrized by a parameter [Formula: see text] such that [Formula: see text] indicates no overlapping and [Formula: see text] indicates total overlapping. We propose that this dependence relation may be modeled as f (ε, m, n) = [Formula: see text]. Numerical evidence shows that this model works well when [Formula: see text] is relatively large (ε ≥ 0.5). We then use these results to model the data published by Branco and Pombo and observe that for the amount of overlapping observed experimentally the URPs have a non-zero probability of forming an unsplittable link.

Evaluation of three paediatric weight estimation methods in Singapore.

PubMed

Loo, Pei Ying; Chong, Shu-Ling; Lek, Ngee; Bautista, Dianne; Ng, Kee Chong

2013-04-01

Rapid paediatric weight estimation methods in the emergency setting have not been evaluated for South East Asian children. This study aims to assess the accuracy and precision of three such methods in Singapore children: Broselow-Luten (BL) tape, Advanced Paediatric Life Support (APLS) (estimated weight (kg) = 2 (age + 4)) and Luscombe (estimated weight (kg) = 3 (age) + 7) formulae. We recruited 875 patients aged 1-10 years in a Paediatric Emergency Department in Singapore over a 2-month period. For each patient, true weight and height were determined. True height was cross-referenced to the BL tape markings and used to derive estimated weight (virtual BL tape method), while patient's round-down age (in years) was used to derive estimated weights using APLS and Luscombe formulae, respectively. The percentage difference between the true and estimated weights was calculated. For each method, the bias and extent of agreement were quantified using Bland-Altman method (mean percentage difference (MPD) and 95% limits of agreement (LOA)). The proportion of weight estimates within 10% of true weight (p₁₀) was determined. The BL tape method marginally underestimated weights (MPD +0.6%; 95% LOA -26.8% to +28.1%; p₁₀ 58.9%). The APLS formula underestimated weights (MPD +7.6%; 95% LOA -26.5% to +41.7%; p₁₀ 45.7%). The Luscombe formula overestimated weights (MPD -7.4%; 95% LOA -51.0% to +36.2%; p₁₀ 37.7%). Of the three methods we evaluated, the BL tape method provided the most accurate and precise weight estimation for Singapore children. The APLS and Luscombe formulae underestimated and overestimated the children's weights, respectively, and were considerably less precise. © 2013 The Authors. Journal of Paediatrics and Child Health © 2013 Paediatrics and Child Health Division (Royal Australasian College of Physicians).

S-(-)equol production is developmentally regulated and related to early diet composition.

PubMed

Brown, Nadine M; Galandi, Stephanie L; Summer, Suzanne S; Zhao, Xueheng; Heubi, James E; King, Eileen C; Setchell, Kenneth D R

2014-05-01

S-(-)7-hydroxy-3-(4'-hydroxyphenyl)-chroman, or S-(-)equol, a biologically active intestinally derived bacterial metabolite of the soy isoflavones daidzin/daidzein, is not produced in neonatal life. Because its synthesis is dependent on equol-producing bacteria, we hypothesized that early nutrition may influence equol production. This prospective 2.5-year study determined the frequency of S-(-)equol production in healthy infants (n = 90) fed breast milk, soy infant formula, or cow's milk formula in their first year. Urinary S-(-)equol and daidzein were quantified by mass spectrometry after a standardized 3.5-day soy isoflavone challenge. Infants were tested at 6, 9, 12, 18, 24, and 36 months of age, and 3-day diet records were obtained at each visit to explore the effect of early and postweaning (>12 months) macronutrient and micronutrient dietary composition and S-(-)equol production. Use of antibiotics was also recorded. At age 6 months, none of the breast-fed infants produced S-(-)equol, whereas 3.8% and 6.0%, respectively, of soy and cow's milk formula-fed infants were equol producers. By age 3 years, 50% of the formula-fed infants were equol producers, compared with 25% of breast-fed infants. Use of antibiotics was prevalent among infants and may have impacted the stability of S-(-)equol production. No significant differences among the groups were observed in postweaning dietary intakes of total energy, carbohydrate, fiber, protein, fat, saturated fatty acids, or polyunsaturated fatty acids and the propensity to make S-(-)equol. In conclusion, S-(-)equol production is developmentally regulated and initially related to diet composition with the proportion of equol producers increasing over the first 3 years of life, with a trend for formula feeding favoring S-(-)equol production. Copyright © 2014 Elsevier Inc. All rights reserved.

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…

Effect of blood flow on near-the-wall mass transport of drugs and other bioactive agents: a simple formula to estimate boundary layer concentrations.

PubMed

Rugonyi, Sandra

2008-04-01

Transport of bioactive agents through the blood is essential for cardiovascular regulatory processes and drug delivery. Bioactive agents and other solutes infused into the blood through the wall of a blood vessel or released into the blood from an area in the vessel wall spread downstream of the infusion/release region and form a thin boundary layer in which solute concentration is higher than in the rest of the blood. Bioactive agents distributed along the vessel wall affect endothelial cells and regulate biological processes, such as thrombus formation, atherogenesis, and vascular remodeling. To calculate the concentration of solutes in the boundary layer, researchers have generally used numerical simulations. However, to investigate the effect of blood flow, infusion rate, and vessel geometry on the concentration of different solutes, many simulations are needed, leading to a time-consuming effort. In this paper, a relatively simple formula to quantify concentrations in a tube downstream of an infusion/release region is presented. Given known blood-flow rates, tube radius, solute diffusivity, and the length of the infusion region, this formula can be used to quickly estimate solute concentrations when infusion rates are known or to estimate infusion rates when solute concentrations at a point downstream of the infusion region are known. The developed formula is based on boundary layer theory and physical principles. The formula is an approximate solution of the advection-diffusion equations in the boundary layer region when solute concentration is small (dilute solution), infusion rate is modeled as a mass flux, and there is no transport of solute through the wall or chemical reactions downstream of the infusion region. Wall concentrations calculated using the formula developed in this paper were compared to the results from finite element models. Agreement between the results was within 10%. The developed formula could be used in experimental procedures to evaluate drug efficacy, in the design of drug-eluting stents, and to calculate rates of release of bioactive substances at active surfaces using downstream concentration measurements. In addition to being simple and fast to use, the formula gives accurate quantifications of concentrations and infusion rates under steady-state and oscillatory flow conditions, and therefore can be used to estimate boundary layer concentrations under physiological conditions.

Quantification and Analysis of Icebergs in a Tidewater Glacier Fjord Using an Object-Based Approach.

PubMed

McNabb, Robert W; Womble, Jamie N; Prakash, Anupma; Gens, Rudiger; Haselwimmer, Christian E

2016-01-01

Tidewater glaciers are glaciers that terminate in, and calve icebergs into, the ocean. In addition to the influence that tidewater glaciers have on physical and chemical oceanography, floating icebergs serve as habitat for marine animals such as harbor seals (Phoca vitulina richardii). The availability and spatial distribution of glacier ice in the fjords is likely a key environmental variable that influences the abundance and distribution of selected marine mammals; however, the amount of ice and the fine-scale characteristics of ice in fjords have not been systematically quantified. Given the predicted changes in glacier habitat, there is a need for the development of methods that could be broadly applied to quantify changes in available ice habitat in tidewater glacier fjords. We present a case study to describe a novel method that uses object-based image analysis (OBIA) to classify floating glacier ice in a tidewater glacier fjord from high-resolution aerial digital imagery. Our objectives were to (i) develop workflows and rule sets to classify high spatial resolution airborne imagery of floating glacier ice; (ii) quantify the amount and fine-scale characteristics of floating glacier ice; (iii) and develop processes for automating the object-based analysis of floating glacier ice for large number of images from a representative survey day during June 2007 in Johns Hopkins Inlet (JHI), a tidewater glacier fjord in Glacier Bay National Park, southeastern Alaska. On 18 June 2007, JHI was comprised of brash ice ([Formula: see text] = 45.2%, SD = 41.5%), water ([Formula: see text] = 52.7%, SD = 42.3%), and icebergs ([Formula: see text] = 2.1%, SD = 1.4%). Average iceberg size per scene was 5.7 m2 (SD = 2.6 m2). We estimate the total area (± uncertainty) of iceberg habitat in the fjord to be 455,400 ± 123,000 m2. The method works well for classifying icebergs across scenes (classification accuracy of 75.6%); the largest classification errors occur in areas with densely-packed ice, low contrast between neighboring ice cover, or dark or sediment-covered ice, where icebergs may be misclassified as brash ice about 20% of the time. OBIA is a powerful image classification tool, and the method we present could be adapted and applied to other ice habitats, such as sea ice, to assess changes in ice characteristics and availability.

Faults Get Colder Through Transient Granular Vortices

NASA Astrophysics Data System (ADS)

Einav, I.; Rognon, P.; Miller, T.; Sulem, J.

2018-03-01

Fault temperatures govern their weakening and control the dynamics of earthquakes during slip. Despite predictions of significant temperature rise within fault gouges during earthquake events, observations of frictional melting zones along exhumed faults are relatively rare. Could there be a heat transfer mechanism, previously not considered, that results in ubiquitously colder faults during earthquakes? We demonstrate that the remarkable, previously neglected mechanism of heat transfer through transient granular vortices may be at the core of this. We present and analyze results from perpetual simple shear experiments on a system of granular disks with which we are able to quantify the sizes and lifetimes of granular vortices within fault gouges during earthquakes. We then develop a formula that captures the contribution these vortices have on heat transfer. Using this formula, we show that crustal faults such as those in the San Andreas system may experience a maximum temperature rise 5 to 10 times lower than previously thought.

Quantifying the origins of life on a planetary scale.

PubMed

Scharf, Caleb; Cronin, Leroy

2016-07-19

A simple, heuristic formula with parallels to the Drake Equation is introduced to help focus discussion on open questions for the origins of life in a planetary context. This approach indicates a number of areas where quantitative progress can be made on parameter estimation for determining origins of life probabilities, based on constraints from Bayesian approaches. We discuss a variety of "microscale" factors and their role in determining "macroscale" abiogenesis probabilities on suitable planets. We also propose that impact ejecta exchange between planets with parallel chemistries and chemical evolution could in principle amplify the development of molecular complexity and abiogenesis probabilities. This amplification could be very significant, and both bias our conclusions about abiogenesis probabilities based on the Earth and provide a major source of variance in the probability of life arising in planetary systems. We use our heuristic formula to suggest a number of observational routes for improving constraints on origins of life probabilities.

Quantifying the origins of life on a planetary scale

NASA Astrophysics Data System (ADS)

Scharf, Caleb; Cronin, Leroy

2016-07-01

A simple, heuristic formula with parallels to the Drake Equation is introduced to help focus discussion on open questions for the origins of life in a planetary context. This approach indicates a number of areas where quantitative progress can be made on parameter estimation for determining origins of life probabilities, based on constraints from Bayesian approaches. We discuss a variety of “microscale” factors and their role in determining “macroscale” abiogenesis probabilities on suitable planets. We also propose that impact ejecta exchange between planets with parallel chemistries and chemical evolution could in principle amplify the development of molecular complexity and abiogenesis probabilities. This amplification could be very significant, and both bias our conclusions about abiogenesis probabilities based on the Earth and provide a major source of variance in the probability of life arising in planetary systems. We use our heuristic formula to suggest a number of observational routes for improving constraints on origins of life probabilities.

Extracellular Hsp90 as a Novel Epigenetic of EMT and Metastatic Risk in Prostate Cancer

DTIC Science & Technology

2015-12-01

kidney from each experiment were xenografted in three mice (total of six repli- cates). Mice were sacrificed after 7– 8 weeks, and grafts were harvested...Histological assessment of xenografts was performed by H&E staining. Calculation of xenograft vol- umes was performed using the following formula: volume... xenograft tumors originat- ing from the indicated ARCaPE derivatives 7– 8 weeks after implantation. Bottom, quantified analysis of corresponding tumors (n

Hydraulic resistance of submerged flexible vegetation

NASA Astrophysics Data System (ADS)

Stephan, Ursula; Gutknecht, Dieter

2002-12-01

The main research objective consisted in analysing the influence of roughness caused by aquatic vegetation (av), in particular submerged macrophytes, on the overall flow field. These plants are highly flexible and behave differently depending on the flow situation. They also react substantially to the flow field and thus, the roughness becomes variable and dynamic. Conventional flow formulas, such as the Manning or the Strickler formula, are one-dimensional and based on integral flow parameters. They are not suitable for quantifying the roughness of av, because the flow is complex and more dimensional due to the variable behaviour of the plants. Therefore, the present investigation concentrates on the definition of a characteristic hydraulic roughness parameter to quantify the resistance of av. Within this investigation laboratory experiments were carried out with three different types of av, chosen with respect to varying plant structures as well as stem lengths. Velocity measurements above these plants were conducted to determine the relationship between the hydraulic roughness and the deflected plant height. The deflected plant height is used as the geometric roughness parameter, whereas the equivalent sand roughness based on the universal logarithmic law modified by Nikuradse was used as hydraulic roughness parameter. The influence of relative submergence on the hydraulic roughness was also analysed. The analysis of the velocity measurements illustrates that equivalent sand roughness and zero plane displacement of the logarithmic law are correlated to the deflected plant height and are equally to this height.

Quantification of short- and medium-chain chlorinated paraffins in environmental samples by gas chromatography quadrupole time-of-flight mass spectrometry.

PubMed

Gao, Wei; Wu, Jing; Wang, Yawei; Jiang, Guibin

2016-06-24

Chlorinated paraffins (CPs) are technical products produced and used in bulk for a number of purposes. However, the analysis of CPs is challenging, as they are complex mixtures of compounds and isomers. We herein report the development of an analytical method for the analysis of short-chain CPs (SCCPs) and medium-chain CPs (MCCPs) using quadrupole time-of-flight high-resolution mass spectrometry (GC-NCI-qTOF-HRMS). This method employs gas chromatography with a chemical ionization source working in negative mode. The linear relationship between chlorination and the CP total response factors was applied to quantify the CP content and the congener group distribution patterns. In a single injection, 24 SCCP formula groups and 24 MCCP formula groups were quantified. Extraction of accurate masses using qTOF-HRMS allowed the SCCPs and MCCPs to be distinguished, with interference from other chemicals (e.g., PCBs) being largely avoided. The SCCP and MCCP detection limits were 24-81ng/mL and 27-170ng/mL, respectively. Comparison of the obtained results with analytical results from gas chromatography coupled with electron capture negative ionization low-resolution mass spectrometry (GC-ECNI-LRMS) indicate that the developed technique is a more accurate and convenient method for the analysis of CPs in samples from a range of matrices. Copyright © 2016 Elsevier B.V. All rights reserved.

Nitrification Is a Primary Driver of Nitrous Oxide Production in Laboratory Microcosms from Different Land-Use Soils.

PubMed

Liu, Rui; Hu, Hangwei; Suter, Helen; Hayden, Helen L; He, Jizheng; Mele, Pauline; Chen, Deli

2016-01-01

Most studies on soil N2O emissions have focused either on the quantifying of agricultural N2O fluxes or on the effect of environmental factors on N2O emissions. However, very limited information is available on how land-use will affect N2O production, and nitrifiers involved in N2O emissions in agricultural soil ecosystems. Therefore, this study aimed at evaluating the relative importance of nitrification and denitrification to N2O emissions from different land-use soils and identifying the potential underlying microbial mechanisms. A (15)N-tracing experiment was conducted under controlled laboratory conditions on four agricultural soils collected from different land-use. We measured N2O fluxes, nitrate ([Formula: see text]), and ammonium ([Formula: see text]) concentration and (15)N2O, (15)[Formula: see text], and (15)[Formula: see text] enrichment during the incubation. Quantitative PCR was used to quantify ammonia-oxidizing archaea (AOA) and ammonia-oxidizing bacteria (AOB). Our results showed that nitrification was the main contributor to N2O production in soils from sugarcane, dairy pasture and cereal cropping systems, while denitrification played a major role in N2O production in the vegetable soil under the experimental conditions. Nitrification contributed to 96.7% of the N2O emissions in sugarcane soil followed by 71.3% in the cereal cropping soil and 70.9% in the dairy pasture soil, while only around 20.0% of N2O was produced from nitrification in vegetable soil. The proportion of nitrified nitrogen as N2O (PN2O-value) varied across different soils, with the highest PN2O-value (0.26‰) found in the cereal cropping soil, which was around 10 times higher than that in other three systems. AOA were the abundant ammonia oxidizers, and were significantly correlated to N2O emitted from nitrification in the sugarcane soil, while AOB were significantly correlated with N2O emitted from nitrification in the cereal cropping soil. Our findings suggested that soil type and land-use might have strongly affected the relative contribution of nitrification and denitrification to N2O production from agricultural soils.

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…

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

Local distinguishability of Dicke states in quantum secret sharing

NASA Astrophysics Data System (ADS)

Wang, Jing-Tao; Xu, Gang; Chen, Xiu-Bo; Sun, Xing-Ming; Jia, Heng-Yue

2017-03-01

We comprehensively investigate the local distinguishability of orthogonal Dicke states under local operations and classical communication (LOCC) from both qualitative and quantitative aspects. Based on our work, defects in the LOCC-quantum secret sharing (QSS) scheme can be complemented, and the information leakage can be quantified. For (k1 ,k2 , k , n)-threshold LOCC-QSS scheme, more intuitive formulas for unambiguous probability and guessing probability were established, which can be used for determining the parameter k1 and k2 directly.

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.

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.

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.

On the Wiener Polarity Index of Lattice Networks

PubMed Central

Chen, Lin; Li, Tao; Liu, Jinfeng; Shi, Yongtang; Wang, Hua

2016-01-01

Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications. Research on this topic relies on finding a suitable measure and use this measure to quantify network robustness. A number of distance-based graph invariants, also known as topological indices, have recently been incorporated as descriptors of complex networks. Among them the Wiener type indices are the most well known and commonly used such descriptors. As one of the fundamental variants of the original Wiener index, the Wiener polarity index has been introduced for a long time and known to be related to the cluster coefficient of networks. In this paper, we consider the value of the Wiener polarity index of lattice networks, a common network structure known for its simplicity and symmetric structure. We first present a simple general formula for computing the Wiener polarity index of any graph. Using this formula, together with the symmetric and recursive topology of lattice networks, we provide explicit formulas of the Wiener polarity index of the square lattices, the hexagonal lattices, the triangular lattices, and the 33 ⋅ 42 lattices. We also comment on potential future research topics. PMID:27930705

Determination of bioactive components in Chinese herbal formulae and pharmacokinetics of rhein in rats by UPLC-MS/MS.

PubMed

Hou, Mei-Ling; Chang, Li-Wen; Lin, Chi-Hung; Lin, Lie-Chwen; Tsai, Tung-Hu

2014-04-02

Rhein (4,5-dihydroxy-9,10-dioxoanthracene-2-carboxylic acid, cassic acid) is a pharmacological active component found in Rheum palmatum L. the major herb of San-Huang-Xie-Xin-Tang (SHXXT), a medicinal herbal product used as a remedy for constipation. Here we have determined multiple bioactive components in SHXXT and investigated the comparative pharmacokinetics of rhein in rats. A sensitive and specific method combining liquid chromatography with electrospray ionization tandem mass spectrometry has been developed and validated to simultaneously quantify six active compounds in the pharmaceutical herbal product SHXXT to further study their pharmacokinetics in rats. Multiple reaction monitoring (MRM) was employed for quantification with switching electrospray ion source polarity between positive and negative modes in a single run. There were no significant matrix effects in the quantitative analysis and the mean recovery for rhein in rat plasma was 91.6%±3.4%. The pharmacokinetic data of rhein demonstrate that the herbal formulae or the single herbal extract provide significantly higher absorption rate than the pure compound. This phenomenon suggests that the other herbal ingredients of SHXXT and rhubarb extract significantly enhance the absorption of rhein in rats. In conclusion, the herbal formulae (SHXXT) are more efficient than the single herb (rhubarb) or the pure compound (rhein) in rhein absorption.

Evaluation of the Food and Agriculture Sector Criticality Assessment Tool (FASCAT) and the Collected Data.

PubMed

Huff, Andrew G; Hodges, James S; Kennedy, Shaun P; Kircher, Amy

2015-08-01

To protect and secure food resources for the United States, it is crucial to have a method to compare food systems' criticality. In 2007, the U.S. government funded development of the Food and Agriculture Sector Criticality Assessment Tool (FASCAT) to determine which food and agriculture systems were most critical to the nation. FASCAT was developed in a collaborative process involving government officials and food industry subject matter experts (SMEs). After development, data were collected using FASCAT to quantify threats, vulnerabilities, consequences, and the impacts on the United States from failure of evaluated food and agriculture systems. To examine FASCAT's utility, linear regression models were used to determine: (1) which groups of questions posed in FASCAT were better predictors of cumulative criticality scores; (2) whether the items included in FASCAT's criticality method or the smaller subset of FASCAT items included in DHS's risk analysis method predicted similar criticality scores. Akaike's information criterion was used to determine which regression models best described criticality, and a mixed linear model was used to shrink estimates of criticality for individual food and agriculture systems. The results indicated that: (1) some of the questions used in FASCAT strongly predicted food or agriculture system criticality; (2) the FASCAT criticality formula was a stronger predictor of criticality compared to the DHS risk formula; (3) the cumulative criticality formula predicted criticality more strongly than weighted criticality formula; and (4) the mixed linear regression model did not change the rank-order of food and agriculture system criticality to a large degree. © 2015 Society for Risk Analysis.

Validity of hearing impairment calculation methods for prediction of self-reported hearing handicap.

PubMed

John, Andrew B; Kreisman, Brian M; Pallett, Stephen

2012-01-01

Worker's compensation for hearing loss caused by occupational noise exposure is calculated by varying methods, from state to state within the United States (US), with many employing arithmetic formulas based on the pure-tone audiogram, to quantify hearing loss. Several assumptions unsupported or weakly supported by empirical data underlie these formulas. The present study evaluated the ability of various arithmetic hearing impairment calculations to predict a self-reported hearing handicap in a sample of presenting with sensorineural hearing loss. 204 adults (127 male, 77 female) ranging in age from 18 to 94 served as participants. The sample was selected to exclude patients who had been referred for hearing testing for a medicolegal examination or a hearing conservation appointment. A hearing handicap was measured by the Hearing Handicap Inventory for Adults/for the Elderly (HHIA/E). The covariance analysis of linear structural equations was used to assess the relative strength of correlation with the HHIA/E score among the six formulas and various forms of pure-tone average. The results revealed that all the hearing impairment calculations examined were significantly, but weakly, correlated with the self-reported hearing impairment scores. No significant differences among the predictive abilities of the impairment calculations were evident; however, the average binaural impairment assigned differed significantly among the six calculations examined. Individuals who demonstrated 0% impairment had significantly lower (i.e., better) HHIA/E scores compared to those with non-zero impairment for each formula. These results supported the idea that audiometric data provided an insufficient explanation for real-world hearing difficulties.

Residual sweeping errors in turbulent particle pair diffusion in a Lagrangian diffusion model.

PubMed

Malik, Nadeem A

2017-01-01

Thomson, D. J. & Devenish, B. J. [J. Fluid Mech. 526, 277 (2005)] and others have suggested that sweeping effects make Lagrangian properties in Kinematic Simulations (KS), Fung et al [Fung J. C. H., Hunt J. C. R., Malik N. A. & Perkins R. J. J. Fluid Mech. 236, 281 (1992)], unreliable. However, such a conclusion can only be drawn under the assumption of locality. The major aim here is to quantify the sweeping errors in KS without assuming locality. Through a novel analysis based upon analysing pairs of particle trajectories in a frame of reference moving with the large energy containing scales of motion it is shown that the normalized integrated error [Formula: see text] in the turbulent pair diffusivity (K) due to the sweeping effect decreases with increasing pair separation (σl), such that [Formula: see text] as σl/η → ∞; and [Formula: see text] as σl/η → 0. η is the Kolmogorov turbulence microscale. There is an intermediate range of separations 1 < σl/η < ∞ in which the error [Formula: see text] remains negligible. Simulations using KS shows that in the swept frame of reference, this intermediate range is large covering almost the entire inertial subrange simulated, 1 < σl/η < 105, implying that the deviation from locality observed in KS cannot be atributed to sweeping errors. This is important for pair diffusion theory and modeling. PACS numbers: 47.27.E?, 47.27.Gs, 47.27.jv, 47.27.Ak, 47.27.tb, 47.27.eb, 47.11.-j.

Surface deformation and shear flow in ligand mediated cell adhesion.

PubMed

Sircar, Sarthok; Roberts, Anthony J

2016-10-01

We present a unified, multiscale model to study the attachment/detachment dynamics of two deforming, charged, near spherical cells, coated with binding ligands and subject to a slow, homogeneous shear flow in a viscous, ionic fluid medium. The binding ligands on the surface of the cells experience both attractive and repulsive forces in an ionic medium and exhibit finite resistance to rotation via bond tilting. The microscale drag forces and couples describing the fluid flow inside the small separation gap between the cells, are calculated using a combination of methods in lubrication theory and previously published numerical results. For a selected range of material and fluid parameters, a hysteretic transition of the sticking probability curves (i.e., the function [Formula: see text]) between the adhesion phase (when [Formula: see text]) and the fragmentation phase (when [Formula: see text]) is attributed to a nonlinear relation between the total nanoscale binding forces and the separation gap between the cells. We show that adhesion is favoured in highly ionic fluids, increased deformability of the cells, elastic binders and a higher fluid shear rate (until a critical threshold value of shear rate is reached). Within a selected range of critical shear rates, the continuation of the limit points (i.e., the turning points where the slope of [Formula: see text] changes sign) predict a bistable region, indicating an abrupt switching between the adhesion and the fragmentation regimes. Although, bistability in the adhesion-fragmentation phase diagram of two deformable, charged cells immersed in an ionic aqueous environment has been identified by some in vitro experiments, but until now, has not been quantified theoretically.

Evaluation of bulk heat fluxes from atmospheric datasets

NASA Astrophysics Data System (ADS)

Farmer, Benton

Heat fluxes at the air-sea interface are an important component of the Earth's heat budget. In addition, they are an integral factor in determining the sea surface temperature (SST) evolution of the oceans. Different representations of these fluxes are used in both the atmospheric and oceanic communities for the purpose of heat budget studies and, in particular, for forcing oceanic models. It is currently difficult to quantify the potential impact varying heat flux representations have on the ocean response. In this study, a diagnostic tool is presented that allows for a straightforward comparison of surface heat flux formulations and atmospheric data sets. Two variables, relaxation time (RT) and the apparent temperature (T*), are derived from the linearization of the bulk formulas. They are then calculated to compare three bulk formulae and five atmospheric datasets. Additionally, the linearization is expanded to the second order to compare the amount of residual flux present. It is found that the use of a bulk formula employing a constant heat transfer coefficient produces longer relaxation times and contains a greater amount of residual flux in the higher order terms of the linearization. Depending on the temperature difference, the residual flux remaining in the second order and above terms can reach as much as 40--50% of the total residual on a monthly time scale. This is certainly a non-negligible residual flux. In contrast, a bulk formula using a stability and wind dependent transfer coefficient retains much of the total flux in the first order term, as only a few percent remain in the residual flux. Most of the difference displayed among the bulk formulas stems from the sensitivity to wind speed and the choice of a constant or spatially varying transfer coefficient. Comparing the representation of RT and T* provides insight into the differences among various atmospheric datasets. In particular, the representations of the western boundary current, upwelling, and the Indian monsoon regions of the oceans have distinct characteristics within each dataset. Localized regions, such as the eastern Mexican and Central American coasts, are also shown to have variability among the datasets. The use of this technique for the evaluation of bulk formulae and datasets is an efficient method for identifying the unique characteristics of each. Furthermore, insight into the heat fluxes produced by particular bulk formula or dataset can be gained.

Non-inverse-square force-distance law for long thin magnets-revisited.

PubMed

Darvell, Brian W; Gilding, Brian H

2012-05-01

It had previously been shown that the inverse-square law does not apply to the force-distance relationship in the case of a long, thin magnet with one end in close proximity to its image in a permeable plane when simple point-like poles are assumed. Treating the system instead as having a 'polar disc', arising from an assumed bundle of dipoles, led to a double integral that could only be evaluated numerically, and a relationship that still did not match observed behavior. Using an elaborate 'stretched' exponential polynomial to represent the position of an 'elastic' polar disc resulted in a fair representation of the physical response, but this was essentially merely the fitting of an arbitrary function. The present purpose was therefore to find an explicit formula for the force-distance relationship in the polar-disc problem and assess its fit to the previously obtained experimental data. Starting from Coulomb's law a corrected integral formula for the force-distance relationship was derived. The integral in this formula was evaluated explicitly using rescaling, changes of order of integration, reduction by symmetry, and change of variables. The resulting formula was then fitted to data that had been obtained for the force exerted by eighty-five rod-shaped magnets (Alnico V, 3 mm diameter, 170 mm long) perpendicular to a large steel plate, as a function of distance, at small separations (<5 mm). Subsequently, the fit of alternative functions was explored. An explicit formula in terms of elliptic integrals was obtained for the polar-disc problem. Despite the greater fidelity, this too was found not to fit the observed physical behavior. Given that failure, nevertheless a simple formula that conforms closely and parsimoniously to the actual magnet data was found. A key feature remains the marked departure from inverse-square behavior. The failure of the explicit formula to fit the data indicates an inadequate model of the physical system. Nonetheless it constitutes a useful tool for quantifying the force-distance relationship on the premise of polar discs. Given these insights, it may now be possible to address the original motivating problem of the behavior of real dental magnets. Copyright © 2012 Academy of Dental Materials. Published by Elsevier Ltd. All rights reserved.

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)

A Modified Formula of the First-order Approximation for Assessing the Contribution of Climate Change to Runoff Based on the Budyko Hypothesis

NASA Astrophysics Data System (ADS)

Liu, W.; Ning, T.; Han, X.

2015-12-01

The climate elasticity based on the Budyko curves has been widely used to evaluate the hydrological responses to climate change. The Mezentsev-Choudhury-Yang formula is one of the representative analytical equations for Budyko curves. Previous researches mostly used the variation of runoff (R) caused by the changes of annual precipitation (P) and potential evapotranspiration (ET0) as the hydrological response to climate change and evaluated it by a first-order approximation in a form of total differential, the major components of which include the partial derivatives of R to P and ET0, as well as climate elasticity on this basis. Based on analytic derivation and the characteristics of Budyko curves, this study proposed a modified formula of the first-order approximation to reduce the errors from the approximation. In the calculation of partial derivatives and climate elasticity, the values of P and ET0 were taken to the sum of their base values and half increments, respectively. The calculation was applied in 33 catchments of the Hai River basin in China and the results showed that the mean absolute value of relative error of approximated runoff change decreased from 8.4% to 0.4% and the maximum value, from 23.4% to 1.3%. Given the variation values of P, ET0 and the controlling parameter (n), the modified formula can exactly quantify the contributions of climate fluctuation and underlying surface change to runoff. Taking the Murray-Darling basin in Australia as an example of the contribution calculated by the modified formula, the reductions of mean annual runoff caused by changes of P, ET0 and n from 1895-1996 to 1997-2006 were 2.6, 0.6 and 2.9 mm, respectively, and the sum of them was 6.1 mm, which was completely consistent with the observed runoff. The modified formula of the first-order approximation proposed in this study can be not only used to assess the contributions of climate change to the runoff, but also widely used to analyze the effects of similar issues based on a certain functional relationship in hydrological and climate changes.

Kinetics of nitrous oxide (N2O) formation and reduction by Paracoccus pantotrophus.

PubMed

Read-Daily, B L; Sabba, F; Pavissich, J P; Nerenberg, R

2016-12-01

Nitrous oxide (N 2 O) is a powerful greenhouse gas emitted from wastewater treatment, as well as natural systems, as a result of biological nitrification and denitrification. While denitrifying bacteria can be a significant source of N 2 O, they can also reduce N 2 O to N 2 . More information on the kinetics of N 2 O formation and reduction by denitrifying bacteria is needed to predict and quantify their impact on N 2 O emissions. In this study, kinetic parameters were determined for Paracoccus pantotrophus, a common denitrifying bacterium. Parameters included the maximum specific reduction rates, [Formula: see text], growth rates, [Formula: see text], and yields, Y, for reduction of NO 3 - (nitrate) to nitrite (NO 2 - ), NO 2 - to N 2 O, and N 2 O to N 2 , with acetate as the electron donor. The [Formula: see text] values were 2.9 gN gCOD -1 d -1 for NO 3 - to NO 2 - , 1.4 gN gCOD -1  d -1 for NO 2 - to N 2 O, and 5.3 gN gCOD -1  d -1 for N 2 O to N 2 . The [Formula: see text] values were 2.7, 0.93, and 1.5 d -1 , respectively. When N 2 O and NO 3 - were added concurrently, the apparent (extant) kinetics, [Formula: see text], assuming reduction to N 2 , were 6.3 gCOD gCOD -1  d -1 , compared to 5.4 gCOD gCOD -1  d -1 for NO 3 - as the sole added acceptor. The [Formula: see text] was 1.6 d -1 , compared to 2.5 d -1 for NO 3 - alone. These results suggest that NO 3 - and N 2 O were reduced concurrently. Based on this research, denitrifying bacteria like P. pantotrophus may serve as a significant sink for N 2 O. With careful design and operation, treatment plants can use denitrifying bacteria to minimize N 2 O emissions.

Method development and validation for total haloxyfop analysis in infant formulas and related ingredient matrices using liquid chromatography-tandem mass spectrometry.

PubMed

Koesukwiwat, Urairat; Vaclavik, Lukas; Mastovska, Katerina

2018-05-08

According to the European Commission directive 2006/141/EC, haloxyfop residue levels should not exceed 0.003 mg/kg in ready-to-feed infant formula, and the residue definition includes sum of haloxyfop, its esters, salts, and conjugates expressed as haloxyfop. A simple method for total haloxyfop analysis in infant formula and related ingredient matrices was developed and validated using liquid chromatography-tandem mass spectrometry (LC-MS/MS). The sample preparation consisted of an alkaline hydrolysis with methanolic sodium hydroxide to release haloxyfop (parent acid) from its bound forms prior to the extraction with acetonitrile. A mixture of magnesium sulfate (MgSO 4 ) and sodium chloride (NaCl) (4:1, w/w) was added to the extract to induce phase separation and force the analyte into the upper acetonitrile-methanol layer and then a 1-mL aliquot was subsequently cleaned up by dispersive solid phase extraction with 150 mg of MgSO 4 and 50 mg of octadecyl (C 18 ) sorbent. The analytical procedure was developed and carefully optimized to enable low-level, total haloxyfop analysis in a variety of challenging matrices, including infant formulas and their important high-carbohydrate, high-protein, high-fat, and emulsifier ingredients. The final method was validated in two different laboratories by fortifying samples with haloxyfop and haloxyfop-methyl, which was used as a model compound simulating bound forms of the analyte. Mean recoveries of haloxyfop across all fortification levels and evaluated matrices ranged between 92.2 and 114% with repeatability, within-lab reproducibility, and reproducibility RSDs ≤ 14%. Based on the validation results, this method was capable to convert the haloxyfop ester into the parent acid in a wide range of sample types and to reliably identify and quantify total haloxyfop at the target 0.003 mg/kg level in infant formulas (both powdered and ready-to-feed liquid forms). Graphical abstract LC-MS/MS-based workflow for the determination of the total haloxyfop in infant formula and related ingredients.

A Novel Method for Profiling and Quantifying Short- and Medium-Chain Chlorinated Paraffins in Environmental Samples Using Comprehensive Two-Dimensional Gas Chromatography-Electron Capture Negative Ionization High-Resolution Time-of-Flight Mass Spectrometry.

PubMed

Xia, Dan; Gao, Lirong; Zheng, Minghui; Tian, Qichang; Huang, Huiting; Qiao, Lin

2016-07-19

Chlorinated paraffins (CPs) are complex technical mixtures containing thousands of isomers. Analyzing CPs in environmental matrices is extremely challenging. CPs have broad, unresolved profiles when analyzed by one-dimensional gas chromatography (GC). Comprehensive two-dimensional GC (GC×GC) can separate CPs with a high degree of orthogonality. A novel method for simultaneously profiling and quantifying short- and medium-chain CPs, using GC×GC coupled with electron capture negative ionization high-resolution time-of-flight mass spectrometry, was developed. The method allowed 48 CP formula congener groups to be analyzed highly selectively in one injection through accurate mass measurements of the [M - Cl](-) ions in full scan mode. The correlation coefficients (R(2)) for the linear calibration curves for different chlorine contents were 0.982 for short-chain CPs and 0.945 for medium-chain CPs. The method was successfully used to determine CPs in sediment and fish samples. By using this method, with enhanced chromatographic separation and high mass resolution, interferences between CP congeners and other organohalogen compounds, such as toxaphene, are minimized. New compounds, with the formulas C9H14Cl6 and C9H13Cl7, were found in sediment and biological samples for the first time. The method was shown to be a powerful tool for the analysis of CPs in environmental samples.

The relationship between the thermoelectric generator efficiency and the device engineering figure of merit Zd,eng. The maximum efficiency 𝜼max

NASA Astrophysics Data System (ADS)

Hapenciuc, C. L.; Borca-Tasciuc, T.; Mihailescu, I. N.

2017-04-01

Thermoelectric materials are used today in thermoelectric devices for heat to electricity(thermoelectric generators-TEG) or electricity to heat(heat pumps) conversion in a large range of applications. In the case of TEGs the final measure of their performance is given by a quantity named the maximum efficiency which shows how much from the heat input is converted into electrical power. Therefore it is of great interest to know correctly how much is the efficiency of a device to can make commercial assessments. The concept of engineering figure of merit, Zeng, and engineering power factor, Peng, were already introduced in the field to quantify the efficiency of a single material under temperature dependent thermoelectric properties, with the mention that the formulas derivation was limited to one leg of the thermoelectric generator. In this paper we propose to extend the concept of engineering figure of merit to a thermoelectric generator by introducing a more general concept of device engineering thermoelectric figure of merit, Zd,eng, which depends on the both TEG materials properties and which shall be the right quantity to be used when we are interested in the evaluation of the efficiency. Also, this work takes into account the electrical contact resistance between the electrodes and thermoelement legs in an attempt to quantify its influence upon the performance of a TEG. Finally, a new formula is proposed for the maximum efficiency of a TEG.

Atmospheric fossil fuel CO2 traced by 14CO2 and air quality index pollutant observations in Beijing and Xiamen, China.

PubMed

Niu, Zhenchuan; Zhou, Weijian; Feng, Xue; Feng, Tian; Wu, Shugang; Cheng, Peng; Lu, Xuefeng; Du, Hua; Xiong, Xiaohu; Fu, Yunchong

2018-06-01

Radiocarbon ( 14 C) is the most accurate tracer available for quantifying atmospheric CO 2 derived from fossil fuel (CO 2ff ), but it is expensive and time-consuming to measure. Here, we used common hourly Air Quality Index (AQI) pollutants (AQI, PM 2.5 , PM 10 , and CO) to indirectly trace diurnal CO 2ff variations during certain days at the urban sites in Beijing and Xiamen, China, based on linear relationships between AQI pollutants and CO 2ff traced by 14 C ([Formula: see text]) for semimonthly samples obtained in 2014. We validated these indirectly traced CO 2ff (CO 2ff-in ) concentrations against [Formula: see text] concentrations traced by simultaneous diurnal 14 CO 2 observations. Significant (p < 0.05) strong correlations were observed between each of the separate AQI pollutants and [Formula: see text] for the semimonthly samples. Diurnal variations in CO 2ff traced by each of the AQI pollutants generally showed similar trends to those of [Formula: see text], with high agreement at the sampling site in Beijing and relatively poor agreement at the sampling site in Xiamen. AQI pollutant tracers showed high normalized root-mean-square (NRMS) errors for the summer diurnal samples due to low [Formula: see text] concentrations. After the removal of these summer samples, the NRMS errors for AQI pollutant tracers were in the range of 31.6-64.2%. CO generally showed a high agreement and low NRMS errors among these indirect tracers. Based on these linear relationships, monthly CO 2ff averages at the sampling sites in Beijing and Xiamen were traced using CO concentration as a tracer. The monthly CO 2ff averages at the Beijing site showed a shallow U-type variation. These results indicate that CO can be used to trace CO 2ff variations in Chinese cities with CO 2ff concentrations above 5 ppm.

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.

Postnatal weight loss in substitute methadone-exposed infants: implications for the management of breast feeding.

PubMed

Dryden, Carol; Young, David; Campbell, Nicole; Mactier, Helen

2012-05-01

It is widely accepted that maternal drug-exposed infants demonstrate excessive early weight loss, but this has not previously been quantified. Among 354 term, substitute methadone-exposed infants, median maximal weight losses were 10.2% and 8.5% for breast- and formula-fed infants, respectively (p=0.003). Weight loss was less in small for gestational age compared to appropriately grown infants (p<0.001). There was no association between maximal weight loss and plasma sodium concentration (p=0.807). Relative to non-drug exposed infants, weight loss was more marked in formula-fed infants, 48% of whom demonstrated weight loss in excess of the 95th centile (compared to 23% of exclusively breastfed infants; p<0.001). Median weight loss nadir was on day 5, excepting those infants exclusively breastfed (day 4). These data suggest that excessive neonatal weight loss among breastfed infants of drug-misusing mothers does not necessarily reflect poorly established lactation and may help to guide management of breast feeding in this population.

Chemical interaction between Lilium brownii and Rhizoma Anemarrhenae, the herbal constituents of Baihe Zhimu decoction, by liquid chromatography coupled to hybrid triple quadrupole linear ion trap mass spectrometer.

PubMed

Yang, Bo; Liu, Zhirui; Wang, Qian; Xia, Peiyuan

2018-03-01

During the course of decoction, the components of herbal formula interact with each other, such that chemical extraction characteristics are altered. The crude drugs, Lilium brownii (Baihe) and Rhizoma Anemarrhenae (Zhimu), are the herbal constituents of Baihe Zhimu decoction, a traditional herbal formula. To investigate the chemical interaction between Baihe and Zhimu when decocting together, eight marker components in Baihe Zhimu decoction were simultaneously characterized and quantified in one run by a hybrid triple quadrupole linear ion trap mass spectrometer in the multiple reactions monitoring-information dependent acquisition-enhanced product ion mode. The results showed that Zhimu significantly suppressed the extraction of phenolic glycosides (the components from Baihe) when co-decocting, and Baihe clearly suppressed the extraction of xanthones and steroidal saponins (the components from Zhimu). Overall, the presently developed method would be a preferred candidate for the investigation of the chemical interaction between herbal medicines. Copyright © 2017 John Wiley & Sons, Ltd.

Rapid determination of vitamin D₃ in milk-based infant formulas by liquid chromatography-tandem mass spectrometry.

PubMed

Kwak, Byung-Man; Jeong, In-Seek; Lee, Moon-Seok; Ahn, Jang-Hyuk; Park, Jong-Su

2014-12-15

A rapid and simple sample preparation method for vitamin D3 (cholecalciferol) was developed for emulsified dairy products such as milk-based infant formulas. A sample was mixed in a 50 mL centrifuge tube with the same amount of water and isopropyl alcohol to achieve chemical extraction. Ammonium sulfate was used to induce phase separation. No-heating saponification was performed in the sample tube by adding KOH, NaCl, and NH3. Vitamin D3 was then separated and quantified using liquid chromatography-tandem mass spectrometry. The results for added recovery tests were in the range 93.11-110.65%, with relative standard deviations between 2.66% and 2.93%. The results, compared to those obtained using a certified reference material (SRM 1849a), were within the range of the certificated values. This method could be implemented in many laboratories that require time and labour saving. Copyright © 2014 Elsevier Ltd. All rights reserved.

Uncertainty Analysis for the Evaluation of a Passive Runway Arresting System

NASA Technical Reports Server (NTRS)

Deloach, Richard; Marlowe, Jill M.; Yager, Thomas J.

2009-01-01

This paper considers the stopping distance of an aircraft involved in a runway overrun incident when the runway has been provided with an extension comprised of a material engineered to induce high levels of rolling friction and drag. A formula for stopping distance is derived that is shown to be the product of a known formula for the case of friction without drag, and a dimensionless constant between 0 and 1 that quantifies the further reduction in stopping distance when drag is introduced. This additional quantity, identified as the Drag Reduction Factor, D, is shown to depend on the ratio of drag force to friction force experienced by the aircraft as it enters the overrun area. The specific functional form of D is shown to depend on how drag varies with speed. A detailed uncertainty analysis is presented which reveals how the uncertainty in estimates of stopping distance are influenced by experimental error in the force measurements that are acquired in a typical evaluation experiment conducted to assess candidate overrun materials.

Quantifying the origins of life on a planetary scale

PubMed Central

Scharf, Caleb; Cronin, Leroy

2016-01-01

A simple, heuristic formula with parallels to the Drake Equation is introduced to help focus discussion on open questions for the origins of life in a planetary context. This approach indicates a number of areas where quantitative progress can be made on parameter estimation for determining origins of life probabilities, based on constraints from Bayesian approaches. We discuss a variety of “microscale” factors and their role in determining “macroscale” abiogenesis probabilities on suitable planets. We also propose that impact ejecta exchange between planets with parallel chemistries and chemical evolution could in principle amplify the development of molecular complexity and abiogenesis probabilities. This amplification could be very significant, and both bias our conclusions about abiogenesis probabilities based on the Earth and provide a major source of variance in the probability of life arising in planetary systems. We use our heuristic formula to suggest a number of observational routes for improving constraints on origins of life probabilities. PMID:27382156

Model for disease dynamics of a waterborne pathogen on a random network.

PubMed

Li, Meili; Ma, Junling; van den Driessche, P

2015-10-01

A network epidemic SIWR model for cholera and other diseases that can be transmitted via the environment is developed and analyzed. The person-to-person contacts are modeled by a random contact network, and the contagious environment is modeled by an external node that connects to every individual. The model is adapted from the Miller network SIR model, and in the homogeneous mixing limit becomes the Tien and Earn deterministic cholera model without births and deaths. The dynamics of our model shows excellent agreement with stochastic simulations. The basic reproduction number [Formula: see text] is computed, and on a Poisson network shown to be the sum of the basic reproduction numbers of the person-to-person and person-to-water-to-person transmission pathways. However, on other networks, [Formula: see text] depends nonlinearly on the transmission along the two pathways. Type reproduction numbers are computed and quantify measures to control the disease. Equations giving the final epidemic size are obtained.

Small-Maturity Asymptotics for the At-The-Money Implied Volatility Slope in Lévy Models

PubMed Central

Gerhold, Stefan; Gülüm, I. Cetin; Pinter, Arpad

2016-01-01

ABSTRACT We consider the at-the-money (ATM) strike derivative of implied volatility as the maturity tends to zero. Our main results quantify the behaviour of the slope for infinite activity exponential Lévy models including a Brownian component. As auxiliary results, we obtain asymptotic expansions of short maturity ATM digital call options, using Mellin transform asymptotics. Finally, we discuss when the ATM slope is consistent with the steepness of the smile wings, as given by Lee’s moment formula. PMID:27660537

The mean and variance of phylogenetic diversity under rarefaction

PubMed Central

Matsen, Frederick A.

2013-01-01

Summary Phylogenetic diversity (PD) depends on sampling depth, which complicates the comparison of PD between samples of different depth. One approach to dealing with differing sample depth for a given diversity statistic is to rarefy, which means to take a random subset of a given size of the original sample. Exact analytical formulae for the mean and variance of species richness under rarefaction have existed for some time but no such solution exists for PD.We have derived exact formulae for the mean and variance of PD under rarefaction. We confirm that these formulae are correct by comparing exact solution mean and variance to that calculated by repeated random (Monte Carlo) subsampling of a dataset of stem counts of woody shrubs of Toohey Forest, Queensland, Australia. We also demonstrate the application of the method using two examples: identifying hotspots of mammalian diversity in Australasian ecoregions, and characterising the human vaginal microbiome.There is a very high degree of correspondence between the analytical and random subsampling methods for calculating mean and variance of PD under rarefaction, although the Monte Carlo method requires a large number of random draws to converge on the exact solution for the variance.Rarefaction of mammalian PD of ecoregions in Australasia to a common standard of 25 species reveals very different rank orderings of ecoregions, indicating quite different hotspots of diversity than those obtained for unrarefied PD. The application of these methods to the vaginal microbiome shows that a classical score used to quantify bacterial vaginosis is correlated with the shape of the rarefaction curve.The analytical formulae for the mean and variance of PD under rarefaction are both exact and more efficient than repeated subsampling. Rarefaction of PD allows for many applications where comparisons of samples of different depth is required. PMID:23833701

The mean and variance of phylogenetic diversity under rarefaction.

PubMed

Nipperess, David A; Matsen, Frederick A

2013-06-01

Phylogenetic diversity (PD) depends on sampling depth, which complicates the comparison of PD between samples of different depth. One approach to dealing with differing sample depth for a given diversity statistic is to rarefy, which means to take a random subset of a given size of the original sample. Exact analytical formulae for the mean and variance of species richness under rarefaction have existed for some time but no such solution exists for PD.We have derived exact formulae for the mean and variance of PD under rarefaction. We confirm that these formulae are correct by comparing exact solution mean and variance to that calculated by repeated random (Monte Carlo) subsampling of a dataset of stem counts of woody shrubs of Toohey Forest, Queensland, Australia. We also demonstrate the application of the method using two examples: identifying hotspots of mammalian diversity in Australasian ecoregions, and characterising the human vaginal microbiome.There is a very high degree of correspondence between the analytical and random subsampling methods for calculating mean and variance of PD under rarefaction, although the Monte Carlo method requires a large number of random draws to converge on the exact solution for the variance.Rarefaction of mammalian PD of ecoregions in Australasia to a common standard of 25 species reveals very different rank orderings of ecoregions, indicating quite different hotspots of diversity than those obtained for unrarefied PD. The application of these methods to the vaginal microbiome shows that a classical score used to quantify bacterial vaginosis is correlated with the shape of the rarefaction curve.The analytical formulae for the mean and variance of PD under rarefaction are both exact and more efficient than repeated subsampling. Rarefaction of PD allows for many applications where comparisons of samples of different depth is required.

Embryonic hypoxia programmes postprandial cardiovascular function in adult common snapping turtles (Chelydra serpentina).

PubMed

Wearing, Oliver H; Conner, Justin; Nelson, Derek; Crossley, Janna; Crossley, Dane A

2017-07-15

Reduced oxygen availability (hypoxia) is a potent stressor during embryonic development, altering the trajectory of trait maturation and organismal phenotype. We previously documented that chronic embryonic hypoxia has a lasting impact on the metabolic response to feeding in juvenile snapping turtles ( Chelydra serpentina ). Turtles exposed to hypoxia as embryos [10% O 2 (H10)] exhibited an earlier and increased peak postprandial oxygen consumption rate, compared with control turtles [21% O 2 (N21)]. In the current study, we measured central blood flow patterns to determine whether the elevated postprandial metabolic response in H10 turtles is linked to lasting impacts on convective transport. Five years after hatching, turtles were instrumented to quantify systemic ([Formula: see text]) and pulmonary ([Formula: see text]) blood flows and heart rate ( f H ) before and after a ∼5% body mass meal. In adult N21 and H10 turtles, f H was increased significantly by feeding. Although total stroke volume ( V S,tot ) remained at fasted values, this tachycardia contributed to an elevation in total cardiac output ([Formula: see text]). However, there was a postprandial reduction in a net left-right (L-R) shunt in N21 snapping turtles only. Relative to N21 turtles, H10 animals exhibited higher [Formula: see text] due to increased blood flow through the right systemic outflow vessels of the heart. This effect of hypoxic embryonic development, reducing a net L-R cardiac shunt, may support the increased postprandial metabolic rate we previously reported in H10 turtles, and is further demonstration of adult reptile cardiovascular physiology being programmed by embryonic hypoxia. © 2017. Published by The Company of Biologists Ltd.

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

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

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.

Evaluating efficiency and statistical power of self-controlled case series and self-controlled risk interval designs in vaccine safety.

PubMed

Li, Rongxia; Stewart, Brock; Weintraub, Eric

2016-01-01

The self-controlled case series (SCCS) and self-controlled risk interval (SCRI) designs have recently become widely used in the field of post-licensure vaccine safety monitoring to detect potential elevated risks of adverse events following vaccinations. The SCRI design can be viewed as a subset of the SCCS method in that a reduced comparison time window is used for the analysis. Compared to the SCCS method, the SCRI design has less statistical power due to fewer events occurring in the shorter control interval. In this study, we derived the asymptotic relative efficiency (ARE) between these two methods to quantify this loss in power in the SCRI design. The equation is formulated as [Formula: see text] (a: control window-length ratio between SCRI and SCCS designs; b: ratio of risk window length and control window length in the SCCS design; and [Formula: see text]: relative risk of exposed window to control window). According to this equation, the relative efficiency declines as the ratio of control-period length between SCRI and SCCS methods decreases, or with an increase in the relative risk [Formula: see text]. We provide an example utilizing data from the Vaccine Safety Datalink (VSD) to study the potential elevated risk of febrile seizure following seasonal influenza vaccine in the 2010-2011 season.

Competitive and double antibody sandwich ELISA for the quantification of lactoferrins by using monoclonal and chicken egg yolk IgY antibodies.

PubMed

Sunwoo, Hoon; Gujral, Naiyana; Suresh, Mavanur

2011-01-01

Two effective competitive and double antibody sandwich ELISA based on monoclonal (MAb) and chicken egg yolk IgY antibodies were developed to determine lactoferrin (LF) content in infant and milk formulas. Leghorn laying hens were immunized with purified bovine and human LFs to produce anti-bovine LF and anti-human LF IgY antibody in the egg yolk. After 5-8 weeks of the immunization, anti-LF IgY was extracted and analyzed by ELISA. Specific IgY antibodies against LFs cross reacted with human and bovine LFs, examined by ELISA and western-blot assay. Such cross-reactivity suggested the presence of common antigenic determinants between human and bovine LFs. An indirect competitive ELISA was preferred to quantify LF in milk and infant formulas, since the range of detection is 3.125-50 μg/mL, which is broader compared to the biotinylated ELISA system (5-50 ng/mL). As per the indirect competitive ELISA system, IgY at a concentration of the 150 μg/mL was incubated with various concentrations of bovine LF ranged from 0.003-100 μg/mL. The immunoassay was used to estimate the total bovine LF content in the milk samples and infant formulas, ranging from 49.28-80.96 μg/mL and 29.92-60.00 μg/mL, respectively.

Applying Required Navigation Performance Concept for Traffic Management of Small Unmanned Aircraft Systems

NASA Technical Reports Server (NTRS)

Jung, Jaewoo; D'Souza, Sarah N.; Johnson, Marcus A.; Ishihara, Abraham K.; Modi, Hemil C.; Nikaido, Ben; Hasseeb, Hashmatullah

2016-01-01

In anticipation of a rapid increase in the number of civil Unmanned Aircraft System(UAS) operations, NASA is researching prototype technologies for a UAS Traffic Management (UTM) system that will investigate airspace integration requirements for enabling safe, efficient low-altitude operations. One aspect a UTM system must consider is the correlation between UAS operations (such as vehicles, operation areas and durations), UAS performance requirements, and the risk to people and property in the operational area. This paper investigates the potential application of the International Civil Aviation Organizations (ICAO) Required Navigation Performance (RNP) concept to relate operational risk with trajectory conformance requirements. The approach is to first define a method to quantify operational risk and then define the RNP level requirement as a function of the operational risk. Greater operational risk corresponds to more accurate RNP level, or smaller tolerable Total System Error (TSE). Data from 19 small UAS flights are used to develop and validate a formula that defines this relationship. An approach to assessing UAS-RNP conformance capability using vehicle modeling and wind field simulation is developed to investigate how this formula may be applied in a future UTM system. The results indicate the modeled vehicles flight path is robust to the simulated wind variation, and it can meet RNP level requirements calculated by the formula. The results also indicate how vehicle-modeling fidelity may be improved to adequately verify assessed RNP level.

Sensing sheet: the response of full-bridge strain sensors to thermal variations for detecting and characterizing cracks

NASA Astrophysics Data System (ADS)

Tung, S.-T.; Glisic, B.

2016-12-01

Sensing sheets based on large-area electronics consist of a dense array of unit strain sensors. This new technology has potential for becoming an effective and affordable monitoring tool that can identify, localize and quantify surface damage in structures. This research contributes to their development by investigating the response of full-bridge unit strain sensors to thermal variations. Overall, this investigation quantifies the effects of temperature on thin-film full-bridge strain sensors monitoring uncracked and cracked concrete. Additionally, an empirical formula is developed to estimate crack width given an observed strain change and a measured temperature change. This research led to the understanding of the behavior of full-bridge strain sensors installed on cracked concrete and exposed to temperature variations. It proves the concept of the sensing sheet and its suitability for application in environments with variable temperature.

Complex dark-field contrast and its retrieval in x-ray phase contrast imaging implemented with Talbot interferometry.

PubMed

Yang, Yi; Tang, Xiangyang

2014-10-01

Under the existing theoretical framework of x-ray phase contrast imaging methods implemented with Talbot interferometry, the dark-field contrast refers to the reduction in interference fringe visibility due to small-angle x-ray scattering of the subpixel microstructures of an object to be imaged. This study investigates how an object's subpixel microstructures can also affect the phase of the intensity oscillations. Instead of assuming that the object's subpixel microstructures distribute in space randomly, the authors' theoretical derivation starts by assuming that an object's attenuation projection and phase shift vary at a characteristic size that is not smaller than the period of analyzer grating G₂ and a characteristic length dc. Based on the paraxial Fresnel-Kirchhoff theory, the analytic formulae to characterize the zeroth- and first-order Fourier coefficients of the x-ray irradiance recorded at each detector cell are derived. Then the concept of complex dark-field contrast is introduced to quantify the influence of the object's microstructures on both the interference fringe visibility and the phase of intensity oscillations. A method based on the phase-attenuation duality that holds for soft tissues and high x-ray energies is proposed to retrieve the imaginary part of the complex dark-field contrast for imaging. Through computer simulation study with a specially designed numerical phantom, they evaluate and validate the derived analytic formulae and the proposed retrieval method. Both theoretical analysis and computer simulation study show that the effect of an object's subpixel microstructures on x-ray phase contrast imaging method implemented with Talbot interferometry can be fully characterized by a complex dark-field contrast. The imaginary part of complex dark-field contrast quantifies the influence of the object's subpixel microstructures on the phase of intensity oscillations. Furthermore, at relatively high energies, for soft tissues it can be retrieved for imaging with a method based on the phase-attenuation duality. The analytic formulae derived in this work to characterize the complex dark-field contrast in x-ray phase contrast imaging method implemented with Talbot interferometry are of significance, which may initiate more activities in the research and development of x-ray differential phase contrast imaging for extensive biomedical applications.

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.

Calculating Confidence, Uncertainty, and Numbers of Samples When Using Statistical Sampling Approaches to Characterize and Clear Contaminated Areas

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

Piepel, Gregory F.; Matzke, Brett D.; Sego, Landon H.

2013-04-27

This report discusses the methodology, formulas, and inputs needed to make characterization and clearance decisions for Bacillus anthracis-contaminated and uncontaminated (or decontaminated) areas using a statistical sampling approach. Specifically, the report includes the methods and formulas for calculating the • number of samples required to achieve a specified confidence in characterization and clearance decisions • confidence in making characterization and clearance decisions for a specified number of samples for two common statistically based environmental sampling approaches. In particular, the report addresses an issue raised by the Government Accountability Office by providing methods and formulas to calculate the confidence that amore » decision area is uncontaminated (or successfully decontaminated) if all samples collected according to a statistical sampling approach have negative results. Key to addressing this topic is the probability that an individual sample result is a false negative, which is commonly referred to as the false negative rate (FNR). The two statistical sampling approaches currently discussed in this report are 1) hotspot sampling to detect small isolated contaminated locations during the characterization phase, and 2) combined judgment and random (CJR) sampling during the clearance phase. Typically if contamination is widely distributed in a decision area, it will be detectable via judgment sampling during the characterization phrase. Hotspot sampling is appropriate for characterization situations where contamination is not widely distributed and may not be detected by judgment sampling. CJR sampling is appropriate during the clearance phase when it is desired to augment judgment samples with statistical (random) samples. The hotspot and CJR statistical sampling approaches are discussed in the report for four situations: 1. qualitative data (detect and non-detect) when the FNR = 0 or when using statistical sampling methods that account for FNR > 0 2. qualitative data when the FNR > 0 but statistical sampling methods are used that assume the FNR = 0 3. quantitative data (e.g., contaminant concentrations expressed as CFU/cm2) when the FNR = 0 or when using statistical sampling methods that account for FNR > 0 4. quantitative data when the FNR > 0 but statistical sampling methods are used that assume the FNR = 0. For Situation 2, the hotspot sampling approach provides for stating with Z% confidence that a hotspot of specified shape and size with detectable contamination will be found. Also for Situation 2, the CJR approach provides for stating with X% confidence that at least Y% of the decision area does not contain detectable contamination. Forms of these statements for the other three situations are discussed in Section 2.2. Statistical methods that account for FNR > 0 currently only exist for the hotspot sampling approach with qualitative data (or quantitative data converted to qualitative data). This report documents the current status of methods and formulas for the hotspot and CJR sampling approaches. Limitations of these methods are identified. Extensions of the methods that are applicable when FNR = 0 to account for FNR > 0, or to address other limitations, will be documented in future revisions of this report if future funding supports the development of such extensions. For quantitative data, this report also presents statistical methods and formulas for 1. quantifying the uncertainty in measured sample results 2. estimating the true surface concentration corresponding to a surface sample 3. quantifying the uncertainty of the estimate of the true surface concentration. All of the methods and formulas discussed in the report were applied to example situations to illustrate application of the methods and interpretation of the results.« less

Power Balance Modeling and Validation for ST Startup Using Local Helicity Injection

NASA Astrophysics Data System (ADS)

Barr, J. L.; Bodner, G. M.; Bongard, M. W.; Burke, M. G.; Fonck, R. J.; Hinson, E. T.; Perry, J. M.; Reusch, J. A.; Schlossberg, D. J.

2015-11-01

Local Helicity Injection (LHI) uses localized current injectors for routine Ip<0.18 MA non-solenoidal startup on the Pegasus ST. A power-balance model is under development for predictive Ip t using helicity-balance to quantify LHI's effective current drive, Veff. Analytic formulas for low-A plasma inductance and vertical field are used to account for the inductive effects of dynamic shape evolution. These formulas are being validated against magnetic reconstructions of LHI discharges with varied shape evolutions. Initial results match experimental Ip t within 20 kA with assumed shaping and average resistivity (Spitzer, Te = 60 eV). Geometric effects and inductive drive provide 2.0 V along with Veff = 0.3 V to balance 1.1 V of resistive losses and 1.2 V inductive reactance to ramping Ip. The model is especially sensitive to resistivity when Te<150 eV. Initial Thomson Scattering results give core Te = 72 +/-22 eV, and at times suggest higher central electron energies. Spatial and temporal scans are underway to quantify LHI plasma resistivity and transport. MA-class startup in NSTX-U will require increased area (Ainj >= 40 cm2) LHI systems that play a larger role in current drive than geometric effects, with Veff dropping from >10 V to on-par with inductive effects. This regime is accessed in Pegasus at Ip ≅ 300 kA. Work supported by US DOE grants DE-FG02-96ER54375 and DE-SC0006928.

Exploring and Monitoring of Methane Hydrate Deposits

NASA Astrophysics Data System (ADS)

Sudac, D.; Obhođaš, J.; Nađ, K.; Valković, V.

2018-01-01

Relatively recently, in the last 20 years, it was discovered that methane hydrate (MH) deposits are globally distributed in the permafrost and oceans. Before 1965 when first deposits were discovered in nature, it was believed that MH can occur only in laboratory conditions or in vast parts of the Universe. Presently it is presumed that this solid crystalline compounds in which CH4 molecules occupies the water ice lattices (nominal chemical formula of MH is C4H62O23) can serve as an energy source favorably to the all of the world remaining conventional hydrocarbon sources. The worldwide estimates of MH deposits range from 2x1014 m3 to 3.053x1018 cubic meters. This uncertainty partly results from our limitations in geological understanding of the MH deposits, which is due to the relatively bad quality of data obtained by presently available seismic and electromagnetic techniques. Moreover, MH deposits can become vulnerable to climate changes, which were already occurring in geological past whit tremendous consequences for the global life on Earth. Thus, further development of advanced techniques is needed to enhance our abilities to better characterize, quantify and monitor the MH deposits. In the work presented 14 MeV neutrons and associated alpha particle imaging (API) where used to quantify the amount of MH in the sample. Samples were prepared from sea sediment, quartz sand and MH simulant. MH simulant with chemical formula C4H46O23 was made from sucrose (25 % by mass) and water. MH quantity was measured by measuring the carbon content in the sample [1-8].

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…

Infant exposure of perfluorinated compounds: levels in breast milk and commercial baby food.

PubMed

Llorca, Marta; Farré, Marinella; Picó, Yolanda; Teijón, Marisa Lopez; Alvarez, Juan G; Barceló, Damià

2010-08-01

In this study, an analytical method to determine six perfluorinated compounds (PFCs) based on alkaline digestion and solid phase extraction (SPE) followed by liquid chromatography-quadrupole-linear ion trap mass spectrometry (LC-QqLIT-MS) was validated for the analysis of human breast milk, milk infant formulas and cereals baby food. The average recoveries of the different matrices were in general higher than 70% with a relative standard deviation (RSD) lower than 21% and method limits of detection (MLOD) ranging from 1.2 to 362 ng/L for the different compounds and matrices. The method was applied to investigate the occurrence of PFCs in 20 samples of human breast milk, and 5 samples of infant formulas and cereal baby food (3 brands of commercial milk infant formulas and 2 brands of cereals baby food). Breast milk samples were collected in 2008 from donors living in Barcelona city (Spain) on the 40 days postpartum. Perfluorooctanesulfonate (PFOS) and perfluoro-7-methyloctanoic acid (i,p-PFNA) were predominant being present in the 95% of breast milk samples. Perfluorooctanoic acid (PFOA) was quantified in 8 of the 20 breast milk samples at concentrations in the range of 21-907 ng/L. Commercial formulas and food were purchased also in 2009 from a retail store. The six PFCs were detected in all brands of milk infant formulas and cereals baby food analyzed, being perfluorodecanoic acid (PFDA), PFOS, PFOA and i,p-PFNA the compounds detected in higher concentrations (up to 1289 ng/kg). PFCs presence can be associated to possible migration from packaging and containers during production processes. Finally, based on estimated body weight and newborn intake, PFOS and PFOA daily intakes and risk indexes (RI) were estimated for the firsts 6 month of life. We found that ingestion rates of PFOS and PFOA, with exception of one breast milk sample did not exceed the tolerable daily intake (TDI) recommended by the EFSA. However, more research is needed in order to assess possible risk associated to PFCs contamination during early stages of life. Copyright 2010 Elsevier Ltd. All rights reserved.

From Indexed Lax Logic to Intuitionistic Logic

DTIC Science & Technology

2008-01-07

translations extend a complete but unsound translation from lax logic to propositional logic proposed by Mendler et al [FM97], which maps ©A to ( pAq ⊃ C...a universally quantified parameter, mapping ©A to ∀x. ( pAq ⊃ C(x)) ⊃ C(x). The other possibility is to allow linearity and translate ©A to ( pAq ⊃ C...nonce. We define p〈K〉Aq = ∀x.( pAq ⊃ af(K,x)) ⊃ af(K,x) This resembles a CPS transformation of the lax modality. The formula pAq ⊃ af(K,x) is the “type

Dimensionality and noise in energy selective x-ray imaging

PubMed Central

Alvarez, Robert E.

2013-01-01

Purpose: To develop and test a method to quantify the effect of dimensionality on the noise in energy selective x-ray imaging. Methods: The Cramèr-Rao lower bound (CRLB), a universal lower limit of the covariance of any unbiased estimator, is used to quantify the noise. It is shown that increasing dimensionality always increases, or at best leaves the same, the variance. An analytic formula for the increase in variance in an energy selective x-ray system is derived. The formula is used to gain insight into the dependence of the increase in variance on the properties of the additional basis functions, the measurement noise covariance, and the source spectrum. The formula is also used with computer simulations to quantify the dependence of the additional variance on these factors. Simulated images of an object with three materials are used to demonstrate the trade-off of increased information with dimensionality and noise. The images are computed from energy selective data with a maximum likelihood estimator. Results: The increase in variance depends most importantly on the dimension and on the properties of the additional basis functions. With the attenuation coefficients of cortical bone, soft tissue, and adipose tissue as the basis functions, the increase in variance of the bone component from two to three dimensions is 1.4 × 103. With the soft tissue component, it is 2.7 × 104. If the attenuation coefficient of a high atomic number contrast agent is used as the third basis function, there is only a slight increase in the variance from two to three basis functions, 1.03 and 7.4 for the bone and soft tissue components, respectively. The changes in spectrum shape with beam hardening also have a substantial effect. They increase the variance by a factor of approximately 200 for the bone component and 220 for the soft tissue component as the soft tissue object thickness increases from 1 to 30 cm. Decreasing the energy resolution of the detectors increases the variance of the bone component markedly with three dimension processing, approximately a factor of 25 as the resolution decreases from 100 to 3 bins. The increase with two dimension processing for adipose tissue is a factor of two and with the contrast agent as the third material for two or three dimensions is also a factor of two for both components. The simulated images show that a maximum likelihood estimator can be used to process energy selective x-ray data to produce images with noise close to the CRLB. Conclusions: The method presented can be used to compute the effects of the object attenuation coefficients and the x-ray system properties on the relationship of dimensionality and noise in energy selective x-ray imaging systems. PMID:24320442

Light microscopic image analysis system to quantify immunoreactive terminal area apposed to nerve cells.

PubMed

Wu, L C; D'Amelio, F; Fox, R A; Polyakov, I; Daunton, N G

1997-06-06

The present report describes a desktop computer-based method for the quantitative assessment of the area occupied by immunoreactive terminals in close apposition to nerve cells in relation to the perimeter of the cell soma. This method is based on Fast Fourier Transform (FFT) routines incorporated in NIH-Image public domain software. Pyramidal cells of layer V of the somatosensory cortex outlined by GABA immunolabeled terminals were chosen for our analysis. A Leitz Diaplan light microscope was employed for the visualization of the sections. A Sierra Scientific Model 4030 CCD camera was used to capture the images into a Macintosh Centris 650 computer. After preprocessing, filtering was performed on the power spectrum in the frequency domain produced by the FFT operation. An inverse FFT with filter procedure was employed to restore the images to the spatial domain. Pasting of the original image to the transformed one using a Boolean logic operation called 'AND'ing produced an image with the terminals enhanced. This procedure allowed the creation of a binary image using a well-defined threshold of 128. Thus, the terminal area appears in black against a white background. This methodology provides an objective means of measurement of area by counting the total number of pixels occupied by immunoreactive terminals in light microscopic sections in which the difficulties of labeling intensity, size, shape and numerical density of terminals are avoided.

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

Ushizima, Daniela M.; Bianchi, Andrea G. C.; DeBianchi, Christina

We introduce a computational analysis workflow to access properties of solid objects using nondestructive imaging techniques that rely on X-ray imaging. The goal is to process and quantify structures from material science sample cross sections. The algorithms can differentiate the porous media (high density material) from the void (background, low density media) using a Boolean classifier, so that we can extract features, such as volume, surface area, granularity spectrum, porosity, among others. Our workflow, Quant-CT, leverages several algorithms from ImageJ, such as statistical region merging and 3D object counter. It also includes schemes for bilateral filtering that use a 3Dmore » kernel, for parallel processing of sub-stacks, and for handling over-segmentation using histogram similarities. The Quant-CT supports fast user interaction, providing the ability for the user to train the algorithm via subsamples to feed its core algorithms with automated parameterization. Quant-CT plugin is currently available for testing by personnel at the Advanced Light Source and Earth Sciences Divisions and Energy Frontier Research Center (EFRC), LBNL, as part of their research on porous materials. The goal is to understand the processes in fluid-rock systems for the geologic sequestration of CO2, and to develop technology for the safe storage of CO2 in deep subsurface rock formations. We describe our implementation, and demonstrate our plugin on porous material images. This paper targets end-users, with relevant information for developers to extend its current capabilities.« less

Searching PubMed for a broad subject area: how effective are palliative care clinicians in finding the evidence in their field?

PubMed

Damarell, Raechel A; Tieman, Jennifer J

2016-03-01

Health professionals must be able to search competently for evidence to support practice. We sought to understand how palliative care clinicians construct searches for palliative care literature in PubMed, to quantify search efficacy in retrieving a set of relevant articles and to compare performance against a Palliative CareSearch Filter (PCSF). Included studies from palliative care systematic reviews formed a test set. Palliative care clinicians (n = 37) completed a search task using PubMed. Individual clinician searches were reconstructed in PubMed and combined with the test set to calculate retrieval sensitivity. PCSF performance in the test set was also determined. Many clinicians struggled to create useful searches. Twelve used a single search term, 17 narrowed the search inappropriately and 8 confused Boolean operators. The mean number of test set citations (n = 663) retrieved was 166 (SD = 188), or 25% although 76% of clinicians believed they would find more than 50% of the articles. Only 8 participants (22%) achieved this. Correlations between retrieval and PubMed confidence (r = 0.13) or frequency of use (r = -0.18) were weak. Many palliative care clinicians search PubMed ineffectively. Targeted skills training and PCSF promotion may improve evidence retrieval. © 2015 Health Libraries Group.

Light microscopic image analysis system to quantify immunoreactive terminal area apposed to nerve cells

NASA Technical Reports Server (NTRS)

Wu, L. C.; D'Amelio, F.; Fox, R. A.; Polyakov, I.; Daunton, N. G.

1997-01-01

The present report describes a desktop computer-based method for the quantitative assessment of the area occupied by immunoreactive terminals in close apposition to nerve cells in relation to the perimeter of the cell soma. This method is based on Fast Fourier Transform (FFT) routines incorporated in NIH-Image public domain software. Pyramidal cells of layer V of the somatosensory cortex outlined by GABA immunolabeled terminals were chosen for our analysis. A Leitz Diaplan light microscope was employed for the visualization of the sections. A Sierra Scientific Model 4030 CCD camera was used to capture the images into a Macintosh Centris 650 computer. After preprocessing, filtering was performed on the power spectrum in the frequency domain produced by the FFT operation. An inverse FFT with filter procedure was employed to restore the images to the spatial domain. Pasting of the original image to the transformed one using a Boolean logic operation called 'AND'ing produced an image with the terminals enhanced. This procedure allowed the creation of a binary image using a well-defined threshold of 128. Thus, the terminal area appears in black against a white background. This methodology provides an objective means of measurement of area by counting the total number of pixels occupied by immunoreactive terminals in light microscopic sections in which the difficulties of labeling intensity, size, shape and numerical density of terminals are avoided.

Spillover of dietary fatty acids and use of serum nonesterified fatty acids for the synthesis of VLDL-triacylglycerol under two different feeding regimens.

PubMed

Barrows, Brian R; Timlin, Maureen T; Parks, Elizabeth J

2005-09-01

The present study quantified dietary fatty acid flux in healthy men (n = 6) who were fed a liquid formula through a duodenal feeding tube (continuous feeding group) or who consumed the same formula in meals (meal feeding group). A triacylglycerol (TAG) stable isotope was added to the formula to determine the entry of dietary fatty acids into the serum and its clearance to the liver and resecretion into serum via VLDL. The contribution of dietary fatty acids to serum nonesterified fatty acids (NEFAs) was higher with meal feeding (24.4 +/- 2.6%) compared with continuous feeding (10.8 +/- 2.9%, P < 0.01) and, when multiplied by the NEFA concentration, resulted in similar absolute fatty acid spillover. Diet-derived NEFAs subsequently represented 10.6 +/- 1.2% and 4.7 +/- 1.3% of hepatic VLDL-TAG (meal feeding vs. continuous feeding, respectively, P = 0.004). Chylomicron remnant uptake by the liver contributed 9.3 +/- 1.9% of fatty acids to hepatic VLDL-TAG synthesis with meal feeding compared with continuous feeding (4.4 +/- 0.8%, P < 0.03). These data suggest that the extent of dietary fatty acid recycling via serum NEFAs and VLDL-TAG is determined by the rate of delivery of dietary fat to the intestine. The inefficient removal of dietary fat from the circulation may maintain VLDL-TAG production but may also result in prolonged postprandial lipemia.

Mapping local and global variability in plant trait distributions.

PubMed

Butler, Ethan E; Datta, Abhirup; Flores-Moreno, Habacuc; Chen, Ming; Wythers, Kirk R; Fazayeli, Farideh; Banerjee, Arindam; Atkin, Owen K; Kattge, Jens; Amiaud, Bernard; Blonder, Benjamin; Boenisch, Gerhard; Bond-Lamberty, Ben; Brown, Kerry A; Byun, Chaeho; Campetella, Giandiego; Cerabolini, Bruno E L; Cornelissen, Johannes H C; Craine, Joseph M; Craven, Dylan; de Vries, Franciska T; Díaz, Sandra; Domingues, Tomas F; Forey, Estelle; González-Melo, Andrés; Gross, Nicolas; Han, Wenxuan; Hattingh, Wesley N; Hickler, Thomas; Jansen, Steven; Kramer, Koen; Kraft, Nathan J B; Kurokawa, Hiroko; Laughlin, Daniel C; Meir, Patrick; Minden, Vanessa; Niinemets, Ülo; Onoda, Yusuke; Peñuelas, Josep; Read, Quentin; Sack, Lawren; Schamp, Brandon; Soudzilovskaia, Nadejda A; Spasojevic, Marko J; Sosinski, Enio; Thornton, Peter E; Valladares, Fernando; van Bodegom, Peter M; Williams, Mathew; Wirth, Christian; Reich, Peter B

2017-12-19

Our ability to understand and predict the response of ecosystems to a changing environment depends on quantifying vegetation functional diversity. However, representing this diversity at the global scale is challenging. Typically, in Earth system models, characterization of plant diversity has been limited to grouping related species into plant functional types (PFTs), with all trait variation in a PFT collapsed into a single mean value that is applied globally. Using the largest global plant trait database and state of the art Bayesian modeling, we created fine-grained global maps of plant trait distributions that can be applied to Earth system models. Focusing on a set of plant traits closely coupled to photosynthesis and foliar respiration-specific leaf area (SLA) and dry mass-based concentrations of leaf nitrogen ([Formula: see text]) and phosphorus ([Formula: see text]), we characterize how traits vary within and among over 50,000 [Formula: see text]-km cells across the entire vegetated land surface. We do this in several ways-without defining the PFT of each grid cell and using 4 or 14 PFTs; each model's predictions are evaluated against out-of-sample data. This endeavor advances prior trait mapping by generating global maps that preserve variability across scales by using modern Bayesian spatial statistical modeling in combination with a database over three times larger than that in previous analyses. Our maps reveal that the most diverse grid cells possess trait variability close to the range of global PFT means.

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

Heng, Kevin, E-mail: kevin.heng@csh.unibe.ch

We present a dimensionless index that quantifies the degree of cloudiness of the atmosphere of a transiting exoplanet. Our cloudiness index is based on measuring the transit radii associated with the line center and wing of the sodium or potassium line. In deriving this index, we revisited the algebraic formulae for inferring the isothermal pressure scale height from transit measurements. We demonstrate that the formulae of Lecavelier et al. and Benneke and Seager are identical: the former is inferring the temperature while assuming a value for the mean molecular mass and the latter is inferring the mean molecular mass whilemore » assuming a value for the temperature. More importantly, these formulae cannot be used to distinguish between cloudy and cloud-free atmospheres. We derive values of our cloudiness index for a small sample of seven hot Saturns/Jupiters taken from Sing et al. We show that WASP-17b, WASP-31b, and HAT-P-1b are nearly cloud-free at visible wavelengths. We find the tentative trend that more irradiated atmospheres tend to have fewer clouds consisting of sub-micron-sized particles. We also derive absolute sodium and/or potassium abundances ∼10{sup 2} cm{sup −3} for WASP-17b, WASP-31b, and HAT-P-1b (and upper limits for the other objects). Higher-resolution measurements of both the sodium and potassium lines, for a larger sample of exoplanetary atmospheres, are needed to confirm or refute this trend.« less

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.

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.

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.

Quantification of myo-inositol, 1,5-anhydro-D-sorbitol, and D-chiro-inositol using high-performance liquid chromatography with electrochemical detection in very small volume clinical samples

PubMed Central

Schimpf, Karen J.; Meek, Claudia C.; Leff, Richard D.; Phelps, Dale L.; Schmitz, Daniel J.; Cordle, Christopher T.

2015-01-01

Inositol is a six-carbon sugar alcohol and is one of nine biologically significant isomers of hexahydroxycyclohexane. Myo-inositol is the primary biologically active form and is present in higher concentrations in the fetus and newborn than in adults. It is currently being examined for the prevention of retinopathy of prematurity in newborn preterm infants. A robust method for quantifying myo-inositol (MI), D-chiro-inositol (DCI) and 1,5-anhydro-D-sorbitol (ADS) in very small-volume (25 μL) urine, blood serum and/or plasma samples was developed. Using a multiple-column, multiple mobile phase liquid chromatographic system with electrochemical detection, the method was validated with respect to (a) selectivity, (b) accuracy/recovery, (c) precision/reproducibility, (d) sensitivity, (e) stability and (f) ruggedness. The standard curve was linear and ranged from 0.5 to 30 mg/L for each of the three analytes. Above-mentioned performance measures were within acceptable limits described in the Food and Drug Administration’s Guidance for Industry: Bioanalytical Method Validation. The method was validated using blood serum and plasma collected using four common anticoagulants, and also by quantifying the accuracy and sensitivity of MI measured in simulated urine samples recovered from preterm infant diaper systems. The method performs satisfactorily measuring the three most common inositol isomers on 25 μL clinical samples of serum, plasma milk, and/or urine. Similar performance is seen testing larger volume samples of infant formulas and infant formula ingredients. MI, ADS and DCI may be accurately tested in urine samples collected from five different preterm infant diapers if the urine volume is greater than 2–5 mL. PMID:26010453

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.

Statistical regularities in the rank-citation profile of scientists.

PubMed

Petersen, Alexander M; Stanley, H Eugene; Succi, Sauro

2011-01-01

Recent science of science research shows that scientific impact measures for journals and individual articles have quantifiable regularities across both time and discipline. However, little is known about the scientific impact distribution at the scale of an individual scientist. We analyze the aggregate production and impact using the rank-citation profile c(i)(r) of 200 distinguished professors and 100 assistant professors. For the entire range of paper rank r, we fit each c(i)(r) to a common distribution function. Since two scientists with equivalent Hirsch h-index can have significantly different c(i)(r) profiles, our results demonstrate the utility of the β(i) scaling parameter in conjunction with h(i) for quantifying individual publication impact. We show that the total number of citations C(i) tallied from a scientist's N(i) papers scales as [Formula: see text]. Such statistical regularities in the input-output patterns of scientists can be used as benchmarks for theoretical models of career progress.

Analysis of Clinical Cohort Data Using Nested Case-control and Case-cohort Sampling Designs. A Powerful and Economical Tool.

PubMed

Ohneberg, K; Wolkewitz, M; Beyersmann, J; Palomar-Martinez, M; Olaechea-Astigarraga, P; Alvarez-Lerma, F; Schumacher, M

2015-01-01

Sampling from a large cohort in order to derive a subsample that would be sufficient for statistical analysis is a frequently used method for handling large data sets in epidemiological studies with limited resources for exposure measurement. For clinical studies however, when interest is in the influence of a potential risk factor, cohort studies are often the first choice with all individuals entering the analysis. Our aim is to close the gap between epidemiological and clinical studies with respect to design and power considerations. Schoenfeld's formula for the number of events required for a Cox' proportional hazards model is fundamental. Our objective is to compare the power of analyzing the full cohort and the power of a nested case-control and a case-cohort design. We compare formulas for power for sampling designs and cohort studies. In our data example we simultaneously apply a nested case-control design with a varying number of controls matched to each case, a case cohort design with varying subcohort size, a random subsample and a full cohort analysis. For each design we calculate the standard error for estimated regression coefficients and the mean number of distinct persons, for whom covariate information is required. The formula for the power of a nested case-control design and the power of a case-cohort design is directly connected to the power of a cohort study using the well known Schoenfeld formula. The loss in precision of parameter estimates is relatively small compared to the saving in resources. Nested case-control and case-cohort studies, but not random subsamples yield an attractive alternative for analyzing clinical studies in the situation of a low event rate. Power calculations can be conducted straightforwardly to quantify the loss of power compared to the savings in the num-ber of patients using a sampling design instead of analyzing the full cohort.

Effects of the inclusion of a mixed Psychrotrophic bacteria strain for sewage treatment in constructed wetland in winter seasons.

PubMed

Tang, Meizhen; Li, Zhengtao; Yang, Yuewei; Chen, Junfeng; Jiang, Jie

2018-04-01

Constructed wetlands (CWs) have been used globally in wastewater treatment for years. CWs represent an efficient ecological system which is both energy-saving and low in investment for construction and operational cost. In addition, CWs also have the advantage of being easy to operate and maintain. However, the operation of CWs at northern latitudes (both mid and high) is sometimes quite demanding, due to the inhibitory effect of low temperatures that often occur in winter. To evaluate the wastewater treatment performance of a culture of mixed Psychrotrophic bacteria strains in an integrated vertical-flow CW, the removal rates of ammonia nitrogen (NH 3 -N), chemical oxygen demand (COD), nitrite nitrogen [Formula: see text], nitrate nitrogen [Formula: see text] and total phosphorus (TP) were quantified at different bacterial dosages to determine the best bacterial dosage and establish kinetic degradation models of the mixed strains. The bacterial culture was made up of Psychrobacter TM-1, Sphingobacterium TM-2 and Pseudomonas TM-3, mixed together at a volume/volume ratio of 1 : 1 : 1 (at bacterial suspension concentrations of 4.4 × 10 9  ml -1 ). Results showed that the organic pollutants (nitrogen and phosphorus) in the sewage could be efficiently removed by the culture of mixed Psychrotrophic bacteria. The optimal dosage of this mixed bacteria strain was 2.5%, and the treatment efficiency of COD, NH 3 -N, [Formula: see text], [Formula: see text], total nitrogen and TP were stable at 91.8%, 91.1%, 88.0%, 93.8%, 94.8% and 95.2%, respectively, which were 1.5, 2.0, 2.1, 1.5, 2.2 and 1.3 times those of the control group. In addition, a pseudo-first-order degradation model was a good fit for the degradation pattern observed for each of these pollutants.

Statistical shape modelling to aid surgical planning: associations between surgical parameters and head shapes following spring-assisted cranioplasty.

PubMed

Rodriguez-Florez, Naiara; Bruse, Jan L; Borghi, Alessandro; Vercruysse, Herman; Ong, Juling; James, Greg; Pennec, Xavier; Dunaway, David J; Jeelani, N U Owase; Schievano, Silvia

2017-10-01

Spring-assisted cranioplasty is performed to correct the long and narrow head shape of children with sagittal synostosis. Such corrective surgery involves osteotomies and the placement of spring-like distractors, which gradually expand to widen the skull until removal about 4 months later. Due to its dynamic nature, associations between surgical parameters and post-operative 3D head shape features are difficult to comprehend. The current study aimed at applying population-based statistical shape modelling to gain insight into how the choice of surgical parameters such as craniotomy size and spring positioning affects post-surgical head shape. Twenty consecutive patients with sagittal synostosis who underwent spring-assisted cranioplasty at Great Ormond Street Hospital for Children (London, UK) were prospectively recruited. Using a nonparametric statistical modelling technique based on mathematical currents, a 3D head shape template was computed from surface head scans of sagittal patients after spring removal. Partial least squares (PLS) regression was employed to quantify and visualise trends of localised head shape changes associated with the surgical parameters recorded during spring insertion: anterior-posterior and lateral craniotomy dimensions, anterior spring position and distance between anterior and posterior springs. Bivariate correlations between surgical parameters and corresponding PLS shape vectors demonstrated that anterior-posterior (Pearson's [Formula: see text]) and lateral craniotomy dimensions (Spearman's [Formula: see text]), as well as the position of the anterior spring ([Formula: see text]) and the distance between both springs ([Formula: see text]) on average had significant effects on head shapes at the time of spring removal. Such effects were visualised on 3D models. Population-based analysis of 3D post-operative medical images via computational statistical modelling tools allowed for detection of novel associations between surgical parameters and head shape features achieved following spring-assisted cranioplasty. The techniques described here could be extended to other cranio-maxillofacial procedures in order to assess post-operative outcomes and ultimately facilitate surgical decision making.

S-(–)equol production is developmentally regulated and related to early diet composition

PubMed Central

Brown, Nadine M.; Galandi, Stephanie L.; Summer, Suzanne S.; Zhao, Xueheng; Heubi, James E.; King, Eileen C.; Setchell, Kenneth D.R.

2016-01-01

S-(−)7-hydroxy-3-(4′-hydroxyphenyl)-chroman, or S-(−)equol, a biologically active intestinally derived bacterial metabolite of the soy isoflavones daidzin/daidzein, is not produced in neonatal life. Because its synthesis is dependent on equol-producing bacteria, we hypothesized that early nutrition may influence equol production. This prospective 2.5-year study determined the frequency of S-(−)equol production in healthy infants (n = 90) fed breast milk, soy infant formula, or cow’s milk formula in their first year. Urinary S-(−)equol and daidzein were quantified by mass spectrometry after a standardized 3.5-day soy isoflavone challenge. Infants were tested at 6, 9, 12, 18, 24, and 36 months of age, and 3-day diet records were obtained at each visit to explore the effect of early and postweaning (>12 months) macronutrient and micronutrient dietary composition and S-(−)equol production. Use of antibiotics was also recorded. At age 6 months, none of the breast-fed infants produced S-(−)equol, whereas 3.8% and 6.0%, respectively, of soy and cow’s milk formula–fed infants were equol producers. By age 3 years, 50% of the formula-fed infants were equol producers, compared with 25% of breast-fed infants. Use of antibiotics was prevalent among infants and may have impacted the stability of S-(−)equol production. No significant differences among the groups were observed in postweaning dietary intakes of total energy, carbohydrate, fiber, protein, fat, saturated fatty acids, or polyunsaturated fatty acids and the propensity to make S-(−)equol. In conclusion, S-(−)equol production is developmentally regulated and initially related to diet composition with the proportion of equol producers increasing over the first 3 years of life, with a trend for formula feeding favoring S-(−)equol production. PMID:24916553

Early enteral feeding in postsurgical cancer patients. Fish oil structured lipid-based polymeric formula versus a standard polymeric formula.

PubMed Central

Kenler, A S; Swails, W S; Driscoll, D F; DeMichele, S J; Daley, B; Babineau, T J; Peterson, M B; Bistrian, B R

1996-01-01

OBJECTIVES: The authors compared the safety, gastrointestinal tolerance, and clinical efficacy of feeding an enteral diet containing a fish oil/medium-chain triglyceride structured lipid (FOSL-HN) versus an isonitrogenous, isocaloric formula (O-HN) in patients undergoing major abdominal surgery for upper gastrointestinal malignancies. SUMMARY BACKGROUND DATA: Previous studies suggest that feeding with n-3 fatty acids from fish oil can alter eicosanoid and cytokine production, yielding an improved immunocompetence and a reduced inflammatory response to injury. The use of n-3 fatty acids as a structured lipid can improve long-chain fatty acid absorption. METHODS: This prospective, blinded, randomized trial was conducted in 50 adult patients who were jejunally fed either FOSL-HN or O-HN for 7 days. Serum chemistries, hematology, urinalysis, gastrointestinal complications, liver and renal function, plasma and erythrocyte fatty acid analysis, urinary prostaglandins, and outcome parameters were measured at baseline and on day 7. Comparisons were made in 18 and 17 evaluable patients based a priori on the ability to reach a tube feeding rate of 40 mL/hour. RESULTS: Patients receiving FOSL-HN experienced no untoward side effects, significant incorporation of eicosapentaenoic acid into plasma and erythrocyte phospholipids, and a 50% decline in the total number of gastrointestinal complications and infections compared with patients given O-HN. The data strongly suggest improved liver and renal function during the postoperative period in the FOSL-HN group. CONCLUSION: Early enteral feeding with FOSL-HN was safe and well tolerated. Results suggest that the use of such a formula during the postoperative period may reduce the number of infections and gastrointestinal complications per patient, as well as improve renal and liver function through modulation of urinary prostaglandin levels. Additional clinical trials to fully quantify clinical benefits and optimize nutritional support with FOSL-HN should be undertaken. Images Figure 1. Figure 2. Figure 3. PMID:8604913

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