Keynote Talks
Special Session
Accepted Papers
Technical Program
Visa / Hotels / Tours
Conference Venue
SoICT 2013 E-Updates
> Click here for the latest conference information
Technical Sponsor:

ACM's logo

Financial Sponsors:

NAS's logo

NAS's logo



SoICT 2010, 2011 & 2012 on:

  ACMDL's logo 

  DBLP's logo 


   5 August 2013    26 August 2013

   3 October 2013

   21 October 2013

   (For each accepted papper!)
    21 October 2013

   5-6 December 2013

SoICT 2013 Organizers:

HUST's logo



Keynote 1: Probabilistic Models for Uncertain Data

  • Speaker: Prof. Pierre Senellart - Telecom ParisTech (France)
  • Abstract: Uncertainty is ubiquitous in the outcome of many automatic processes (such as information extraction, natural language analysis, machine learning, data integration) or for all tasks that involve human judgment, contradicting information, or measurement errors. This uncertainty can be captured by probabilistic models -- probabilistic information can now be stored, queried, updated, aggregated in a well-founded manner. This talk will provide concrete motivation for probabilistic data management, review some of the most important models for probabilistic data (tables, trees) and present some of the important results in this research area, both theoretical and applied. A concrete example of the use of a probabilistic data management system will also be demonstrated.
  • Short biography: Dr. Pierre Senellart is an Associate Professor in the DBWeb team at Telecom ParisTech, the French leading engineering school specializing in information technology. He is an alumnus of the Ecole normale superieure and obtained his M.Sc. (2003) and his Ph.D. (2007) in computer science from Universite Paris-Sud, studying under the supervision of Serge Abiteboul. He was awarded an Habilitation a diriger les recherches in 2012 from Universite Pierre et Marie Curie. Pierre Senellart has published articles in internationally renowned conferences and journals (PODS, AAAI, VLDB Journal, Journal of the ACM, etc.) He has been a member of the program committee and participated in the organization of various international conferences and workshops (including PODS, WWW, VLDB, SIGMOD, ICDE). He is also the Information Director of the Journal of the ACM. His research interests focus around theoretical aspects of database management systems and the World Wide Web, and more specifically on the intentional indexing of the deep Web, probabilistic XML databases, and graph mining.

Keynote 2: Mobile Cloud Technology: mVDI

  • Speaker: Prof. Eui-nam Huh - Kyunghee University (South Korea)
  • Abstract: In this talk, presenter will discuss trends and issues in future mobile service thru Cloud computing including mobile cloud services, mobile virtualization, mobile DaaS, N-Screened mobile services and VDI. From this talk, effective business model also be covered by connecting mobile contents, platform, wearable devices and cloud infrastructure. Also some implemented test results will be shared to help audiences for future mobile cloud service design.
  • Short biography: Eui-Nam Huh has earned BS degree from Busan National University in Korea, Master’s degree in Computer Science from University of Texas, USA in 1995 and PhD degree from the Ohio University, USA in 2002. He was a director of Computer Information Center and Assistant Professor in Sahmyook University, South Korea during the academic year 2001 and 2002. He has also served for the WPDRTS/IPDPS community as program chair in 2003. He has been an editor of Journal of Korean Society for Internet Information and Korea Grid Standard group chair since 2002. He was also an Assistant Professor in Seoul Women’s University, South Korea. Now he is with Kyung Hee University, South Korea as Professor in Dept. of Computer Engineering. His interesting research areas are: High Performance Network, Sensor Network, Distributed Real Time System, Grid Middleware, Monitoring, and Network Security.

Keynote 3: The Dawn of Quantum Communication

  • Speaker: Prof. Pramode Verma - University of Oklahoma (USA)
  • Abstract: Dramatic paradigm shifts over the past few centuries have led to a rich landscape of options in human and machine communication. Communication today is deeply intertwined with our personal and social lives in addition to being a vital part of businesses and government operations—both overt and covert. This talk will address the evolving role that the fundamental laws of quantum physics are likely to play in giving communication yet another dimension in its richness. Quantum communication will bring about not only communication in the form as we know it, but also ensure that it is unconditionally secure as it transits through any medium. Given that information is the currency of a modern society, its security is paramount for the wellbeing of an individual, a society, a nation, or the globe as a whole. The talk will discuss the short history of quantum communication and draw upon the theoretical and experimental work that the author and his colleagues have conducted over the past few years in order to chart out the likely course of future events in this exciting arena of secure communication.
  • Short biography: Pramode Verma is Director of the Tele-communications Engineering Program in the School of Electrical and Computer Engineering of the University of Oklahoma-Tulsa. He also holds the Williams Chair in Telecommunications Networking. Prior to joining the University of Oklahoma in 1999, Dr. Verma held a variety of professional and leadership positions in the telecommunications industry at AT&T Bell Laboratories and Lucent technologies.

Keynote 4: Semantics-based Keyword Search over XML
and Relational Databases

  • Speaker: Prof. Tok Wang LING - National University of Singapore
  • Abstract: Keyword searches on XML and relational databases, as opposed to traditional structured query, have been widely studied in recent years. Users are freed from learning the query languages and database schemas by simply issuing some keywords to query the databases. Unlikely traditional structured query languages that can represent user query request precisely, a keyword query only contains some keywords which may have different interpretations and cannot capture the user’s intension precisely.
    Current approaches to XML keyword search are structure-based because they mainly rely on the exploration of the structure of XML data. They can be classified as tree-based and graph-based search. The tree-based search is used when an XML document is modeled as a tree, i.e. without ID references (IDREFs), while the graph-based search is used for XML documents with IDREFs. Almost all tree-based approaches are based on some variations of LCA (Least Common Ancestor) semantics such as SLCA and ELCA. Due to the unawareness of real semantics in XML data, these LCA-based approaches suffer from several serious limitations such as meaningless answers, duplicated answers, missing answers, and answers which depend highly on the hierarchical structure of the XML data, etc.
    Current approaches to keyword search on relational databases can be classified as data graph based and schema graph based. Data graph based keyword search on relational databases takes a relational database as a data graph where a tuple in the database is represented as a node in the data graph, and a foreign key-key reference between two tuples in the database is represented as an edge between the two nodes which represent the two tuples. An answer of a user keyword query is defined as a minimal connected sub-graph which contains nodes that match keywords in the keyword query. This sort of graph search is equivalent to the Steiner tree problem, which is NP-complete. Research in relational keyword search has been focused on the efficient computation of answers from multiple tuples as well as strategies to rank and output the most relevant ones. Existing relational keyword search techniques suffer from the problems of returning incomplete, duplicated, and meaningless answers. Moreover, the resulting answers highly depend on the schema of the relational database and the difficulty of interpreting the intuitive meanings of the returned Steiner trees as answers.
    We thoroughly point out mismatches between answers returned and the expectations of common users in keyword search in XML and relational databases. Through detailed analysis of these mismatches, we discovered the main reasons for the mismatches are due to the unawareness of the semantics of object, relationship, and attribute of object/relationship in the databases. We refer to them as ORA-semantics. In particular, unawareness of objects causes missing answers, duplicated answer, and meaningless answers. In this talk, we will discuss how ORA-semantics can be used to overcome the above-mentioned problems in existing keyword search approaches and how to improve the effectiveness and performance of keyword search.
  • Short biography: Dr Tok Wang LING is a professor in Computer Science at the National University of Singapore. He was Head of IT Division, Deputy Head of the Department of Information Systems and Computer Science, and Vice Dean of the School of Computing. He received his PhD and Math, both in Computer Science, from University of Waterloo (Canada), and BSc in Mathematics from Nanyang University (Singapore). His current research interests include Database Modeling, Semi-Structured Data Model, XML Twig Pattern Query Processing, XML and Relational Database Keyword Query Processing. He serves/served on the steering committees of 4 international conferences, including ER and DASFAA. He served as Conference Co-chair of 10 international conferences, including ER 2004, DASFAA 2005, SIGMOD 2007, and VLDB 2010. He served as Program Committee Co-chair of 6 international conferences, including DASFAA 1995 and ER 1998, 2003, and 2011. He received the ACM Recognition of Service Award in 2007, the DASFAA Outstanding Contributions Award in 2010, and the Peter P. Chen Award in 2011. He is an ER Fellow.

Copyright © 2013 SoICT; Contact webmaster
The website is optimized for Mozilla Firefox with a screen resolution of 1024x768