Neodrassex, a new genus of the Leptodrassex group (Araneae, Gnaphosidae) from South America

The new genus Neodrassex is proposed to include two new species of Gnaphosidae from Brazil. Neodrassex aureus sp. nov. is described from Amazonas, Paraná and Rio Grande do Sul states, and N. iguatemi sp. nov. is described from Paraná state. Neodrassex gen. nov. is characterized by small size, pale coloration, large anterior median eyes surrounded by black pigmentation, absence of a dorsal abdominal scutum in males and by the cheliceral dentition with 2-3 teeth on the promargin and 2-4 on the retromargin. The new genus is tentatively placed at the Leptodrassex group.

Genus-group names of bees and supplemental family-group names / by Charles D. Michener.

no.1

The unbounded dead-end depth propertie is not a group invariant

Vegeu el resum a l'inici del document del fitxer adjunt

Examples of retracts in a free group that are not the fixed subgroup of any group of automorphisms

Let F be a free group of rank at least three. We show that some retracts of F previously studied by Martino-Ventura are not equal to the fixed subgroup of any group of automorphisms of F. This shows that, in F, there exist subgroups that are equal to the fixed subgroup of some set of endomorphisms but are not equal to the fixed subgroup of any set of automorphisms. Moreover, we determine the Galois monoids of these retracts, where, by the Galois monoid of a subgroup H of F, we mean the monoid consisting of all endomorphisms of F that fix H.

The automorphism group of a free-by-cyclic group in rank 2

Vegeu el resum a l'inici del document del fitxer adjunt

An illustrated flora of the northern United States, Canada and the British possessions, from Newfoundland to the parallel of the southern boundary of Virginia, and from the Atlantic Ocean westward to the 102d meridian, by Nathaniel Lord Britton and Addison Brown. The descriptive text chiefly prepared by Britton, with the assistance of specialists in several groups; the figures also drawn under his supervision.

2

Growth of positive words and lower bounds of the growth rate for Thompson's group (F)p

Vegeu el resum a l'inici del document del fitxer adjunt.

Computational explorations in Thompson's group F

Here we describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult question whether or not Thompson's group is amenable. We also describe experiments to estimate the exponential growth rate of F and the rate of escape of symmetric random walks with respect to the standard generating set.

Combinatorial and metric properties of Thompson's group T

We discuss metric and combinatorial properties of Thompson's group T, such as the normal forms for elements and uniqueness of tree pair diagrams. We relate these properties to those of Thompson's group F when possible, and highlight combinatorial differences between the two groups. We define a set of unique normal forms for elements of T arising from minimal factorizations of elements into convenient pieces. We show that the number of carets in a reduced representative of T estimates the word length, that F is undistorted in T, and that cyclic subgroups of T are undistorted. We show that every element of T has a power which is conjugate to an element of F and describe how to recognize torsion elements in T.

An illustrated flora of the northern United States, Canada and the British possessions, from Newfoundland to the parallel of the southern boundary of Virginia, and from the Atlantic Ocean westward to the 102d meridian, by Nathaniel Lord Britton and Addison Brown. The descriptive text chiefly prepared by Britton, with the assistance of specialists in several groups; the figures also drawn under his supervision.

3

User-friendly parallel computations with econometric examples

This paper shows how a high level matrix programming language may be used to perform Monte Carlo simulation, bootstrapping, estimation by maximum likelihood and GMM, and kernel regression in parallel on symmetric multiprocessor computers or clusters of workstations. The implementation of parallelization is done in a way such that an investigator may use the programs without any knowledge of parallel programming. A bootable CD that allows rapid creation of a cluster for parallel computing is introduced. Examples show that parallelization can lead to important reductions in computational time. Detailed discussion of how the Monte Carlo problem was parallelized is included as an example for learning to write parallel programs for Octave.

ParallelKnoppix - Rapid deployment of a linux cluster for MPI parallel processing using non-dedicated computers

This note describes ParallelKnoppix, a bootable CD that allows creation of a Linux cluster in very little time. An experienced user can create a cluster ready to execute MPI programs in less than 10 minutes. The computers used may be heterogeneous machines, of the IA-32 architecture. When the cluster is shut down, all machines except one are in their original state, and the last can be returned to its original state by deleting a directory. The system thus provides a means of using non-dedicated computers to create a cluster. An example session is documented.