On the Move to Meaningful Internet Systems: OTM 2015 Conferences

The OnTheMove 2015 event held during October 26–30, in Rhodes, Greece, further consolidated the importance of this series of annual conferences that was started in 2002 in Irvine, California. It then moved to Catania, Sicily, in 2003, to Cyprus in 2004 and 2005, Montpellier in 2006, Vilamoura in 2007 and 2009, in 2008 to Monterrey, Mexico, to Heraklion, Crete, in 2010 and 2011, Rome in 2012, Graz in 2013, and Amantea, Italy, in 2014. This prime event continues to attract a diverse and relevant selection of today’s research worldwide on the scientific concepts underlying new computing paradigms, which of necessity must be distributed, heterogeneous, and supporting an environment of resources that are autonomous yet must meaningfully cooperate. Indeed, as such large, complex, and networked intelligent information systems become the focus and norm for computing, there continues to be an acute and even increasing need to address the implied software, system, and enterprise issues and discuss them face to face in an integrated forum that covers methodological, semantic, theoretical, and application issues as well. As we all realize, e-mail, the Internet, and even video conferences on their own are not optimal or even sufficient for effective and efficient scientific exchange.

[1]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[2]  Wei-Ying Ma,et al.  Understanding mobility based on GPS data , 2008, UbiComp.

[3]  Qi Tian,et al.  Feature selection using principal feature analysis , 2007, ACM Multimedia.

[4]  Xing Xie,et al.  Mining interesting locations and travel sequences from GPS trajectories , 2009, WWW '09.

[5]  Kurt Rothermel,et al.  PLEROMA: a SDN-based high performance publish/subscribe middleware , 2014, Middleware.

[6]  Zhichen Xu,et al.  pSearch: information retrieval in structured overlays , 2003, CCRV.

[7]  Xing Xie,et al.  GeoLife: A Collaborative Social Networking Service among User, Location and Trajectory , 2010, IEEE Data Eng. Bull..

[8]  Hector Garcia-Molina,et al.  One torus to rule them all: multi-dimensional queries in P2P systems , 2004, WebDB '04.

[9]  Anand Sivasubramaniam,et al.  Semantic small world: an overlay network for peer-to-peer search , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[10]  Huan Liu,et al.  Feature Selection for High-Dimensional Data: A Fast Correlation-Based Filter Solution , 2003, ICML.

[11]  Manish Parashar,et al.  Squid: Enabling search in DHT-based systems , 2008, J. Parallel Distributed Comput..

[12]  Zahid Anwar,et al.  Digital Forensics for Eucalyptus , 2011, 2011 Frontiers of Information Technology.

[13]  Michael K. Reiter,et al.  HomeAlone: Co-residency Detection in the Cloud via Side-Channel Analysis , 2011, 2011 IEEE Symposium on Security and Privacy.

[14]  K. Klenke,et al.  Qualitative Research in the Study of Leadership , 2016 .

[15]  Jiajin Le,et al.  Reverse Nearest Neighbor Search in Peer-to-Peer Systems , 2006, FQAS.

[16]  Divyakant Agrawal,et al.  Content-Based Similarity Search over Peer-to-Peer Systems , 2004, DBISP2P.

[17]  Kurt Rothermel,et al.  Distributed spectral cluster management: a method for building dynamic publish/subscribe systems , 2012, DEBS.

[18]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[19]  Pavel Zezula,et al.  A Scalable Nearest Neighbor Search in P2P Systems , 2004, DBISP2P.

[20]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[21]  Márk Jelasity,et al.  PeerSim: A scalable P2P simulator , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[22]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[23]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[24]  Thad Starner,et al.  Using GPS to learn significant locations and predict movement across multiple users , 2003, Personal and Ubiquitous Computing.

[25]  S. Parker.  Content Analysis for the Social Sciences and Humanities , 1970 .

[26]  Wensheng Yin,et al.  Weighted k-Means Algorithm Based Text Clustering , 2009, 2009 International Symposium on Information Engineering and Electronic Commerce.

[27]  Generating Random Vectors from the Multivariate Normal Distribution , 1998 .

[28]  Vladimir Krylov,et al.  Approximate nearest neighbor algorithm based on navigable small world graphs , 2014, Inf. Syst..

[29]  Beng Chin Ooi,et al.  Supporting multi-dimensional range queries in peer-to-peer systems , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[30]  C. Cheng,et al.  A protocol to maintain a minimum spanning tree in a dynamic topology , 1988, SIGCOMM 1988.

[31]  Greg Hamerly,et al.  Learning the k in k-means , 2003, NIPS.