4 resultados para ecosystem-based adaptation
em Nottingham eTheses
Resumo:
BACKGROUND: Health-related quality of life (HRQL) assessment is an important measure of the impact of a wide range of disease process on an individual. To date, no HRQL tool has been evaluated in an Iranian population with cardiovascular disorders, specifically myocardial infarction, a major cause of mortality and morbidity. The MacNew Heart Disease Health-related Quality of Life instrument is a disease-specific HRQL questionnaire with satisfactory validity and reliability when applied cross-culturally. METHOD: A Persian version of MacNew was prepared by both forward and backward translation by bilinguals after which a feasibility test was performed. Consecutive patients (n = 51) admitted to a coronary care unit with acute myocardial infarction were recruited for measurement of their HRQL with retest one month after discharge in the follow-up clinic. Principal components analysis, intra-class correlation reliability, internal consistency, and test-retest reliability were assessed. RESULTS: Trivial rates of missing data confirmed the acceptability of the tool. Principal component analysis revealed that the three domains, emotional, social and physical, performed as well as in the original studies. Internal consistency was high and comparable to other studies, ranging from 0.92 for the emotional and physical domains, to 0.94 for the social domain, and to 0.95 for the Global score. Domain means of 5, 5.3 and 4.9 for emotional, physical and social respectively indicate that our Iranian population has similar emotional and physical but worse social HRQL scores. Test-retest analysis showed significant correlation in emotional and physical domains (P < 0.05). CONCLUSION: The Persian version of the MacNew questionnaire is comparable to the English version. It has high internal consistency and reasonable reproducibility, making it an appropriate specific quality of life tool for population-based studies and clinical practice in Iran in patients who have survived an acute myocardial infraction. Further studies are needed to confirm its validity in larger populations with cardiovascular disease
Resumo:
In this paper, we present a case-based reasoning (CBR) approach solving educational time-tabling problems. Following the basic idea behind CBR, the solutions of previously solved problems are employed to aid finding the solutions for new problems. A list of feature-value pairs is insufficient to represent all the necessary information. We show that attribute graphs can represent more information and thus can help to retrieve re-usable cases that have similar structures to the new problems. The case base is organised as a decision tree to store the attribute graphs of solved problems hierarchically. An example is given to illustrate the retrieval, re-use and adaptation of structured cases. The results from our experiments show the effectiveness of the retrieval and adaptation in the proposed method.
Resumo:
The structured representation of cases by attribute graphs in a Case-Based Reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organised as a decision tree and the retrieval process chooses those cases which are sub attribute graph isomorphic to the new case. The drawback of that approach is that it is not suitable for solving large problems. This paper presents a multiple-retrieval approach that partitions a large problem into small solvable sub-problems by recursively inputting the unsolved part of the graph into the decision tree for retrieval. The adaptation combines the retrieved partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependant upon problem specific information and which, as such, represents an approach which underpins the goal of building more general timetabling systems. We also explore the question of whether this multiple-retrieval CBR could be an effective initialisation method for local search methods such as Hill Climbing, Tabu Search and Simulated Annealing. Significant results are obtained from a wide range of experiments. An evaluation of the CBR system is presented and the impact of the approach on timetabling research is discussed. We see that the approach does indeed represent an effective initialisation method for these approaches.
Resumo:
The structured representation of cases by attribute graphs in a Case-Based Reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organised as a decision tree and the retrieval process chooses those cases which are sub attribute graph isomorphic to the new case. The drawback of that approach is that it is not suitable for solving large problems. This paper presents a multiple-retrieval approach that partitions a large problem into small solvable sub-problems by recursively inputting the unsolved part of the graph into the decision tree for retrieval. The adaptation combines the retrieved partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependant upon problem specific information and which, as such, represents an approach which underpins the goal of building more general timetabling systems. We also explore the question of whether this multiple-retrieval CBR could be an effective initialisation method for local search methods such as Hill Climbing, Tabu Search and Simulated Annealing. Significant results are obtained from a wide range of experiments. An evaluation of the CBR system is presented and the impact of the approach on timetabling research is discussed. We see that the approach does indeed represent an effective initialisation method for these approaches.