909 resultados para Solving Problems for Evidence
Resumo:
El estudio tuvo como propósito determinar la efectividad relativa del ABP, comparado con el método tradicional para desarrollar habilidades de resolución de problemas en el aprendizaje de las aplicaciones de la solución de triángulos en el grado 10º de la Institución Educativa El Progreso, de El Carmen de Viboral, Antioquia. La enseñanza-aprendizaje de las matemáticas sustentadas con la estrategia didáctica Aprendizaje Basado en Problemas permite a los estudiantes y docentes aproximarse al conocimiento de una manera similar a como lo hacen los científicos; el primer paso es una situación de duda, perplejidad del estudiante provocada por la Situación Problema planteada por el docente, el segundo un momento de “sugerencias” en las que la mente salta hacia adelante en busca de una posible solución (Dewey, 1933, p. 102). El tercer paso “intelectualización” de la dificultad que se ha percibido para convertirlo en un problema que debe solucionarse (Dewey, 1933, p. 103). La cuarta es “la idea conductora o hipótesis”, las cuales se basan en la formulación de explicaciones sugeridas o soluciones posibles (Dewey, 1933, p. 104). El quinto paso sería el “razonamiento”, consiste en la elaboración racional de una idea que se va desarrollando de acuerdo a las habilidades de cada persona (Dewey, 1933, p. 105). El paso final es la “comprobación de hipótesis” en situaciones reales. Este proceso se evidenció a través de cuatro Situaciones-Problema enfocadas desde un contexto auténtico “la remodelación del parque principal de El Carmen de Viboral” con el objetivo de motivar a los estudiantes para el aprendizaje de algunos conceptos matemáticos y el desarrollo de habilidades de resolución de problemas. La metodología de la investigación fue un diseño cuasi-experimental con grupo experimental compuesto por 38 estudiantes del grado 10º2 y grupo control con 37 estudiantes del grado 10º1. Se empleó como técnica de recolección de la información una prueba pre-test antes del tratamiento y una prueba post-test que se aplicó después del tratamiento a ambos grupos; se aplicó también una escala de satisfacción de los estudiantes con la metodología tradicional en ambos grupos y una escala de satisfacción con la estrategia didáctica ABP sólo al grupo experimental; la observación directa, y el portafolio que evidenciaba todas las construcciones de los estudiantes. La aplicación de la estrategia didáctica experimental se aplicó durante 4 meses, con una intensidad horaria de cuatro horas semanales, tiempo durante el cual se implementaron las cuatro Situaciones-Problema. Se concluyó entre otros aspectos que el 86,5% de los estudiantes encuentran las clases de matemáticas como interesantes, contextualizadas, aplicables y significativas, mientras que antes del tratamiento sólo el 44,4% se encontraba satisfecho con las clases de matemáticas, con una diferencia en cambio de actitud de 42,1% frente a las clases de matemáticas con la metodología tradicional. En el análisis comparativo de adquisición de competencias específicas se demuestra que el grupo experimental demostró ser matemáticamente más competente con respecto al grupo control en todas las competencias evaluadas: capacidad de modelación, inductiva, comunicativa y habilidad procedimental. Además, el proyecto de investigación tuvo un valor agregado: 10 estudiantes tuvieron la oportunidad de conocer más sobre su cultura ceramista mediante el diseño y construcción de mosaicos que los ofreció la casa de la cultura en forma gratuita.
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:
A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabling problem, will produce results which are comparative to those of a specially designed heuristic for that problem. We are investigating a Case based reasoning (CBR) technique to select from a set of algorithms which have been applied successfully to similar problem instances in the past. The assumption in CBR is that similar problems have similar solutions. For our system, the assumption is that an algorithm used to find a good solution to one problem will also produce a good result for a similar problem. The key to the success of the system will be our definition of similarity between two exam timetabling problems. The study will be carried out by running a series of tests using a simple Simulated Annealing Algorithm on a range of problems with differing levels of similarity and examining the data sets in detail. In this paper an initial investigation of the key factors which will be involved in this measure is presented with a discussion of how the definition of good impacts on this.
Resumo:
A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabling problem, will produce results which are comparative to those of a specially designed heuristic for that problem. We are investigating a Case based reasoning (CBR) technique to select from a set of algorithms which have been applied successfully to similar problem instances in the past. The assumption in CBR is that similar problems have similar solutions. For our system, the assumption is that an algorithm used to find a good solution to one problem will also produce a good result for a similar problem. The key to the success of the system will be our definition of similarity between two exam timetabling problems. The study will be carried out by running a series of tests using a simple Simulated Annealing Algorithm on a range of problems with differing levels of similarity and examining the data sets in detail. In this paper an initial investigation of the key factors which will be involved in this measure is presented with a discussion of how the definition of good impacts on this.
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:
This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the problem in hand. Knowledge discovery techniques are employed in two distinct scenarios. Firstly, we model the problem and the problem solving situations along with specific heuristics for those problems. Secondly, we refine the case base and discard cases which prove to be non-useful in solving new problems. Experimental results are presented and analyzed. It is shown that case based reasoning can act effectively as an intelligent approach to learn which heuristics work well for particular timetabling situations. We conclude by outlining and discussing potential research issues in this critical area of knowledge discovery for different difficult timetabling problems.
Resumo:
Network Virtualization is a key technology for the Future Internet, allowing the deployment of multiple independent virtual networks that use resources of the same basic infrastructure. An important challenge in the dynamic provision of virtual networks resides in the optimal allocation of physical resources (nodes and links) to requirements of virtual networks. This problem is known as Virtual Network Embedding (VNE). For the resolution of this problem, previous research has focused on designing algorithms based on the optimization of a single objective. On the contrary, in this work we present a multi-objective algorithm, called VNE-MO-ILP, for solving dynamic VNE problem, which calculates an approximation of the Pareto Front considering simultaneously resource utilization and load balancing. Experimental results show evidences that the proposed algorithm is better or at least comparable to a state-of-the-art algorithm. Two performance metrics were simultaneously evaluated: (i) Virtual Network Request Acceptance Ratio and (ii) Revenue/Cost Relation. The size of test networks used in the experiments shows that the proposed algorithm scales well in execution times, for networks of 84 nodes
Resumo:
This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the problem in hand. Knowledge discovery techniques are employed in two distinct scenarios. Firstly, we model the problem and the problem solving situations along with specific heuristics for those problems. Secondly, we refine the case base and discard cases which prove to be non-useful in solving new problems. Experimental results are presented and analyzed. It is shown that case based reasoning can act effectively as an intelligent approach to learn which heuristics work well for particular timetabling situations. We conclude by outlining and discussing potential research issues in this critical area of knowledge discovery for different difficult timetabling problems.
Resumo:
This thesis investigates the effectiveness of Corporate Governance (CG) reforms in Pakistan. Using a sample of 160 Pakistani firms from 2003 to 2013 and governance data collected manually from the annual reports, this thesis investigates seven closely related and important corporate issues that are related to the compliance of governance rules. Specifically, it aims to : (i) investigate the degree of CG compliance with 2002 Pakistani Code of CG (PCCG); (ii) determine whether the introduction of 2002 PCCG has improved Pakistani CG practices; (iii) investigate the determinants of CG compliance and disclosure for Pakistani listed firms; (iv) test the nexus between CG compliance with the 2002 PCCG and firms’ cost of capital (COC); (v) investigate the impact of different individual CG mechanisms on listed firms COC; (vi) examine how different ownership structures impact on firms’ COC; and (vii) analyse relationship between CG structures and Cost of Equity (COE) as well as Cost of Debt (COD) for Pakistani listed firms. These empirical investigations report some important results. First, the reported findings suggest that Pakistani firms have responded positively to governance disclosure requirements over the eleven year period from 2003 to 2013. The results also show that the introduction of the PCCG in 2002 has improved CG standards by Pakistani listed firms. Second, the reported results related to the determinants of CG compliance demonstrate that significant and positive association between institutional, government and foreign ownership with CG compliance. However, findings relating to the determinants of CG compliance show a negative and significant association between board size and block ownership with CG compliance and disclosure. The study finds no significant relationship between director ownership, audit firm size and the presence of female board members with the constructed Pakistan Corporate Governance Index (PCGI). Third, the investigation on the relationship between CG and COC report a significantly negative nexus between PCGI and firms’ COC. The investigation on the association between ownership structures and COC report a negative and significant nexus between block ownership with firms’ COC. Further, a number of robustness analyses performed in this study suggest that the empirical results reported in this study are generally robust to the alternative CG variables, alternative COC variables and potential endogeneity problems.
Resumo:
Background and Purpose: At least part of the failure in the transition from experimental to clinical studies in stroke has been attributed to the imprecision introduced by problems in the design of experimental stroke studies. Using a metaepidemiologic approach, we addressed the effect of randomization, blinding, and use of comorbid animals on the estimate of how effectively therapeutic interventions reduce infarct size. Methods: Electronic and manual searches were performed to identify meta-analyses that described interventions in experimental stroke. For each meta-analysis thus identified, a reanalysis was conducted to estimate the impact of various quality items on the estimate of efficacy, and these estimates were combined in a meta meta-analysis to obtain a summary measure of the impact of the various design characteristics. Results: Thirteen meta-analyses that described outcomes in 15 635 animals were included. Studies that included unblinded induction of ischemia reported effect sizes 13.1% (95% CI, 26.4% to 0.2%) greater than studies that included blinding, and studies that included healthy animals instead of animals with comorbidities overstated the effect size by 11.5% (95% CI, 21.2% to 1.8%). No significant effect was found for randomization, blinded outcome assessment, or high aggregate CAMARADES quality score. Conclusions: We provide empirical evidence of bias in the design of studies, with studies that included unblinded induction of ischemia or healthy animals overestimating the effectiveness of the intervention. This bias could account for the failure in the transition from bench to bedside of stroke therapies.
Resumo:
A combined Short-Term Learning (STL) and Long-Term Learning (LTL) approach to solving mobile robot navigation problems is presented and tested in both real and simulated environments. The LTL consists of rapid simulations that use a Genetic Algorithm to derive diverse sets of behaviours. These sets are then transferred to an idiotypic Artificial Immune System (AIS), which forms the STL phase, and the system is said to be seeded. The combined LTL-STL approach is compared with using STL only, and with using a handdesigned controller. In addition, the STL phase is tested when the idiotypic mechanism is turned off. The results provide substantial evidence that the best option is the seeded idiotypic system, i.e. the architecture that merges LTL with an idiotypic AIS for the STL. They also show that structurally different environments can be used for the two phases without compromising transferability.
Resumo:
he aims of this cross-sectional study were to examine the developmental characteristics (biological maturation and body size) associated with gross motor coordination problems in 5193 Peruvian children (2787 girls) aged 6–14 years from different geographical locations, and to investigate how the probability that children suffer with gross motor coordination problems varies with physical fitness. Children with gross motor coordination problems were more likely to have lower flexibility and explosive strength levels, having adjusted for age, sex, maturation and study site. Older children were more likely to suffer from gross motor coordination problems, as were those with greater body mass index. However, more mature children were less likely to have gross motor coordination problems, although children who live at sea level or at high altitude were more likely to suffer from gross motor coordination problems than children living in the jungle. Our results provide evidence that children and adolescents with lower physical fitness are more likely to have gross motor coordination difficulties. The identification of youths with gross motor coordination problems and providing them with effective intervention programs is an important priority in order to overcome such developmental problems, and help to improve their general health status.
Resumo:
The present research aims to analyse the impact of corporate governance and cultural dimensions in dividend policy. The corporate governance and dividend policy have a close relationship, in that both are evidenced in literature to mitigate agency problems. Cultural factors are also related to agency problems. The existence of agency problems and their solutions differs across countries and it is related to the implementation of the mechanisms of governance. So, cultural factors may have influence on corporate governance and dividend policy. Our sample consists in 1 232 companies belonging to the main indices of 38 countries classified as emerging or developed. To measure the quality of firm level corporate governance, we use the ASSET4 Corporate Governance Performance Index, developed by Thomson Reuters, and as proxy of culture we use three cultural dimensions developed by Geert Hofstede, namely uncertainty avoidance, masculinity and indulgence. We obtained significant empirical evidence that firms with high quality of corporate governance pay higher dividends. With regard to cultural factors, we confirm that in countries with high levels of masculinity and uncertainty avoidance, the dividend payout ratio is lower. On the other hand, countries with high level of indulgence have higher dividend payout ratio. However, we verify that the impact of cultural effects is minimized when the firms have a high quality level of corporate governance. Additionally, we found that the impact of corporate governance and cultural factors in dividend policy differs when dealing with emerging or developed countries.