Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Transient and Steady-State Analysis of the Affine Combination of Two Adaptive Filters

In this paper, we propose an approach to the transient and steady-state analysis of the affine combination of one fast and one slow adaptive filters. The theoretical models are based on expressions for the excess mean-square error (EMSE) and cross-EMSE of the component filters, which allows their application to different combinations of algorithms, such as least mean-squares (LMS), normalized LMS (NLMS), and constant modulus algorithm (CMA), considering white or colored inputs and stationary or nonstationary environments. Since the desired universal behavior of the combination depends on the correct estimation of the mixing parameter at every instant, its adaptation is also taken into account in the transient analysis. Furthermore, we propose normalized algorithms for the adaptation of the mixing parameter that exhibit good performance. Good agreement between analysis and simulation results is always observed.

On Building a Memory Evolutive System for Application to Learning and Cognition Modeling

We address here aspects of the implementation of a memory evolutive system (MES), based on the model proposed by A. Ehresmann and J. Vanbremeersch (2007), by means of a simulated network of spiking neurons with time dependent plasticity. We point out the advantages and challenges of applying category theory for the representation of cognition, by using the MES architecture. Then we discuss the issues concerning the minimum requirements that an artificial neural network (ANN) should fulfill in order that it would be capable of expressing the categories and mappings between them, underlying the MES. We conclude that a pulsed ANN based on Izhikevich`s formal neuron with STDP (spike time-dependent plasticity) has sufficient dynamical properties to achieve these requirements, provided it can cope with the topological requirements. Finally, we present some perspectives of future research concerning the proposed ANN topology.

Improving the tracking capability of adaptive filters via convex combination

As is well known, Hessian-based adaptive filters (such as the recursive-least squares algorithm (RLS) for supervised adaptive filtering, or the Shalvi-Weinstein algorithm (SWA) for blind equalization) converge much faster than gradient-based algorithms [such as the least-mean-squares algorithm (LMS) or the constant-modulus algorithm (CMA)]. However, when the problem is tracking a time-variant filter, the issue is not so clear-cut: there are environments for which each family presents better performance. Given this, we propose the use of a convex combination of algorithms of different families to obtain an algorithm with superior tracking capability. We show the potential of this combination and provide a unified theoretical model for the steady-state excess mean-square error for convex combinations of gradient- and Hessian-based algorithms, assuming a random-walk model for the parameter variations. The proposed model is valid for algorithms of the same or different families, and for supervised (LMS and RLS) or blind (CMA and SWA) algorithms.

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

Evaluation of algorithms used to order markers on genetic maps

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results. Heredity (2009) 103, 494-502; doi:10.1038/hdy.2009.96; published online 29 July 2009

Information Society, Teaching, and Learning: Education Reforms in Brazil

This article examines the subject matter of learning within the context of information society, through an inquiry concerning both the reforms in education adopted in Brazil in the last thirty years and their results. It provides a revision on the explanations of school failure based on assumptions of learning problems due to cognitive and linguistic deficits. From the guidelines related with written school forms as well as the constant cultural oppression accomplished inside the school, the article claims the necessity of changing the psychological and pedagogic views that, under the label of democratic practices, determine school institutions and its daily life, by means of instrumental relations with knowledge that disregard the reading practices which are congenial to popular culture.

Learning for fun: The unique contribution of educational leisure experiences

What do visitors want or expect from an educational leisure activity such as a visit to a museum, zoo, aquarium or other such experience? Is it to learn something or to experience learning? This paper uses the term 'learning for fun' to refer to the phenomenon in which visitors engage in a learning experience because they value and enjoy the process of learning itself. Five propositions regarding the nature of learning for fun are discussed, drawing on quantitative and qualitative data from visitors to a range of educational leisure activities. The commonalities between learning for fun and other theoretical constructs such as 'experience,' 'flow', 'intrinsic motivation', and 'curiosity' are explored. It is concluded that learning for fun is a unique and distinctive offering of educational leisure experiences, with implications for future research and experience design.

Parameter setting and statistical learning

Three main models of parameter setting have been proposed: the Variational model proposed by Yang (2002; 2004), the Structured Acquisition model endorsed by Baker (2001; 2005), and the Very Early Parameter Setting (VEPS) model advanced by Wexler (1998). The VEPS model contends that parameters are set early. The Variational model supposes that children employ statistical learning mechanisms to decide among competing parameter values, so this model anticipates delays in parameter setting when critical input is sparse, and gradual setting of parameters. On the Structured Acquisition model, delays occur because parameters form a hierarchy, with higher-level parameters set before lower-level parameters. Assuming that children freely choose the initial value, children sometimes will miss-set parameters. However when that happens, the input is expected to trigger a precipitous rise in one parameter value and a corresponding decline in the other value. We will point to the kind of child language data that is needed in order to adjudicate among these competing models.

Mummy! Ball! Fish!: Why English-learning children produce nouns earlier than verbs

When English-learning children begin using words the majority of their early utterances (around 80%) are nouns. Compared to nouns, there is a paucity of verbs or non-verb relational words, such as 'up' meaning 'pick me up'. The primary explanations to account for these differences in use either argue in support of a 'cognitive account', which claims that verbs entail more cognitive complexity than nouns, or they provide evidence challenging this account. In this paper I propose an additional explanation for children's noun/verb asymmetry. Presenting a 'multi-modal account' of word-learning based on children's gesture and word combinations, I show that at the one-word stage English-learning children use gestures to express verb-like elements which leaves their words free to express noun-like elements.

Fundamental Skills in Physics: Embedded Learning

Student attitudes towards a subject affect their learning. For students in physics service courses, relevance is emphasised by vocational applications. A similar strategy is being used for students who aspire to continued study of physics, in an introduction to fundamental skills in experimental physics – the concepts, computational tools and practical skills involved in appropriately obtaining and interpreting measurement data. An educational module is being developed that aims to enhance the student experience by embedding learning of these skills in the practicing physicist’s activity of doing an experiment (gravity estimation using a rolling pendulum). The group concentrates on particular skills prompted by challenges such as: • How can we get an answer to our question? • How good is our answer? • How can it be improved? This explicitly provides students the opportunity to consider and construct their own ideas. It gives them time to discuss, digest and practise without undue stress, thereby assisting them to internalise core skills. Design of the learning activity is approached in an iterative manner, via theoretical and practical considerations, with input from a range of teaching staff, and subject to trials of prototypes.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

Demotivation: Understanding Resistance to English Language Learning - The Case of Vietnamese Students

Demotivation in English language learning was investigated, using Vietnam as a case study, with three main foci: (i) the reasons (i.e., the demotives) underlying demotivation; (ii) the degree of influence of different demotives; and (iii) students’ experiences in overcoming demotivation. Using stimulated recall essays from 100 university students of their foreign language learning experiences, the findings indicated that demotivation was a significant issue for EFL learning, and a framework for discussing the different sources of demotives was developed. While some categories of demotives occurred more frequent than others, no category appeared to be more or less difficult to overcome. Rather, students’ awareness of the role of English language and their determination to succeed were critical factors in overcoming demotivation.

Extending teaching and learning initiatives in the cross-disciplinary field of biotechnology

Our AUTC Biotechnology study (Phases 1 and 2) identified a range of areas that could benefit from a common approach by universities nationally. A national network of biotechnology educators needs to be solidified through more regular communication, biennial meetings, and development of methods for sharing effective teaching practices and industry placement strategies, for example. Our aims in this proposed study are to: a. Revisit the state of undergraduate biotechnology degree programs nationally to determine their rate of change in content, growth or shrinkage in student numbers (as the biotech industry has had its ups and downs in recent years), and sustainability within their institutions in light of career movements of key personnel, tightening budgets, and governmental funding priorities. b. Explore the feasibility of a range of initiatives to benefit university biotechnology education to determine factors such as how practical each one is, how much buy-in could be gained from potentially participating universities and industry counterparts, and how sustainable such efforts are. One of many such initiatives arising in our AUTC Biotech study was a national register of industry placements for final-year students. c. During scoping and feasibility study, to involve our colleagues who are teaching in biotechnology – and contributing disciplines. Their involvement is meant to yield not only meaningful insight into how to strengthen biotechnology teaching and learning but also to generate ‘buy-in’ on any initiatives that result from this effort.