GLADNET: Promise and Legacy

[Excerpt] The Global Applied Disability Research and Information Network on Employment and Training (GLADNET) was launched by the International Labour Organization (ILO) in 1995, in cooperation with over 50 social policy research centres, governmental and non- governmental organizations involved in disability-related employment programmes from over thirty countries around the world. Major organizations of persons with disabilities were also represented – the World Blind Union, the World Federation of the Deaf, Inclusion International (formerly the International League of Societies for Persons with Mental Handicap (ILSMH)) and Disabled Peoples International (DPI). GLADNET’s lifespan was little more than a generation (1995 – 2018). What’s of interest is that it survived beyond its first few years of existence. It could easily have died early on, given a significant change in nature of support from its initiating body. That it didn’t speaks to the aspirational nature and relevance of the vision prompting its formation. It’s in pursuit of that vision where GLADNET left its mark. This document focuses on its legacy, beginning with a brief review of context within which it was initiated

Attitudes to telecare among older people, professional care workers and informal carers: a preventative strategy or crisis management?

This paper reports findings from an attitudinal survey towards telecare that emerged from twenty-two focus groups comprising ninety-two older people, fifty-five professional stakeholders and thirty-nine carers. These were convened in three different regions of England as a precursor to telecare service development. The results from this study suggest that informants’ views were shaped by prior knowledge of conventional health and social care delivery in their locality and the implication is that expectations and requirements in respect of telecare services in general are likely to be informed by wider perceptions about the extent to which community care should operate as a preventative strategy or as a mechanism for crisis management

Catalysts for ultrahigh current density oxygen cathodes for space fuel cell applications

The objective of this research was to identify promising electrocatalyst/support systems for the oxygen cathode in alkaline fuel cells operating at relatively high temperatures, O2 pressures and current densities. A number of materials were prepared, including Pb-Ru and Pb-Ir pyrochlores, RuO2 and Pt-doped RuO2, and lithiated NiO. Several of these were prepared using techniques that had not been previously used to prepare them. Particularly interesting is the use of the alkaline solution technique to prepare the Pt-doped Pb-Ru pyrochlore in high area form. Well-crystallized Pb(2)Ru(2)O(7-y) was used to fabricate high performance O2 cathodes with relatively good stability in room temperature KOH. This material was also found to be stable over a useful potential range at approximately 140 C in concentrated KOH. Other pyrochlores were found to be either unstable (amorphous samples) or the fabrication of the gas-fed electrodes could not be fully optimized during this project period. Future work may be directed at this problem. High area platinum supported on conductive metal oxide supports produced mixed results: small improvements in O2 reduction performance for Pb(2)Ru(2)O(7-y) but a large improvement for Li-doped NiO at room temperature. Nearly reversible behavior was observed for the O2/OH couple for Li-doped NiO at approximately 200 C

Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph of girth 4 is $K_{3,3}$, and conjectured \cite[Conjecture 3.6]{ADJLS} that the only essentially 4--edge-connected cubic bipartite graphs are $K_{3,3}$, the Heawood graph and the Pappus graph. There exists a characterization of symmetric configurations $n_3$ %{\bf decide notation and how to use it in the rest of the paper} due to Martinetti (1886) in which all symmetric configurations $n_3$ can be obtained from an infinite set of so called {\em irreducible} configurations \cite{VM}. The list of irreducible configurations has been completed by Boben \cite{B} in terms of their {\em irreducible Levi graphs}. In this paper we characterize irreducible pseudo 2--factor isomorphic cubic bipartite graphs proving that the only pseudo 2--factor isomorphic irreducible Levi graphs are the Heawood and Pappus graphs. Moreover, the obtained characterization allows us to partially prove the above Conjecture

Evaluation of problem-solving skills: what we really do

Abstract no. 1394published_or_final_versio

Dimensions of coupling in middleware

It is well accepted that different types of distributed architectures require different degrees of coupling. For example, in client-server and three-tier architectures, application components are generally tightly coupled, both with one-another and with the underlying middleware. Meanwhile, in off-line transaction processing, grid computing and mobile applications, the degree of coupling between application components and with the underlying middleware needs to be minimised. Terms such as "synchronous", "asynchronous", "blocking", "non-blocking", "directed", and "non-directed" are often used to refer to the degree of coupling required by an architecture or provided by a middleware. However, these terms are used with various connotations. And while various informal definitions have been provided, there is a lack of an overarching formal framework to unambiguously communicate architectural requirements with respect to (de-)coupling. This article addresses this gap by: (i) formally defining three dimensions of (de-)coupling; (ii) relating these dimensions to existing middleware; and (iii) proposing notational elements to represent various coupling integration patterns. This article also discusses a prototype that demonstrates the feasibility of its implementation