Kaustav Basu

Anna L. D. Latour, Arunabha Sen, Kaustav Basu et al.

In the context of satellite monitoring of the earth, we can assume that the surface of the earth is divided into a set of regions. We assume that the impact of a big social/environmental event spills into neighboring regions. Using Identifying Code Sets (ICSes), we can deploy sensors in such a way that the region in which an event takes place can be uniquely identified, even with fewer sensors than regions. As Earth is almost a sphere, we use a soccer ball as a model. We construct a Soccer Ball Graph (SBG), and provide human-oriented, analytical proofs that 1) the SBG has at least 26 ICSes of cardinality ten, implying that there are at least 26 different ways to deploy ten satellites to monitor the Earth and 2) that the cardinality of the minimum Identifying Code Set (MICS) for the SBG is at least nine. We then provide a machine-oriented formal proof that the cardinality of the MICS for the SBG is in fact ten, meaning that one must deploy at least ten satellites to monitor the Earth in the SBG model. We also provide machine-oriented proof that there are exactly 26 ICSes of cardinality ten for the SBG.

Sandipan Choudhuri, Kaustav Basu, Kevin Thomas et al.

According to the Center of Disease Control (CDC), the Opioid epidemic has claimed more than 72,000 lives in the US in 2017 alone. In spite of various efforts at the local, state and federal level, the impact of the epidemic is becoming progressively worse, as evidenced by the fact that the number of Opioid related deaths increased by 12.5\% between 2016 and 2017. Predictive analytics can play an important role in combating the epidemic by providing decision making tools to stakeholders at multiple levels - from health care professionals to policy makers to first responders. Generating Opioid incidence heat maps from past data, aid these stakeholders to visualize the profound impact of the Opioid epidemic. Such post-fact creation of the heat map provides only retrospective information, and as a result, may not be as useful for preventive action in the current or future time-frames. In this paper, we present a novel deep neural architecture, which learns subtle spatio-temporal variations in Opioid incidences data and accurately predicts future heat maps. We evaluated the efficacy of our model on two open source datasets- (i) The Cincinnati Heroin Overdose dataset, and (ii) Connecticut Drug Related Death Dataset.

Sandipan Choudhuri, Kaustav Basu, Arunabha Sen

A major portion of postings on social networking sites constitute high quality digital images and videos. These images and videos require a fairly large amount of bandwidth during transmission. Accordingly, high quality image and video postings become a challenge for the network service provider, especially in a crowded environment where bandwidth is in high demand. In this paper we present a user satisfaction driven bandwidth allocation scheme for image transmission in such environments. In an image, there are always objects that stand out more than others. The reason behind some set of objects being more important in a scene is based on a number of visual, as well as, cognitive factors. Being motivated by the fact that user satisfaction is more dependent on the quality of these salient objects in an image than non-salient ones, we propose a quantifiable metric for measuring user-satisfiability (based on image quality and delay of transmission). The bandwidth allocation technique proposed thereafter, ensures that this user-satisfiability is maximized. Unlike the existing approaches that utilize some fixed set of non-linear functions for framing the user-satisfiability index, our metric is modelled over customer survey data, where the unknown parameters are trained with machine learning methods.

Joydeep Banerjee, Anamitra Pal, Kaustav Basu et al.

Smart grid systems are composed of power and communication network components. The components in either network exhibit complex dependencies on components in its own as well as the other network to drive their functionality. Existing, models fail to capture these complex dependencies. In this paper, we restrict to the dependencies in the power network and propose the Multi-scale Implicative Interdependency Relation (MIIR) model that address the existing limitations. A formal description of the model along with its working dynamics and a brief validation with respect to the 2011 Southwest blackout are provided. Utilizing the MIIR model, the $K$ Contingency List problem is proposed. For a given time instant, the problem solves for a set of $K$ entities in a power network which when failed at that time instant would cause the maximum number of entities to fail eventually. Owing to the problem being NP-complete we devised a Mixed Integer Program (MIP) to obtain the optimal solution and a polynomial time sub-optimal heuristic. The efficacy of the heuristic with respect to the MIP is compared by using different bus system data. In general, the heuristic is shown to provide near optimal solution at a much faster time than the MIP.