Measuring health-related quality of life after stroke: A brief tool.

Routine assessment of health-related quality of life (HRQoL) can be time consuming and burdensome for a person with stroke. Therefore the aim of this study was to develop and test a brief instrument for assessing HRQoL among people with stroke. The Quality of Life after Stroke Scale (QLASS) was constructed from items within the Quality of Life Index-Stroke Version and the Chronic Respiratory Disease Questionnaire. It was administered to 92 people with stroke at three points in time: immediately after discharge from hospital, 6 months and 12 months later. Results suggest that the QLASS has 19 items which represent three factors: emotional functioning, mastery and fatigue which correlate with valid measures of health status and activities of daily living. The QLASS is proposed as a brief, valid HRQoL tool for use among people with stroke.

Brief Report: Faces cause less distraction in Autism

Individuals with autism have difficulties interpreting face cues that contribute to deficits of social communication.When faces need to be processed for meaning they fail to capture and hold the attention of individuals with autism. In the current study we illustrate that faces fail to capture attention in a typical manner even when they are non-functional to task completion. In a visual search task with a present butterfly target an irrelevant face distractersignificantly slows performance of typical individuals.However, participants with autism (n = 28; mean 10 years 4 months) of comparable non-verbal ability are not distracted by the faces. Interestingly, there is a significant relationship between level of functioning on the autism spectrum and degree of face capture or distraction.

TECHNICAL NOTE. A BRIEF REVIEW OF METHODS FOR MEASURING THE PERMEATION PROPERTIES OF CONCRETE IN SITU

Numerous methods are available to measure the permeation properties of concrete, which can be classified in terms of the diffusion, absorption and permeability properties. The results from these tests are generally used to infer 'quality' or relative durability. Some of these tests involve the laboratory assessment of a sample of concrete extracted from the structure. However, this Technical Note concentrates on the alternative methods appropriate for use on site. Guidance is given on the choice of an appropriate test method, which in most practical situations depends on the predominant mechanism acting on the concrete under consideration.

Brief announcement: Maintaining large dense subgraphs on dynamic networks

In distributed networks, some groups of nodes may have more inter-connections, perhaps due to their larger bandwidth availability or communication requirements. In many scenarios, it may be useful for the nodes to know if they form part of a dense subgraph, e.g., such a dense subgraph could form a high bandwidth backbone for the network. In this work, we address the problem of self-awareness of nodes in a dynamic network with regards to graph density, i.e., we give distributed algorithms for maintaining dense subgraphs (subgraphs that the member nodes are aware of). The only knowledge that the nodes need is that of the dynamic diameter D, i.e., the maximum number of rounds it takes for a message to traverse the dynamic network. For our work, we consider a model where the number of nodes are fixed, but a powerful adversary can add or remove a limited number of edges from the network at each time step. The communication is by broadcast only and follows the CONGEST model in the sense that only messages of O(log n) size are permitted, where n is the number of nodes in the network. Our algorithms are continuously executed on the network, and at any time (after some initialization) each node will be aware if it is part (or not) of a particular dense subgraph. We give algorithms that approximate both the densest subgraph, i.e., the subgraph of the highest density in the network, and the at-least-k-densest subgraph (for a given parameter k), i.e., the densest subgraph of size at least k. We give a (2 + e)-approximation algorithm for the densest subgraph problem. The at-least-k-densest subgraph is known to be NP-hard for the general case in the centralized setting and the best known algorithm gives a 2-approximation. We present an algorithm that maintains a (3+e)-approximation in our distributed, dynamic setting. Our algorithms run in O(Dlog n) time. © 2012 Authors.

Income ineqaulity from 1960-2012: a brief time-series history of capital and labour

This commentary examines two principal forms of inequality and their evolution since the 1960s: the division of national income between capital and labour, and the share of total income held by the top 1 per cent of earners. Trends are linked to current discussions of inequality drivers such as financialisation, and a brief time-series analysis of the effects of trade and financial sector growth on top incomes is presented.