Heart Rate Variability: A possible machine learning biomarker for mechanical circulatory device complications and heart recovery

Cardiovascular disease continues to be the number one cause of death in the United States, with heart failure patients expected to increase to \u3e8 million by 2030. Mechanical circulatory support (MCS) devices are now better able to manage acute and chronic heart failure refractory to medical therapy, both as bridge to transplant or as bridge to destination. Despite significant advances in MCS device design and surgical implantation technique, it remains difficult to predict response to device therapy. Heart rate variability (HRV), measuring the variation in time interval between adjacent heartbeats, is an objective device diagnostic regularly recorded by various MCS devices that has been shown to have significant prognostic value for both sudden cardiac death as well as all-cause mortality in congestive heart failure (CHF) patients. Limited studies have examined HRV indices as promising risk factors and predictors of complication and recovery from left ventricular assist device therapy in end-stage CHF patients. If paired with new advances in machine learning utilization in medicine, HRV represents a potential dynamic biomarker for monitoring and predicting patient status as more patients enter the mechanotrope era of MCS devices for destination therapy

Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps

We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n >= 2). In this paper, we propose a new mathematical programming approach for the problem. Our approach is based on two ideas: First, we represent each agent's policy in the sequence-form and not in the tree-form, thereby obtaining a very compact representation of the set of joint-policies. Second, using this compact representation, we solve this problem as an instance of combinatorial optimization for which we formulate a mixed integer linear program (MILP). The optimal solution of the MILP directly yields an optimal joint-policy for the Dec-Pomdp. Computational experience shows that formulating and solving the MILP requires significantly less time to solve benchmark Dec-Pomdp problems than existing algorithms. For example, the multi-agent tiger problem for horizon 4 is solved in 72 secs with the MILP whereas existing algorithms require several hours to solve it

Turkish-Azerbaijani energy relations

Turkish-Azerbaijani relations are currently taking shape based upon energy relations. This development is based on the two countries’ priorities in foreign policy and regional politics, underpinned by the mutual political will to maintain relations at this level. This paper analyzes the evolution of energy cooperation, Turkey’s attempt to become an energy hub in the region and Azerbaijan’s placement of energy politics as a central component in its foreign policy orientation. It concludes that Azerbaijan increased it leverage in regional energy politics and Turkey took a significant stride forward in terms of shifting from a transit country into an energy hub

Computing the Equilibria of Bimatrix Games using Dominance Heuristics

We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structures of the graph (in particular elementary cycles) and the set of the Nash equilibria of the game. We show that finding the set of elementary cycles of the graph permits the computation of the set of equilibria. For games whose graphs have a sparse adjacency matrix, this serves as a good heuristic for computing the set of equilibria. The heuristic also allows the discarding of sections of the support space that do not yield any equilibrium, thus serving as a useful pre-processing step for algorithms that compute the equilibria through support enumeration