Mudhakar Srivatsa

Mudhakar Srivatsa

Auto-generated profile, based on publicly available information

Mudhakar Srivatsa

IBM T. J. Watson Research Center

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2007
Verified
Conference Paper
Closed access
MSMudhakar Srivatsa
Mudhakar Srivatsa
AIArun Iyengar
Arun Iyengar
TMThomas Mikalsen
Thomas Mikalsen
IRIsabelle Rouvellou
Isabelle Rouvellou
JYJ Yin
J Yin
Service composition has emerged as a fundamental technique for developing Web applications. Multiple services, often from different organizations or trust domains, may be dynamically composed to satisfy a user's request. Access control in the presence of service compositions is a challenging security problem. In this paper, we present an access control model and techniques for specifying and enforcing access control rules on Web service compositions. A key advantage of our approach is that past histories of service invocations can be used to make access control decisions. Our approach allows role hierarchies and separation of duty constraints. Access controls rules may be parameterized by one or more arguments. We have implemented our access control model via a declarative policy specification language which uses pure-past linear temporal logic (PPLTL). We describe an implementation of our approach using a supply chain management (SCM) application. Our experiments show that our approach can enforce expressive and flexible access control policies while incurring reasonable performance overhead on the application.

12 November 2023
Verified
Conference Paper
Open access
TWTianshi Wang
Tianshi Wang
JLJinyang Li
Jinyang Li
RWRuijie Wang
Ruijie Wang
DKDenizhan Kara
Denizhan Kara
SLShengzhong Liu
Shengzhong Liu
TATarek Abdelzaher
Tarek Abdelzaher
This paper introduces SudokuSens, a generative framework for automated generation of training data in machine-learning-based Internet-of-Things (IoT) applications, such that the generated synthetic data mimic experimental configurations not encountered during actual sensor data collection. The framework improves the robustness of resulting deep learning models, and is intended for IoT applications where data collection is expensive. The work is motivated by the fact that IoT time-series data entangle the signatures of observed objects with the confounding intrinsic properties of the surrounding environment and the dynamic environmental disturbances experienced. To incorporate sufficient diversity into the IoT training data, one therefore needs to consider a combinatorial explosion of training cases that are multiplicative in the number of objects considered and the possible environmental conditions in which such objects may be encountered. Our framework substantially reduces these multiplicative training needs. To decouple object signatures from environmental conditions, we employ a Conditional Variational Autoencoder (CVAE) that allows us to reduce data collection needs from multiplicative to (nearly) linear, while synthetically generating (data for) the missing conditions. To obtain robustness with respect to dynamic disturbances, a session-aware temporal contrastive learning approach is taken. Integrating the aforementioned two approaches, SudokuSens significantly improves the robustness of deep learning for IoT applications. We explore the degree to which SudokuSens benefits downstream inference tasks in different data sets and discuss conditions under which the approach is particularly effective.

30 June 2016
Verified
Conference Paper
Open access
FHFangqiu Han
Fangqiu Han
STShulong Tan
Shulong Tan
HSHuan Sun
Huan Sun
MSMudhakar Srivatsa
Mudhakar Srivatsa
DCDeng Cai
Deng Cai
XYXifeng Yan
Xifeng Yan
Collaborative networks are common in real life, where domain experts work together to solve tasks issued by customers. How to model the proficiency of experts is critical for us to understand and optimize collaborative networks. Traditional expertise models, such as topic model based methods, cannot capture two aspects of human expertise simultaneously: Specialization (what area an expert is good at?) and Proficiency Level (to what degree?). In this paper, we propose new models to overcome this problem. We embed all historical task data in a lower dimension space and learn vector representations of expertise based on both solved and unsolved tasks. Specifically, in our first model, we assume that each expert will only handle tasks whose difficulty level just matches his/her proficiency level, while experts in the second model accept tasks whose levels are equal to or lower than his/her proficiency level. Experiments on real world datasets show that both models outperform topic model based approaches and standard classifiers such as logistic regression and support vector machine in terms of prediction accuracy. The learnt vector representations can be used to compare expertise in a large organization and optimize expert allocation.

1 May 2015
Verified
Conference Paper
Closed access
YRYaoping Ruan
Yaoping Ruan
NANikos Anerousis
Nikos Anerousis
MSMudhakar Srivatsa
Mudhakar Srivatsa
JXJin Xiao
Jin Xiao
RCR. Todd Christner
R. Todd Christner
JSJohn Short
John Short
Recent advances in the manufacturing and commercialization of passive optical components are now extending the capabilities of fiber to edge and campus networks. This paper presents a comparison between Passive Optical LAN (POL) and copper-based LAN solution, and demonstrate the benefits of PON such as reduced infrastructure footprint and cost, reduced power requirements, future-proof bandwidth, greener infrastructure, safer, higher security and higher reliability.

12 December 2016
Verified
Conference Paper
Open access
RGRaghu Ganti
Raghu Ganti
MSMudhakar Srivatsa
Mudhakar Srivatsa
DADakshi Agrawal
Dakshi Agrawal
PZPetros Zerfos
Petros Zerfos
JOJorge Ortiz
Jorge Ortiz
As spatial data being collected by various industries (e.g., telecommunication, insurance, automotive) is on the increase, indexing and answering queries extremely quickly is necessary. This paper proposes a new mechanism, Mobile PATRICIA-trie (MP-trie), for fast queries on moving objects that provides a 1000x improvement in performance over state-of-the-art spatial indexing mechanisms. We reduce the problem of spatial indexing to that of prefix-matching over binary strings, which is then coupled with off-the-shelf commercially available content-addressable memory (commonly used in IP routers for forwarding table lookups). We validate our approach on data collected from a real-world deployment in Stockholm, Sweden across 2000 cars for a period of one month.

10 January 2021
Verified
Conference Paper
Closed access
WLWei-Han Lee
Wei-Han Lee
SMSteve Millman
Steve Millman
NDNirmit Desai
Nirmit Desai
MSMudhakar Srivatsa
Mudhakar Srivatsa
CLChangchang Liu
Changchang Liu
Edge devices use neural network models learnt on cloud to predict labels of its data records, which may lead to incorrect predictions especially for records that are different from the data involved in the training process, i.e., out-of-distribution (OOD) records. However, recent efforts in OOD detection either require the retraining of the model or assume the existence of a certain amount of OOD records, thus limiting their application in practice. In this work, we propose a novel OOD detection method (named as NeuralFP) without requiring any access to OOD records, which constructs non-linear fingerprints of neural network models memorizing the information of data observed during training. The key idea of NeuralFP is to exploit the difference in how the neural network model responds to data records in its training set versus data records that are anomalous. Specifically, NeuralFP builds autoencoders for each layer of the neural network model and then carefully analyzes the error distribution of the autocoders in reconstructing the training set to identify OOD records. Through extensive experiments on multiple real-world datasets, we show the effectiveness of NeuralFP in detecting OOD records as well as its advantages over previous approaches. Furthermore, we provide useful guidelines for parameter selection in the practical adoption of NeuralFP.