Explicit/implicit training of cooperative learning with junior elementary students /

This experimental study examined the effects of cooperative learning and expliciUimpliGit instruction on student achievement and attitudes toward working in cooperative groups. Specifically, fourth- and fifth-grade students (n=48) were randomly assigned to two conditions: cooperative learning with explicit instruction and cooperative learning with implicit instruction. All participants were given initial training either explicitly or implicitly in cooperative learning procedures via 10 one-hour sessions. Following the instruction period, all students participated in completing a group project related to a famous artists unit. It was hypothesized that the explicit instruction training would enhance students' scores on the famous artists test and the group projects, as well as improve students' attitudes toward cooperative learning. Although the explicit training group did not achieve significantly higher scores on the famous artists test, significant differences were found in group project results between the explicit and implicit groups. The explicit group also exhibited more favourable and positive attitudes toward cooperative learning. The findings of this study demonstrate that combining cooperative learning with explicit instruction is an effective classroom strategy and a useful practice for presenting and learning new information, as well as working in groups with success.

Cooperative learning and elaborative interrogation: effects on children's learning

This experimental study examined the effects of cooperative learning and a question-answering strategy called elaborative interrogation ("Why is this fact true?") on the learning of factual information about familiar animals. Retention gains were compared across four study conditions: elaborative-interrogation-plus-cooperative learning, cooperative-learning, elaborative-interrogation, and reading-control. Sixth-grade students (n=68) were randomly assigned to the four conditions. All participants were given initial training and practice in cooperative learning procedures via three 45-minute sessions. After studying 36 facts about six animals, students' retention gains were measured via immediate free recall, immediate matched association, 30-day, and GO-day matched association tests. A priori comparisons were made to analyze the data. For immediate free recall and immediate matched association, significant differences were found between students in the three experimental conditions versus those in the control condition. Elaborative-interrogation and elaborativeinterrogation- plus-cooperative-learning also promoted longterm retention (measured via 30-day matched association) of the material relative to repetitive reading with elaborative-interrogation promoting the most durable gains (measured via GO-day matched association). The relationship between the types of elaborative responses and probability of subsequent retention was also examined. Even when students were unable to provide adequate answers to the why questions, learning was facilitated more so than repetitive reading. In general, generation of adequate elaborations was associated with greater probability of recall than was provision of inadequate answers. The findings of the study demonstrate that cooperative learning and the use of elaborative interrogation, both individually and collaboratively, are effective classroom procedures for facilitating children's learning of new information.

The Salmon Algorithm - A New Population Based Search Metaheuristic

This thesis introduces the Salmon Algorithm, a search meta-heuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based on the path finding behaviour of salmon swimming upstream to spawn. There are a number of tunable parameters in the algorithm, so experiments were conducted to find the optimum parameter settings for different search spaces. The algorithm was tested on one instance of the Traveling Salesman Problem and found to have superior performance to an Ant Colony Algorithm and a Genetic Algorithm. It was then tested on three coding theory problems - optimal edit codes, optimal Hamming distance codes, and optimal covering codes. The algorithm produced improvements on the best known values for five of six of the test cases using edit codes. It matched the best known results on four out of seven of the Hamming codes as well as three out of three of the covering codes. The results suggest the Salmon Algorithm is competitive with established guided random search techniques, and may be superior in some search spaces.

Employer Perspectives on Secondary School Cooperative Education in a Southern Ontario City in Canada

Despite 2 Ontario Ministry of Education policy documents which mandate that regular program effectiveness surveys be completed in secondary school co-op programs, research was either not occurring or data were not being made available. A lack of co-op research also existed at the postsecondary level. The primary reason for this study was to determine the perspectives of current secondary school co-op employers in the Hamilton-Wentworth District School Board (HWDSB) and to identify any program strengths as well as any areas in which improvement can be made. A secondary aim of the study was to discover the reasons that some employers decline to participate in the co-op program, and why other employers decide to discontinue their co-op partnerships. An online survey was utilized with 2 Likert scales and open-ended questions to solicit responses from the 100 participants. The findings from this study strongly supported previous secondary and postsecondary co-op research. Overall, the HWDSB co-op program was found to be very strong, and employer satisfaction very high. There were, however, areas in which improvement could be made. Although most employers felt supported by institutions and felt that expectations were clearly communicated and were reasonable, there was evidence that many employers perceived a lack of institutional support which included factors such as communication, student placement and fit, and institutional responsiveness. In addition, some employers felt that students were underprepared for the workplace and lacked basic employability skills such as dependability and responsibility.

A Multi-Objective Genetic Algorithm with Side Effect Machines for Motif Discovery

Understanding the machinery of gene regulation to control gene expression has been one of the main focuses of bioinformaticians for years. We use a multi-objective genetic algorithm to evolve a specialized version of side effect machines for degenerate motif discovery. We compare some suggested objectives for the motifs they find, test different multi-objective scoring schemes and probabilistic models for the background sequence models and report our results on a synthetic dataset and some biological benchmarking suites. We conclude with a comparison of our algorithm with some widely used motif discovery algorithms in the literature and suggest future directions for research in this area.

New Contig Creation Algorithm for the de novo DNA Assembly Problem

DNA assembly is among the most fundamental and difficult problems in bioinformatics. Near optimal assembly solutions are available for bacterial and small genomes, however assembling large and complex genomes especially the human genome using Next-Generation-Sequencing (NGS) technologies is shown to be very difficult because of the highly repetitive and complex nature of the human genome, short read lengths, uneven data coverage and tools that are not specifically built for human genomes. Moreover, many algorithms are not even scalable to human genome datasets containing hundreds of millions of short reads. The DNA assembly problem is usually divided into several subproblems including DNA data error detection and correction, contig creation, scaffolding and contigs orientation; each can be seen as a distinct research area. This thesis specifically focuses on creating contigs from the short reads and combining them with outputs from other tools in order to obtain better results. Three different assemblers including SOAPdenovo [Li09], Velvet [ZB08] and Meraculous [CHS+11] are selected for comparative purposes in this thesis. Obtained results show that this thesis’ work produces comparable results to other assemblers and combining our contigs to outputs from other tools, produces the best results outperforming all other investigated assemblers.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.

Disease-Gene Association Using a Genetic Algorithm

Understanding the relationship between genetic diseases and the genes associated with them is an important problem regarding human health. The vast amount of data created from a large number of high-throughput experiments performed in the last few years has resulted in an unprecedented growth in computational methods to tackle the disease gene association problem. Nowadays, it is clear that a genetic disease is not a consequence of a defect in a single gene. Instead, the disease phenotype is a reflection of various genetic components interacting in a complex network. In fact, genetic diseases, like any other phenotype, occur as a result of various genes working in sync with each other in a single or several biological module(s). Using a genetic algorithm, our method tries to evolve communities containing the set of potential disease genes likely to be involved in a given genetic disease. Having a set of known disease genes, we first obtain a protein-protein interaction (PPI) network containing all the known disease genes. All the other genes inside the procured PPI network are then considered as candidate disease genes as they lie in the vicinity of the known disease genes in the network. Our method attempts to find communities of potential disease genes strongly working with one another and with the set of known disease genes. As a proof of concept, we tested our approach on 16 breast cancer genes and 15 Parkinson's Disease genes. We obtained comparable or better results than CIPHER, ENDEAVOUR and GPEC, three of the most reliable and frequently used disease-gene ranking frameworks.

Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.