Skip to main content

Selection of Points Inside Cutoff Radius by Scanning All Points Sorted in Memory

  • Conference paper
Book cover Soft Computing in Industrial Applications

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 75))

  • 949 Accesses

Abstract

A method for selection inside-cutoff points from a cloud of finite number of points was presented. The cutoff points are in less or equal distance from reference object than a given radius. This radius is user-defined input value. The proposed algorithm was inspired by a function of ribosome. Ribosome in living cells translates linear structure of ribonucleic acid to the complex structure of protein. In the virtual model of ribosome, similar functions were programmed. The linear structure of messenger-RNA was replaced by RAM. Programme immitated slider traversing the RAM. Inside the slider, there was linked list or binary search tree acting similarly like translation RNA in ribosome. The method applied to the searching the cutoff-points showed acceleration in comparison to classic methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zidek, J., Kucera, J., Jancar, J.: Model of Randomly distributed set of nonintersecting particles with controlled macroscopic homogeneity. Aglomer software webpage, http://aglomer.webnode.cz

  2. He, W., Hua, X., Zhao, L., Liao, X., Zhang, Y., Zhang, M., Wu, J.: Food Research International 42, 1462–1467 (2009)

    Google Scholar 

  3. Moore, A.W.: An introductory tutorial on kd trees, extracted from PhD. Thesis Efficient Memory based Learning for Robot Control, Computer Laboratory, University of Cambridge (1991)

    Google Scholar 

  4. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (1996)

    Google Scholar 

  5. Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: OPTICS: Ordering Points To Identify the Clustering Structure. In: ACM SIGMOD international conference on Management of data, pp. 49–60. ACM Press, New York (1999)

    Google Scholar 

  6. Rapaport, D.C.: The art of Molecular Dynamics Simulation, 2nd edn. Cambridge University Press, Cambridge (2004)

    MATH  Google Scholar 

  7. Rodrigues, C.I., Hardy, D.J., Stone, J.E., Schulten, K., Hwu, W.-M.W.: GPU Acceleration of Cutoff Pair Potentials for Molecular Modeling Applications. In: Proceedings of the 5th conference on Computing frontiers, Ischia, Italy, pp. 273–282 (2008)

    Google Scholar 

  8. Li, A., Horvath, S.: Network neighborhood analysis with the multinode topological overlap measure. Bioinformatics 23, 222–231 (2007)

    Article  Google Scholar 

  9. Toda, A., Okamura, M., Taguchi, K., Hikosaka, M., Kajioka, H.: Branching and Higher Order Structure in Banded Polyethylene Spherulites. Macromolecules 41, 2484–2493 (2008)

    Article  Google Scholar 

  10. Beier, W.: Biofysika Academia, 1974, Translated from: Biophysik. 3rd edn. Georg Thieme Leipzig (1968)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zidek, J. (2010). Selection of Points Inside Cutoff Radius by Scanning All Points Sorted in Memory. In: Gao, XZ., Gaspar-Cunha, A., Köppen, M., Schaefer, G., Wang, J. (eds) Soft Computing in Industrial Applications. Advances in Intelligent and Soft Computing, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11282-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11282-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11281-2

  • Online ISBN: 978-3-642-11282-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics