Design guidelines for developing customised serious games for parkinson's disease rehabilitation using bespoke game sensors

The research presented in this paper proposes a set of design guidelines in the context of a Parkinson's Disease (PD) rehabilitation design framework for the development of serious games for the physical therapy of people with PD. The game design guidelines provided in the paper are informed by the study of the literature review and lessons learned from the pilot testing of serious games designed to suit the requirements of rehabilitation of patients with Parkinson's Disease. The proposed PD rehabilitation design framework employed for the games pilot testing utilises a low-cost, customized and off-the-shelf motion capture system (employing commercial game controllers) developed to cater for the unique requirement of the physical therapy of people with PD. Although design guidelines have been proposed before for the design of serious games in health, this is the first research paper to present guidelines for the design of serious games specifically for PD motor rehabilitation.

A Coordination and Ligand Replacement Based Three-Input Colorimetric Logic Gate Sensing Platform for Melamine, Mercury Ions, and Cysteine

Discrimination of different species in various target scopes within a single sensing platform can provide many advantages such as simplicity, rapidness, and cost effectiveness. Here we design a three-input colorimetric logic gate based on the aggregation and anti-aggregation of gold nanoparticles (Au NPs) for the sensing of melamine, cysteine, and Hg2+. The concept takes advantages of the highly specific coordination and ligand replacement reactions between melamine, cysteine, Hg2+, and Au NPs. Different outputs are obtained with the combinational inputs in the logic gates, which can serve as a reference to discriminate different analytes within a single sensing platform. Furthermore, besides the intrinsic sensitivity and selectivity of Au NPs to melamine-like compounds, the “INH” gates of melamine/cysteine and melamine/Hg2+ in this logic system can be employed for sensitive and selective detections of cysteine and Hg2+, respectively.

Liquid coordination complexes: a new class of Lewis acids as safer alternatives to BF3 in synthesis of polyalphaolefins

Liquid coordination complexes (LCCs) are a new class of liquid Lewis acids, prepared by combining an excess of a metal halide (e.g. GaCl3) with a basic donor molecule (e.g. amides, amines or phosphines). LCCs were used to catalyse oligomerisation of 1-decene to polyalphaolefins (PAOs). Molecular weight distribution and physical properties of the produced oils were compliant with those required for low viscosity synthetic (Group IV) lubricant base oils. Kinematic viscosities at 100 °C of ca. 4 or 6 cSt were obtained, along with viscosity indexes above 120 and pour points below −57 °C. In industry, to achieve similar properties, BF3 gas is used as a catalyst. LCCs are proposed as a safer and economically attractive alternative to BF3 gas for the production of polyalphaolefins.

Friedel–Crafts alkylation catalysed by GaCl3-based liquid coordination complexes

Friedel–Crafts alkylation of benzene with 1-decene was catalysed by a new family of liquid Lewis acids: liquid coordination complexes (LCCs). LCCs are prepared by mixing a metal halide (e.g. GaCl3) and a donor molecule (e.g. N,N-dimethylacetamide, urea, or trioctylphosphine oxide), with the metal halide typically used in excess. This leads to the formation of a eutectic mixture comprised of charged and neutral species in a dynamic equilibrium. GaCl3-based LCCs were used in catalytic amounts, giving high reaction rates under ambient conditions, with selectivities to 2-phenyldecane superior to those previously reported in the literature. The influence of reaction conditions and catalyst composition on the reaction rate and selectivity was investigated. Optimised reaction conditions were suggested. This exploratory study offers promise with regard to the development of safer, LCC-based alternatives to HF in industrial alkylations.

Designing games for older adults: an affordance based approach

The main purpose of this study is to determine the game principles that need to be adopted in order to create an enjoyable and engaging game experience for older adults, whilst ensuring that the purpose of the game, encouraging upper limb mobility, is respected. The study reported in this paper involved a group of older adults who played and gave feedback on an early game prototype which feed into the design modification process. Each player's action capabilities were measured and taken into account in the design process. This helped ensure that opportunities for action that the game afforded were adapted to players' need.

The 4Cs of Disaster Partnering: Communication, Coordination, Cooperation and Collaboration

Public, nonprofit and private organisations respond to large-scale disasters domestically and overseas. Critics of these assistance efforts, as well as those involved, often cite poor interorganisational partnering as an obstacle to successful disaster response. Observers frequently call for ‘more’ and ‘better’ partnering. We found important qualitative distinctions existed within partnering behaviours. We identified four different types of interorganisational partnering activities often referred to interchangeably: communication, cooperation, coordination and collaboration—the Four Cs. We derived definitions of the Four Cs from the partnering literature. We then tested them in a case study of the response to the 2010 Haiti earthquake. We suggest that the Four Cs are distinct activities, that organisations are typically strong or weak in one or more for various reasons, and that the four terms represent a continuum of increased interorganisational embeddedness in partnering activities.

Exact and heuristic methods for solving Boolean games

Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Boolean games allow for an intuitive and more compact representation of the agents’ goals. So far, Boolean games have been mainly studied in the literature from the Knowledge Representation perspective, and less attention has been paid on the algorithmic issues underlying the computation of solution concepts. Although some suggestions for solving specific classes of Boolean games have been made in the literature, there is currently no work available on the practical performance. In this paper, we propose the first technique to solve general Boolean games that does not require an exponential translation to normal-form games. Our method is based on disjunctive answer set programming and computes solutions (equilibria) of arbitrary Boolean games. It can be applied to a wide variety of solution concepts, and can naturally deal with extensions of Boolean games such as constraints and costs. We present detailed experimental results in which we compare the proposed method against a number of existing methods for solving specific classes of Boolean games, as well as adaptations of methods that were initially designed for normal-form games. We found that the heuristic methods that do not require all payoff matrix entries performed well for smaller Boolean games, while our ASP based technique is faster when the problem instances have a higher number of agents or action variables.

Using Answer Set Programming for Solving Boolean Games

Boolean games are a framework for reasoning about the rational behaviour of agents, whose goals are formalized using propositional formulas. They offer an attractive alternative to normal-form games, because they allow for a more intuitive and more compact encoding. Unfortunately, however, there is currently no general, tailor-made method available to compute the equilibria of Boolean games. In this paper, we introduce a method for finding the pure Nash equilibria based on disjunctive answer set programming. Our method is furthermore capable of finding the core elements and the Pareto optimal equilibria, and can easily be modified to support other forms of optimality, thanks to the declarative nature of disjunctive answer set programming. Experimental results clearly demonstrate the effectiveness of the proposed method.

Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns

In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this problem. Our method is decentralized in the sense that agents try to achieve their goals without knowledge of the other agents’ goals. We prove that this is a sound method to compute a Pareto optimal pure Nash equilibrium for an interesting class of Boolean games. Experimental results are used to investigate the performance of the algorithm.