Article

Orthogonal organized finite state machine application to sensor acquired information

Authors:

Brian J. d'Auriol,

John Kim,

Sungyoung Lee,

Young-Koo LeeAuthors Info & Claims

PaCT'07: Proceedings of the 9th international conference on Parallel Computing Technologies

Pages 111 - 118

Published: 03 September 2007 Publication History

Publisher Site

Abstract

The application of the Orthogonal Organized Finite State Machine (OOFSM) to the representation of data acquired by sensor networks is proposed. The OOFSM was proposed in earlier work; it is succinctly reviewed here. The approach and representation of the OOFSM to sensor acquired data is formalized. The usefulness of this OOFSM application is illustrated by several case studies, specifically, gradients, contouring and discrete trajectory path determination. In addition, this paper informally discusses the OOFSM as a Cellular Automata.

References

[1]

d'Auriol, B.J.: A finite state machine model to support the visualization of cmplex dynamic systems. In: Proceedings of The, International Conference on Modeling, Simulation and Visualization Methods (MSV'06), pp. 304-310. CSREA Press, Las Vegas (2006)

Google Scholar

[2]

Chong, C.-Y., Kumar, S.P.: Sensor networks: Evolution, opportunities, and challenges 9(8), 1247-1256 (2003)

Google Scholar

[3]

d'Auriol, B.J., Carswell, P., Gecsi, K.: A transdimension visualization model for complex dynamic system visualizations. In: Proceedings of The 2006 International Conference on Modeling, Simulation and Visualization Methods (MSV'06), pp. 318-324. CSREA Press, Las Vegas (2006)

Google Scholar

[4]

Brodlie, K., Carpenter, L.A., Earnshaw, R.A., Gallop, R., Hubbolt, R., Mumford, A.M., Osland, C.D., Quarendon, P. (eds.): Scientific Visualization: Techniques and Applications. Springer, Heidelberg (1992)

Digital Library

Google Scholar

[5]

Ware, C.: Information Visualization Perception for Design, 2nd edn. Morgan Kaufmann, San Francisco (2004)

Digital Library

Google Scholar

[6]

Sarkar, P.: A brief history of cellular automata. ACM Computing Surveys 32(1), 80-107 (2000)

Digital Library

Google Scholar

[7]

d'Auriol, B.J., Bhavsar, V.C.: Generic program concurrent modules for systolic computations. In: Arabnia, H. (ed.) Proc. of the 1999 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), pp. 2012-2018. Las Vegas, Nevada, USA (1999)

Google Scholar

Orthogonal organized finite state machine application to sensor acquired information
1. Theory of computation

Recommendations

From Two-Way to One-Way Finite State Transducers
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Any two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherd son, states that two-way finite state automata (even non-deterministic) characterize ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science

In this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
Residual Finite State Automata
STACS '01: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science

We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular ...

Comments

Information & Contributors

Information

Published In

PaCT'07: Proceedings of the 9th international conference on Parallel Computing Technologies

September 2007

631 pages

ISBN:3540739394

Editor:
Victor Malyshkin
Russian Academy of Sciences, Institute of Computational Mathematics and Mathematical Geophysics, Supercomputer Software Department, Novosibirsk, Russia

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 September 2007

Qualifiers

Article

Recommendations

From Two-Way to One-Way Finite State Transducers

On the power of quantum finite state automata

Residual Finite State Automata

Comments

Published In

Sponsors

Publisher

Publication History

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Abstract

References

Recommendations

From Two-Way to One-Way Finite State Transducers

On the power of quantum finite state automata

Residual Finite State Automata

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations