Cold Code: The global initiative to DNA barcode amphibians and nonavian reptiles

DNA barcoding facilitates the identification of species and the estimation of biodiversity by using nucleotide sequences, usually from the mitochondrial genome. Most studies accomplish this task by using the gene encoding cytochrome oxidase subunit I (COI; Entrez COX1). Within this barcoding framework, many taxonomic initiatives exist, such as those specializing in fishes, birds, mammals, and fungi. Other efforts center on regions, such as the Arctic, or on other topics, such as health. DNA barcoding initiatives exist for all groups of vertebrates except for amphibians and nonavian reptiles. We announce the formation of Cold Code, the international initiative to DNA barcode all species of these 'cold-blooded' vertebrates. The project has a Steering Committee, Coordinators, and a home page. To facilitate Cold Code, the Kunming Institute of Zoology, Chinese Academy of Sciences will sequence COI for the first 10 specimens of a species at no cost to the steward of the tissues. © 2012 Blackwell Publishing Ltd.

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Socialização linguageira, aspectos culturais e uso de code-switching em uma criança bilíngue

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Desempenho operacional e energético, segundo a norma OECD – code 2 de dois tratores agrícolas 4x2 TDA com motores de 132 kw em pista concreto e solo agrícola

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

MODEL-BASED COMPENSATION FOR BURST MESSAGE LOSS IN WIRELESS NETWORKED CONTROL SYSTEMS: EXPERIMENTAL RESULTS

A recent trend in networked control systems (NCSs) is the use of wireless networks enabling interoperability between existing wired and wireless systems. One of the major challenges in these wireless NCSs (WNCSs) is to overcome the impact of the message loss that degrades the performance and stability of these systems. Moreover, this impact is greater when dealing with burst or successive message losses. This paper discusses and presents the experimental results of a compensation strategy to deal with this burst message loss problem in which a NCS mathematical model runs in parallel with the physical process, providing sensor virtual data in case of packet losses. Running in real-time inside the controller, the mathematical model is updated online with real control signals sent to the actuator, which provides better reliability for the estimated sensor feedback (virtual data) transmitted to the controller each time a message loss occurs. In order to verify the advantages of applying this model-based compensation strategy for burst message losses in WNCSs, the control performance of a motor control system using CAN and ZigBee networks is analyzed. Experimental results led to the conclusion that the developed compensation strategy provided robustness and could maintain the control performance of the WNCS against different message loss scenarios.

As relações públicas na ambiência da comunicação móvel digital: o QR code como estratégia de comunicação

The internet as well as all technologies arising from it are transforming and changing socially and economically, the forms of relationships between people and organizations. The environment of digital mobile communication is on the rise, allowing more communication strategies in public relations to be enhanced, in order to allow effective dialogue, relationship and interaction between organizations and their stakeholders. Accordingly, the purpose of this paper is to analyze digital communications, especially a locative media tool that has been gaining ground in communication activities: Quick Response Code. So in addition to conceptualize and contextualize it, one tried to map out various campaigns, both national and international, who made use of the QR Code, highlighting the strategic role that this tool can have in Integrated PR planning, in order to create visibility and to establish effective and lasting relationships with the brand / organization

A BCH code and a sequence of cyclic codes

This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.

A decoding procedure which improves code rate and error corrections

Corresponding to $C_{0}[n,n-r]$, a binary cyclic code generated by a primitive irreducible polynomial $p(X)\in \mathbb{F}_{2}[X]$ of degree $r=2b$, where $b\in \mathbb{Z}^{+}$, we can constitute a binary cyclic code $C[(n+1)^{3^{k}}-1,(n+1)^{3^{k}}-1-3^{k}r]$, which is generated by primitive irreducible generalized polynomial $p(X^{\frac{1}{3^{k}}})\in \mathbb{F}_{2}[X;\frac{1}{3^{k}}\mathbb{Z}_{0}]$ with degree $3^{k}r$, where $k\in \mathbb{Z}^{+}$. This new code $C$ improves the code rate and has error corrections capability higher than $C_{0}$. The purpose of this study is to establish a decoding procedure for $C_{0}$ by using $C$ in such a way that one can obtain an improved code rate and error-correcting capabilities for $C_{0}$.

Referência e code-switching: traços de singularidade na linguagem de uma criança bilíngue

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A formalized optimum code search for q-ary trellis codes

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)