Parental evaluation of a telemonitoring service for children with Type 1 Diabetes

Introduction In the past years, we developed a telemonitoring service for young patients affected by Type 1 Diabetes. That service provides data to the clinical staff and offers an important tool to the parents, that are able to oversee in real time their children. The aim of this work was to analyze the parents' perceived usefulness of the service. Methods The service was tested by the parents of 31 children enrolled in a seven-day clinical trial during a summer camp. To study the parents' perception we proposed and analyzed two questionnaires. A baseline questionnaire focused on the daily management and implications of their children's diabetes, while a post-study one measured the perceived benefits of telemonitoring. Questionnaires also included free text comment spaces. Results Analysis of the baseline questionnaires underlined the parents' suffering and fatigue: 51% of total responses showed a negative tendency and the mean value of the perceived quality of life was 64.13 in a 0-100 scale. In the post-study questionnaires about half of the parents believed in a possible improvement adopting telemonitoring. Moreover, the foreseen improvement in quality of life was significant, increasing from 64.13 to 78.39 ( p-value\u2009=\u20090.0001). The analysis of free text comments highlighted an improvement in mood, and parents' commitment was also proved by their willingness to pay for the service (median\u2009=\u2009200\u2009euro/year). Discussion A high number of parents appreciated the telemonitoring service and were confident that it could improve communication with physicians as well as the family's own peace of mind

“Save Our History!” Collaborating to Preserve the Past at UMass Boston

Sparked by the 50th anniversary of the founding of the University of Massachusetts Boston in June 1964, University Archives and Special Collections (UASC) staff in the Joseph P. Healey Library collaborated with departments across campus to carry out a wide range of initiatives, all focused on locating, accessioning, preserving, and sharing the physical evidence of the university’s history. This poster outlines the various collecting activities, outreach methods, digitization projects, and dogged detective work that resulted in the addition of more than 2,500 linear feet of unique historic materials to the University Archives, as well as a number of well-received public events and exhibitions

Екатеринбургская неделя. 1883. № 50

This is the author’s accepted manuscript. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-24364-6_12.acmid: 2050798 location: Saarbrücken, Germany numpages: 16acmid: 2050798 location: Saarbrücken, Germany numpages: 1

Separation Logic Modulo Theories

Logical reasoning about program data often requires dealing with heap structures as well as scalar data types. Recent advances in Satisfiability Modular Theory (SMT) already offer efficient procedures for dealing with scalars, yet they lack any support for dealing with heap structures. In this paper, we present an approach that integrates Separation Logic---a prominent logic for reasoning about list segments on the heap---and SMT. We follow a model-based approach that communicates aliasing among heap cells between the SMT solver and the Separation Logic reasoning part. An experimental evaluation using the Z3 solver indicates that our approach can effectively put to work the advances in SMT for dealing with heap structures. This is the first decision procedure for the combination of separation logic with SMT theories.Comment: 16 page

Quantifier-Free Interpolation of a Theory of Arrays

The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier- free interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized version of the extensional theory of arrays. We prove this in two ways: (1) non-constructively, by using the model theoretic notion of amalgamation, which is known to be equivalent to admit quantifier-free interpolation for universal theories; and (2) constructively, by designing an interpolating procedure, based on solving equations between array updates. (Interestingly, rewriting techniques are used in the key steps of the solver and its proof of correctness.) To the best of our knowledge, this is the first successful attempt of computing quantifier- free interpolants for a variant of the theory of arrays with extensionality

A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL

A new one-pass and tree-shaped tableau system for LTL sat- isfiability checking has been recently proposed, where each branch can be explored independently from others and, furthermore, directly cor- responds to a potential model of the formula. Despite its simplicity, it proved itself to be effective in practice. In this paper, we provide a SAT-based encoding of such a tableau system, based on the technique of bounded satisfiability checking. Starting with a single-node tableau, i.e., depth k of the tree-shaped tableau equal to zero, we proceed in an incremental fashion. At each iteration, the tableau rules are encoded in a Boolean formula, representing all branches of the tableau up to the current depth k. A typical downside of such bounded techniques is the effort needed to understand when to stop incrementing the bound, to guarantee the completeness of the procedure. In contrast, termination and completeness of the proposed algorithm is guaranteed without com- puting any upper bound to the length of candidate models, thanks to the Boolean encoding of the PRUNE rule of the original tableau system. We conclude the paper by describing a tool that implements our procedure, and comparing its performance with other state-of-the-art LTL solvers