54 research outputs found

    Dyslexics are different

    Get PDF
    Dyslexia is a universal reading difficulty. It can be found in all countries, cultures and languages: Arabian, European, Chinese, etc. However, everybody is different. Dyslexic individuals are different too. They face different problems while reading. Some of them may not understand what is written, while others may omit, transpose or alter letters while reading a word. And the same at the word level. The aim of this research is to overcome these problems by providing each dyslexic individual with the appropriate learning to improve his/her reading. This may also result in improving other aspects of their difficulties: such as spelling, self-esteem, etc. To do this,the research will follow three stages: • Diagnosing a dyslexic child to identify their dyslexic type, • Developing a training system to provide a series of learning exercises tailored to the needs of the individual dyslexic child. • Evaluating the proposed system in terms of learning and satisfaction

    Validity of pneumonia severity assessment scores in low- and middle-income countries : a systematic review and meta-analysis

    Get PDF
    Background Several pneumonia severity assessment scoring systems have been developed, but the evidence of their utilisation in low- and middle-income countries (LMICs) remains limited. We sought to systematically investigate the evidence around the validity and performance of the existing pneumonia severity scores in adult patients diagnosed with community-acquired pneumonia in LMICs. Methods Medline (Ovid), Embase (Ovid), Cochrane Central Register of Controlled Trials, Scopus, and Web of Science were searched for eligible articles up to May 2020. Pooled estimates of the severity scores performance (sensitivity, specificity) at their high-risk cutoffs in predicting the reported outcome were estimated using the bivariate meta-analysis model. Heterogeneity was assessed using the I² index. Results Overall, 11 were eligible, of which, only six studies with sufficient data were included in the final meta-analysis that involved examining CURB-65 and CRB-65 scores. Both scores at a threshold ≥3 were related to an increased mortality risk, with pooled relative risks of 8.58 (95%CI: 3.48-21.18) and 4.83 (95%CI: 2.52-9.28) for CURB-65 and CRB-65, respectively. The predictive performance of CURB-65 and CRB-65 at their high-risk cutoffs, respectively, were as follows: the pooled sensitivity, 0.69 (95%CI: 0.25-0.94) and 0.04 (95%CI: 0.00-0.40); the pooled specificity, 0.89 (95%CI: 0.72-0.96) and 0.99 (95%C%: 0.95-1.00); and the area under the summary receiver operator characteristic curves, 0.90 (95%CI: 0.87-0.92) and 0.86 (95%CI: 0.83-0.89). Conclusion CURB-65 and CRB-65 at a cutoff ≥3 are strongly associated with mortality and appear to be valid scores for mortality prediction in LMICs. CURB-65 exhibited higher sensitivity and overall accuracy, compared to CRB-65

    GreeDi: Energy Efficient Routing Algorithm for Big Data on Cloud

    Get PDF
    The ever-increasing density in cloud computing parties, i.e. users, services, providers and data centres, has led to a significant exponential growth in: data produced and transferred among the cloud computing parties; network traffic; and the energy consumed by the cloud computing massive infrastructure, which is required to respond quickly and effectively to users requests. Transferring big data volume among the aforementioned parties requires a high bandwidth connection, which consumes larger amounts of energy than just processing and storing big data on cloud data centres, and hence producing high carbon dioxide emissions. This power consumption is highly significant when transferring big data into a data centre located relatively far from the users geographical location. Thus, it became high-necessity to locate the lowest energy consumption route between the user and the designated data centre, while making sure the users requirements, e.g. response time, are met. The main contribution of this paper is GreeDi, a network-based routing algorithm to find the most energy efficient path to the cloud data centre for processing and storing big data. The algorithm is, first, formalised by the situation calculus. The linear, goal and dynamic programming approaches used to model the algorithm. The algorithm is then evaluated against the baseline shortest path algorithm with minimum number of nodes traversed, using a real Italian ISP physical network topology

    Environmental effects of ozone depletion, UV radiation and interactions with climate change : UNEP Environmental Effects Assessment Panel, update 2017

    Get PDF
    Peer reviewe

    Prurigo pigmentosa following laparoscopic gastric sleeve

    No full text

    Tribal governance and stability in Yemen

    No full text
    Nadwa Al-Dawsar

    Sclerotic atrophic plaques associated with a tattoo

    No full text

    Tribes, conflict and rural livelihoods in Yemen

    No full text
    Carolyn Hayman; Nadwa al-Dawsari [u.a.
    • …
    corecore