Fractional polynomial response surface models

Second-order polynomial models have been used extensively to approximate the relationship between a response variable and several continuous factors. However, sometimes polynomial models do not adequately describe the important features of the response surface. This article describes the use of fractional polynomial models. It is shown how the models can be fitted, an appropriate model selected, and inference conducted. Polynomial and fractional polynomial models are fitted to two published datasets, illustrating that sometimes the fractional polynomial can give as good a fit to the data and much more plausible behavior between the design points than the polynomial model. © 2005 American Statistical Association and the International Biometric Society.

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.

Approximation of hyperbolic tangent activation function using hybrid methods

Artificial Neural Networks are widely used in various applications in engineering, as such solutions of nonlinear problems. The implementation of this technique in reconfigurable devices is a great challenge to researchers by several factors, such as floating point precision, nonlinear activation function, performance and area used in FPGA. The contribution of this work is the approximation of a nonlinear function used in ANN, the popular hyperbolic tangent activation function. The system architecture is composed of several scenarios that provide a tradeoff of performance, precision and area used in FPGA. The results are compared in different scenarios and with current literature on error analysis, area and system performance. © 2013 IEEE.

Método numérico-analítico generalizado para estimação do campo eletromagnético de linhas de transmissão de energia elétrica utilizando a teoria dos elementos finitos

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

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)

Monotonicity, interlacing and electrostatic interpretation of zeros of exceptional Jacobi polynomials

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

Darboux invariants for planar polynomial differential systems having an invariant conic

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

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)

A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction

The frequency spectrums are inefficiently utilized and cognitive radio has been proposed for full utilization of these spectrums. The central idea of cognitive radio is to allow the secondary user to use the spectrum concurrently with the primary user with the compulsion of minimum interference. However, designing a model with minimum interference is a challenging task. In this paper, a transmission model based on cyclic generalized polynomial codes discussed in [2] and [15], is proposed for the improvement in utilization of spectrum. The proposed model assures a non interference data transmission of the primary and secondary users. Furthermore, analytical results are presented to show that the proposed model utilizes spectrum more efficiently as compared to traditional models.

Normal Forms for Polynomial Differential Systems in R-3 Having an Invariant Quadric and a Darboux Invariant

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

Pareto Frontier for the time-energy cost vector to an Earth-Moon transfer orbit using the patched-conic approximation

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

Learning kernels for support vector machines with polynomial powers of sigmoid

In the pattern recognition research field, Support Vector Machines (SVM) have been an effectiveness tool for classification purposes, being successively employed in many applications. The SVM input data is transformed into a high dimensional space using some kernel functions where linear separation is more likely. However, there are some computational drawbacks associated to SVM. One of them is the computational burden required to find out the more adequate parameters for the kernel mapping considering each non-linearly separable input data space, which reflects the performance of SVM. This paper introduces the Polynomial Powers of Sigmoid for SVM kernel mapping, and it shows their advantages over well-known kernel functions using real and synthetic datasets.

A radial basis function network (RBFN) for function approximation

A radial basis function network (RBFN) circuit for function approximation is presented. Simulation and experimental results show that the network has good approximation capabilities. The RBFN was a squared hyperbolic secant with three adjustable parameters amplitude, width and center. To test the network a sinusoidal and sine function,vas approximated.

Comparative study between powers of sigmoid functions, MLP-backpropagation and polynomials in function approximation problems

Function approximation is a very important task in environments where the computation has to be based on extracting information from data samples in real world processes. So, the development of new mathematical model is a very important activity to guarantee the evolution of the function approximation area. In this sense, we will present the Polynomials Powers of Sigmoid (PPS) as a linear neural network. In this paper, we will introduce one series of practical results for the Polynomials Powers of Sigmoid, where we will show some advantages of the use of the powers of sigmiod functions in relationship the traditional MLP-Backpropagation and Polynomials in functions approximation problems.