Optimal clone identifier based on dynamic rules and process algebra

The rule creation to clone selection in different projects is a hard task to perform by using traditional implementations to control all the processes of the system. The use of an algebraic language is an alternative approach to manage all of system flow in a flexible way. In order to increase the power of versatility and consistency in defining the rules for optimal clone selection, this paper presents the software OCI 2 in which uses process algebra in the flow behavior of the system. OCI 2, controlled by an algebraic approach was applied in the rules elaboration for clone selection containing unique genes in the partial genome of the bacterium Bradyrhizobium elkanii Semia 587 and in the whole genome of the bacterium Xanthomonas axonopodis pv. citri. Copyright© (2009) by the International Society for Research in Science and Technology.

Encoding through generalized polynomial codes

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

Classification of masses in mammographic image using wavelet domain features and polynomial classifier

Breast cancer is the most common cancer among women. In CAD systems, several studies have investigated the use of wavelet transform as a multiresolution analysis tool for texture analysis and could be interpreted as inputs to a classifier. In classification, polynomial classifier has been used due to the advantages of providing only one model for optimal separation of classes and to consider this as the solution of the problem. In this paper, a system is proposed for texture analysis and classification of lesions in mammographic images. Multiresolution analysis features were extracted from the region of interest of a given image. These features were computed based on three different wavelet functions, Daubechies 8, Symlet 8 and bi-orthogonal 3.7. For classification, we used the polynomial classification algorithm to define the mammogram images as normal or abnormal. We also made a comparison with other artificial intelligence algorithms (Decision Tree, SVM, K-NN). A Receiver Operating Characteristics (ROC) curve is used to evaluate the performance of the proposed system. Our system is evaluated using 360 digitized mammograms from DDSM database and the result shows that the algorithm has an area under the ROC curve Az of 0.98 ± 0.03. The performance of the polynomial classifier has proved to be better in comparison to other classification algorithms. © 2013 Elsevier Ltd. All rights reserved.

Perturbations on the antidiagonals of Hankel matrices

Given a strongly regular Hankel matrix, and its associated sequence of moments which defines a quasi-definite moment linear functional, we study the perturbation of a fixed moment, i.e., a perturbation of one antidiagonal of the Hankel matrix. We define a linear functional whose action results in such a perturbation and establish necessary and sufficient conditions in order to preserve the quasi-definite character. A relation between the corresponding sequences of orthogonal polynomials is obtained, as well as the asymptotic behavior of their zeros. We also study the invariance of the Laguerre-Hahn class of linear functionals under such perturbation, and determine its relation with the so-called canonical linear spectral transformations. © 2013 Elsevier Ltd. All rights reserved.

A produção de significados durante e processo de enisno-aprendizagem-avaliação de equações polinomiais

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

Analiticidade e efeito gráfico da dilatação em funções octoniônicos quaseconformes do tipo F(Z)=Zn

Pós-graduação em Matemática - IBILCE

Polinômios irredutíveis: critérios e aplicações

Pós-graduação em Matemática em Rede Nacional - IBILCE

Limit Cycles for a Class of Continuous and Discontinuous Cubic Polynomial Differential Systems

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

Darboux invariants for planar polynomial differential systems having an invariant conic

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

Pure Spinors in AdS and Lie Algebra Cohomology

We show that the BRST cohomology of the massless sector of the Type IIB superstring on AdS(5) x S (5) can be described as the relative cohomology of an infinite-dimensional Lie superalgebra. We explain how the vertex operators of ghost number 1, which correspond to conserved currents, are described in this language. We also give some algebraic description of the ghost number 2 vertices, which appears to be new. We use this algebraic description to clarify the structure of the zero mode sector of the ghost number two states in flat space, and initiate the study of the vertices of the higher ghost number.

Limit cycles of cubic polynomial differential systems with rational first integrals of degree 2

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

The boson-fermion correspondence from linear ODEs

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

VSR symmetries in the DKP algebra: The interplay between Dirac and Elko spinor fields

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

INTEGRAL FUNCTIONALS ON C*-ALGEBRA OF VECTOR-VALUED REGULATED FUNCTIONS

In this paper we deal with the notion of regulated functions with values in a C*-algebra A and present examples using a special bi-dimensional C*-algebra of triangular matrices. We consider the Dushnik integral for these functions and shows that a convenient choice of the integrator function produces an integral homomorphism on the C*-algebra of all regulated functions ([a, b], A). Finally we construct a family of linear integral functionals on this C*-algebra.

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.