6,404 research outputs found
Mediating boundaries between knowledge and knowing: ICT and R4D praxis
Research for development (R4D) praxis (theory-informed practical action) can be underpinned by the use of Information and Communication Technologies (ICTs) which, it is claimed, provide opportunities for knowledge working and sharing. Such a framing implicitly or explicitly constructs a boundary around knowledge as reified, or commodified – or at least able to be stabilized for a period of time (first order knowledge). In contrast ‘third-generation knowledge’ emphasizes the social nature of learning and knowledge-making; this reframes knowledge as a negotiated social practice, thus constructing a different system boundary. This paper offers critical reflections on the use of a wiki as a data repository and mediating technical platform as part of innovating in R4D praxis. A sustainable social learning process was sought that fostered an emergent community of practice among biophysical and social researchers acting for the first time as R4D co-researchers. Over time the technologically mediated element of the learning system was judged to have failed. This inquiry asks: How can learning system design cultivate learning opportunities and respond to learning challenges in an online environment to support R4D practice? Confining critical reflection to the online learning experience alone ignores the wider context in which knowledge work took place; therefore the institutional setting is also considered
Recommended from our members
Quasi-diffusion magnetic resonance imaging (QDI): A fast, high b-value diffusion imaging technique.
To enable application of non-Gaussian diffusion magnetic resonance imaging (dMRI) techniques in large-scale clinical trials and facilitate translation to clinical practice there is a requirement for fast, high contrast, techniques that are sensitive to changes in tissue structure which provide diagnostic signatures at the early stages of disease. Here we describe a new way to compress the acquisition of multi-shell b-value diffusion data, Quasi-Diffusion MRI (QDI), which provides a probe of subvoxel tissue complexity using short acquisition times (1-4 min). We also describe a coherent framework for multi-directional diffusion gradient acquisition and data processing that allows computation of rotationally invariant quasi-diffusion tensor imaging (QDTI) maps. QDI is a quantitative technique that is based on a special case of the Continuous Time Random Walk model of diffusion dynamics and assumes the presence of non-Gaussian diffusion properties within tissue microstructure. QDI parameterises the diffusion signal attenuation according to the rate of decay (i.e. diffusion coefficient, D in mm2 s-1) and the shape of the power law tail (i.e. the fractional exponent, α). QDI provides analogous tissue contrast to Diffusional Kurtosis Imaging (DKI) by calculation of normalised entropy of the parameterised diffusion signal decay curve, Hn, but does so without the limitations of a maximum b-value. We show that QDI generates images with superior tissue contrast to conventional diffusion imaging within clinically acceptable acquisition times of between 84 and 228 s. We show that QDI provides clinically meaningful images in cerebral small vessel disease and brain tumour case studies. Our initial findings suggest that QDI may be added to routine conventional dMRI acquisitions allowing simple application in clinical trials and translation to the clinical arena
Scheduling MapReduce Jobs under Multi-Round Precedences
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks
in the practical scenario where each job requires several map-reduce rounds. We
seek to minimize the average weighted completion time and consider scheduling
on identical and unrelated parallel processors. For identical processors, we
present LP-based O(1)-approximation algorithms. For unrelated processors, the
approximation ratio naturally depends on the maximum number of rounds of any
job. Since the number of rounds per job in typical MapReduce algorithms is a
small constant, our scheduling algorithms achieve a small approximation ratio
in practice. For the single-round case, we substantially improve on previously
best known approximation guarantees for both identical and unrelated
processors. Moreover, we conduct an experimental analysis and compare the
performance of our algorithms against a fast heuristic and a lower bound on the
optimal solution, thus demonstrating their promising practical performance
Variety of idempotents in nonassociative algebras
In this paper, we study the variety of all nonassociative (NA) algebras from
the idempotent point of view. We are interested, in particular, in the spectral
properties of idempotents when algebra is generic, i.e. idempotents are in
general position. Our main result states that in this case, there exist at
least nontrivial obstructions (syzygies) on the Peirce spectrum of a
generic NA algebra of dimension . We also discuss the exceptionality of the
eigenvalue which appears in the spectrum of idempotents in
many classical examples of NA algebras and characterize its extremal properties
in metrised algebras.Comment: 27 pages, 1 figure, submitte
Dirac Equation with Spin Symmetry for the Modified P\"oschl-Teller Potential in -dimensions
We present solutions of the Dirac equation with spin symmetry for vector and
scalar modified P\"oschl-Teller potential within framework of an approximation
of the centrifugal term. The relativistic energy spectrum is obtained using the
Nikiforov-Uvarov method and the two-component spinor wavefunctions are obtain
are in terms of the Jacobi polynomials. It is found that there exist only
positive-energy states for bound states under spin symmetry, and the energy
levels increase with the dimension and the potential range parameter .Comment: 9 pages and 1tabl
Risk factors for hospital admission with RSV bronchiolitis in England: a population-based birth cohort study.
OBJECTIVE: To examine the timing and duration of RSV bronchiolitis hospital admission among term and preterm infants in England and to identify risk factors for bronchiolitis admission.
DESIGN: A population-based birth cohort with follow-up to age 1 year, using the Hospital Episode Statistics database. SETTING: 71 hospitals across England.
PARTICIPANTS: We identified 296618 individual birth records from 2007/08 and linked to subsequent hospital admission records during the first year of life.
RESULTS: In our cohort there were 7189 hospital admissions with a diagnosis of bronchiolitis, 24.2 admissions per 1000 infants under 1 year (95%CI 23.7-24.8), of which 15% (1050/7189) were born preterm (47.3 bronchiolitis admissions per 1000 preterm infants (95% CI 44.4-50.2)). The peak age group for bronchiolitis admissions was infants aged 1 month and the median was age 120 days (IQR = 61-209 days). The median length of stay was 1 day (IQR = 0-3). The relative risk (RR) of a bronchiolitis admission was higher among infants with known risk factors for severe RSV infection, including those born preterm (RR = 1.9, 95% CI 1.8-2.0) compared with infants born at term. Other conditions also significantly increased risk of bronchiolitis admission, including Down's syndrome (RR = 2.5, 95% CI 1.7-3.7) and cerebral palsy (RR = 2.4, 95% CI 1.5-4.0).
CONCLUSIONS: Most (85%) of the infants who are admitted to hospital with bronchiolitis in England are born at term, with no known predisposing risk factors for severe RSV infection, although risk of admission is higher in known risk groups. The early age of bronchiolitis admissions has important implications for the potential impact and timing of future active and passive immunisations. More research is needed to explain why babies born with Down's syndrome and cerebral palsy are also at higher risk of hospital admission with RSV bronchiolitis
A systematic review of the environmental impacts of GM crop cultivation as reported from 2006 to 2011
Gluteal pyomyositis in a non-tropical region as a rare cause of sciatic nerve compression: a case report
A New Constructive Heuristic for the Fm|block|ST
This paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the first job to be scheduled, the second phase arranges the remaining jobs and the third phase uses the insertion procedure of NEH to improve the sequence. The proposed procedures evaluate the tardiness associated to the sequence obtained before and after the third phase in order to keep the best of both because the insertion phase can worsen the result. The computational evaluation of these procedures against the benchmark constructive procedures from the literature reveals their good performance.Postprint (published version
Pyomyositis of tensor fascia lata: a case report
<p>Abstract</p> <p>Introduction</p> <p>Pyomyositis is a disease in which an abscess is formed deep within large striated muscles.</p> <p>Case presentation</p> <p>We report the case of a 10-year-old boy who presented with fever and a painful hip and was subsequently diagnosed with pyomyositis of the tensor fascia lata. In children with clinical and laboratory findings of inflammation in the vicinity of the hip joint, the differential diagnosis includes transient synovitis, an early stage of Legg-Calvé-Perthes disease, infectious arthritis of the hip, rheumatologic diseases and extracapsular infection such as osteomyelitis.</p> <p>Conclusion</p> <p>To the best of the authors' knowledge, this is the first report of pyomyositis of the tensor fascia lata. Although pyomyositis is a rare disease and the differential diagnosis includes a variety of other commonly observed diseases, pyomyositis should be considered in cases where children present with fever, leukocytosis and localized pain.</p
- …