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

DOE PAGES

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

2016-07-05

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

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.

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.

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…

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

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.

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

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

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.

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.

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.

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.

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.

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

PubMed Central

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

2017-01-01

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

An Automated Design Framework for Multicellular Recombinase Logic.

PubMed

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

2018-05-18

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

Tracking perturbations in Boolean networks with spectral methods

NASA Astrophysics Data System (ADS)

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

2005-08-01

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

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.

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

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.

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

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.

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.

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.

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

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

Phase transitions in restricted Boltzmann machines with generic priors

NASA Astrophysics Data System (ADS)

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

2017-10-01

We study generalized restricted Boltzmann machines with generic priors for units and weights, interpolating between Boolean and Gaussian variables. We present a complete analysis of the replica symmetric phase diagram of these systems, which can be regarded as generalized Hopfield models. We underline the role of the retrieval phase for both inference and learning processes and we show that retrieval is robust for a large class of weight and unit priors, beyond the standard Hopfield scenario. Furthermore, we show how the paramagnetic phase boundary is directly related to the optimal size of the training set necessary for good generalization in a teacher-student scenario of unsupervised learning.

Supervised Learning of Two-Layer Perceptron under the Existence of External Noise — Learning Curve of Boolean Functions of Two Variables in Tree-Like Architecture —

NASA Astrophysics Data System (ADS)

Uezu, Tatsuya; Kiyokawa, Shuji

2016-06-01

We investigate the supervised batch learning of Boolean functions expressed by a two-layer perceptron with a tree-like structure. We adopt continuous weights (spherical model) and the Gibbs algorithm. We study the Parity and And machines and two types of noise, input and output noise, together with the noiseless case. We assume that only the teacher suffers from noise. By using the replica method, we derive the saddle point equations for order parameters under the replica symmetric (RS) ansatz. We study the critical value αC of the loading rate α above which the learning phase exists for cases with and without noise. We find that αC is nonzero for the Parity machine, while it is zero for the And machine. We derive the exponents barβ of order parameters expressed as (α - α C)bar{β} when α is near to αC. Furthermore, in the Parity machine, when noise exists, we find a spin glass solution, in which the overlap between the teacher and student vectors is zero but that between student vectors is nonzero. We perform Markov chain Monte Carlo simulations by simulated annealing and also by exchange Monte Carlo simulations in both machines. In the Parity machine, we study the de Almeida-Thouless stability, and by comparing theoretical and numerical results, we find that there exist parameter regions where the RS solution is unstable, and that the spin glass solution is metastable or unstable. We also study asymptotic learning behavior for large α and derive the exponents hat{β } of order parameters expressed as α - hat{β } when α is large in both machines. By simulated annealing simulations, we confirm these results and conclude that learning takes place for the input noise case with any noise amplitude and for the output noise case when the probability that the teacher's output is reversed is less than one-half.

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

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.

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.

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

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.

Boolean Networks in Inference and Dynamic Modeling of Biological Systems at the Molecular and Physiological Level

NASA Astrophysics Data System (ADS)

Thakar, Juilee; Albert, Réka

The following sections are included: * Introduction * Boolean Network Concepts and History * Extensions of the Classical Boolean Framework * Boolean Inference Methods and Examples in Biology * Dynamic Boolean Models: Examples in Plant Biology, Developmental Biology and Immunology * Conclusions * References

Affine Equivalence of Quartic Monomial Rotation Symmetric Boolean Functions in Prime Power Dimension

DTIC Science & Technology

2015-01-27

the contribution to E(p`)(·) in this case is E(p`)1,5,7,11 ←− 1 2 (p`−1 − 1)(p` − 2p`−1 − 1) 2 + 1 3 (p`−1 − 1)(p`−1 − 2) 2 = (p`−1 − 1)(3p` − 4p `−1...remaining number of pairs (of class cardinality 8) is exactly (p`−s−1 − 1)(p`−s−1 − 2)− (p`−s−1 − 1) = p2`−2s−2 − 4p `−s−1 + 3. Thus, the contribution to E(p...of class C is E(p`)1,5,7,11 ←− `−2∑ s=1 ( p`−s−1 − 1 2 + p2`−2s−2 − 4p `−s−1 + 3 8 ) = `−2∑ s=1 p2`−2s−2 − 1 8 = p2`−2 − 1 8(p2 − 1) − `− 1 8

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

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.

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.

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…

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.

Satisfiability of logic programming based on radial basis function neural networks

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

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

2014-07-10

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

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.

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.

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.

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.

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

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

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.

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.

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.

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.

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.

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.

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

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.

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.

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

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.

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

NASA Technical Reports Server (NTRS)

Szallasi, Zoltan; Liang, Shoudan

2000-01-01

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

Automatic query formulations in information retrieval.

PubMed

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

1983-07-01

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

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

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

2014-01-01

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

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.

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.

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.

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

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

PubMed

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

2018-01-01

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

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

ERIC Educational Resources Information Center

Cadolino, C.; Guazzo, M.

1982-01-01

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

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.

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

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.

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.

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)

A Note on a Sampling Theorem for Functions over GF(q)n Domain

NASA Astrophysics Data System (ADS)

Ukita, Yoshifumi; Saito, Tomohiko; Matsushima, Toshiyasu; Hirasawa, Shigeichi

In digital signal processing, the sampling theorem states that any real valued function ƒ can be reconstructed from a sequence of values of ƒ that are discretely sampled with a frequency at least twice as high as the maximum frequency of the spectrum of ƒ. This theorem can also be applied to functions over finite domain. Then, the range of frequencies of ƒ can be expressed in more detail by using a bounded set instead of the maximum frequency. A function whose range of frequencies is confined to a bounded set is referred to as bandlimited function. And a sampling theorem for bandlimited functions over Boolean domain has been obtained. Here, it is important to obtain a sampling theorem for bandlimited functions not only over Boolean domain (GF(q)n domain) but also over GF(q)n domain, where q is a prime power and GF(q) is Galois field of order q. For example, in experimental designs, although the model can be expressed as a linear combination of the Fourier basis functions and the levels of each factor can be represented by GF(q)n, the number of levels often take a value greater than two. However, the sampling theorem for bandlimited functions over GF(q)n domain has not been obtained. On the other hand, the sampling points are closely related to the codewords of a linear code. However, the relation between the parity check matrix of a linear code and any distinct error vectors has not been obtained, although it is necessary for understanding the meaning of the sampling theorem for bandlimited functions. In this paper, we generalize the sampling theorem for bandlimited functions over Boolean domain to a sampling theorem for bandlimited functions over GF(q)n domain. We also present a theorem for the relation between the parity check matrix of a linear code and any distinct error vectors. Lastly, we clarify the relation between the sampling theorem for functions over GF(q)n domain and linear codes.

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.

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.

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

ERIC Educational Resources Information Center

Nathan, Mitchell J.; Jackson, Kristi

2006-01-01

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

Algebraic model checking for Boolean gene regulatory networks.

PubMed

Tran, Quoc-Nam

2011-01-01

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

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

ERIC Educational Resources Information Center

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

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

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

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.

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…

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.

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...

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

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

3D GIS spatial operation based on extended Euler operators

NASA Astrophysics Data System (ADS)

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

2008-10-01

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

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

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.

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.

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.

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.

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.

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

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

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.

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.

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…

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,…

"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

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 ...

An expert system design to diagnose cancer by using a new method reduced rule base.

PubMed

Başçiftçi, Fatih; Avuçlu, Emre

2018-04-01

A Medical Expert System (MES) was developed which uses Reduced Rule Base to diagnose cancer risk according to the symptoms in an individual. A total of 13 symptoms were used. With the new MES, the reduced rules are controlled instead of all possibilities (2 13 = 8192 different possibilities occur). By controlling reduced rules, results are found more quickly. The method of two-level simplification of Boolean functions was used to obtain Reduced Rule Base. Thanks to the developed application with the number of dynamic inputs and outputs on different platforms, anyone can easily test their own cancer easily. More accurate results were obtained considering all the possibilities related to cancer. Thirteen different risk factors were determined to determine the type of cancer. The truth table produced in our study has 13 inputs and 4 outputs. The Boolean Function Minimization method is used to obtain less situations by simplifying logical functions. Diagnosis of cancer quickly thanks to control of the simplified 4 output functions. Diagnosis made with the 4 output values obtained using Reduced Rule Base was found to be quicker than diagnosis made by screening all 2 13 = 8192 possibilities. With the improved MES, more probabilities were added to the process and more accurate diagnostic results were obtained. As a result of the simplification process in breast and renal cancer diagnosis 100% diagnosis speed gain, in cervical cancer and lung cancer diagnosis rate gain of 99% was obtained. With Boolean function minimization, less number of rules is evaluated instead of evaluating a large number of rules. Reducing the number of rules allows the designed system to work more efficiently and to save time, and facilitates to transfer the rules to the designed Expert systems. Interfaces were developed in different software platforms to enable users to test the accuracy of the application. Any one is able to diagnose the cancer itself using determinative risk factors. Thereby likely to beat the cancer with early diagnosis. Copyright © 2018 Elsevier B.V. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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

2016-06-01

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

A 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.

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.

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

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.

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

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.

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.

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.

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.

Symmetric polynomials in information theory: Entropy and subentropy

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

Jozsa, Richard; Mitchison, Graeme

2015-06-15

Entropy and other fundamental quantities of information theory are customarily expressed and manipulated as functions of probabilities. Here we study the entropy H and subentropy Q as functions of the elementary symmetric polynomials in the probabilities and reveal a series of remarkable properties. Derivatives of all orders are shown to satisfy a complete monotonicity property. H and Q themselves become multivariate Bernstein functions and we derive the density functions of their Levy-Khintchine representations. We also show that H and Q are Pick functions in each symmetric polynomial variable separately. Furthermore, we see that H and the intrinsically quantum informational quantitymore » Q become surprisingly closely related in functional form, suggesting a special significance for the symmetric polynomials in quantum information theory. Using the symmetric polynomials, we also derive a series of further properties of H and Q.« less

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

Specialty functions singularity mechanics problems

NASA Technical Reports Server (NTRS)

Sarigul, Nesrin

1989-01-01

The focus is in the development of more accurate and efficient advanced methods for solution of singular problems encountered in mechanics. At present, finite element methods in conjunction with special functions, boolean sum and blending interpolations are being considered. In dealing with systems which contain a singularity, special finite elements are being formulated to be used in singular regions. Further, special transition elements are being formulated to couple the special element to the mesh that models the rest of the system, and to be used in conjunction with 1-D, 2-D and 3-D elements within the same mesh. Computational simulation with a least squares fit is being utilized to construct special elements, if there is an unknown singularity in the system. A novel approach is taken in formulation of the elements in that: (1) the material properties are modified to include time, temperature, coordinate and stress dependant behavior within the element; (2) material properties vary at nodal points of the elements; (3) a hidden-symbolic computation scheme is developed and utilized in formulating the elements; and (4) special functions and boolean sum are utilized in order to interpolate the field variables and their derivatives along the boundary of the elements. It may be noted that the proposed methods are also applicable to fluids and coupled problems.

Constructing topological models by symmetrization: A projected entangled pair states study

NASA Astrophysics Data System (ADS)

Fernández-González, Carlos; Mong, Roger S. K.; Landon-Cardinal, Olivier; Pérez-García, David; Schuch, Norbert

2016-10-01

Symmetrization of topologically ordered wave functions is a powerful method for constructing new topological models. Here we study wave functions obtained by symmetrizing quantum double models of a group G in the projected entangled pair states (PEPS) formalism. We show that symmetrization naturally gives rise to a larger symmetry group G ˜ which is always non-Abelian. We prove that by symmetrizing on sufficiently large blocks, one can always construct wave functions in the same phase as the double model of G ˜. In order to understand the effect of symmetrization on smaller patches, we carry out numerical studies for the toric code model, where we find strong evidence that symmetrizing on individual spins gives rise to a critical model which is at the phase transitions of two inequivalent toric codes, obtained by anyon condensation from the double model of G ˜.

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…

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.

Geometric multiaxial representation of N -qubit mixed symmetric separable states

NASA Astrophysics Data System (ADS)

SP, Suma; Sirsi, Swarnamala; Hegde, Subramanya; Bharath, Karthik

2017-08-01

The study of N -qubit mixed symmetric separable states is a longstanding challenging problem as no unique separability criterion exists. In this regard, we take up the N -qubit mixed symmetric separable states for a detailed study as these states are of experimental importance and offer an elegant mathematical analysis since the dimension of the Hilbert space is reduced from 2N to N +1 . Since there exists a one-to-one correspondence between the spin-j system and an N -qubit symmetric state, we employ Fano statistical tensor parameters for the parametrization of the spin-density matrix. Further, we use a geometric multiaxial representation (MAR) of the density matrix to characterize the mixed symmetric separable states. Since the separability problem is NP-hard, we choose to study it in the continuum limit where mixed symmetric separable states are characterized by the P -distribution function λ (θ ,ϕ ) . We show that the N -qubit mixed symmetric separable states can be visualized as a uniaxial system if the distribution function is independent of θ and ϕ . We further choose a distribution function to be the most general positive function on a sphere and observe that the statistical tensor parameters characterizing the N -qubit symmetric system are the expansion coefficients of the distribution function. As an example for the discrete case, we investigate the MAR of a uniformly weighted two-qubit mixed symmetric separable state. We also observe that there exists a correspondence between the separability and classicality of states.

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.

Graph Eigenvalues and Walsh Spectrum of Boolean Functions

DTIC Science & Technology

2006-08-28

Same as Report (SAR) 18. NUMBER OF PAGES 15 19a. NAME OF RESPONSIBLE PERSON a. REPORT unclassified b. ABSTRACT unclassified c . THIS PAGE...class of all affine functions on Vn. We say that f satisfies the propagation criterion (PC) with respect to c if∑ x∈Vn f(x)⊕ f(x⊕ c ) = 2n−1. (2) If f...any c with wt( c ) ≤ s, we say that f satisfies PC(s), and if s = n, then we say that f is a bent function. Recall that the Hamming weight of bent

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.

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.

Design of almost symmetric orthogonal wavelet filter bank via direct optimization.

PubMed

Murugesan, Selvaraaju; Tay, David B H

2012-05-01

It is a well-known fact that (compact-support) dyadic wavelets [based on the two channel filter banks (FBs)] cannot be simultaneously orthogonal and symmetric. Although orthogonal wavelets have the energy preservation property, biorthogonal wavelets are preferred in image processing applications because of their symmetric property. In this paper, a novel method is presented for the design of almost symmetric orthogonal wavelet FB. Orthogonality is structurally imposed by using the unnormalized lattice structure, and this leads to an objective function, which is relatively simple to optimize. The designed filters have good frequency response, flat group delay, almost symmetric filter coefficients, and symmetric wavelet function.

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…

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.

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…

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.

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

PubMed

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

2016-11-01

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

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

PubMed

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

2014-06-26

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

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

PubMed Central

2014-01-01

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

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

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…

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.

featsel: A framework for benchmarking of feature selection algorithms and cost functions

NASA Astrophysics Data System (ADS)

Reis, Marcelo S.; Estrela, Gustavo; Ferreira, Carlos Eduardo; Barrera, Junior

In this paper, we introduce featsel, a framework for benchmarking of feature selection algorithms and cost functions. This framework allows the user to deal with the search space as a Boolean lattice and has its core coded in C++ for computational efficiency purposes. Moreover, featsel includes Perl scripts to add new algorithms and/or cost functions, generate random instances, plot graphs and organize results into tables. Besides, this framework already comes with dozens of algorithms and cost functions for benchmarking experiments. We also provide illustrative examples, in which featsel outperforms the popular Weka workbench in feature selection procedures on data sets from the UCI Machine Learning Repository.

Graphene-based room-temperature implementation of a modified Deutsch-Jozsa quantum algorithm.

PubMed

Dragoman, Daniela; Dragoman, Mircea

2015-12-04

We present an implementation of a one-qubit and two-qubit modified Deutsch-Jozsa quantum algorithm based on graphene ballistic devices working at room temperature. The modified Deutsch-Jozsa algorithm decides whether a function, equivalent to the effect of an energy potential distribution on the wave function of ballistic charge carriers, is constant or not, without measuring the output wave function. The function need not be Boolean. Simulations confirm that the algorithm works properly, opening the way toward quantum computing at room temperature based on the same clean-room technologies as those used for fabrication of very-large-scale integrated circuits.

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.

Proceedings of the Annual Ada Software Engineering Education and Training Symposium (4th) Held in Houston, Texas on June 13-15, 1989

DTIC Science & Technology

1989-06-01

Canfields, SevenUp, CocaCola , none); type Ounces is range 0 .. 20; type PriceType is digits 2 range 0.0 .. 0.75; type ContainerType is (bottle, can...brand of the soda (Shasta, CocaCola , etc.) function IsDiet(TheSoda : Soda) return boolean; -- return TRUE if the soda is a diet soda, FALSE otherwise

Process-driven inference of biological network structure: feasibility, minimality, and multiplicity

NASA Astrophysics Data System (ADS)

Zeng, Chen

2012-02-01

For a given dynamic process, identifying the putative interaction networks to achieve it is the inference problem. In this talk, we address the computational complexity of inference problem in the context of Boolean networks under dominant inhibition condition. The first is a proof that the feasibility problem (is there a network that explains the dynamics?) can be solved in polynomial-time. Second, while the minimality problem (what is the smallest network that explains the dynamics?) is shown to be NP-hard, a simple polynomial-time heuristic is shown to produce near-minimal solutions, as demonstrated by simulation. Third, the theoretical framework also leads to a fast polynomial-time heuristic to estimate the number of network solutions with reasonable accuracy. We will apply these approaches to two simplified Boolean network models for the cell cycle process of budding yeast (Li 2004) and fission yeast (Davidich 2008). Our results demonstrate that each of these networks contains a giant backbone motif spanning all the network nodes that provides the desired main functionality, while the remaining edges in the network form smaller motifs whose role is to confer stability properties rather than provide function. Moreover, we show that the bioprocesses of these two cell cycle models differ considerably from a typically generated process and are intrinsically cascade-like.

Symmetric and anti-symmetric LS hyperon potentials from lattice QCD

NASA Astrophysics Data System (ADS)

Ishii, Noriyoshi; Murano, Keiko; Nemura, Hidekatsu; Sasaki, Kenji; Inoue, Takashi; HAL QCD Collaboration

2014-09-01

We present recent results of odd-parity hyperon-hyperon potentials from lattice QCD. By using HAL QCD method, we generate hyperon-hyperon potentials from Nambu-Bethe-Salpeter (NBS) wave functions generated by lattice QCD simulation in the flavor SU(3) limit. Potentials in the irreducible flavor SU(3) representations are combined to make a Lambda-N potential which has a strong symmetric LS potential and a weak anti-symmetric LS potential. We discuss a possible cancellation between symmetric and anti-symmetric LS (Lambda-N) potentials after the coupled Sigma-N sector is integrated out. We present recent results of odd-parity hyperon-hyperon potentials from lattice QCD. By using HAL QCD method, we generate hyperon-hyperon potentials from Nambu-Bethe-Salpeter (NBS) wave functions generated by lattice QCD simulation in the flavor SU(3) limit. Potentials in the irreducible flavor SU(3) representations are combined to make a Lambda-N potential which has a strong symmetric LS potential and a weak anti-symmetric LS potential. We discuss a possible cancellation between symmetric and anti-symmetric LS (Lambda-N) potentials after the coupled Sigma-N sector is integrated out. This work is supported by JSPS KAKENHI Grant Number 25400244.

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.

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.

Independent functions and the geometry of Banach spaces

NASA Astrophysics Data System (ADS)

Astashkin, Sergey V.; Sukochev, Fedor A.

2010-12-01

The main objective of this survey is to present the `state of the art' of those parts of the theory of independent functions which are related to the geometry of function spaces. The `size' of a sum of independent functions is estimated in terms of classical moments and also in terms of general symmetric function norms. The exposition is centred on the Rosenthal inequalities and their various generalizations and sharp conditions under which the latter hold. The crucial tool here is the recently developed construction of the Kruglov operator. The survey also provides a number of applications to the geometry of Banach spaces. In particular, variants of the classical Khintchine-Maurey inequalities, isomorphisms between symmetric spaces on a finite interval and on the semi-axis, and a description of the class of symmetric spaces with any sequence of symmetrically and identically distributed independent random variables spanning a Hilbert subspace are considered. Bibliography: 87 titles.

Towards Symbolic Model Checking for Multi-Agent Systems via OBDDs

NASA Technical Reports Server (NTRS)

Raimondi, Franco; Lomunscio, Alessio

2004-01-01

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

Feedback Controller Design for the Synchronization of Boolean Control Networks.

PubMed

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

2016-09-01

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

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

ERIC Educational Resources Information Center

Roy, Rob

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

Nonthermal and geometric effects on the symmetric and anti-symmetric surface waves in a Lorentzian dusty plasma slab

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

Lee, Myoung-Jae; Jung, Young-Dae, E-mail: ydjung@hanyang.ac.kr; Department of Applied Physics and Department of Bionanotechnology, Hanyang University, Ansan, Kyunggi-Do 426-791

2015-02-15

The nonthermal and geometric effects on the propagation of the surface dust acoustic waves are investigated in a Lorentzian dusty plasma slab. The symmetric and anti-symmetric dispersion modes of the dust acoustic waves are obtained by the plasma dielectric function with the spectral reflection conditions the slab geometry. The variation of the nonthermal and geometric effects on the symmetric and the anti-symmetric modes of the surface plasma waves is also discussed.

A Layered Searchable Encryption Scheme with Functional Components Independent of Encryption Methods

PubMed Central

Luo, Guangchun; Qin, Ke

2014-01-01

Searchable encryption technique enables the users to securely store and search their documents over the remote semitrusted server, which is especially suitable for protecting sensitive data in the cloud. However, various settings (based on symmetric or asymmetric encryption) and functionalities (ranked keyword query, range query, phrase query, etc.) are often realized by different methods with different searchable structures that are generally not compatible with each other, which limits the scope of application and hinders the functional extensions. We prove that asymmetric searchable structure could be converted to symmetric structure, and functions could be modeled separately apart from the core searchable structure. Based on this observation, we propose a layered searchable encryption (LSE) scheme, which provides compatibility, flexibility, and security for various settings and functionalities. In this scheme, the outputs of the core searchable component based on either symmetric or asymmetric setting are converted to some uniform mappings, which are then transmitted to loosely coupled functional components to further filter the results. In such a way, all functional components could directly support both symmetric and asymmetric settings. Based on LSE, we propose two representative and novel constructions for ranked keyword query (previously only available in symmetric scheme) and range query (previously only available in asymmetric scheme). PMID:24719565

A genetic programming approach for Burkholderia Pseudomallei diagnostic pattern discovery

PubMed Central

Yang, Zheng Rong; Lertmemongkolchai, Ganjana; Tan, Gladys; Felgner, Philip L.; Titball, Richard

2009-01-01

Motivation: Finding diagnostic patterns for fighting diseases like Burkholderia pseudomallei using biomarkers involves two key issues. First, exhausting all subsets of testable biomarkers (antigens in this context) to find a best one is computationally infeasible. Therefore, a proper optimization approach like evolutionary computation should be investigated. Second, a properly selected function of the antigens as the diagnostic pattern which is commonly unknown is a key to the diagnostic accuracy and the diagnostic effectiveness in clinical use. Results: A conversion function is proposed to convert serum tests of antigens on patients to binary values based on which Boolean functions as the diagnostic patterns are developed. A genetic programming approach is designed for optimizing the diagnostic patterns in terms of their accuracy and effectiveness. During optimization, it is aimed to maximize the coverage (the rate of positive response to antigens) in the infected patients and minimize the coverage in the non-infected patients while maintaining the fewest number of testable antigens used in the Boolean functions as possible. The final coverage in the infected patients is 96.55% using 17 of 215 (7.4%) antigens with zero coverage in the non-infected patients. Among these 17 antigens, BPSL2697 is the most frequently selected one for the diagnosis of Burkholderia Pseudomallei. The approach has been evaluated using both the cross-validation and the Jack–knife simulation methods with the prediction accuracy as 93% and 92%, respectively. A novel approach is also proposed in this study to evaluate a model with binary data using ROC analysis. Contact: z.r.yang@ex.ac.uk PMID:19561021

Deriving Laws from Ordering Relations

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2003-01-01

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

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

PubMed

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

2016-09-23

Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

The phase topology of a special case of Goryachev integrability in rigid body dynamics

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

Ryabov, P. E., E-mail: orelryabov@mail.ru

2014-07-31

The phase topology of a special case of Goryachev integrability in the problem of motion of a rigid body in a fluid is investigated using the method of Boolean functions, which was developed by Kharlamov for algebraically separated systems. The bifurcation diagram of the moment map is found and the Fomenko invariant, which classifies the systems up to rough Liouville equivalence, is specified. Bibliography: 15 titles. (paper)

JPRS Report, Science & Technology. China.

DTIC Science & Technology

1989-03-29

Commun ., Vol COM-29, No 6, pp 895-901, June 1981. [4] R.C. Titsworth , "A Boolean-Function-Multiplexed Telemetry System," IEEE Trans, on SET, pp 42...Reagents 39 Gene-Engineered Human Epithelium Growth Factor (hEGF) 39 Superfine Snake Venom 39 COMPUTERS Ai Computer System LISP-MI [Zheng Shouqi, et...XUEBAO, No 3, Jun 88] 134 Coordinated Development of Microwave, Optical Communications [Zhang Xu; DIANXIN KUAIBAO, No 11, Nov 88] 143 Error

Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer

DTIC Science & Technology

2012-03-01

and Budget, Paperwork Reduction Project (0704-0188) Washington DC 20503. 1. AGENCY USE ONLY (Leave blank) 2 . REPORT DATE March 2012 3. REPORT... CA 93943-5000 8. PERFORMING ORGANIZATION REPORT NUMBER 9. SPONSORING /MONITORING AGENCY NAME(S) AND ADDRESS(ES) N/A 10. SPONSORING...developed for this conversion. This reduced form requires many fewer gates and has ( )n delay versus ( 2 ) n delay for a full transeunt triangle

On Various Nonlinearity Measures for Boolean Functions*

PubMed Central

Boyar, Joan; Find, Magnus Gausdal; Peralta, René

2016-01-01

A necessary condition for the security of cryptographic functions is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that six common measures, nonlinearity, algebraic degree, annihilator immunity, algebraic thickness, normality, and multiplicative complexity, are incomparable in the sense that for each pair of measures, μ1, μ2, there exist functions f1, f2 with f1 being more nonlinear than f2 according to μ1, but less nonlinear according to μ2. We also present new connections between two of these measures. Additionally, we give a lower bound on the multiplicative complexity of collision-free functions. PMID:27458499

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

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.

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.

The r-Stirling Numbers.

DTIC Science & Technology

1982-12-01

partitions, the restriction being that the first r elements must be in distinct cycles and respectively distinct subsets. The combinatorial and algebraic ...symmetric functions The Stirling numbers of the first kind, ("], for ixed n, are the elementary symmetric functions or the numbers 1,...,n (see, e.g., [4 or...5J). The r-Stirling numbers of the Iirst kind are the elementary symmetric runctions or the numbers r,... ,n. --- -4i: ? - , , .i

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.

Symmetrization in jellyfish: reorganization to regain function, and not lost parts.

PubMed

Abrams, Michael J; Goentoro, Lea

2016-02-01

We recently reported a previously unidentified strategy of self-repair in the moon jellyfish Aurelia aurita. Rather than regenerating lost parts, juvenile Aurelia reorganize remaining parts to regain essential body symmetry. This process that we called symmetrization is rapid and frequent, and is not driven by cell proliferation or cell death. Instead, the swimming machinery generates mechanical forces that drive symmetrization. We found evidence for symmetrization across three other species of jellyfish (Chrysaora pacifica, Mastigias sp., and Cotylorhiza tuberculata). We propose reorganization to regain function without recovery of initial morphology as a potentially broad class of self-repair strategy beyond radially symmetrical animals, and discuss the implications of this finding on the evolution of self-repair strategies in animals. Copyright © 2015 The Authors. Published by Elsevier GmbH.. All rights reserved.

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.

Response functions for dimers and square-symmetric molecules in four-wave-mixing experiments with polarized light

NASA Astrophysics Data System (ADS)

Smith, Eric Ryan; Farrow, Darcie A.; Jonas, David M.

2005-07-01

Four-wave-mixing nonlinear-response functions are given for intermolecular and intramolecular vibrations of a perpendicular dimer and intramolecular vibrations of a square-symmetric molecule containing a doubly degenerate state. A two-dimensional particle-in-a-box model is used to approximate the electronic wave functions and obtain harmonic potentials for nuclear motion. Vibronic interactions due to symmetry-lowering distortions along Jahn-Teller active normal modes are discussed. Electronic dephasing due to nuclear motion along both symmetric and asymmetric normal modes is included in these response functions, but population transfer between states is not. As an illustration, these response functions are used to predict the pump-probe polarization anisotropy in the limit of impulsive excitation.

Saturation: An efficient iteration strategy for symbolic state-space generation

NASA Technical Reports Server (NTRS)

Ciardo, Gianfranco; Luettgen, Gerald; Siminiceanu, Radu; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

This paper presents a novel algorithm for generating state spaces of asynchronous systems using Multi-valued Decision Diagrams. In contrast to related work, the next-state function of a system is not encoded as a single Boolean function, but as cross-products of integer functions. This permits the application of various iteration strategies to build a system's state space. In particular, this paper introduces a new elegant strategy, called saturation, and implements it in the tool SMART. On top of usually performing several orders of magnitude faster than existing BDD-based state-space generators, the algorithm's required peak memory is often close to the nal memory needed for storing the overall state spaces.

Probability and Quantum Paradigms: the Interplay

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

Kracklauer, A. F.

Since the introduction of Born's interpretation of quantum wave functions as yielding the probability density of presence, Quantum Theory and Probability have lived in a troubled symbiosis. Problems arise with this interpretation because quantum probabilities exhibit features alien to usual probabilities, namely non Boolean structure and non positive-definite phase space probability densities. This has inspired research into both elaborate formulations of Probability Theory and alternate interpretations for wave functions. Herein the latter tactic is taken and a suggested variant interpretation of wave functions based on photo detection physics proposed, and some empirical consequences are considered. Although incomplete in a fewmore » details, this variant is appealing in its reliance on well tested concepts and technology.« less

Probability and Quantum Paradigms: the Interplay

NASA Astrophysics Data System (ADS)

Kracklauer, A. F.

2007-12-01

Since the introduction of Born's interpretation of quantum wave functions as yielding the probability density of presence, Quantum Theory and Probability have lived in a troubled symbiosis. Problems arise with this interpretation because quantum probabilities exhibit features alien to usual probabilities, namely non Boolean structure and non positive-definite phase space probability densities. This has inspired research into both elaborate formulations of Probability Theory and alternate interpretations for wave functions. Herein the latter tactic is taken and a suggested variant interpretation of wave functions based on photo detection physics proposed, and some empirical consequences are considered. Although incomplete in a few details, this variant is appealing in its reliance on well tested concepts and technology.

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

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.

Cascaded all-optical operations in a hybrid integrated 80-Gb/s logic circuit.

PubMed

LeGrange, J D; Dinu, M; Sochor, T; Bollond, P; Kasper, A; Cabot, S; Johnson, G S; Kang, I; Grant, A; Kay, J; Jaques, J

2014-06-02

We demonstrate logic functionalities in a high-speed all-optical logic circuit based on differential Mach-Zehnder interferometers with semiconductor optical amplifiers as the nonlinear optical elements. The circuit, implemented by hybrid integration of the semiconductor optical amplifiers on a planar lightwave circuit platform fabricated in silica glass, can be flexibly configured to realize a variety of Boolean logic gates. We present both simulations and experimental demonstrations of cascaded all-optical operations for 80-Gb/s on-off keyed data.

Playing Tic-Tac-Toe with a Sugar-Based Molecular Computer.

PubMed

Elstner, M; Schiller, A

2015-08-24

Today, molecules can perform Boolean operations and circuits at a level of higher complexity. However, concatenation of logic gates and inhomogeneous inputs and outputs are still challenging tasks. Novel approaches for logic gate integration are possible when chemical programming and software programming are combined. Here it is shown that a molecular finite automaton based on the concatenated implication function (IMP) of a fluorescent two-component sugar probe via a wiring algorithm is able to play tic-tac-toe.

Ada Quality and Style: Guidelines for Professional Programmers, Version 02.01.01

DTIC Science & Technology

1992-12-01

47, 78, 79 predicate queue , entry not prioritized, 95 as function name, 22 for boolean object, 21 R preemptive scheduling. 118 race condition. 49...when lower priority tasks are given service while higher priority tasks remain blocked. In the above example, this occurred because entry queues are...from an entry queue 100 Ada QUALITY AND STYLE due to execution of an abort statement as well as expiration of a timed entry call. The use of this

Cryptographic Properties of Monotone Boolean Functions

DTIC Science & Technology

2016-01-01

Algebraic attacks on stream ciphers with linear feedback, in: Advances in Cryptology (Eurocrypt 2003), Lecture Notes in Comput. Sci. 2656, Springer, Berlin...spectrum, algebraic immu- nity MSC 2010: 06E30, 94C10, 94A60, 11T71, 05E99 || Communicated by: Carlo Blundo 1 Introduction Let F 2 be the prime eld of...7]. For the reader’s convenience, we recall some basic notions below. Any f ∈ Bn can be expressed in algebraic normal form (ANF) as f(x 1 , x 2

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.

Efficient G(sup 4)FET-Based Logic Circuits

NASA Technical Reports Server (NTRS)

Vatan, Farrokh

2008-01-01

A total of 81 optimal logic circuits based on four-gate field-effect transistors (G(sup 4)4FETs) have been designed to implement all Boolean functions of up to three variables. The purpose of this development was to lend credence to the expectation that logic circuits based on G(sup 4)FETs could be more efficient (in the sense that they could contain fewer transistors), relative to functionally equivalent logic circuits based on conventional transistors. A G(sup 4)FET a combination of a junction field-effect transistor (JFET) and a metal oxide/semiconductor field-effect transistor (MOSFET) superimposed in a single silicon island and can therefore be regarded as two transistors sharing the same body. A G(sup 4)FET can also be regarded as a single device having four gates: two side junction-based gates, a top MOS gate, and a back gate activated by biasing of a silicon-on-insulator substrate. Each of these gates can be used to control the conduction characteristics of the transistor; this possibility creates new options for designing analog, radio-frequency, mixed-signal, and digital circuitry. One such option is to design a G(sup 4)FET to function as a three-input NOT-majority gate, which has been shown to be a universal and programmable logic gate. Optimal NOT-majority-gate, G(sup 4)FET-based logic-circuit designs were obtained in a comparative study that also included formulation of functionally equivalent logic circuits based on NOR and NAND gates implemented by use of conventional transistors. In the study, the problem of finding the optimal design for each logic function and each transistor type was solved as an integer-programming optimization problem. Considering all 81 non-equivalent Boolean functions included in the study, it was found that in 63% of the cases, fewer logic gates (and, hence, fewer transistors) would be needed in the G(sup 4)FET-based implementations.

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.

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.

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.

Continuity and Separation in Symmetric Topologies

ERIC Educational Resources Information Center

Harris, J.; Lynch, M.

2007-01-01

In this note, it is shown that in a symmetric topological space, the pairs of sets separated by the topology determine the topology itself. It is then shown that when the codomain is symmetric, functions which separate only those pairs of sets that are already separated are continuous, generalizing a result found by M. Lynch.

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

An alternative approach for modeling strength differential effect in sheet metals with symmetric yield functions

NASA Astrophysics Data System (ADS)

Kurukuri, Srihari; Worswick, Michael J.

2013-12-01

An alternative approach is proposed to utilize symmetric yield functions for modeling the tension-compression asymmetry commonly observed in hcp materials. In this work, the strength differential (SD) effect is modeled by choosing separate symmetric plane stress yield functions (for example, Barlat Yld 2000-2d) for the tension i.e., in the first quadrant of principal stress space, and compression i.e., third quadrant of principal stress space. In the second and fourth quadrants, the yield locus is constructed by adopting interpolating functions between uniaxial tensile and compressive stress states. In this work, different interpolating functions are chosen and the predictive capability of each approach is discussed. The main advantage of this proposed approach is that the yield locus parameters are deterministic and relatively easy to identify when compared to the Cazacu family of yield functions commonly used for modeling SD effect observed in hcp materials.

Quantum Hurwitz numbers and Macdonald polynomials

NASA Astrophysics Data System (ADS)

Harnad, J.

2016-11-01

Parametric families in the center Z(C[Sn]) of the group algebra of the symmetric group are obtained by identifying the indeterminates in the generating function for Macdonald polynomials as commuting Jucys-Murphy elements. Their eigenvalues provide coefficients in the double Schur function expansion of 2D Toda τ-functions of hypergeometric type. Expressing these in the basis of products of power sum symmetric functions, the coefficients may be interpreted geometrically as parametric families of quantum Hurwitz numbers, enumerating weighted branched coverings of the Riemann sphere. Combinatorially, they give quantum weighted sums over paths in the Cayley graph of Sn generated by transpositions. Dual pairs of bases for the algebra of symmetric functions with respect to the scalar product in which the Macdonald polynomials are orthogonal provide both the geometrical and combinatorial significance of these quantum weighted enumerative invariants.

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.

Orientational analysis of planar fibre systems observed as a Poisson shot-noise process.

PubMed

Kärkkäinen, Salme; Lantuéjoul, Christian

2007-10-01

We consider two-dimensional fibrous materials observed as a digital greyscale image. The problem addressed is to estimate the orientation distribution of unobservable thin fibres from a greyscale image modelled by a planar Poisson shot-noise process. The classical stereological approach is not straightforward, because the point intensities of thin fibres along sampling lines may not be observable. For such cases, Kärkkäinen et al. (2001) suggested the use of scaled variograms determined from grey values along sampling lines in several directions. Their method is based on the assumption that the proportion between the scaled variograms and point intensities in all directions of sampling lines is constant. This assumption is proved to be valid asymptotically for Boolean models and dead leaves models, under some regularity conditions. In this work, we derive the scaled variogram and its approximations for a planar Poisson shot-noise process using the modified Bessel function. In the case of reasonable high resolution of the observed image, the scaled variogram has an approximate functional relation to the point intensity, and in the case of high resolution the relation is proportional. As the obtained relations are approximative, they are tested on simulations. The existing orientation analysis method based on the proportional relation is further experimented on images with different resolutions. The new result, the asymptotic proportionality between the scaled variograms and the point intensities for a Poisson shot-noise process, completes the earlier results for the Boolean models and for the dead leaves models.

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.

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.

Time-invariant PT product and phase locking in PT -symmetric lattice models

NASA Astrophysics Data System (ADS)

Joglekar, Yogesh N.; Onanga, Franck Assogba; Harter, Andrew K.

2018-01-01

Over the past decade, non-Hermitian, PT -symmetric Hamiltonians have been investigated as candidates for both a fundamental, unitary, quantum theory and open systems with a nonunitary time evolution. In this paper, we investigate the implications of the former approach in the context of the latter. Motivated by the invariance of the PT (inner) product under time evolution, we discuss the dynamics of wave-function phases in a wide range of PT -symmetric lattice models. In particular, we numerically show that, starting with a random initial state, a universal, gain-site location dependent locking between wave-function phases at adjacent sites occurs in the PT -symmetry-broken region. Our results pave the way towards understanding the physically observable implications of time invariants in the nonunitary dynamics produced by PT -symmetric Hamiltonians.

Brownian motion and thermophoresis effects on Peristaltic slip flow of a MHD nanofluid in a symmetric/asymmetric channel

NASA Astrophysics Data System (ADS)

Sucharitha, G.; Sreenadh, S.; Lakshminarayana, P.; Sushma, K.

2017-11-01

The slip and heat transfer effects on MHD peristaltic transport of a nanofluid in a non-uniform symmetric/asymmetric channel have studied under the assumptions of elongated wave length and negligible Reynolds number. From the simplified governing equations, the closed form solutions for velocity, stream function, temperature and concentrations are obtained. Also dual solutions are discussed for symmetric and asymmetric channel cases. The effects of important physical parameters are explained graphically. The slip parameter decreases the fluid velocity in middle of the channel whereas it increases the velocity at the channel walls. Temperature and concentration are decreasing and increasing functions of radiation parameter respectively. Moreover, velocity, temperature and concentrations are high in symmetric channel when compared with asymmetric channel.

Boolean Logic Tree of Label-Free Dual-Signal Electrochemical Aptasensor System for Biosensing, Three-State Logic Computation, and Keypad Lock Security Operation.

PubMed

Lu, Jiao Yang; Zhang, Xin Xing; Huang, Wei Tao; Zhu, Qiu Yan; Ding, Xue Zhi; Xia, Li Qiu; Luo, Hong Qun; Li, Nian Bing

2017-09-19

The most serious and yet unsolved problems of molecular logic computing consist in how to connect molecular events in complex systems into a usable device with specific functions and how to selectively control branchy logic processes from the cascading logic systems. This report demonstrates that a Boolean logic tree is utilized to organize and connect "plug and play" chemical events DNA, nanomaterials, organic dye, biomolecule, and denaturant for developing the dual-signal electrochemical evolution aptasensor system with good resettability for amplification detection of thrombin, controllable and selectable three-state logic computation, and keypad lock security operation. The aptasensor system combines the merits of DNA-functionalized nanoamplification architecture and simple dual-signal electroactive dye brilliant cresyl blue for sensitive and selective detection of thrombin with a wide linear response range of 0.02-100 nM and a detection limit of 1.92 pM. By using these aforementioned chemical events as inputs and the differential pulse voltammetry current changes at different voltages as dual outputs, a resettable three-input biomolecular keypad lock based on sequential logic is established. Moreover, the first example of controllable and selectable three-state molecular logic computation with active-high and active-low logic functions can be implemented and allows the output ports to assume a high impediment or nothing (Z) state in addition to the 0 and 1 logic levels, effectively controlling subsequent branchy logic computation processes. Our approach is helpful in developing the advanced controllable and selectable logic computing and sensing system in large-scale integration circuits for application in biomedical engineering, intelligent sensing, and control.

Analysis of aminoacids pattern in receptor tyrosine kinase using Boolean association rule.

PubMed

Kalita, Pranjal; Kumar, Brindha Senthil; Krishnaswamy, Soundararajan; Nachimuthu, Senthil Kumar

2012-01-01

Cancers are characterized by unrestricted cell division and independency of growth factor and other external signal responsiveness. Eukaryotic parental cells of tumors, on the other hand, constitute tissues and other higher structures like organs and systems and are capable of performing various functions in a highly co-ordinated fashion. Hence, cancer cells may be considered as entities capable of incessant growth and cell division but lacking any evolutionarily advanced intracellular or intercellular regulation. Since receptor tyrosine kinases are highly altered and exist in deregulated/constitutively active forms in cancer cells - achieved through various epigenetic mechanisms - we hypothesize the functional RTKs in cancer cells to resemble their counterparts in more primitive species. Analysis of RTK sequences of various species and of cancer is, therefore, expected to prove this hypothesis. Association rule in data mining can reveal the hidden biological information. This study utilizes the Boolean association rule to mine the occurrence pattern of glycine, arginine and alanine in receptor tyrosine kinases (RTKs) of invertebrates, vertebrates and cancer related vertebrate RTKs based on protein sequence informations. The results reveal that vertebrate cancer RTKs resembles prokaryotes and invertebrate RTKs showing an increasing trend of glycine, alanine and decreasing trend in arginine composition. The aminoacid compositions of vertebrates: invertebrates: prokaryotes: vertebrate cancer with respect to Glycine (>=6.1) were 42.86: 50.0: 85.71: 100%, Alanine (>=6.2) were 10.72: 66.67: 85.71: 100%, whereas Arginine (>=5.9) were 21.43: 16.67: 14.29: 0%, respectively. In conclusion, results from this study supports our hypothesis that cancer cells may resemble lower organisms since functionally cancer cells are unresponsive to external signals and various regulatory mechanisms typically found in higher eukaryotes are largely absent.

Univariate and multivariate molecular spectral analyses of lipid related molecular structural components in relation to nutrient profile in feed and food mixtures

NASA Astrophysics Data System (ADS)

Abeysekara, Saman; Damiran, Daalkhaijav; Yu, Peiqiang

2013-02-01

The objectives of this study were (i) to determine lipid related molecular structures components (functional groups) in feed combination of cereal grain (barley, Hordeum vulgare) and wheat (Triticum aestivum) based dried distillers grain solubles (wheat DDGSs) from bioethanol processing at five different combination ratios using univariate and multivariate molecular spectral analyses with infrared Fourier transform molecular spectroscopy, and (ii) to correlate lipid-related molecular-functional structure spectral profile to nutrient profiles. The spectral intensity of (i) CH3 asymmetric, CH2 asymmetric, CH3 symmetric and CH2 symmetric groups, (ii) unsaturation (Cdbnd C) group, and (iii) carbonyl ester (Cdbnd O) group were determined. Spectral differences of functional groups were detected by hierarchical cluster analysis (HCA) and principal components analysis (PCA). The results showed that the combination treatments significantly inflicted modifications (P < 0.05) in nutrient profile and lipid related molecular spectral intensity (CH2 asymmetric stretching peak height, CH2 symmetric stretching peak height, ratio of CH2 to CH3 symmetric stretching peak intensity, and carbonyl peak area). Ratio of CH2 to CH3 symmetric stretching peak intensity, and carbonyl peak significantly correlated with nutrient profiles. Both PCA and HCA differentiated lipid-related spectrum. In conclusion, the changes of lipid molecular structure spectral profiles through feed combination could be detected using molecular spectroscopy. These changes were associated with nutrient profiles and functionality.

Characterization of Generalized Young Measures Generated by Symmetric Gradients

NASA Astrophysics Data System (ADS)

De Philippis, Guido; Rindler, Filip

2017-06-01

This work establishes a characterization theorem for (generalized) Young measures generated by symmetric derivatives of functions of bounded deformation (BD) in the spirit of the classical Kinderlehrer-Pedregal theorem. Our result places such Young measures in duality with symmetric-quasiconvex functions with linear growth. The "local" proof strategy combines blow-up arguments with the singular structure theorem in BD (the analogue of Alberti's rank-one theorem in BV), which was recently proved by the authors. As an application of our characterization theorem we show how an atomic part in a BD-Young measure can be split off in generating sequences.

A GPU-based symmetric non-rigid image registration method in human lung.

PubMed

Haghighi, Babak; D Ellingwood, Nathan; Yin, Youbing; Hoffman, Eric A; Lin, Ching-Long

2018-03-01

Quantitative computed tomography (QCT) of the lungs plays an increasing role in identifying sub-phenotypes of pathologies previously lumped into broad categories such as chronic obstructive pulmonary disease and asthma. Methods for image matching and linking multiple lung volumes have proven useful in linking structure to function and in the identification of regional longitudinal changes. Here, we seek to improve the accuracy of image matching via the use of a symmetric multi-level non-rigid registration employing an inverse consistent (IC) transformation whereby images are registered both in the forward and reverse directions. To develop the symmetric method, two similarity measures, the sum of squared intensity difference (SSD) and the sum of squared tissue volume difference (SSTVD), were used. The method is based on a novel generic mathematical framework to include forward and backward transformations, simultaneously, eliminating the need to compute the inverse transformation. Two implementations were used to assess the proposed method: a two-dimensional (2-D) implementation using synthetic examples with SSD, and a multi-core CPU and graphics processing unit (GPU) implementation with SSTVD for three-dimensional (3-D) human lung datasets (six normal adults studied at total lung capacity (TLC) and functional residual capacity (FRC)). Success was evaluated in terms of the IC transformation consistency serving to link TLC to FRC. 2-D registration on synthetic images, using both symmetric and non-symmetric SSD methods, and comparison of displacement fields showed that the symmetric method gave a symmetrical grid shape and reduced IC errors, with the mean values of IC errors decreased by 37%. Results for both symmetric and non-symmetric transformations of human datasets showed that the symmetric method gave better results for IC errors in all cases, with mean values of IC errors for the symmetric method lower than the non-symmetric methods using both SSD and SSTVD. The GPU version demonstrated an average of 43 times speedup and ~5.2 times speedup over the single-threaded and 12-threaded CPU versions, respectively. Run times with the GPU were as fast as 2 min. The symmetric method improved the inverse consistency, aiding the use of image registration in the QCT-based evaluation of the lung.

Multitasking-Pascal extensions solve concurrency problems

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

Mackie, P.H.

1982-09-29

To avoid deadlock (one process waiting for a resource than another process can't release) and indefinite postponement (one process being continually denied a resource request) in a multitasking-system application, it is possible to use a high-level development language with built-in concurrency handlers. Parallel Pascal is one such language; it extends standard Pascal via special task synchronizers: a new data type called signal, new system procedures called wait and send and a Boolean function termed awaited. To understand the language's use the author examines the problems it helps solve.

Modeling of High-Quality Factor XNOR Gate Using Quantum-Dot Semiconductor Optical Amplifiers at 1 Tb/s

NASA Astrophysics Data System (ADS)

Kotb, Amer

2015-06-01

The modeling of all-optical logic XNOR gate is realized by a series combination of XOR and INVERT gates. This Boolean function is simulated by using Mach-Zehnder interferometers (MZIs) utilizing quantum-dots semiconductor optical amplifiers (QDs-SOAs). The study is carried out when the effect of amplified spontaneous emission (ASE) is included. The dependence of the output quality factor ( Q-factor) on signals and QDs-SOAs' parameters is also investigated and discussed. The simulation is conducted under a repetition rate of ˜1 Tb/s.

Negative Difference Resistance and Its Application to Construct Boolean Logic Circuits

NASA Astrophysics Data System (ADS)

Nikodem, Maciej; Bawiec, Marek A.; Surmacz, Tomasz R.

Electronic circuits based on nanodevices and quantum effect are the future of logic circuits design. Today's technology allows constructing resonant tunneling diodes, quantum cellular automata and nanowires/nanoribbons that are the elementary components of threshold gates. However, synthesizing a threshold circuit for an arbitrary logic function is still a challenging task where no efficient algorithms exist. This paper focuses on Generalised Threshold Gates (GTG), giving the overview of threshold circuit synthesis methods and presenting an algorithm that considerably simplifies the task in case of GTG circuits.

A symmetric integral identity for Bessel functions with applications to integral geometry

NASA Astrophysics Data System (ADS)

Salman, Yehonatan

2017-12-01

In the article of Kunyansky (Inverse Probl 23(1):373-383, 2007) a symmetric integral identity for Bessel functions of the first and second kind was proved in order to obtain an explicit inversion formula for the spherical mean transform where our data is given on the unit sphere in Rn . The aim of this paper is to prove an analogous symmetric integral identity in case where our data for the spherical mean transform is given on an ellipse E in R2 . For this, we will use the recent results obtained by Cohl and Volkmer (J Phys A Math Theor 45:355204, 2012) for the expansions into eigenfunctions of Bessel functions of the first and second kind in elliptical coordinates.

The vertex operator for a generalization of MacMahon’s formula

NASA Astrophysics Data System (ADS)

Cai, Liqiang; Wang, Lifang; Wu, Ke; Yang, Jie

2015-10-01

We provide a vertex operator realization for a two-parameter generalization of MacMahon’s formula introduced by M. Vuletić [Trans. Amer. Math. Soc. 361, 2789 (2009)]. Since the generalized MacMahon function is the kernel function of some Macdonald symmetric function, we consider the action of two vertex operators on a state corresponding to a Macdonald symmetric function. It becomes evident that the vertex operators appear to be the creation and annihilation operators, respectively on the state.

Complex logic functions implemented with quantum dot bionanophotonic circuits.

PubMed

Claussen, Jonathan C; Hildebrandt, Niko; Susumu, Kimihiro; Ancona, Mario G; Medintz, Igor L

2014-03-26

We combine quantum dots (QDs) with long-lifetime terbium complexes (Tb), a near-IR Alexa Fluor dye (A647), and self-assembling peptides to demonstrate combinatorial and sequential bionanophotonic logic devices that function by time-gated Förster resonance energy transfer (FRET). Upon excitation, the Tb-QD-A647 FRET-complex produces time-dependent photoluminescent signatures from multi-FRET pathways enabled by the capacitor-like behavior of the Tb. The unique photoluminescent signatures are manipulated by ratiometrically varying dye/Tb inputs and collection time. Fluorescent output is converted into Boolean logic states to create complex arithmetic circuits including the half-adder/half-subtractor, 2:1 multiplexer/1:2 demultiplexer, and a 3-digit, 16-combination keypad lock.

Role of Retinocortical Processing in Spatial Vision

DTIC Science & Technology

1989-06-01

its inverse transform . These are even- symmetric functions. Odd-symmetric Gabor functions would also be required for image coding (Daugman, 1987), but...spectrum square; thus its horizontal and vertical scale factors may differ by a power of 2. Since the inverse transform undoes this distor- tion, it has...FIGURE 3 STANDARD FORM OF EVEN GABOR FILTER 7 order to inverse - transform correctly. We used Gabor functions with the standard shape of Daugman’s "polar

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

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

A non-symmetric Yang-Baxter algebra for the quantum nonlinear Schrödinger model

NASA Astrophysics Data System (ADS)

Vlaar, Bart

2013-06-01

We study certain non-symmetric wavefunctions associated with the quantum nonlinear Schrödinger model, introduced by Komori and Hikami using Gutkin’s propagation operator, which involves representations of the degenerate affine Hecke algebra. We highlight how these functions can be generated using a vertex-type operator formalism similar to the recursion defining the symmetric (Bethe) wavefunction in the quantum inverse scattering method. Furthermore, some of the commutation relations encoded in the Yang-Baxter equation for the relevant monodromy matrix are generalized to the non-symmetric case.

Symmetric factorization of the conformation tensor in viscoelastic fluid models

NASA Astrophysics Data System (ADS)

Thomases, Becca; Balci, Nusret; Renardy, Michael; Doering, Charles

2010-11-01

The positive definite symmetric polymer conformation tensor possesses a unique symmetric square root that satisfies a closed evolution equation in the Oldroyd-B and FENE-P models of viscoelastic fluid flow. When expressed in terms of the velocity field and the symmetric square root of the conformation tensor, these models' equations of motion formally constitute an evolution in a Hilbert space with a total energy functional that defines a norm. Moreover, this formulation is easily implemented in direct numerical simulations resulting in significant practical advantages in terms of both accuracy and stability.

Electromyographic Assessment of Functional Symmetry of Paraspinal Muscles during Static Exercises in Adolescents with Idiopathic Scoliosis

PubMed Central

Chwała, Wiesław; Koziana, Agnieszka; Kasperczyk, Tadeusz; Płaszewski, Maciej

2014-01-01

Background. The question of how to correct and rehabilitate scoliosis remains one of the most difficult problems of orthopaedics. Controversies continue to arise regarding various types of both symmetric and asymmetric scoliosis-specific therapeutic exercises. Objective. The aim of the present paper was to conduct an electromyographic assessment of functional symmetry of paraspinal muscles during symmetric and asymmetric exercises in adolescents with idiopathic scoliosis. Materials and Methods. The study was conducted in a group of 82 girls, mean age 12.4 ± 2.3 years with single- or double-major-idiopathic scoliosis, Cobb angle 24 ± 9.4°. The functional biopotentials during isometric work of paraspinal muscles in “at rest” position and during two symmetric and four asymmetric exercises were measured with the use of the Muscle Tester ME 6000 electromyograph. Results. In general, asymmetric exercises were characterised by larger differences in bioelectrical activity of paraspinal muscles, in comparison with symmetric exercises, both in the groups of patients with single-curve and double-curve scoliosis. Conclusion. During symmetric and asymmetric exercises, muscle tension patterns differed significantly in both groups, in comparison with the examination at rest, in most cases generating positive corrective patterns. Asymmetric exercises generated divergent muscle tension patterns on the convex and concave sides of the deformity. PMID:25258713

Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation.

PubMed

Dutta, Sourav; Zografos, Odysseas; Gurunarayanan, Surya; Radu, Iuliana; Soree, Bart; Catthoor, Francky; Naeemi, Azad

2017-12-19

Surface-plasmon-polariton waves propagating at the interface between a metal and a dielectric, hold the key to future high-bandwidth, dense on-chip integrated logic circuits overcoming the diffraction limitation of photonics. While recent advances in plasmonic logic have witnessed the demonstration of basic and universal logic gates, these CMOS oriented digital logic gates cannot fully utilize the expressive power of this novel technology. Here, we aim at unraveling the true potential of plasmonics by exploiting an enhanced native functionality - the majority voter. Contrary to the state-of-the-art plasmonic logic devices, we use the phase of the wave instead of the intensity as the state or computational variable. We propose and demonstrate, via numerical simulations, a comprehensive scheme for building a nanoscale cascadable plasmonic majority logic gate along with a novel referencing scheme that can directly translate the information encoded in the amplitude and phase of the wave into electric field intensity at the output. Our MIM-based 3-input majority gate displays a highly improved overall area of only 0.636 μm 2 for a single-stage compared with previous works on plasmonic logic. The proposed device demonstrates non-Boolean computational capability and can find direct utility in highly parallel real-time signal processing applications like pattern recognition.

Computational methodology to predict satellite system-level effects from impacts of untrackable space debris

NASA Astrophysics Data System (ADS)

Welty, N.; Rudolph, M.; Schäfer, F.; Apeldoorn, J.; Janovsky, R.

2013-07-01

This paper presents a computational methodology to predict the satellite system-level effects resulting from impacts of untrackable space debris particles. This approach seeks to improve on traditional risk assessment practices by looking beyond the structural penetration of the satellite and predicting the physical damage to internal components and the associated functional impairment caused by untrackable debris impacts. The proposed method combines a debris flux model with the Schäfer-Ryan-Lambert ballistic limit equation (BLE), which accounts for the inherent shielding of components positioned behind the spacecraft structure wall. Individual debris particle impact trajectories and component shadowing effects are considered and the failure probabilities of individual satellite components as a function of mission time are calculated. These results are correlated to expected functional impairment using a Boolean logic model of the system functional architecture considering the functional dependencies and redundancies within the system.

A survey of SAT solver

NASA Astrophysics Data System (ADS)

Gong, Weiwei; Zhou, Xu

2017-06-01

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

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

NASA Technical Reports Server (NTRS)

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

1990-01-01

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

Analytical expression for a class of spherically symmetric solutions in Lorentz-breaking massive gravity

NASA Astrophysics Data System (ADS)

Li, Ping; Li, Xin-zhou; Xi, Ping

2016-06-01

We present a detailed study of the spherically symmetric solutions in Lorentz-breaking massive gravity. There is an undetermined function { F }(X,{w}1,{w}2,{w}3) in the action of Stückelberg fields {S}φ ={{{Λ }}}4\\int {{{d}}}4x\\sqrt{-g}{ F }, which should be resolved through physical means. In general relativity, the spherically symmetric solution to the Einstein equation is a benchmark and its massive deformation also plays a crucial role in Lorentz-breaking massive gravity. { F } will satisfy the constraint equation {T}01=0 from the spherically symmetric Einstein tensor {G}01=0, if we maintain that any reasonable physical theory should possess the spherically symmetric solutions. The Stückelberg field {φ }i is taken as a ‘hedgehog’ configuration {φ }i=φ (r){x}i/r, whose stability is guaranteed by the topological one. Under this ansätz, {T}01=0 is reduced to d{ F }=0. The functions { F } for d{ F }=0 form a commutative ring {R}{ F }. We obtain an expression of the solution to the functional differential equation with spherical symmetry if { F }\\in {R}{ F }. If { F }\\in {R}{ F } and \\partial { F }/\\partial X=0, the functions { F } form a subring {S}{ F }\\subset {R}{ F }. We show that the metric is Schwarzschild, Schwarzschild-AdS or Schwarzschild-dS if { F }\\in {S}{ F }. When { F }\\in {R}{ F } but { F }\

Univariate and multivariate molecular spectral analyses of lipid related molecular structural components in relation to nutrient profile in feed and food mixtures.

PubMed

Abeysekara, Saman; Damiran, Daalkhaijav; Yu, Peiqiang

2013-02-01

The objectives of this study were (i) to determine lipid related molecular structures components (functional groups) in feed combination of cereal grain (barley, Hordeum vulgare) and wheat (Triticum aestivum) based dried distillers grain solubles (wheat DDGSs) from bioethanol processing at five different combination ratios using univariate and multivariate molecular spectral analyses with infrared Fourier transform molecular spectroscopy, and (ii) to correlate lipid-related molecular-functional structure spectral profile to nutrient profiles. The spectral intensity of (i) CH(3) asymmetric, CH(2) asymmetric, CH(3) symmetric and CH(2) symmetric groups, (ii) unsaturation (CC) group, and (iii) carbonyl ester (CO) group were determined. Spectral differences of functional groups were detected by hierarchical cluster analysis (HCA) and principal components analysis (PCA). The results showed that the combination treatments significantly inflicted modifications (P<0.05) in nutrient profile and lipid related molecular spectral intensity (CH(2) asymmetric stretching peak height, CH(2) symmetric stretching peak height, ratio of CH(2) to CH(3) symmetric stretching peak intensity, and carbonyl peak area). Ratio of CH(2) to CH(3) symmetric stretching peak intensity, and carbonyl peak significantly correlated with nutrient profiles. Both PCA and HCA differentiated lipid-related spectrum. In conclusion, the changes of lipid molecular structure spectral profiles through feed combination could be detected using molecular spectroscopy. These changes were associated with nutrient profiles and functionality. Copyright © 2012 Elsevier B.V. All rights reserved.

Weakly Interacting Symmetric and Anti-Symmetric States in the Bilayer Systems

NASA Astrophysics Data System (ADS)

Marchewka, M.; Sheregii, E. M.; Tralle, I.; Tomaka, G.; Ploch, D.

We have studied the parallel magneto-transport in DQW-structures of two different potential shapes: quasi-rectangular and quasi-triangular. The quantum beats effect was observed in Shubnikov-de Haas (SdH) oscillations for both types of the DQW structures in perpendicular magnetic filed arrangement. We developed a special scheme for the Landau levels energies calculation by means of which we carried out the necessary simulations of beating effect. In order to obtain the agreement between our experimental data and the results of simulations, we introduced two different quasi-Fermi levels which characterize symmetric and anti-symmetric states in DQWs. The existence of two different quasi Fermi-Levels simply means, that one can treat two sub-systems (charge carriers characterized by symmetric and anti-symmetric wave functions) as weakly interacting and having their own rate of establishing the equilibrium state.

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.

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.

Left ventricular dimensions, systolic functions, and mass in term neonates with symmetric and asymmetric intrauterine growth restriction.

PubMed

Cinar, Bahar; Sert, Ahmet; Gokmen, Zeynel; Aypar, Ebru; Aslan, Eyup; Odabas, Dursun

2015-02-01

Previous studies have demonstrated structural changes in the heart and cardiac dysfunction in foetuses with intrauterine growth restriction. There are no available data that evaluated left ventricular dimensions and mass in neonates with symmetric and asymmetric intrauterine growth restriction. Therefore, we aimed to evaluate left ventricular dimensions, systolic functions, and mass in neonates with symmetric and asymmetric intrauterine growth restriction. We also assessed associated maternal risk factors, and compared results with healthy appropriate for gestational age neonates. In all, 62 asymmetric intrauterine growth restriction neonates, 39 symmetric intrauterine growth restriction neonates, and 50 healthy appropriate for gestational age neonates were evaluated by transthoracic echocardiography. The asymmetric intrauterine growth restriction group had significantly lower left ventricular end-systolic and end-diastolic diameters and posterior wall diameter in systole and diastole than the control group. The symmetric intrauterine growth restriction group had significantly lower left ventricular end-diastolic diameter than the control group. All left ventricular dimensions were lower in the asymmetric intrauterine growth restriction neonates compared with symmetric intrauterine growth restriction neonates (p>0.05), but not statistically significant except left ventricular posterior wall diameter in diastole (3.08±0.83 mm versus 3.54 ±0.72 mm) (p<0.05). Both symmetric and asymmetric intrauterine growth restriction groups had significantly lower relative posterior wall thickness (0.54±0.19 versus 0.48±0.13 versus 0.8±0.12), left ventricular mass (9.8±4.3 g versus 8.9±3.4 g versus 22.2±5.7 g), and left ventricular mass index (63.6±29.1 g/m2 versus 54.5±24.4 g/m2 versus 109±28.8 g/m2) when compared with the control group. Our study has demonstrated that although neonates with both symmetric and asymmetric intrauterine growth restriction had lower left ventricular dimensions, relative posterior wall thickness, left ventricular mass, and mass index when compared with appropriate for gestational age neonates, left ventricular systolic functions were found to be preserved. In our study, low socio-economic level, short maternal stature, and low maternal weight were found to be risk factors to develop intrauterine growth restriction. To our knowledge, our study is the first to evaluate left ventricular dimensions, wall thicknesses, mass, and systolic functions in neonates with intrauterine growth restriction and compare results with respect to asymmetric or symmetric subgroups.

Dual-mode characteristics of the Buneman instability in a bounded slab plasma

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

Hong, Woo-Pyo; Jung, Young-Dae, E-mail: ydjung@hanyang.ac.kr; Department of Applied Physics and Department of Bionanotechnology, Hanyang University, Ansan, Kyunggi-Do 426-791

2015-06-15

The dual-mode characteristics of the Buneman instability are investigated in a slab plasma, including the geometric effects. The dual symmetric and anti-symmetric dispersion modes of the Buneman instability are obtained by the plasma dielectric function with the spectral reflection conditions for the slab geometry. The result shows that the magnitudes of the growth rate for the symmetric mode are always greater than those for the anti-symmetric mode. It is also found that the geometric effect suppresses the position of the maximum growth rate for the Buneman instability in bounded slab plasmas since the maximum conditions for the symmetric and anti-symmetricmore » modes of the Buneman instability are given by 0.60« less

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.

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.

An operator calculus for surface and volume modeling

NASA Technical Reports Server (NTRS)

Gordon, W. J.

1984-01-01

The mathematical techniques which form the foundation for most of the surface and volume modeling techniques used in practice are briefly described. An outline of what may be termed an operator calculus for the approximation and interpolation of functions of more than one independent variable is presented. By considering the linear operators associated with bivariate and multivariate interpolation/approximation schemes, it is shown how they can be compounded by operator multiplication and Boolean addition to obtain a distributive lattice of approximation operators. It is then demonstrated via specific examples how this operator calculus leads to practical techniques for sculptured surface and volume modeling.

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

NASA Technical Reports Server (NTRS)

Marchionini, Gary; Barlow, Diane

1994-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2009-08-01

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

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

PubMed

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

2009-08-01

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

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

NASA Astrophysics Data System (ADS)

Ramskill, Nicholas P.; Wang, Mi

2011-10-01

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

Structure and Function in Homodimeric Enzymes: Simulations of Cooperative and Independent Functional Motions.

PubMed

Wells, Stephen A; van der Kamp, Marc W; McGeagh, John D; Mulholland, Adrian J

2015-01-01

Large-scale conformational change is a common feature in the catalytic cycles of enzymes. Many enzymes function as homodimers with active sites that contain elements from both chains. Symmetric and anti-symmetric cooperative motions in homodimers can potentially lead to correlated active site opening and/or closure, likely to be important for ligand binding and release. Here, we examine such motions in two different domain-swapped homodimeric enzymes: the DcpS scavenger decapping enzyme and citrate synthase. We use and compare two types of all-atom simulations: conventional molecular dynamics simulations to identify physically meaningful conformational ensembles, and rapid geometric simulations of flexible motion, biased along normal mode directions, to identify relevant motions encoded in the protein structure. The results indicate that the opening/closure motions are intrinsic features of both unliganded enzymes. In DcpS, conformational change is dominated by an anti-symmetric cooperative motion, causing one active site to close as the other opens; however a symmetric motion is also significant. In CS, we identify that both symmetric (suggested by crystallography) and asymmetric motions are features of the protein structure, and as a result the behaviour in solution is largely non-cooperative. The agreement between two modelling approaches using very different levels of theory indicates that the behaviours are indeed intrinsic to the protein structures. Geometric simulations correctly identify and explore large amplitudes of motion, while molecular dynamics simulations indicate the ranges of motion that are energetically feasible. Together, the simulation approaches are able to reveal unexpected functionally relevant motions, and highlight differences between enzymes.

Structure and Function in Homodimeric Enzymes: Simulations of Cooperative and Independent Functional Motions

PubMed Central

McGeagh, John D.; Mulholland, Adrian J.

2015-01-01

Large-scale conformational change is a common feature in the catalytic cycles of enzymes. Many enzymes function as homodimers with active sites that contain elements from both chains. Symmetric and anti-symmetric cooperative motions in homodimers can potentially lead to correlated active site opening and/or closure, likely to be important for ligand binding and release. Here, we examine such motions in two different domain-swapped homodimeric enzymes: the DcpS scavenger decapping enzyme and citrate synthase. We use and compare two types of all-atom simulations: conventional molecular dynamics simulations to identify physically meaningful conformational ensembles, and rapid geometric simulations of flexible motion, biased along normal mode directions, to identify relevant motions encoded in the protein structure. The results indicate that the opening/closure motions are intrinsic features of both unliganded enzymes. In DcpS, conformational change is dominated by an anti-symmetric cooperative motion, causing one active site to close as the other opens; however a symmetric motion is also significant. In CS, we identify that both symmetric (suggested by crystallography) and asymmetric motions are features of the protein structure, and as a result the behaviour in solution is largely non-cooperative. The agreement between two modelling approaches using very different levels of theory indicates that the behaviours are indeed intrinsic to the protein structures. Geometric simulations correctly identify and explore large amplitudes of motion, while molecular dynamics simulations indicate the ranges of motion that are energetically feasible. Together, the simulation approaches are able to reveal unexpected functionally relevant motions, and highlight differences between enzymes. PMID:26241964

Development of New Open-Shell Perturbation and Coupled-Cluster Theories Based on Symmetric Spin Orbitals

NASA Technical Reports Server (NTRS)

Lee, Timothy J.; Arnold, James O. (Technical Monitor)

1994-01-01

A new spin orbital basis is employed in the development of efficient open-shell coupled-cluster and perturbation theories that are based on a restricted Hartree-Fock (RHF) reference function. The spin orbital basis differs from the standard one in the spin functions that are associated with the singly occupied spatial orbital. The occupied orbital (in the spin orbital basis) is assigned the delta(+) = 1/square root of 2(alpha+Beta) spin function while the unoccupied orbital is assigned the delta(-) = 1/square root of 2(alpha-Beta) spin function. The doubly occupied and unoccupied orbitals (in the reference function) are assigned the standard alpha and Beta spin functions. The coupled-cluster and perturbation theory wave functions based on this set of "symmetric spin orbitals" exhibit much more symmetry than those based on the standard spin orbital basis. This, together with interacting space arguments, leads to a dramatic reduction in the computational cost for both coupled-cluster and perturbation theory. Additionally, perturbation theory based on "symmetric spin orbitals" obeys Brillouin's theorem provided that spin and spatial excitations are both considered. Other properties of the coupled-cluster and perturbation theory wave functions and models will be discussed.

On the Decay of Correlations in Non-Analytic SO(n)-Symmetric Models

NASA Astrophysics Data System (ADS)

Naddaf, Ali

We extend the method of complex translations which was originally employed by McBryan-Spencer [2] to obtain a decay rate for the two point function in two-dimensional SO(n)-symmetric models with non-analytic Hamiltonians for $.

Symmetric functions and wavefunctions of XXZ-type six-vertex models and elliptic Felderhof models by Izergin-Korepin analysis

NASA Astrophysics Data System (ADS)

Motegi, Kohei

2018-05-01

We present a method to analyze the wavefunctions of six-vertex models by extending the Izergin-Korepin analysis originally developed for domain wall boundary partition functions. First, we apply the method to the case of the basic wavefunctions of the XXZ-type six-vertex model. By giving the Izergin-Korepin characterization of the wavefunctions, we show that these wavefunctions can be expressed as multiparameter deformations of the quantum group deformed Grothendieck polynomials. As a second example, we show that the Izergin-Korepin analysis is effective for analysis of the wavefunctions for a triangular boundary and present the explicit forms of the symmetric functions representing these wavefunctions. As a third example, we apply the method to the elliptic Felderhof model which is a face-type version and an elliptic extension of the trigonometric Felderhof model. We show that the wavefunctions can be expressed as one-parameter deformations of an elliptic analog of the Vandermonde determinant and elliptic symmetric functions.

A method to measure the presampling MTF in digital radiography using Wiener deconvolution

NASA Astrophysics Data System (ADS)

Zhou, Zhongxing; Zhu, Qingzhen; Gao, Feng; Zhao, Huijuan; Zhang, Lixin; Li, Guohui

2013-03-01

We developed a novel method for determining the presampling modulation transfer function (MTF) of digital radiography systems from slanted edge images based on Wiener deconvolution. The degraded supersampled edge spread function (ESF) was obtained from simulated slanted edge images with known MTF in the presence of poisson noise, and its corresponding ideal ESF without degration was constructed according to its central edge position. To meet the requirements of the absolute integrable condition of Fourier transformation, the origianl ESFs were mirrored to construct the symmetric pattern of ESFs. Then based on Wiener deconvolution technique, the supersampled line spread function (LSF) could be acquired from the symmetric pattern of degraded supersampled ESFs in the presence of ideal symmetric ESFs and system noise. The MTF is then the normalized magnitude of the Fourier transform of the LSF. The determined MTF showed a strong agreement with the theoritical true MTF when appropriated Wiener parameter was chosen. The effects of Wiener parameter value and the width of square-like wave peak in symmetric ESFs were illustrated and discussed. In conclusion, an accurate and simple method to measure the presampling MTF was established using Wiener deconvolution technique according to slanted edge images.

Video rate morphological processor based on a redundant number representation

NASA Astrophysics Data System (ADS)

Kuczborski, Wojciech; Attikiouzel, Yianni; Crebbin, Gregory A.

1992-03-01

This paper presents a video rate morphological processor for automated visual inspection of printed circuit boards, integrated circuit masks, and other complex objects. Inspection algorithms are based on gray-scale mathematical morphology. Hardware complexity of the known methods of real-time implementation of gray-scale morphology--the umbra transform and the threshold decomposition--has prompted us to propose a novel technique which applied an arithmetic system without carrying propagation. After considering several arithmetic systems, a redundant number representation has been selected for implementation. Two options are analyzed here. The first is a pure signed digit number representation (SDNR) with the base of 4. The second option is a combination of the base-2 SDNR (to represent gray levels of images) and the conventional twos complement code (to represent gray levels of structuring elements). Operation principle of the morphological processor is based on the concept of the digit level systolic array. Individual processing units and small memory elements create a pipeline. The memory elements store current image windows (kernels). All operation primitives of processing units apply a unified direction of digit processing: most significant digit first (MSDF). The implementation technology is based on the field programmable gate arrays by Xilinx. This paper justified the rationality of a new approach to logic design, which is the decomposition of Boolean functions instead of Boolean minimization.

Optical Neural Classification Of Binary Patterns

NASA Astrophysics Data System (ADS)

Gustafson, Steven C.; Little, Gordon R.

1988-05-01

Binary pattern classification that may be implemented using optical hardware and neural network algorithms is considered. Pattern classification problems that have no concise description (as in classifying handwritten characters) or no concise computation (as in NP-complete problems) are expected to be particularly amenable to this approach. For example, optical processors that efficiently classify binary patterns in accordance with their Boolean function complexity might be designed. As a candidate for such a design, an optical neural network model is discussed that is designed for binary pattern classification and that consists of an optical resonator with a dynamic multiplex-recorded reflection hologram and a phase conjugate mirror with thresholding and gain. In this model, learning or training examples of binary patterns may be recorded on the hologram such that one bit in each pattern marks the pattern class. Any input pattern, including one with an unknown class or marker bit, will be modified by a large number of parallel interactions with the reflection hologram and nonlinear mirror. After perhaps several seconds and 100 billion interactions, a steady-state pattern may develop with a marker bit that represents a minimum-Boolean-complexity classification of the input pattern. Computer simulations are presented that illustrate progress in understanding the behavior of this model and in developing a processor design that could have commanding and enduring performance advantages compared to current pattern classification techniques.

Reveal, A General Reverse Engineering Algorithm for Inference of Genetic Network Architectures

NASA Technical Reports Server (NTRS)

Liang, Shoudan; Fuhrman, Stefanie; Somogyi, Roland

1998-01-01

Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/output patterns of its variables? We investigated this possibility using binary models of genetic networks. Trajectories, or state transition tables of Boolean nets, resemble time series of gene expression. By systematically analyzing the mutual information between input states and output states, one is able to infer the sets of input elements controlling each element or gene in the network. This process is unequivocal and exact for complete state transition tables. We implemented this REVerse Engineering ALgorithm (REVEAL) in a C program, and found the problem to be tractable within the conditions tested so far. For n = 50 (elements) and k = 3 (inputs per element), the analysis of incomplete state transition tables (100 state transition pairs out of a possible 10(exp 15)) reliably produced the original rule and wiring sets. While this study is limited to synchronous Boolean networks, the algorithm is generalizable to include multi-state models, essentially allowing direct application to realistic biological data sets. The ability to adequately solve the inverse problem may enable in-depth analysis of complex dynamic systems in biology and other fields.

Social interaction as a heuristic for combinatorial optimization problems

NASA Astrophysics Data System (ADS)

Fontanari, José F.

2010-11-01

We investigate the performance of a variant of Axelrod’s model for dissemination of culture—the Adaptive Culture Heuristic (ACH)—on solving an NP-Complete optimization problem, namely, the classification of binary input patterns of size F by a Boolean Binary Perceptron. In this heuristic, N agents, characterized by binary strings of length F which represent possible solutions to the optimization problem, are fixed at the sites of a square lattice and interact with their nearest neighbors only. The interactions are such that the agents’ strings (or cultures) become more similar to the low-cost strings of their neighbors resulting in the dissemination of these strings across the lattice. Eventually the dynamics freezes into a homogeneous absorbing configuration in which all agents exhibit identical solutions to the optimization problem. We find through extensive simulations that the probability of finding the optimal solution is a function of the reduced variable F/N1/4 so that the number of agents must increase with the fourth power of the problem size, N∝F4 , to guarantee a fixed probability of success. In this case, we find that the relaxation time to reach an absorbing configuration scales with F6 which can be interpreted as the overall computational cost of the ACH to find an optimal set of weights for a Boolean binary perceptron, given a fixed probability of success.

Complete all-optical processing polarization-based binary logic gates and optical processors.

PubMed

Zaghloul, Y A; Zaghloul, A R M

2006-10-16

We present a complete all-optical-processing polarization-based binary-logic system, by which any logic gate or processor can be implemented. Following the new polarization-based logic presented in [Opt. Express 14, 7253 (2006)], we develop a new parallel processing technique that allows for the creation of all-optical-processing gates that produce a unique output either logic 1 or 0 only once in a truth table, and those that do not. This representation allows for the implementation of simple unforced OR, AND, XOR, XNOR, inverter, and more importantly NAND and NOR gates that can be used independently to represent any Boolean expression or function. In addition, the concept of a generalized gate is presented which opens the door for reconfigurable optical processors and programmable optical logic gates. Furthermore, the new design is completely compatible with the old one presented in [Opt. Express 14, 7253 (2006)], and with current semiconductor based devices. The gates can be cascaded, where the information is always on the laser beam. The polarization of the beam, and not its intensity, carries the information. The new methodology allows for the creation of multiple-input-multiple-output processors that implement, by itself, any Boolean function, such as specialized or non-specialized microprocessors. Three all-optical architectures are presented: orthoparallel optical logic architecture for all known and unknown binary gates, singlebranch architecture for only XOR and XNOR gates, and the railroad (RR) architecture for polarization optical processors (POP). All the control inputs are applied simultaneously leading to a single time lag which leads to a very-fast and glitch-immune POP. A simple and easy-to-follow step-by-step algorithm is provided for the POP, and design reduction methodologies are briefly discussed. The algorithm lends itself systematically to software programming and computer-assisted design. As examples, designs of all binary gates, multiple-input gates, and sequential and non-sequential Boolean expressions are presented and discussed. The operation of each design is simply understood by a bullet train traveling at the speed of light on a railroad system preconditioned by the crossover states predetermined by the control inputs. The presented designs allow for optical processing of the information eliminating the need to convert it, back and forth, to an electronic signal for processing purposes. All gates with a truth table, including for example Fredkin, Toffoli, testable reversible logic, and threshold logic gates, can be designed and implemented using the railroad architecture. That includes any future gates not known today. Those designs and the quantum gates are not discussed in this paper.

Surface-confined assemblies and polymers for molecular logic.

PubMed

de Ruiter, Graham; van der Boom, Milko E

2011-08-16

Stimuli responsive materials are capable of mimicking the operation characteristics of logic gates such as AND, OR, NOR, and even flip-flops. Since the development of molecular sensors and the introduction of the first AND gate in solution by de Silva in 1993, Molecular (Boolean) Logic and Computing (MBLC) has become increasingly popular. In this Account, we present recent research activities that focus on MBLC with electrochromic polymers and metal polypyridyl complexes on a solid support. Metal polypyridyl complexes act as useful sensors to a variety of analytes in solution (i.e., H(2)O, Fe(2+/3+), Cr(6+), NO(+)) and in the gas phase (NO(x) in air). This information transfer, whether the analyte is present, is based on the reversible redox chemistry of the metal complexes, which are stable up to 200 °C in air. The concurrent changes in the optical properties are nondestructive and fast. In such a setup, the input is directly related to the output and, therefore, can be represented by one-input logic gates. These input-output relationships are extendable for mimicking the diverse functions of essential molecular logic gates and circuits within a set of Boolean algebraic operations. Such a molecular approach towards Boolean logic has yielded a series of proof-of-concept devices: logic gates, multiplexers, half-adders, and flip-flop logic circuits. MBLC is a versatile and, potentially, a parallel approach to silicon circuits: assemblies of these molecular gates can perform a wide variety of logic tasks through reconfiguration of their inputs. Although these developments do not require a semiconductor blueprint, similar guidelines such as signal propagation, gate-to-gate communication, propagation delay, and combinatorial and sequential logic will play a critical role in allowing this field to mature. For instance, gate-to-gate communication by chemical wiring of the gates with metal ions as electron carriers results in the integration of stand-alone systems: the output of one gate is used as the input for another gate. Using the same setup, we were able to display both combinatorial and sequential logic. We have demonstrated MBLC by coupling electrochemical inputs with optical readout, which resulted in various logic architectures built on a redox-active, functionalized surface. Electrochemically operated sequential logic systems such as flip-flops, multivalued logic, and multistate memory could enhance computational power without increasing spatial requirements. Applying multivalued digits in data storage could exponentially increase memory capacity. Furthermore, we evaluate the pros and cons of MBLC and identify targets for future research in this Account. © 2011 American Chemical Society

Cellular Automata Generalized To An Inferential System

NASA Astrophysics Data System (ADS)

Blower, David J.

2007-11-01

Stephen Wolfram popularized elementary one-dimensional cellular automata in his book, A New Kind of Science. Among many remarkable things, he proved that one of these cellular automata was a Universal Turing Machine. Such cellular automata can be interpreted in a different way by viewing them within the context of the formal manipulation rules from probability theory. Bayes's Theorem is the most famous of such formal rules. As a prelude, we recapitulate Jaynes's presentation of how probability theory generalizes classical logic using modus ponens as the canonical example. We emphasize the important conceptual standing of Boolean Algebra for the formal rules of probability manipulation and give an alternative demonstration augmenting and complementing Jaynes's derivation. We show the complementary roles played in arguments of this kind by Bayes's Theorem and joint probability tables. A good explanation for all of this is afforded by the expansion of any particular logic function via the disjunctive normal form (DNF). The DNF expansion is a useful heuristic emphasized in this exposition because such expansions point out where relevant 0s should be placed in the joint probability tables for logic functions involving any number of variables. It then becomes a straightforward exercise to rely on Boolean Algebra, Bayes's Theorem, and joint probability tables in extrapolating to Wolfram's cellular automata. Cellular automata are seen as purely deductive systems, just like classical logic, which probability theory is then able to generalize. Thus, any uncertainties which we might like to introduce into the discussion about cellular automata are handled with ease via the familiar inferential path. Most importantly, the difficult problem of predicting what cellular automata will do in the far future is treated like any inferential prediction problem.

Computer Code for Interpreting 13C NMR Relaxation Measurements with Specific Models of Molecular Motion: The Rigid Isotropic and Symmetric Top Rotor Models and the Flexible Symmetric Top Rotor Model

DTIC Science & Technology

2017-01-01

unlimited. 13. SUPPLEMENTARY NOTES 14. ABSTRACT: Carbon-13 nuclear magnetic resonance (13C NMR) spectroscopy is a powerful technique for...FLEXIBLE SYMMETRIC TOP ROTOR MODEL 1. INTRODUCTION Nuclear magnetic resonance (NMR) spectroscopy is a tremendously powerful technique for...application of NMR spectroscopy concerns the property of molecular motion, which is related to many physical, and even biological, functions of molecules in

The symmetric = ω -semi-classical orthogonal polynomials of class one

NASA Astrophysics Data System (ADS)

Maroni, P.; Mejri, M.

2008-12-01

We give the system of Laguerre-Freud equations associated with the = ω -semi-classical functionals of class one, where = ω is the divided difference operator. This system is solved in the symmetric case. There are essentially two canonical cases. The corresponding integral representations are given.

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.

Introduction to focus issue: quantitative approaches to genetic networks.

PubMed

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

2013-06-01

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

Introduction to Focus Issue: Quantitative Approaches to Genetic Networks

NASA Astrophysics Data System (ADS)

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

2013-06-01

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

Analytical mass formula and nuclear surface properties in the ETF approximation. Part I: symmetric nuclei

NASA Astrophysics Data System (ADS)

Aymard, François; Gulminelli, Francesca; Margueron, Jérôme

2016-08-01

The problem of determination of nuclear surface energy is addressed within the framework of the extended Thomas Fermi (ETF) approximation using Skyrme functionals. We propose an analytical model for the density profiles with variationally determined diffuseness parameters. In this first paper, we consider the case of symmetric nuclei. In this situation, the ETF functional can be exactly integrated, leading to an analytical formula expressing the surface energy as a function of the couplings of the energy functional. The importance of non-local terms is stressed and it is shown that they cannot be deduced simply from the local part of the functional, as it was suggested in previous works.

Generation of three-dimensional delaunay meshes from weakly structured and inconsistent data

NASA Astrophysics Data System (ADS)

Garanzha, V. A.; Kudryavtseva, L. N.

2012-03-01

A method is proposed for the generation of three-dimensional tetrahedral meshes from incomplete, weakly structured, and inconsistent data describing a geometric model. The method is based on the construction of a piecewise smooth scalar function defining the body so that its boundary is the zero isosurface of the function. Such implicit description of three-dimensional domains can be defined analytically or can be constructed from a cloud of points, a set of cross sections, or a "soup" of individual vertices, edges, and faces. By applying Boolean operations over domains, simple primitives can be combined with reconstruction results to produce complex geometric models without resorting to specialized software. Sharp edges and conical vertices on the domain boundary are reproduced automatically without using special algorithms. Refs. 42. Figs. 25.

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.

Microelectromechanical reprogrammable logic device.

PubMed

Hafiz, M A A; Kosuru, L; Younis, M I

2016-03-29

In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.

Microelectromechanical reprogrammable logic device

PubMed Central

Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.

2016-01-01

In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme. PMID:27021295

Mapping hemispheric symmetries, relative asymmetries, and absolute asymmetries underlying the auditory laterality effect.

PubMed

Westerhausen, René; Kompus, Kristiina; Hugdahl, Kenneth

2014-01-01

Functional hemispheric differences for speech and language processing have been traditionally studied by using verbal dichotic-listening paradigms. The commonly observed right-ear preference for the report of dichotically presented syllables is taken to reflect the left hemispheric dominance for speech processing. However, the results of recent functional imaging studies also show that both hemispheres - not only the left - are engaged by dichotic listening, suggesting a more complex relationship between behavioral laterality and functional hemispheric activation asymmetries. In order to more closely examine the hemispheric differences underlying dichotic-listening performance, we report an analysis of functional magnetic resonance imaging (fMRI) data of 104 right-handed subjects, for the first time combining an interhemispheric difference and conjunction analysis. This approach allowed for a distinction of homotopic brain regions which showed symmetrical (i.e., brain region significantly activated in both hemispheres and no activation difference between the hemispheres), relative asymmetrical (i.e., activated in both hemispheres but significantly stronger in one than the other hemisphere), and absolute asymmetrical activation patterns (i.e., activated only in one hemisphere and this activation is significantly stronger than in the other hemisphere). Symmetrical activation was found in large clusters encompassing temporal, parietal, inferior frontal, and medial superior frontal regions. Relative and absolute left-ward asymmetries were found in the posterior superior temporal gyrus, located adjacent to symmetrically activated areas, and creating a lateral-medial gradient from symmetrical towards absolute asymmetrical activation within the peri-Sylvian region. Absolute leftward asymmetry was also found in the post-central and medial superior frontal gyri, while rightward asymmetries were found in middle temporal and middle frontal gyri. We conclude that dichotic listening engages a bihemispheric cortical network, showing a symmetrical and mostly leftward asymmetrical pattern. The here obtained functional (a)symmetry map might serve as a basis for future studies which - by studying the relevance of the here identified regions - clarify the relationship between behavioral laterality measures and hemispheric asymmetry. © 2013 Elsevier Inc. All rights reserved.

On the composition of an arbitrary collection of SU(2) spins: an enumerative combinatoric approach

NASA Astrophysics Data System (ADS)

Gyamfi, J. A.; Barone, V.

2018-03-01

The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (Stanley 2011 Enumerative Combinatorics (Cambridge Studies in Advanced Mathematics vol 1) (Cambridge: Cambridge University Press)) is a natural setting for spin composition, and easily leads to very general analytic formulae—many of which hitherto not present in the literature. Based on it, we propose three general methods for computing spin multiplicities; namely, (1) the multi-restricted composition, (2) the generalized binomial and (3) the generating function methods. Symmetric and anti-symmetric compositions of SU(2) spins are also discussed, using generating functions. Of particular importance is the observation that while the common Clebsch-Gordan decomposition—which considers the spins as distinguishable—is related to integer compositions, the symmetric and anti-symmetric compositions (where one considers the spins as indistinguishable) are obtained considering integer partitions. The integers in question here are none other than the occupation numbers of the Holstein-Primakoff bosons. The pervasiveness of q-analogues in our approach is a testament to the fundamental role they play in spin compositions. In the appendix, some new results in the power series representation of Gaussian polynomials (or q-binomial coefficients)—relevant to symmetric and antisymmetric compositions—are presented.

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.

Simulation model for a seven-phase BLDCM drive system

NASA Astrophysics Data System (ADS)

Park, Sang-Hoon; Lee, Won-Cheol; Lee, Jung-Hyo; Yu, Jae-Sung; Kim, Gyu-Sik; Won, Chung-Yuen

2007-12-01

BLDC motors have many advantages over brushed DC motors and induction motors. So, BLDC motors extend their application to many industrial fields. In this paper, the digital simulation and modeling of a 7-phase brushless DC motor have been presented. The 14-switch inverter and a 7-phase brushless DC motor drive system are simulated using hysteresis current controller and logic of switching pattern with the Boolean¡s function. Through some simulations, we found that our modeling and analysis of a 7-phase BLDCM with PWM inverter would be helpful for the further studies of the multi-phase BLDCM drive systems.

Nonlinear dynamics based digital logic and circuits.

PubMed

Kia, Behnam; Lindner, John F; Ditto, William L

2015-01-01

We discuss the role and importance of dynamics in the brain and biological neural networks and argue that dynamics is one of the main missing elements in conventional Boolean logic and circuits. We summarize a simple dynamics based computing method, and categorize different techniques that we have introduced to realize logic, functionality, and programmability. We discuss the role and importance of coupled dynamics in networks of biological excitable cells, and then review our simple coupled dynamics based method for computing. In this paper, for the first time, we show how dynamics can be used and programmed to implement computation in any given base, including but not limited to base two.

Singular vectors for the WN algebras

NASA Astrophysics Data System (ADS)

Ridout, David; Siu, Steve; Wood, Simon

2018-03-01

In this paper, we use free field realisations of the A-type principal, or Casimir, WN algebras to derive explicit formulae for singular vectors in Fock modules. These singular vectors are constructed by applying screening operators to Fock module highest weight vectors. The action of the screening operators is then explicitly evaluated in terms of Jack symmetric functions and their skew analogues. The resulting formulae depend on sequences of pairs of integers that completely determine the Fock module as well as the Jack symmetric functions.

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

NASA Technical Reports Server (NTRS)

Bart, Timothy J.; Kutler, Paul (Technical Monitor)

1998-01-01

Chapter 1 briefly reviews several related topics associated with the symmetrization of systems of conservation laws and quasi-conservation laws: (1) Basic Entropy Symmetrization Theory; (2) Symmetrization and eigenvector scaling; (3) Symmetrization of the compressible Navier-Stokes equations; and (4) Symmetrization of the quasi-conservative form of the magnetohydrodynamic (MHD) equations. Chapter 2 describes one of the best known tools employed in the study of differential equations, the maximum principle: any function f(x) which satisfies the inequality f(double prime)>0 on the interval [a,b] attains its maximum value at one of the endpoints on the interval. Chapter three examines the upwind finite volume schemes for scalar and system conservation laws. The basic tasks in the upwind finite volume approach have already been presented: reconstruction, flux evaluation, and evolution. By far, the most difficult task in this process is the reconstruction step.

Implementing a quantum cloning machine in separate cavities via the optical coherent pulse as a quantum communication bus

NASA Astrophysics Data System (ADS)

Zhu, Meng-Zheng; Ye, Liu

2015-04-01

An efficient scheme is proposed to implement a quantum cloning machine in separate cavities based on a hybrid interaction between electron-spin systems placed in the cavities and an optical coherent pulse. The coefficient of the output state for the present cloning machine is just the direct product of two trigonometric functions, which ensures that different types of quantum cloning machine can be achieved readily in the same framework by appropriately adjusting the rotated angles. The present scheme can implement optimal one-to-two symmetric (asymmetric) universal quantum cloning, optimal symmetric (asymmetric) phase-covariant cloning, optimal symmetric (asymmetric) real-state cloning, optimal one-to-three symmetric economical real-state cloning, and optimal symmetric cloning of qubits given by an arbitrary axisymmetric distribution. In addition, photon loss of the qubus beams during the transmission and decoherence effects caused by such a photon loss are investigated.

Circularly-symmetric complex normal ratio distribution for scalar transmissibility functions. Part I: Fundamentals

NASA Astrophysics Data System (ADS)

Yan, Wang-Ji; Ren, Wei-Xin

2016-12-01

Recent advances in signal processing and structural dynamics have spurred the adoption of transmissibility functions in academia and industry alike. Due to the inherent randomness of measurement and variability of environmental conditions, uncertainty impacts its applications. This study is focused on statistical inference for raw scalar transmissibility functions modeled as complex ratio random variables. The goal is achieved through companion papers. This paper (Part I) is dedicated to dealing with a formal mathematical proof. New theorems on multivariate circularly-symmetric complex normal ratio distribution are proved on the basis of principle of probabilistic transformation of continuous random vectors. The closed-form distributional formulas for multivariate ratios of correlated circularly-symmetric complex normal random variables are analytically derived. Afterwards, several properties are deduced as corollaries and lemmas to the new theorems. Monte Carlo simulation (MCS) is utilized to verify the accuracy of some representative cases. This work lays the mathematical groundwork to find probabilistic models for raw scalar transmissibility functions, which are to be expounded in detail in Part II of this study.

Method for assessing motor insulation on operating motors

DOEpatents

Kueck, John D.; Otaduy, Pedro J.

1997-01-01

A method for monitoring the condition of electrical-motor-driven devices. The method is achieved by monitoring electrical variables associated with the functioning of an operating motor, applying these electrical variables to a three phase equivalent circuit and determining non-symmetrical faults in the operating motor based upon symmetrical components analysis techniques.

Existence and uniqueness of weak solutions of the compressible spherically symmetric Navier-Stokes equations

NASA Astrophysics Data System (ADS)

Huang, Xiangdi

2017-02-01

One of the most influential fundamental tools in harmonic analysis is the Riesz transforms. It maps Lp functions to Lp functions for any p ∈ (1 , ∞) which plays an important role in singular operators. As an application in fluid dynamics, the norm equivalence between ‖∇u‖Lp and ‖ div u ‖ Lp +‖ curl u ‖ Lp is well established for p ∈ (1 , ∞). However, since Riesz operators sent bounded functions only to BMO functions, there is no hope to bound ‖∇u‖L∞ in terms of ‖ div u ‖ L∞ +‖ curl u ‖ L∞. As pointed out by Hoff (2006) [11], this is the main obstacle to obtain uniqueness of weak solutions for isentropic compressible flows. Fortunately, based on new observations, see Lemma 2.2, we derive an exact estimate for ‖∇u‖L∞ ≤ (2 + 1 / N)‖ div u ‖ L∞ for any N-dimensional radially symmetric vector functions u. As a direct application, we give an affirmative answer to the open problem of uniqueness of some weak solutions to the compressible spherically symmetric flows in a bounded ball.

Matching Pursuit with Asymmetric Functions for Signal Decomposition and Parameterization

PubMed Central

Spustek, Tomasz; Jedrzejczak, Wiesław Wiktor; Blinowska, Katarzyna Joanna

2015-01-01

The method of adaptive approximations by Matching Pursuit makes it possible to decompose signals into basic components (called atoms). The approach relies on fitting, in an iterative way, functions from a large predefined set (called dictionary) to an analyzed signal. Usually, symmetric functions coming from the Gabor family (sine modulated Gaussian) are used. However Gabor functions may not be optimal in describing waveforms present in physiological and medical signals. Many biomedical signals contain asymmetric components, usually with a steep rise and slower decay. For the decomposition of this kind of signal we introduce a dictionary of functions of various degrees of asymmetry – from symmetric Gabor atoms to highly asymmetric waveforms. The application of this enriched dictionary to Otoacoustic Emissions and Steady-State Visually Evoked Potentials demonstrated the advantages of the proposed method. The approach provides more sparse representation, allows for correct determination of the latencies of the components and removes the "energy leakage" effect generated by symmetric waveforms that do not sufficiently match the structures of the analyzed signal. Additionally, we introduced a time-frequency-amplitude distribution that is more adequate for representation of asymmetric atoms than the conventional time-frequency-energy distribution. PMID:26115480

Work-function calculations for a symmetrical total-charge-density profile at the metallic surface

NASA Astrophysics Data System (ADS)

Wojciechowski, K. F.; Sobańska-Nowotnik, M.

1983-07-01

It is shown that, if the total-charge-density profile nT(x) at the surface of jellium satisfies the Budd-Vannimenus constraint and also is a symmetrical function of x, relative to the ordinate axis, then the work-function variation versus the Wigner-Seitz radius rs does not depend on the form of nT(x). Also the simple linear-density profile is used to calculate the work function by application of the variational principle for the energy, including the first and second density-gradient corrections to the kinetic energy and the first gradient correction to the exchange and correlation energy. The results for the work function are in good agreement with the polycrystalline values for low-density metals.

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.

Structural symmetry and protein function.

PubMed

Goodsell, D S; Olson, A J

2000-01-01

The majority of soluble and membrane-bound proteins in modern cells are symmetrical oligomeric complexes with two or more subunits. The evolutionary selection of symmetrical oligomeric complexes is driven by functional, genetic, and physicochemical needs. Large proteins are selected for specific morphological functions, such as formation of rings, containers, and filaments, and for cooperative functions, such as allosteric regulation and multivalent binding. Large proteins are also more stable against denaturation and have a reduced surface area exposed to solvent when compared with many individual, smaller proteins. Large proteins are constructed as oligomers for reasons of error control in synthesis, coding efficiency, and regulation of assembly. Symmetrical oligomers are favored because of stability and finite control of assembly. Several functions limit symmetry, such as interaction with DNA or membranes, and directional motion. Symmetry is broken or modified in many forms: quasisymmetry, in which identical subunits adopt similar but different conformations; pleomorphism, in which identical subunits form different complexes; pseudosymmetry, in which different molecules form approximately symmetrical complexes; and symmetry mismatch, in which oligomers of different symmetries interact along their respective symmetry axes. Asymmetry is also observed at several levels. Nearly all complexes show local asymmetry at the level of side chain conformation. Several complexes have reciprocating mechanisms in which the complex is asymmetric, but, over time, all subunits cycle through the same set of conformations. Global asymmetry is only rarely observed. Evolution of oligomeric complexes may favor the formation of dimers over complexes with higher cyclic symmetry, through a mechanism of prepositioned pairs of interacting residues. However, examples have been found for all of the crystallographic point groups, demonstrating that functional need can drive the evolution of any symmetry.

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.

Spectra, current flow, and wave-function morphology in a model PT -symmetric quantum dot with external interactions

NASA Astrophysics Data System (ADS)

Tellander, Felix; Berggren, Karl-Fredrik

2017-04-01

In this paper we use numerical simulations to study a two-dimensional (2D) quantum dot (cavity) with two leads for passing currents (electrons, photons, etc.) through the system. By introducing an imaginary potential in each lead the system is made symmetric under parity-time inversion (PT symmetric). This system is experimentally realizable in the form of, e.g., quantum dots in low-dimensional semiconductors, optical and electromagnetic cavities, and other classical wave analogs. The computational model introduced here for studying spectra, exceptional points (EPs), wave-function symmetries and morphology, and current flow includes thousands of interacting states. This supplements previous analytic studies of few interacting states by providing more detail and higher resolution. The Hamiltonian describing the system is non-Hermitian; thus, the eigenvalues are, in general, complex. The structure of the wave functions and probability current densities are studied in detail at and in between EPs. The statistics for EPs is evaluated, and reasons for a gradual dynamical crossover are identified.

A semi-symmetric image encryption scheme based on the function projective synchronization of two hyperchaotic systems

PubMed Central

Li, Jinqing; Qi, Hui; Cong, Ligang; Yang, Huamin

2017-01-01

Both symmetric and asymmetric color image encryption have advantages and disadvantages. In order to combine their advantages and try to overcome their disadvantages, chaos synchronization is used to avoid the key transmission for the proposed semi-symmetric image encryption scheme. Our scheme is a hybrid chaotic encryption algorithm, and it consists of a scrambling stage and a diffusion stage. The control law and the update rule of function projective synchronization between the 3-cell quantum cellular neural networks (QCNN) response system and the 6th-order cellular neural network (CNN) drive system are formulated. Since the function projective synchronization is used to synchronize the response system and drive system, Alice and Bob got the key by two different chaotic systems independently and avoid the key transmission by some extra security links, which prevents security key leakage during the transmission. Both numerical simulations and security analyses such as information entropy analysis, differential attack are conducted to verify the feasibility, security, and efficiency of the proposed scheme. PMID:28910349

Light-Gated Memristor with Integrated Logic and Memory Functions.

PubMed

Tan, Hongwei; Liu, Gang; Yang, Huali; Yi, Xiaohui; Pan, Liang; Shang, Jie; Long, Shibing; Liu, Ming; Wu, Yihong; Li, Run-Wei

2017-11-28

Memristive devices are able to store and process information, which offers several key advantages over the transistor-based architectures. However, most of the two-terminal memristive devices have fixed functions once made and cannot be reconfigured for other situations. Here, we propose and demonstrate a memristive device "memlogic" (memory logic) as a nonvolatile switch of logic operations integrated with memory function in a single light-gated memristor. Based on nonvolatile light-modulated memristive switching behavior, a single memlogic cell is able to achieve optical and electrical mixed basic Boolean logic of reconfigurable "AND", "OR", and "NOT" operations. Furthermore, the single memlogic cell is also capable of functioning as an optical adder and digital-to-analog converter. All the memlogic outputs are memristive for in situ data storage due to the nonvolatile resistive switching and persistent photoconductivity effects. Thus, as a memdevice, the memlogic has potential for not only simplifying the programmable logic circuits but also building memristive multifunctional optoelectronics.

Clean Quantum and Classical Communication Protocols.

PubMed

Buhrman, Harry; Christandl, Matthias; Perry, Christopher; Zuiddam, Jeroen

2016-12-02

By how much must the communication complexity of a function increase if we demand that the parties not only correctly compute the function but also return all registers (other than the one containing the answer) to their initial states at the end of the communication protocol? Protocols that achieve this are referred to as clean and the associated cost as the clean communication complexity. Here we present clean protocols for calculating the inner product of two n-bit strings, showing that (in the absence of preshared entanglement) at most n+3 qubits or n+O(sqrt[n]) bits of communication are required. The quantum protocol provides inspiration for obtaining the optimal method to implement distributed cnot gates in parallel while minimizing the amount of quantum communication. For more general functions, we show that nearly all Boolean functions require close to 2n bits of classical communication to compute and close to n qubits if the parties have access to preshared entanglement. Both of these values are maximal for their respective paradigms.

Characteristics of the surface plasma wave in a self-gravitating magnetized dusty plasma slab

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

Lee, Myoung-Jae; Jung, Young-Dae, E-mail: ydjung@hanyang.ac.kr; Department of Applied Physics and Department of Bionanotechnology, Hanyang University, Ansan, Kyunggi-Do 15588

2015-11-15

The dispersion properties of surface dust ion-acoustic waves in a self-gravitating magnetized dusty plasma slab are investigated. The dispersion relation is derived by using the low-frequency magnetized dusty dielectric function and the surface wave dispersion integral for the slab geometry. We find that the self-gravitating effect suppresses the frequency of surface dust ion-acoustic wave for the symmetric mode in the long wavelength regime, whereas it hardly changes the frequency for the anti-symmetric mode. As the slab thickness and the wave number increase, the surface wave frequency slowly decreases for the symmetric mode but increases significantly for the anti-symmetric mode. Themore » influence of external magnetic field is also investigated in the case of symmetric mode. We find that the strength of the magnetic field enhances the frequency of the symmetric-mode of the surface plasma wave. The increase of magnetic field reduces the self-gravitational effect and thus the self-gravitating collapse may be suppressed and the stability of dusty objects in space is enhanced.« less

Maclaurin symmetric mean operators of linguistic intuitionistic fuzzy numbers and their application to multiple-attribute decision-making

NASA Astrophysics Data System (ADS)

Liu, Peide; Qin, Xiyou

2017-11-01

Linguistic intuitionistic fuzzy number (LIFN) is a special intuitionistic fuzzy number which can more easily describe the vagueness existing in the real decision-making. Maclaurin symmetric mean (MSM) operator has the characteristic of considering the interrelationships among any number of input parameters. In this paper, we extended the MSM operator to the LIFNs and some extended MSM operators for LIFNs were proposed, some new decision-making methods were developed. Firstly, we introduced the definition, score function, properties and operational rules of the LIFNs. Then, we proposed some linguistic intuitionistic fuzzy MSM operators, such as linguistic intuitionistic fuzzy Maclaurin symmetric mean operator, weighted linguistic intuitionistic fuzzy Maclaurin symmetric mean (WLIFMSM) operator, linguistic intuitionistic fuzzy dual Maclaurin symmetric mean operator, weighted linguistic intuitionistic fuzzy dual Maclaurin symmetric mean (WLIFDMSM) operator. In the meantime, we studied some important properties of these operators, and developed some methods based on WLIFMSM operator and WLIFDMSM operator for multi-attribute decision-making. Finally, we use an example to demonstrate the effectiveness of the proposed methods.

Ultrastrong extraordinary transmission and reflection in PT-symmetric Thue-Morse optical waveguide networks.

PubMed

Wu, Jiaye; Yang, Xiangbo

2017-10-30

In this paper, we construct a 1D PT-symmetric Thue-Morse aperiodic optical waveguide network (PTSTMAOWN) and mainly investigate the ultrastrong extraordinary transmission and reflection. We propose an approach to study the photonic modes and solve the problem of calculating photonic modes distributions in aperiodic networks due to the lack of dispersion functions and find that in a PTSTMAOWN there exist more photonic modes and more spontaneous PT-symmetric breaking points, which are quite different from other reported PT-symmetric optical systems. Additionally, we develop a method to sort spontaneous PT-symmetric breaking point zones to seek the strongest extraordinary point and obtain that at this point the strongest extraordinary transmission and reflection arrive at 2.96316 × 10 5 and 1.32761 × 10 5 , respectively, due to the PT-symmetric coupling resonance and the special symmetry pattern of TM networks. These enormous gains are several orders of magnitude larger than the previous results. This optical system may possess potential in designing optical amplifier, optical logic elements in photon computers and ultrasensitive optical switches with ultrahigh monochromatity.

A two-dimensional analytical modeling for channel potential and threshold voltage of short channel triple material symmetrical gate Stack (TMGS) DG-MOSFET

NASA Astrophysics Data System (ADS)

Tripathi, Shweta

2016-10-01

In the present work, a two-dimensional (2D) analytical framework of triple material symmetrical gate stack (TMGS) DG-MOSFET is presented in order to subdue the short channel effects. A lightly doped channel along with triple material gate having different work functions and symmetrical gate stack structure, showcases substantial betterment in quashing short channel effects to a good extent. The device functioning amends in terms of improved exemption to threshold voltage roll-off, thereby suppressing the short channel effects. The encroachments of respective device arguments on the threshold voltage of the proposed structure are examined in detail. The significant outcomes are compared with the numerical simulation data obtained by using 2D ATLAS™ device simulator to affirm and formalize the proposed device structure.

Qualitatively modelling and analysing genetic regulatory networks: a Petri net approach.

PubMed

Steggles, L Jason; Banks, Richard; Shaw, Oliver; Wipat, Anil

2007-02-01

New developments in post-genomic technology now provide researchers with the data necessary to study regulatory processes in a holistic fashion at multiple levels of biological organization. One of the major challenges for the biologist is to integrate and interpret these vast data resources to gain a greater understanding of the structure and function of the molecular processes that mediate adaptive and cell cycle driven changes in gene expression. In order to achieve this biologists require new tools and techniques to allow pathway related data to be modelled and analysed as network structures, providing valuable insights which can then be validated and investigated in the laboratory. We propose a new technique for constructing and analysing qualitative models of genetic regulatory networks based on the Petri net formalism. We take as our starting point the Boolean network approach of treating genes as binary switches and develop a new Petri net model which uses logic minimization to automate the construction of compact qualitative models. Our approach addresses the shortcomings of Boolean networks by providing access to the wide range of existing Petri net analysis techniques and by using non-determinism to cope with incomplete and inconsistent data. The ideas we present are illustrated by a case study in which the genetic regulatory network controlling sporulation in the bacterium Bacillus subtilis is modelled and analysed. The Petri net model construction tool and the data files for the B. subtilis sporulation case study are available at http://bioinf.ncl.ac.uk/gnapn.

Particular transcendent solution of the Ernst system generalized on n fields

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

Leaute, B.; Marcilhacy, G.

A particular solution, a function of a particular form of the fifth Painleve transcendent, of the Ernst system generalized to n fields is determined, which characterizes both the stationary axially symmetric fields, the solution of the Einstein (n-1) Maxwell equations, and one class of axially symmetric static self-dual SU(n+1) Yang--Mills fields.

Method for assessing motor insulation on operating motors

DOEpatents

Kueck, J.D.; Otaduy, P.J.

1997-03-18

A method for monitoring the condition of electrical-motor-driven devices is disclosed. The method is achieved by monitoring electrical variables associated with the functioning of an operating motor, applying these electrical variables to a three phase equivalent circuit and determining non-symmetrical faults in the operating motor based upon symmetrical components analysis techniques. 15 figs.

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

PubMed

Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

2015-11-01

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

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

PubMed

Bandyopadhyay, Sanghamitra; Mallik, Saurav

2018-01-01

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

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

Estimating Shape and Micro-Motion Parameter of Rotationally Symmetric Space Objects from the Infrared Signature

PubMed Central

Wu, Yabei; Lu, Huanzhang; Zhao, Fei; Zhang, Zhiyong

2016-01-01

Shape serves as an important additional feature for space target classification, which is complementary to those made available. Since different shapes lead to different projection functions, the projection property can be regarded as one kind of shape feature. In this work, the problem of estimating the projection function from the infrared signature of the object is addressed. We show that the projection function of any rotationally symmetric object can be approximately represented as a linear combination of some base functions. Based on this fact, the signal model of the emissivity-area product sequence is constructed, which is a particular mathematical function of the linear coefficients and micro-motion parameters. Then, the least square estimator is proposed to estimate the projection function and micro-motion parameters jointly. Experiments validate the effectiveness of the proposed method. PMID:27763500

Functional diversification of duplicated CYC2 clade genes in regulation of inflorescence development in Gerbera hybrida (Asteraceae).

PubMed

Juntheikki-Palovaara, Inka; Tähtiharju, Sari; Lan, Tianying; Broholm, Suvi K; Rijpkema, Anneke S; Ruonala, Raili; Kale, Liga; Albert, Victor A; Teeri, Teemu H; Elomaa, Paula

2014-09-01

The complex inflorescences (capitula) of Asteraceae consist of different types of flowers. In Gerbera hybrida (gerbera), the peripheral ray flowers are bilaterally symmetrical and lack functional stamens while the central disc flowers are more radially symmetrical and hermaphroditic. Proteins of the CYC2 subclade of the CYC/TB1-like TCP domain transcription factors have been recruited several times independently for parallel evolution of bilaterally symmetrical flowers in various angiosperm plant lineages, and have also been shown to regulate flower-type identity in Asteraceae. The CYC2 subclade genes in gerbera show largely overlapping gene expression patterns. At the level of single flowers, their expression domain in petals shows a spatial shift from the dorsal pattern known so far in species with bilaterally symmetrical flowers, suggesting that this change in expression may have evolved after the origin of Asteraceae. Functional analysis indicates that GhCYC2, GhCYC3 and GhCYC4 mediate positional information at the proximal-distal axis of the inflorescence, leading to differentiation of ray flowers, but that they also regulate ray flower petal growth by affecting cell proliferation until the final size and shape of the petals is reached. Moreover, our data show functional diversification for the GhCYC5 gene. Ectopic activation of GhCYC5 increases flower density in the inflorescence, suggesting that GhCYC5 may promote the flower initiation rate during expansion of the capitulum. Our data thus indicate that modification of the ancestral network of TCP factors has, through gene duplications, led to the establishment of new expression domains and to functional diversification. © 2014 The Authors The Plant Journal © 2014 John Wiley & Sons Ltd.

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.

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.

The development of a natural language interface to a geographical information system

NASA Technical Reports Server (NTRS)

Toledo, Sue Walker; Davis, Bruce

1993-01-01

This paper will discuss a two and a half year long project undertaken to develop an English-language interface for the geographical information system GRASS. The work was carried out for NASA by a small business, Netrologic, based in San Diego, California, under Phase 1 and 2 Small Business Innovative Research contracts. We consider here the potential value of this system whose current functionality addresses numerical, categorical and boolean raster layers and includes the display of point sets defined by constraints on one or more layers, answers yes/no and numerical questions, and creates statistical reports. It also handles complex queries and lexical ambiguities, and allows temporarily switching to UNIX or GRASS.

Collective dynamics in heterogeneous networks of neuronal cellular automata

NASA Astrophysics Data System (ADS)

Manchanda, Kaustubh; Bose, Amitabha; Ramaswamy, Ramakrishna

2017-12-01

We examine the collective dynamics of heterogeneous random networks of model neuronal cellular automata. Each automaton has b active states, a single silent state and r - b - 1 refractory states, and can show 'spiking' or 'bursting' behavior, depending on the values of b. We show that phase transitions that occur in the dynamical activity can be related to phase transitions in the structure of Erdõs-Rényi graphs as a function of edge probability. Different forms of heterogeneity allow distinct structural phase transitions to become relevant. We also show that the dynamics on the network can be described by a semi-annealed process and, as a result, can be related to the Boolean Lyapunov exponent.

Measuring Questions: Relevance and its Relation to Entropy

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2004-01-01

The Boolean lattice of logical statements induces the free distributive lattice of questions. Inclusion on this lattice is based on whether one question answers another. Generalizing the zeta function of the question lattice leads to a valuation called relevance or bearing, which is a measure of the degree to which one question answers another. Richard Cox conjectured that this degree can be expressed as a generalized entropy. With the assistance of yet another important result from Janos Acz6l, I show that this is indeed the case; and that the resulting inquiry calculus is a natural generalization of information theory. This approach provides a new perspective of the Principle of Maximum Entropy.

Modeling and implementation of concurrent logic controllers with use of Petri nets, LSMs, and sequent calculus

NASA Astrophysics Data System (ADS)

Tkacz, J.; Bukowiec, A.; Doligalski, M.

2017-08-01

The paper presentes the method of modeling and implementation of concurrent controllers. Concurrent controllers are specified by Petri nets. Then Petri nets are decomposed using symbolic deduction method of analysis. Formal methods like sequent calculus system with considered elements of Thelen's algorithm have been used here. As a result, linked state machines (LSMs) are received. Each FSM is implemented using methods of structural decomposition during process of logic synthesis. The method of multiple encoding of microinstruction has been applied. It leads to decreased number of Boolean function realized by combinational part of FSM. The additional decoder could be implemented with the use of memory blocks.

Multi-enzyme logic network architectures for assessing injuries: digital processing of biomarkers.

PubMed

Halámek, Jan; Bocharova, Vera; Chinnapareddy, Soujanya; Windmiller, Joshua Ray; Strack, Guinevere; Chuang, Min-Chieh; Zhou, Jian; Santhosh, Padmanabhan; Ramirez, Gabriela V; Arugula, Mary A; Wang, Joseph; Katz, Evgeny

2010-12-01

A multi-enzyme biocatalytic cascade processing simultaneously five biomarkers characteristic of traumatic brain injury (TBI) and soft tissue injury (STI) was developed. The system operates as a digital biosensor based on concerted function of 8 Boolean AND logic gates, resulting in the decision about the physiological conditions based on the logic analysis of complex patterns of the biomarkers. The system represents the first example of a multi-step/multi-enzyme biosensor with the built-in logic for the analysis of complex combinations of biochemical inputs. The approach is based on recent advances in enzyme-based biocomputing systems and the present paper demonstrates the potential applicability of biocomputing for developing novel digital biosensor networks.

Boolean and brain-inspired computing using spin-transfer torque devices

NASA Astrophysics Data System (ADS)

Fan, Deliang

Several completely new approaches (such as spintronic, carbon nanotube, graphene, TFETs, etc.) to information processing and data storage technologies are emerging to address the time frame beyond current Complementary Metal-Oxide-Semiconductor (CMOS) roadmap. The high speed magnetization switching of a nano-magnet due to current induced spin-transfer torque (STT) have been demonstrated in recent experiments. Such STT devices can be explored in compact, low power memory and logic design. In order to truly leverage STT devices based computing, researchers require a re-think of circuit, architecture, and computing model, since the STT devices are unlikely to be drop-in replacements for CMOS. The potential of STT devices based computing will be best realized by considering new computing models that are inherently suited to the characteristics of STT devices, and new applications that are enabled by their unique capabilities, thereby attaining performance that CMOS cannot achieve. The goal of this research is to conduct synergistic exploration in architecture, circuit and device levels for Boolean and brain-inspired computing using nanoscale STT devices. Specifically, we first show that the non-volatile STT devices can be used in designing configurable Boolean logic blocks. We propose a spin-memristor threshold logic (SMTL) gate design, where memristive cross-bar array is used to perform current mode summation of binary inputs and the low power current mode spintronic threshold device carries out the energy efficient threshold operation. Next, for brain-inspired computing, we have exploited different spin-transfer torque device structures that can implement the hard-limiting and soft-limiting artificial neuron transfer functions respectively. We apply such STT based neuron (or 'spin-neuron') in various neural network architectures, such as hierarchical temporal memory and feed-forward neural network, for performing "human-like" cognitive computing, which show more than two orders of lower energy consumption compared to state of the art CMOS implementation. Finally, we show the dynamics of injection locked Spin Hall Effect Spin-Torque Oscillator (SHE-STO) cluster can be exploited as a robust multi-dimensional distance metric for associative computing, image/ video analysis, etc. Our simulation results show that the proposed system architecture with injection locked SHE-STOs and the associated CMOS interface circuits can be suitable for robust and energy efficient associative computing and pattern matching.

Well-posedness of characteristic symmetric hyperbolic systems

NASA Astrophysics Data System (ADS)

Secchi, Paolo

1996-06-01

We consider the initial-boundary-value problem for quasi-linear symmetric hyperbolic systems with characteristic boundary of constant multiplicity. We show the well-posedness in Hadamard's sense (i.e., existence, uniqueness and continuous dependence of solutions on the data) of regular solutions in suitable functions spaces which take into account the loss of regularity in the normal direction to the characteristic boundary.

Photophysical Characterization and BSA Interaction of Direct Ring Carboxy Functionalized Symmetrical squaraine Dyes

NASA Astrophysics Data System (ADS)

Saikiran, Maryala; Pandey, Shyam S.; Hayase, Shuzi; Kato, Tamaki

2017-11-01

A series of far-red sensitive symmetrical squaraine dyes bearing direct -COOH functionalized indole ring were synthesized, characterized and subjected to photophysical investigations. These symmetrical squaraine dyes were then subjected to investigate their interaction with bovine serum albumin (BSA) in Phosphate buffer solutions. All the squaraine dyes under investigation exhibit intense and sharp optical absorption mainly in the far-red wavelength region from 550 nm -700 nm having very high molar extinction coefficients from 1.3 × 105 dm3.mol-1.cm-1. A very small Stokes shift of 10-17 nm indicates the rigid conformational structure of squaraine chromophore. Interaction of these dyes with BSA leads to not only enhanced emission intensity but also bathochromically shifted absorption maximum due to formation of dye-BSA conjugate. These dyes bind strongly with BSA having about an order of magnitude higher binding constant as compared to the reported squaraine dyes. Amongst the symmetrical squaraine dyes investigated in this work one bearing substituents like trifluorobutyl as alkyl chain at N-position of indole ring and carboxylic acid on benzene ring at the terminal (SQ-26) exhibited highest association with the BSA having very high binding constant 8.01 × 106 M-1.

A finite element formulation preserving symmetric and banded diffusion stiffness matrix characteristics for fractional differential equations

NASA Astrophysics Data System (ADS)

Lin, Zeng; Wang, Dongdong

2017-10-01

Due to the nonlocal property of the fractional derivative, the finite element analysis of fractional diffusion equation often leads to a dense and non-symmetric stiffness matrix, in contrast to the conventional finite element formulation with a particularly desirable symmetric and banded stiffness matrix structure for the typical diffusion equation. This work first proposes a finite element formulation that preserves the symmetry and banded stiffness matrix characteristics for the fractional diffusion equation. The key point of the proposed formulation is the symmetric weak form construction through introducing a fractional weight function. It turns out that the stiffness part of the present formulation is identical to its counterpart of the finite element method for the conventional diffusion equation and thus the stiffness matrix formulation becomes trivial. Meanwhile, the fractional derivative effect in the discrete formulation is completely transferred to the force vector, which is obviously much easier and efficient to compute than the dense fractional derivative stiffness matrix. Subsequently, it is further shown that for the general fractional advection-diffusion-reaction equation, the symmetric and banded structure can also be maintained for the diffusion stiffness matrix, although the total stiffness matrix is not symmetric in this case. More importantly, it is demonstrated that under certain conditions this symmetric diffusion stiffness matrix formulation is capable of producing very favorable numerical solutions in comparison with the conventional non-symmetric diffusion stiffness matrix finite element formulation. The effectiveness of the proposed methodology is illustrated through a series of numerical examples.

Stochastic p -Bits for Invertible Logic

NASA Astrophysics Data System (ADS)

Camsari, Kerem Yunus; Faria, Rafatul; Sutton, Brian M.; Datta, Supriyo

2017-07-01

Conventional semiconductor-based logic and nanomagnet-based memory devices are built out of stable, deterministic units such as standard metal-oxide semiconductor transistors, or nanomagnets with energy barriers in excess of ≈40 - 60 kT . In this paper, we show that unstable, stochastic units, which we call "p -bits," can be interconnected to create robust correlations that implement precise Boolean functions with impressive accuracy, comparable to standard digital circuits. At the same time, they are invertible, a unique property that is absent in standard digital circuits. When operated in the direct mode, the input is clamped, and the network provides the correct output. In the inverted mode, the output is clamped, and the network fluctuates among all possible inputs that are consistent with that output. First, we present a detailed implementation of an invertible gate to bring out the key role of a single three-terminal transistorlike building block to enable the construction of correlated p -bit networks. The results for this specific, CMOS-assisted nanomagnet-based hardware implementation agree well with those from a universal model for p -bits, showing that p -bits need not be magnet based: any three-terminal tunable random bit generator should be suitable. We present a general algorithm for designing a Boltzmann machine (BM) with a symmetric connection matrix [J ] (Ji j=Jj i) that implements a given truth table with p -bits. The [J ] matrices are relatively sparse with a few unique weights for convenient hardware implementation. We then show how BM full adders can be interconnected in a partially directed manner (Ji j≠Jj i) to implement large logic operations such as 32-bit binary addition. Hundreds of stochastic p -bits get precisely correlated such that the correct answer out of 233 (≈8 ×1 09) possibilities can be extracted by looking at the statistical mode or majority vote of a number of time samples. With perfect directivity (Jj i=0 ) a small number of samples is enough, while for less directed connections more samples are needed, but even in the former case logical invertibility is largely preserved. This combination of digital accuracy and logical invertibility is enabled by the hybrid design that uses bidirectional BM units to construct circuits with partially directed interunit connections. We establish this key result with extensive examples including a 4-bit multiplier which in inverted mode functions as a factorizer.

Periodic activation function and a modified learning algorithm for the multivalued neuron.

PubMed

Aizenberg, Igor

2010-12-01

In this paper, we consider a new periodic activation function for the multivalued neuron (MVN). The MVN is a neuron with complex-valued weights and inputs/output, which are located on the unit circle. Although the MVN outperforms many other neurons and MVN-based neural networks have shown their high potential, the MVN still has a limited capability of learning highly nonlinear functions. A periodic activation function, which is introduced in this paper, makes it possible to learn nonlinearly separable problems and non-threshold multiple-valued functions using a single multivalued neuron. We call this neuron a multivalued neuron with a periodic activation function (MVN-P). The MVN-Ps functionality is much higher than that of the regular MVN. The MVN-P is more efficient in solving various classification problems. A learning algorithm based on the error-correction rule for the MVN-P is also presented. It is shown that a single MVN-P can easily learn and solve those benchmark classification problems that were considered unsolvable using a single neuron. It is also shown that a universal binary neuron, which can learn nonlinearly separable Boolean functions, and a regular MVN are particular cases of the MVN-P.

Cranial symmetry in baleen whales (Cetacea, Mysticeti) and the occurrence of cranial asymmetry throughout cetacean evolution

NASA Astrophysics Data System (ADS)

Fahlke, Julia M.; Hampe, Oliver

2015-10-01

Odontoceti and Mysticeti (toothed and baleen whales) originated from Eocene archaeocetes that had evolved from terrestrial artiodactyls. Cranial asymmetry is known in odontocetes that can hear ultrasound (>20,000 Hz) and has been linked to the split function of the nasal passage in breathing and vocalization. Recent results indicate that archaeocetes also had asymmetric crania. Their asymmetry has been linked to directional hearing in water, although hearing frequencies are still under debate. Mysticetes capable of low-frequency and infrasonic hearing (<20 Hz) are assumed to have symmetric crania. This study aims to resolve whether mysticete crania are indeed symmetric and whether mysticete cranial symmetry is plesiomorphic or secondary. Cranial shape was analyzed applying geometric morphometrics to three-dimensional (3D) cranial models of fossil and modern mysticetes, Eocene archaeocetes, modern artiodactyls, and modern odontocetes. Statistical tests include analysis of variance, principal components analysis, and discriminant function analysis. Results suggest that symmetric shape difference reflects general trends in cetacean evolution. Asymmetry includes significant fluctuating and directional asymmetry, the latter being very small. Mysticete crania are as symmetric as those of terrestrial artiodactyls and archaeocetes, without significant differences within Mysticeti. Odontocete crania are more asymmetric. These results indicate that (1) all mysticetes have symmetric crania, (2) archaeocete cranial asymmetry is not conspicuous in most of the skull but may yet be conspicuous in the rostrum, (3) directional cranial asymmetry is an odontocete specialization, and (4) directional cranial asymmetry is more likely related to echolocation than hearing.

Cranial symmetry in baleen whales (Cetacea, Mysticeti) and the occurrence of cranial asymmetry throughout cetacean evolution.

PubMed

Fahlke, Julia M; Hampe, Oliver

2015-10-01

Odontoceti and Mysticeti (toothed and baleen whales) originated from Eocene archaeocetes that had evolved from terrestrial artiodactyls. Cranial asymmetry is known in odontocetes that can hear ultrasound (>20,000 Hz) and has been linked to the split function of the nasal passage in breathing and vocalization. Recent results indicate that archaeocetes also had asymmetric crania. Their asymmetry has been linked to directional hearing in water, although hearing frequencies are still under debate. Mysticetes capable of low-frequency and infrasonic hearing (<20 Hz) are assumed to have symmetric crania. This study aims to resolve whether mysticete crania are indeed symmetric and whether mysticete cranial symmetry is plesiomorphic or secondary. Cranial shape was analyzed applying geometric morphometrics to three-dimensional (3D) cranial models of fossil and modern mysticetes, Eocene archaeocetes, modern artiodactyls, and modern odontocetes. Statistical tests include analysis of variance, principal components analysis, and discriminant function analysis. Results suggest that symmetric shape difference reflects general trends in cetacean evolution. Asymmetry includes significant fluctuating and directional asymmetry, the latter being very small. Mysticete crania are as symmetric as those of terrestrial artiodactyls and archaeocetes, without significant differences within Mysticeti. Odontocete crania are more asymmetric. These results indicate that (1) all mysticetes have symmetric crania, (2) archaeocete cranial asymmetry is not conspicuous in most of the skull but may yet be conspicuous in the rostrum, (3) directional cranial asymmetry is an odontocete specialization, and (4) directional cranial asymmetry is more likely related to echolocation than hearing.

RG flows for λ-deformed CFTs

NASA Astrophysics Data System (ADS)

Sagkrioti, E.; Sfetsos, K.; Siampos, K.

2018-05-01

We study the renormalization group equations of the fully anisotropic λ-deformed CFTs involving the direct product of two current algebras at different levels k1,2 for general semi-simple groups. The exact, in the deformation parameters, β-function is found via the effective action of the quantum fluctuations around a classical background as well as from gravitational techniques. Furthermore, agreement with known results for symmetric couplings and/or for equal levels, is demonstrated. We study in detail the two coupling case arising by splitting the group into a subgroup and the corresponding coset manifold which consistency requires to be either a symmetric-space one or a non-symmetric Einstein-space.

Statistical correlation analysis for comparing vibration data from test and analysis

NASA Technical Reports Server (NTRS)

Butler, T. G.; Strang, R. F.; Purves, L. R.; Hershfeld, D. J.

1986-01-01

A theory was developed to compare vibration modes obtained by NASTRAN analysis with those obtained experimentally. Because many more analytical modes can be obtained than experimental modes, the analytical set was treated as expansion functions for putting both sources in comparative form. The dimensional symmetry was developed for three general cases: nonsymmetric whole model compared with a nonsymmetric whole structural test, symmetric analytical portion compared with a symmetric experimental portion, and analytical symmetric portion with a whole experimental test. The theory was coded and a statistical correlation program was installed as a utility. The theory is established with small classical structures.

Hypercubane: DFT-based prediction of an Oh-symmetric double-shell hydrocarbon

NASA Astrophysics Data System (ADS)

Pichierri, Fabio

2014-09-01

Using density functional theory we design a molecular analog of the four-dimensional hypercube or tesseract which we called hypercubane. The title hydrocarbon (C40H24) is Oh-symmetric like cubane and is characterized by a double-shell architecture. The perfluorinated analog of hypercubane also is stable with a positive value of the electron affinity. Removal of the C8 core from hypercubane yields a hollowed Oh-symmetric hydrocarbon with enough room to host a single atom/ion guest. The resonances of the NMR-active 13C and 1H nuclei have been computed so as to assist the spectroscopic identification of the predicted molecules.

Multi-catalysis cascade reactions based on the methoxycarbonylketene platform: diversity-oriented synthesis of functionalized non-symmetrical malonates for agrochemicals and pharmaceuticals.

PubMed

Ramachary, Dhevalapally B; Venkaiah, Chintalapudi; Reddy, Y Vijayendar; Kishor, Mamillapalli

2009-05-21

In this paper we describe new multi-catalysis cascade (MCC) reactions for the one-pot synthesis of highly functionalized non-symmetrical malonates. These metal-free reactions are either five-step (olefination/hydrogenation/alkylation/ketenization/esterification) or six-step (olefination/hydrogenation/alkylation/ketenization/esterification/alkylation), and employ aldehydes/ketones, Meldrum's acid, 1,4-dihydropyridine/o-phenylenediamine, diazomethane, alcohols and active ethylene/acetylenes, and involve iminium-, self-, self-, self- and base-catalysis, respectively. Many of the products have direct application in agricultural and pharmaceutical chemistry.

New 2D dilaton gravity for nonsingular black holes

NASA Astrophysics Data System (ADS)

Kunstatter, Gabor; Maeda, Hideki; Taves, Tim

2016-05-01

We construct a two-dimensional action that is an extension of spherically symmetric Einstein-Lanczos-Lovelock (ELL) gravity. The action contains arbitrary functions of the areal radius and the norm squared of its gradient, but the field equations are second order and obey Birkhoff’s theorem. In complete analogy with spherically symmetric ELL gravity, the field equations admit the generalized Misner-Sharp mass as the first integral that determines the form of the vacuum solution. The arbitrary functions in the action allow for vacuum solutions that describe a larger class of interesting nonsingular black hole spacetimes than previously available.

The range and valence of a real Smirnov function

NASA Astrophysics Data System (ADS)

Ferguson, Timothy; Ross, William T.

2018-02-01

We give a complete description of the possible ranges of real Smirnov functions (quotients of two bounded analytic functions on the open unit disk where the denominator is outer and such that the radial boundary values are real almost everywhere on the unit circle). Our techniques use the theory of unbounded symmetric Toeplitz operators, some general theory of unbounded symmetric operators, classical Hardy spaces, and an application of the uniformization theorem. In addition, we completely characterize the possible valences for these real Smirnov functions when the valence is finite. To do so we construct Riemann surfaces we call disk trees by welding together copies of the unit disk and its complement in the Riemann sphere. We also make use of certain trees we call valence trees that mirror the structure of disk trees.

Dynamic Snap-Through of Thermally Buckled Structures by a Reduced Order Method

NASA Technical Reports Server (NTRS)

Przekop, Adam; Rizzi, Stephen A.

2007-01-01

The goal of this investigation is to further develop nonlinear modal numerical simulation methods for application to geometrically nonlinear response of structures exposed to combined high intensity random pressure fluctuations and thermal loadings. The study is conducted on a flat aluminum beam, which permits a comparison of results obtained by a reduced-order analysis with those obtained from a numerically intensive simulation in physical degrees-of-freedom. A uniformly distributed thermal loading is first applied to investigate the dynamic instability associated with thermal buckling. A uniformly distributed random loading is added to investigate the combined thermal-acoustic response. In the latter case, three types of response characteristics are considered, namely: (i) small amplitude vibration around one of the two stable buckling equilibrium positions, (ii) intermittent snap-through response between the two equilibrium positions, and (iii) persistent snap-through response between the two equilibrium positions. For the reduced-order analysis, four categories of modal basis functions are identified including those having symmetric transverse, anti-symmetric transverse, symmetric in-plane, and anti-symmetric in-plane displacements. The effect of basis selection on the quality of results is investigated for the dynamic thermal buckling and combined thermal-acoustic response. It is found that despite symmetric geometry, loading, and boundary conditions, the anti-symmetric transverse and symmetric in-plane modes must be included in the basis as they participate in the snap-through behavior.

Analog Computation by DNA Strand Displacement Circuits.

PubMed

Song, Tianqi; Garg, Sudhanshu; Mokhtar, Reem; Bui, Hieu; Reif, John

2016-08-19

DNA circuits have been widely used to develop biological computing devices because of their high programmability and versatility. Here, we propose an architecture for the systematic construction of DNA circuits for analog computation based on DNA strand displacement. The elementary gates in our architecture include addition, subtraction, and multiplication gates. The input and output of these gates are analog, which means that they are directly represented by the concentrations of the input and output DNA strands, respectively, without requiring a threshold for converting to Boolean signals. We provide detailed domain designs and kinetic simulations of the gates to demonstrate their expected performance. On the basis of these gates, we describe how DNA circuits to compute polynomial functions of inputs can be built. Using Taylor Series and Newton Iteration methods, functions beyond the scope of polynomials can also be computed by DNA circuits built upon our architecture.

Data Auditor: Analyzing Data Quality Using Pattern Tableaux

NASA Astrophysics Data System (ADS)

Srivastava, Divesh

Monitoring databases maintain configuration and measurement tables about computer systems, such as networks and computing clusters, and serve important business functions, such as troubleshooting customer problems, analyzing equipment failures, planning system upgrades, etc. These databases are prone to many data quality issues: configuration tables may be incorrect due to data entry errors, while measurement tables may be affected by incorrect, missing, duplicate and delayed polls. We describe Data Auditor, a tool for analyzing data quality and exploring data semantics of monitoring databases. Given a user-supplied constraint, such as a boolean predicate expected to be satisfied by every tuple, a functional dependency, or an inclusion dependency, Data Auditor computes "pattern tableaux", which are concise summaries of subsets of the data that satisfy or fail the constraint. We discuss the architecture of Data Auditor, including the supported types of constraints and the tableau generation mechanism. We also show the utility of our approach on an operational network monitoring database.

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.

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

DTIC Science & Technology

1982-04-01

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

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

PubMed

Wijesinghe, Parami; Liyanagedera, Chamika; Roy, Kaushik

2018-05-02

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

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

PubMed Central

Kerkhofs, Johan; Geris, Liesbet

2015-01-01

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

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

PubMed

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

2015-02-01

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

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

PubMed

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

2015-09-01

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

Symmetric quadratic Hamiltonians with pseudo-Hermitian matrix representation

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

Fernández, Francisco M., E-mail: fernande@quimica.unlp.edu.ar

2016-06-15

We prove that any symmetric Hamiltonian that is a quadratic function of the coordinates and momenta has a pseudo-Hermitian adjoint or regular matrix representation. The eigenvalues of the latter matrix are the natural frequencies of the Hamiltonian operator. When all the eigenvalues of the matrix are real, then the spectrum of the symmetric Hamiltonian is real and the operator is Hermitian. As illustrative examples we choose the quadratic Hamiltonians that model a pair of coupled resonators with balanced gain and loss, the electromagnetic self-force on an oscillating charged particle and an active LRC circuit. -- Highlights: •Symmetric quadratic operators aremore » useful models for many physical applications. •Any such operator exhibits a pseudo-Hermitian matrix representation. •Its eigenvalues are the natural frequencies of the Hamiltonian operator. •The eigenvalues may be real or complex and describe a phase transition.« less

A far-wing line shape theory which satisfies the detailed balance principle

NASA Technical Reports Server (NTRS)

Ma, Q.; Tipping, R. H.; Hartmann, J.-M.; Boulet, C.

1995-01-01

A far-wing theory in which the validity of the detailed balance principle is maintained in each step of the derivation is presented. The role of the total density matrix including the initial correlations is analyzed rigorously. By factoring out the rapidly varying terms in the complex-time development operator in the interaction representation, better approximate expressions can be obtained. As a result, the spectral density can be expressed in terms of the line-coupling functions in which two coupled lines are arranged symmetrically and whose frequency detunings are omega - 1/2(omega(sub ji) + omega (sub j'i'). Using the approximate values omega - omega(sub ji) results in expressions that do not satisfy the detailed balance principle. However, this principle remains satisfied for the symmetrized spectral density in which not only the coupled lines are arranged symmetrically, but also the initial and final states belonging to the same lines are arranged symmetrically as well.

G-Strands on symmetric spaces

PubMed Central

2017-01-01

We study the G-strand equations that are extensions of the classical chiral model of particle physics in the particular setting of broken symmetries described by symmetric spaces. These equations are simple field theory models whose configuration space is a Lie group, or in this case a symmetric space. In this class of systems, we derive several models that are completely integrable on finite dimensional Lie group G, and we treat in more detail examples with symmetric space SU(2)/S1 and SO(4)/SO(3). The latter model simplifies to an apparently new integrable nine-dimensional system. We also study the G-strands on the infinite dimensional group of diffeomorphisms, which gives, together with the Sobolev norm, systems of 1+2 Camassa–Holm equations. The solutions of these equations on the complementary space related to the Witt algebra decomposition are the odd function solutions. PMID:28413343

General description of circularly symmetric Bessel beams of arbitrary order

NASA Astrophysics Data System (ADS)

Wang, Jia Jie; Wriedt, Thomas; Lock, James A.; Mädler, Lutz

2016-11-01

A general description of circularly symmetric Bessel beams of arbitrary order is derived in this paper. This is achieved by analyzing the relationship between different descriptions of polarized Bessel beams obtained using different approaches. It is shown that a class of circularly symmetric Davis Bessel beams derived using the Hertz vector potentials possesses the same general functional dependence as the aplanatic Bessel beams generated using the angular spectrum representation (ASR). This result bridges the gap between different descriptions of Bessel beams and leads to a general description of circularly symmetric Bessel beams, such that the Davis Bessel beams and the aplanatic Bessel beams are merely the two simplest cases of an infinite number of possible circularly symmetric Bessel beams. Additionally, magnitude profiles of the electric and magnetic fields, the energy density and the Poynting vector are displayed for Bessel beams in both paraxial and nonparaxial cases. The results presented in this paper provide a fresh perspective on the description of Bessel beams and cast some insights into the light scattering and light-matter interactions problems in practice.

Plethystic vertex operators and boson-fermion correspondences

NASA Astrophysics Data System (ADS)

Fauser, Bertfried; Jarvis, Peter D.; King, Ronald C.

2016-10-01

We study the algebraic properties of plethystic vertex operators, introduced in (2010 J. Phys. A: Math. Theor. 43 405202), underlying the structure of symmetric functions associated with certain generalized universal character rings of subgroups of the general linear group, defined to stabilize tensors of Young symmetry type characterized by a partition of arbitrary shape π. Here we establish an extension of the well-known boson-fermion correspondence involving Schur functions and their associated (Bernstein) vertex operators: for each π, the modes generated by the plethystic vertex operators and their suitably constructed duals, satisfy the anticommutation relations of a complex Clifford algebra. The combinatorial manipulations underlying the results involve exchange identities exploiting the Hopf-algebraic structure of certain symmetric function series and their plethysms.

Rigid rotators. [deriving the time-independent energy states associated with rotational motions of the molecule

NASA Technical Reports Server (NTRS)

1976-01-01

The two-particle, steady-state Schroedinger equation is transformed to center of mass and internuclear distance vector coordinates, leading to the free particle wave equation for the kinetic energy motion of the molecule and a decoupled wave equation for a single particle of reduced mass moving in a spherical potential field. The latter describes the vibrational and rotational energy modes of the diatomic molecule. For fixed internuclear distance, this becomes the equation of rigid rotator motion. The classical partition function for the rotator is derived and compared with the quantum expression. Molecular symmetry effects are developed from the generalized Pauli principle that the steady-state wave function of any system of fundamental particles must be antisymmetric. Nuclear spin and spin quantum functions are introduced and ortho- and para-states of rotators, along with their degeneracies, are defined. Effects of nuclear spin on entropy are deduced. Next, rigid polyatomic rotators are considered and the partition function for this case is derived. The patterns of rotational energy levels for nonlinear molecules are discussed for the spherical symmetric top, for the prolate symmetric top, for the oblate symmetric top, and for the asymmetric top. Finally, the equilibrium energy and specific heat of rigid rotators are derived.

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

Quantum mechanics over sets

NASA Astrophysics Data System (ADS)

Ellerman, David

2014-03-01

In models of QM over finite fields (e.g., Schumacher's ``modal quantum theory'' MQT), one finite field stands out, Z2, since Z2 vectors represent sets. QM (finite-dimensional) mathematics can be transported to sets resulting in quantum mechanics over sets or QM/sets. This gives a full probability calculus (unlike MQT with only zero-one modalities) that leads to a fulsome theory of QM/sets including ``logical'' models of the double-slit experiment, Bell's Theorem, QIT, and QC. In QC over Z2 (where gates are non-singular matrices as in MQT), a simple quantum algorithm (one gate plus one function evaluation) solves the Parity SAT problem (finding the parity of the sum of all values of an n-ary Boolean function). Classically, the Parity SAT problem requires 2n function evaluations in contrast to the one function evaluation required in the quantum algorithm. This is quantum speedup but with all the calculations over Z2 just like classical computing. This shows definitively that the source of quantum speedup is not in the greater power of computing over the complex numbers, and confirms the idea that the source is in superposition.

Bound state solution of Dirac equation for 3D harmonics oscillator plus trigonometric scarf noncentral potential using SUSY QM approach

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

Cari, C., E-mail: carinln@yahoo.com; Suparmi, A., E-mail: carinln@yahoo.com

2014-09-30

Dirac equation of 3D harmonics oscillator plus trigonometric Scarf non-central potential for spin symmetric case is solved using supersymmetric quantum mechanics approach. The Dirac equation for exact spin symmetry reduces to Schrodinger like equation. The relativistic energy and wave function for spin symmetric case are simply obtained using SUSY quantum mechanics method and idea of shape invariance.

Communication: Symmetrical quasi-classical analysis of linear optical spectroscopy

NASA Astrophysics Data System (ADS)

Provazza, Justin; Coker, David F.

2018-05-01

The symmetrical quasi-classical approach for propagation of a many degree of freedom density matrix is explored in the context of computing linear spectra. Calculations on a simple two state model for which exact results are available suggest that the approach gives a qualitative description of peak positions, relative amplitudes, and line broadening. Short time details in the computed dipole autocorrelation function result in exaggerated tails in the spectrum.

Optimum stacking sequence design of laminated composite circular plates with curvilinear fibres by a layer-wise optimization method

NASA Astrophysics Data System (ADS)

Guenanou, A.; Houmat, A.

2018-05-01

The optimum stacking sequence design for the maximum fundamental frequency of symmetrically laminated composite circular plates with curvilinear fibres is investigated for the first time using a layer-wise optimization method. The design variables are two fibre orientation angles per layer. The fibre paths are constructed using the method of shifted paths. The first-order shear deformation plate theory and a curved square p-element are used to calculate the objective function. The blending function method is used to model accurately the geometry of the circular plate. The equations of motion are derived using Lagrange's method. The numerical results are validated by means of a convergence test and comparison with published values for symmetrically laminated composite circular plates with rectilinear fibres. The material parameters, boundary conditions, number of layers and thickness are shown to influence the optimum solutions to different extents. The results should serve as a benchmark for optimum stacking sequences of symmetrically laminated composite circular plates with curvilinear fibres.

The subcortical maternal complex controls symmetric division of mouse zygotes by regulating F-actin dynamics.

PubMed

Yu, Xing-Jiang; Yi, Zhaohong; Gao, Zheng; Qin, Dandan; Zhai, Yanhua; Chen, Xue; Ou-Yang, Yingchun; Wang, Zhen-Bo; Zheng, Ping; Zhu, Min-Sheng; Wang, Haibin; Sun, Qing-Yuan; Dean, Jurrien; Li, Lei

2014-09-11

Maternal effect genes play critical roles in early embryogenesis of model organisms where they have been intensively investigated. However, their molecular function in mammals remains largely unknown. Recently, we identified a subcortical maternal complex (SCMC) that contains four proteins encoded by maternal effect genes (Mater, Filia, Floped and Tle6). Here we report that TLE6, similar to FLOPED and MATER, stabilizes the SCMC and is necessary for cleavage beyond the two-cell stage of development. We document that the SCMC is required for formation of the cytoplasmic F-actin meshwork that controls the central position of the spindle and ensures symmetric division of mouse zygotes. We further demonstrate that the SCMC controls formation of the actin cytoskeleton specifically via Cofilin, a key regulator of F-actin assembly. Our results provide molecular insight into the physiological function of TLE6, its interaction with the SCMC and their roles in the symmetric division of the zygote in early mouse development.

Free Vibration Study of Anti-Symmetric Angle-Ply Laminated Plates under Clamped Boundary Conditions

NASA Astrophysics Data System (ADS)

Viswanathan, K. K.; Karthik, K.; Sanyasiraju, Y. V. S. S.; Aziz, Z. A.

2016-11-01

Two type of numerical approach namely, Radial Basis Function and Spline approximation, used to analyse the free vibration of anti-symmetric angle-ply laminated plates under clamped boundary conditions. The equations of motion are derived using YNS theory under first order shear deformation. By assuming the solution in separable form, coupled differential equations obtained in term of mid-plane displacement and rotational functions. The coupled differential is then approximated using Spline function and radial basis function to obtain the generalize eigenvalue problem and parametric studies are made to investigate the effect of aspect ratio, length-to-thickness ratio, number of layers, fibre orientation and material properties with respect to the frequency parameter. Some results are compared with the existing literature and other new results are given in tables and graphs.

Magnon-based logic in a multi-terminal YIG/Pt nanostructure

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

Ganzhorn, Kathrin, E-mail: kathrin.ganzhorn@wmi.badw.de; Klingler, Stefan; Wimmer, Tobias

2016-07-11

Boolean logic is the foundation of modern digital information processing. Recently, there has been a growing interest in phenomena based on pure spin currents, which allows to move from charge to spin based logic gates. We study a proof-of-principle logic device based on the ferrimagnetic insulator Yttrium Iron Garnet, with Pt strips acting as injectors and detectors for non-equilibrium magnons. We experimentally observe incoherent superposition of magnons generated by different injectors. This allows to implement a fully functional majority gate, enabling multiple logic operations (AND and OR) in one and the same device. Clocking frequencies of the order of severalmore » GHz and straightforward down-scaling make our device promising for applications.« less

A method of transition conflict resolving in hierarchical control

NASA Astrophysics Data System (ADS)

Łabiak, Grzegorz

2016-09-01

The paper concerns the problem of automatic solving of transition conflicts in hierarchical concurrent state machines (also known as UML state machine). Preparing by the designer a formal specification of a behaviour free from conflicts can be very complex. In this paper, it is proposed a method for solving conflicts through transition predicates modification. Partially specified predicates in the nondeterministic diagram are transformed into a symbolic Boolean space, whose points of the space code all possible valuations of transition predicates. Next, all valuations under partial specifications are logically multiplied by a function which represents all possible orthogonal predicate valuations. The result of this operation contains all possible collections of predicates, which under given partial specification make that the original diagram is conflict free and deterministic.

Alternative probability theories for cognitive psychology.

PubMed

Narens, Louis

2014-01-01

Various proposals for generalizing event spaces for probability functions have been put forth in the mathematical, scientific, and philosophic literatures. In cognitive psychology such generalizations are used for explaining puzzling results in decision theory and for modeling the influence of context effects. This commentary discusses proposals for generalizing probability theory to event spaces that are not necessarily boolean algebras. Two prominent examples are quantum probability theory, which is based on the set of closed subspaces of a Hilbert space, and topological probability theory, which is based on the set of open sets of a topology. Both have been applied to a variety of cognitive situations. This commentary focuses on how event space properties can influence probability concepts and impact cognitive modeling. Copyright © 2013 Cognitive Science Society, Inc.

Testing Properties of Boolean Functions

DTIC Science & Technology

2012-01-01

Applying the Hermite decomposition of f and linearity of expectation, E x,y [f(x)f(y) 〈x, y〉] = n∑ i=1 ∑ S,T∈Nn f̂(S)f̂(T )E x [HS(x)xi]E y [ HT (y)yi...otherwise it takes the value 0. Similarly, Ey[ HT (y)yi] = 1 iff T = ei. 38 Part I Exact Query Complexity 39 Chapter 5 Testing Juntas We begin by studying the...1− 2e− 6m /2 = 1− 2e−O( √ n). The estimate ν̃ is a U-statistic with kernel ψ∗f . This kernel satisfies ‖ψ∗f − Eψ∗f‖∞ ≤ 2‖ψ∗f‖∞ = 2 √ 4n log(4n/3

Installing logic gates in permeability controllable polyelectrolyte-carbon nitride films for detecting proteases and nucleases.

PubMed

Chen, Lichan; Zeng, Xiaoting; Dandapat, Anirban; Chi, Yuwu; Kim, Donghwan

2015-09-01

Proteases and nucleases are enzymes heavily involved in many important biological processes, such as cancer initiation, progression, and metastasis; hence, they are indicative of potential diagnostic biomarkers. Here, we demonstrate a new label free and sensitive electrochemiluminescent (ECL) sensing strategy for protease and nuclease assays that utilize target-triggered desorption of programmable polyelectrolyte films assembled on graphite-like carbon nitride (g-C3N4) film to regulate the diffusion flux of a coreactant. Furthermore, we have built Boolean logic gates OR and AND into the polyelectrolyte films, capable of simultaneously sensing proteases and nucleases in a complicated system by breaking it into simple functions. The developed intelligent permeability controlled enzyme sensor may prove valuable in future medical diagnostics.

Multilevel quantum Otto heat engines with identical particles

NASA Astrophysics Data System (ADS)

Huang, X. L.; Guo, D. Y.; Wu, S. L.; Yi, X. X.

2018-02-01

A quantum Otto heat engine is studied with multilevel identical particles trapped in one-dimensional box potential as working substance. The symmetrical wave function for Bosons and the anti-symmetrical wave function for Fermions are considered. In two-particle case, we focus on the ratios of W^i (i=B,F) to W_s, where W^B and W^F are the work done by two Bosons and Fermions, respectively, and W_s is the work output of a single particle under the same conditions. Due to the symmetrical of the wave functions, the ratios are not equal to 2. Three different regimes, low-temperature regime, high-temperature regime, and intermediate-temperature regime, are analyzed, and the effects of energy level number and the differences between the two baths are calculated. In the multiparticle case, we calculate the ratios of W^i_M/M to W_s, where W^i_M/M can be seen as the average work done by a single particle in multiparticle heat engine. For other working substances whose energy spectrum has the form of E_n˜ n^2, the results are similar. For the case E_n˜ n, two different conclusions are obtained.

Comprehensive Study on the Impact of the Cation Alkyl Side Chain Length on the Solubility of Water in Ionic Liquids.

PubMed

Kurnia, Kiki A; Neves, Catarina M S S; Freire, Mara G; Santos, Luís M N B F; Coutinho, João A P

2015-10-01

A comprehensive study on the phase behaviour of two sets of ionic liquids (ILs) and their interactions with water is here presented through combining experimental and theoretical approaches. The impact of the alkyl side chain length and the cation symmetry on the water solubility in the asymmetric [C N- 1 C 1 im][NTf 2 ] and symmetric [C N- 1 C N- 1 im][NTf 2 ] series of ILs ( N up to 22), from 288.15 K to 318.15 K and at atmospheric pressure, was studied. The experimental data reveal that the solubility of water in ILs with an asymmetric cation is higher than in those with the symmetric isomer. Several trend shifts on the water solubility as a function of the alkyl side chain length were identified, namely at [C 6 C 1 im][NTf 2 ] for asymmetric ILs and at [C 4 C 4 im][NTf 2 ] and [C 7 C 7 im][NTf 2 ] for the symmetric ILs. To complement the experimental data and to further investigate the molecular-level mechanisms behind the dissolution process, Density Functional Theory calculations, using the Conductor-like Screening Model for Real Solvents (COSMO-RS) and the Electrostatic potential-derived CHelpG, were performed. The COSMO-RS model is able to qualitatively predict water solubility as function of temperature and alkyl chain lengths of both symmetric and asymmetric cations. Furthermore, the model is also capable to predict the somewhat higher water solubility in the asymmetric cation, as well as the trend shift as function of alkyl chain lengths experimentally observed. Both COSMO-RS and the electrostatic potential-derived CHelpG show that the interactions of water and the IL cation take place on the IL polar region, namely on the aromatic head and adjacent methylene groups what explains the differences in water solubility observed for cations with different chain lengths. Furthermore, the CHelpG calculations for the isolated cations in the gas phase indicates that the trend shift of water solubility as function of alkyl chain lengths and the difference of water solubility in symmetric may also result from the partial positive charge distribution/contribution of the cation.

Hund's Multiplicity Rule Revisited

ERIC Educational Resources Information Center

Rioux, Frank

2007-01-01

The plausible and frequently used explanation of the singlet and triplet wave functions for a two-electron system is presented. Its findings reveal that the antisymmetric triplet spatial wave function keeps electrons apart, while the symmetric singlet spatial wave function permits electrons to be close together.

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.

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.

A Facile Synthesis of Dynamic, Shape-Changing Polymer Particles

DTIC Science & Technology

2014-04-02

utilizing functional surfactants to control the phase separation of symmetric polystyrene- b -poly(2-vinylpyr- idine) ( PS - b - P2VP ) in dispersed droplets...Figure 1. Schematic representation of a mixed surfactant strategy for controlling the self-assembly of PS - b - P2VP and the generation of particles with...surfactant mixtures to control the phase separation of the symmetric polystyrene- b -poly(2-vinylpyridine) ( PS - b - P2VP ) block copolymers (BCPs) within

Dyons and dyonic black holes in su (N ) Einstein-Yang-Mills theory in anti-de Sitter spacetime

NASA Astrophysics Data System (ADS)

Shepherd, Ben L.; Winstanley, Elizabeth

2016-03-01

We present new spherically symmetric, dyonic soliton and black hole solutions of the su (N ) Einstein-Yang-Mills equations in four-dimensional asymptotically anti-de Sitter spacetime. The gauge field has nontrivial electric and magnetic components and is described by N -1 magnetic gauge field functions and N -1 electric gauge field functions. We explore the phase space of solutions in detail for su (2 ) and su (3 ) gauge groups. Combinations of the electric gauge field functions are monotonic and have no zeros; in general the magnetic gauge field functions may have zeros. The phase space of solutions is extremely rich, and we find solutions in which the magnetic gauge field functions have more than fifty zeros. Of particular interest are solutions for which the magnetic gauge field functions have no zeros, which exist when the negative cosmological constant has sufficiently large magnitude. We conjecture that at least some of these nodeless solutions may be stable under linear, spherically symmetric, perturbations.

On a three-dimensional symmetric Ising tetrahedron and contributions to the theory of the dilogarithm and Clausen functions

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

Coffey, Mark W.

2008-04-15

Perturbative quantum field theory for the Ising model at the three-loop level yields a tetrahedral Feynman diagram C(a,b) with masses a and b and four other lines with unit mass. The completely symmetric tetrahedron C{sup Tet}{identical_to}C(1,1) has been of interest from many points of view, with several representations and conjectures having been given in the literature. We prove a conjectured exponentially fast convergent sum for C(1,1), as well as a previously empirical relation for C(1,1) as a remarkable difference of Clausen function values. Our presentation includes propositions extending the theory of the dilogarithm Li{sub 2} and Clausen Cl{sub 2} functions,more » as well as their relation to other special functions of mathematical physics. The results strengthen connections between Feynman diagram integrals, volumes in hyperbolic space, number theory, and special functions and numbers, specifically including dilogarithms, Clausen function values, and harmonic numbers.« less

Cylindrically symmetric Green's function approach for modeling the crystal growth morphology of ice.

PubMed

Libbrecht, K G

1999-08-01

We describe a front-tracking Green's function approach to modeling cylindrically symmetric crystal growth. This method is simple to implement, and with little computer power can adequately model a wide range of physical situations. We apply the method to modeling the hexagonal prism growth of ice crystals, which is governed primarily by diffusion along with anisotropic surface kinetic processes. From ice crystal growth observations in air, we derive measurements of the kinetic growth coefficients for the basal and prism faces as a function of temperature, for supersaturations near the water saturation level. These measurements are interpreted in the context of a model for the nucleation and growth of ice, in which the growth dynamics are dominated by the structure of a disordered layer on the ice surfaces.

Two loop QCD vertices at the symmetric point

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

Gracey, J. A.

2011-10-15

We compute the triple gluon, quark-gluon and ghost-gluon vertices of QCD at the symmetric subtraction point at two loops in the MS scheme. In addition we renormalize each of the three vertices in their respective momentum subtraction schemes, MOMggg, MOMq and MOMh. The conversion functions of all the wave functions, coupling constant and gauge parameter renormalization constants of each of the schemes relative to MS are determined analytically. These are then used to derive the three loop anomalous dimensions of the gluon, quark, Faddeev-Popov ghost and gauge parameter as well as the {beta} function in an arbitrary linear covariant gaugemore » for each MOM scheme. There is good agreement of the latter with earlier Landau gauge numerical estimates of Chetyrkin and Seidensticker.« less

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

PubMed

Karl, Stefan; Dandekar, Thomas

2013-10-11

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

Boolean Operations with Prism Algebraic Patches

PubMed Central

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

2009-01-01

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

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

PubMed

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

2015-02-01

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

A Note about Information Science Research.

ERIC Educational Resources Information Center

Salton, Gerard

1985-01-01

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

Bibliographic Instruction in the 21st Century.

ERIC Educational Resources Information Center

Poirier, Gayle

2000-01-01

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

Implementation of Multivariable Logic Functions in Parallel by Electrically Addressing a Molecule of Three Dopants in Silicon.

PubMed

Fresch, Barbara; Bocquel, Juanita; Hiluf, Dawit; Rogge, Sven; Levine, Raphael D; Remacle, Françoise

2017-07-05

To realize low-power, compact logic circuits, one can explore parallel operation on single nanoscale devices. An added incentive is to use multivalued (as distinct from Boolean) logic. Here, we theoretically demonstrate that the computation of all the possible outputs of a multivariate, multivalued logic function can be implemented in parallel by electrical addressing of a molecule made up of three interacting dopant atoms embedded in Si. The electronic states of the dopant molecule are addressed by pulsing a gate voltage. By simulating the time evolution of the non stationary electronic density built by the gate voltage, we show that one can implement a molecular decision tree that provides in parallel all the outputs for all the inputs of the multivariate, multivalued logic function. The outputs are encoded in the populations and in the bond orders of the dopant molecule, which can be measured using an STM tip. We show that the implementation of the molecular logic tree is equivalent to a spectral function decomposition. The function that is evaluated can be field-programmed by changing the time profile of the pulsed gate voltage. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Efficient reliability analysis of structures with the rotational quasi-symmetric point- and the maximum entropy methods

NASA Astrophysics Data System (ADS)

Xu, Jun; Dang, Chao; Kong, Fan

2017-10-01

This paper presents a new method for efficient structural reliability analysis. In this method, a rotational quasi-symmetric point method (RQ-SPM) is proposed for evaluating the fractional moments of the performance function. Then, the derivation of the performance function's probability density function (PDF) is carried out based on the maximum entropy method in which constraints are specified in terms of fractional moments. In this regard, the probability of failure can be obtained by a simple integral over the performance function's PDF. Six examples, including a finite element-based reliability analysis and a dynamic system with strong nonlinearity, are used to illustrate the efficacy of the proposed method. All the computed results are compared with those by Monte Carlo simulation (MCS). It is found that the proposed method can provide very accurate results with low computational effort.

On the Maxwellian distribution, symmetric form, and entropy conservation for the Euler equations

NASA Technical Reports Server (NTRS)

Deshpande, S. M.

1986-01-01

The Euler equations of gas dynamics have some very interesting properties in that the flux vector is a homogeneous function of the unknowns and the equations can be cast in symmetric hyperbolic form and satisfy the entropy conservation. The Euler equations are the moments of the Boltzmann equation of the kinetic theory of gases when the velocity distribution function is a Maxwellian. The present paper shows the relationship between the symmetrizability and the Maxwellian velocity distribution. The entropy conservation is in terms of the H-function, which is a slight modification of the H-function first introduced by Boltzmann in his famous H-theorem. In view of the H-theorem, it is suggested that the development of total H-diminishing (THD) numerical methods may be more profitable than the usual total variation diminishing (TVD) methods for obtaining wiggle-free solutions.

De Novo Evolutionary Emergence of a Symmetrical Protein Is Shaped by Folding Constraints

PubMed Central

Smock, Robert G.; Yadid, Itamar; Dym, Orly; Clarke, Jane; Tawfik, Dan S.

2016-01-01

Summary Molecular evolution has focused on the divergence of molecular functions, yet we know little about how structurally distinct protein folds emerge de novo. We characterized the evolutionary trajectories and selection forces underlying emergence of β-propeller proteins, a globular and symmetric fold group with diverse functions. The identification of short propeller-like motifs (<50 amino acids) in natural genomes indicated that they expanded via tandem duplications to form extant propellers. We phylogenetically reconstructed 47-residue ancestral motifs that form five-bladed lectin propellers via oligomeric assembly. We demonstrate a functional trajectory of tandem duplications of these motifs leading to monomeric lectins. Foldability, i.e., higher efficiency of folding, was the main parameter leading to improved functionality along the entire evolutionary trajectory. However, folding constraints changed along the trajectory: initially, conflicts between monomer folding and oligomer assembly dominated, whereas subsequently, upon tandem duplication, tradeoffs between monomer stability and foldability took precedence. PMID:26806127

Intrinsic optical conductivity of a {{\\rm{C}}}_{2v} symmetric topological insulator

NASA Astrophysics Data System (ADS)

Sengupta, Parijat; Matsubara, Masahiko; Bellotti, Enrico; Shi, Junxia

2017-07-01

In this work we analytically investigate the longitudinal optical conductivity of the {{{C}}}2v symmetric topological insulator. The conductivity expressions at T = 0 are derived using the Kubo formula and expressed as a function of the ratio of the Dresselhaus and Rashba parameters that characterize the low-energy Hamiltonian. We find that the longitudinal inter-band conductivity vanishes when Dresselhaus and Rashba parameters are equal in strength, also called the persistent spin helix state. The calculations are extended to obtain the frequency-dependent real and imaginary components of the optical conductivity for the topological Kondo insulator SmB6 which exhibits {{{C}}}2v symmetric and anisotropic Dirac cones hosting topological states at \\overline{X} point on the surface Brillouin zone.

The C. elegans engrailed homolog ceh-16 regulates the self-renewal expansion division of stem cell-like seam cells.

PubMed

Huang, Xinxin; Tian, E; Xu, Yanhua; Zhang, Hong

2009-09-15

Stem cells undergo symmetric and asymmetric division to maintain the dynamic equilibrium of the stem cell pool and also to generate a variety of differentiated cells. The homeostatic mechanism controlling the choice between self-renewal and differentiation of stem cells is poorly understood. We show here that ceh-16, encoding the C. elegans ortholog of the transcription factor Engrailed, controls symmetric and asymmetric division of stem cell-like seam cells. Loss of function of ceh-16 causes certain seam cells, which normally undergo symmetric self-renewal expansion division with both daughters adopting the seam cell fate, to divide asymmetrically with only one daughter retaining the seam cell fate. The human engrailed homolog En2 functionally substitutes the role of ceh-16 in promoting self-renewal expansion division of seam cells. Loss of function of apr-1, encoding the C. elegans homolog of the Wnt signaling component APC, results in transformation of self-renewal maintenance seam cell division to self-renewal expansion division, leading to seam cell hyperplasia. The apr-1 mutation suppresses the seam cell division defect in ceh-16 mutants. Our study reveals that ceh-16 interacts with the Wnt signaling pathway to control the choice between self-renewal expansion and maintenance division and also demonstrates an evolutionarily conserved function of engrailed in promoting cell proliferation.

Calibration of the head direction network: a role for symmetric angular head velocity cells.

PubMed

Stratton, Peter; Wyeth, Gordon; Wiles, Janet

2010-06-01

Continuous attractor networks require calibration. Computational models of the head direction (HD) system of the rat usually assume that the connections that maintain HD neuron activity are pre-wired and static. Ongoing activity in these models relies on precise continuous attractor dynamics. It is currently unknown how such connections could be so precisely wired, and how accurate calibration is maintained in the face of ongoing noise and perturbation. Our adaptive attractor model of the HD system that uses symmetric angular head velocity (AHV) cells as a training signal shows that the HD system can learn to support stable firing patterns from poorly-performing, unstable starting conditions. The proposed calibration mechanism suggests a requirement for symmetric AHV cells, the existence of which has previously been unexplained, and predicts that symmetric and asymmetric AHV cells should be distinctly different (in morphology, synaptic targets and/or methods of action on postsynaptic HD cells) due to their distinctly different functions.

Even-Skipped(+) Interneurons Are Core Components of a Sensorimotor Circuit that Maintains Left-Right Symmetric Muscle Contraction Amplitude.

PubMed

Heckscher, Ellie S; Zarin, Aref Arzan; Faumont, Serge; Clark, Matthew Q; Manning, Laurina; Fushiki, Akira; Schneider-Mizell, Casey M; Fetter, Richard D; Truman, James W; Zwart, Maarten F; Landgraf, Matthias; Cardona, Albert; Lockery, Shawn R; Doe, Chris Q

2015-10-21

Bilaterally symmetric motor patterns--those in which left-right pairs of muscles contract synchronously and with equal amplitude (such as breathing, smiling, whisking, and locomotion)--are widespread throughout the animal kingdom. Yet, surprisingly little is known about the underlying neural circuits. We performed a thermogenetic screen to identify neurons required for bilaterally symmetric locomotion in Drosophila larvae and identified the evolutionarily conserved Even-skipped(+) interneurons (Eve/Evx). Activation or ablation of Eve(+) interneurons disrupted bilaterally symmetric muscle contraction amplitude, without affecting the timing of motor output. Eve(+) interneurons are not rhythmically active and thus function independently of the locomotor CPG. GCaMP6 calcium imaging of Eve(+) interneurons in freely moving larvae showed left-right asymmetric activation that correlated with larval behavior. TEM reconstruction of Eve(+) interneuron inputs and outputs showed that the Eve(+) interneurons are at the core of a sensorimotor circuit capable of detecting and modifying body wall muscle contraction. Copyright © 2015 Elsevier Inc. All rights reserved.

Even-skipped+ interneurons are core components of a sensorimotor circuit that maintains left-right symmetric muscle contraction amplitude

PubMed Central

Heckscher, Ellie S.; Zarin, Aref Arzan; Faumont, Serge; Clark, Matthew Q.; Manning, Laurina; Fushiki, Akira; Schneider-Mizel, Casey M.; Fetter, Richard D.; Truman, James W.; Zwart, Maarten F.; Landgraf, Matthias; Cardona, Albert; Lockery, Shawn R.; Doe, Chris Q.

2015-01-01

Summary Bilaterally symmetric motor patterns—those in which left-right pairs of muscles contract synchronously and with equal amplitude (such as breathing, smiling, whisking, locomotion)—are widespread throughout the animal kingdom. Yet surprisingly little is known about the underlying neural circuits. We performed a thermogenetic screen to identify neurons required for bilaterally symmetric locomotion in Drosophila larvae, and identified the evolutionarily-conserved Even-skipped+ interneurons (Eve/Evx). Activation or ablation of Eve+ interneurons disrupted bilaterally symmetric muscle contraction amplitude, without affecting the timing of motor output. Eve+ interneurons are not rhythmically active, and thus function independently of the locomotor CPG. GCaMP6 calcium imaging of Eve+ interneurons in freely-moving larvae showed left-right asymmetric activation that correlated with larval behavior. TEM reconstruction of Eve+ interneuron inputs and outputs showed that the Eve+ interneurons are at the core of a sensorimotor circuit capable of detecting and modifying body wall muscle contraction. PMID:26439528

Unidirectional Wave Vector Manipulation in Two-Dimensional Space with an All Passive Acoustic Parity-Time-Symmetric Metamaterials Crystal

NASA Astrophysics Data System (ADS)

Liu, Tuo; Zhu, Xuefeng; Chen, Fei; Liang, Shanjun; Zhu, Jie

2018-03-01

Exploring the concept of non-Hermitian Hamiltonians respecting parity-time symmetry with classical wave systems is of great interest as it enables the experimental investigation of parity-time-symmetric systems through the quantum-classical analogue. Here, we demonstrate unidirectional wave vector manipulation in two-dimensional space, with an all passive acoustic parity-time-symmetric metamaterials crystal. The metamaterials crystal is constructed through interleaving groove- and holey-structured acoustic metamaterials to provide an intrinsic parity-time-symmetric potential that is two-dimensionally extended and curved, which allows the flexible manipulation of unpaired wave vectors. At the transition point from the unbroken to broken parity-time symmetry phase, the unidirectional sound focusing effect (along with reflectionless acoustic transparency in the opposite direction) is experimentally realized over the spectrum. This demonstration confirms the capability of passive acoustic systems to carry the experimental studies on general parity-time symmetry physics and further reveals the unique functionalities enabled by the judiciously tailored unidirectional wave vectors in space.

The gray area between synapse structure and function-Gray's synapse types I and II revisited.

PubMed

Klemann, Cornelius J H M; Roubos, Eric W

2011-11-01

On the basis of ultrastructural parameters, the concept was formulated that asymmetric Type I and symmetric Type II synapses are excitatory and inhibitory, respectively. This "functional Gray synapses concept" received strong support from the demonstration of the excitatory neurotransmitter glutamate in Type I synapses and of the inhibitory neurotransmitter γ-aminobutyric acid in Type II synapses, and is still frequently used in modern literature. However, morphological and functional evidence has accumulated that the concept is less tenable. Typical features of synapses like shape and size of presynaptic vesicles and synaptic cleft and presence of a postsynaptic density (PsD) do not always fit the postulated (excitatory/inhibitory) function of Gray's synapses. Furthermore, synapse function depends on postsynaptic receptors and associated signal transduction mechanisms rather than on presynaptic morphology and neurotransmitter type. Moreover, the notion that many synapses are difficult to classify as either asymmetric or symmetric has cast doubt on the assumption that the presence of a PsD is a sign of excitatory synaptic transmission. In view of the morphological similarities of the PsD in asymmetric synapses with membrane junctional structures such as the zonula adherens and the desmosome, asymmetric synapses may play a role as links between the postsynaptic and presynaptic membrane, thus ensuring long-term maintenance of interneuronal communication. Symmetric synapses, on the other hand, might be sites of transient communication as takes place during development, learning, memory formation, and pathogenesis of brain disorders. Confirmation of this idea might help to return the functional Gray synapse concept its central place in neuroscience. Copyright © 2011 Wiley-Liss, Inc.

Effects of support size and orientation on symmetric gaits in free-ranging tamarins of Amazonian Peru: implications for the functional significance of primate gait sequence patterns.

PubMed

Nyakatura, John A; Heymann, Eckhard W

2010-03-01

The adoption of a specific gait sequence pattern during symmetrical locomotion has been proposed to have been a key advantage for the exploitation of the fine branch niche in early primates. Diverse aspects of primate locomotion have been extensively studied in technically equipped laboratory settings, but evolutionary conclusions derived from these investigations have rarely been verified in wild primates. Bridging the gap from the lab to the field, we conducted an actual performance determination of symmetrical gaits in two free-ranging tamarin species (Saguinus mystax and Saguinus fuscicollis) of Amazonian Peru by analyzing high-speed video recordings of naturally occurring locomotor bouts. Tamarins arguably represent viable models for aspects of early primate locomotion. We tested three specific hypotheses derived from laboratory studies to test for the influence of support size and orientation and to gain further insight into the functional significance of primate gait sequence patterns: (1) The tamarins utilize symmetrical gaits at a higher rate on small supports than on larger ones. (2) During symmetrical locomotion on small supports, diagonal sequences are utilized at a higher rate than on larger supports. (3) On inclines, diagonal sequences are predominantly used and on declines, lateral sequences are predominantly used. Our results corroborated hypotheses 1 and 3. We found no clear support for hypothesis 2. In conclusion, our results add to the notion that primate gait plasticity, rather than uniform adoption of diagonal sequence gaits, enabled early primates to accommodate different support types and effectively exploit the small branch niche. Copyright 2009 Elsevier Ltd. All rights reserved.

Modeling integrated cellular machinery using hybrid Petri-Boolean networks.

PubMed

Berestovsky, Natalie; Zhou, Wanding; Nagrath, Deepak; Nakhleh, Luay

2013-01-01

The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM) that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them using such more detailed mathematical models.

Modeling Integrated Cellular Machinery Using Hybrid Petri-Boolean Networks

PubMed Central

Berestovsky, Natalie; Zhou, Wanding; Nagrath, Deepak; Nakhleh, Luay

2013-01-01

The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM) that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them using such more detailed mathematical models. PMID:24244124

Normalisation of brain connectivity through compensatory behaviour, despite congenital hand absence.

PubMed

Hahamy, Avital; Sotiropoulos, Stamatios N; Henderson Slater, David; Malach, Rafael; Johansen-Berg, Heidi; Makin, Tamar R

2015-01-06

Previously we showed, using task-evoked fMRI, that compensatory intact hand usage after amputation facilitates remapping of limb representations in the cortical territory of the missing hand (Makin et al., 2013a). Here we show that compensatory arm usage in individuals born without a hand (one-handers) reflects functional connectivity of spontaneous brain activity in the cortical hand region. Compared with two-handed controls, one-handers showed reduced symmetry of hand region inter-hemispheric resting-state functional connectivity and corticospinal white matter microstructure. Nevertheless, those one-handers who more frequently use their residual (handless) arm for typically bimanual daily tasks also showed more symmetrical functional connectivity of the hand region, demonstrating that adaptive behaviour drives long-range brain organisation. We therefore suggest that compensatory arm usage maintains symmetrical sensorimotor functional connectivity in one-handers. Since variability in spontaneous functional connectivity in our study reflects ecological behaviour, we propose that inter-hemispheric symmetry, typically observed in resting sensorimotor networks, depends on coordinated motor behaviour in daily life.

Artificial neural networks using complex numbers and phase encoded weights.

PubMed

Michel, Howard E; Awwal, Abdul Ahad S

2010-04-01

The model of a simple perceptron using phase-encoded inputs and complex-valued weights is proposed. The aggregation function, activation function, and learning rule for the proposed neuron are derived and applied to Boolean logic functions and simple computer vision tasks. The complex-valued neuron (CVN) is shown to be superior to traditional perceptrons. An improvement of 135% over the theoretical maximum of 104 linearly separable problems (of three variables) solvable by conventional perceptrons is achieved without additional logic, neuron stages, or higher order terms such as those required in polynomial logic gates. The application of CVN in distortion invariant character recognition and image segmentation is demonstrated. Implementation details are discussed, and the CVN is shown to be very attractive for optical implementation since optical computations are naturally complex. The cost of the CVN is less in all cases than the traditional neuron when implemented optically. Therefore, all the benefits of the CVN can be obtained without additional cost. However, on those implementations dependent on standard serial computers, CVN will be more cost effective only in those applications where its increased power can offset the requirement for additional neurons.

Symmetries of the Space of Linear Symplectic Connections

NASA Astrophysics Data System (ADS)

Fox, Daniel J. F.

2017-01-01

There is constructed a family of Lie algebras that act in a Hamiltonian way on the symplectic affine space of linear symplectic connections on a symplectic manifold. The associated equivariant moment map is a formal sum of the Cahen-Gutt moment map, the Ricci tensor, and a translational term. The critical points of a functional constructed from it interpolate between the equations for preferred symplectic connections and the equations for critical symplectic connections. The commutative algebra of formal sums of symmetric tensors on a symplectic manifold carries a pair of compatible Poisson structures, one induced from the canonical Poisson bracket on the space of functions on the cotangent bundle polynomial in the fibers, and the other induced from the algebraic fiberwise Schouten bracket on the symmetric algebra of each fiber of the cotangent bundle. These structures are shown to be compatible, and the required Lie algebras are constructed as central extensions of their! linear combinations restricted to formal sums of symmetric tensors whose first order term is a multiple of the differential of its zeroth order term.

Stability and bifurcation analysis of three-species predator-prey model with non-monotonic delayed predator response

NASA Astrophysics Data System (ADS)

Balilo, Aldrin T.; Collera, Juancho A.

2018-03-01

In this paper, we consider delayed three-species predator-prey model with non-monotonic functional response where two predator populations feed on a single prey population. Response function in both predator populations includes a time delay which represents the gestation period of the predator populations. We call a positive equlibrium solution of the form E*S=(x*,y*,y*) as a symmetric equilibrium. The goal of this paper is to determine the effect of the difference in gestation periods of predator populations to the local dynamics of symmetric equilibria. Our results include conditions on the existence of equilibrium solutions, and stability and bifurcations of symmetric equilibria as the gestation periods of predator populations are varied. A numerical bifurcation analysis tool is also used to illustrate our results. Stability switch occurs at a Hopf bifurcation. Moreover, a branch of stable periodic solutions, obtained using numerical continuation, emerges from the Hopf bifurcation. This shows that the predator population with longer gestation period oscillates higher than the predator population with shorter gestation period.

Transient and asymptotic behaviour of the binary breakage problem

NASA Astrophysics Data System (ADS)

Mantzaris, Nikos V.

2005-06-01

The general binary breakage problem with power-law breakage functions and two families of symmetric and asymmetric breakage kernels is studied in this work. A useful transformation leads to an equation that predicts self-similar solutions in its asymptotic limit and offers explicit knowledge of the mean size and particle density at each point in dimensionless time. A novel moving boundary algorithm in the transformed coordinate system is developed, allowing the accurate prediction of the full transient behaviour of the system from the initial condition up to the point where self-similarity is achieved, and beyond if necessary. The numerical algorithm is very rapid and its results are in excellent agreement with known analytical solutions. In the case of the symmetric breakage kernels only unimodal, self-similar number density functions are obtained asymptotically for all parameter values and independent of the initial conditions, while in the case of asymmetric breakage kernels, bimodality appears for high degrees of asymmetry and sharp breakage functions. For symmetric and discrete breakage kernels, self-similarity is not achieved. The solution exhibits sustained oscillations with amplitude that depends on the initial condition and the sharpness of the breakage mechanism, while the period is always fixed and equal to ln 2 with respect to dimensionless time.

High-Density Liquid-State Machine Circuitry for Time-Series Forecasting.

PubMed

Rosselló, Josep L; Alomar, Miquel L; Morro, Antoni; Oliver, Antoni; Canals, Vincent

2016-08-01

Spiking neural networks (SNN) are the last neural network generation that try to mimic the real behavior of biological neurons. Although most research in this area is done through software applications, it is in hardware implementations in which the intrinsic parallelism of these computing systems are more efficiently exploited. Liquid state machines (LSM) have arisen as a strategic technique to implement recurrent designs of SNN with a simple learning methodology. In this work, we show a new low-cost methodology to implement high-density LSM by using Boolean gates. The proposed method is based on the use of probabilistic computing concepts to reduce hardware requirements, thus considerably increasing the neuron count per chip. The result is a highly functional system that is applied to high-speed time series forecasting.

Biocomputing nanoplatforms as therapeutics and diagnostics.

PubMed

Evans, A C; Thadani, N N; Suh, J

2016-10-28

Biocomputing nanoplatforms are designed to detect and integrate single or multiple inputs under defined algorithms, such as Boolean logic gates, and generate functionally useful outputs, such as delivery of therapeutics or release of optically detectable signals. Using sensing modules composed of small molecules, polymers, nucleic acids, or proteins/peptides, nanoplatforms have been programmed to detect and process extrinsic stimuli, such as magnetic fields or light, or intrinsic stimuli, such as nucleic acids, enzymes, or pH. Stimulus detection can be transduced by the nanomaterial via three different mechanisms: system assembly, system disassembly, or system transformation. The increasingly sophisticated suite of biocomputing nanoplatforms may be invaluable for a multitude of applications, including medical diagnostics, biomedical imaging, environmental monitoring, and delivery of therapeutics to target cell populations. Copyright © 2016 Elsevier B.V. All rights reserved.

Phase-space quantum mechanics study of two identical particles in an external oscillatory potential

NASA Technical Reports Server (NTRS)

Nieto, Luis M.; Gadella, Manuel

1993-01-01

This simple example is used to show how the formalism of Moyal works when it is applied to systems of identical particles. The symmetric and antisymmetric Moyal propagators are evaluated for this case; from them, the correct energy levels of energy are obtained, as well as the Wigner functions for the symmetric and antisymmetric states of the two identical particle system. Finally, the solution of the Bloch equation is straightforwardly obtained from the expressions of the Moyal propagators.

Spectral and textural processing of ERTS imagery. [Kansas

NASA Technical Reports Server (NTRS)

Haralick, R. M.; Bosley, R. J.

1974-01-01

A procedure is developed to simultaneously extract textural features from all bands of ERTS multispectral scanner imagery for automatic analysis. Multi-images lead to excessively large grey tone N-tuple co-occurrence matrices; therefore, neighboring grey N-tuple differences are measured and an ellipsoidally symmetric functional form is assumed for the co-occurrence distribution of multiimage greytone N-tuple differences. On the basis of past data the ellipsoidally symmetric approximation is shown to be reasonable. Initial evaluation of the procedure is encouraging.

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…

Finite basis representations with nondirect product basis functions having structure similar to that of spherical harmonics.

PubMed

Czakó, Gábor; Szalay, Viktor; Császár, Attila G

2006-01-07

The currently most efficient finite basis representation (FBR) method [Corey et al., in Numerical Grid Methods and Their Applications to Schrodinger Equation, NATO ASI Series C, edited by C. Cerjan (Kluwer Academic, New York, 1993), Vol. 412, p. 1; Bramley et al., J. Chem. Phys. 100, 6175 (1994)] designed specifically to deal with nondirect product bases of structures phi(n) (l)(s)f(l)(u), chi(m) (l)(t)phi(n) (l)(s)f(l)(u), etc., employs very special l-independent grids and results in a symmetric FBR. While highly efficient, this method is not general enough. For instance, it cannot deal with nondirect product bases of the above structure efficiently if the functions phi(n) (l)(s) [and/or chi(m) (l)(t)] are discrete variable representation (DVR) functions of the infinite type. The optimal-generalized FBR(DVR) method [V. Szalay, J. Chem. Phys. 105, 6940 (1996)] is designed to deal with general, i.e., direct and/or nondirect product, bases and grids. This robust method, however, is too general, and its direct application can result in inefficient computer codes [Czako et al., J. Chem. Phys. 122, 024101 (2005)]. It is shown here how the optimal-generalized FBR method can be simplified in the case of nondirect product bases of structures phi(n) (l)(s)f(l)(u), chi(m) (l)(t)phi(n) (l)(s)f(l)(u), etc. As a result the commonly used symmetric FBR is recovered and simplified nonsymmetric FBRs utilizing very special l-dependent grids are obtained. The nonsymmetric FBRs are more general than the symmetric FBR in that they can be employed efficiently even when the functions phi(n) (l)(s) [and/or chi(m) (l)(t)] are DVR functions of the infinite type. Arithmetic operation counts and a simple numerical example presented show unambiguously that setting up the Hamiltonian matrix requires significantly less computer time when using one of the proposed nonsymmetric FBRs than that in the symmetric FBR. Therefore, application of this nonsymmetric FBR is more efficient than that of the symmetric FBR when one wants to diagonalize the Hamiltonian matrix either by a direct or via a basis-set contraction method. Enormous decrease of computer time can be achieved, with respect to a direct application of the optimal-generalized FBR, by employing one of the simplified nonsymmetric FBRs as is demonstrated in noniterative calculations of the low-lying vibrational energy levels of the H3+ molecular ion. The arithmetic operation counts of the Hamiltonian matrix vector products and the properties of a recently developed diagonalization method [Andreozzi et al., J. Phys. A Math. Gen. 35, L61 (2002)] suggest that the nonsymmetric FBR applied along with this particular diagonalization method is suitable to large scale iterative calculations. Whether or not the nonsymmetric FBR is competitive with the symmetric FBR in large-scale iterative calculations still has to be investigated numerically.

A Rhizobium radiobacter Histidine Kinase Can Employ Both Boolean AND and OR Logic Gates to Initiate Pathogenesis.

PubMed

Fang, Fang; Lin, Yi-Han; Pierce, B Daniel; Lynn, David G

2015-10-12

The molecular logic gates that regulate gene circuits are necessarily intricate and highly regulated, particularly in the critical commitments necessary for pathogenesis. We now report simple AND and OR logic gates to be accessible within a single protein receptor. Pathogenesis by the bacterium Rhizobium radiobacter is mediated by a single histidine kinase, VirA, which processes multiple small molecule host signals (phenol and sugar). Mutagenesis analyses converged on a single signal integration node, and finer functional analyses revealed that a single residue could switch VirA from a functional AND logic gate to an OR gate where each of two signals activate independently. Host range preferences among natural strains of R. radiobacter correlate with these gate logic strategies. Although the precise mechanism for the signal integration node requires further analyses, long-range signal transmission through this histidine kinase can now be exploited for synthetic signaling circuits. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Gastrointestinal symptoms associated with gastroesophageal reflux disease, and their relapses after treatment with proton pump inhibitors: A systematic review

PubMed Central

Hosseini, Mousalreza; Salari, Roshanak; Shariatmaghani, Somayeh; Birjandi, Batul; Salari, Masoumeh

2017-01-01

Gastroesophageal reflux disease (GERD) is a common functional gastrointestinal disorder with significant effects on the quality of life. The burden of GERD is soaring in Asia. Preventing symptom relapse is a therapeutic goal in GERD patients. Since proton pump inhibitors (PPI) are the first-line treatment of GERD, drug failure has become a major problem in the treatment procedure. We reviewed the literature in order to find articles related to comorbidities and symptoms affecting GERD from 1980 to 2015 via PubMed and Google Scholar using keywords such as ‘Gastroesophageal reflux disease’, ‘Gastrointestinal symptoms’ and Boolean operators (such as AND, OR, NOT). Due to the cost of PPI therapy and the high rate of GERD relapse after PPI therapy, demand for continuing this type of treatment is decreasing. Thus, we need to discover new approaches to treat the disease and also investigate the relationship between the treatment of GERD and its comorbidities and symptoms such as functional constipation. PMID:28848636

Genetic Network Inference: From Co-Expression Clustering to Reverse Engineering

NASA Technical Reports Server (NTRS)

Dhaeseleer, Patrik; Liang, Shoudan; Somogyi, Roland

2000-01-01

Advances in molecular biological, analytical, and computational technologies are enabling us to systematically investigate the complex molecular processes underlying biological systems. In particular, using high-throughput gene expression assays, we are able to measure the output of the gene regulatory network. We aim here to review datamining and modeling approaches for conceptualizing and unraveling the functional relationships implicit in these datasets. Clustering of co-expression profiles allows us to infer shared regulatory inputs and functional pathways. We discuss various aspects of clustering, ranging from distance measures to clustering algorithms and multiple-duster memberships. More advanced analysis aims to infer causal connections between genes directly, i.e., who is regulating whom and how. We discuss several approaches to the problem of reverse engineering of genetic networks, from discrete Boolean networks, to continuous linear and non-linear models. We conclude that the combination of predictive modeling with systematic experimental verification will be required to gain a deeper insight into living organisms, therapeutic targeting, and bioengineering.

Integrating causal reasoning at different levels of abstraction. [in problem-solving system functioning as pilot assistant in commercial air transport emergencies

NASA Technical Reports Server (NTRS)

Hudlicka, Eva; Corker, Kevin

1988-01-01

In this paper, a problem-solving system which uses a multilevel causal model of its domain is described. The system functions in the role of a pilot's assistant in the domain of commercial air transport emergencies. The model represents causal relationships among the aircraft subsystems, the effectors (engines, control surfaces), the forces that act on an aircraft in flight (thrust, lift), and the aircraft's flight profile (speed, altitude, etc.). The causal relationships are represented at three levels of abstraction: Boolean, qualitative, and quantitative, and reasoning about causes and effects can take place at each of these levels. Since processing at each level has different characteristics with respect to speed, the type of data required, and the specificity of the results, the problem-solving system can adapt to a wide variety of situations. The system is currently being implemented in the KEE(TM) development environment on a Symbolics Lisp machine.

Quantum one-way permutation over the finite field of two elements

NASA Astrophysics Data System (ADS)

de Castro, Alexandre

2017-06-01

In quantum cryptography, a one-way permutation is a bounded unitary operator U:{H} → {H} on a Hilbert space {H} that is easy to compute on every input, but hard to invert given the image of a random input. Levin (Probl Inf Transm 39(1):92-103, 2003) has conjectured that the unitary transformation g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \\in {GF}_{{2}^{\\Vert x\\Vert }}, is an information-theoretically secure operator within a polynomial factor. Here, we show that Levin's one-way permutation is provably secure because its output values are four maximally entangled two-qubit states, and whose probability of factoring them approaches zero faster than the multiplicative inverse of any positive polynomial poly( x) over the Boolean ring of all subsets of x. Our results demonstrate through well-known theorems that existence of classical one-way functions implies existence of a universal quantum one-way permutation that cannot be inverted in subexponential time in the worst case.

Symmetric and asymmetric hybrid cryptosystem based on compressive sensing and computer generated holography

NASA Astrophysics Data System (ADS)

Ma, Lihong; Jin, Weimin

2018-01-01

A novel symmetric and asymmetric hybrid optical cryptosystem is proposed based on compressive sensing combined with computer generated holography. In this method there are six encryption keys, among which two decryption phase masks are different from the two random phase masks used in the encryption process. Therefore, the encryption system has the feature of both symmetric and asymmetric cryptography. On the other hand, because computer generated holography can flexibly digitalize the encrypted information and compressive sensing can significantly reduce data volume, what is more, the final encryption image is real function by phase truncation, the method favors the storage and transmission of the encryption data. The experimental results demonstrate that the proposed encryption scheme boosts the security and has high robustness against noise and occlusion attacks.

Rim-Differentiated C5-Symmetric Tiara-Pillar[5]arenes

PubMed Central

2017-01-01

The synthesis of “rim-differentiated” C5-symmetric pillar[5]arenes, whose two rims are decorated with different chemical functionalities, has remained a challenging task. This is due to the inherent statistical nature of the cyclization of 1,4-disubstituted alkoxybenzenes with different substituents, which leads to four constitutional isomers with only 1/16th being rim-differentiated. Herein, we report a “preoriented” synthetic protocol based on FeCl3-catalyzed cyclization of asymmetrically substituted 2,5-dialkoxybenzyl alcohols. This yields an unprecedented 55% selectivity of the C5-symmetric tiara-like pillar[5]arene isomer among four constitutional isomers. Based on this new method, a series of functionalizable tiara-pillar[5]arene derivatives with C5-symmetry was successfully synthesized, isolated, and fully characterized in the solid state. PMID:29220153

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

The Use of Thermal Imaging in the Evaluation of the Symmetry of Muscle Activity in Various Types of Exercises (Symmetrical and Asymmetrical)

PubMed Central

Chudecka, Monika; Lubkowska, Anna; Leźnicka, Katarzyna; Krupecki, Krzysztof

2015-01-01

In order to achieve higher efficiency of training and thus better athletic performance, new research and diagnostic methods are constantly being developed, particularly those that are non-invasive. One such a method is thermography, suitable for quantitative and therefore objective evaluation of variables, such as changes in the temperature of the skin covering working muscles. The aim of this study was to use a thermal imaging infrared camera to evaluate temperature changes of symmetric body surfaces over symmetrically working muscles of male scullers after exercising on a two-oared rowing ergometer and compare these to asymmetrically working muscles of handball players after an endurance training session containing elements of an actual game. In the scullers, the mean temperature of body surfaces was always lower post than pre exercise, with no significant differences in an average temperature drop between the opposite sides, indicating that the work of the muscles involved in the physical exertion on the rowing ergometer was symmetrical. In contrast, in the handball players, skin temperatures in symmetric areas over the asymmetrically working muscles showed statistically significant differences between sides, which was associated with the functional asymmetry of training. This study indicates that thermal imaging may be useful for coaches in the evaluation of technical preparations in sports in which equal involvement of symmetric muscles is a condition of success, e.g. in scullers. PMID:26839614

Optical detection of symmetric and antisymmetric states in double quantum wells at room temperature

NASA Astrophysics Data System (ADS)

Marchewka, M.; Sheregii, E. M.; Tralle, I.; Marcelli, A.; Piccinini, M.; Cebulski, J.

2009-09-01

We studied the optical reflectivity of a specially grown double quantum well (DQW) structure characterized by a rectangular shape and a high electron density at room temperature. Assuming that the QWs depth is known, reflectivity spectra in the mid-IR range allow to carry out the precise measurements of the SAS-gap values (the energy gap between the symmetric and anti-symmetric states) and the absolute energies of both symmetric and antisymmetric electron states. The results of our experiments are in favor of the existence of the SAS splitting in the DQWs at room temperature. Here we have shown that the SAS gap increases proportionally to the subband quantum number and the optical electron transitions between symmetric and antisymmetric states belonging to different subbands are allowed. These results were used for interpretation of the beating effect in the Shubnikov-de Haas (SdH) oscillations at low temperatures (0.6 and 4.2 K). The approach to the calculation of the Landau-levels energies for DQW structures developed earlier [D. Ploch , Phys. Rev. B 79, 195434 (2009)] is used for the analysis and interpretation of the experimental data related to the beating effect. We also argue that in order to explain the beating effect in the SdH oscillations, one should introduce two different quasi-Fermi levels characterizing the two electron subsystems regarding symmetry properties of their wave functions, symmetric and antisymmetric ones. These states are not mixed neither by electron-electron interaction nor probably by electron-phonon interaction.

Quantitative differential phase contrast imaging at high resolution with radially asymmetric illumination.

PubMed

Lin, Yu-Zi; Huang, Kuang-Yuh; Luo, Yuan

2018-06-15

Half-circle illumination-based differential phase contrast (DPC) microscopy has been utilized to recover phase images through a pair of images along multiple axes. Recently, the half-circle based DPC using 12-axis measurements significantly provides a circularly symmetric phase transfer function to improve accuracy for more stable phase recovery. Instead of using half-circle-based DPC, we propose a new scheme of DPC under radially asymmetric illumination to achieve circularly symmetric phase transfer function and enhance the accuracy of phase recovery in a more stable and efficient fashion. We present the design, implementation, and experimental image data demonstrating the ability of our method to obtain quantitative phase images of microspheres, as well as live fibroblast cell samples.

Comparison of analysis and flight test data for a drone aircraft with active flutter suppression

NASA Technical Reports Server (NTRS)

Newsom, J. R.; Pototzky, A. S.

1981-01-01

A drone aircraft equipped with an active flutter suppression system is considered with emphasis on the comparison of modal dampings and frequencies as a function of Mach number. Results are presented for both symmetric and antisymmetric motion with flutter suppression off. Only symmetric results are given for flutter suppression on. Frequency response functions of the vehicle are presented from both flight test data and analysis. The analysis correlation is improved by using an empirical aerodynamic correction factor which is proportional to the ratio of experimental to analytical steady-state lift curve slope. The mathematical models are included and existing analytical techniques are described as well as an alternative analytical technique for obtaining closed-loop results.

ODF Maxima Extraction in Spherical Harmonic Representation via Analytical Search Space Reduction

PubMed Central

Aganj, Iman; Lenglet, Christophe; Sapiro, Guillermo

2015-01-01

By revealing complex fiber structure through the orientation distribution function (ODF), q-ball imaging has recently become a popular reconstruction technique in diffusion-weighted MRI. In this paper, we propose an analytical dimension reduction approach to ODF maxima extraction. We show that by expressing the ODF, or any antipodally symmetric spherical function, in the common fourth order real and symmetric spherical harmonic basis, the maxima of the two-dimensional ODF lie on an analytically derived one-dimensional space, from which we can detect the ODF maxima. This method reduces the computational complexity of the maxima detection, without compromising the accuracy. We demonstrate the performance of our technique on both artificial and human brain data. PMID:20879302

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

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.

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.

Bound states, scattering states, and resonant states in PT -symmetric open quantum systems

NASA Astrophysics Data System (ADS)

Garmon, Savannah; Gianfreda, Mariagiovanna; Hatano, Naomichi

2015-08-01

We study a simple open quantum system with a PT -symmetric defect potential as a prototype in order to illustrate a number of general features of PT -symmetric open quantum systems; however, the potential itself could be mimicked by a number of PT systems that have been experimentally studied quite recently. One key feature is the resonance in continuum (RIC), which appears in both the discrete spectrum and the scattering spectrum of such systems. The RIC wave function forms a standing wave extending throughout the spatial extent of the system and in this sense represents a resonance between the open environment associated with the leads of our model and the central PT -symmetric potential. We also illustrate that as one deforms the system parameters, the RIC may exit the continuum by splitting into a bound state and a virtual bound state at the band edge, a process which should be experimentally observable. We also study the exceptional points appearing in the discrete spectrum at which two eigenvalues coalesce; we categorize these as either EP2As, at which two real-valued solutions coalesce before becoming complex-valued, and EP2Bs, for which the two solutions are complex on either side of the exceptional point. The EP2As are associated with PT -symmetry breaking; we argue that these are more stable against parameter perturbation than the EP2Bs. We also study complex-valued solutions of the discrete spectrum for which the wave function is nevertheless spatially localized, something that is not allowed in traditional open quantum systems; we illustrate that these may form quasibound states in continuum under some circumstances. We also study the scattering properties of the system, including states that support invisible propagation and some general features of perfect transmission states. We finally use our model as a prototype for the construction of scattering states that satisfy PT -symmetric boundary conditions; while these states do not conserve the traditional probability current, we introduce the PT current which is preserved. The perfect transmission states appear as a special case of the PT -symmetric scattering states.

Introduction of functionality, selection of topology, and enhancement of gas adsorption in multivariate metal-organic framework-177.

PubMed

Zhang, Yue-Biao; Furukawa, Hiroyasu; Ko, Nakeun; Nie, Weixuan; Park, Hye Jeong; Okajima, Satoshi; Cordova, Kyle E; Deng, Hexiang; Kim, Jaheon; Yaghi, Omar M

2015-02-25

Metal-organic framework-177 (MOF-177) is one of the most porous materials whose structure is composed of octahedral Zn4O(-COO)6 and triangular 1,3,5-benzenetribenzoate (BTB) units to make a three-dimensional extended network based on the qom topology. This topology violates a long-standing thesis where highly symmetric building units are expected to yield highly symmetric networks. In the case of octahedron and triangle combinations, MOFs based on pyrite (pyr) and rutile (rtl) nets were expected instead of qom. In this study, we have made 24 MOF-177 structures with different functional groups on the triangular BTB linker, having one or more functionalities. We find that the position of the functional groups on the BTB unit allows the selection for a specific net (qom, pyr, and rtl), and that mixing of functionalities (-H, -NH2, and -C4H4) is an important strategy for the incorporation of a specific functionality (-NO2) into MOF-177 where otherwise incorporation of such functionality would be difficult. Such mixing of functionalities to make multivariate MOF-177 structures leads to enhancement of hydrogen uptake by 25%.

Introduction of Functionality, Selection of Topology, and Enhancement of Gas Adsorption in Multivariate Metal–Organic Framework-177

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

Zhang, Yue-Biao; Furukawa, Hiroyasu; Ko, Nakeun

2015-02-25

Metal–organic framework-177 (MOF-177) is one of the most porous materials whose structure is composed of octahedral Zn 4O(-COO) 6 and triangular 1,3,5-benzenetribenzoate (BTB) units to make a three-dimensional extended network based on the qom topology. This topology violates a long-standing thesis where highly symmetric building units are expected to yield highly symmetric networks. In the case of octahedron and triangle combinations, MOFs based on pyrite (pyr) and rutile (rtl) nets were expected instead of qom. In this study, we have made 24 MOF-177 structures with different functional groups on the triangular BTB linker, having one or more functionalities. We findmore » that the position of the functional groups on the BTB unit allows the selection for a specific net (qom, pyr, and rtl), and that mixing of functionalities (-H, -NH 2, and -C 4H 4) is an important strategy for the incorporation of a specific functionality (-NO 2) into MOF-177 where otherwise incorporation of such functionality would be difficult. Such mixing of functionalities to make multivariate MOF-177 structures leads to enhancement of hydrogen uptake by 25%.« less

Inverse bootstrapping conformal field theories

NASA Astrophysics Data System (ADS)

Li, Wenliang

2018-01-01

We propose a novel approach to study conformal field theories (CFTs) in general dimensions. In the conformal bootstrap program, one usually searches for consistent CFT data that satisfy crossing symmetry. In the new method, we reverse the logic and interpret manifestly crossing-symmetric functions as generating functions of conformal data. Physical CFTs can be obtained by scanning the space of crossing-symmetric functions. By truncating the fusion rules, we are able to concentrate on the low-lying operators and derive some approximate relations for their conformal data. It turns out that the free scalar theory, the 2d minimal model CFTs, the ϕ 4 Wilson-Fisher CFT, the Lee-Yang CFTs and the Ising CFTs are consistent with the universal relations from the minimal fusion rule ϕ 1 × ϕ 1 = I + ϕ 2 + T , where ϕ 1 , ϕ 2 are scalar operators, I is the identity operator and T is the stress tensor.

High performance current and spin diode of atomic carbon chain between transversely symmetric ribbon electrodes.

PubMed

Dong, Yao-Jun; Wang, Xue-Feng; Yang, Shuo-Wang; Wu, Xue-Mei

2014-08-21

We demonstrate that giant current and high spin rectification ratios can be achieved in atomic carbon chain devices connected between two symmetric ferromagnetic zigzag-graphene-nanoribbon electrodes. The spin dependent transport simulation is carried out by density functional theory combined with the non-equilibrium Green's function method. It is found that the transverse symmetries of the electronic wave functions in the nanoribbons and the carbon chain are critical to the spin transport modes. In the parallel magnetization configuration of two electrodes, pure spin current is observed in both linear and nonlinear regions. However, in the antiparallel configuration, the spin-up (down) current is prohibited under the positive (negative) voltage bias, which results in a spin rectification ratio of order 10(4). When edge carbon atoms are substituted with boron atoms to suppress the edge magnetization in one of the electrodes, we obtain a diode with current rectification ratio over 10(6).

High performance current and spin diode of atomic carbon chain between transversely symmetric ribbon electrodes

PubMed Central

Dong, Yao-Jun; Wang, Xue-Feng; Yang, Shuo-Wang; Wu, Xue-Mei

2014-01-01

We demonstrate that giant current and high spin rectification ratios can be achieved in atomic carbon chain devices connected between two symmetric ferromagnetic zigzag-graphene-nanoribbon electrodes. The spin dependent transport simulation is carried out by density functional theory combined with the non-equilibrium Green's function method. It is found that the transverse symmetries of the electronic wave functions in the nanoribbons and the carbon chain are critical to the spin transport modes. In the parallel magnetization configuration of two electrodes, pure spin current is observed in both linear and nonlinear regions. However, in the antiparallel configuration, the spin-up (down) current is prohibited under the positive (negative) voltage bias, which results in a spin rectification ratio of order 104. When edge carbon atoms are substituted with boron atoms to suppress the edge magnetization in one of the electrodes, we obtain a diode with current rectification ratio over 106. PMID:25142376

The ordering of symmetric diblock copolymers: A comparison of self-consistent-field and density functional approaches

NASA Astrophysics Data System (ADS)

Nath, Shyamal K.; McCoy, John D.; Curro, John G.; Saunders, Randall S.

1997-02-01

Polymer reference interaction site model (PRISM) based density functional (DF) theory is used to evaluate the structure and thermodynamics of structurally symmetric, freely jointed, diblock chains with 0.50 volume fraction. These results are compared to the results of self-consistent-field (SCF) theory. Agreement between the predictions of the SCF and DF theories is found for the lamella spacing well above the order-disorder transition (ODT) and for the qualitative behavior of the interfacial thickness as a function of both chain length and Flory-Huggins χ parameter. Disagreement is found for the magnitude of the interfacial thickness where DF theory indicates that the thickness is 1.7±0.2 times larger than that predicted by SCF theory. It appears that behavior on the monomer length scale is sensitive to system specific details which are neglected by SCF theory.

Analytical stability criteria for the Caledonian Symmetric Four and Five Body Problems

NASA Astrophysics Data System (ADS)

Steves, Bonnie; Shoaib Afridi, Mohammad; Sweatman, Winston

2017-06-01

Analytical studies of the stability of three or more body gravitational systems are difficult because of the greater number of variables involved with the increasing number of bodies and the limitation of 10 integrals that exist in the gravitational n-body problem. Utilisation of symmetries or the neglecting of the masses of some of the bodies compared to others can simplify the dynamical problem and enable global analytical stability solutions to be derived. These symmetric and restricted few body systems with their analytical stability criterion can then provide useful information on the stability of the general few body system when near symmetry or the restricted situation. Even with symmetrical reductions, analytical stability derivations for four and five body problems are rare. In this paper, we develop an analytical stability criterion for the Caledonian Symmetric Five Body Problem (CS5BP) , a dynamically symmetrical planar problem with two pairs of equal masses and a fifth mass located at the centre of mass. Sundman’s inequality is applied to derive boundary surfaces to the allowed real motion of the system. This enables the derivation of a stability criterion valid for all time for the hierarchical stability of the CS5BP and its subset the Caledonian Symmetric Four Body Problem (CSFBP), where the central mass is taken to be equal to zero. We show that the hierarchical stability depends solely on the Szebehely constant C0, which is a function of the total energy H and angular momentum c. The critical value Ccrit at which the system becomes hierarchically stable for all time depends only on the two mass ratios of the symmetric five body system. We then explore the effect on the stability of the whole system of adding an increasing massive central body. It is shown both analytically and numerically that all CS5BPs and CSFBPs of different mass ratios are hierarchically stable if C0 > 0.0659 and C0 > 0.0465, respectively. The Caledonian Symmetric Four and Five Body gravitational models are relevant to the study of the stability and evolution of symmetric quadruple/quintuple stellar clusters and symmetric exoplanetary systems of two planets orbiting a binary/triplet of stars.

Circularly-symmetric complex normal ratio distribution for scalar transmissibility functions. Part III: Application to statistical modal analysis

NASA Astrophysics Data System (ADS)

Yan, Wang-Ji; Ren, Wei-Xin

2018-01-01

This study applies the theoretical findings of circularly-symmetric complex normal ratio distribution Yan and Ren (2016) [1,2] to transmissibility-based modal analysis from a statistical viewpoint. A probabilistic model of transmissibility function in the vicinity of the resonant frequency is formulated in modal domain, while some insightful comments are offered. It theoretically reveals that the statistics of transmissibility function around the resonant frequency is solely dependent on 'noise-to-signal' ratio and mode shapes. As a sequel to the development of the probabilistic model of transmissibility function in modal domain, this study poses the process of modal identification in the context of Bayesian framework by borrowing a novel paradigm. Implementation issues unique to the proposed approach are resolved by Lagrange multiplier approach. Also, this study explores the possibility of applying Bayesian analysis in distinguishing harmonic components and structural ones. The approaches are verified through simulated data and experimentally testing data. The uncertainty behavior due to variation of different factors is also discussed in detail.

Conformal Collineations of the Ricci and Energy-Momentum Tensors in Static Plane Symmetric Space-Times

NASA Astrophysics Data System (ADS)

Akhtar, S. S.; Hussain, T.; Bokhari, A. H.; Khan, F.

2018-04-01

We provide a complete classification of static plane symmetric space-times according to conformal Ricci collineations (CRCs) and conformal matter collineations (CMCs) in both the degenerate and nondegenerate cases. In the case of a nondegenerate Ricci tensor, we find a general form of the vector field generating CRCs in terms of unknown functions of t and x subject to some integrability conditions. We then solve the integrability conditions in different cases depending upon the nature of the Ricci tensor and conclude that the static plane symmetric space-times have a 7-, 10- or 15-dimensional Lie algebra of CRCs. Moreover, we find that these space-times admit an infinite number of CRCs if the Ricci tensor is degenerate. We use a similar procedure to study CMCs in the case of a degenerate or nondegenerate matter tensor. We obtain the exact form of some static plane symmetric space-time metrics that admit nontrivial CRCs and CMCs. Finally, we present some physical applications of our obtained results by considering a perfect fluid as a source of the energy-momentum tensor.

Scanning properties of large dual-shaped offset and symmetric reflector antennas

NASA Astrophysics Data System (ADS)

Galindo-Israel, Victor; Veruttipong, Watt; Norrod, Roger D.; Imbriale, William A.

1992-04-01

Several characteristics of dual offset (DOSR) and symmetric shaped reflectors are examined. Among these is the amelioration of the added cost of manufacturing a shaped reflector antenna, particularly a doubly curved surface for the DOSR, if adjustable panels, which may be necessary for correction of gravity and wind distortions, are also used for improving gain by shaping. The scanning properties of shaped reflectors, both offset and circularly symmetric, are examined and compared to conic section scanning characteristics. Scanning of the pencil beam is obtained by lateral and axial translation of a single point-source feed. The feed is kept pointed toward the center of the subreflector. The effects of power spillover and aperture phase error as a function of beam scanning is examined for several different types of large reflector designs including DOSR, circularly symmetric large f/D and smaller f/D dual reflector antenna systems. It is graphically illustrated that the Abbe-sine condition for improving scanning of an optical system cannot, inherently, be satisfied in a dual-shaped reflector system shaped for high gain and low feed spillover.

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)

Cutting Force Predication Based on Integration of Symmetric Fuzzy Number and Finite Element Method

PubMed Central

Wang, Zhanli; Hu, Yanjuan; Wang, Yao; Dong, Chao; Pang, Zaixiang

2014-01-01

In the process of turning, pointing at the uncertain phenomenon of cutting which is caused by the disturbance of random factors, for determining the uncertain scope of cutting force, the integrated symmetric fuzzy number and the finite element method (FEM) are used in the prediction of cutting force. The method used symmetric fuzzy number to establish fuzzy function between cutting force and three factors and obtained the uncertain interval of cutting force by linear programming. At the same time, the change curve of cutting force with time was directly simulated by using thermal-mechanical coupling FEM; also the nonuniform stress field and temperature distribution of workpiece, tool, and chip under the action of thermal-mechanical coupling were simulated. The experimental result shows that the method is effective for the uncertain prediction of cutting force. PMID:24790556

Calculation of symmetric and asymmetric vortex seperation on cones and tangent ogives based on discrete vortex models

NASA Technical Reports Server (NTRS)

Chin, S.; Lan, C. Edward

1988-01-01

An inviscid discrete vortex model, with newly derived expressions for the tangential velocity imposed at the separation points, is used to investigate the symmetric and asymmetric vortex separation on cones and tangent ogives. The circumferential locations of separation are taken from experimental data. Based on a slender body theory, the resulting simultaneous nonlinear algebraic equations in a cross-flow plane are solved with Broyden's modified Newton-Raphson method. Total force coefficients are obtained through momentum principle with new expressions for nonconical flow. It is shown through the method of function deflation that multiple solutions exist at large enough angles of attack, even with symmetric separation points. These additional solutions are asymmetric in vortex separation and produce side force coefficients which agree well with data for cones and tangent ogives.

N -tag probability law of the symmetric exclusion process

NASA Astrophysics Data System (ADS)

Poncet, Alexis; Bénichou, Olivier; Démery, Vincent; Oshanin, Gleb

2018-06-01

The symmetric exclusion process (SEP), in which particles hop symmetrically on a discrete line with hard-core constraints, is a paradigmatic model of subdiffusion in confined systems. This anomalous behavior is a direct consequence of strong spatial correlations induced by the requirement that the particles cannot overtake each other. Even if this fact has been recognized qualitatively for a long time, up to now there has been no full quantitative determination of these correlations. Here we study the joint probability distribution of an arbitrary number of tagged particles in the SEP. We determine analytically its large-time limit for an arbitrary density of particles, and its full dynamics in the high-density limit. In this limit, we obtain the time-dependent large deviation function of the problem and unveil a universal scaling form shared by the cumulants.

All-optical transistors and logic gates using a parity-time-symmetric Y-junction: Design and simulation

NASA Astrophysics Data System (ADS)

Ding, Shulin; Wang, Guo Ping

2015-09-01

Classical nonlinear or quantum all-optical transistors are dependent on the value of input signal intensity or need extra co-propagating beams. In this paper, we present a kind of all-optical transistors constructed with parity-time (PT)-symmetric Y-junctions, which perform independently on the value of signal intensity in an unsaturated gain case and can also work after introducing saturated gain. Further, we show that control signal can switch the device from amplification of peaks in time to transformation of peaks to amplified troughs. By using these PT-symmetric Y-junctions with currently available materials and technologies, we can implement interesting logic functions such as NOT and XOR (exclusive OR) gates, implying potential applications of such structures in designing optical logic gates, optical switches, and signal transformations or amplifications.

Wire perturbations in the Staffman-Taylor problem

NASA Technical Reports Server (NTRS)

Hong, D. C.

1988-01-01

Zocchi et al. (1987) discovered that when two wires are symmetrically placed along the center of a Hele-Shaw cell, symmetric but narrow fingers of dimensionless width lambda less than 0.5 develop. The value of lambda decreases as the pushing velocity increases, but at a certain critical finger width the finger suddenly undergoes a transition to the asymmetrical state. A simple theory to predict this critical finger width as a function of D, the dimensionless distance between two wires is developed by assuming that the finger opens up a negative angle at the contact point.

Topological geons with self-gravitating phantom scalar field

NASA Astrophysics Data System (ADS)

Kratovitch, P. V.; Potashov, I. M.; Tchemarina, Ju V.; Tsirulev, A. N.

2017-12-01

A topological geon is the quotient manifold M/Z 2 where M is a static spherically symmetric wormhole having the reflection symmetry with respect to its throat. We distinguish such asymptotically at solutions of the Einstein equations according to the form of the time-time metric function by using the quadrature formulas of the so-called inverse problem for self-gravitating spherically symmetric scalar fields. We distinguish three types of geon spacetimes and illustrate them by simple examples. We also study possible observational effects associated with bounded geodesic motion near topological geons.

First-Order Interfacial Transformations with a Critical Point: Breaking the Symmetry at a Symmetric Tilt Grain Boundary

NASA Astrophysics Data System (ADS)

Yang, Shengfeng; Zhou, Naixie; Zheng, Hui; Ong, Shyue Ping; Luo, Jian

2018-02-01

First-order interfacial phaselike transformations that break the mirror symmetry of the symmetric ∑5 (210 ) tilt grain boundary (GB) are discovered by combining a modified genetic algorithm with hybrid Monte Carlo and molecular dynamics simulations. Density functional theory calculations confirm this prediction. This first-order coupled structural and adsorption transformation, which produces two variants of asymmetric bilayers, vanishes at an interfacial critical point. A GB complexion (phase) diagram is constructed via semigrand canonical ensemble atomistic simulations for the first time.

On the maximum off-axis gain of symmetrical pencil-beam antennas

NASA Technical Reports Server (NTRS)

Sawitz, P. H.

1977-01-01

For a general class of symmetrical pencil-beam antennas, the gain at a given off-axis angle can be maximized by choosing the proper antenna size. The maximum gain at the given angle relative to the on-axis gain is independent of the given angle and dependent only on the main-beam pattern. It is computed here for four commonly used gain functions. Its value, in all cases, is close to 4 dB. This result is important in the definition of service areas for communication and broadcast satellites.

Symmetric Anderson impurity model: Magnetic susceptibility, specific heat and Wilson ratio

NASA Astrophysics Data System (ADS)

Zalom, Peter; Pokorný, Vladislav; Janiš, Václav

2018-05-01

We extend the spin-polarized effective-interaction approximation of the parquet renormalization scheme from Refs. [1,2] applied on the symmetric Anderson model by adding the low-temperature asymptotics of the total energy and the specific heat. We calculate numerically the Wilson ratio and determine analytically its asymptotic value in the strong-coupling limit. We demonstrate in this way that the exponentially small Kondo scale from the strong-coupling regime emerges in qualitatively the same way in the spectral function, magnetic susceptibility and the specific heat.

A Categorification of the Crystal Isomorphism B 1,1 B + B(Lambda i) = B(Lambdasigma (i) and a Graphical Calculus for the Shifted Symmetric Functions

NASA Astrophysics Data System (ADS)

Kvinge, Henry

We prove two results at the intersection of Lie theory and the representation theory of symmetric groups, Hecke algebras, and their generalizations. The first is a categorification of the crystal isomorphism B. (1,1) tensor B1,1 ⊕ B(Lambdai ) ≅ B(Lambdasigma (i)). Here B(Lambdai and B(Lambda sigma(i)) are two affine type highest weight crystals of weight Lambdai and Lambdasigma (i) respectively, sigma is a specific map from the Dynkin indexing set I to itself, and B1,1 is a Kirillov-Reshetikhin crystal. We show that this crystal isomorphism is in fact the shadow of a richer module-theoretic phenomenon in the representation theory of Khovanov-Lauda-Rouquier algebras of classical affine type. Our second result identifies the center EndH'( 1) of Khovanov's Heisenberg category H', as the algebra of shifted symmetric functions Lambda* of Okounkov and Olshanski, i.e. End H'(1) ≅ Lambda*. This isomorphism provides us with a graphical calculus for Lambda*. It also allows us to describe EndH'(1) in terms of the transition and co-transition measure of Kerov and the noncommutative probability spaces of Biane.

Raman bandshape analysis of the symmetric bending vibration in liquid chloroform

NASA Astrophysics Data System (ADS)

Yuan, P.; Schwartz, M.

In order to determine whether accurate rotational diffusion coefficients in liquids may be determined from the bandshapes of isotopically broadened vibrational peaks, we have investigated the isotropic and anisotropic Raman spectra of the ν 3( A1), CCl 3 symmetric bending, vibration in CHCl 3 as a function of temperature in the liquid phase. The spectral lineshapes were fitted by a model containing four Lorentzian/Gaussian summation bands with relative peak intensities equal to the relative abundances of the four isotopic combinations and frequency displacements constrained to values measured in the matrix infrared spectrum. The calculated room temperature perpendicular diffusion coefficient, D⊥ (25°C) = 8.310 10 s -1, was within the range of values reported from Raman measurements on the ν 1, symmetric carbon-hydrogen stretching, vibration, but was somewhat lower than published results from NMR relaxation time measurements, T1( 2D), on CDCl 3, and from dielectric relaxation. The activation energy, Ea( D⊥), determined from the ν 3 bandshape measurements was 30% higher than the average value from the NMR and dielectric studies. The deviation is believed to result from the sensitivity of this quantity to the fractional Lorentzian character of the fitting functions.

Combinatorics of feedback in cellular uptake and metabolism of small molecules.

PubMed

Krishna, Sandeep; Semsey, Szabolcs; Sneppen, Kim

2007-12-26

We analyze the connection between structure and function for regulatory motifs associated with cellular uptake and usage of small molecules. Based on the boolean logic of the feedback we suggest four classes: the socialist, consumer, fashion, and collector motifs. We find that the socialist motif is good for homeostasis of a useful but potentially poisonous molecule, whereas the consumer motif is optimal for nutrition molecules. Accordingly, examples of these motifs are found in, respectively, the iron homeostasis system in various organisms and in the uptake of sugar molecules in bacteria. The remaining two motifs have no obvious analogs in small molecule regulation, but we illustrate their behavior using analogies to fashion and obesity. These extreme motifs could inspire construction of synthetic systems that exhibit bistable, history-dependent states, and homeostasis of flux (rather than concentration).

Reconstruction of an Immune Dynamic Model to Simulate the Contrasting Role of Auxin and Cytokinin in Plant Immunity.

PubMed

Kaltdorf, Martin; Dandekar, Thomas; Naseem, Muhammad

2017-01-01

In order to increase our understanding of biological dependencies in plant immune signaling pathways, the known interactions involved in plant immune networks are modeled. This allows computational analysis to predict the functions of growth related hormones in plant-pathogen interaction. The SQUAD (Standardized Qualitative Dynamical Systems) algorithm first determines stable system states in the network and then use them to compute continuous dynamical system states. Our reconstructed Boolean model encompassing hormone immune networks of Arabidopsis thaliana (Arabidopsis) and pathogenicity factors injected by model pathogen Pseudomonas syringae pv. tomato DC3000 (Pst DC3000) can be exploited to determine the impact of growth hormones in plant immunity. We describe a detailed working protocol how to use the modified SQUAD-package by exemplifying the contrasting effects of auxin and cytokinins in shaping plant-pathogen interaction.

Computing with motile bio-agents

NASA Astrophysics Data System (ADS)

Nicolau, Dan V., Jr.; Burrage, Kevin; Nicolau, Dan V.

2007-12-01

We describe a model of computation of the parallel type, which we call 'computing with bio-agents', based on the concept that motions of biological objects such as bacteria or protein molecular motors in confined spaces can be regarded as computations. We begin with the observation that the geometric nature of the physical structures in which model biological objects move modulates the motions of the latter. Consequently, by changing the geometry, one can control the characteristic trajectories of the objects; on the basis of this, we argue that such systems are computing devices. We investigate the computing power of mobile bio-agent systems and show that they are computationally universal in the sense that they are capable of computing any Boolean function in parallel. We argue also that using appropriate conditions, bio-agent systems can solve NP-complete problems in probabilistic polynomial time.

CRAVE: a database, middleware and visualization system for phenotype ontologies.

PubMed

Gkoutos, Georgios V; Green, Eain C J; Greenaway, Simon; Blake, Andrew; Mallon, Ann-Marie; Hancock, John M

2005-04-01

A major challenge in modern biology is to link genome sequence information to organismal function. In many organisms this is being done by characterizing phenotypes resulting from mutations. Efficiently expressing phenotypic information requires combinatorial use of ontologies. However tools are not currently available to visualize combinations of ontologies. Here we describe CRAVE (Concept Relation Assay Value Explorer), a package allowing storage, active updating and visualization of multiple ontologies. CRAVE is a web-accessible JAVA application that accesses an underlying MySQL database of ontologies via a JAVA persistent middleware layer (Chameleon). This maps the database tables into discrete JAVA classes and creates memory resident, interlinked objects corresponding to the ontology data. These JAVA objects are accessed via calls through the middleware's application programming interface. CRAVE allows simultaneous display and linking of multiple ontologies and searching using Boolean and advanced searches.

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.

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…

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)