Assessing dysphagia via telerehabilitation: patient perceptions and satisfaction

To gain insight into factors which may infl uence future acceptance of dysphagia management via telerehabilitation, patients’ perceptions were examined before and after a telerehabilitation assessment session. Forty adult patients with dysphagia(M = 66 years, SD = 16.25) completed pre- and post-session questionnaires which consisted of 14 matched questions worded to suit pre- and post-conditions. Questions explored comfort with the use of telerehabilitation, satisfaction with audio and video quality, benefi ts of telerehabilitation assessments and patients’ preferred assessment modality. Questions were rated on a 5-point scale (1 = strongly disagree, 3 = unsure, 5 = strongly agree). Patients’ comfort with assessment via telerehabilitation was high in over 80% of the group both pre- and post-assessment. Pre-assessment, patients were unsure what to expect with the auditory and visual aspects of the videoconference, however there were signifi cant positive changes reported post-experience. In relation to perceived benefits of telerehabilitation services in general, most patients believed in the value of telerehabilitation and post-assessment this increased to 90 – 100% agreement. Although 92% felt they would be comfortable receiving services via telerehabilitation, 45% of patients indicated ultimate preference for a traditional faceto-face assessment. The data highlight that patients are interested in and willing to receive services via telerehabilitation; however, any concerns should be addressed pre-assessment

Evaluation of formant-like features on an automatic vowel classification task

Contains fulltext : 58535.pdf (publisher's version ) (Open Access)10 p

Stuttering mostly speeds up solving parity games

We study the process theoretic notion of stuttering equivalence in the setting of parity games. We demonstrate that stuttering equivalent vertices have the same winner in the parity game. This means that solving a parity game can be accelerated by minimising the game graph with respect to stuttering equivalence. While, at the outset, it might not be clear that this strategy should pay off, our experiments using typical verification problems illustrate that stuttering equivalence speeds up solving parity games in many cases

A process algebra for wireless mesh networks

We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery