Visible to the public Biblio

Found 1750 results

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 
Ziming Zhang, Venkatesh Saligrama.  2016.  Zero-Shot Recognition via Structured Prediction. Computer Vision - {ECCV} 2016 - 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part {VII}. 9911:533–548.
Ziming Zhang, Venkatesh Saligrama.  2015.  Zero-Shot Learning via Semantic Similarity Embedding. 2015 {IEEE} International Conference on Computer Vision, {ICCV} 2015, Santiago, Chile, December 7-13, 2015. :4166–4174.
Ziming Zhang, Venkatesh Saligrama.  2016.  Zero-Shot Learning via Joint Latent Similarity Embedding. 2016 {IEEE} Conference on Computer Vision and Pattern Recognition, {CVPR} 2016, Las Vegas, NV, USA, June 27-30, 2016. :6034–6042.
Esha Ghosh, Olga Ohrimenko, Dimitrios Papadopoulos, Roberto Tamassia, Nikos Triandopoulos.  2016.  Zero-Knowledge Accumulators and Set Algebra. Advances in Cryptology - {ASIACRYPT} 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part {II}. 10032:67–100.
C. Nowzari, J. Cortes.  2014.  Zeno-free, distributed event-triggered communication and control for multi-agent average consensus. :2148-2153.

This paper studies a distributed event-triggered communication and control strategy that solves the multi-agent average consensus problem. The proposed strategy does not rely on the continuous or periodic availability of information to an agent about the state of its neighbors, but instead prescribes isolated event times where both communication and controller updates occur. In addition, all parameters required for its implementation can be locally determined by the agents. We show that the resulting network executions are guaranteed to converge to the average of the initial agents' states, establish that events cannot be triggered an infinite number of times in any finite time period (i.e., absence of Zeno behavior), and characterize the exponential rate of convergence. We also provide sufficient conditions for convergence in scenarios with time-varying communication topologies. Simulations illustrate our results.

Min, Kyeong T, Forys, Andrzej, Luong, Anh, Lee, Enoch, Davies, Jon, Schmid, Thomas.  2014.  WRENSys: Large-scale, rapid deployable mobile sensing system. Local Computer Networks Workshops (LCN Workshops), 2014 IEEE 39th Conference on. :557–565.
Wen-Zhan Song, Debraj De, Song Tan, Sajal Das, Lang Tong.  2012.  A Wireless Smart Grid Testbed In Lab. Special Issue on Recent Advances in Wireless Technologies for Smart Grid, IEEE Wireless Communications Magazine. 19
M. Hosseini, R. R. Berlin, L. Sha.  2017.  WiP Abstract: A Physiology-Aware Communication Architecture for Distributed Emergency Medical CPS. 2017 ACM/IEEE 8th International Conference on Cyber-Physical Systems (ICCPS). :83-84.
Tamrazian, Arbi, Qian, Zhen, Rajagopal, Ram.  2015.  Where Is My Parking Spot? Online and Offline Prediction of Time-Varying Parking Occupancy Transportation Research Record: Journal of the Transportation Research Board. :77–85.
Huang, Chao, Wang, Dong, Zhu, Shenglong.  2017.  Where are you from: Home location profiling of crowd sensors from noisy and sparse crowdsourcing data. INFOCOM 2017-IEEE Conference on Computer Communications, IEEE. :1–9.
Antti Tapani Siirtola, Stavros Tripakis, Keijo Heljanko.  2015.  When Do We (Not) Need Complex Assume-Guarantee Rules? 15th International Conference on Application of Concurrency to System Design, {ACSD} 2015, Brussels, Belgium, June 21-26, 2015. :30–39.
Antti Siirtola, Stavros Tripakis, Keijo Heljanko.  2017.  When Do We Not Need Complex Assume-Guarantee Rules? {ACM} Trans. Embedded Comput. Syst.. 16:48:1–48:25.
Ye, Chengxi, Yang, Yezhou, Mao, Ren, Fermuller, Cornelia, Aloimonos, Yiannis.  2017.  What can i do around here? deep functional scene understanding for cognitive robots Robotics and Automation (ICRA), 2017 IEEE International Conference on. :4604–4611.
Anastasia Mavridou, Joseph Sifakis, Janos Sztipanovits.  2017.  WebGME-BIP: A Design Studio for Modeling, Analyzing and Generating Systems with BIP.

When building large concurrent systems, one of the key difficulties lies in coordinating component behavior and, in particular, managing the access to shared resources of the execution platform. Components may interact through buses, message buffers, etc. leading to resource contention and potential deadlocks compromising safety-critical operations. The concurrent nature of such interactions is the root cause of the complexity of the resulting software. Thus, the complexity of software systems is exponential in the number of their components, making a-posteriori verification of their correctness practically infeasible. An alternative approach, taken by the BIP framework, consists in ensuring correctness-by-construction by applying automatic transformations to obtain executable code from formally defined models. Following this latter approach, we have designed and implemented a BIP design studio. We have studied extensions of the BIP language for specifying parameterized models and integrated them in the design studio to enhance scalability, reusability, and reduce model size. Additionally, we have studied and implemented a set of necessary and sufficient conditions for validating the consistency and encodability of BIP models at design time. We have developed code generation plugins from graphical BIP models to equivalent Java and BIP code. The generated BIP code can be verified for deadlock-freedom or safety properties using compositional verifications tools offered by the BIP framework.