Semantic interoperability and information fluidity

International Journal of Cooperative Information Systems

Volumn 15, Issue 1, 2006, Pages 1-21

  Jiang, Guofei ^a   Cybenko, George ^b   Hendler, James A ^c  

^a NEC LABORATORIES AMERICA   (United States)

^b DARTMOUTH COLLEGE   (United States)

^c Institute of Advanced Computer Science   (United States)

Author keywords

Distributed systems; Graph theory; Information fluidity; Ontology mapping; Semantic interoperability

Indexed keywords

EID: 32644439547     PISSN: 02188430     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218843006001268     Document Type: Article

References (24)

1. World Wide Consortium (W3C): Semantic web activity, http://www.w3.org/ 2001/sw/.
2. T. Berners-Lee, J. Hendler and O. Lassila, The semantic web, Scientific American 284(5) (2001) 34-43.
3. T. Gruber, A translation approach to portable ontologies, Knowledge Acquisition 5(2) (1993) 199-220.
4. J. Hendler, Agents on the semantic web, IEEE Intelligent Systems 16(2) (2001) 30-37.
5. H. Chalupsky, OntoMorph: A translation system for symbolic knowledge, in Proc. 7th Int. Conf. Principles of Knowledge Representation and Reasoning, eds. A. Cohn, F. Giunchiglia and B. Selman (2000), pp. 471-482.
6. V. Kashyap and A. Sheth, Semantic and schematic similarities between database objects: A context approach, VLDB Journal 5(4) (1996) 276-304.
7. W. Kim and J. Seo, Classifying schematic and data heterogeneity in multidatabase systems, IEEE Computer 24(12) (1991) 12-18.
8. D. Dou, D. McDermott and P. Qi, Ontology translation by ontology merging and automated reasoning, in Proc. EKAW Workshop on Ontologies for Multi-Agent Systems (2002).
9. A. Doan, J. Madhavan, P. Domingos and A. Halevy, Learning to map between ontologies on the semantic web, in Proc. World Wide Web Conf. 2002 (2002), pp. 662-673.
10. E. Mena, A. Illarramendi, V. Kashyap and A. Sheth, OBSERVER: An approach for query processing in global information systems based on interoperation across preexisting ontologies, Int. J. Distributed and Parallel Databases 8(2) (2000) 223-271.
11. E. Mena, V. Kashyap, A. Illarramendi and A. Sheth, Imprecise answers on highly open and distributed environments: An approach based on information loss for multiontology based query processing, Int. J. Cooperative Information Systems (IJCIS) 9(4) (2000) 403-425.
12. W. Aiello, F. Chung and L. Lu, Random evolution in massive graphs, in Handbook on Massive Data Sets, eds. J. Abello et al. (Kluwer Academic Publishers, 2002), pp. 97-122.
13. R. Albert and A. Barabasi, Statistical mechanics of complex networks, Reviews of Modern Physics 74(1) (2002) 47-97.
14. A. Barabasi, R. Albert and H. Jeong, Mean-field theory for scale-free networks, Physica A 272 (1999) 173-187.
15. F. Chung and L. Lu, Connected components in random graphs with given expected degree sequences, Annals of Combinatorics 6(2) (2002) 125-145.
16. B. Bollobas, Modern Graph Theory (Springer, 1998).
17. F. Chung, L. Lu and V. Vu, Spectra of random graphs with given expected degrees, in Proc. National Academy of Science 100(11) (2003) 6313-6318.
18. W. Aiello, F. Chung and L. Lu, A random graph model for massive graphs, in Proc. 32nd Annual ACM Symposium on Theory of Computing (2000), pp. 171-180.
19. D. Watts and S. Strogatz, Collection dynamics of "small-world" networks, Nature 393 (1998) 440-442.
20. M. Newman, The structure and functions of complex networks, SIAM Review 45(2) (2003) 167-256.
21. A. Barabasi and R. Albert, Emergence of scaling in random networks, Science 286(509) (1999) 509-512.
22. A. Broder, R. Kumar, F. Maghoul, S. Rajagopalan, R. Stata, A. Tomkins and J. Wiener, Graph structure in the web, in Proc. 9th WWW/Computer Networks 33, (2000), pp. 309-320.
23. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal, Stochastic models for the web graph, in Proc. 41st IEEE Conf. Foundation of Computer Science (2000), pp. 57-66.
24. S. Dill, R. Kumar, K. Mccurley, S. Rajagopalan, D. Sivakumar and A. Tomkins, Self-similarity in the web, ACM Transactions on Internet Technology 2(3) (2002) 205-223.