Effects of pasture implantation on the termite (Isoptera) fauna in the Central Brazilian Savanna (Cerrado)

The advance of agricultural frontier may cause the Cerrado (Brazilian savanna) to disappear before 2030. This work focuses on measuring the impact of pasture implantation on a cerrado`s termite fauna. Termites were sampled in a cerrado sensu stricto and a pasture, originally cerrado. All species were classified as their feeder group, accumulation curves were made and Shannon-Wiener indexes and beta diversity were calculated for both areas. Cerrado was richer than pasture and species composition differed considerably, leading beta diversity to a high value. The humivorous was the most representative species, followed by grass/litter feeders, xylophagous and, less representative, the intermediates. There were more xylophagous and intermediates species on cerrado than in pasture; the grass/litter feeders were more abundant in pasture, but didn`t differed in number or species; and humivorous didn`t differed neither in richness nor in abundance. This work shows that the simplification of the habitat is indeed causing the extinction of populations that depend on some specifics resource.

Unitary R-matrices for topological quantum computing

The main problem with current approaches to quantum computing is the difficulty of establishing and maintaining entanglement. A Topological Quantum Computer (TQC) aims to overcome this by using different physical processes that are topological in nature and which are less susceptible to disturbance by the environment. In a (2+1)-dimensional system, pseudoparticles called anyons have statistics that fall somewhere between bosons and fermions. The exchange of two anyons, an effect called braiding from knot theory, can occur in two different ways. The quantum states corresponding to the two elementary braids constitute a two-state system allowing the definition of a computational basis. Quantum gates can be built up from patterns of braids and for quantum computing it is essential that the operator describing the braiding-the R-matrix-be described by a unitary operator. The physics of anyonic systems is governed by quantum groups, in particular the quasi-triangular Hopf algebras obtained from finite groups by the application of the Drinfeld quantum double construction. Their representation theory has been described in detail by Gould and Tsohantjis, and in this review article we relate the work of Gould to TQC schemes, particularly that of Kauffman.

Quantum dynamics of an atomic Bose-Einstein condensate in a double-well potential

We consider the quantum dynamics of a neutral atom Bose-Einstein condensate in a double-well potential, including many-body hard-sphere interactions. Using a mean-field factorization we show that the coherent oscillations due to tunneling are suppressed when the number of atoms exceeds a critical value. An exact quantum solution, in a two-mode approximation, shows that the mean-field solution is modulated by a quantum collapse and revival sequence.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.

Evaluation of Adult Chronic Chagas` Heart Disease Diagnosis by Molecular and Serological Methods

Chagas` disease caused by Trypanosoma cruzi is endemic in Latin America. T. cruzi presents heterogeneous populations and comprises two main genetic lineages, named T. cruzi I and T. cruzi II. Diagnosis in the chronic phase is based on conventional serological tests, including indirect immunofluorescence (IIF) and enzyme-linked immunosorbent assay (ELISA), and diagnosis in the acute phase based on parasitological methods, including hemoculture. The objective of this study was to evaluate the diagnostic procedures of Chagas` disease in adult patients in the chronic phase by using a PCR assay and conventional serological tests, including TESA-blot as the gold standard. Samples were obtained from 240 clinical chronic chagasic patients. The sensitivities, compared to that of TESA-blot, were 70% for PCR using the kinetoplast region, 75% for PCR using the nuclear repetitive region, 99% for IIF, and 95% for ELISA. According to the serological tests results, we recommend that researchers assess the reliability and sensitivity of the commercial kit Chagatest ELISA recombinant, version 3.0 (Chagatest Rec v3.0; Wiener Lab, Rosario, Argentina), due to the lack of sensitivity. Based on our analysis, we concluded that PCR cannot be validated as a conventional diagnostic technique for Chagas` disease. These data have been corroborated by low levels of concordance with serology test results. It is recommended that PCR be used only for alternative diagnostic support. Using the nuclear repetitive region of T. cruzi, PCR could also be applicable for monitoring patients receiving etiologic treatment.

The composite Euler method for stiff stochastic differential equations

In this paper we present the composite Euler method for the strong solution of stochastic differential equations driven by d-dimensional Wiener processes. This method is a combination of the semi-implicit Euler method and the implicit Euler method. At each step either the semi-implicit Euler method or the implicit Euler method is used in order to obtain better stability properties. We give criteria for selecting the semi-implicit Euler method or the implicit Euler method. For the linear test equation, the convergence properties of the composite Euler method depend on the criteria for selecting the methods. Numerical results suggest that the convergence properties of the composite Euler method applied to nonlinear SDEs is the same as those applied to linear equations. The stability properties of the composite Euler method are shown to be far superior to those of the Euler methods, and numerical results show that the composite Euler method is a very promising method. (C) 2001 Elsevier Science B.V. All rights reserved.

Star factorizations of graph products

A k-star is the graph K-1,K-k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (K-q)(S) of a complete graph with prime power order q, products C-r1 x C-r2 x ... x C-rk of k cycles of arbitrary lengths, and any power (C-r)(S) of a cycle of arbitrary length. (C) 2001 John Wiley & Sons, Inc.

Cystic fibrosis and CFTR

Cystic fibrosis (CF) is a complex disease affecting epithelial ion transport. There are not many diseases like CF that have triggered such intense research activities. The complexity of the disease is due to mutations in the CFTR protein, now known to be a Cl- channel and a regulator of other transport proteins. The various interactions and the large number of disease-causing CFTR mutations is the reason for a variable genotype-phenotype correlation and sometimes unpredictable clinical manifestation. Nevertheless, the research of the past 10 years has resulted in a tremendous increase in knowledge, not only in regard to CFTR but also in regard to molecular interactions and completely new means of ion channel and gene therapy.

Factorizations of and by powers of complete graphs

Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary and sufficient conditions for the existence of a K-k(r)-factorization of K-pn(s), where p is prime and k > 1, n, r and s are positive integers. (C) 2002 Elsevier Science B.V. All rights reserved.

Um novo gerador central de padrões de locomoção para geração de trajectórias em tempo real de robôs quadrúpedes

Neste trabalho estuda-se a geração de trajectórias em tempo real de um robô quadrúpede. As trajectórias podem dividir-se em duas componentes: rítmica e discreta. A componente rítmica das trajectórias é modelada por uma rede de oito osciladores acoplados, com simetria 4 2 Z  Z . Cada oscilador é modelado matematicamente por um sistema de Equações Diferenciais Ordinárias. A referida rede foi proposta por Golubitsky, Stewart, Buono e Collins (1999, 2000), para gerar os passos locomotores de animais quadrúpedes. O trabalho constitui a primeira aplicação desta rede à geração de trajectórias de robôs quadrúpedes. A derivação deste modelo baseia-se na biologia, onde se crê que Geradores Centrais de Padrões de locomoção (CPGs), constituídos por redes neuronais, geram os ritmos associados aos passos locomotores dos animais. O modelo proposto gera soluções periódicas identificadas com os padrões locomotores quadrúpedes, como o andar, o saltar, o galopar, entre outros. A componente discreta das trajectórias dos robôs usa-se para ajustar a parte rítmica das trajectórias. Este tipo de abordagem é útil no controlo da locomoção em terrenos irregulares, em locomoção guiada (por exemplo, mover as pernas enquanto desempenha tarefas discretas para colocar as pernas em localizações específicas) e em percussão. Simulou-se numericamente o modelo de CPG usando o oscilador de Hopf para modelar a parte rítmica do movimento e um modelo inspirado no modelo VITE para modelar a parte discreta do movimento. Variou-se o parâmetro g e mediram-se a amplitude e a frequência das soluções periódicas identificadas com o passo locomotor quadrúpede Trot, para variação deste parâmetro. A parte discreta foi inserida na parte rítmica de duas formas distintas: (a) como um offset, (b) somada às equações que geram a parte rítmica. Os resultados obtidos para o caso (a), revelam que a amplitude e a frequência se mantêm constantes em função de g. Os resultados obtidos para o caso (b) revelam que a amplitude e a frequência aumentam até um determinado valor de g e depois diminuem à medida que o g aumenta, numa curva quase sinusoidal. A variação da amplitude das soluções periódicas traduz-se numa variação directamente proporcional na extensão do movimento do robô. A velocidade da locomoção do robô varia com a frequência das soluções periódicas, que são identificadas com passos locomotores quadrúpedes.

Robôs quadrúpedes: geração de trajectórias em tempo real usando sistemas dinâmicos não-lineares

A geração de trajectórias de robôs em tempo real é uma tarefa muito complexa, não existindo ainda um algoritmo que a permita resolver de forma eficaz. De facto, há controladores eficientes para trajectórias previamente definidas, todavia, a adaptação a variações imprevisíveis, como sendo terrenos irregulares ou obstáculos, constitui ainda um problema em aberto na geração de trajectórias em tempo real de robôs. Neste trabalho apresentam-se modelos de geradores centrais de padrões de locomoção (CPGs), inspirados na biologia, que geram os ritmos locomotores num robô quadrúpede. Os CPGs são modelados matematicamente por sistemas acoplados de células (ou neurónios), sendo a dinâmica de cada célula dada por um sistema de equações diferenciais ordinárias não lineares. Assume-se que as trajectórias dos robôs são constituídas por esta parte rítmica e por uma parte discreta. A parte discreta pode ser embebida na parte rítmica, (a.1) como um offset ou (a.2) adicionada às expressões rítmicas, ou (b) pode ser calculada independentemente e adicionada exactamente antes do envio dos sinais para as articulações do robô. A parte discreta permite inserir no passo locomotor uma perturbação, que poderá estar associada à locomoção em terrenos irregulares ou à existência de obstáculos na trajectória do robô. Para se proceder á análise do sistema com parte discreta, será variado o parâmetro g. O parâmetro g, presente nas equações da parte discreta, representa o offset do sinal após a inclusão da parte discreta. Revê-se a teoria de bifurcação e simetria que permite a classificação das soluções periódicas produzidas pelos modelos de CPGs com passos locomotores quadrúpedes. Nas simulações numéricas, usam-se as equações de Morris-Lecar e o oscilador de Hopf como modelos da dinâmica interna de cada célula para a parte rítmica. A parte discreta é modelada por um sistema inspirado no modelo VITE. Medem-se a amplitude e a frequência de dois passos locomotores para variação do parâmetro g, no intervalo [-5;5]. Consideram-se duas formas distintas de incluir a parte discreta na parte rítmica: (a) como um (a.1) offset ou (a.2) somada nas expressões que modelam a parte rítmica, e (b) somada ao sinal da parte rítmica antes de ser enviado às articulações do robô. No caso (a.1), considerando o oscilador de Hopf como dinâmica interna das células, verifica-se que a amplitude e frequência se mantêm constantes para -50.2. A extensão do movimento varia de forma directamente proporcional à amplitude. No caso das equações de Morris-Lecar, quando a componente discreta é embebida (a.2), a amplitude e a frequência aumentam e depois diminuem para - 0.170.5 Pode concluir-se que: (1) a melhor forma de inserção da parte discreta que menos perturbação insere no robô é a inserção como offset; (2) a inserção da parte discreta parece ser independente do sistema de equações diferenciais ordinárias que modelam a dinâmica interna de cada célula. Como trabalho futuro, é importante prosseguir o estudo das diferentes formas de inserção da parte discreta na parte rítmica do movimento, para que se possa gerar uma locomoção quadrúpede, robusta, flexível, com objectivos, em terrenos irregulares, modelada por correcções discretas aos padrões rítmicos.

Spectral and weak polynomial completeness for the porduct of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F , satisfying the following property: for every monic polynomial f(x) = xn + an-1xn-1 + … +a1x + aο over F, with a root in F and aο = (-1)n det(AB), there are nonsingular matrices X, Y ϵ Fnxn such that X A X-1 Y BY-1 has characteristic polynomial f (x). © 2014 © 2014 Taylor & Francis.

Hyperspectral unmixing based on mixtures of Dirichlet components

This paper introduces a new unsupervised hyperspectral unmixing method conceived to linear but highly mixed hyperspectral data sets, in which the simplex of minimum volume, usually estimated by the purely geometrically based algorithms, is far way from the true simplex associated with the endmembers. The proposed method, an extension of our previous studies, resorts to the statistical framework. The abundance fraction prior is a mixture of Dirichlet densities, thus automatically enforcing the constraints on the abundance fractions imposed by the acquisition process, namely, nonnegativity and sum-to-one. A cyclic minimization algorithm is developed where the following are observed: 1) The number of Dirichlet modes is inferred based on the minimum description length principle; 2) a generalized expectation maximization algorithm is derived to infer the model parameters; and 3) a sequence of augmented Lagrangian-based optimizations is used to compute the signatures of the endmembers. Experiments on simulated and real data are presented to show the effectiveness of the proposed algorithm in unmixing problems beyond the reach of the geometrically based state-of-the-art competitors.

Exciting dynamical behavior in a network of two coupled rings of Chen oscillators

We study exotic patterns appearing in a network of coupled Chen oscillators. Namely, we consider a network of two rings coupled through a “buffer” cell, with Z3×Z5 symmetry group. Numerical simulations of the network reveal steady states, rotating waves in one ring and quasiperiodic behavior in the other, and chaotic states in the two rings, to name a few. The different patterns seem to arise through a sequence of Hopf bifurcations, period-doubling, and halving-period bifurcations. The network architecture seems to explain certain observed features, such as equilibria and the rotating waves, whereas the properties of the chaotic oscillator may explain others, such as the quasiperiodic and chaotic states. We use XPPAUT and MATLAB to compute numerically the relevant states.

Spectral and weak polynomial completeness for the product of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F, satisfying the following property: for every monic polynomial f (x) = x(n) + a(n-1)x(n-1) +... + a(1)x + a(0) over F, with a root in F and a(0) = (-1)(n) det(AB), there are nonsingular matrices X, Y is an element of F-nxn such that XAX(-1)Y BY-1 has characteristic polynomial f (x).