Journey to work:exploring difficulties, solutions and the impact of aging

A study was conducted in the UK, as part of the New Dynamics of Ageing Working Late project, of the journey to work among 1215 older workers (age groups 45-49, 50-55, 56-60 and 60 + ). The aim was to identify problems or concerns that they might have with their commute, strategies that have been adopted to address them, and the role that employers can play to assist them. Follow-up interviews with 36 employees identified many strategies for assisting with the problems of journeys to work, ranging from car share and using public transport to flexible working and working some days from home. Further interviews with a sample of 12 mainly larger companies showed that employers feel a responsibility for their workers’ commute, with some offering schemes to assist them, such as adjusting work shift timings to facilitate easier parking. The research suggests that the journey to work presents difficulties for a significant minority of those aged over 45, including issues with cost, stress, health, fatigue and journey time. It may be possible to reduce the impact of these difficulties on employee decisions to change jobs or retire by assisting them to adopt mitigating strategies. It does not appear that the likelihood of experiencing a problem with the journey to work increases as the employee approaches retirement; therefore, any mitigating strategy is likely to help employees of all ages. These strategies have been disseminated to a wider audience through an online resource at www.workinglate.org.

Vacuum spacetimes of embedding class two

Doubt is cast on the much quoted results of Yakupov that the torsion vector in embedding class two vacuum space-times is necessarily a gradient vector and that class 2 vacua of Petrov type III do not exist. The rst result is equivalent to the fact that the two second fundamental forms associated with the embedding necessarily commute and has been assumed in most later investigations of class 2 vacuum space-times. Yakupov stated the result without proof, but hinted that it followed purely algebraically from his identity: Rijkl Ckl = 0 where Cij is the commutator of the two second fundamental forms of the embedding.From Yakupov's identity, it is shown that the only class two vacua with non-zero commutator Cij must necessarily be of Petrov type III or N. Several examples are presented of non-commuting second fundamental forms that satisfy Yakupovs identity and the vacuum condition following from the Gauss equation; both Petrov type N and type III examples occur. Thus it appears unlikely that his results could follow purely algebraically. The results obtained so far do not constitute denite counter-examples to Yakupov's results as the non-commuting examples could turn out to be incompatible with the Codazzi and Ricci embedding equations. This question is currently being investigated.

Quantum kernels for unattributed graphs using discrete-time quantum walks

In this paper, we develop a new family of graph kernels where the graph structure is probed by means of a discrete-time quantum walk. Given a pair of graphs, we let a quantum walk evolve on each graph and compute a density matrix with each walk. With the density matrices for the pair of graphs to hand, the kernel between the graphs is defined as the negative exponential of the quantum Jensen–Shannon divergence between their density matrices. In order to cope with large graph structures, we propose to construct a sparser version of the original graphs using the simplification method introduced in Qiu and Hancock (2007). To this end, we compute the minimum spanning tree over the commute time matrix of a graph. This spanning tree representation minimizes the number of edges of the original graph while preserving most of its structural information. The kernel between two graphs is then computed on their respective minimum spanning trees. We evaluate the performance of the proposed kernels on several standard graph datasets and we demonstrate their effectiveness and efficiency.