Virtual social networks online and mobile systems

Mobile Information Systems

Volumn 5, Issue 3, 2009, Pages 233-253

  Safar, Maytham ^a   Sawwan, Hussain ^a   Taha, Mahmoud ^a   Al Fadhli, Talal ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

GIS system; Scale free network; Small world; Social networks; Ubiquitous computing; Virtual communities

Indexed keywords

APPLICATION PROGRAMS; DISTRIBUTED COMPUTER SYSTEMS; LOCATION; LOCATION BASED SERVICES; ONLINE SYSTEMS; SOCIAL SCIENCES COMPUTING; UBIQUITOUS COMPUTING; VIRTUAL REALITY;

GIS SYSTEMS; LOCATION-BASED APPLICATIONS; MOBILE INDUSTRY; MOBILE SYSTEMS; NEW APPLICATIONS; SCALE FREE NETWORKS; SMALL WORLDS; SOCIAL NETWORK; VIRTUAL COMMUNITY; VIRTUAL SOCIAL NETWORKS;

SOCIAL NETWORKING (ONLINE);

EID: 77952896117     PISSN: 1574017X     EISSN: None     Source Type: Journal    
DOI: 10.1155/2009/473571     Document Type: Article

References (29)

1. R. Agrawal, S. Dar and H.V. Jagadish, Direct transitive closure algorithms: design and performance evaluation, ACM Trans Database Syst 15(3) (1990), 427-458.
2. R. Agrawal and H. Jagadish, Algorithms for Searching Massive Graphs, IEEE Transactions on Knowledge and Data Engineering 6(2) (1994), 225-238.
3. R. Albert and A.L. Barabasi, Statistical mechanics of complex networks, Reviews of Modern Physics 74(1).
4. O. Bohl, S. Manouchehri and U. Winand, Mobile information systems for the private everyday life, Mob Inf Syst 3(3,4) (2007), 135-152.
5. J. Breslin and S. Decker, The Future of Social Networks on the Internet: The Need for Semantics, IEEE Internet Computing 11(6) (2007), 86-90.
6. S.C., K.M. and S.M., ARoad Network Embedding Technique for k-Nearest Neighbor Search in Moving Object Databases, ACMGIS, McLean, VA, USA.
7. R.W. Floyd, ACM Algorithm 97: Shortest Path, Communications of the ACM 5(6) (1962), 345.
8. J. Goh and D. Taniar, Mining Frequency Pattern from Mobile Users, in: Proceedings of the 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III, Lecture Notes in Computer Science 3215 (2004), 795-801.
9. J.Y. Goh and D. Taniar, Mobile Data Mining by Location Dependencies, in: IDEAL, pp. 225-231.
10. S.R. Gulliver, G. Ghinea, M. Patel and T. Serif, A context-aware Tour Guide: User implications, Mob Inf Syst 3(2) (2007), 71-88.
11. M.A.W. Houtsma, P.M.G. Apers and S. Ceri, Distributed Transitive Closure Computations: The Disconnection Set Approach, VLDB '90: Proceedings of the 16th International Conference on Very Large Data Bases, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 335-346.
12. M.A.W. Houtsma, P.M.G. Apers and G.L.V. Schipper, Data fRagmentation for Parallel Transitive Closure Strategies, in: Proceedings of the Ninth International Conference on Data Engineering, IEEE Computer Society, Washington, DC, USA, pp. 447-456.
13. M.A.W. Houtsma, A.N. Wilschut and J. Flokstra, Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB, in: VLDB '93: Proceedings of the 19th International Conference on Very Large Data Bases, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 206-217.
14. N. Jing, Y.-W. Huang and E.A. Rundensteiner, Hierarchical Optimization of Optimal Path Finding for Transportation Applications, in: CIKM '96: Proceedings of the fifth international conference on Information and knowledge management, ACM, New York, NY, USA, pp. 261-268.
15. D.B. Johnson, Efficient Algorithms for Shortest Paths in Sparse Networks, J ACM24(1) (1977), 1-13.
16. S. Jung and S. Pramanik, A HiTi Graph Model of Topographical Road Maps in Navigation Systems, Data Engineering, International Conference on 0 (1996), 76-84.
17. S. Jung and S. Pramanik, An efficient path computation model for hierarchically structured topographical road maps, in: Knowledge and Data Engineering, IEEE Transactions on 14(5) (2002), 1029-1046.
18. W. O'Connell, I.T. Ieong, D. Schrader, C. Watson, G. Au, A. Biliris, S. Choo, P. Colin, G. Linderman, E. Panagos, J. Wang, and T.Walter, A Teradata content-based multimedia object manager for massively parallel architectures, SIGMOD Rec 25(2) (1996), 68-78.
19. G. Pilato, A. Augello, G. Vassallo, and S. Gaglio, EHeBby: An evocative humorist chat-bot, Mob Inf Syst 4(3) (2008), 165-181.
20. I. Priggouris, D. Spanoudakis, M. Spanoudakis and S. Hadjiefthymiades, A generic framework for Location-Based Services (LBS) provisioning, Mobile Information Systems 2(2,3) (206), 111-133.
21. sB. R., On a routing problem, Quarterly of Applied Mathematics 16(1), (1958), 87-90.
22. S. Shekhar, A. Kohli and M. Coyle, Path cOmputation Algorithms for Advanced Traveller Information System (ATIS), Proceedings of the Ninth International Conference on Data Engineering, pp. 31-39.
23. I. Sorkhoh, M. Safar and K. Mahdi, Classification of Social Networks, Proceedings of the IADIS (International Association for Development of Information Society) International Conference on WWW/Internet.
24. D.E. W., A note on two problems in connection with graph theory, Numerische Mathematik 1 (1959), 269-271.
25. H. W., J. N. and R. E., A Semi-Materialized View Approach for Route Maintenance in Ivhs, in: Proc. of the 2nd ACM Workshop on Geographic Information Systems, ACM, pp. 144-151.
26. S. Warshall, A Theorem on Boolean Matrices, J ACM9(1) (1962), 11-12.
27. D.J.Watts, Small Worlds: the Dynamics of Networks between Order and Randomness, Princeton University Press, 1999.
28. A.C. Weaver and B B. Morrison, Social Networking, Computer 41(2) (2008), 97-100.
29. Y. wu Huang, N. Jing, and E.A. Rundensteiner, Effective Graph Clustering for Path Queries in Digital Map Databases, in: In Fifth international conference on information and knowledge management (CIKM'96, ACM, pp. 215-222.