Synchronization in asynchronous cellular automata evaluated by local active information storage

2015 ◽  
Author(s):  
Anri Mutoh ◽  
Yukio-Pegio Gunji
Keyword(s):  
Cellular Automata ◽  
Information Storage ◽  
Asynchronous Cellular Automata ◽  
Active Information Storage

scholarly journals Quantifying the Predictability of Visual Scanpaths Using Active Information Storage

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 167
Author(s):  
Patricia Wollstadt ◽  
Martina Hasenjäger ◽  
Christiane B. Wiebel-Herboth
Keyword(s):  
Information Storage ◽  
Gaze Behavior ◽  
Behavioral Experiments ◽  
Human Machine Interaction ◽  
Cognitive States ◽  
Visual Scanpath ◽  
Active Information Storage ◽  
Temporal Horizon ◽  
Machine Interaction ◽  
Transition Entropy

Entropy-based measures are an important tool for studying human gaze behavior under various conditions. In particular, gaze transition entropy (GTE) is a popular method to quantify the predictability of a visual scanpath as the entropy of transitions between fixations and has been shown to correlate with changes in task demand or changes in observer state. Measuring scanpath predictability is thus a promising approach to identifying viewers’ cognitive states in behavioral experiments or gaze-based applications. However, GTE does not account for temporal dependencies beyond two consecutive fixations and may thus underestimate the actual predictability of the current fixation given past gaze behavior. Instead, we propose to quantify scanpath predictability by estimating the active information storage (AIS), which can account for dependencies spanning multiple fixations. AIS is calculated as the mutual information between a processes’ multivariate past state and its next value. It is thus able to measure how much information a sequence of past fixations provides about the next fixation, hence covering a longer temporal horizon. Applying the proposed approach, we were able to distinguish between induced observer states based on estimated AIS, providing first evidence that AIS may be used in the inference of user states to improve human–machine interaction.

Reversible Computation in Asynchronous Cellular Automata

2002 ◽  
pp. 220-229 ◽  
Author(s):  
Jia Lee ◽  
Ferdinand Peper ◽  
Susumu Adachi ◽  
Kenichi Morita ◽  
Shinro Mashiko
Keyword(s):  
Cellular Automata ◽  
Reversible Computation ◽  
Asynchronous Cellular Automata

scholarly journals Local active information storage as a tool to understand distributed neural information processing

2014 ◽  
Vol 8 ◽  
Author(s):  
Michael Wibral ◽  
Joseph T. Lizier ◽  
Sebastian Vögler ◽  
Viola Priesemann ◽  
Ralf Galuske
Keyword(s):  
Information Processing ◽  
Information Storage ◽  
Neural Information ◽  
Neural Information Processing ◽  
Active Information Storage

Asynchronous cellular automata that hide some of the configurations during evolution

2021 ◽  
pp. 2150054
Author(s):  
Souvik Roy ◽  
Sukanta Das
Keyword(s):  
Cellular Automata ◽  
Asynchronous Cellular Automata ◽  
Recent Developments ◽  
Recurrent System ◽  
Asynchronous Updating

In the light of recent developments in the theory of reversibility for asynchronous cellular automata, we attempt to explore the dynamics of recurrent rules under fully asynchronous updating scheme. Depending on the reachability of the configurations for a communication class during the evolution of the system, we classify the recurrent rules into two classes — partially exposed recurrent system and fully exposed recurrent system.

Sign in / Sign up

Export Citation Format

Share Document