scholarly journals Robust finite automata in stochastic chemical reaction networks

2021 ◽  
Vol 8 (12) ◽  
Author(s):  
David Arredondo ◽  
Matthew R. Lakin
Keyword(s):  
Finite Automata ◽  
Chemical Species ◽  
State Transitions ◽  
Biomolecular Systems ◽  
Current State ◽  
Input Signals ◽  
Finite State ◽  
The Face ◽  
Approximate Majority ◽  
Control Circuits

Finite-state automata (FSA) are simple computational devices that can nevertheless illustrate interesting behaviours. We propose that FSA can be employed as control circuits for engineered stochastic biological and biomolecular systems. We present an implementation of FSA using counts of chemical species in the range of hundreds to thousands, which is relevant for the counts of many key molecules such as mRNAs in prokaryotic cells. The challenge here is to ensure a robust representation of the current state in the face of stochastic noise. We achieve this by using a multistable approximate majority algorithm to stabilize and store the current state of the system. Arbitrary finite state machines can thus be compiled into robust stochastic chemical automata. We present two variants: one that consumes its input signals to initiate state transitions and one that does not. We characterize the state change dynamics of these systems and demonstrate their application to solve the four-bit binary square root problem. Our work lays the foundation for the use of chemical automata as control circuits in bioengineered systems and biorobotics.

Self-Power Saving Technique in State Machine Circuit of Automatic Teller Machine Application

2019 ◽  
Vol 15 (3) ◽  
pp. 294-301
Author(s):  
Minh-Huan Vo
Keyword(s):  
Finite State Machine ◽  
Power Saving ◽  
State Machine ◽  
Active Power ◽  
The Other ◽  
State Transitions ◽  
Power Gating ◽  
Automatic Teller Machine ◽  
Current State ◽  
Finite State

In a finite state machine (FSM), there is only one active state while the other states are in idle states simultaneously. Thus, only one state is required to power up, the other states can be switched off to save active power. Normally, a backward traversing algorithm is used to label the power gating cells and extract the enable signals for combinational logic gates in reducing the active power consumption. This conventional power gating technique uses the extracted enable signals to turn ON/OFF these inserted NMOS switches. Then, a power management unit is required to manage these enable signals and detect the idle periods. The proposed self-power saving technique uses internally generated enable signals from state transitions to control NMOS switches inserted under the ground rail of each state. All internal enable signals are created to activate/deactivate the machine states at the same time. Based on the next state of the FSM, a decoder creates the enable signals for each state to do power gating in an Automatic Teller Machine (ATM) application. The isolation cell is designed to isolate the current state and next state for retaining data. Simulation results show the power saving from 31.99% at a WAIT state to 82.87% at a LOCK state, depending on the current state of the finite state machine. On average, the power loss is saved up to 63.2% in the FSM. An overhead area is about 12% compared to the conventional technique while timing overhead is under 5%.

scholarly journals Actin Automata with Memory

2016 ◽  
Vol 26 (01) ◽  
pp. 1650019 ◽  
Author(s):  
Ramón Alonso-Sanz ◽  
Andy Adamatzky
Keyword(s):  
Actin Filaments ◽  
State Transitions ◽  
State Machines ◽  
Double Chain ◽  
Neighboring Node ◽  
Current State ◽  
Time Patterns ◽  
Finite State ◽  
With Memory ◽  
Momentary State

Actin is a globular protein which forms long polar filaments in eukaryotic. The actin filaments play the roles of cytoskeleton, motility units, information processing and learning. We model actin filament as a double chain of finite state machines, nodes, which take states “0” and “1”. The states are abstractions of absence and presence of a subthreshold charge on actin units corresponding to the nodes. All nodes update their state in parallel to discrete time. A node updates its current state depending on states of two closest neighbors in the node chain and two closest neighbors in the complementary chain. Previous models of actin automata consider momentary state transitions of nodes. We enrich the actin automata model by assuming that states of nodes depend not only on the current states of neighboring node but also on their past states. Thus, we assess the effect of memory of past states on the dynamics of acting automata. We demonstrate in computational experiments that memory slows down propagation of perturbations, decrease entropy of space-time patterns generated, transforms traveling localizations to stationary oscillators, and stationary oscillations to still patterns.

HYBRID EXTENDED FINITE AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 745-760 ◽  
Author(s):  
HENNING BORDIHN ◽  
MARKUS HOLZER ◽  
MARTIN KUTRIB
Keyword(s):  
Finite Automata ◽  
Input Word ◽  
Finite State Automata ◽  
Computational Power ◽  
Chomsky Hierarchy ◽  
Current State ◽  
Different Types ◽  
Finite State ◽  
Finite Set

Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations. In this paper, five word operations are taken into consideration which always yield letter-equivalent results, namely reversal and shift operations. The computational power of those machines is investigated, locating the corresponding families of languages in the Chomsky hierarchy. Furthermore, different types of hybrid extended finite automata, defined by the set of operations they are allowed to apply, are compared with each other, demonstrating that there exist dependencies and independencies between the input manipulating operations.

scholarly journals Likely Exacerbation of Psychological Disorders from Covid-19 Response

2021 ◽  
Vol 12 ◽  
pp. 215013272110167
Author(s):  
Tara Rava Zolnikov ◽  
Tanya Clark ◽  
Tessa Zolnikov
Keyword(s):  
Psychological Disorders ◽  
Emotional Reactions ◽  
Post Traumatic Stress ◽  
Obsessive Compulsive ◽  
Compulsive Disorder ◽  
Current State ◽  
The Face ◽  
Adults And Children ◽  
Post Traumatic ◽  
Anxiety Depression

Anxiety and fear felt by people around the world regarding the coronavirus pandemic is real and can be overwhelming, resulting in strong emotional reactions in adults and children. With depressive and anxiety disorders already highly prevalent in the general population (300 million worldwide), depression and/or anxiety specifically because of the pandemic response is likely. Moreover, the current state of panic in the face of uncertainty is apt to produce significant amounts of stress. While this situation has the potential to cause psychological disorders in previously unaffected populations, perhaps more impactful is the exacerbation of symptoms of many existing disorders including anxiety, depression, post-traumatic stress disorder (PTSD), obsessive-compulsive disorder (OCD) and hoarding disorder.

scholarly journals Analysis of Educational Data in the Current State of University Learning for the Transition to a Hybrid Education Model

2021 ◽  
Vol 11 (5) ◽  
pp. 2068
Author(s):  
William Villegas-Ch. ◽  
Xavier Palacios-Pacheco ◽  
Milton Roman-Cañizares ◽  
Sergio Luján-Mora
Keyword(s):  
Online Education ◽  
Educational Model ◽  
Hybrid Education ◽  
Face To Face ◽  
Current State ◽  
Use Of Technology ◽  
Technological Advances ◽  
The World ◽  
The Face ◽  
Education Model

Currently, the 2019 Coronavirus Disease pandemic has caused serious damage to health throughout the world. Its contagious capacity has forced the governments of the world to decree isolation and quarantine to try to control the pandemic. The consequences that it leaves in all sectors of society have been disastrous. However, technological advances have allowed people to continue their different activities to some extent while maintaining isolation. Universities have great penetration in the use of technology, but they have also been severely affected. To give continuity to education, universities have been forced to move to an educational model based on synchronous encounters, but they have maintained the methodology of a face-to-face educational model, what has caused several problems in the learning of students. This work proposes the transition to a hybrid educational model, provided that this transition is supported by data analysis to identify the new needs of students. The knowledge obtained is contrasted with the performance presented by the students in the face-to-face modality and the necessary parameters for the transition to this modality are clearly established. In addition, the guidelines and methodology of online education are considered in order to take advantage of the best of both modalities and guarantee learning.

BORDERS AND FINITE AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 859-871
Author(s):  
MARTIN ŠIMŮNEK ◽  
BOŘIVOJ MELICHAR
Keyword(s):  
Pattern Matching ◽  
Hamming Distance ◽  
Finite Automata ◽  
Music Analysis ◽  
Theoretical Description ◽  
Specific Form ◽  
Distance Measures ◽  
Computer Assisted ◽  
Finite State ◽  
Finite State Transducer

A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper offers the automata-theoretical description of Iliopoulos's ALL_BORDERS algorithm. The algorithm finds all borders of a string with don't care symbols. We show that ALL_BORDERS algorithm is an implementation of a finite state transducer of specific form. We describe how such a transducer can be constructed and what should be the input string like. The described transducer finds a set of lengths of all borders. Last but not least, we define approximate borders and show how to find all approximate borders of a string when we concern Hamming distance definition. Our solution of this problem is based on transducers again. This allows us to use analogy with automata-based pattern matching methods. Finally we discuss conditions under which the same principle can be used for other distance measures.

Control Electronics and Hybrid Dynamic System-Based API for a 6-DOF Desktop Haptic Interface

1999 ◽  
Author(s):  
S. E. Salcudean ◽  
R. Six ◽  
R. Barman ◽  
S. Kingdon ◽  
I. Chau ◽  
...  
Keyword(s):  
Dynamic System ◽  
Haptic Interface ◽  
State Transitions ◽  
Hybrid Dynamic System ◽  
Finite State ◽  
Control Electronics ◽  
Six Degree Of Freedom ◽  
Electronic Hardware ◽  
Device Location ◽  
Programming Interface

Abstract A six-degree-of-freedom desktop magnetically levitated haptic interface has been developed by the authors. Its electromechanical design is described in (Salcudean and Parker, 1997). In this paper, aspects of electronic hardware architecture and the control of actuator currents are discussed. To program this device, a new low level applications programming interface (API) that models the haptic interface as a hybrid dynamic system is proposed. The user can define a finite state machine in which every state is a device impedance. State transitions occur upon the satisfaction of linear inequalities in terms of the device location, velocity and force. Examples of the use of such hybrid dynamic systems to produce haptic effects are given.

scholarly journals A unicellular walker embodies a finite state machine

2021 ◽  
Author(s):  
Ben T. Larson ◽  
Jack Garbus ◽  
Jordan B. Pollack ◽  
Wallace F. Marshall
Keyword(s):  
Cell Biology ◽  
General Framework ◽  
Finite State Machine ◽  
Detailed Balance ◽  
State Machine ◽  
Theoretical Computer Science ◽  
State Transitions ◽  
Small Subset ◽  
Finite State ◽  
Computational Processes

Cells are complex biochemical systems whose behavior emerges from interactions among myriad molecular components. The idea that cells execute computational processes is often invoked as a general framework for understanding cellular complexity. However, the manner in which cells might embody computational processes in a way that the powerful theories of computation, such as finite state machine models, could be productively applied, remains to be seen. Here we demonstrate finite state machine-like processing embodied in cells, using the walking behavior of Euplotes eurystomus, a ciliate that walks across surfaces using fourteen motile appendages called cirri. We found that cellular walking entails a discrete set of gait states. Transitions between these states are highly regulated, with distinct breaking of detailed balance and only a small subset of possible transitions actually observed. The set of observed transitions decomposes into a small group of high-probability unbalanced transitions forming a cycle and a large group of low-probability balanced transitions, thus revealing stereotypy in sequential patterns of state transitions. Taken together these findings implicate a machine-like process. Cirri are connected by microtubule bundles, and we find an association between the involvement of cirri in different state transitions and the pattern of attachment to the microtubule bundle system, suggesting a mechanical basis for the regularity of state transitions. We propose a model where the actively controlled, unbalanced transitions establish strain in certain cirri, the release of which from the substrate causes the cell to advance forward along a linear trajectory. This demonstration of a finite state machine embodied in a living cell opens up new links between theoretical computer science and cell biology and may provide a general framework for understanding and predicting cell behavior at a super-molecular level.

scholarly journals RECONFIGURABLE SELF-ADDRESSABLE MEMORY-BASED FSM A SCALABLE INTRUSION DETECTION ENGINE

2012 ◽  
pp. 144-151
Author(s):  
B. SRILATHA ◽  
KRISHNA KISHORE
Keyword(s):  
High Speed ◽  
Finite State Machine ◽  
State Machine ◽  
Network Attack ◽  
Memory Efficiency ◽  
Attack Pattern ◽  
Current State ◽  
Incoming Packet ◽  
Finite State ◽  
Attack Patterns

One way to detect and thwart a network attack is to compare each incoming packet with predefined patterns, also Called an attack pattern database, and raise an alert upon detecting a match. This article presents a novel pattern-matching Engine that exploits a memory-based, programmable state machine to achieve deterministic processing rates that are Independent of packet and pattern characteristics. Our engine is a self addressable memory based finite state machine (samFsm), whose current state coding exhibits all its possible next states. Moreover, it is fully reconfigurable in that new attack Patterns can be updated easily. A methodology was developed to program the memory and logic. Specifically, we merge “non-equivalent” states by introducing “super characters” on their inputs to further enhance memory efficiency without Adding labels. This is the most high speed self addressable memory based fsm.sam-fsm is one of the most storage-Efficient machines and reduces the memory requirement by 60 times. Experimental results are presented to demonstrate the Validity of sam-fsm.

scholarly journals The Meta Machine: Using Automation to Catalyze Leaps Forward in Meta-analytic Reviews

2018 ◽  
Author(s):  
George Christopher Banks ◽  
Dan Foy ◽  
Boyoung Kim ◽  
Joanna Korman ◽  
Matthew Makel ◽  
...  
Keyword(s):  
Shelf Life ◽  
Paper Briefly ◽  
Current State ◽  
The Face ◽  
Meta Analyses

This paper briefly reviews the current state of meta-analytics research and suggests two innovations for dramatically increasing the efficiency and robustness of meta-analytic practice while simultaneously extending meta-analyses’ “shelf life” in the face of continually accumulating evidence.

Sign in / Sign up

Export Citation Format

Share Document