Visible to the public Biblio

Filters: First Letter Of Title is O  [Clear All Filters]
A B C D E F G H I J K L M N [O] P Q R S T U V W X Y Z   [Show ALL]
Faria, Daniel, Pesquita, Catia, Balasubramani, Booma S, Martins, Catarina, Cardoso, Joao, Curado, Hugo, Couto, Francisco M, Cruz, Isabel F.  2016.  OAEI 2016 results of AML. {ISWC International Workshop on Ontology Matching (OM)}. 1766:138–145.
G. Bianchin, P. Frasca, A. Gasparri, F. Pasqualetti.  2016.  The Observability Radius of Network Systems. {IEEE} American Control Conference. :185-190.
Biron, Zoleikha Abdollahi, Pisu, Pierluigi, HomChaudhuri, Baisravan.  2015.  Observer Design Based Cyber Security for Cyber Physical Systems. Proceedings of the 10th Annual Cyber and Information Security Research Conference. :6.
Elmahdi, Ahmed, Taha, Ahmad F, Sun, Dengfeng.  2014.  Observer-based decentralized control scheme for stability analysis of networked systems. Control & Automation (ICCA), 11th IEEE International Conference on. :857–862.
Coogan, S., Gomes, G., Kim, E., Arcak, M., Varaiya, P..  2015.  Offset optimization for a network of signalized intersections via semidefinite relaxation. Proceedings of the 54th IEEE Conference on Decision and Control. :2187-2192.
Samuel Coogan, Eric Kim, Gabriel Gomes, Murat Arcak, Pravin Varaiya.  2017.  Offset optimization in signalized traffic networks via semidefinite relaxation. Transportation Research Part B: Methodological. 100:82-92.

Abstract We study the problem of selecting offsets of the traffic signals in a network of signalized intersections to reduce queues of vehicles at all intersections. The signals in the network have a common cycle time and a fixed timing plan. It is assumed that the exogenous demands are constant or periodic with the same period as the cycle time and the intersections are under-saturated. The resulting queuing processes are periodic. These periodic processes are approximated by sinusoids. The sinusoidal approximation leads to an analytical expression of the queue lengths at every intersection as a function of the demands and the vector of offsets. The optimum offset vector is the solution of a quadratically constrained quadratic program (QCQP), which is solved via its convex semidefinite relaxation. Unlike existing techniques, our approach accommodates networks with arbitrary topology and scales well with network size. We illustrate the result in two case studies. The first is an academic example previously proposed in the literature, and the second case study consists of an arterial corridor network in Arcadia, California.

Kim, E., Wu, C.-J., Horowitz, R., Arcak, M..  2017.  Offset optimization of signalized intersections via the Burer-Monteiro method. Proceedings of the 2017 American Control Conference. :3554-3559.
D. Zhang, T. He, S. Lin, S. Munir, J. A. Stankovic.  2015.  Online Cruising Mile Reduction in Large-Scale Taxicab Networks. IEEE Transactions on Parallel and Distributed Systems. 26:3122-3135.
Luo, Wenhao, Nam, Changjoo, Sycara, Katia.  2017.  Online Decision Making for Stream-based Robotic Sampling via Submodular Optimization. Conference on Multi Sensor Fusion and Integration for Intelligence Systems. :none.
Joseph Wang, Kirill Trapeznikov, Venkatesh Saligrama.  2013.  Online local linear classification. 5th {IEEE} International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, {CAMSAP} 2013, St. Martin, France, December 15-18, 2013. :173–176.
Balasubramani, Booma Sowkarthiga, Shivaprabhu, Vivek R., Krishnamurthy, Smitha, Cruz, Isabel F., Malik, Tanu.  2016.  Ontology–based Urban Data Exploration. {Proceedings of the 2nd ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics}. :10:1–10:8.
Wenting Zheng, Ankur Dave, Jethro Beekman, Raluca Ada Popa, Joseph Gonzalez, Ion Stoica.  2017.  Opaque: An Oblivious and Encrypted Distributed Analytics Platform. NSDI (USENIX Symposium of Networked Systems Design and Implementation).