Skip to main content
SpringerLink
Log in

ACO for Solving the Distributed Allocation of a Corporate Semantic Web

  • Conference paper
Book cover MICAI 2009: Advances in Artificial Intelligence (MICAI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5845))

Included in the following conference series:

  • 1539 Accesses

Abstract

This paper outlines a general method for allocating a document collection over a distributed storage system. Documents are organized to make up a corporate semantic web featured by a graph G 1, each of whose nodes represents a set of documents having a common range of semantic indices. There exists a second graph G 2 modelling the distributed storage system. Our approach consists of embedding G 1 into G 2, under size restrictions. We use a meta-heuristic called “Ant Colony Optimization”, to solve the corresponding instances of the graph embedding problem, which is known to be a NP problem. Our solution provides an efficient mechanism for information storage and retrieval.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Scientific American, 28–37 (2001)

    Google Scholar 

  2. Dieng-Kuntz, R.: Corporate Semantic Webs. ERCIM News 51, 19–21 (2002)

    Google Scholar 

  3. Yanilos, P., Sobti, S.: The evolving field of distributed storage. IEEE Internet Computing 5(5), 35–39 (2001)

    Article  Google Scholar 

  4. Kubiatowicz, J., et al.: OceanStore: An architecture for global-scale persistent storage. SIGARCH Comput. Archit. News. 28(5), 190–201 (2000)

    Article  Google Scholar 

  5. Kuntz, P., Layzell, P., Snyers, D.: A colony of ant-like agents for partitioning in VLSI technology. In: Husbands, P., Harvey, I. (eds.) Proceedings of the Fourth European Conference on Artificial Life, pp. 417–424. MIT Press, Cambridge (1997)

    Google Scholar 

  6. Newsome, J., Song, D.: GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information. In: Proceedings of the 1st international conference on Embedded networked sensor systems, SenSys 2003, pp. 76–88. ACM, New York (2003)

    Chapter  Google Scholar 

  7. Bhatt, S.N., Ipsen, I.C.F.: How to embed trees in hypercubes. Yale University, Dept. of Computer Science. Research Report YALEU/DCS/RR-443 (1985)

    Google Scholar 

  8. Chan, M.Y., Chin, F.Y.L.: On embedding rectangular grids in hypercubes. IEEE Transactions on Computers 37(10), 1285–1288 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM Journal on Discrete Mathematics 12(1), 6–26 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gagarin, A., Kocay, W., Neilson, D.: Embeddings of Small Graphs on the Torus. CUBO 5, 171–251 (2003)

    Google Scholar 

  11. Erten, C., Kobourov, S.G.: Simultaneous Embedding of Planar Graphs with Few Bends. Journal of Graph Algorithms and Applications 9(3), 347–364 (2005)

    MATH  MathSciNet  Google Scholar 

  12. Savage, J.E., Wloka, M.G.: MOB a parallel heuristic for graph embedding. Technical Report CS-93-01, Brown University, Dep. Computer Science (1993)

    Google Scholar 

  13. Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D. Thesis, Dept. of Electronics, Politecnico di Milano, Italy (1992)

    Google Scholar 

  14. Gutjahr, W.: A generalized convergence result for the graph-based ant system metaheuristic. University of Vienna, Technical Report 99-09 (1999)

    Google Scholar 

  15. Cidon, I.: Yet Another Distributed Depth-First-Search Algorithm. Information Processing Letters 26(6), 301–305 (1988)

    Article  Google Scholar 

  16. Segall, A.: Distributed network protocols. IEEE Transaction on Information Theory 29(1), 23–25 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  17. Johnson Norman, L., Leone Fred, C.: Statistics and Experimental Design in Engineering and the Physical Sciences, 2nd edn. vol. 1 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Universidad Autónoma Metropolitana - Iztapalapa, Atlixco, 186, DF, México

    Ana B. Rios-Alvarado, Ricardo Marcelín-Jiménez & R. Carolina Medina-Ramírez

Authors
  1. Ana B. Rios-Alvarado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ricardo Marcelín-Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Carolina Medina-Ramírez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centro de Investigación en Matemáticas, AC. (CIMAT), Area de Computación, Calle Jalisco S/N, Mineral de Valenciana, Guanajuato, CP 36250, Guanajuato, México

    Arturo Hernández Aguirre

  2. Ciencias de la Computación, Tecnológico de Monterrey, Campus Estado de México, Carretera al lago de Guadalupe Km 3,5, Col. Margarita Maza de Juárez, Atizapán de Zaragoza,, CP 52926, Estado de México, México

    Raúl Monroy Borja

  3. Instituto Nacional de Astrofísica, Optica y Electrónica (INAOE), Ciencias Computacionales, Luis Enrique Erro No. 1, Santa María Tonantzintla, CP 72840, Puebla, México

    Carlos Alberto Reyes Garciá

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rios-Alvarado, A.B., Marcelín-Jiménez, R., Medina-Ramírez, R.C. (2009). ACO for Solving the Distributed Allocation of a Corporate Semantic Web. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds) MICAI 2009: Advances in Artificial Intelligence. MICAI 2009. Lecture Notes in Computer Science(), vol 5845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05258-3_3

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05257-6

  • Online ISBN: 978-3-642-05258-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation