Visible to the public Biblio

Filters: Author is Bhattacharya, Arnab  [Clear All Filters]
2023-06-09
Vasisht, Soumya, Rahman, Aowabin, Ramachandran, Thiagarajan, Bhattacharya, Arnab, Adetola, Veronica.  2022.  Multi-fidelity Bayesian Optimization for Co-design of Resilient Cyber-Physical Systems. 2022 ACM/IEEE 13th International Conference on Cyber-Physical Systems (ICCPS). :298—299.
A simulation-based optimization framework is developed to con-currently design the system and control parameters to meet de-sired performance and operational resiliency objectives. Leveraging system information from both data and models of varying fideli-ties, a rigorous probabilistic approach is employed for co-design experimentation. Significant economic benefits and resilience im-provements are demonstrated using co-design compared to existing sequential designs for cyber-physical systems.
2018-09-12
Gaur, Garima, Bedathur, Srikanta J., Bhattacharya, Arnab.  2017.  Tracking the Impact of Fact Deletions on Knowledge Graph Queries Using Provenance Polynomials. Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. :2079–2082.

Critical business applications in domains ranging from technical support to healthcare increasingly rely on large-scale, automatically constructed knowledge graphs. These applications use the results of complex queries over knowledge graphs in order to help users in taking crucial decisions such as which drug to administer, or whether certain actions are compliant with all the regulatory requirements and so on. However, these knowledge graphs constantly evolve, and the newer versions may adversely impact the results of queries that the previously taken business decisions were based on. We propose a framework based on provenance polynomials to track the impact of knowledge graph changes on arbitrary SPARQL query results. Focusing on the deletion of facts, we show how to efficiently determine the queries impacted by the change, develop ways to incrementally maintain these polynomials, and present an efficient implementation on top of RDF graph databases. Our experimental evaluation over large-scale RDF/SPARQL benchmarks show the effectiveness of our proposal.