CTS Events
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.


CTS Happenings
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).


March 7, 2012

Please join us in welcoming...
Dr. Hemanshu Kaul
Department of Applied Mathematics
Illinois Institute of Technology
4:00 p.m., Room 1127 SEO PLEASE NOTE ROOM

Dr. Kaul will present a seminar entitled "Allocation of Resources under Dependencies".

We consider the problem of how to decide which projects to invest in and implement in a transportation network, so as to maximize the total utility of the road network after project implementation. Two important issues that make this an interesting mathematical problem are: first, local changes in a transportation network can lead to agglomerative changes in its global behavior; second, multiple projects within a certain geographical area of the transportation network may be proposed for implementation simultaneously, which means that such projects cannot be considered independent of each other.

Dr. Kaul will discuss the work done with a colleague in Civil Engineering at IIT on this problem in the recent past. He will report on the new holistic model developed and how it compares computationally with previous models on real data from I-DOT (Illinois Department of Transportation). Our results clearly show that our models capture the effects of dependency between different projects. Ignoring these effects gives a false inflated benefit from a collection of projects leading to erroneous decision-making.

This research also led to work on approximation algorithms for the related Graph and Hypergraph Knapsack problems, generalizations of the classical Knapsack problem that take dependencies between items into account. Dr. Kaul will discuss the connections between this work and classical problems in combinatorial optimization and our new algorithms.