Thèses sur le sujet « Neural network RBF »
Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Neural network RBF.
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Neural network RBF ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
1
FERREIRA, Aida Araújo. « Comparação de arquiteturas de redes neurais para sistemas de reconheceimento de padrões em narizes artificiais ». Universidade Federal de Pernambuco, 2004. https://repositorio.ufpe.br/handle/123456789/2465.
Texte intégralRésumé :
Made available in DSpace on 2014-06-12T15:58:28Z (GMT). No. of bitstreams: 2
arquivo4572_1.pdf: 1149011 bytes, checksum: 92aae8f6f9b5145bfcecb94d96dbbc0b (MD5)
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2004Instituto Federal de Educação, Ciência e Tecnologia de Pernambuco
Um nariz artificial é um sistema modular composto de duas partes principais: um sistema sensor, formado de elementos que detectam odores e um sistema de reconhecimento de padrões que classifica os odores detectados. Redes neurais artificiais têm sido utilizadas como sistema de reconhecimento de padrões para narizes artificiais e vêm apresentando resultados promissores. Desde os anos 80, pesquisas para criação de narizes artificiais, que permitam detectar e classificar odores, vapores e gases automaticamente, têm tido avanços significativos. Esses equipamentos podem ser utilizados no monitoramento ambiental para controlar a qualidade do ar, na área de saúde para realizar diagnóstico de doenças e nas indústrias de alimentos para o controle de qualidade e o monitoramento de processos de produção. Esta dissertação investiga a utilização de quatro técnicas diferentes de redes neurais para criação de sistemas de reconhecimento de padrões em narizes artificiais. O trabalho está dividido em quatro partes principais: (1) introdução aos narizes artificiais, (2) redes neurais artificiais para sistema de reconhecimento de padrões, (3) métodos para medir o desempenho de sistemas de reconhecimento de padrões e comparar os resultados e (4) estudo de caso. Os dados utilizados para o estudo de caso, foram obtidos por um protótipo de nariz artificial composto por um arranjo de oito sensores de polímeros condutores, expostos a nove tipos diferentes de aguarrás. Foram adotadas as técnicas Multi-Layer Perceptron (MLP), Radial Base Function (RBF), Probabilistic Neural Network (PNN) e Time Delay Neural Network (TDNN) para criar os sistemas de reconhecimento de padrões. A técnica PNN foi investigada em detalhes, por dois motivos principais: esta técnica é indicada para realização de tarefas de classificação e seu treinamento é feito em apenas um passo, o que torna a etapa de criação dessas redes muito rápida. Os resultados foram comparados através dos valores dos erros médios de classificação utilizando o método estatístico de Teste de Hipóteses. As redes PNN correspondem a uma nova abordagem para criação de sistemas de reconhecimento de padrões de odor. Estas redes tiveram um erro médio de classificação de 1.1574% no conjunto de teste. Este foi o menor erro obtido entre todos os sistemas criados, entretanto mesmo com o menor erro médio de classificação, os testes de hipóteses mostraram que os classificadores criados com PNN não eram melhores do que os classificadores criados com a arquitetura RBF, que obtiveram um erro médio de classificação de 1.3889%. A grande vantagem de criar classificadores com a arquitetura PNN foi o pequeno tempo de treinamento dos mesmos, chegando a ser quase imediato. Porém a quantidade de nodos na camada escondida foi muito grande, o que pode ser um problema, caso o sistema criado deva ser utilizado em equipamentos com poucos recursos computacionais. Outra vantagem de criar classificadores com redes PNN é relativa à quantidade reduzida de parâmetros que devem ser analisados, neste caso apenas o parâmetro relativo à largura da função Gaussiana precisou ser investigado
2
Damasceno, Nielsen Castelo. « Separa??o cega de fontes lineares e n?o lineares usando algoritmo gen?tico, redes neurais artificiais RBF e negentropia de R?nyi como medida de independ?ncia ». Universidade Federal do Rio Grande do Norte, 2010. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15358.
Texte intégralRésumé :
Made available in DSpace on 2014-12-17T14:55:50Z (GMT). No. of bitstreams: 1
NielsenCD_DISSERT.pdf: 3425927 bytes, checksum: 2a460ebc6b49fe832a4f35b40786bc47 (MD5)
Previous issue date: 2010-12-20Conventional methods to solve the problem of blind source separation nonlinear, in general, using series of restrictions to obtain the solution, often leading to an imperfect separation of the original sources and high computational cost. In this paper, we propose an alternative measure of independence based on information theory and uses the tools of artificial intelligence to solve problems of blind source separation linear and nonlinear later. In the linear model applies genetic algorithms and R?nyi of negentropy as a measure of independence to find a separation matrix from linear mixtures of signals using linear form of waves, audio and images. A comparison with two types of algorithms for Independent Component Analysis widespread in the literature. Subsequently, we use the same measure of independence, as the cost function in the genetic algorithm to recover source signals were mixed by nonlinear functions from an artificial neural network of radial base type. Genetic algorithms are powerful tools for global search, and therefore well suited for use in problems of blind source separation. Tests and analysis are through computer simulations
Os m?todos convencionais para resolver o problema de separa??o cega de fontes n?o lineares em geral utilizam uma s?rie de restri??es ? obten??o da solu??o, levando muitas vezes a uma n?o perfeita separa??o das fontes originais e alto custo computacional. Neste trabalho, prop?e-se uma alternativa de medida de independ?ncia com base na teoria da informa??o e utilizam-se ferramentas da intelig?ncia artificial para resolver problemas de separa??o cega de fontes lineares e posteriormente n?o lineares. No modelo linear aplica-se algoritmos gen?ticos e a Negentropia de R?nyi como medida de independ?ncia para encontrar uma matriz de separa??o linear a partir de misturas lineares usando sinais de forma de ondas, ?udios e imagens. Faz-se uma compara??o com dois tipos de algoritmos de An?lise de Componentes Independentes bastante difundidos na literatura. Posteriormente, utiliza-se a mesma medida de independ?ncia como fun??o custo no algoritmo gen?tico para recuperar sinais de fontes que foram misturadas por fun??es n?o lineares a partir de uma rede neural artificial do tipo base radial. Algoritmos gen?ticos s?o poderosas ferramentas de pesquisa global e, portanto, bem adaptados para utiliza??o em problemas de separa??o cega de fontes. Os testes e as an?lises se d?o atrav?s de simula??es computacionais
3
Pham, Hoang Anh. « Coordination de systèmes sous-marins autonomes basée sur une méthodologie intégrée dans un environnement Open-source ». Electronic Thesis or Diss., Toulon, 2021. http://www.theses.fr/2021TOUL0020.
Texte intégralRésumé :
Cette thèse étudie la coordination de robots sous-marins autonomes dans le contexte d’exploration de fonds marins côtiers ou d’inspections d’installations. En recherche d’une méthodologie intégrée, nous avons créé un framework qui permet de concevoir et simuler des commandes de robots sous-marins low-cost avec différentes hypothèses de modèle de complexité croissante (linéaire, non-linéaire, et enfin non-linéaire avec des incertitudes). Sur la base de ce framework articulant plusieurs outils, nous avons étudié des algorithmes pour résoudre le problème de la mise en formation d’un essaim, puis celui de l’évitement de collisions entre robots et celui du contournement d’obstacle d’un groupe de robots sous-marins. Plus précisément, nous considérons d'abord les modèles de robot sous-marin comme des systèmes linéaires de type simple intégrateur, à partir duquel nous pouvons construire un contrôleur de mise en formation en utilisant des algorithmes de consensus et d’évitement. Nous élargissons ensuite ces algorithmes pour le modèle dynamique non linéaire d’un robot Bluerov dans un processus de conception itératif. Nous intégrons ensuite un réseau de neurones de type RBF (Radial Basis Function), déjà éprouvé en convergence et stabilité, avec le contrôleur algébrique pour pouvoir estimer et compenser des incertitudes du modèle du robot. Enfin, nous décrivons les tests de ces algorithmes sur un essaim de robots sous-marins réels BlueROV en environement Opensource de type ROS et programmés en mode autonome. Ce travail permet également de convertir un ROV téléopéré en un hybride ROV-AUV autonome. Nous présentons des résultats de simulation et des essais réels en bassin validant les concepts proposésThis thesis studies the coordination of autonomous underwater robots in the context of coastal seabed exploration or facility inspections. Investigating an integrated methodology, we have created a framework to design and simulate low-cost underwater robot controls with different model assumptions of increasing complexity (linear, non-linear, and finally non-linear with uncertainties). By using this framework, we have studied algorithms to solve the problem of formation control, collision avoidance between robots and obstacle avoidance of a group of underwater robots. More precisely, we first consider underwater robot models as linear systems of simple integrator type, from which we can build a formation controller using consensus and avoidance algorithms. We then extend these algorithms for the nonlinear dynamic model of a Bluerov robot in an iterative design process. Then we have integrated a Radial Basis Function neural network, already proven in convergence and stability, with the algebraic controller to estimate and compensate for uncertainties in the robot model. Finally, we have presented simulation results and real basin tests to validate the proposed concepts. This work also aims to convert a remotely operated ROV into an autonomous ROV-AUV hybrid
4
Soukup, Jiří. « Metody a algoritmy pro rozpoznávání obličejů ». Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2008. http://www.nusl.cz/ntk/nusl-374588.
Texte intégralRésumé :
This work is describing basic methods of face recognition. The methods PCA, LDA, ICA, trace tranfsorm, elastic bunch graph map, genetic algorithm and neural network are described. In practical part, the PCA, PCA + RBF neural network and genetic algorithms are implemented. The RBF neural network is used in the way of clasificator and genetic algorithm is used for RBF NN training in one case and for selecting eigenvectors from PCA method in the other case. This method, PCA + GA, called EPCA, outperform other methods tested in this work on the ORL testing database.
5
Li, Junxu. « A Dynamic Parameter Tuning Algorithm For Rbf Neural Networks ». Fogler Library, University of Maine, 1999. http://www.library.umaine.edu/theses/pdf/LiJ1999.pdf.
Texte intégral
6
Guo, Zhihao. « Intelligent multiple objective proactive routing in MANET with predictions on delay, energy, and link lifetime ». online version, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=case1195705509.
Texte intégral
7
Medagam, Peda Vasanta Reddy. « Online optimal control for a class of nonlinear system using RBF neural networks / ». Available to subscribers only, 2008. http://proquest.umi.com/pqdweb?did=1650508351&sid=19&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégral
8
Machado, Madson Cruz. « Sintonia RNA-RBF para o Projeto Online de Sistemas de Controle Adaptativo ». Universidade Federal do Maranhão, 2017. http://tedebc.ufma.br:8080/jspui/handle/tede/1744.
Texte intégralRésumé :
Submitted by Rosivalda Pereira (mrs.pereira@ufma.br) on 2017-07-18T19:31:22Z
No. of bitstreams: 1
MadsonMachado.pdf: 3046442 bytes, checksum: 71cc6800f83fdbf38b97607067653f63 (MD5)Made available in DSpace on 2017-07-18T19:31:22Z (GMT). No. of bitstreams: 1 MadsonMachado.pdf: 3046442 bytes, checksum: 71cc6800f83fdbf38b97607067653f63 (MD5) Previous issue date: 2017-05-26
The need to increase industrial productivity coupled with quality and low cost requirements has generated a demand for the development of high performance controllers. Motivated by this demand, we presented in this work models, algorithms and a methodology for the online project of high-performance control systems. The models have characteristics of adaptability through adaptive control system architectures. The models developed were based on artificial neural networks of radial basis function type, for the online project of model reference adaptive control systems associated with the of sliding modes control. The algorithms and the embedded system developed for the online project were evaluated for tracking mobile targets, in this case, the solar radiation. The control system has the objective of keeping the surface of the photovoltaic module perpendicular to the solar radiation, in this way the energy generated by the module will be as high as possible. The process consists of a photovoltaic panel coupled in a structure that rotates around an axis parallel to the earth’s surface, positioning the panel in order to capture the highest solar radiation as function of its displacement throughout the day.
A necessidade de aumentar a produtividade industrial, associada com os requisitos de qualidade e baixo custo, gerou uma demanda para o desenvolvimento de controladores de alto desempenho. Motivado por esta demanda, apresentou-se neste trabalho modelos, algoritmos e uma metodologia para o projeto online de sistemas de controle de alto desempenho. Os modelos apresentam características de adaptabilidade por meio de arquiteturas de sistemas de controle adaptativo. O desenvolvimento de modelos, baseia-se em redes neurais artificiais (RNA), do tipo função de base radial (RBF, radial basis function), para o projeto online de sistemas de controle adaptativo do tipo modelo de referência associado com o controle de modos deslizantes (SMC, sliding mode control). Os algoritmos e o sistema embarcado desenvolvidos para o projeto online são avaliados para o rastreamento de alvos móveis, neste caso, o rastreamento da radiação solar. O sistema de controle tem o objetivo de manter a superfície do módulo fotovoltaico perpendicular à radiação solar, pois dessa forma a energia gerada pelo módulo será a maior possível. O processo consiste de um painel fotovoltaico acoplado em uma estrutura que gira em torno de um eixo paralelo à superfície da terra, posicionando o painel de forma a capturar a maior radiação solar em função de seu deslocamento ao longo do dia.
9
Turner, Joseph Vernon. « Application of Artificial Neural Networks in Pharmacokinetics ». Thesis, The University of Sydney, 2003. http://hdl.handle.net/2123/488.
Texte intégralRésumé :
Drug development is a long and expensive process. It is often not until potential drug candidates are administered to humans that accurate quantification of their pharmacokinetic characteristics is achieved. The goal of developing quantitative structure-pharmacokinetic relationships (QSPkRs) is to relate the molecular structure of a chemical entity with its pharmacokinetic characteristics. In this thesis artificial neural networks (ANNs) were used to construct in silico predictive QSPkRs for various pharmacokinetic parameters using different drug data sets. Drug pharmacokinetic data for all studies were taken from the literature. Information for model construction was extracted from drug molecular structure. Numerous theoretical descriptors were generated from drug structure ranging from simple constitutional and functional group counts to complex 3D quantum chemical numbers. Subsets of descriptors were selected which best modeled the target pharmacokinetic parameter(s). Using manual selective pruning, QSPkRs for physiological clearances, volumes of distribution, and fraction bound to plasma proteins were developed for a series of beta-adrenoceptor antagonists. All optimum ANN models had training and cross-validation correlations close to unity, while testing was performed with an independent set of compounds. In most cases the ANN models developed performed better than other published ANN models for the same drug data set. The ability of ANNs to develop QSPkRs with multiple target outputs was investigated for a series of cephalosporins. Multilayer perceptron ANN models were constructed for prediction of half life, volume of distribution, clearances (whole body and renal), fraction excreted in the urine, and fraction bound to plasma proteins. The optimum model was well able to differentiate compounds in a qualitative manner while quantitative predictions were mostly in agreement with observed literature values. The ability to make simultaneous predictions of important pharmacokinetic properties of a compound made this a valuable model. A radial-basis function ANN was employed to construct a quantitative structure-bioavailability relationship for a large, structurally diverse series of compounds. The optimum model contained descriptors encoding constitutional through to conformation dependent solubility characteristics. Prediction of bioavailability for the independent testing set were generally close to observed values. Furthermore, the optimum model provided a good qualitative tool for differentiating between drugs with either low or high experimental bioavailability. QSPkR models constructed with ANNs were compared with multilinear regression models. ANN models were shown to be more effective at selecting a suitable subset of descriptors to model a given pharmacokinetic parameter. They also gave more accurate predictions than multilinear regression equations. This thesis presents work which supports the use of ANNs in pharmacokinetic modeling. Successful QSPkRs were constructed using different combinations of theoretically-derived descriptors and model optimisation techniques. The results demonstrate that ANNs provide a valuable modeling tool that may be useful in drug discovery and development.
10
Turner, Joseph Vernon. « Application of Artificial Neural Networks in Pharmacokinetics ». University of Sydney, 2003. http://hdl.handle.net/2123/488.
Texte intégralRésumé :
Drug development is a long and expensive process. It is often not until potential drug candidates are administered to humans that accurate quantification of their pharmacokinetic characteristics is achieved. The goal of developing quantitative structure-pharmacokinetic relationships (QSPkRs) is to relate the molecular structure of a chemical entity with its pharmacokinetic characteristics. In this thesis artificial neural networks (ANNs) were used to construct in silico predictive QSPkRs for various pharmacokinetic parameters using different drug data sets. Drug pharmacokinetic data for all studies were taken from the literature. Information for model construction was extracted from drug molecular structure. Numerous theoretical descriptors were generated from drug structure ranging from simple constitutional and functional group counts to complex 3D quantum chemical numbers. Subsets of descriptors were selected which best modeled the target pharmacokinetic parameter(s). Using manual selective pruning, QSPkRs for physiological clearances, volumes of distribution, and fraction bound to plasma proteins were developed for a series of beta-adrenoceptor antagonists. All optimum ANN models had training and cross-validation correlations close to unity, while testing was performed with an independent set of compounds. In most cases the ANN models developed performed better than other published ANN models for the same drug data set. The ability of ANNs to develop QSPkRs with multiple target outputs was investigated for a series of cephalosporins. Multilayer perceptron ANN models were constructed for prediction of half life, volume of distribution, clearances (whole body and renal), fraction excreted in the urine, and fraction bound to plasma proteins. The optimum model was well able to differentiate compounds in a qualitative manner while quantitative predictions were mostly in agreement with observed literature values. The ability to make simultaneous predictions of important pharmacokinetic properties of a compound made this a valuable model. A radial-basis function ANN was employed to construct a quantitative structure-bioavailability relationship for a large, structurally diverse series of compounds. The optimum model contained descriptors encoding constitutional through to conformation dependent solubility characteristics. Prediction of bioavailability for the independent testing set were generally close to observed values. Furthermore, the optimum model provided a good qualitative tool for differentiating between drugs with either low or high experimental bioavailability. QSPkR models constructed with ANNs were compared with multilinear regression models. ANN models were shown to be more effective at selecting a suitable subset of descriptors to model a given pharmacokinetic parameter. They also gave more accurate predictions than multilinear regression equations. This thesis presents work which supports the use of ANNs in pharmacokinetic modeling. Successful QSPkRs were constructed using different combinations of theoretically-derived descriptors and model optimisation techniques. The results demonstrate that ANNs provide a valuable modeling tool that may be useful in drug discovery and development.
11
Selmini, Antonio Marcos. « Aplicação de redes neurais artificiais e filtro de Kalman para redução de ruídos em sinais de voz ». Universidade de São Paulo, 2001. http://www.teses.usp.br/teses/disponiveis/18/18133/tde-29072016-111821/.
Texte intégralRésumé :
A filtragem, na sua forma mais geral, tem estado presente na vida do homem há muito tempo. Com o surgimento de novas tecnologias (surgimento da eletricidade e a sua evolução) e o desenvolvimento da computação, as técnicas de filtragem (separação) de sinais elétricos. Normalmente, os sistemas de comunicação (telefonia móvel e fixa, sinais recebidos de satélites e outros sistemas) contém sinais indesejáveis responsáveis pela degradação do sinal original. Dentro desse contexto, este projeto de pesquisa apresenta um estudo do algoritmo Filtro Duplo de Kalman Estendido, onde um filtro e Kalman e duas redes neurais são empregadas para a redução de ruídos em sinais de voz. O algoritmo estudado foi aplicado ao processamento de um sinal corrompido por dois tipos de ruídos diferentes: ruído branco e ruído gaussiano e ruído branco não estacionário, conseguindo-se bons resultados. Uma melhora sensível do sinal filtrado pode ser conseguida com técnicas de pré-filtragem do sinal. Neste trabalho foi utilizado o filtro de médias para a pré-filtragem, obtendo um sinal filtrado com ruído musical de baixa intensidade.Filtering in it\'s most general kind has been present in men\'s life for a long time. With the appearance of new technologies (appearance of electricity and it\'s evolution) and the deyelopment of the computer science, the filtering techniques started to be widely used in engineering to the filtering (separation) of electric signals. Normally the communication systems (fixed and mobile telephony, signals sent from satellites and other systems) bring undesired results responsible for the degradation of the original signal. Within this context, this research project shows a study of the algorithm Dual Extended Kalman Filtering, in which a Kalman filter and two neural networks are used for the reduction of noise in speech signals. The algorithm studied was applied to the processing of a signal corrupted by two types of different noises: gaussian white noise and non stationary white noise obtaining good results. A significant improvement of the filtered noise can be obtained with techniques of pre-filtering of the signal. In this research the average filter for a pre-filtering was used, obtaining a filtered signal with musical noise oflow intensity.
12
Nawathe, Piyush. « Neural Network Trees and Simulation Databases : New Approaches for Signalized Intersection Crash Classification and Prediction ». Master's thesis, University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4067.
Texte intégralRésumé :
Intersection related crashes form a significant proportion of the crashes occurring on roadways. Many organizations such as the Federal Highway Administration (FHWA) and American Association of State Highway and Transportation Officials (AASHTO) are considering intersection safety improvement as one of their top priority areas. This study contributes to the area of safety of signalized intersections by identifying the traffic and geometric characteristics that affect the different types of crashes. The first phase of this thesis was to classify the crashes occurring at signalized intersections into rear-end, angle, turn and sideswipe crash types based on the traffic and geometric properties of the intersections and the conditions at the time of the crashes. This was achieved by using an innovative approach developed in this thesis "Neural Network Trees". The first neural network model built in the Neural Network tree classified the crashes either into rear end and sideswipe or into angle and turn crashes. The next models further classified the crashes into their individual types. Two different neural network methods (MLP and PNN) were used in classification, and the neural network with a better performance was selected for each model. For these models, the significant variables were identified using the forward sequential selection method. Then a large simulation database was built that contained all possible combinations of intersections subjected to various crash conditions. The collision type of crashes was predicted for this simulation database and the output obtained was plotted along with the input variables to obtain a relationship between the input and output variables. For example, the analysis showed that the number of rear end and sideswipe crashes increase relative to the angle and turn crashes when there is an increase in the major and minor roadways' AADT and speed limits, surface conditions, total left turning lanes, channelized right turning lanes for the major roadway and the protected left turning lanes for the minor roadway, but decrease when the light conditions are dark. The next phase in this study was to predict the frequency of different types of crashes at signalized intersections by using the geometric and traffic characteristics of the intersections. A high accuracy in predicting the crash frequencies was obtained by using another innovative method where the intersections were first classified into two different types named the "safe" and "unsafe" intersections based on the total number of lanes at the intersections and then the frequency of crashes was predicted for each type of intersections separately. This method consisted of identifying the best neural network for each step of the analysis, selecting significant variables, using a different simulation database that contained all possible combinations of intersections and then plotting each input variable with the average output to obtain the pattern in which the frequency of crashes will vary based on the changes in the geometric and traffic characteristics of the intersections. The patterns indicated that an increase in the number of lanes of the major roadway, lanes of the minor roadway and the AADT on the major roadway leads to an increased crashes of all types, whereas an increase in protected left turning lanes on the major road increases the rear end and sideswipe crashes but decreases the angle, turning and overall crash frequencies. The analyses performed in this thesis were possible due to a diligent data collection effort. Traffic and geometric characteristics were obtained from multiple sources for 1562 signalized intersections in Brevard, Hillsborough, Miami-Dade, Seminole and Orange counties and the city of Orlando in Florida. The crash database for these intersections contained 27,044 crashes. This research sheds a light on the characteristics of different types of crashes. The method used in classifying crashes into their respective collision types provides a deeper insight on the characteristics of each type of crash and can be helpful in mitigating a particular type of crash at an intersection. The second analysis carried out has a three fold advantage. First, it identifies if an intersection can be considered safe for different crash types. Second, it accurately predicts the frequencies of total, rear end, angle, sideswipe and turn crashes. Lastly, it identifies the traffic and geometric characteristics of signalized intersections that affect each of these crash types. Thus the models developed in this thesis can be used to identify the specific problems at an intersection, and identify the factors that should be changed to improve its safetyM.S.C.E.
Department of Civil and Environmental Engineering
Engineering and Computer Science
Civil Engineering
13
Bassi, Regiane Denise Solgon. « Identicação inteligente de patologias no trato vocal ». Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/18/18153/tde-14032014-080118/.
Texte intégralRésumé :
Com base em exames como a videolaringoscopia, que é considerado um procedimento médico invasivo e desconfortável, diagnósticos têmsido realizados visando detectar patologias na laringe. Geralmente, esse tipo de exame é realizado somente com solicitação médica e quando alterações na fala já são marcantes, ou há sensação de dor. Nessa fase, muitas vezes a doença está em grau avançado, dificultando o seu tratamento. Com o objetivo de realizar um pré-diagnóstico computacional de tais patologias, este trabalho apresenta uma técnica não invasiva na qual são testados e comparados três classificadores: a Distância Euclidiana, a Rede Neural RBF com o kernel Gaussiano e a Rede Neural RBF com o kernel Gaussiano modificado. Testes realizados com uma base de dados de vozes normais e aquelas afetadas por diversas patologias demonstram a eficácia da técnica proposta, que pode, inclusive, ser implementada em tempo-real.Based on examinations such as laryngoscopy, which is considered an invasive and uncomfortable procedure, diagnosis have been performed aiming at the detection of larynx pathologies. Usually, this type of test is carried out upon medical request and when the speech changes are notable or are causing pain. At this point, the disease is possibly at an advanced degree, complicating its treatment. In order to perform a computational pre-diagnosis of such conditions, this work proposes a noninvasive technique in which three classifiers are tested and compared: the Euclidean distance, the RBF Neural Network with the Gaussian kernel and RBF Neural Network with a modified Gaussian kernel. Tests carried out with a database of normal voices and those affected by various pathologies demonstrate the effectiveness of the technique that may even be implemented to work in real time.
14
Johnson, Cynthia Lynn. « Counterpropagation neural network detection of visual primitives ». Master's thesis, University of Central Florida, 1990. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/12639.
Texte intégralRésumé :
University of Central Florida College of Engineering ThesisPsychological testing has shown that there is an early preattentive stage in the human visual system. At this level, simple features and properties of objects known as visual primitives are deteched spatially in parallel by groupings of cells in the visual cortex known as feature maps. In order to study this preattentive stage in a machine vision system, the biologically inspired, highly parallel architecture of the artificial neural network shows great promise. This paper describes how the unique architecture of the counterpropagation neural network was used to simulate the feature maps which detect visual primitives in the human visual system. The results of the research showed that artificial neural networks are able to reproduce the function of the feature maps with accuracy. The counterpropagation network was able to reproduce the feature maps as theorized, however, future research might investigate the abilities of other neural network algorithms in this area. Development of a method for combining the results of feature maps in a simulation of full scale early vision is also a topic for future research that would benefit from the results reported here.
M.S.;
Computer Engineering
Engineering;
Computer Engineering
63 p.
iv, 63 leaves, bound : ill. ; 28 cm.
15
Bosack, Matthew James. « Magnetic Signature Estimation Using Neural Networks ». Master's thesis, Temple University Libraries, 2012. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/178597.
Texte intégralRésumé :
Electrical EngineeringM.S.E.E.
Ferrous objects in earth's magnetic field cause distortion in the surrounding ambient field. This distortion is a function of the object's material properties and geometry, and is known as the magnetic signature. As a precursor to first principle modeling of the phenomenon and a proof of concept, the goal of this research is to predict offboard magnetic signatures from on-board sensor data using a neural network. This allows magnetic signature analysis in applications where direct field measurements are inaccessible. Simulated magnetic environments are generated using MATLAB's Partial Differential Equation toolbox for a 2D geometry, specifically for a rectangular shell. The resulting data sets are used to train and validate the neural network, which is configured in two layers with ten neurons. Sensor data from within the shell is used as network inputs, and the off-board field values are used as targets. The neural network is trained using the Levenberg-Marquardt algorithm and the back propagation method by comparing the estimated off-board magnetic field intensity to the true value. This research also investigates sensitivity, scalability, and implementation issues of the neural network for signature estimation in a practical environment.
Temple University--Theses
16
Al-Daraiseh, Ahmad. « GENETICALLY ENGINEERED ADAPTIVE RESONANCE THEORY (ART) NEURAL NETWORK ARCHITECTURES ». Doctoral diss., University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3171.
Texte intégralRésumé :
Fuzzy ARTMAP (FAM) is currently considered to be one of the premier neural network architectures in solving classification problems. One of the limitations of Fuzzy ARTMAP that has been extensively reported in the literature is the category proliferation problem. That is Fuzzy ARTMAP has the tendency of increasing its network size, as it is confronted with more and more data, especially if the data is of noisy and/or overlapping nature. To remedy this problem a number of researchers have designed modifications to the training phase of Fuzzy ARTMAP that had the beneficial effect of reducing this phenomenon. In this thesis we propose a new approach to handle the category proliferation problem in Fuzzy ARTMAP by evolving trained FAM architectures. We refer to the resulting FAM architectures as GFAM. We demonstrate through extensive experimentation that an evolved FAM (GFAM) exhibits good (sometimes optimal) generalization, small size (sometimes optimal size), and requires reasonable computational effort to produce an optimal or sub-optimal network. Furthermore, comparisons of the GFAM with other approaches, proposed in the literature, which address the FAM category proliferation problem, illustrate that the GFAM has a number of advantages (i.e. produces smaller or equal size architectures, of better or as good generalization, with reduced computational complexity). Furthermore, in this dissertation we have extended the approach used with Fuzzy ARTMAP to other ART architectures, such as Ellipsoidal ARTMAP (EAM) and Gaussian ARTMAP (GAM) that also suffer from the ART category proliferation problem. Thus, we have designed and experimented with genetically engineered EAM and GAM architectures, named GEAM and GGAM. Comparisons of GEAM and GGAM with other ART architectures that were introduced in the ART literature, addressing the category proliferation problem, illustrate similar advantages observed by GFAM (i.e, GEAM and GGAM produce smaller size ART architectures, of better or improved generalization, with reduced computational complexity). Moverover, to optimally cover the input space of a problem, we proposed a genetically engineered ART architecture that combines the category structures of two different ART networks, FAM and EAM. We named this architecture UART (Universal ART). We analyzed the order of search in UART, that is the order according to which a FAM category or an EAM category is accessed in UART. This analysis allowed us to better understand UART's functionality. Experiments were also conducted to compare UART with other ART architectures, in a similar fashion as GFAM and GEAM were compared. Similar conclusions were drawn from this comparison, as in the comparison of GFAM and GEAM with other ART architectures. Finally, we analyzed the computational complexity of the genetically engineered ART architectures and we compared it with the computational complexity of other ART architectures, introduced into the literature. This analytical comparison verified our claim that the genetically engineered ART architectures produce better generalization and smaller sizes ART structures, at reduced computational complexity, compared to other ART approaches. In review, a methodology was introduced of how to combine the answers (categories) of ART architectures, using genetic algorithms. This methodology was successfully applied to FAM, EAM and FAM and EAM ART architectures, with success, resulting in ART neural networks which outperformed other ART architectures, previously introduced into the literature, and quite often produced ART architectures that attained optimal classification results, at reduced computational complexity.Ph.D.
Department of Electrical and Computer Engineering
Engineering and Computer Science
Computer Engineering
17
Thakkar, Pinal. « NEURAL NETWORKS SATISFYING STONE-WEIESTRASS THEOREM AND APPROXIMATING ». Master's thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4060.
Texte intégralRésumé :
Neural networks are an attempt to build computer networks called artificial neurons, which imitate the activities of the human brain. Its origin dates back to 1943 when neurophysiologist Warren Me Cello and logician Walter Pits produced the first artificial neuron. Since then there has been tremendous development of neural networks and their applications to pattern and optical character recognition, speech processing, time series prediction, image processing and scattered data approximation. Since it has been shown that neural nets can approximate all but pathological functions, Neil Cotter considered neural network architecture based on Stone-Weierstrass Theorem. Using exponential functions, polynomials, rational functions and Boolean functions one can follow the method given by Cotter to obtain neural networks, which can approximate bounded measurable functions. Another problem of current research in computer graphics is to construct curves and surfaces from scattered spatial points by using B-Splines and NURBS or Bezier surfaces. Hoffman and Varady used Kohonen neural networks to construct appropriate grids. This thesis is concerned with two types of neural networks viz. those which satisfy the conditions of the Stone-Weierstrass theorem and Kohonen neural networks. We have used self-organizing maps for scattered data approximation. Neural network Tool Box from MATLAB is used to develop the required grids for approximating scattered data in one and two dimensions.M.S.
Department of Mathematics
Arts and Sciences
Mathematics
18
Risi, Sebastian. « Towards Evolving More Brain-Like Artificial Neural Networks ». Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5460.
Texte intégralRésumé :
An ambitious long-term goal for neuroevolution, which studies how artificial evolutionary processes can be driven to produce brain-like structures, is to evolve neurocontrollers with a high density of neurons and connections that can adapt and learn from past experience. Yet while neuroevolution has produced successful results in a variety of domains, the scale of natural brains remains far beyond reach. In this dissertation two extensions to the recently introduced Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach are presented that are a step towards more brain-like artificial neural networks (ANNs). First, HyperNEAT is extended to evolve plastic ANNs that can learn from past experience. This new approach, called adaptive HyperNEAT, allows not only patterns of weights across the connectivity of an ANN to be generated by a function of its geometry, but also patterns of arbitrary local learning rules. Second, evolvable-substrate HyperNEAT (ES-HyperNEAT) is introduced, which relieves the user from deciding where the hidden nodes should be placed in a geometry that is potentially infinitely dense. This approach not only can evolve the location of every neuron in the network, but also can represent regions of varying density, which means resolution can increase holistically over evolution. The combined approach, adaptive ES-HyperNEAT, unifies for the first time in neuroevolution the abilities to indirectly encode connectivity through geometry, generate patterns of heterogeneous plasticity, and simultaneously encode the density and placement of nodes in space. The dissertation culminates in a major application domain that takes a step towards the general goal of adaptive neurocontrollers for legged locomotion.ID: 031001435; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Adviser: Kenneth O. Stanley.; Title from PDF title page (viewed June 24, 2013).; Thesis (Ph.D.)--University of Central Florida, 2012.; Includes bibliographical references (p. 165-178).
Ph.D.
Doctorate
Computer Science
Engineering and Computer Science
Computer Science
19
Kang, Bei. « STATISTICAL CONTROL USING NEURAL NETWORK METHODS WITH HIERARCHICAL HYBRID SYSTEMS ». Diss., Temple University Libraries, 2011. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/122303.
Texte intégralRésumé :
Electrical EngineeringPh.D.
The goal of an optimal control algorithm is to improve the performance of a system. For a stochastic system, a typical optimal control method minimizes the mean (first cumulant) of the cost function. However, there are other statistical properties of the cost function, such as variance (second cumulant) and skewness (third cumulant), which will affect the system performance. In this dissertation, the work on the statistical optimal control are presented, which extends the traditional optimal control method using cost cumulants to shape the system performance. Statistical optimal control will allow more design freedom to achieve better performance. The solutions of statistical control involve solving partial differential equations known as Hamilton-Jacobi-Bellman equation. A numerical method based on neural networks is employed to find the solutions of the Hamilton-Jacobi-Bellman partial differential equation. Furthermore, a complex problem such as multiple satellite control, has both continuous and discrete dynamics. Thus, a hierarchical hybrid architecture is developed in this dissertation where the discrete event system is applied to discrete dynamics, and the statistical control is applied to continuous dynamics. Then, the application of a multiple satellite navigation system is analyzed using the hierarchical hybrid architecture. Through this dissertation, it is shown that statistical control theory is a flexible optimal control method which improves the performance; and hierarchical hybrid architecture allows control and navigation of a complex system which contains continuous and discrete dynamics.
Temple University--Theses
20
Vartak, Aniket Arun. « GAUSS-NEWTON BASED LEARNING FOR FULLY RECURRENT NEURAL NETWORKS ». Master's thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4429.
Texte intégralRésumé :
The thesis discusses a novel off-line and on-line learning approach for Fully Recurrent Neural Networks (FRNNs). The most popular algorithm for training FRNNs, the Real Time Recurrent Learning (RTRL) algorithm, employs the gradient descent technique for finding the optimum weight vectors in the recurrent neural network. Within the framework of the research presented, a new off-line and on-line variation of RTRL is presented, that is based on the Gauss-Newton method. The method itself is an approximate Newton's method tailored to the specific optimization problem, (non-linear least squares), which aims to speed up the process of FRNN training. The new approach stands as a robust and effective compromise between the original gradient-based RTRL (low computational complexity, slow convergence) and Newton-based variants of RTRL (high computational complexity, fast convergence). By gathering information over time in order to form Gauss-Newton search vectors, the new learning algorithm, GN-RTRL, is capable of converging faster to a better quality solution than the original algorithm. Experimental results reflect these qualities of GN-RTRL, as well as the fact that GN-RTRL may have in practice lower computational cost in comparison, again, to the original RTRL.M.S.
Department of Electrical and Computer Engineering
Engineering and Computer Science
Electrical and Computer Engineering
21
Kaylani, Assem. « AN ADAPTIVE MULTIOBJECTIVE EVOLUTIONARY APPROACH TO OPTIMIZE ARTMAP NEURAL NETWORKS ». Doctoral diss., University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2538.
Texte intégralRésumé :
This dissertation deals with the evolutionary optimization of ART neural network architectures. ART (adaptive resonance theory) was introduced by a Grossberg in 1976. In the last 20 years (1987-2007) a number of ART neural network architectures were introduced into the literature (Fuzzy ARTMAP (1992), Gaussian ARTMAP (1996 and 1997) and Ellipsoidal ARTMAP (2001)). In this dissertation, we focus on the evolutionary optimization of ART neural network architectures with the intent of optimizing the size and the generalization performance of the ART neural network. A number of researchers have focused on the evolutionary optimization of neural networks, but no research has been performed on the evolutionary optimization of ART neural networks, prior to 2006, when Daraiseh has used evolutionary techniques for the optimization of ART structures. This dissertation extends in many ways and expands in different directions the evolution of ART architectures, such as: (a) uses a multi-objective optimization of ART structures, thus providing to the user multiple solutions (ART networks) with varying degrees of merit, instead of a single solution (b) uses GA parameters that are adaptively determined throughout the ART evolution, (c) identifies a proper size of the validation set used to calculate the fitness function needed for ART's evolution, thus speeding up the evolutionary process, (d) produces experimental results that demonstrate the evolved ART's effectiveness (good accuracy and small size) and efficiency (speed) compared with other competitive ART structures, as well as other classifiers (CART (Classification and Regression Trees) and SVM (Support Vector Machines)). The overall methodology to evolve ART using a multi-objective approach, the chromosome representation of an ART neural network, the genetic operators used in ART's evolution, and the automatic adaptation of some of the GA parameters in ART's evolution could also be applied in the evolution of other exemplar based neural network classifiers such as the probabilistic neural network and the radial basis function neural network.Ph.D.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering PhD
22
St, Matthew Daniel Eyitopehesis. « A comparative analysis of regression and neural networks in simulation metamodeling ». Honors in the Major Thesis, University of Central Florida, 2000. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/207.
Texte intégralRésumé :
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.Bachelors
Engineering
Industrial Engineering
23
Martínez, Brito Izacar Jesús. « Quantitative structure fate relationships for multimedia environmental analysis ». Doctoral thesis, Universitat Rovira i Virgili, 2010. http://hdl.handle.net/10803/8590.
Texte intégralRésumé :
Key physicochemical properties for a wide spectrum of chemical pollutants are unknown. This thesis analyses the prospect of assessing the environmental distribution of chemicals directly from supervised learning algorithms using molecular descriptors, rather than from multimedia environmental models (MEMs) using several physicochemical properties estimated from QSARs. Dimensionless compartmental mass ratios of 468 validation chemicals were compared, in logarithmic units, between: a) SimpleBox 3, a Level III MEM, propagating random property values within statistical distributions of widely recommended QSARs; and, b) Support Vector Regressions (SVRs), acting as Quantitative Structure-Fate Relationships (QSFRs), linking mass ratios to molecular weight and constituent counts (atoms, bonds, functional groups and rings) for training chemicals. Best predictions were obtained for test and validation chemicals optimally found to be within the domain of applicability of the QSFRs, evidenced by low MAE and high q2 values (in air, MAE≤0.54 and q2≥0.92; in water, MAE≤0.27 and q2≥0.92).Las propiedades fisicoquímicas de un gran espectro de contaminantes químicos son desconocidas. Esta tesis analiza la posibilidad de evaluar la distribución ambiental de compuestos utilizando algoritmos de aprendizaje supervisados alimentados con descriptores moleculares, en vez de modelos ambientales multimedia alimentados con propiedades estimadas por QSARs. Se han comparado fracciones másicas adimensionales, en unidades logarítmicas, de 468 compuestos entre: a) SimpleBox 3, un modelo de nivel III, propagando valores aleatorios de propiedades dentro de distribuciones estadísticas de QSARs recomendados; y, b) regresiones de vectores soporte (SVRs) actuando como relaciones cuantitativas de estructura y destino (QSFRs), relacionando fracciones másicas con pesos moleculares y cuentas de constituyentes (átomos, enlaces, grupos funcionales y anillos) para compuestos de entrenamiento. Las mejores predicciones resultaron para compuestos de test y validación correctamente localizados dentro del dominio de aplicabilidad de los QSFRs, evidenciado por valores bajos de MAE y valores altos de q2 (en aire, MAE≤0.54 y q2≥0.92; en agua, MAE≤0.27 y q2≥0.92).
24
Draper, Matthew C. « Neural algorithms for EMI based landmine detection ». Honors in the Major Thesis, University of Central Florida, 2003. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/410.
Texte intégralRésumé :
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.Bachelors
Engineering and Computer Science
Computer Engineering
25
Secretan, James. « A Hybrid of Neural Networks and Genetic Algorithms for Controlling Mobile Robots ». Honors in the Major Thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/725.
Texte intégralRésumé :
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucfBachelors
Engineering and Computer Science
Computer Engineering
26
Dubbin, Greg A. « Dance evolution : interactively evolving neural networks to control dancing three-dimensional models ». Honors in the Major Thesis, University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1254.
Texte intégralRésumé :
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.Bachelors
Engineering and Computer Science
Computer Science
27
Rodriguez, Adelein. « A NEAT Approach to Genetic Programming ». Master's thesis, University of Central Florida, 2007. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2379.
Texte intégralRésumé :
The evolution of explicitly represented topologies such as graphs involves devising methods for mutating, comparing and combining structures in meaningful ways and identifying and maintaining the necessary topological diversity. Research has been conducted in the area of the evolution of trees in genetic programming and of neural networks and some of these problems have been addressed independently by the different research communities. In the domain of neural networks, NEAT (Neuroevolution of Augmenting Topologies) has shown to be a successful method for evolving increasingly complex networks. This system's success is based on three interrelated elements: speciation, marking of historical information in topologies, and initializing search in a small structures search space. This provides the dynamics necessary for the exploration of diverse solution spaces at once and a way to discriminate between different structures. Although different representations have emerged in the area of genetic programming, the study of the tree representation has remained of interest in great part because of its mapping to programming languages and also because of the observed phenomenon of unnecessary code growth or bloat which hinders performance. The structural similarity between trees and neural networks poses an interesting question: Is it possible to apply the techniques from NEAT to the evolution of trees and if so, how does it affect performance and the dynamics of code growth? In this work we address these questions and present analogous techniques to those in NEAT for genetic programming.M.S.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering MSCpE
28
Muppidi, Aparna. « DEVELOPMENT OF AN ARTIFICIAL NEURAL NETWORKS MODEL TO ESTIMATE DELAY USING TOLL PLAZA TRANSACTION DATA ». Master's thesis, University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2876.
Texte intégralRésumé :
In spite of the most up-to-date investigation of the relevant techniques to analyze the traffic characteristics and traffic operations at a toll plaza, there has not been any note worthy explorations evaluating delay from toll transaction data and using Artificial Neural Networks (ANN) at a toll plaza. This thesis lays an emphasis on the application of ANN techniques to estimate the total vehicular delay according to the lane type at a toll plaza. This is done to avoid the laborious task of extracting data from the video recordings at a toll plaza. Based on the lane type a general methodology was developed to estimate the total vehicular delay at a toll plaza using ANN. Since there is zero delay in an Electronic Toll Collection (ETC) lane, ANN models were developed for estimating the total vehicular delay in a manual lane and automatic coin machine lane. Therefore, there are two ANN models developed in this thesis. These two ANN models were trained with three hours of data and validated with one hour of data from AM and PM peak data. The two ANN models were built with the dependent and independent variables. The dependent variables in the two models were the total vehicular delay for both the manual and automatic coin machine lane. The independent variables are those, which influence delay. A correlation analysis was performed to see if there exists any strong relationship between the dependent (outputs) and independent variables (inputs). These inputs and outputs are fed into the ANN models. The MATLABTB code was written to run the two ANN models. ANN predictions were good at estimating delay in manual lane, and delay in automatic coin machine lane.M.S.
Department of Civil and Environmental Engineering
Engineering and Computer Science
Civil Engineering
29
Lent, Marino Ricardo. « On the design and performance of cognitive packets over wired networks and mobile ad hoc networks ». Doctoral diss., University of Central Florida, 2003. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/3553.
Texte intégralRésumé :
University of Central Florida College of Engineering ThesisThis dissertation studied cognitive packet networks (CPN) which build networked learning systems that support adaptive, quality of service-driven routing of packets in wired networks and in wireless, mobile ad hoc networks.
Ph.D.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Electrical Engineering and Computer Science
160 p.
xvii, 160 leaves, bound : ill. ; 28 cm.
30
LeCroy, Kenney. « Integration of artificial neural networks and simultion modeling in a decision support system ». Master's thesis, University of Central Florida, 1994. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/23269.
Texte intégralRésumé :
University of Central Florida College of Engineering ThesisA simulation based decision support system is developed for AT&T Microelectronics in Orlando. This sytem uses simulation modeling to capture the complex nature of semiconductor test operations. Simulation, however, is not a tool for optimizations by itself. Numerous executions of the simulation model must generally be performed to narrow in on a set of proper decision parameters. As a means of alleviating this shortcoming, artificial neural networks are used in conjunction with simulation modeling to aid management in the decision making process. The integration of simulation and neural networks in a comprehensive decision support system, in effect, learns the reverse of the simulation porocess. That is, given a set of goals defined for performance measures, the decision support sytem suggests proper values for decision parameters to achieve those goals.
M.S.;
Industrial Engineering and Mangement Systems
Engineering;
Industrial Engineering
165 p.
viii, 165 leaves, bound : ill. ; 28 cm.
31
Napoli, Alessandro. « DISSOCIATED NEURONAL NETWORKS AND MICRO ELECTRODE ARRAYS FOR INVESTIGATING BRAIN FUNCTIONAL EVOLUTION AND PLASTICITY ». Diss., Temple University Libraries, 2014. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/269449.
Texte intégralRésumé :
Electrical EngineeringPh.D.
For almost a century, the electrical properties of the brain and the nervous system have been investigated to gain a better understanding of their mechanisms and to find cures for pathological conditions. Despite the fact that today's advancements in surgical techniques, research, and medical imaging have improved our ability to treat brain disorders, our knowledge of the brain and its functions is still limited. Culturing dissociated cortical neurons on Micro-Electrode Array dishes is a powerful experimental tool for investigating functional and structural characteristics of in-vitro neuronal networks, such as the cellular basis of brain learning, memory and synaptic developmental plasticity. This dissertation focuses on combining MEAs with novel electrophysiology experimental paradigms and statistical data analysis to investigate the mechanisms that regulate brain development at the level of synaptic formation and growth cones. The goal is to use a mathematical approach and specifically designed experiments to investigate whether dissociated neuronal networks can dependably display long and short-term plasticity, which are thought to be the building blocks of memory formation in the brain. Quantifying the functional evolution of dissociated neuronal networks during in- vitro development, using a statistical analysis tool was the first aim of this work. The results of the False Discovery Rate analysis show an evolution in network activity with changes in both the number of statistically significant stimulus/recording pairs as well as the average length of connections and the number of connections per active node. It is therefore proposed that the FDR analysis combined with two metrics, the average connection length and the number of highly connected "supernodes" is a valuable technique for describing neuronal connectivity in MEA dishes. Furthermore, the statistical analysis indicates that cultures dissociated from the same brain tissue display trends in their temporal evolution that are more similar than those obtained with respect to different batches. The second aim of this dissertation was to investigate long and short-term plasticity responsible for memory formation in dissociated neuronal networks. In order to address this issue, a set of experiments was designed and implemented in which the MEA electrode grid was divided into four quadrants, two of which were chronically stimulated, every two days for one hour with a stimulation paradigm that varied over time. Overall network and quadrant responses were then analyzed to quantify what level of plasticity took place in the network and how this was due to the stimulation interruption. The results demonstrate that here were no spatial differences in the stimulus-evoked activity within quadrants. Furthermore, the implemented stimulation protocol induced depression effects in the neuronal networks as demonstrated by the consistently lower network activity following stimulation sessions. Finally, the analysis demonstrated that the inhibitory effects of the stimulation decreased over time, thus suggesting a habituation phenomenon. These findings are sufficient to conclude that electrical stimulation is an important tool to interact with dissociated neuronal cultures, but localized stimuli are not enough to drive spatial synaptic potentiation or depression. On the contrary, the ability to modulate synaptic temporal plasticity was a feasible task to achieve by chronic network stimulation.
Temple University--Theses
32
Moriarty, Christopher. « LEARNING HUMAN BEHAVIOR FROM OBSERVATION FOR GAMING APPLICATIONS ». Master's thesis, University of Central Florida, 2007. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3354.
Texte intégralRésumé :
The gaming industry has reached a point where improving graphics has only a small effect on how much a player will enjoy a game. One focus has turned to adding more humanlike characteristics into computer game agents. Machine learning techniques are being used scarcely in games, although they do offer powerful means for creating humanlike behaviors in agents. The first person shooter (FPS), Quake 2, is an open source game that offers a multi-agent environment to create game agents (bots) in. This work attempts to combine neural networks with a modeling paradigm known as context based reasoning (CxBR) to create a contextual game observation (CONGO) system that produces Quake 2 agents that behave as a human player trains them to act. A default level of intelligence is instilled into the bots through contextual scripts to prevent the bot from being trained to be completely useless. The results show that the humanness and entertainment value as compared to a traditional scripted bot have improved, although, CONGO bots usually ranked only slightly above a novice skill level. Overall, CONGO is a technique that offers the gaming community a mode of game play that has promising entertainment value.M.S.Cp.E.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering MSCpE
33
Gong, Jianwei. « NON-SILICON MICROFABRICATED NANOSTRUCTURED CHEMICAL SENSORS FOR ELECTRIC NOSE APPLICATION ». Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4082.
Texte intégralRésumé :
A systematic investigation has been performed for "Electric Nose", a system that can identify gas samples and detect their concentrations by combining sensor array and data processing technologies. Non-silicon based microfabricatition has been developed for micro-electro-mechanical-system (MEMS) based gas sensors. Novel sensors have been designed, fabricated and tested. Nanocrystalline semiconductor metal oxide (SMO) materials include SnO2, WO3 and In2O3 have been studied for gas sensing applications. Different doping material such as copper, silver, platinum and indium are studied in order to achieve better selectivity for different targeting toxic gases including hydrogen, carbon monoxide, hydrogen sulfide etc. Fundamental issues like sensitivity, selectivity, stability, temperature influence, humidity influence, thermal characterization, drifting problem etc. of SMO gas sensors have been intensively investigated. A novel approach to improve temperature stability of SMO (including tin oxide) gas sensors by applying a temperature feedback control circuit has been developed. The feedback temperature controller that is compatible with MEMS sensor fabrication has been invented and applied to gas sensor array system. Significant improvement of stability has been achieved compared to SMO gas sensors without temperature compensation under the same ambient conditions. Single walled carbon nanotube (SWNT) has been studied to improve SnO2 gas sensing property in terms of sensitivity, response time and recovery time. Three times of better sensitivity has been achieved experimentally. The feasibility of using TSK Fuzzy neural network algorithm for Electric Nose has been exploited during the research. A training process of using TSK Fuzzy neural network with input/output pairs from individual gas sensor cell has been developed. This will make electric nose smart enough to measure gas concentrations in a gas mixture. The model has been proven valid by gas experimental results conducted.Ph.D.
Department of Mechanical, Materials and Aerospace Engineering;
Engineering and Computer Science
Mechanical Engineering
34
Gruber, Fred. « EVOLUTIONARY OPTIMIZATION OF SUPPORT VECTOR MACHINES ». Master's thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3092.
Texte intégralRésumé :
Support vector machines are a relatively new approach for creating classifiers that have become increasingly popular in the machine learning community. They present several advantages over other methods like neural networks in areas like training speed, convergence, complexity control of the classifier, as well as a stronger mathematical background based on optimization and statistical learning theory. This thesis deals with the problem of model selection with support vector machines, that is, the problem of finding the optimal parameters that will improve the performance of the algorithm. It is shown that genetic algorithms provide an effective way to find the optimal parameters for support vector machines. The proposed algorithm is compared with a backpropagation Neural Network in a dataset that represents individual models for electronic commerce.M.S.
Department of Industrial Engineering and Management Systems
Engineering and Computer Science
Industrial Engineering and Management Systems
35
Lopez, de Diego Silvia Isabel. « Automated Interpretation of Abnormal Adult Electroencephalograms ». Master's thesis, Temple University Libraries, 2017. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/463281.
Texte intégralRésumé :
Electrical and Computer EngineeringM.S.E.E.
Interpretation of electroencephalograms (EEGs) is a process that is still dependent on the subjective analysis of the examiner. The interrater agreement, even for relevant clinical events such as seizures, can be low. For instance, the differences between interictal, ictal, and post-ictal EEGs can be quite subtle. Before making such low-level interpretations of the signals, neurologists often classify EEG signals as either normal or abnormal. Even though the characteristics of a normal EEG are well defined, there are some factors, such as benign variants, that complicate this decision. However, neurologists can make this classification accurately by only examining the initial portion of the signal. Therefore, in this thesis, we explore the hypothesis that high performance machine classification of an EEG signal as abnormal can approach human performance using only the first few minutes of an EEG recording. The goal of this thesis is to establish a baseline for automated classification of abnormal adult EEGs using state of the art machine learning algorithms and a big data resource – The TUH EEG Corpus. A demographically balanced subset of the corpus was used to evaluate performance of the systems. The data was partitioned into a training set (1,387 normal and 1,398 abnormal files), and an evaluation set (150 normal and 130 abnormal files). A system based on hidden Markov Models (HMMs) achieved an error rate of 26.1%. The addition of a Stacked Denoising Autoencoder (SdA) post-processing step (HMM-SdA) further decreased the error rate to 24.6%. The overall best result (21.2% error rate) was achieved by a deep learning system that combined a Convolutional Neural Network and a Multilayer Perceptron (CNN-MLP). Even though the performance of our algorithm still lags human performance, which approaches a 1% error rate for this task, we have established an experimental paradigm that can be used to explore this application and have demonstrated a promising baseline using state of the art deep learning technology.
Temple University--Theses
36
Mennicke, Martin. « Simulation and interpretation for a voice-activated traffic information system ». Honors in the Major Thesis, University of Central Florida, 2003. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/328.
Texte intégralRésumé :
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.Bachelors
Engineering
Computer Engineering
37
Ševčík, Martin. « NEAR-INFRARED SPECTROSCOPY FOR REFUSE DERIVED FUEL : Classification of waste material components using hyperspectral imaging and feasibility study of inorganic chlorine content quantification ». Thesis, Mälardalens högskola, Akademin för ekonomi, samhälle och teknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-42376.
Texte intégralRésumé :
This degree project focused on examining new possible application of near-infrared (NIR) spectroscopy for quantitative and qualitative characterization of refuse derived fuel (RDF). Particularly, two possible applications were examined as part of the project. Firstly, use of NIR hyperspectral imaging for classification of common materials present in RDF. The classification was studied on artificial mixtures of materials commonly present in municipal solid waste and RDF. Data from hyperspectral camera was used as an input for machine learning models to train them, validate them, and test them. Three classification machine learning models were used in the project; partial least-square discriminant analysis (PLS-DA), support vector machine (SVM), and radial basis neural network (RBNN). Best results for classifying the materials into 11 distinct classes were reached for SVM (accuracy 94%), even though its high computational cost makes it not very suitable for real-time deployment. Second best result was reached for RBNN (91%) and the lowest accuracy was recorded for PLS-DA model (88%). On the other hand, the PLS-DA model was the fastest, being 10 times faster than the RBNN and 100 times faster than the SVM. NIR spectroscopy was concluded as a suitable method for identification of most common materials in RDF mix, except for incombustible materials like glass, metals, or ceramics. The second part of the project uncovered a potential in using NIR spectroscopy for identification of inorganic chlorine content in RDF. Experiments were performed on samples of textile impregnated with a water solution of kitchen salt representing NaCl as inorganic chlorine source. Results showed that contents of 0.2-1 wt.% of salt can be identified in absorbance spectra of the samples. Limitation appeared to be water content of the examined samples, as with too large amount of water in the sample, the influence of salt on NIR absorbance spectrum of water was too small to be recognized.FUDIPO
38
Moody, John Matali. « Process monitoring with restricted Boltzmann machines ». Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86467.
Texte intégralRésumé :
Thesis (MScEng)--Stellenbosch University, 2014.ENGLISH ABSTRACT: Process monitoring and fault diagnosis are used to detect abnormal events in processes. The early detection of such events or faults is crucial to continuous process improvement. Although principal component analysis and partial least squares are widely used for process monitoring and fault diagnosis in the metallurgical industries, these models are linear in principle; nonlinear approaches should provide more compact and informative models. The use of auto associative neural networks or auto encoders provide a principled approach for process monitoring. However, until very recently, these multiple layer neural networks have been difficult to train and have therefore not been used to any significant extent in process monitoring. With newly proposed algorithms based on the pre-training of the layers of the neural networks, it is now possible to train neural networks with very complex structures, i.e. deep neural networks. These neural networks can be used as auto encoders to extract features from high dimensional data. In this study, the application of deep auto encoders in the form of Restricted Boltzmann machines (RBM) to the extraction of features from process data is considered. These networks have mostly been used for data visualization to date and have not been applied in the context of fault diagnosis or process monitoring as yet. The objective of this investigation is therefore to assess the feasibility of using Restricted Boltzmann machines in various fault detection schemes. The use of RBM in process monitoring schemes will be discussed, together with the application of these models in automated control frameworks.
AFRIKAANSE OPSOMMING: Prosesmonitering en fout diagnose word gebruik om abnormale gebeure in prosesse op te spoor. Die vroeë opsporing van sulke gebeure of foute is noodsaaklik vir deurlopende verbetering van prosesse. Alhoewel hoofkomponent-analise en parsiële kleinste kwadrate wyd gebruik word vir prosesmonitering en fout diagnose in die metallurgiese industrieë, is hierdie modelle lineêr in beginsel; nie-lineêre benaderings behoort meer kompakte en insiggewende modelle te voorsien. Die gebruik van outo-assosiatiewe neurale netwerke of outokodeerders bied 'n beginsel gebaseerder benadering om dit te bereik. Hierdie veelvoudige laag neurale netwerke was egter tot onlangs moeilik om op te lei en is dus nie tot ʼn beduidende mate in die prosesmonitering gebruik nie. Nuwe, voorgestelde algoritmes, gebaseer op voorafopleiding van die lae van die neurale netwerke, maak dit nou moontlik om neurale netwerke met baie ingewikkelde strukture, d.w.s. diep neurale netwerke, op te lei. Hierdie neurale netwerke kan gebruik word as outokodeerders om kenmerke van hoë-dimensionele data te onttrek. In hierdie studie word die toepassing van diep outokodeerders in die vorm van Beperkte Boltzmann Masjiene vir die onttrekking van kenmerke van proses data oorweeg. Tot dusver is hierdie netwerke meestal vir data visualisering gebruik en dit is nog nie toegepas in die konteks van fout diagnose of prosesmonitering nie. Die doel van hierdie ondersoek is dus om die haalbaarheid van die gebruik van Beperkte Boltzmann Masjiene in verskeie foutopsporingskemas te assesseer. Die gebruik van Beperkte Boltzmann Masjiene se eienskappe in prosesmoniteringskemas sal bespreek word, tesame met die toepassing van hierdie modelle in outomatiese beheer raamwerke.
39
Castro, Jose R. « MODIFICATIONS TO THE FUZZY-ARTMAP ALGORITHM FOR DISTRIBUTED LEARNING IN LARGE DATA SETS ». Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4449.
Texte intégralRésumé :
The Fuzzy-ARTMAP (FAM) algorithm is one of the premier neural network architectures for classification problems. FAM can learn on line and is usually faster than other neural network approaches. Nevertheless the learning time of FAM can slow down considerably when the size of the training set increases into the hundreds of thousands. In this dissertation we apply data partitioning and network partitioning to the FAM algorithm in a sequential and parallel setting to achieve better convergence time and to efficiently train with large databases (hundreds of thousands of patterns). We implement our parallelization on a Beowulf clusters of workstations. This choice of platform requires that the process of parallelization be coarse grained. Extensive testing of all the approaches is done on three large datasets (half a million data points). One of them is the Forest Covertype database from Blackard and the other two are artificially generated Gaussian data with different percentages of overlap between classes. Speedups in the data partitioning approach reached the order of the hundreds without having to invest in parallel computation. Speedups on the network partitioning approach are close to linear on a cluster of workstations. Both methods allowed us to reduce the computation time of training the neural network in large databases from days to minutes. We prove formally that the workload balance of our network partitioning approaches will never be worse than an acceptable bound, and also demonstrate the correctness of these parallelization variants of FAM.Ph.D.
School of Electrical and Computer Engineering
Engineering and Computer Science
Electrical and Computer Engineering
40
Gauci, Jason. « Learning from geometry in learning for tactical and strategic decision domains ». Doctoral diss., University of Central Florida, 2010. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4607.
Texte intégralRésumé :
Artificial neural networks (ANNs) are an abstraction of the low-level architecture of biological brains that are often applied in general problem solving and function approximation. Neuroevolution (NE), i.e. the evolution of ANNs, has proven effective at solving problems in a variety of domains. Information from the domain is input to the ANN, which outputs its desired actions. This dissertation presents a new NE algorithm called Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT), based on a novel indirect encoding of ANNs. The key insight in HyperNEAT is to make the algorithm aware of the geometry in which the ANNs are embedded and thereby exploit such domain geometry to evolve ANNs more effectively. The dissertation focuses on applying HyperNEAT to tactical and strategic decision domains. These domains involve simultaneously considering short-term tactics while also balancing long-term strategies. Board games such as checkers and Go are canonical examples of such domains; however, they also include real-time strategy games and military scenarios. The dissertation details three proposed extensions to HyperNEAT designed to work in tactical and strategic decision domains. The first is an action selector ANN architecture that allows the ANN to indicate its judgements on every possible action all at once. The second technique is called substrate extrapolation. It allows learning basic concepts at a low resolution, and then increasing the resolution to learn more advanced concepts. The final extension is geometric game-tree pruning, whereby HyperNEAT can endow the ANN the ability to focus on specific areas of a domain (such as a checkers board) that deserve more inspection. The culminating contribution is to demonstrate the ability of HyperNEAT with these extensions to play Go, a most challenging game for artificial intelligence, by combining HyperNEAT with UCT.ID: 029050848; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2010.; Includes bibliographical references (p. 137-156).
Ph.D.
Doctorate
Department of Electrical Engineering and Computer Science
Engineering and Computer Science
41
D'Ambrosio, David B. « Multiagent learning through indirect encoding ». Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4930.
Texte intégralRésumé :
Designing a system of multiple, heterogeneous agents that cooperate to achieve a common goal is a difficult task, but it is also a common real-world problem. Multiagent learning addresses this problem by training the team to cooperate through a learning algorithm. However, most traditional approaches treat multiagent learning as a combination of multiple single-agent learning problems. This perspective leads to many inefficiencies in learning such as the problem of reinvention, whereby fundamental skills and policies that all agents should possess must be rediscovered independently for each team member. For example, in soccer, all the players know how to pass and kick the ball, but a traditional algorithm has no way to share such vital information because it has no way to relate the policies of agents to each other. In this dissertation a new approach to multiagent learning that seeks to address these issues is presented. This approach, called multiagent HyperNEAT, represents teams as a pattern of policies rather than individual agents. The main idea is that an agent's location within a canonical team layout (such as a soccer team at the start of a game) tends to dictate its role within that team, called the policy geometry. For example, as soccer positions move from goal to center they become more offensive and less defensive, a concept that is compactly represented as a pattern. The first major contribution of this dissertation is a new method for evolving neural network controllers called HyperNEAT, which forms the foundation of the second contribution and primary focus of this work, multiagent HyperNEAT. Multiagent learning in this dissertation is investigated in predator-prey, room-clearing, and patrol domains, providing a real-world context for the approach.; Interestingly, because the teams in multiagent HyperNEAT are represented as patterns they can scale up to an infinite number of multiagent policies that can be sampled from the policy geometry as needed. Thus the third contribution is a method for teams trained with multiagent HyperNEAT to dynamically scale their size without further learning. Fourth, the capabilities to both learn and scale in multiagent HyperNEAT are compared to the traditional multiagent SARSAlambda] approach in a comprehensive study. The fifth contribution is a method for efficiently learning and encoding multiple policies for each agent on a team to facilitate learning in multi-task domains. Finally, because there is significant interest in practical applications of multiagent learning, multiagent HyperNEAT is tested in a real-world military patrolling application with actual Khepera III robots. The ultimate goal is to provide a new perspective on multiagent learning and to demonstrate the practical benefits of training heterogeneous, scalable multiagent teams through generative encoding.ID: 029809867; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2011.; Includes bibliographical references (p. 150-173).
Ph.D.
Doctorate
Electrical Engineering and Computer Science
Engineering and Computer Science
42
Martinenko, Evgeny. « Prediction of survival of early stages lung cancer patients based on ER beta cellular expressions and epidemiological data ». Master's thesis, University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4796.
Texte intégralRésumé :
We attempted a mathematical model for expected prognosis of lung cancer patients based on a multivariate analysis of the values of ER-interacting proteins (ERbeta) and a membrane bound, glycosylated phosphoprotein MUC1), and patients clinical data recorded at the time of initial surgery. We demonstrate that, even with the limited sample size available to use, combination of clinical and biochemical data (in particular, associated with ERbeta and MUC1) allows to predict survival of lung cancer patients with about 80% accuracy while prediction on the basis of clinical data only gives about 70% accuracy. The present work can be viewed as a pilot study on the subject: since results confirm that ER-interacting proteins indeed inuence lung cancer patients' survival, more data is currently being collected.ID: 030646185; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (M.S.)--University of Central Florida, 2011.; Includes bibliographical references (p. 32-33).
M.S.
Masters
Mathematics
Sciences
Mathematical Science
43
Cakit, Erman. « Investigating The Relationship Between Adverse Events and Infrastructure Development in an Active War Theater Using Soft Computing Techniques ». Doctoral diss., University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5777.
Texte intégralRésumé :
The military recently recognized the importance of taking sociocultural factors into consideration. Therefore, Human Social Culture Behavior (HSCB) modeling has been getting much attention in current and future operational requirements to successfully understand the effects of social and cultural factors on human behavior. There are different kinds of modeling approaches to the data that are being used in this field and so far none of them has been widely accepted. HSCB modeling needs the capability to represent complex, ill-defined, and imprecise concepts, and soft computing modeling can deal with these concepts. There is currently no study on the use of any computational methodology for representing the relationship between adverse events and infrastructure development investments in an active war theater. This study investigates the relationship between adverse events and infrastructure development projects in an active war theater using soft computing techniques including fuzzy inference systems (FIS), artificial neural networks (ANNs), and adaptive neuro-fuzzy inference systems (ANFIS) that directly benefits from their accuracy in prediction applications. Fourteen developmental and economic improvement project types were selected based on allocated budget values and a number of projects at different time periods, urban and rural population density, and total adverse event numbers at previous month selected as independent variables. A total of four outputs reflecting the adverse events in terms of the number of people killed, wounded, hijacked, and total number of adverse events has been estimated. For each model, the data was grouped for training and testing as follows: years between 2004 and 2009 (for training purpose) and year 2010 (for testing). Ninety-six different models were developed and investigated for Afghanistan and the country was divided into seven regions for analysis purposes. Performance of each model was investigated and compared to all other models with the calculated mean absolute error (MAE) values and the prediction accuracy within &"177;1 error range (difference between actual and predicted value). Furthermore, sensitivity analysis was performed to determine the effects of input values on dependent variables and to rank the top ten input parameters in order of importance. According to the the results obtained, it was concluded that the ANNs, FIS, and ANFIS are useful modeling techniques for predicting the number of adverse events based on historical development or economic projects' data. When the model accuracy was calculated based on the MAE for each of the models, the ANN had better predictive accuracy than FIS and ANFIS models in general as demonstrated by experimental results. The percentages of prediction accuracy with values found within ± error range around 90%. The sensitivity analysis results show that the importance of economic development projects varies based on the regions, population density, and occurrence of adverse events in Afghanistan. For the purpose of allocating resources and development of regions, the results can be summarized by examining the relationship between adverse events and infrastructure development in an active war theater; emphasis was on predicting the occurrence of events and assessing the potential impact of regional infrastructure development efforts on reducing number of such events.Ph.D.
Doctorate
Industrial Engineering and Management Systems
Engineering and Computer Science
Industrial Engineering
44
Narmack, Kirilll. « Dynamic Speed Adaptation for Curves using Machine Learning ». Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-233545.
Texte intégralRésumé :
The vehicles of tomorrow will be more sophisticated, intelligent and safe than the vehicles of today. The future is leaning towards fully autonomous vehicles. This degree project provides a data driven solution for a speed adaptation system that can be used to compute a vehicle speed for curves, suitable for the underlying driving style of the driver, road properties and weather conditions. A speed adaptation system for curves aims to compute a vehicle speed suitable for curves that can be used in Advanced Driver Assistance Systems (ADAS) or in Autonomous Driving (AD) applications. This degree project was carried out at Volvo Car Corporation. Literature in the field of speed adaptation systems and factors affecting the vehicle speed in curves was reviewed. Naturalistic driving data was both collected by driving and extracted from Volvo's data base and further processed. A novel speed adaptation system for curves was invented, implemented and evaluated. This speed adaptation system is able to compute a vehicle speed suitable for the underlying driving style of the driver, road properties and weather conditions. Two different artificial neural networks and two mathematical models were used to compute the desired vehicle speed in curves. These methods were compared and evaluated.Morgondagens fordon kommer att vara mer sofistikerade, intelligenta och säkra än dagens fordon. Framtiden lutar mot fullständigt autonoma fordon. Detta examensarbete tillhandahåller en datadriven lösning för ett hastighetsanpassningssystem som kan beräkna ett fordons hastighet i kurvor som är lämpligt för förarens körstil, vägens egenskaper och rådande väder. Ett hastighetsanpassningssystem för kurvor har som mål att beräkna en fordonshastighet för kurvor som kan användas i Advanced Driver Assistance Systems (ADAS) eller Autonomous Driving (AD) applikationer. Detta examensarbete utfördes på Volvo Car Corporation. Litteratur kring hastighetsanpassningssystem samt faktorer som påverkar ett fordons hastighet i kurvor studerades. Naturalistisk bilkörningsdata samlades genom att köra bil samt extraherades från Volvos databas och bearbetades. Ett nytt hastighetsanpassningssystem uppfanns, implementerades samt utvärderades. Hastighetsanpassningssystemet visade sig vara kapabelt till att beräkna en lämplig fordonshastighet för förarens körstil under rådande väderförhållanden och vägens egenskaper. Två olika artificiella neuronnätverk samt två matematiska modeller användes för att beräkna fordonets hastighet. Dessa metoder jämfördes och utvärderades.
45
Hoover, Amy K. « Neat drummer : computer-generated drum tracks ». Honors in the Major Thesis, University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1089.
Texte intégralRésumé :
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.Bachelors
Engineering and Computer Science
Computer Science
46
Verbancsics, Phillip. « Effective task transfer through indirect encoding ». Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4716.
Texte intégralRésumé :
An important goal for machine learning is to transfer knowledge between tasks. For example, learning to play RoboCup Keepaway should contribute to learning the full game of RoboCup soccer. Often approaches to task transfer focus on transforming the original representation to fit the new task. Such representational transformations are necessary because the target task often requires new state information that was not included in the original representation. In RoboCup Keepaway, changing from the 3 vs. 2 variant of the task to 4 vs. 3 adds state information for each of the new players. In contrast, this dissertation explores the idea that transfer is most effective if the representation is designed to be the same even across different tasks. To this end, (1) the bird's eye view (BEV) representation is introduced, which can represent different tasks on the same two-dimensional map. Because the BEV represents state information associated with positions instead of objects, it can be scaled to more objects without manipulation. In this way, both the 3 vs. 2 and 4 vs. 3 Keepaway tasks can be represented on the same BEV, which is (2) demonstrated in this dissertation.Yet a challenge for such representation is that a raw two-dimensional map is high-dimensional and unstructured. This dissertation demonstrates how this problem is addressed naturally by the Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach. HyperNEAT evolves an indirect encoding, which compresses the representation by exploiting its geometry. The dissertation then explores further exploiting the power of such encoding, beginning by (3) enhancing the configuration of the BEV with a focus on modularity. The need for further nonlinearity is then (4) investigated through the addition of hidden nodes. Furthermore, (5) the size of the BEV can be manipulated because it is indirectly encoded.; Thus the resolution of the BEV, which is dictated by its size, is increased in precision and culminates in a HyperNEAT extension that is expressed at effectively infinite resolution. Additionally, scaling to higher resolutions through gradually increasing the size of the BEV is explored. Finally, (6) the ambitious problem of scaling from the Keepaway task to the Half-field Offense task is investigated with the BEV. Overall, this dissertation demonstrates that advanced representations in conjunction with indirect encoding can contribute to scaling learning techniques to more challenging tasks, such as the Half-field Offense RoboCup soccer domain.ID: 030646258; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2011.; Includes bibliographical references (p. 144-152).
Ph.D.
Doctorate
Computer Science
Engineering and Computer Science
Computer Science
47
Siddiqui, Muazzam Ahmed. « HIGH PERFORMANCE DATA MINING TECHNIQUES FOR INTRUSION DETECTION ». Master's thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4435.
Texte intégralRésumé :
The rapid growth of computers transformed the way in which information and data was stored. With this new paradigm of data access, comes the threat of this information being exposed to unauthorized and unintended users. Many systems have been developed which scrutinize the data for a deviation from the normal behavior of a user or system, or search for a known signature within the data. These systems are termed as Intrusion Detection Systems (IDS). These systems employ different techniques varying from statistical methods to machine learning algorithms. Intrusion detection systems use audit data generated by operating systems, application softwares or network devices. These sources produce huge amount of datasets with tens of millions of records in them. To analyze this data, data mining is used which is a process to dig useful patterns from a large bulk of information. A major obstacle in the process is that the traditional data mining and learning algorithms are overwhelmed by the bulk volume and complexity of available data. This makes these algorithms impractical for time critical tasks like intrusion detection because of the large execution time. Our approach towards this issue makes use of high performance data mining techniques to expedite the process by exploiting the parallelism in the existing data mining algorithms and the underlying hardware. We will show that how high performance and parallel computing can be used to scale the data mining algorithms to handle large datasets, allowing the data mining component to search a much larger set of patterns and models than traditional computational platforms and algorithms would allow. We develop parallel data mining algorithms by parallelizing existing machine learning techniques using cluster computing. These algorithms include parallel backpropagation and parallel fuzzy ARTMAP neural networks. We evaluate the performances of the developed models in terms of speedup over traditional algorithms, prediction rate and false alarm rate. Our results showed that the traditional backpropagation and fuzzy ARTMAP algorithms can benefit from high performance computing techniques which make them well suited for time critical tasks like intrusion detection.M.S.
School of Computer Science
Engineering and Computer Science
Computer Science
48
Reeder, John. « Life Long Learning in Sparse Learning Environments ». Doctoral diss., University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5845.
Texte intégralRésumé :
Life long learning is a machine learning technique that deals with learning sequential tasks over time. It seeks to transfer knowledge from previous learning tasks to new learning tasks in order to increase generalization performance and learning speed. Real-time learning environments in which many agents are participating may provide learning opportunities but they are spread out in time and space outside of the geographical scope of a single learning agent. This research seeks to provide an algorithm and framework for life long learning among a network of agents in a sparse real-time learning environment. This work will utilize the robust knowledge representation of neural networks, and make use of both functional and representational knowledge transfer to accomplish this task. A new generative life long learning algorithm utilizing cascade correlation and reverberating pseudo-rehearsal and incorporating a method for merging divergent life long learning paths will be implemented.Ph.D.
Doctorate
Electrical Engineering and Computing
Engineering and Computer Science
Computer Engineering
49
Lehman, Joel. « Evolution Through the Search for Novelty ». Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5394.
Texte intégralRésumé :
I present a new approach to evolutionary search called novelty search, wherein only behavioral novelty is rewarded, thereby abstracting evolution as a search for novel forms. This new approach contrasts with the traditional approach of rewarding progress towards the objective through an objective function. Although they are designed to light a path to the objective, objective functions can instead deceive search into converging to dead ends called local optima. As a significant problem in evolutionary computation, deception has inspired many techniques designed to mitigate it. However, nearly all such methods are still ultimately susceptible to deceptive local optima because they still measure progress with respect to the objective, which this dissertation will show is often a broken compass. Furthermore, although novelty search completely abandons the objective, it counterintuitively often outperforms methods that search directly for the objective in deceptive tasks and can induce evolutionary dynamics closer in spirit to natural evolution. The main contributions are to (1) introduce novelty search, an example of an effective search method that is not guided by actively measuring or encouraging objective progress; (2) validate novelty search by applying it to biped locomotion; (3) demonstrate novelty search's benefits for evolvability (i.e. the ability of an organism to further evolve) in a variety of domains; (4) introduce an extension of novelty search called minimal criteria novelty search that brings a new abstraction of natural evolution to evolutionary computation (i.e. evolution as a search for many ways of meeting the minimal criteria of life); (5) present a second extension of novelty search called novelty search with local competition that abstracts evolution instead as a process driven towards diversity with competition playing a subservient role; and (6) evolve a diversity of functional virtual creatures in a single run as a culminating application of novelty search with local competition. Overall these contributions establish novelty search as an important new research direction for the field of evolutionary computation.ID: 031001278; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Adviser: Kenneth O. Stanley.; Title from PDF title page (viewed February 25, 2013).; Thesis (Ph.D.)--University of Central Florida, 2012.; Includes bibliographical references (p. 177-198).
Ph.D.
Doctorate
Computer Science
Engineering and Computer Science
Computer Science
50
Vrábel, Jakub. « Popis Restricted Boltzmann machine metody ve vztahu se statistickou fyzikou a jeho následné využití ve zpracování spektroskopických dat ». Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2019. http://www.nusl.cz/ntk/nusl-402522.
Texte intégralRésumé :
Práca sa zaoberá spojeniami medzi štatistickou fyzikou a strojovým učením s dôrazom na základné princípy a ich dôsledky. Ďalej sa venuje obecným vlastnostiam spektroskopických dát a ich zohľadnení pri pokročilom spracovaní dát. Začiatok práce je venovaný odvodeniu partičnej sumy štatistického systému a štúdiu Isingovho modelu pomocou "mean field" prístupu. Následne, popri základnom úvode do strojového učenia, je ukázaná ekvivalencia medzi Isingovým modelom a Hopfieldovou sieťou - modelom strojového učenia. Na konci teoretickej časti je z Hopfieldovej siete odvodený model Restricted Boltzmann Machine (RBM). Vhodnosť použitia RBM na spracovanie spektroskopických dát je diskutovaná a preukázaná na znížení dimenzie týchto dát. Výsledky sú porovnané s bežne používanou Metódou Hlavných Komponent (PCA), spolu so zhodnotením prístupu a možnosťami ďalšieho zlepšovania.