Orthogonal Organized Finite State Machine Application to Sensor Acquired Information

  • Brian J. d’Auriol
  • John Kim
  • Sungyoung Lee
  • Young-Koo Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4671)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    d’Auriol, B.J.: A finite state machine model to support the visualization of cmplex dynamic systems. In: MSV 2006. Proceedings of The, International Conference on Modeling, Simulation and Visualization Methods, pp. 304–310. CSREA Press, Las Vegas (2006)Google Scholar
  2. 2.
    Chong, C.-Y., Kumar, S.P.: Sensor networks: Evolution, opportunities, and challenges 9(8), 1247–1256 (2003)Google Scholar
  3. 3.
    d’Auriol, B.J., Carswell, P., Gecsi, K.: A transdimension visualization model for complex dynamic system visualizations. In: MSV 2006. Proceedings of The 2006 International Conference on Modeling, Simulation and Visualization Methods, pp. 318–324. CSREA Press, Las Vegas (2006)Google Scholar
  4. 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)MATHGoogle Scholar
  5. 5.
    Ware, C.: Information Visualization Perception for Design, 2nd edn. Morgan Kaufmann, San Francisco (2004)Google Scholar
  6. 6.
    Sarkar, P.: A brief history of cellular automata. ACM Computing Surveys 32(1), 80–107 (2000)CrossRefGoogle Scholar
  7. 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 1999), pp. 2012–2018. Las Vegas, Nevada, USA (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Brian J. d’Auriol
    • 1
  • John Kim
    • 1
  • Sungyoung Lee
    • 1
  • Young-Koo Lee
    • 1
  1. 1.Department of Computer Engineering, Kyung Hee UniversityKorea

Personalised recommendations