Biocomputing Based on DNA Strand Displacement Reactions

The high sequence specificity and precise base complementary pairing principle of DNA provides a rich orthogonal molecular library for molecular programming, making it one of the most promising materials for developing bio-compatible intelligence. In recent years, DNA has been extensively studied and applied in the field of biological computing. Among them, the toehold-mediated strand displacement reaction (SDR) with properties including enzyme free, flexible design and precise control, have been extensively used to construct biological computing circuits. This review provides a systemic overview of SDR design principles and the applications. Strategies for designing DNA-only, enzymes-assisted, other molecules-involved and external stimuli-controlled SDRs are described. The recently realized computing functions and the application of DNA computing in other fields are introduced. Finally, the advantages and challenges of SDR-based computing are discussed.     

Coupling of Biomolecular Logic Gates with Electronic Transducers: From Single Enzyme Logic Gates to Sense/Act/Treat Chips

The integration of biomolecular logic principles with electronic transducers allows designing novel digital biosensors with direct electrical output, logically triggered drug‐release, and closed‐loop sense/act/treat systems. This opens new opportunities for advanced personalized medicine in the context of theranostics. In the present work, we will discuss selected examples of recent developments in the field of interfacing enzyme logic gates with electrodes and semiconductor field‐effect devices. Special attention is given to an enzyme OR/Reset logic gate based on a capacitive field‐effect electrolyte‐insulator‐semiconductor sensor modified with a multi‐enzyme membrane. Further examples are a digital adrenaline biosensor based on an AND logic gate with binary YES/NO output and an integrated closed‐loop sense/act/treat system comprising an amperometric glucose sensor, a hydrogel actuator, and an insulin (drug) sensor.     

Analysis of emitter-coupled multivibrators by singularly perturbed systems

Emitter-coupled multivibrators play a decisive role in electrical engineering, especially for phase locked loops which are key-building blocks of analogue RF front-ends. Since multivibrators correspond to relaxation oscillators, in the following the modelling and analysis by the theory of singularly perturbed systems is presented. Models for fast and slow phenomena are derived, and the fast transients of emitter-coupled multivibrators are analysed for the first time. The results of our analysis lead to significant advantages for the design of electrical multivibrators.     

Logic Regression

Logic regression is an adaptive regression methodology that attempts to construct predictors as Boolean combinations of binary covariates. In many regression problems a model is developed that relates the main effects (the predictors or transformations thereof) to the response, while interactions are usually kept simple (two- to three-way interactions at most). Often, especially when all predictors are binary, the interaction between many predictors may be what causes the differences in response. This issue arises, for example, in the analysis of SNP microarray data or in some data mining problems. In the proposed methodology, given a set of binary predictors we create new predictors such as “X₁, X₂, X³, and X⁴ are true,” or “X⁵ or X⁶ but not X⁷ are true.” In more specific terms: we try to fit regression models of the form g(E[Y]) = b₀ + b₁ L₁ + · · · + b_n L_n , where L_j is any Boolean expression of the predictors. The L_j and b_j are estimated simultaneously using a simulated annealing algorithm. This article discusses how to fit logic regression models, how to carry out model selection for these models, and gives some examples.     

Gentzen型模糊推理

本文建立了能同时处理证据、规则的不确定性以及证据与规则近似匹配的Gentzen型模糊推理的语形方法．     

Nonaxiomatisability of equivalences over finite state processes

This paper considers the existence of finite equational axiomatisations of behavioural equivalences over a calculus of finite state processes. To express even simple properties such as μxE = μxE[E/x] some notation for substitutions is required. Accordingly, the calculus is embedded in a simply typed lambda calculus, allowing such schemas to be expressed as equations between terms containing first order variables. A notion of first order trace congruence over such terms is introduced and used to show that no finite set of such equations is sound and complete for any reasonable equivalence finer than trace equivalence. The intermediate results are then applied to give two nonaxiomatisability results over calculi of regular expressions.     

Feed-forward modelling and fuzzy logic based control strategy for powertrain efficiency improvement in a parallel hybrid electric vehicle

With the stricter limitations on both fuel consumption and air pollution, the advantages of a hybrid electric vehicle are becoming more evident than ever. In the present study, an energy management system for a hybrid electric vehicle is developed. Because the plant under consideration is nonlinear, multi-domain, time-varying, has multiple uncertainties and, in addition, the designed control strategy must be able to obey the driver's commands and achieve the par-internship for a new generation of vehicle regulations, the fuzzy logic approach is chosen. A feed-forward hybrid vehicle simulation model is used to demonstrate the validity and the convenience of the current approach and its results have been compared with the other parallel hybrid electric vehicle control strategies. Simulation results show considerable improvement in the efficiency of the internal combustion engine and, consequently, fuel consumption and acceleration performances.     

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called ’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of ’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].     

Logic optimality for multi-objective optimization

Pareto dominance is one of the most basic concepts in multi-objective optimization. However, it is inefficient when the number of objectives is large because in this case it leads to an unmanageable number of Pareto solutions. In order to solve this problem, a new concept of logic dominance is defined by considering the number of improved objectives and the quantity of improvement simultaneously, where probabilistic logic is applied to measure the quantity of improvement. Based on logic dominance, the corresponding logic nondominated solution is defined as a feasible solution which is not dominated by other ones based on this new relationship, and it is proved that each logic nondominated solution is also a Pareto solution. Essentially, logic dominance is an extension of Pareto dominance. Since there are already several extensions for Pareto dominance, some comparisons are given in terms of numerical examples, which indicates that logic dominance is more efficient. As an application of logic dominance, a house choice problem with five objectives is considered.