On simple Lie algebras over a field of characteristic 2

We prove that the simple Lie algebras constructed by G. Jurman (2004) in 121 are isomorphic to Hamiltonian algebras. As a corollary we answer all questions formulated in G. Jurman (2004) [2] about isomorphisms of these algebras. (C) 2012 Elsevier Inc. All rights reserved.

A new method for calculating the convergent point of a moving group

Context. Convergent point (CP) search methods are important tools for studying the kinematic properties of open clusters and young associations whose members share the same spatial motion. Aims. We present a new CP search strategy based on proper motion data. We test the new algorithm on synthetic data and compare it with previous versions of the CP search method. As an illustration and validation of the new method we also present an application to the Hyades open cluster and a comparison with independent results. Methods. The new algorithm rests on the idea of representing the stellar proper motions by great circles over the celestial sphere and visualizing their intersections as the CP of the moving group. The new strategy combines a maximum-likelihood analysis for simultaneously determining the CP and selecting the most likely group members and a minimization procedure that returns a refined CP position and its uncertainties. The method allows one to correct for internal motions within the group and takes into account that the stars in the group lie at different distances. Results. Based on Monte Carlo simulations, we find that the new CP search method in many cases returns a more precise solution than its previous versions. The new method is able to find and eliminate more field stars in the sample and is not biased towards distant stars. The CP solution for the Hyades open cluster is in excellent agreement with previous determinations.

Placentation in dolphins from the Amazon River Basin: the Boto, Inia geoffrensis, and the Tucuxi, Sotalia fluviatilis

A recent reassessment of the phylogenetic affinities of cetaceans makes it timely to compare their placentation with that of the artiodactyls. We studied the placentae of two sympatric species of dolphin from the Amazon River Basin, representing two distinct families. The umbilical cord branched to supply a bilobed allantoic sac. Small blood vessels and smooth muscle bundles were found within the stroma of the cord. Foci of squamous metaplasia occurred in the allanto-amnion and allantochorion. The interhemal membrane of the placenta was of the epitheliochorial type. Two different types of trophoblastic epithelium were seen. Most was of the simple columnar type and indented by fetal capillaries. However, there were also areolar regions with tall columnar trophoblast and these were more sparsely supplied with capillaries. The endometrium was well vascularised and richly supplied with actively secreting glands. These findings are consistent with the current view that Cetacea are nested within Artiodactyla as sister group to the hippopotamids.

The Brazilian Network for HIV-1 Genotyping External Quality Control Assurance Programme

The Brazilian network for genotyping is composed of 21 laboratories that perform and analyze genotyping tests for all HIV-infected patients within the public system, performing approximately 25,000 tests per year. We assessed the interlaboratory and intralaboratory reproducibility of genotyping systems by creating and implementing a local external quality control evaluation. Plasma samples from HIV-1-infected individuals (with low and intermediate viral loads) or RNA viral constructs with specific mutations were used. This evaluation included analyses of sensitivity and specificity of the tests based on qualitative and quantitative criteria, which scored laboratory performance on a 100-point system. Five evaluations were performed from 2003 to 2008, with 64% of laboratories scoring over 80 points in 2003, 81% doing so in 2005, 56% in 2006, 91% in 2007, and 90% in 2008 (Kruskal-Wallis, p = 0.003). Increased performance was aided by retraining laboratories that had specific deficiencies. The results emphasize the importance of investing in laboratory training and interpretation of DNA sequencing results, especially in developing countries where public (or scarce) resources are used to manage the AIDS epidemic.

Hunting practices among the Awá-Guajá: towards a long-term analysis of sustainability in an Amazonian indigenous community

Indigenous Reserves have played an indispensable role in maintaining forest areas in the Neotropics. In the Amazon there is a clear correlation between these reserves and the presence of forest cover; however, the simple presence of uninterrupted vegetation is no guarantee for the conservation of biodiversity, especially where hunting is practiced. This study describes hunting practices among the Awá-Guajá people from 1993 through 1994, also identifying sociocultural, technological, and demographic changes that have influenced their resource acquisition strategies over the last two decades. The data was obtained through ethnographic fieldwork, recording 78 days of foraging returns, with follow-up visits through 2010. This work provides useful information for an effective diachronic analysis of hunting in this community, by revealing foraging patterns of the early to mid-1990s, and describing community transformations over the last two decades in this locale.

CID: an efficient complexity-invariant distance for time series

The ubiquity of time series data across almost all human endeavors has produced a great interest in time series data mining in the last decade. While dozens of classification algorithms have been applied to time series, recent empirical evidence strongly suggests that simple nearest neighbor classification is exceptionally difficult to beat. The choice of distance measure used by the nearest neighbor algorithm is important, and depends on the invariances required by the domain. For example, motion capture data typically requires invariance to warping, and cardiology data requires invariance to the baseline (the mean value). Similarly, recent work suggests that for time series clustering, the choice of clustering algorithm is much less important than the choice of distance measure used.In this work we make a somewhat surprising claim. There is an invariance that the community seems to have missed, complexity invariance. Intuitively, the problem is that in many domains the different classes may have different complexities, and pairs of complex objects, even those which subjectively may seem very similar to the human eye, tend to be further apart under current distance measures than pairs of simple objects. This fact introduces errors in nearest neighbor classification, where some complex objects may be incorrectly assigned to a simpler class. Similarly, for clustering this effect can introduce errors by “suggesting” to the clustering algorithm that subjectively similar, but complex objects belong in a sparser and larger diameter cluster than is truly warranted.We introduce the first complexity-invariant distance measure for time series, and show that it generally produces significant improvements in classification and clustering accuracy. We further show that this improvement does not compromise efficiency, since we can lower bound the measure and use a modification of triangular inequality, thus making use of most existing indexing and data mining algorithms. We evaluate our ideas with the largest and most comprehensive set of time series mining experiments ever attempted in a single work, and show that complexity-invariant distance measures can produce improvements in classification and clustering in the vast majority of cases.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm