983 resultados para BG
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The objective of the present work was to investigate the potential of cyanobacteria isolated from different environments in decolorizing eleven different types of textile dyes. For inoculum preparation 50 ml of BG-11 medium were used for the cyanobacteria Leptolyngbia CENA103, Leptolyngbia CENA104 and Phormidium autumnale UTEX1580 and 50 ml of SWBG-11 medium for Phormidium sp., Leptolyngbya sp. and Synecochoccus sp. Test tubes containing 10 ml of liquid medium and 0.02% of each dye (remazol, indigo blue, indanthrene blue RCL, drimaren blue CL-R, dispersol blue C-2R, drimaren red CL-5B, dispersol red C- 4G, indanthrene red FBB, drimaren yellow CL-R, palanil yellow 3G and indanthrene yellow 5GF) were inoculated with cyanobacteria. A spectrophotometer was used to verify the maximum absorbance of each dye and the percentage of decolorization and also thin layer chromatography (TLC). The results showed that all the tested cyanobacteria were capable to remove more than 50% of some dyes. The present study confirmed the capacity of cyanobacteria in decolorize and possibly degrade structurally different textile dyes, suggesting the possibility of their application in bioremediation studies. The data are promising, and will lead to further studies of dye degradation and its toxicicity.
Resumo:
Pós-graduação em Agronomia (Produção Vegetal) - FCAV
Resumo:
Pós-graduação em Medicina Veterinária - FCAV
Resumo:
In this paper we present matrices over unitary finite commutative local rings connected through an ascending chain of containments, whose elements are units of the corresponding rings in the chain such that the McCoy ranks are the largest ones.
Resumo:
A Goppa code is described in terms of a polynomial, known as Goppa polynomial, and in contrast to cyclic codes, where it is difficult to estimate the minimum Hamming distance d from the generator polynomial. Furthermore, a Goppa code has the property that d ≥ deg(h(X))+1, where h(X) is a Goppa polynomial. In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm.
Resumo:
Let G be a group, W a nonempty G-set and M a Z2G-module. Consider the restriction map resG W : H1(G,M) → Pi wi∈E H1(Gwi,M), [f] → (resGG wi [f])i∈I , where E = {wi, i ∈ I} is a set of orbit representatives in W and Gwi = {g ∈ G | gwi = wi} is the G-stabilizer subgroup (or isotropy subgroup) of wi, for each wi ∈ E. In this work we analyze some results presented in Andrade et al [5] about splittings and duality of groups, using the point of view of Dicks and Dunwoody [10] and the invariant E'(G,W) := 1+dimkerresG W, defined when Gwi is a subgroup of infinite index in G for all wi in E, andM = Z2 (where dim = dimZ2). We observe that the theory of splittings of groups (amalgamated free product and HNN-groups) is inserted in the combinatory theory of groups which has many applications in graph theory (see, for example, Serre [12] and Dicks and Dunwoody [10]).
Resumo:
In this work we present some considerations about cohomology of finite groups. In the first part we use the restriction map in cohomology to obtain some results about subgroups of finite index in a group. In the second part, we use Tate cohomology to present an application of the theory of groups with periodic cohomology in topology.
Resumo:
Based on the cohomology theory of groups, Andrade and Fanti defined in [1] an algebraic invariant, denoted by E(G,S, M), where G is a group, S is a family of subgroups of G with infinite index and M is a Z2G-module. In this work, by using the homology theory of groups instead of cohomology theory, we define an invariant ``dual'' to E(G, S, M), which we denote by E*(G, S, M). The purpose of this paper is, through the invariant E*(G, S, M), to obtain some results and applications in the theory of duality groups and group pairs, similar to those shown in Andrade and Fanti [2], and thus, providing an alternative way to get applications and properties of this theory.
Resumo:
In this paper we show that the quaternion orders OZ[ √ 2] ≃ ( √ 2, −1)Z[ √ 2] and OZ[ √ 3] ≃ (3 + 2√ 3, −1)Z[ √ 3], appearing in problems related to the coding theory [4], [3], are not maximal orders in the quaternion algebras AQ( √ 2) ≃ ( √ 2, −1)Q( √ 2) and AQ( √ 3) ≃ (3 + 2√ 3, −1)Q( √ 3), respectively. Furthermore, we identify the maximal orders containing these orders.
Resumo:
This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over binary Galois Field (ECC- GF(2m)). The purpose of our coprocessor is to accelerate the scalar multiplication performed over elliptic curve points represented by affine coordinates in polynomial basis. Our method consists of using elliptic curve parameters over GF(2163) in accordance with international security requirements to implement a bit-parallel coprocessor on field-programmable gate-array (FPGA). Our coprocessor performs modular inversion by using a process based on the Stein's algorithm. Results are presented and compared to results of other related works. We conclude that our coprocessor is suitable for comparing with any other ECC-hardware proposal, since its speed is comparable to projective coordinate designs.