The reconstruction of multitaxon trees from molecular sequences is confounded by the variety of algorithms and criteria used to evaluate trees, making it difficult to compare the results of different analyses. A global method of multitaxon phylogenetic reconstruction described here, Bootstrappers Gambit, can be used with any four-taxon algorithm, including distance, maximum likelihood, and pars...

We demonstrate an all-optical label and payload processor based on nonlinear optical processing with semiconductor optical amplifiers. The processor separates the label and the payload, and generates a synchronization pulse. Introduction All-optical label swapping (AOLS) is a technique that enables the implementation of ultra-fast packet routing and forwarding in IP-over-WDM networks [1]. In an...

Some applications of techniques borrowed from multiset theory to elaborate graphematical systems as ‘data’ structures with the operations of union, sum, difference and polycontextural dissemination of mixed data structures, like set, multiset, list, trito-, deuteroand protograms. The metaphor of ‘team’ observation for the study of multisets gets a polycontextural explication and application to ...

Incremental processing is a promising way to improve the performance of natural language generation systems. It imposes speci c requirements upon the linearization process and its underlying representation formalism. In this work, we will discuss these requirements and present an extension of the TAG{formalism that has been developed and utilized for the incremental syntactic generator VM{GEN i...

This paper presents experiments illustrating how formal language theory can shed light on deep learning. We train naive Long Short-Term Memory (LSTM) Recurrent Neural Networks (RNNs) on six formal languages drawn from the Strictly Local (SL) and Strictly Piecewise (SP) classes. These classes are relevant to computational linguistics and among the simplest in a mathematically well-understood hie...

Execution of a Procedure Let p c1; : : : ; cr be a procedure. The result Bout of the execution of p with in (where in is the input substitution of some abstract sequence B with hB; sei 2 Behp) is obtained by \concatenating" the results B1; : : : ; Br of the abstract execution of each clause. More precisely, Bout = CONC(B1; : : : ; Br), the last being a shortcut for CONC(: : :CONC(Br 1; Br) : : ...

In two experiments, we examined the impact of the degree of match between sequential auditory perceptual organization processes and the demands of a short-term memory task (memory for order vs item information). When a spoken sequence of digits was presented so as to promote its perceptual partitioning into two distinct streams by conveying it in alternating female (F) and male (M) voices (FMFM...