November 14, 2012
Dr. Nebiyou Tilahun, UPP, presents a seminar entitled "An agent based model of origin destination estimation (ADOBE)" Wednesday, November 14th at 4:00 pm in Rm 1127 SEO
November 7, 2012
Mr. Thomas Murtha, CMAP, will address the CTS-IGERT community at 4:00 p.m. in Room 1127 SEO.
October 24, 2012
Please join us in welcoming Dr. Bo Zou, CME, on Wednesday, October 24th, Room 1127 SEO, 4:00 p.m.
September 25, 2012
Award Received by Joshua Auld, CTS-IGERT alumnus.
April 20, 2012
Congratulations to James Biagioni, CTS Fellow and CS PhD candidate, winner of the Dean's Scholar award.
January 2, 2012
James Biagioni, CTS Fellow, receives "Best Presentation Award" at SenSys2011
July 30, 2010
Dr. Ouri Wolfson, Dr. Phillip Yu, and Leon Stenneth, CS student and CTS Associate, recently had a paper accepted to the 6th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2010).
February 25, 2011
Bo Xu, CTS Fellow and PhD candidate, will present a seminar on Friday, Feb. 25th at 2:30 p.m. in Room 1000 SEO
"Continuous Nearest-Neighbor Queries with Location Uncertainty"
We study the problem of evaluating the continuous query of finding the k nearest objects with respect to a given point object Oq among a set of n moving point-objects. Such a query is called a continuous KNN query, or CKNN query. An example of a CKNN query is "based on a pedestrian's current moving speed and direction, which will be his/her two nearest vacant cabs for the next 10 minutes?". A CKNN query returns a sequence of answer-pairs, namely pairs of the form (I, S) such that I is a time interval and S is the set of objects that are closest to Oq during I. When there is uncertainty associated with the locations of the moving objects, S is the set of all the objects that are possibly the k nearest neighbors. We analyze the lower bound and the upper bound on the maximum number of answer-pairs, for the certain case and the uncertain case, respectively. Then we consider two different types of algorithms. The first is off-line algorithms that compute a priori all the answer-pairs. The second type is on-line algorithms that at any time return the current answer-pair. We introduce algorithms for the certain case and the uncertain case respectively and analyze their complexity.
Bo Xu is a fellow of the CTS IGERT program. He received his B.S. degree in Computer Science from Beijing University of Aeronautics and Astronautics in 1991, and his Ph.D. and M.S. degrees in Computer Science from the University of Electronic Science and Technology of China, in 1994 and 1997 respectively. His research interests include mobile data management and computational transportation science. He has published 56 refereed journal and conference papers in these fields. His papers have received over 110 peer citations as of 2007. He received the best paper award for "Opportunistic Resource Exchange in Inter-vehicle Ad Hoc Networks", at the 2004 5th International Mobile Data Management Conference. He is an author of the keynote paper of the Second International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, and the keynote paper of the 2004 IEEE International Conference on Networking, Sensing and Control. He was a recipient of IBM Achievement in Professional Excellence in 1996. He served as a referee for IEEE Transactions on Knowledge and Data Engineering, IEEE Transactions on Parallel and Distributed Systems, GeoInformatica, Journal of High Speed Networking, Wireless Networks, Information Sciences, IEEE Transactions on Mobile Computing, IEEE Transactions on Vehicular Technology, and IEEE Transactions on Intelligent Transportation Systems. He served in program committees for IWCTS' 08, IWCTS' 09, Mobile P2P' 09, and Mobile P2P'10.