Mending a Broken Heart: Treatment of Stress-Induced Heart Failure after Solid Organ Transplantation

Stress-induced heart failure, also known as Broken Heart Syndrome or Takotsubo Syndrome, is a phenomenon characterized as rare but well described in the literature, with increasing incidence. While more commonly associated with postmenopausal women with psychiatric disorders, this entity is found in the postoperative patient. The nonischemic cardiogenic shock manifests as biventricular failure with significant decreases in ejection fraction and cardiac function. In a review of over 3000 kidney and liver transplantations over the course of 17 years within two transplant centers, we describe a series of 7 patients with Takotsubo Syndrome after solid organ transplantation. Furthermore, we describe a novel approach of successfully treating the transient, though potentially fatal, cardiogenic shock with a percutaneous ventricular assistance device in two liver transplant patients, while treating one kidney transplant patient medically and the remaining four liver transplant patients with an intra-aortic balloon pump. We describe our experience with Takotsubo’s Syndrome and compare the three modalities of treatment and cardiac augmentation. Our series is novel in introducing the percutaneous ventricular assist device as a more minimally invasive intervention in treating nonischemic heart failure in the solid organ transplant patient, while serving as a comprehensive overview of treatment modalities for stress-induced heart failure

Measuring the Vulnerability of a Multi-Agent Pathfinding Solution

Multi-agent pathfinding is the problem of finding a non-interfering paths for a set of agents, such that if the agents follow these paths then each agent will reach its desired destination. Recent years have shown tremendous advances in this field, with optimal and suboptimal algorithms that are able to plan paths for over 100 agents in reasonable time. However, autonomous mobile agents are prime targets for cyber-security attacks, where an adversary may take control over an agent to disrupt the agents execution of their plan. This threat raises two questions. The first question is how much damage can an agent do if it does not follow its plan. The second question is how can one plan a-priori to be as robust as possible to such cyber-attacks. In this work, We provide an answer to both questions. To compute the maximal amount of damage that an adversary agent can do, we define a corresponding graph search problem and solve this problem with A*. Then, we provide a very simple method to choose a solution that is robust to such damages. We demonstrate both algorithms in simulation over standard multi-agent pathfinding domains