Collision-based computing in Belousov–Zhabotinsky medium

A photosensitive sub-excitable Belousov–Zhabotinsky medium exhibits propagating wave fragments that preserve their shapes during substantial periods of time. In numerical studies we show that the medium is a computational universal architectureless system, if presence and absence of wave fragments are interpreted as truth values of Boolean variable. When two or more wave fragments collide they may annihilate, fuse, split or deviate from their original paths, thus values of the logical variables are changed and certain logical gates are realized in result of the collision. We demonstrate exact implementation of basic operations with signals and logical gates in Belousov–Zhabotinsky dynamic circuits. The findings provide a theoretical background for subsequent experimental implementation of collision-based, architectureless, dynamical computing devices in homogeneous active chemical media.     

The emergence of dynamical complexity: An exploration using elementary cellular automata

This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the ECA laws in a “spectrum” of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates “exclusive‐or” and “equivalence” are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. © 2004 Wiley Periodicals, Inc. Complexity 9: 33–42, 2004     

Upper estimate of unreliability of schemes in full finite basis (in <Emphasis Type="Italic">P</Emphasis><Subscript>2</Subscript>) for arbitrary faults of gates

We consider the realization of Boolean functions by circuits with unreliable functional gates in a complete finite basis. We assume that each gate of the circuit is exposed to arbitrarily faults, and the gates faults are statistically independent. We construct the circuits for all Boolean functions and get their upper bound of the unreliability, which depends on the “worst” (the most unreliable) of the basic gate.     

Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates

We consider the problem of the synthesis of the logic networks implementing Boolean functions of n variables and allowing short complete fault detection tests regarding arbitrary stuck-at faults at the outputs of gates. We prove that there exists a basis consisting of two Boolean functions of at most four variables in which we can implement each Boolean function by a network allowing such a test with length at most 2.     

Are complex systems hard to evolve?

Evolutionary complexity is measured here by the number of trials/evaluations needed for evolving a logical gate in a nonlinear medium. Behavioral complexity of the gates evolved is characterized in terms of cellular automata behavior. We speculate that hierarchies of behavioral and evolutionary complexities are isomorphic up to some degree, subject to substrate specificity of evolution, and the spectrum of evolution parameters. © 2009 Wiley Periodicals, Inc. Complexity, 2009     

Reconfigurable chaotic logic gates based on novel chaotic circuit

The logical operations are one of the key issues in today’s computer architecture. Nowadays, there is a great interest in developing alternative ways to get the logic operations by chaos computing. In this paper, a novel implementation method of reconfigurable logic gates based on one-parameter families of chaotic maps is introduced. The special behavior of these chaotic maps can be utilized to provide same threshold voltage for all logic gates. However, there is a wide interval for choosing a control parameter for all reconfigurable logic gates. Furthermore, an experimental implementation of this nonlinear system is presented to demonstrate the robustness of computing capability of chaotic circuits.     

Glider-based computing in reaction-diffusion hexagonal cellular automata

A three-state hexagonal cellular automaton, discovered in [Wuensche A. Glider dynamics in 3-value hexagonal cellular automata: the beehive rule. Int J Unconvention Comput, in press], presents a conceptual discrete model of a reaction-diffusion system with inhibitor and activator reagents. The automaton model of reaction-diffusion exhibits mobile localized patterns (gliders) in its space–time dynamics. We show how to implement the basic computational operations with these mobile localizations, and thus demonstrate collision-based logical universality of the hexagonal reaction-diffusion cellular automaton.     

Modeling framework for optimal evacuation of large-scale crowded pedestrian facilities

The paper presents a simulation–optimization modeling framework for the evacuation of large-scale pedestrian facilities with multiple exit gates. The framework integrates a genetic algorithm (GA) and a microscopic pedestrian simulation–assignment model. The GA searches for the optimal evacuation plan, while the simulation model guides the search through evaluating the quality of the generated evacuation plans. Evacuees are assumed to receive evacuation instructions in terms of the optimal exit gates and evacuation start times. The framework is applied to develop an optimal evacuation plan for a hypothetical crowded exhibition hall. The obtained results show that the model converges to a superior optimal evacuation plan within an acceptable number of iterations. In addition, the obtained evacuation plan outperforms conventional plans that implement nearest-gate immediate evacuation strategies.     

Universal computation in fluid neural networks

Fluid neural networks can be used as a theoretical framework for a wide range of complex systems as social insects. In this article we show that collective logical gates can be built in such a way that complex computation can be possible by means of the interplay between local interactions and the collective creation of a global field. This is exemplified by a NOR gate. Some general implications for ant societies are outlined. © 1996 John Wiley & Sons, Inc.     

On dynamically non-trivial three-valued logics: oscillatory and bifurcatory species

We interpret three-valued logical systems as pools of abstract chemical species, logical variables, where chemical reactions are catalyzed by logical connectives; then we study global- and space-time dynamics of these ‘logical’ chemical reactors. We develop a family of combinatorial systems {T,F,*},, where T, F and * are truth-values, is commutative binary operator, acts as a Boolean conjunction on {T,F};**=*, T*=a and F*=b, a,b{T,F,*}. We consider nine combinatorial systems of the family, specified by values of a and b, and derive from each member ab of the family an artificial chemical system, where interactions between reactants T, F and * are governed by . Computational experiments with well-stirred reactors show that all systems but T* and *T exhibit a dull behaviour and converge to their only stable points. In reactor of the system T*, catalyzed by , concentrations of reactants oscillate while reactor of the system *T finishes its evolution in one of two stable points; thus we call the models of T* and *T oscillatory and bifurcatory systems. We enrich the systems with negation connective, define additional connectives via ¬ and and undertake a detailed study of integral dynamic of the artificial stirred chemical reactors and of space-time dynamic of thin-layer non-stirred chemical reactors derived from the logical connectives. The thin-layer reactors show rich space-time dynamic ranging from breathing patterns and mobile localizations to fractal structures. A primitive hierarchy of connectives’ phenomenological complexity is constructed.     

Dynamic properties of the oregonator model with delay

Delayed feedbacks are quite common in many&nbsp;physical and biological systems and in particular many physiological systems. Delay can cause a stable system to become unstable and vice versa. One of the well-studied non-biological chemical oscillators is the Belousov-Zhabotinsky(BZ) reaction. This paper presents an investigation of stability and Hopf bifurcation of the&nbsp;Oregonator model with delay. We analyze the stability of the equilibrium by using linear stability method. When the eigenvalues of the characteristic equation associated with the linear part are pure imaginary, we obtain the corresponding delay value. We find that stability of the steady state changes when the delay passes through the critical value. Then, we calculate the explicit formulae for determining the direction of the Hopf bifurcation and the stability of these periodic solutions bifurcating from the steady states, by using the normal form theory and the center manifold theorem. Finally, numerical simulations results are given to support the theoretical predictions by using Matlab and DDE-Biftool.     

Switching and enhanced bistability in an asymmetric nonlinear directional coupler with a metamaterial channel

We numerically simulate the propagation and switching of ultra-short pulses in a metamaterial nonlinear directional asymmetric coupler where one of the guides is a conventional medium with a positive refraction index having a decreasing Kerr nonlinearity. The second guide is based in a metamaterial. A complete study of the nonlinear dynamics of ultra-short pulses propagation and switching in this new nonlinear directional coupler, including the transmission characteristics, bistability, critical power, compression factor and extinction coefficients are presented and compared to those of a conventional coupler. We conclude that the conventional coupler has higher transmission efficiency and extinction rate when compared with the metamaterial coupler. However the metamaterial coupler presents bistability which opens the possibility of such device to be used in a large variety of optical switching, storage and logical gates. We show that the input power range leading to bistability can be optimized by controlling the profile of the nonlinear refraction index of the conventional channel.     

On the exact value of the length of the minimal single diagnostic test for a particular class of circuits

Under consideration is the problem of synthesis of irredundant logic circuits in the basis {&, ∨, ¬} which implement Boolean functions of n variables and allow some short single diagnostic tests regarding uniform constant faults at outputs of gates. For each Boolean function permitting implementation by an irredundant circuit, the minimal possible length value of such a test is found. In particular, we prove that this value is at most 2.     

Logic of Determination of Objects (LDO): How to Articulate ��Extension�� with ��Intension�� and ��Objects�� with ��Concepts��

From a logical viewpoint, object is never defined, even by a negative definition. This paper is a theoretical contribution about object using a new constructivist logical approach called Logic of Determination of Objects founded on a basic operation, called determination. This new logic takes into account cognitive problems such as the inheritance of properties by non typical occurrences or by indeterminate atypical objects in opposition to prototypes that are typical completely determinate objects. We show how extensional classes, intensions, more and less determined objects, more or less typical representatives of a concept and prototypes are defined and organized, using a determination operation that constructs a class of indeterminate objects from an object representation of a concept called typical object.     

A stochastic and asymmetric-information framework for a dominant-manufacturer supply chain

Consider a dominant manufacturer wholesaling a product to a retailer, who in turn retails it to the consumers at $p/unit. The retail-market demand volume varies with p according to a given demand curve. This basic system is commonly modeled as a manufacturer-Stackelberg ([mS]) game under a “deterministic and symmetric-information” (“det-sym-i”) framework. We first explain the logical flaws of this framework, which are (i) the dominant manufacturer-leader will have a lower profit than the retailer under an iso-elastic demand curve; (ii) in some situations the system’s “correct solution” can be hyper-sensitive to minute changes in the demand curve; (iii) applying volume discounting while keeping the original [mS] profit-maximizing objective leads to an implausible degenerate solution in which the manufacturer has dictatorial power over the channel. We then present an extension of the “stochastic and asymmetric-information” (“sto-asy-i”) framework proposed in Lau and Lau [Lau, A., Lau, H.-S., 2005. Some two-echelon supply-chain games: Improving from deterministic–symmetric-information to stochastic-asymmetric-information models. European Journal of Operational Research 161 (1), 203–223], coupled with the notion that a profit-maximizing dominant manufacturer may implement not only [mS] but also “[pm]”—i.e., using a manufacturer-imposed maximum retail price. We show that this new framework resolves all the logical flaws stated above. Along the way, we also present a procedure for the dominant manufacturer to design a profit-maximizing volume-discount scheme using stochastic and asymmetric demand information.     

Fuzzy processing in transitivity development

We review the literature on the development of transitive reasoning, and note three historical stages. Stage 1 was dominated by the Piagetian idea that transitive inference is logical reasoning in which relationships between adjacent terms figure as premises. Stage 2 was dominated by the information-processing view that memory for relationships between adjacent terms is determinative in transitivity performance. Stage 3 has produced data that are inconsistent with both the logic and memery positions, leading to a new theory that is designed to account for such findings, fuzzy-trace theory. The basic assumption of fuzzytrace theory is that reasoners rely on global patterns, or gist. We describe the tenets of fuzzytrace theory, and explore its implications for different theoretical conceptions of logical competence, concluding that young children possess transitivity competence. We discuss the connection between transitivity competence (cognition) and intransitive preferences (metacognition).     

Very large cliques are easy to detect

It is known that, for every constant k?3, the presence of a k-clique (a complete sub-graph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit using much fewer than n^k gates. We show that, for every constant k, the presence of an (n-k)-clique in an n-vertex graph can be detected by a monotone circuit using only a logarithmic number of fanin-2 OR gates; the total number of gates does not exceed O(n²logn). Moreover, if we allow unbounded fanin, then a logarithmic number of gates is enough.     

Investigations of isotropy and homogeneity of spacetime in first-order logic

We investigate the logical connection between (spatial) isotropy, homogeneity of space, and homogeneity of time within a general axiomatic framework. We show that isotropy not only entails homogeneity of space, but also, in certain cases, homogeneity of time. In turn, homogeneity of time implies homogeneity of space in general, and the converse also holds true in certain cases.An important innovation in our approach is that formulations of physical properties are simultaneously empirical and axiomatic (in the sense of first-order mathematical logic). In this case, for example, rather than presuppose the existence of spacetime metrics – together with all the continuity and smoothness apparatus that would entail – the basic logical formulas underpinning our work refer instead to the sets of (idealised) experiments that support the properties in question, e.g., isotropy is axiomatised by considering a set of experiments whose outcomes remain unchanged under spatial rotation. Higher-order constructs are not needed.     

Simulation-based collaborative decision support for surge floods prevention in St. Petersburg

The paper aims to implement a simulation-based collaborative decision support approach for flood control management in application to St. Petersburg surge floods, which are prevented by a complex of dams with several large openings. Despite the evolution of the numerical hydrodynamic models, hardware performance and computer technologies the accurate forecasting of storm surges and decision support for gates maneuvering is still an important issue. The prospective architecture and principal solutions of Flood Warning System with the emphasis on the simulation-based approach and collaborative decision support system on the basis of e-Science platform CLAVIRE are considered.     

Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence

We study hidden-variable models from quantum mechanics and their abstractions in purely probabilistic and relational frameworks by means of logics of dependence and independence, which are based on team semantics. We show that common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae. Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria. We also discuss the ‘no-go’ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.