A validated methodological approach to prove the safety of clinical electromagnetic induction systems in magnetic hyperthermia

The present study focuses on the development of a methodology for evaluating the safety of MNH systems, through the numerical prediction of the induced temperature rise in superficial skin layers due to eddy currents heating under an alternating magnetic field (AMF). The methodology is supported and validated through experimental measurements of the AMF’s distribution, as well as temperature data from the torsos of six patients who participated in a clinical trial study. The simulations involved a computational model of the actual coil, a computational model of the cooling system used for the cooling of the patients during treatment, and a detailed human anatomical model from the Virtual Population family. The numerical predictions exhibit strong agreement with the experimental measurements, and the deviations are below the estimated combined uncertainties, confirming the accuracy of computational modeling. This study highlights the crucial role of simulations for translational medicine and paves the way for personalized treatment planning.peer-reviewe

Cognitive Flexibility Predicts PTSD Symptoms: Observational and Interventional Studies

Introduction: Post-Traumatic Stress Disorder (PTSD) is a prevalent, severe and tenacious psychopathological consequence of traumatic events. Neurobehavioral mechanisms underlying PTSD pathogenesis have been identified, and may serve as risk-resilience factors during the early aftermath of trauma exposure. Longitudinally documenting the neurobehavioral dimensions of early responses to trauma may help characterize survivors at risk and inform mechanism-based interventions. We present two independent longitudinal studies that repeatedly probed clinical symptoms and neurocognitive domains in recent trauma survivors. We hypothesized that better neurocognitive functioning shortly after trauma will be associated with less severe PTSD symptoms a year later, and that an early neurocognitive intervention will improve cognitive functioning and reduce PTSD symptoms.Methods: Participants in both studies were adult survivors of traumatic events admitted to two general hospitals’ emergency departments (EDs) in Israel. The studies used identical clinical and neurocognitive tools, which included assessment of PTSD symptoms and diagnosis, and a battery of neurocognitive tests. The first study evaluated 181 trauma-exposed individuals one-, six-, and 14 months following trauma exposure. The second study evaluated 97 trauma survivors 1 month after trauma exposure, randomly allocated to 30 days of web-based neurocognitive intervention (n = 50) or control tasks (n = 47), and re-evaluated all subjects three- and 6 months after trauma exposure.Results: In the first study, individuals with better cognitive flexibility at 1 month post-trauma showed significantly less severe PTSD symptoms after 13 months (p = 0.002). In the second study, the neurocognitive training group showed more improvement in cognitive flexibility post-intervention (p = 0.019), and lower PTSD symptoms 6 months post-trauma (p = 0.017), compared with controls. Intervention- induced improvement in cognitive flexibility positively correlated with clinical improvement (p = 0.002).Discussion: Cognitive flexibility, shortly after trauma exposure, emerged as a significant predictor of PTSD symptom severity. It was also ameliorated by a neurocognitive intervention and associated with a better treatment outcome. These findings support further research into the implementation of mechanism-driven neurocognitive preventive interventions for PTSD

The power of selective memory: selfbounded learning of prediction suffix trees

Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic view of PSTs for the task of sequence prediction. Generalizing the notion of margin to PSTs, we present an online PST learning algorithm and derive a loss bound for it. The depth of the PST generated by this algorithm scales linearly with the length of the input. We then describe a self-bounded enhancement of our learning algorithm which automatically grows a bounded-depth PST. We also prove an analogous mistake-bound for the self-bounded algorithm. The result is an efficient algorithm that neither relies on a-priori assumptions on the shape or maximal depth of the target PST nor does it require any parameters. To our knowledge, this is the first provably-correct PST learning algorithm which generates a bounded-depth PST while being competitive with any fixed PST determined in hindsight.

The Forgetron: A kernel-based perceptron on a fixed budget

The Perceptron algorithm, despite its simplicity, often performs well on online classification problems. The Perceptron becomes especially effective when it is used in conjunction with kernels. However, a common difficulty encountered when implementing kernel-based online algorithms is the amount of memory required to store the online hypothesis, which may grow unboundedly. In this paper we describe and analyze a new infrastructure for kernel-based learning with the Perceptron while adhering to a strict limit on the number of examples that can be stored. We first describe a template algorithm, called the Forgetron, for online learning on a fixed budget. We then provide specific algorithms and derive a unified mistake bound for all of them. To our knowledge, this is the first online learning paradigm which, on one hand, maintains a strict limit on the number of examples it can store and, on the other hand, entertains a relative mistake bound. We also present experiments with real datasets which underscore the merits of our approach.

Online Passive-Aggressive Algorithms

We present a unified view for online classification, regression, and uniclass problems. This view leads to a single algorithmic framework for the three problems. We prove worst case loss bounds for various algorithms for both the realizable case and the non-realizable case. A conversion of our main online algorithm to the setting of batch learning is also discussed. The end result is new algorithms and accompanying loss bounds for the hinge loss