activity
20172022
most citedOptimal Selection of Interconnections in Composite Systems for Structural Controllability

2 citations · 5 across the 5 of their papers we have counts for

collaborators

10 papers

cs.LG20221 cited

Stochastic Conservative Contextual Linear Bandits

Jiabin Lin, Xian Yeow Lee, Talukder Jubery +3

Many physical systems have underlying safety considerations that require that the strategy deployed ensures the satisfaction of a set of constraints. Further, often we have only pa…

cs.GT2018

A Game Theoretic Approach for Dynamic Information Flow Tracking to Detect Multi-Stage Advanced Persistent Threats

Shana Moothedath, Dinuka Sahabandu, Joey Allen +4

Advanced Persistent Threats (APTs) infiltrate cyber systems and compromise specifically targeted data and/or resources through a sequence of stealthy attacks consisting of multiple…

math.OC2018

Optimal Network Topology Design in Composite Systems with Constrained Neighbors for Structural Controllability

Shana Moothedath, Prasanna Chaporkar, Aishwary Joshi

Composite systems are large complex systems con- sisting of interconnected agents (subsystems). Agents in a com- posite system interact with each other towards performing an in- te…

math.OC2018

Minimizing Inputs for Strong Structural Controllability

Kumar Yashashwi, Shana Moothedath, Prasanna Chaporkar

The notion of strong structural controllability (s-controllability) allows for determining controllability properties of large linear time-invariant systems even when numerical val…

math.OC20172 cited

Optimal Selection of Interconnections in Composite Systems for Structural Controllability

Shana Moothedath, Prasanna Chaporkar, Madhu N. Belur

In this paper, we study structural controllability of a linear time invariant (LTI) composite system consisting of several subsystems. We assume that the neighbourhood of each subs…

cs.DM20171 cited

Rapidly Mixing Markov Chain Monte Carlo Technique for Matching Problems with Global Utility Function

Shana Moothedath, Prasanna Chaporkar, Madhu N. Belur

This paper deals with a complete bipartite matching problem with the objective of finding an optimal matching that maximizes a certain generic predefined utility function on the se…