60 resultados para Computational learning theory
em University of Queensland eSpace - Australia
Resumo:
Colonius suggests that, in using standard set theory as the language in which to express our computational-level theory of human memory, we would need to violate the axiom of foundation in order to express meaningful memory bindings in which a context is identical to an item in the list. We circumvent Colonius's objection by allowing that a list item may serve as a label for a context without being identical to that context. This debate serves to highlight the value of specifying memory operations in set theoretic notation, as it would have been difficult if not impossible to formulate such an objection at the algorithmic level.
Resumo:
Evaluative learning theory states that affective learning, the acquisition of likes and dislikes, is qualitatively different from relational learning, the learning of predictive relationships among stimuli. Three experiments tested the prediction derived from evaluative learning theory that relational learning, but not affective learning, is affected by stimulus competition by comparing performance during two conditional stimuli, one trained in a superconditioning procedure and the other in a blocking procedure. Ratings of unconditional stimulus expectancy and electrodermal responses indicated stimulus competition in relational learning. Evidence for stimulus competition in affective learning was provided by verbal ratings of conditional stimulus pleasantness and by measures of blink startle modulation. Taken together, the present experiments demonstrate stimulus competition in relational and affective learning, a result inconsistent with evaluative learning theory. (C) 2001 Academic Press.
Resumo:
This theoretical note describes an expansion of the behavioral prediction equation, in line with the greater complexity encountered in models of structured learning theory (R. B. Cattell, 1996a). This presents learning theory with a vector substitute for the simpler scalar quantities by which traditional Pavlovian-Skinnerian models have hitherto been represented. Structured learning can be demonstrated by vector changes across a range of intrapersonal psychological variables (ability, personality, motivation, and state constructs). Its use with motivational dynamic trait measures (R. B. Cattell, 1985) should reveal new theoretical possibilities for scientifically monitoring change processes (dynamic calculus model; R. B. Cattell, 1996b), such as encountered within psycho therapeutic settings (R. B. Cattell, 1987). The enhanced behavioral prediction equation suggests that static conceptualizations of personality structure such as the Big Five model are less than optimal.
Resumo:
The diagrammatic strong-coupling perturbation theory (SCPT) for correlated electron systems is developed for intersite Coulomb interaction and for a nonorthogonal basis set. The construction is based on iterations of exact closed equations for many - electron Green functions (GFs) for Hubbard operators in terms of functional derivatives with respect to external sources. The graphs, which do not contain the contributions from the fluctuations of the local population numbers of the ion states, play a special role: a one-to-one correspondence is found between the subset of such graphs for the many - electron GFs and the complete set of Feynman graphs of weak-coupling perturbation theory (WCPT) for single-electron GFs. This fact is used for formulation of the approximation of renormalized Fermions (ARF) in which the many-electron quasi-particles behave analogously to normal Fermions. Then, by analyzing: (a) Sham's equation, which connects the self-energy and the exchange- correlation potential in density functional theory (DFT); and (b) the Galitskii and Migdal expressions for the total energy, written within WCPT and within ARF SCPT, a way we suggest a method to improve the description of the systems with correlated electrons within the local density approximation (LDA) to DFT. The formulation, in terms of renormalized Fermions LIDA (RF LDA), is obtained by introducing the spectral weights of the many electron GFs into the definitions of the charge density, the overlap matrices, effective mixing and hopping matrix elements, into existing electronic structure codes, whereas the weights themselves have to be found from an additional set of equations. Compared with LDA+U and self-interaction correction (SIC) methods, RF LDA has the advantage of taking into account the transfer of spectral weights, and, when formulated in terms of GFs, also allows for consideration of excitations and nonzero temperature. Going beyond the ARF SCPT, as well as RF LIDA, and taking into account the fluctuations of ion population numbers would require writing completely new codes for ab initio calculations. The application of RF LDA for ab initio band structure calculations for rare earth metals is presented in part 11 of this study (this issue). (c) 2005 Wiley Periodicals, Inc.
Resumo:
We have previously shown that a division of the f-shell into two subsystems gives a better understanding of the cohesive properties as well the general behavior of lanthanide systems. In this article, we present numerical computations, using the suggested method. We show that the picture is consistent with most experimental data, e.g., the equilibrium volume and electronic structure in general. Compared with standard energy band calculations and calculations based on the self-interaction correction and LIDA + U, the f-(non-f)-mixing interaction is decreased by spectral weights of the many-body states of the f-ion. (c) 2005 Wiley Periodicals, Inc.
Resumo:
The last two decades has seen a proliferation in the provision of and importance attached to coach education in many Western countries. Pivotal to many coach education programmes is the notion of apprenticeship. Increasingly, mentoring is being positioned as a possible tool for enhancing coach education and professional expertise. However, there is a paucity of empirical data on interventions in and evaluations of coach education programmes. In their recent evaluation of a coach education programme, Cassidy, Potrac & McKenzie conclude that the situated learning literature could provide coach educators with a generative platform for the (re)examination of apprenticeships and mentoring in a coach education context. This paper discusses the merits of using Situated Learning theory and the associated concept of Communities of Practice (CoP) to stimulate discussion on developing new understandings of the practices of apprenticeship and mentoring in coach education.
Resumo:
Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.
Resumo:
The marginalisation of the teaching and learning of legal research in the Australian law school curriculum is, in the author's experience, a condition common to many law schools. This is reflected in the reluctance of some law teachers to include legal research skills in the substantive law teaching schedule — often the result of unwillingness on the part of law school administrators to provide the resources necessary to ensure that such integration does not place a disproportionately heavy burden of assessment on those who are tempted. However, this may only be one of many reasons for the marginalisation of legal research in the law school experience. Rather than analyse the reasons for this marginalisation, this article deals with what needs to be done to rectify the situation, and to ensure that the teaching of legal research can be integrated into the law school curriculum in a meaningful way. This requires the use of teaching and learning theory which focuses on student-centred learning. This article outlines a model of legal research. It incorporates five transparent stages which are: analysis, contextualisation, bibliographic skills, interpretation and assessment and application.
Resumo:
Machine learning techniques have been recognized as powerful tools for learning from data. One of the most popular learning techniques, the Back-Propagation (BP) Artificial Neural Networks, can be used as a computer model to predict peptides binding to the Human Leukocyte Antigens (HLA). The major advantage of computational screening is that it reduces the number of wet-lab experiments that need to be performed, significantly reducing the cost and time. A recently developed method, Extreme Learning Machine (ELM), which has superior properties over BP has been investigated to accomplish such tasks. In our work, we found that the ELM is as good as, if not better than, the BP in term of time complexity, accuracy deviations across experiments, and most importantly - prevention from over-fitting for prediction of peptide binding to HLA.
Resumo:
Experiential learning approaches such as role-play have been found to be valuable methods of bridging the divide between academic knowledge and practical skills, a problem often cited in tourism and hospitality management education. Such approaches have been found to contribute towards deeper learning by enhancing students' interest, motivation, participation, knowledge and skill development. This paper reports on the implementation of an experiential learning approach designed to encourage and facilitate deeper learning approaches, with the contributing aims of providing students with a more interesting learning experience and a broader set of skills for future employment.
Resumo:
We are developing a telemedicine application which offers automated diagnosis of facial (Bell's) palsy through a Web service. We used a test data set of 43 images of facial palsy patients and 44 normal people to develop the automatic recognition algorithm. Three different image pre-processing methods were used. Machine learning techniques (support vector machine, SVM) were used to examine the difference between the two halves of the face. If there was a sufficient difference, then the SVM recognized facial palsy. Otherwise, if the halves were roughly symmetrical, the SVM classified the image as normal. It was found that the facial palsy images had a greater Hamming Distance than the normal images, indicating greater asymmetry. The median distance in the normal group was 331 (interquartile range 277-435) and the median distance in the facial palsy group was 509 (interquartile range 334-703). This difference was significant (P