Probabilistic Guarantees for Safe Deep Reinforcement Learning

Deep reinforcement learning has been successfully applied to many control tasks, but the application of such agents in safety-critical scenarios has been limited due to safety concerns. Rigorous testing of these controllers is challenging, particularly when they operate in probabilistic environments due to, for example, hardware faults or noisy sensors. We propose MOSAIC, an algorithm for measuring the safety of deep reinforcement learning agents in stochastic settings. Our approach is based on the iterative construction of a formal abstraction of a controller's execution in an environment, and leverages probabilistic model checking of Markov decision processes to produce probabilistic guarantees on safe behaviour over a finite time horizon. It produces bounds on the probability of safe operation of the controller for different initial configurations and identifies regions where correct behaviour can be guaranteed. We implement and evaluate our approach on agents trained for several benchmark control problems

Encephalitis caused by a Lyssavirus in fruit bats in Australia.

This report describes the first pathologic and immunohistochemical recognition in Australia of a rabies-like disease in a native mammal, a fruit bat, the black flying fox (Pteropus alecto). A virus with close serologic and genetic relationships to members of the Lyssavirus genus of the family Rhabdoviridae was isolated in mice from the tissue homogenates of a sick juvenile animal

Oral administration of the KATP channel opener diazoxide ameliorates disease progression in a murine model of multiple sclerosis

Background Multiple Sclerosis (MS) is an acquired inflammatory demyelinating disorder of the central nervous system (CNS) and is the leading cause of nontraumatic disability among young adults. Activated microglial cells are important effectors of demyelination and neurodegeneration, by secreting cytokines and others neurotoxic agents. Previous studies have demonstrated that microglia expresses ATP-sensitive potassium (KATP) channels and its pharmacological activation can provide neuroprotective and anti-inflammatory effects. In this study, we have examined the effect of oral administration of KATP channel opener diazoxide on induced experimental autoimmune encephalomyelitis (EAE), a mouse model of MS. Methods Anti-inflammatory effects of diazoxide were studied on lipopolysaccharide (LPS) and interferon gamma (IFNy)-activated microglial cells. EAE was induced in C57BL/6J mice by immunization with myelin oligodendrocyte glycoprotein peptide (MOG35-55). Mice were orally treated daily with diazoxide or vehicle for 15 days from the day of EAE symptom onset. Treatment starting at the same time as immunization was also assayed. Clinical signs of EAE were monitored and histological studies were performed to analyze tissue damage, demyelination, glial reactivity, axonal loss, neuronal preservation and lymphocyte infiltration. Results Diazoxide inhibited in vitro nitric oxide (NO), tumor necrosis factor alpha (TNF-¿) and interleukin-6 (IL-6) production and inducible nitric oxide synthase (iNOS) expression by activated microglia without affecting cyclooxygenase-2 (COX-2) expression and phagocytosis. Oral treatment of mice with diazoxide ameliorated EAE clinical signs but did not prevent disease. Histological analysis demonstrated that diazoxide elicited a significant reduction in myelin and axonal loss accompanied by a decrease in glial activation and neuronal damage. Diazoxide did not affect the number of infiltrating lymphocytes positive for CD3 and CD20 in the spinal cord. Conclusion Taken together, these results demonstrate novel actions of diazoxide as an anti-inflammatory agent, which might contribute to its beneficial effects on EAE through neuroprotection. Treatment with this widely used and well-tolerated drug may be a useful therapeutic intervention in ameliorating MS disease

Distributed MAP in the SpinJa Model Checker

Spin in Java (SpinJa) is an explicit state model checker for the Promela modelling language also used by the SPIN model checker. Designed to be extensible and reusable, the implementation of SpinJa follows a layered approach in which each new layer extends the functionality of the previous one. While SpinJa has preliminary support for shared-memory model checking, it did not yet support distributed-memory model checking. This tool paper presents a distributed implementation of a maximal accepting predecessors (MAP) search algorithm on top of SpinJa.Comment: In Proceedings PDMC 2011, arXiv:1111.006

Rich kids : a history of shopping malls in Tehran and the believers are but brothers - digital lack and excess in a postdigital age

This article addresses two recent performances by Javaad Alipoor and Kirsty Housley - Rich Kids: A History of Shopping Malls in Tehran (2019) and The Believers are but Brothers (2017). It argues that they represent a fresh, stripped back and interrogative mode of intermedial performance, marking a clear departure from practices that employ the digital as a spectacular scenographic tool - where the visual excesses of large scale mapped and projected images are there for us to enjoy - as well as from sited, active and playful uses of handheld devices and networked engagements in mixed reality performance. Particularly focusing on the use of audience members’ smartphones and platforms such as Whatsapp and Instagram, I contend that the prompting of these types of interactions in a theatre space generates a productive uneasiness at the intersection of human action and digital process. The article explores these qualities of unease and critical positionings that emerge within the contained spaces created in the performances and how they reveal and heighten the dual lack and excess of contemporary digital content and processes in our lives. In exploring these ideas, I make reference to postdigital theories, discourses of intermediality and critical writing around digital computation

Argentine Wheat Industry: Conference Report

Established and supported under the Australian Government’s Cooperative Research Centre Progra

Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm

Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to the value only in the limit. Since no stopping criterion is known, this technique does not provide any guarantees on its results. We provide the first stopping criterion for VI on simple stochastic games. It is achieved by additionally computing a convergent sequence of over-approximations of the value, relying on an analysis of the game graph. Consequently, VI becomes an anytime algorithm returning the approximation of the value and the current error bound. As another consequence, we can provide a simulation-based asynchronous VI algorithm, which yields the same guarantees, but without necessarily exploring the whole game graph.Comment: CAV201