Learning the dynamics of embedded clauses

Recent work by Siegelmann has shown that the computational power of recurrent neural networks matches that of Turing Machines. One important implication is that complex language classes (infinite languages with embedded clauses) can be represented in neural networks. Proofs are based on a fractal encoding of states to simulate the memory and operations of stacks. In the present work, it is shown that similar stack-like dynamics can be learned in recurrent neural networks from simple sequence prediction tasks. Two main types of network solutions are found and described qualitatively as dynamical systems: damped oscillation and entangled spiraling around fixed points. The potential and limitations of each solution type are established in terms of generalization on two different context-free languages. Both solution types constitute novel stack implementations - generally in line with Siegelmann's theoretical work - which supply insights into how embedded structures of languages can be handled in analog hardware.

The applicability of recurrent neural networks for biological sequence analysis

Selection of machine learning techniques requires a certain sensitivity to the requirements of the problem. In particular, the problem can be made more tractable by deliberately using algorithms that are biased toward solutions of the requisite kind. In this paper, we argue that recurrent neural networks have a natural bias toward a problem domain of which biological sequence analysis tasks are a subset. We use experiments with synthetic data to illustrate this bias. We then demonstrate that this bias can be exploitable using a data set of protein sequences containing several classes of subcellular localization targeting peptides. The results show that, compared with feed forward, recurrent neural networks will generally perform better on sequence analysis tasks. Furthermore, as the patterns within the sequence become more ambiguous, the choice of specific recurrent architecture becomes more critical.

STAR: predicting recombination sites from amino acid sequence

Background: Designing novel proteins with site-directed recombination has enormous prospects. By locating effective recombination sites for swapping sequence parts, the probability that hybrid sequences have the desired properties is increased dramatically. The prohibitive requirements for applying current tools led us to investigate machine learning to assist in finding useful recombination sites from amino acid sequence alone. Results: We present STAR, Site Targeted Amino acid Recombination predictor, which produces a score indicating the structural disruption caused by recombination, for each position in an amino acid sequence. Example predictions contrasted with those of alternative tools, illustrate STAR'S utility to assist in determining useful recombination sites. Overall, the correlation coefficient between the output of the experimentally validated protein design algorithm SCHEMA and the prediction of STAR is very high (0.89). Conclusion: STAR allows the user to explore useful recombination sites in amino acid sequences with unknown structure and unknown evolutionary origin. The predictor service is available from http://pprowler.itee.uq.edu.au/star.

Improving support vector solutions by selecting a sequence of training subsets

In this paper we demonstrate that it is possible to gradually improve the performance of support vector machine (SVM) classifiers by using a genetic algorithm to select a sequence of training subsets from the available data. Performance improvement is possible because the SVM solution generally lies some distance away from the Bayes optimal in the space of learning parameters. We illustrate performance improvements on a number of benchmark data sets.

Exploiting sequence dependencies in the prediction of peroxisomal proteins

Prediction of peroxisomal matrix proteins generally depends on the presence of one of two distinct motifs at the end of the amino acid sequence. PTS1 peroxisomal proteins have a well conserved tripeptide at the C-terminal end. However, the preceding residues in the sequence arguably play a crucial role in targeting the protein to the peroxisome. Previous work in applying machine learning to the prediction of peroxisomal matrix proteins has failed W capitalize on the full extent of these dependencies. We benchmark a range of machine learning algorithms, and show that a classifier - based on the Support Vector Machine - produces more accurate results when dependencies between the conserved motif and the preceding section are exploited. We publish an updated and rigorously curated data set that results in increased prediction accuracy of most tested models.

Implicit learning is not subject to blocking

Explicit (aware) learning has been shown to evidence certain characteristics, such as extinction, blocking, occasion setting, and reliance on context. These characteristics have not been assessed in implicit (unaware) learning. The current study investigated whether implicit learning is subject to blocking. Participants completed a cued reaction time task, where they watched rapid presentations of a random sequence of 8 pairs of shapes, and responded to two target shapes. One target was always preceded by a cue. The experimental group completed a pretraining phase where half the cue, one shape, was followed by the target. Both experimental and control groups completed a training phase where both elements of the cue, two shapes, were followed by the target. Both aware and unaware participants evidenced learning, whereby responding was faster for cued than uncued targets. Aware participants in the experimental group responded faster to targets preceded by the pretrained element than by the other element of the cue. Control and unaware experimental participants were faster to respond to targets preceded by either element of the cue. As blocking was only evident in aware participants, but implicit learning was observed in all participants, it is concluded that implicit learning is not subject to blocking.

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.

Unlocking hidden genomic sequence

Despite the success of conventional Sanger sequencing, significant regions of many genomes still present major obstacles to sequencing. Here we propose a novel approach with the potential to alleviate a wide range of sequencing difficulties. The technique involves extracting target DNA sequence from variants generated by introduction of random mutations. The introduction of mutations does not destroy original sequence information, but distributes it amongst multiple variants. Some of these variants lack problematic features of the target and are more amenable to conventional sequencing. The technique has been successfully demonstrated with mutation levels up to an average 18% base substitution and has been used to read previously intractable poly(A), AT-rich and GC-rich motifs.

Bellerophon: a program to detect chimeric sequences in multiple sequence alignments

Bellerophon is a program for detecting chimeric sequences in multiple sequence datasets by an adaption of partial treeing analysis. Bellerophon was specifically developed to detect 16S rRNA gene chimeras in PCR-clone libraries of environmental samples but can be applied to other nucleotide sequence alignments.

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.