904 resultados para Learning algorithm
Resumo:
To support student learning in a large Metabolism and Nutrition class, we have introduced a web-based package, using a commercially available program, WebCT. The package was developed at a minimal cost and with limited resources. In addition to downloadable (PDF) versions of lecture Powerpoint presentations, tutorial outlines and a practical class exercise, web-based self-directed learning exercises were included to reinforce and extend lecture material in an active learning environment. The web-site also contained a variety of formative and summative assessment tasks that examined both factual recall and higher order thinking Detailed course information, timetables and a bulletin board were also readily accessible. Student usage of the site was generally high, but varied widely between individual students. Students who achieved a high overall score for the course completed on average three times as many formative assessment items and achieved a higher score for all tests than students who did poorly. Student feedback about the site was very positive with the majority of students reporting that the course material and assessment items that were available were useful to their learning. Administration of the course was also facilitated. (C) 2001 IUBMB. Published by Elsevier Science Ltd. All rights reserved.
Resumo:
The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.
Resumo:
Insect learning can change the preferences an egg laying female displays towards different host plant species. Current hypotheses propose that learning may be advantageous in adult host selection behaviour through improved recognition, accuracy or selectivity in foraging. In this paper, we present a hypothesis for when learning can be advantageous without such improvements in adult host foraging. Specifically, that learning can be an advantageous strategy for egg laying females when larvae must feed on more than one plant in order to complete development, if the fitness of larvae is reduced when they switch to a different host species. Here, larvae benefit from developing on the most abundant host species, which is the most likely choice of host for an adult insect which increases its preference for a host species through learning. The hypothesis is formalised with a mathematical model and we provide evidence from studies on the behavioural ecology, of a number of insect species which demonstrate that the assumptions of this hypothesis may frequently be fulfilled in nature. We discuss how multiple mechanisms may convey advantages in insect learning and that benefits to larval development, which have so far been overlooked, should be considered in explanations for the widespread occurrence of learning.
Resumo:
This paper aims to describe the historical outline and current development of the educational policy for students with learning difficulties in Australia, focusing especially on the state of Queensland. In order to develop educational policy of learning difficulities at the state level, the concept of learning difficulities had been discussed until the middle of the 1970's. Receiving the submissions which argued strongly against a diagnostically-oriented definition of learning disabilities, the Select Comittee concluded that there was much conceptual confusion regarding the definition and cause of learining difficulties that might take many years to resolve. Despite that it was recongnised that action was needed to assist children by looking at their "total learning environmerit", and recommended the development of an educational policy for students with learning difficulties. During 1980's, support teachers for students with learning difficulties were employed in many schools. Scince the early 1980's support teachers have been making their efforts in regular classrooms rather than in the resource rooms. Their roles have been to help students with learning difficulties using effective and specific skills, and to consult with the regular classroom teacher in solving the problems related to learning difficulties in regular classes. Currently, the support system for students with learning difficulties has been employed to organize a more systematic and broader approach in Queensland based on the accountability of schools. In the context of enphasizing literacy and numeracy, a systematic whole school approach and particular programs, such as the Year 2 Diagnostic Net and Reading Recovery, have been introduced into the educational system for early identification and early intervention.
Resumo:
A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.
Resumo:
Binning and truncation of data are common in data analysis and machine learning. This paper addresses the problem of fitting mixture densities to multivariate binned and truncated data. The EM approach proposed by McLachlan and Jones (Biometrics, 44: 2, 571-578, 1988) for the univariate case is generalized to multivariate measurements. The multivariate solution requires the evaluation of multidimensional integrals over each bin at each iteration of the EM procedure. Naive implementation of the procedure can lead to computationally inefficient results. To reduce the computational cost a number of straightforward numerical techniques are proposed. Results on simulated data indicate that the proposed methods can achieve significant computational gains with no loss in the accuracy of the final parameter estimates. Furthermore, experimental results suggest that with a sufficient number of bins and data points it is possible to estimate the true underlying density almost as well as if the data were not binned. The paper concludes with a brief description of an application of this approach to diagnosis of iron deficiency anemia, in the context of binned and truncated bivariate measurements of volume and hemoglobin concentration from an individual's red blood cells.
Resumo:
Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.