Made available in DSpace on 2014-12-17T14:55:21Z (GMT). No. of bitstreams: 1 MarceloRBGV_TESE.pdf: 4018928 bytes, checksum: 7940c018115fd94c74a5dbbd7d3f7fb6 (MD5) Previous issue date: 2014-06-27 / The industries are getting more and more rigorous, when security is in question, no matter is to avoid financial damages due to accidents and low productivity, or when it s related to the environment protection. It was thinking about great world accidents around the world involving aircrafts and industrial process (nuclear, petrochemical and so on) that we decided to invest in systems that could detect fault and diagnosis (FDD) them. The FDD systems can avoid eventual fault helping man on the maintenance and exchange of defective equipments. Nowadays, the issues that involve detection, isolation, diagnose and the controlling of tolerance fault are gathering strength in the academic and industrial environment. It is based on this fact, in this work, we discuss the importance of techniques that can assist in the development of systems for Fault Detection and Diagnosis (FDD) and propose a hybrid method for FDD in dynamic systems. We present a brief history to contextualize the techniques used in working environments. The detection of fault in the proposed system is based on state observers in conjunction with other statistical techniques. The principal idea is to use the observer himself, in addition to serving as an analytical redundancy, in allowing the creation of a residue. This residue is used in FDD. A signature database assists in the identification of system faults, which based on the signatures derived from trend analysis of the residue signal and its difference, performs the classification of the faults based purely on a decision tree. This FDD system is tested and validated in two plants: a simulated plant with coupled tanks and didactic plant with industrial instrumentation. All collected results of those tests will be discussed / As ind?strias est?o cada vez mais rigorosas quando o assunto ? seguran?a, tanto para evitar preju?zos financeiros com acidentes e baixa produtividade, quanto para preservar o meio ambiente. Diante dos grandes acidentes em todo o mundo envolvendo aeronaves e processos industriais (nucleares, petroqu?micos etc) procurou-se investir em sistemas que pudessem detectar e diagnosticar falhas (FDD-Fault Detection and Diagnosis). Os sistemas FDD podem evitar eventuais falhas auxiliando o homem na manuten??o e troca de equipamentos defeituosos. Nos dias de hoje os assuntos que envolvem detec??o, isolamento, identifica??o e diagn?stico de falhas est?o ganhando for?a no meio acad?mico e industrial. Diante deste impulso, neste trabalho ser? discutido a import?ncia do estudo de t?cnicas que possam auxiliar o desenvolvimento de sistemas de detec??o e diagn?stico de falhas e proposto um m?todo h?brido para a detec??o e diagn?stico de falhas em sistemas din?micos. Um breve hist?rico ? apresentado de forma a contextualizar as t?cnicas utilizadas no trabalho. A detec??o de falhas pelo sistema proposto ? baseada em observadores de estado juntamente com outras t?cnicas estat?sticas. A ideia principal ? utilizar o pr?prio observador, para al?m de servir como redund?ncia anal?tica, permitir a cria??o de um res?duo que ser? utilizado na detec??o da falha e tamb?m no seu diagn?stico. Um banco de assinaturas auxiliar? o sistema de identifica??o de falhas, que, baseado nas assinaturas oriundas das an?lises de tend?ncia do sinal do res?duo e sua derivada, ir? realizar a classifica??o das falhas baseada em uma ?rvore de decis?o. Este sistema FDD ser? submetido a alguns testes e valida??es em duas plantas: uma planta simulada de tanques acoplados e em uma planta did?tica com instrumenta??o industrial. Os resultados colhidos desses ensaios se mostraram satisfat?rios para um grupo de falhas testadas e ser?o discutidos no decorrer do trabalho

Made available in DSpace on 2016-03-15T19:37:46Z (GMT). No. of bitstreams: 1 Antonio Eduardo Rodrigues de Souza.pdf: 1430416 bytes, checksum: 7625e34085fd9ad09014886b876642c3 (MD5) Previous issue date: 2013-08-27 / Economic globalization has made products and services markets more competitive, demanding a better qualification of manpower. Consequently, companies are in need of best qualified professionals to meet specific demands. In this context, specialization courses options have been sought by professionals to acquire and update knowledge. However, diversification of courses offered by various institutions in various areas, targeted to specific audiences or general, or the lack of objective information, hinder the understanding of the important factors in the decision to be taken by a candidate. A poorly chosen option may incur factors that can trigger the change or even dropping out of the course. The topic is current and relevant to Higher Education Institutions (HEIs), showing the importance of offering specialized courses that are aligned to the skills of educational institutions and the interests of the professional training and retraining. Therefore, this paper proposes to study professional factors that influence candidates in choosing a course, and develop a recommendation model, using artificial intelligence techniques to practical use in HEIs, which assists applicants in the choice of courses, as well as serve as support and guidance to staff in the selection of candidates. It was applied a methodology based on processes Knowledge Discovery in Databases (KDD) and Cross-Industry Standard Process for Data Mining (CRISP-DM) in the evaluation of the historical data of candidates freshmen at a private university in the city of São Paulo, and proposed a recommendation model, which will identify the most suitable course of a candidate's profile, using a technique of data mining based on decision trees for the discovery of relevant knowledge from database. The completion of this project has allowed to propose courses that would be more suitable to professional profiles of the candidates, based on the professional and educational historical information which were considered more important for the candidate selection. It is expected, therefore, that the counseling service will become more accurate and more responsive to the selection of candidates, assisting to reduce the number of abandonments, dropouts or changes in specialization courses offered by the studied university. / A globalização da economia tornou os mercados de produtos e serviços mais competitivos, demandando uma melhor qualificação da mão-de-obra. Consequentemente, as empresas têm necessitado de profissionais mais bem qualificados para atender a demandas específicas. Neste contexto, os cursos de especialização têm sido opções procuradas por profissionais para adquirir e atualizar o conhecimento. Contudo, a diversificação de cursos, oferecidos por diversas instituições de ensino, nas mais variadas áreas, direcionados a públicos específicos ou gerais, ou a falta de informações objetivas, dificultam a compreensão de fatores importantes na decisão a ser tomada por um candidato. Uma opção mal escolhida pode incorrer em fatores que podem desencadear a mudança ou até mesmo a desistência do curso. O tema é atual e relevante para as Instituições de Ensino Superior (IES), mostrando a importância de se ofertar cursos de especialização que estejam alinhados às competências das instituições de ensino e aos interesses de capacitação e requalificação do profissional. Portanto, o presente trabalho propõe estudar as características profissionais que influenciam os candidatos na escolha de um curso, e desenvolver um modelo de recomendação, utilizando-se técnicas de inteligência artificial, para uso prático nas IES, que auxilie os candidatos na escolha dos cursos, assim como sirva de apoio aos coordenadores na orientação e seleção dos candidatos. Será aplicada uma metodologia baseada nos processos Knowledge Discovery in Databases (KDD) e CRoss-Industry Standard Process for Data Mining (CRISPDM) para análise e avaliação dos dados históricos de candidatos ingressantes em uma universidade particular, na cidade de São Paulo, e proposto um modelo de recomendação, que identificará o curso mais adequado ao perfil de um candidato, utilizando-se uma técnica de mineração de dados baseada em árvores de decisão para a descoberta de conhecimento relevante do banco de dados. A conclusão do projeto permitiu propor cursos que seriam mais adequados aos perfis profissionais dos candidatos, tomando-se como base as informações do histórico profissional e educacional que foram consideradas mais importantes para a seleção dos candidatos. Espera-se, com isso, tornar mais preciso o serviço de aconselhamento de cursos, e mais ágil a seleção de candidatos, contribuindo para a redução do número de abandonos, desistências ou mudanças nos cursos de especialização oferecidos pela universidade estudada.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-03-07T14:25:21Z No. of bitstreams: 1 victorteixeirademelomayrink.pdf: 2587774 bytes, checksum: 1319cc37a15480796050b618b4d7e5f7 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-03-07T15:06:57Z (GMT) No. of bitstreams: 1 victorteixeirademelomayrink.pdf: 2587774 bytes, checksum: 1319cc37a15480796050b618b4d7e5f7 (MD5) / Made available in DSpace on 2017-03-07T15:06:57Z (GMT). No. of bitstreams: 1 victorteixeirademelomayrink.pdf: 2587774 bytes, checksum: 1319cc37a15480796050b618b4d7e5f7 (MD5) Previous issue date: 2016-08-31 / FAPEMIG - Fundação de Amparo à Pesquisa do Estado de Minas Gerais / O armazenamento de energia elétrica em larga escala ainda não é viável devido a restrições técnicas e econômicas. Portanto, toda energia consumida deve ser produzida instantaneamente; não é possível armazenar o excesso de produção, ou tampouco cobrir eventuais faltas de oferta com estoques de segurança, mesmo que por um curto período de tempo. Consequentemente, um dos principais desafios do planejamento energético consiste em realizar previsões acuradas para as demandas futuras. Neste trabalho, apresentamos um modelo de previsão para o consumo de energia elétrica a curto prazo. A metodologia utilizada compreende a construção de um comitê de previsão, por meio da aplicação do algoritmo Gradient Boosting em combinação com modelos de árvores de decisão e a técnica de amortecimento exponencial. Esta estratégia compreende um método de aprendizado supervisionado que ajusta o modelo de previsão com base em dados históricos do consumo de energia, das temperaturas registradas e de variáveis de calendário. Os modelos propostos foram testados em duas bases de dados distintas e demonstraram um ótimo desempenho quando comparados com resultados publicados em outros trabalhos recentes. / The storage of electrical energy is still not feasible on a large scale due to technical and economic issues. Therefore, all energy to be consumed must be produced instantly; it is not possible to store the production leftover, or either to cover any supply shortages with safety stocks, even for a short period of time. Thus, one of the main challenges of energy planning consists in computing accurate forecasts for the future demand. In this paper, we present a model for short-term load forecasting. The methodology consists in composing a prediction comitee by applying the Gradient Boosting algorithm in combination with decision tree models and the exponential smoothing technique. This strategy comprises a supervised learning method that adjusts the forecasting model based on historical energy consumption data, the recorded temperatures and calendar variables. The proposed models were tested in two di erent datasets and showed a good performance when compared with results published in recent papers.

Submitted by isabela.moljf@hotmail.com (isabela.moljf@hotmail.com) on 2017-08-15T12:01:50Z No. of bitstreams: 1 cinaradejesussantos.pdf: 4566569 bytes, checksum: bddc2ea97276541c0a8ad30a371102d1 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-08-15T12:02:54Z (GMT) No. of bitstreams: 1 cinaradejesussantos.pdf: 4566569 bytes, checksum: bddc2ea97276541c0a8ad30a371102d1 (MD5) / Made available in DSpace on 2017-08-15T12:02:54Z (GMT). No. of bitstreams: 1 cinaradejesussantos.pdf: 4566569 bytes, checksum: bddc2ea97276541c0a8ad30a371102d1 (MD5) Previous issue date: 2017-03-07 / Classificadores são separadores de grupos que mediante determinadas características organiza os dados agrupando elementos que apresentem traços semelhantes, o que permite reconhecimento de padrões e identificação de elementos que não se encaixam. Esse procedimento de classificação e separação pode ser observado em processos do cotidiano como exames (clínicos ou por imagem), separadores automáticos de grãos na agroindústria, identificador de probabilidades, reconhecedores de caracteres, identificação biométrica - digital, íris, face, etc. O estudo aqui proposto utiliza uma base de dados do Ministério do Desenvolvimento Social e Combate a Fome (MDS), contendo informações sobre beneficiários do Programa Bolsa Família (PBF), onde contamos com registros descritores do ambiente domiciliar, grau de instrução dos moradores do domicílio assim como o uso de serviços de saúde pelos mesmos e informações de cunho financeiro (renda e gastos das famílias). O foco deste estudo não visa avaliar o PBF, mas o comportamento de classificadores aplicados sobre bases de caráter social, pois estas apresentam certas particularidades. Sobre as variáveis que descrevem uma família como beneficiária ou não do PBF, testamos três algoritmos classificadores - regressão logística, árvore binária de decisão e rede neural artificial em múltiplas camadas. O desempenho destes processos foi medido a partir de métricas decorrentes da chamada matriz de confusão. Como os erros e acertos de uma classe n˜ao s˜ao os complementares da outra classe é de suma importância que ambas sejam corretamente identificadas. Um desempenho satisfatório para ambas as classes em um mesmo cenário não foi alçado - a identificação do grupo minoritário apresentou baixa eficiência mesmo com reamostragem seguida de reaplicação dos três processos classificatórios escolhidos, o que aponta para a necessidade de novos experimentos. / Classifiers are group separators that, by means of certain characteristics, organize the data by grouping elements that present similar traits, which allows pattern recognition and the identification of elements that do not fit. Classification procedures can be used in everyday processes such as clinical or imaging exams, automatic grain separators in agribusiness, probability identifiers, character recognition, biometric identification by thumbprints, iris, face, etc. This study uses a database of the Ministry of Social Development and Fight against Hunger (MDS), containing information on beneficiaries of the Bolsa Fam´ılia Program (PBF). The data describe the home environment, the level of education of the residents of the household, their use of public health services, and some financial information (income and expenses of families). The focus of this study is not to evaluate the PBF, but to analyze the performance of the classifiers when applied to bases of social character, since these have certain peculiarities. We have tested three classification algorithms - logistic regression, binary decision trees and artificial neural networks. The performance of these algorithms was measured by metrics computed from the so-called confusion matrix. As the probabilities of right and wrong classifications of a class are not complementary, it is of the utmost importance that both are correctly identified. A good evaluation could not be archive for both classes in a same scenario was not raised - the identification of the minority group showed low efficiency even with resampling followed by reapplication of the three classificatory processes chosen, which points to the need for new experiments.

Orientadores: Laercio Luis Vendite, Stanley Robson de Medeiros Oliveira / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica / Made available in DSpace on 2018-08-23T23:19:05Z (GMT). No. of bitstreams: 1 Chahine_GabrielJorge_M.pdf: 1229228 bytes, checksum: fffd253696b5a9dee9870ae1910256e5 (MD5) Previous issue date: 2013 / Resumo: Dos cânceres do trato urinário, os mais comuns são os de Próstata e de Bexiga, sendo o primeiro a causa mais comum de morte por câncer e o carcinoma mais comum para homens. Nosso objetivo nesse trabalho é desenvolver modelos para determinar se um dado tumor irá aumentar e invadir outros órgãos ou se não apresenta esse risco e permanecerá contido. Para isso, coletamos dados de pacientes com câncer de próstata e analisamos quais variáveis mais impactam para ocorrência de metástase. Com isso construímos modelos de classificação, que, com os dados de um determinado paciente, detectam se naquele caso haverá ou não metástase à distância. Nesse trabalho apresentamos modelos para predição de ocorrência de metástases em câncer de próstata. As simulações foram feitas com dados cedidos pelo prof. Dr. Ubirajara Ferreira, responsável pela disciplina de Urologia da FCM da Unicamp, do Hospital das Clinicas - UNICAMP / Abstract: Of all the cancers of the urinary tract, the most common are the Prostate and Bladder. The first being the most common cause of death by cancer and the most common carcinoma in men. Our goal in this work is to develop predictive models to determine whether a given tumor will grow and invade other organs or, if it doesn't present this risk and will remain constrained. To do this, we collected data from patients with prostate cancer and assessed which variables were the most responsible for the occurrence of metastasis. Hence, we built predictive models that, with the data of a given patient, are able detect whether or not a distant metastasis would occur in. In this work we present models to predict the occurrence of metastasis in prostate cancer. The simulations were made with the data given by prof. Dr. Ubirajara Ferreira, responsible for the disciplines of Urology from Unicamp's Faculty of Medical Sciences / Mestrado / Matematica Aplicada e Computacional / Mestre em Matemática Aplicada e Computacional

Orientador: Elizabete Jordão / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Quimica / Made available in DSpace on 2018-08-04T05:23:42Z (GMT). No. of bitstreams: 1 Mattos_JoaoRobertoLoureirode_D.pdf: 9136301 bytes, checksum: deb65dc9955b906cab0f31f73cd5ad35 (MD5) Previous issue date: 2005 / Resumo: O objetivo do presente trabalho consiste no desenvolvimento de um modelo, dirigido para Instituições Científicas e Tecnológicas ICT, que combina a gerência de projetos com técnicas de gestão da inovação. Este estudo inclui uma avaliação de aplicabilidade do modelo proposto por meio de um estudo de caso em um projeto de gerência de rejeitos na área de Engenharia Química, especificamente, na gerência de combustíveis queimados de reatores nucleares de pesquisa. O modelo desenvolvido para gerência de projetos é baseado em práticas e ferramentas internacionalmente consagradas, adaptadas à cultura das ICT. Na abordagem proposta neste estudo, a inovação nas ICT está sendo considerada como diretamente associada à geração das alternativas de projetos, seguida da avaliação e seleção a solução preferida, se revestem de alta relevância, pois é aqui que se considera que existe o maior potencial para a sistematização da inovação nas ICT. É na geração e seleção de alternativas de projetos e tecnologias onde se define se dada solução será um produto adequado, inovador ou inservível. O modelo proposto é operacionalizado por meio de árvores de decisão que orientam o usuário na escolha de procedimentos e documentos padronizados, adaptados aos perfis de projetos usualmente desenvolvidos nas ICT... Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital / Abstract: The objective of the preset work consists in the development of a model that combines project management with innovation management techniques for Scientific and Technological Institutions ¿ ICT. A case study was performed in order to evaluate the applicability of this model in a project of waste management in the Chemical Engineering area, specifically on management of spent fuel from nuclear research reactors. The project management model developed in this study is based on practices and tools internationally recognized, tailored for the ICT culture. In the scope of this study, the innovation in the ICT is being considered as directly associated to the generation of project alternatives and their correspondent technologies. The stages of alternatives generation followed by the evaluation and selection of the preferred solution has high relevance, because it is here that it is considered that exists the greater potential for the systematization of the innovation in the ICT. Is in the generation and selection of project alternatives and their correspondent techonologies where is defined if a given solution will be a standard, innovative or useless product. Decision trees support the execution of the proposed model and provide guidance to the user in the choice of procedures and templates, which are specially adapted to the profiles of the work of the users by means of a standard and repeatable procedures, with potential to lead to a better efficiency... Note: The complete abstract is available with the full electronic digital thesis or dissertations / Doutorado / Sistemas de Processos Quimicos e Informatica / Doutor em Engenharia Química

Un questionnaire adaptatif fournit une mesure valide de la qualité de vie des patients et réduit le nombre d'items à remplir. Cette approche est dépendante des modèles utilisés, basés sur des hypothèses parfois non vérifiables. Nous proposons une approche alternative basée sur les arbres de décision. Cette approche n'est basée sur aucune hypothèse et requiert moins de temps de calcul pour l'administration des items. Nous présentons différentes simulations qui démontrent la pertinence de notre approche. Nous présentons une méthode de classification non supervisée appelée CUBT. CUBT comprend trois étapes pour obtenir une partition optimale d'un jeu de données. La première étape construit un arbre en divisant récursivement le jeu de données. La deuxième étape regroupe les paires de noeuds terminaux de l'arbre. La troisième étape agrège des nœuds terminaux qui ne sont pas issus de la même division. Différentes simulations sont présentés pour comparer CUBT avec d'autres approches. Nous définissons également des heuristiques concernant le choix des paramètres de CUBT. CUBT identifie les variables qui sont actives dans la construction de l'arbre. Cependant, bien que certaines variables peuvent être sans importance, elles peuvent être compétitives pour les variables actives. Il est essentiel de classer les variables en fonction d'un score d'importance pour déterminer leur pertinence dans un modèle donné. Nous présentons une méthode pour mesurer l'importance des variables basée sur CUBT et les divisions binaires compétitives pour définir un score d'importance des variables. Nous analysons l'efficacité et la stabilité de ce nouvel indice, en le comparant à d'autres méthodes. / An adaptive test provides a valid measure of quality of life of patients and reduces the number of items to be filled. This approach is dependent on the models used, sometimes based on unverifiable assumptions. We propose an alternative approach based on decision trees. This approach is not based on any assumptions and requires less calculation time for item administration. We present different simulations that demonstrate the relevance of our approach.We present an unsupervised classification method called CUBT. CUBT includes three steps to obtain an optimal partition of a data set. The first step grows a tree by recursively dividing the data set. The second step groups together the pairs of terminal nodes of the tree. The third step aggregates terminal nodes that do not come from the same split. Different simulations are presented to compare CUBT with other approaches. We also define heuristics for the choice of CUBT parameters.CUBT identifies the variables that are active in the construction of the tree. However, although some variables may be irrelevant, they may be competitive for the active variables. It is essential to rank the variables according to an importance score to determine their relevance in a given model. We present a method to measure the importance of variables based on CUBT and competitive binary splis to define a score of variable importance. We analyze the efficiency and stability of this new index, comparing it with other methods.

The replication of human intelligence, learning and reasoning by means of computer algorithms is termed Artificial Intelligence (Al) and the interaction of such algorithms with the physical world can be achieved using robotics. The work described in this thesis investigates the applications of concept learning (an approach which takes its inspiration from biological motivations and from survival instincts in particular) to robot control and path planning. The methodology of concept learning has been applied using learning decision trees (DTs) which induce domain knowledge from a finite set of training vectors which in turn describe systematically a physical entity and are used to train a robot to learn new concepts and to adapt its behaviour. To achieve behaviour learning, this work introduces the novel approach of hierarchical learning and knowledge decomposition to the frame of the reactive robot architecture. Following the analogy with survival instincts, the robot is first taught how to survive in very simple and homogeneous environments, namely a world without any disturbances or any kind of "hostility". Once this simple behaviour, named a primitive, has been established, the robot is trained to adapt new knowledge to cope with increasingly complex environments by adding further worlds to its existing knowledge. The repertoire of the robot behaviours in the form of symbolic knowledge is retained in a hierarchy of clustered decision trees (DTs) accommodating a number of primitives. To classify robot perceptions, control rules are synthesised using symbolic knowledge derived from searching the hierarchy of DTs. A second novel concept is introduced, namely that of multi-dimensional fuzzy associative memories (MDFAMs). These are clustered fuzzy decision trees (FDTs) which are trained locally and accommodate specific perceptual knowledge. Fuzzy logic is incorporated to deal with inherent noise in sensory data and to merge conflicting behaviours of the DTs. In this thesis, the feasibility of the developed techniques is illustrated in the robot applications, their benefits and drawbacks are discussed.

The master thesis deals with failed studies at universities in the Czech Republic. The first part is focused on literary research, on explanation of theoretical terms and on statistical methods, which are subsequently applied in the analytical part. These are decision trees and logistic regression that helped to determine the influence of factors on studies without graduation. The aim of this master thesis is to find significant factors, to compile a profile of failed students and to suggest the measures which could reduce their elimination from tertiary education.

Local search algorithms have been proved to be effective in refining solutions that have been found by other algorithms. Evolutionary algorithms, in particular global search algorithms, have shown to be successful in producing approximate solutions for optimisation and classification problems in acceptable computation times. A relatively new method, memetic algorithms, uses local search to refine the approximate solutions produced by global search algorithms. This thesis develops such a memetic algorithm. The global search algorithm used as part of the new memetic algorithm is a genetic program that implements the building block hypothesis by building simplistic decision trees representing valid solutions, and gradually increases the complexity of the trees. The specific building block hypothesis implementation is known as the building block approach to genetic programming, BGP. The effectiveness and efficiency of the new memetic algorithm, which combines the BGP algorithm with a local search algorithm, is demonstrated. / Dissertation (MSc)--University of Pretoria, 2006. / Computer Science / unrestricted