979 resultados para Escore quadrático de probabilidade
Resumo:
Dados de 79.884 animais da raça Nelore foram utilizados para estimar parâmetros genéticos e avaliar as relações entre os escores de conformação, precocidade e musculatura obtidos à desmama e ao sobreano e o peso das fêmeas à idade adulta. Utilizou-se o método da máxima verossimilhança restrita, em análise multicaracterísticas, com modelo que incluiu os efeitos genéticos aditivos direto e residual, como aleatórios, e os efeitos fixos de grupo de contemporâneos e, como covariáveis, a idade do animal à pesagem e a idade da mãe ao parto (exceto para o peso das fêmeas à idade adulta). Os grupos contemporâneos à desmama foram definidos pelas variáveis: sexo, rebanho, ano e mês de nascimento, grupo de manejo ao nascimento e à desmama. Na definição de grupo contemporâneo ao sobreano também foi incluída a variável grupo de manejo ao sobreano. Para o peso das fêmeas à idade adulta, o grupo de contemporâneos foi composto por rebanho, ano de nascimento, grupo de manejo ao sobreano, ano e estação da pesagem. Os efeitos genético materno e de ambiente permanente materno também foram incluídos no modelo para análise dos escores de conformação, precocidade e musculatura à desmama. As estimativas de herdabilidade direta obtidas foram 0,18 ± 0,02 para o escore de conformação; 0,21 ± 0,01 para o escore de precocidade; 0,22 ± 0,01 para o escore de musculatura à desmama e 0,24 ± 0,01 para o escore de conformação; 0,27 ± 0,01 para o escore de precocidade; e 0,26 ± 0,01 para o escore de musculatura ao sobreano e 0,42 ± 0,02 para o peso das fêmeas à idade adulta. As correlações genéticas estimadas entre os escores visuais medidos à desmama e ao sobreano foram positivas, variando de média a alta magnitude (0,56 ± 0,03 a 0,85 ± 0,01). Por outro lado, as correlações genéticas estimadas entre os escores visuais e o peso das fêmeas à idade adulta foram positivas e moderadas, variando de 0,21 ± 0,03 a 0,35 ± 0,03. Os resultados obtidos indicam que a seleção de animais com maiores escores visuais, principalmente ao sobreano, deve promover aumento do peso das fêmeas à idade adulta.
Resumo:
In last decades, neural networks have been established as a major tool for the identification of nonlinear systems. Among the various types of networks used in identification, one that can be highlighted is the wavelet neural network (WNN). This network combines the characteristics of wavelet multiresolution theory with learning ability and generalization of neural networks usually, providing more accurate models than those ones obtained by traditional networks. An extension of WNN networks is to combine the neuro-fuzzy ANFIS (Adaptive Network Based Fuzzy Inference System) structure with wavelets, leading to generate the Fuzzy Wavelet Neural Network - FWNN structure. This network is very similar to ANFIS networks, with the difference that traditional polynomials present in consequent of this network are replaced by WNN networks. This paper proposes the identification of nonlinear dynamical systems from a network FWNN modified. In the proposed structure, functions only wavelets are used in the consequent. Thus, it is possible to obtain a simplification of the structure, reducing the number of adjustable parameters of the network. To evaluate the performance of network FWNN with this modification, an analysis of network performance is made, verifying advantages, disadvantages and cost effectiveness when compared to other existing FWNN structures in literature. The evaluations are carried out via the identification of two simulated systems traditionally found in the literature and a real nonlinear system, consisting of a nonlinear multi section tank. Finally, the network is used to infer values of temperature and humidity inside of a neonatal incubator. The execution of such analyzes is based on various criteria, like: mean squared error, number of training epochs, number of adjustable parameters, the variation of the mean square error, among others. The results found show the generalization ability of the modified structure, despite the simplification performed
Resumo:
This master dissertation introduces a study about some aspects that determine the aplication of adaptative arrays in DS-CDMA cellular systems. Some basics concepts and your evolution in the time about celular systems was detailed here, meanly the CDMA tecnique, specialy about spread-codes and funtionaly principies. Since this, the mobile radio enviroment, with your own caracteristcs, and the basics concepts about adaptive arrays, as powerfull spacial filter was aborded. Some adaptative algorithms was introduced too, these are integrants of the signals processing, and are answerable for weights update that influency directly in the radiation pattern of array. This study is based in a numerical analysis of adaptative array system behaviors related to the used antenna and array geometry types. All the simulations was done by Mathematica 4.0 software. The results for weights convergency, square mean error, gain, array pattern and supression capacity based the analisis made here, using RLS (supervisioned) and LSDRMTA (blind) algorithms
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Resumo:
In this work we present a new clustering method that groups up points of a data set in classes. The method is based in a algorithm to link auxiliary clusters that are obtained using traditional vector quantization techniques. It is described some approaches during the development of the work that are based in measures of distances or dissimilarities (divergence) between the auxiliary clusters. This new method uses only two a priori information, the number of auxiliary clusters Na and a threshold distance dt that will be used to decide about the linkage or not of the auxiliary clusters. The number os classes could be automatically found by the method, that do it based in the chosen threshold distance dt, or it is given as additional information to help in the choice of the correct threshold. Some analysis are made and the results are compared with traditional clustering methods. In this work different dissimilarities metrics are analyzed and a new one is proposed based on the concept of negentropy. Besides grouping points of a set in classes, it is proposed a method to statistical modeling the classes aiming to obtain a expression to the probability of a point to belong to one of the classes. Experiments with several values of Na e dt are made in tests sets and the results are analyzed aiming to study the robustness of the method and to consider heuristics to the choice of the correct threshold. During this work it is explored the aspects of information theory applied to the calculation of the divergences. It will be explored specifically the different measures of information and divergence using the Rényi entropy. The results using the different metrics are compared and commented. The work also has appendix where are exposed real applications using the proposed method
Resumo:
ln this work the implementation of the SOM (Self Organizing Maps) algorithm or Kohonen neural network is presented in the form of hierarchical structures, applied to the compression of images. The main objective of this approach is to develop an Hierarchical SOM algorithm with static structure and another one with dynamic structure to generate codebooks (books of codes) in the process of the image Vector Quantization (VQ), reducing the time of processing and obtaining a good rate of compression of images with a minimum degradation of the quality in relation to the original image. Both self-organizing neural networks developed here, were denominated HSOM, for static case, and DHSOM, for the dynamic case. ln the first form, the hierarchical structure is previously defined and in the later this structure grows in an automatic way in agreement with heuristic rules that explore the data of the training group without use of external parameters. For the network, the heuristic mIes determine the dynamics of growth, the pruning of ramifications criteria, the flexibility and the size of children maps. The LBO (Linde-Buzo-Oray) algorithm or K-means, one ofthe more used algorithms to develop codebook for Vector Quantization, was used together with the algorithm of Kohonen in its basic form, that is, not hierarchical, as a reference to compare the performance of the algorithms here proposed. A performance analysis between the two hierarchical structures is also accomplished in this work. The efficiency of the proposed processing is verified by the reduction in the complexity computational compared to the traditional algorithms, as well as, through the quantitative analysis of the images reconstructed in function of the parameters: (PSNR) peak signal-to-noise ratio and (MSE) medium squared error
Resumo:
Com o propósito de avaliar a colhedora Penha CLM-350, visando fornecer subsídios aos projetos e usuários, realizou-se o presente trabalho, onde foi estudada a eficácia do sistema espigador, determinando-se a porcentagem de milho colhido para os diversos tratamentos estudados. Definiu-se um parâmetro adimensional U, que é a relação entre a velocidade periférica dos roletes e a velocidade de deslocamento da colhedora. Procurou-se relacionar as diversos tratamentos U, com os valores percentuais de grãos de milho colhidos e perdidos no solo. Os resultados foram estudados através da análise de variância, empregando-se o teste F, aos níveis de 1% e 5% de probabilidade e o teste Tukey para a comparação estatística entre as médias.
Resumo:
Pesquisas visando a redução de perdas de grãos e sementes durante o armazenamento têm ocupado destaque em vários países. Dentro deste contexto, a avaliação da eficácia de um índice de qualidade de boa aplicabilidade, com metodologia simples e de resposta imediata visando tomadas rápidas de decisão é de suma importância. O presente trabalho, conduzido no Laboratório de Processamento de Produtos Agrícolas UNESP, Botucatu/SP teve como objetivos: (a) estabelecer correspondência entre o nível de ácidos graxos livres e as classes de vigor em sementes; (b) estabelecer correspondência entre o nível de ácidos graxos livres e a classificação comercial por tipos, em grãos de arroz (Oryza sativa L.). A correspondência entre o nível de ácidos livres e as classes de vigor em sementes foi avaliada utilizando-se sementes envelhecidas artificialmente, obtendo-se assim níveis diferenciados de vigor. A correspondência entre o nível de ácidos graxos livres e a classificação por tipos, em grãos de arroz, foi realizada utilizando-se amostras de arroz com as porcentagens máximas de grãos defeituosos permitidos pela legislação vigente. Utilizou-se a análise de variância de um delineamento inteiramente ao acaso e, para comparação entre médias, aplicou-se o teste de Tukey ao nível de 5% de probabilidade. Por meio dos resultados obtidos, observou-se que o teste de acidez graxa mostrou-se exeqüível para avaliar o vigor de sementes de arroz. Na pesquisa que buscava uma correspondência entre os valores de acidez graxa e classificação comercial, os dados revelaram a tendência do nível de ácidos graxos livres acompanhar a classificação comercial por tipos.
Resumo:
Foi avaliado o consumo energético das operações mecanizadas envolvidas na produção de silagem de planta inteira e silagem de grão úmido de milho, tendo como referência o processamento seco desse cereal. O ensaio foi conduzido na Fazenda Experimental Lageado, pertencente à Faculdade de Ciências Agronômicas, e nas instalações da Faculdade de Medicina Veterinária e Zootecnia - UNESP, localizada no município de Botucatu - SP. O delineamento experimental foi em blocos ao acaso, com parcelas subdivididas no tempo (três épocas de colheita: silagem de planta inteira, silagem de grão úmido e colheita de grãos secos), com 10 repetições. As análises estatísticas foram realizadas por meio do programa ESTAT, pelo teste de média de Tukey, a 5% de probabilidade. A silagem de planta inteira teve o maior consumo de combustível por área. A secagem dos grãos de 15,5% para 13% foi responsável por 87% do gasto de energia por área. A silagem de grão úmido demandou o menor uso de energia por área nas operações mecanizadas.
Resumo:
In this work, a performance analysis of transmission schemes employing turbo trellis coded modulation. In general, the performance analysis of such schemes is guided by evaluating the error probability of these schemes. The exact evaluation of this probability is very complex and inefficient from the computational point of view, a widely used alternative is the use of union bound of error probability, because of its easy implementation and computational produce bounds that converge quickly. Since it is the union bound, it should use to expurge some elements of distance spectrum to obtain a tight bound. The main contribution of this work is that the listing proposal is carried out from the puncturing at the level of symbol rather than bit-level as in most works of literature. The main reason for using the symbol level puncturing lies in the fact that the enummerating function of the turbo scheme is obtained directly from complex sequences of signals through the trellis and not indirectly from the binary sequences that require further binary to complex mapping, as proposed by previous works. Thus, algorithms can be applied through matrix from the adjacency matrix, which is obtained by calculating the distances of the complex sequences of the trellis. This work also presents two matrix algorithms for state reduction and the evaluation of the transfer function of this. The results presented in comparisons of the bounds obtained using the proposed technique with some turbo codes of the literature corroborate the proposition of this paper that the expurgated bounds obtained are quite tight and matrix algorithms are easily implemented in any programming software language
Resumo:
This dissertation describes the implementation of a WirelessHART networks simulation module for the Network Simulator 3, aiming for the acceptance of both on the present context of networks research and industry. For validating the module were imeplemented tests for attenuation, packet error rate, information transfer success rate and battery duration per station
Resumo:
O trabalho teve como objetivo verificar a influência da adubação orgânica em 6 épocas de crescimento na produção de β-ecdisona por plantas de Pfaffia glomerata. O experimento foi conduzido na Fazenda Santo Antonio do Araquá, distrito de Catâneo Ângelo, município de São Manuel, São Paulo, Brasil. Utilizou-se o delineamento de blocos ao acaso, num esquema fatorial 5x6, com quatro repetições, considerando-se 8 plantas úteis por parcela. Os blocos foram constituídos de 6 épocas de crescimento (60, 120, 180, 240, 300 e 360 dias após a germinação) e de 5 doses de esterco de galinha curtido [testemunha (sem adubação), 15, 30, 45 e 60 t ha-1]. Após cada colheita, as raízes das plantas foram secas em estufa com circulação de ar forçada a 40ºC e pesadas para posterior extração do β-ecdisona, seguindo metodologia desenvolvida por Magalhães (2000). Os resultados foram submetidos à análise de variância e ao teste de separação de médias de Scott Knott, todos a 5% de probabilidade. Quando ocorreu interação os resultados foram avaliados usando-se análise de regressão polinominal. O teor de β-ecdisona não foi influenciado pelas doses de adubo e nem pela época do crescimento das plantas. Porém a quantidade total de β-ecdisona por raiz foi influenciada pela época de crescimento, sendo que aos 360 dias após a emergência ocorreu uma maior quantidade do princípio ativo em todos os tratamentos. Apesar de não diferir estatisticamente dos demais tratamentos, aos 360 dias após a emergência das plantas, o tratamento 30 t ha-1 foi o que proporcionou maior quantidade de β-ecdisona.
Resumo:
Several methods of mobile robot navigation request the mensuration of robot position and orientation in its workspace. In the wheeled mobile robot case, techniques based on odometry allow to determine the robot localization by the integration of incremental displacements of its wheels. However, this technique is subject to errors that accumulate with the distance traveled by the robot, making unfeasible its exclusive use. Other methods are based on the detection of natural or artificial landmarks present in the environment and whose location is known. This technique doesnt generate cumulative errors, but it can request a larger processing time than the methods based on odometry. Thus, many methods make use of both techniques, in such a way that the odometry errors are periodically corrected through mensurations obtained from landmarks. Accordding to this approach, this work proposes a hybrid localization system for wheeled mobile robots in indoor environments based on odometry and natural landmarks. The landmarks are straight lines de.ned by the junctions in environments floor, forming a bi-dimensional grid. The landmark detection from digital images is perfomed through the Hough transform. Heuristics are associated with that transform to allow its application in real time. To reduce the search time of landmarks, we propose to map odometry errors in an area of the captured image that possesses high probability of containing the sought mark
Resumo:
This master dissertation introduces a study about some aspects that determine the aplication of adaptative arrays in DS-CDMA cellular systems. Some basics concepts and your evolution in the time about celular systems was detailed here, meanly the CDMA tecnique, specialy about spread-codes and funtionaly principies. Since this, the mobile radio enviroment, with your own caracteristcs, and the basics concepts about adaptive arrays, as powerfull spacial filter was aborded. Some adaptative algorithms was introduced too, these are integrants of the signals processing, and are answerable for weights update that influency directly in the radiation pattern of array. This study is based in a numerical analysis of adaptative array system behaviors related to the used antenna and array geometry types. All the simulations was done by Mathematica 4.0 software. The results for weights convergency, square mean error, gain, array pattern and supression capacity based the analisis made here, using RLS (supervisioned) and LSDRMTA (blind) algorithms.
Resumo:
There are two main approaches for using in adaptive controllers. One is the so-called model reference adaptive control (MRAC), and the other is the so-called adaptive pole placement control (APPC). In MRAC, a reference model is chosen to generate the desired trajectory that the plant output has to follow, and it can require cancellation of the plant zeros. Due to its flexibility in choosing the controller design methodology (state feedback, compensator design, linear quadratic, etc.) and the adaptive law (least squares, gradient, etc.), the APPC is the most general type of adaptive control. Traditionally, it has been developed in an indirect approach and, as an advantage, it may be applied to non-minimum phase plants, because do not involve plant zero-pole cancellations. The integration to variable structure systems allows to aggregate fast transient and robustness to parametric uncertainties and disturbances, as well. In this work, a variable structure adaptive pole placement control (VS-APPC) is proposed. Therefore, new switching laws are proposed, instead of using the traditional integral adaptive laws. Additionally, simulation results for an unstable first order system and simulation and practical results for a three-phase induction motor are shown