724 research outputs found

    MULTILEVEL ANT COLONY OPTIMIZATION TO SOLVE CONSTRAINED FOREST TRANSPORTATION PLANNING PROBLEMS

    Get PDF
    In this dissertation, we focus on solving forest transportation planning related problems, including constraints that consider negative environmental impacts and multi-objective optimizations that provide forest managers and road planers alternatives for making informed decisions. Along this line of study, several multilevel techniques and mataheuristic algorithms have been developed and investigated. The forest transportation planning problem is a fixed-charge problem and known to be NP-hard. The general idea of utilizing multilevel approach is to solve the original problem of which the computational cost maybe prohibitive by using a set of increasingly smaller problems of which the computational cost is cheaper. The multilevel techniques are devised consisting of two parts. The first part is to recursively apply a graph coarsening heuristic to the original problem to produce a set of coarser level problems of which the sizes in terms of number of problem components such as edges and nodes are in decreasing order. The second part is to solve the set of the coarser level problems including the original problem bottom up, starting with the coarsest level. We propose that if coarser level problems inherit important properties (such as attribute value distribution) from their ancestor during the coarsening process, they can be treated as smaller versions of the original problem. Based on this hypothesis, the multilevel techniques use solutions obtained for the coarser level problems to solve the finer level problems. Mainly, we develop multilevel techniques to address three problems, namely a constrained fixed-charge problem, parameter configuration problem, and a multi-objective transportation optimization problem in this study. The performance of the multilevel techniques is compared with other commonly used approaches. The statistical analyses on the experimental results indicate that the multilevel approach can reduce computing time significantly without sacrificing the solution quality

    Applications of artificial intelligence in dentistry: A comprehensive review

    Get PDF
    This work was funded by the Spanish Ministry of Sciences, Innovation and Universities under Projects RTI2018-101674-B-I00 and PGC2018-101904-A-100, University of Granada project A.TEP. 280.UGR18, I+D+I Junta de Andalucia 2020 project P20-00200, and Fapergs/Capes do Brasil grant 19/25510000928-3. Funding for open-access charge: Universidad de Granada/CBUAObjective: To perform a comprehensive review of the use of artificial intelligence (AI) and machine learning (ML) in dentistry, providing the community with a broad insight on the different advances that these technologies and tools have produced, paying special attention to the area of esthetic dentistry and color research. Materials and methods: The comprehensive review was conducted in MEDLINE/ PubMed, Web of Science, and Scopus databases, for papers published in English language in the last 20 years. Results: Out of 3871 eligible papers, 120 were included for final appraisal. Study methodologies included deep learning (DL; n = 76), fuzzy logic (FL; n = 12), and other ML techniques (n = 32), which were mainly applied to disease identification, image segmentation, image correction, and biomimetic color analysis and modeling. Conclusions: The insight provided by the present work has reported outstanding results in the design of high-performance decision support systems for the aforementioned areas. The future of digital dentistry goes through the design of integrated approaches providing personalized treatments to patients. In addition, esthetic dentistry can benefit from those advances by developing models allowing a complete characterization of tooth color, enhancing the accuracy of dental restorations. Clinical significance: The use of AI and ML has an increasing impact on the dental profession and is complementing the development of digital technologies and tools, with a wide application in treatment planning and esthetic dentistry procedures.Spanish Ministry of Sciences, Innovation and Universities RTI2018-101674-B-I00 PGC2018-101904-A-100University of Granada project A.TEP. 280.UGR18Junta de Andalucia P20-00200Fapergs/Capes do Brasil grant 19/25510000928-3Universidad de Granada/CBU

    Towards Data Wrangling Automation through Dynamically-Selected Background Knowledge

    Full text link
    [ES] El proceso de ciencia de datos es esencial para extraer valor de los datos. Sin embargo, la parte más tediosa del proceso, la preparación de los datos, implica una serie de formateos, limpieza e identificación de problemas que principalmente son tareas manuales. La preparación de datos todavía se resiste a la automatización en parte porque el problema depende en gran medida de la información del dominio, que se convierte en un cuello de botella para los sistemas de última generación a medida que aumenta la diversidad de dominios, formatos y estructuras de los datos. En esta tesis nos enfocamos en generar algoritmos que aprovechen el conocimiento del dominio para la automatización de partes del proceso de preparación de datos. Mostramos la forma en que las técnicas generales de inducción de programas, en lugar de los lenguajes específicos del dominio, se pueden aplicar de manera flexible a problemas donde el conocimiento es importante, mediante el uso dinámico de conocimiento específico del dominio. De manera más general, sostenemos que una combinación de enfoques de aprendizaje dinámicos y basados en conocimiento puede conducir a buenas soluciones. Proponemos varias estrategias para seleccionar o construir automáticamente el conocimiento previo apropiado en varios escenarios de preparación de datos. La idea principal se basa en elegir las mejores primitivas especializadas de acuerdo con el contexto del problema particular a resolver. Abordamos dos escenarios. En el primero, manejamos datos personales (nombres, fechas, teléfonos, etc.) que se presentan en formatos de cadena de texto muy diferentes y deben ser transformados a un formato unificado. El problema es cómo construir una transformación compositiva a partir de un gran conjunto de primitivas en el dominio (por ejemplo, manejar meses, años, días de la semana, etc.). Desarrollamos un sistema (BK-ADAPT) que guía la búsqueda a través del conocimiento previo extrayendo varias meta-características de los ejemplos que caracterizan el dominio de la columna. En el segundo escenario, nos enfrentamos a la transformación de matrices de datos en lenguajes de programación genéricos como R, utilizando como ejemplos una matriz de entrada y algunas celdas de la matriz de salida. También desarrollamos un sistema guiado por una búsqueda basada en árboles (AUTOMAT[R]IX) que usa varias restricciones, probabilidades previas para las primitivas y sugerencias textuales, para aprender eficientemente las transformaciones. Con estos sistemas, mostramos que la combinación de programación inductiva, con la selección dinámica de las primitivas apropiadas a partir del conocimiento previo, es capaz de mejorar los resultados de otras herramientas actuales específicas para la preparación de datos.[CA] El procés de ciència de dades és essencial per extraure valor de les dades. No obstant això, la part més tediosa del procés, la preparació de les dades, implica una sèrie de transformacions, neteja i identificació de problemes que principalment són tasques manuals. La preparació de dades encara es resisteix a l'automatització en part perquè el problema depén en gran manera de la informació del domini, que es converteix en un coll de botella per als sistemes d'última generació a mesura que augmenta la diversitat de dominis, formats i estructures de les dades. En aquesta tesi ens enfoquem a generar algorismes que aprofiten el coneixement del domini per a l'automatització de parts del procés de preparació de dades. Mostrem la forma en què les tècniques generals d'inducció de programes, en lloc dels llenguatges específics del domini, es poden aplicar de manera flexible a problemes on el coneixement és important, mitjançant l'ús dinàmic de coneixement específic del domini. De manera més general, sostenim que una combinació d'enfocaments d'aprenentatge dinàmics i basats en coneixement pot conduir a les bones solucions. Proposem diverses estratègies per seleccionar o construir automàticament el coneixement previ apropiat en diversos escenaris de preparació de dades. La idea principal es basa a triar les millors primitives especialitzades d'acord amb el context del problema particular a resoldre. Abordem dos escenaris. En el primer, manegem dades personals (noms, dates, telèfons, etc.) que es presenten en formats de cadena de text molt diferents i han de ser transformats a un format unificat. El problema és com construir una transformació compositiva a partir d'un gran conjunt de primitives en el domini (per exemple, manejar mesos, anys, dies de la setmana, etc.). Desenvolupem un sistema (BK-ADAPT) que guia la cerca a través del coneixement previ extraient diverses meta-característiques dels exemples que caracteritzen el domini de la columna. En el segon escenari, ens enfrontem a la transformació de matrius de dades en llenguatges de programació genèrics com a R, utilitzant com a exemples una matriu d'entrada i algunes dades de la matriu d'eixida. També desenvolupem un sistema guiat per una cerca basada en arbres (AUTOMAT[R]IX) que usa diverses restriccions, probabilitats prèvies per a les primitives i suggeriments textuals, per aprendre eficientment les transformacions. Amb aquests sistemes, mostrem que la combinació de programació inductiva amb la selecció dinàmica de les primitives apropiades a partir del coneixement previ, és capaç de millorar els resultats d'altres enfocaments de preparació de dades d'última generació i més específics.[EN] Data science is essential for the extraction of value from data. However, the most tedious part of the process, data wrangling, implies a range of mostly manual formatting, identification and cleansing manipulations. Data wrangling still resists automation partly because the problem strongly depends on domain information, which becomes a bottleneck for state-of-the-art systems as the diversity of domains, formats and structures of the data increases. In this thesis we focus on generating algorithms that take advantage of the domain knowledge for the automation of parts of the data wrangling process. We illustrate the way in which general program induction techniques, instead of domain-specific languages, can be applied flexibly to problems where knowledge is important, through the dynamic use of domain-specific knowledge. More generally, we argue that a combination of knowledge-based and dynamic learning approaches leads to successful solutions. We propose several strategies to automatically select or construct the appropriate background knowledge for several data wrangling scenarios. The key idea is based on choosing the best specialised background primitives according to the context of the particular problem to solve. We address two scenarios. In the first one, we handle personal data (names, dates, telephone numbers, etc.) that are presented in very different string formats and have to be transformed into a unified format. The problem is how to build a compositional transformation from a large set of primitives in the domain (e.g., handling months, years, days of the week, etc.). We develop a system (BK-ADAPT) that guides the search through the background knowledge by extracting several meta-features from the examples characterising the column domain. In the second scenario, we face the transformation of data matrices in generic programming languages such as R, using an input matrix and some cells of the output matrix as examples. We also develop a system guided by a tree-based search (AUTOMAT[R]IX) that uses several constraints, prior primitive probabilities and textual hints to efficiently learn the transformations. With these systems, we show that the combination of inductive programming with the dynamic selection of the appropriate primitives from the background knowledge is able to improve the results of other state-of-the-art and more specific data wrangling approaches.This research was supported by the Spanish MECD Grant FPU15/03219;and partially by the Spanish MINECO TIN2015-69175-C4-1-R (Lobass) and RTI2018-094403-B-C32-AR (FreeTech) in Spain; and by the ERC Advanced Grant Synthesising Inductive Data Models (Synth) in Belgium.Contreras Ochando, L. (2020). Towards Data Wrangling Automation through Dynamically-Selected Background Knowledge [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/160724TESI

    Machine Learning para deteção de padrões e previsão de ocorrências criminais

    Get PDF
    The increase of the world population, especially in large urban centers, has resulted in new challenges such as the management of natural resources and infrastructures as well as the optimization of services to promote the quality of citizens’ life. One of the biggest and most important challenges is the management of public safety, since, in addition to being a factor of interest to both the general population and the authorities, it is also an area that influences other essential indicators in a city such as tourism and employment. Public Safety has impact on the economic growth and social development of a community. This dissertation proposes a solution for the prediction of criminal occurrences in a city based on historical data of incidents and demographic data. The entire life cycle of the model’s learning process will be presented to provide an organization with predictive capability: start with the data collection from its original source, the treatment and transformations applied to them, the choice and the evaluation and implementation of the Machine Learning model up to the application layer. Classification models will be implemented to predict criminal risk for a given time interval and location, as well as regression models to predict the number of crimes. Machine Learning algorithms, such as Random Forest, Neural Networks, K-Nearest Neighbors and Logistic Regression will be used to predict occurrences, and their performance will be compared according to the data processing and transformation used. The results of the chosen model show that the use of Machine Learning techniques helps to anticipate criminal occurrences, which contributed to the reinforcement of public security. Finally, the models will be implemented on a platform that provides an API to enable other entities to request for predictions in real-time. An application will also be presented where it is possible to show criminal occurrences predictions visually.O aumento da população mundial, especialmente nos grandes centros urbanos, tem resultado em novos desafios tais como a gestão de recursos naturais, gestão de infraestruturas, bem como a otimização dos serviços para promover a qualidade de vida dos cidadãos. Um dos maiores e mais importantes desafios é a gestão da segurança pública. Para além de ser um fator de interesse quer da população em geral quer das autoridades, também é um domínio que influencia outros indicadores essenciais numa cidade como o turismo e o emprego. A segurança pública reflete-se no crescimento económico e no desenvolvimento social de uma comunidade. Nesta dissertação é proposta uma solução para previsão de ocorrências criminais numa cidade baseada em dados de histórico de incidentes e dados demográficos. Será apresentado todo o ciclo de vida do processo de aprendizagem do modelo para dotar uma organização da capacidade preditiva: desde a recolha dos dados da sua fonte de origem, o tratamento e transformações aplicadas aos mesmos, escolha, avaliação e implementação do modelo de Machine Learning até à camada de aplicação. Serão implementados modelos de classificação para previsão do risco criminal para um dado intervalo temporal e localização, e modelos de regressão para previsão do número de crimes. Irão ser utilizados algoritmos de Machine Learning como Random Forest, Redes Neuronais, K-Nearest Neighbors e Regressão Logística para a aprendizagem do modelo de previsão de ocorrências onde serão comparados os seus desempenhos de acordo com o tratamento e transformação dos dados utilizados. Os resultados do modelo escolhido evidenciam que a utilização de técnicas de Machine Learning auxiliam a antecipação de ocorrências criminais, o que contribuiu para o reforço da segurança pública. Por fim, irá ser procedida a implementação dos modelos numa plataforma que fornece uma API para que entidades externas possam solicitar previsões em tempo real. Será também apresentada a aplicação onde é possível mostrar visualmente as previsões de ocorrências criminais.Mestrado em Engenharia Informátic

    Advances in Computational Intelligence Applications in the Mining Industry

    Get PDF
    This book captures advancements in the applications of computational intelligence (artificial intelligence, machine learning, etc.) to problems in the mineral and mining industries. The papers present the state of the art in four broad categories: mine operations, mine planning, mine safety, and advances in the sciences, primarily in image processing applications. Authors in the book include both researchers and industry practitioners

    EJP-CONCERT. D3.7 Second joint roadmap for radiation protection research

    Get PDF
    EJP-CONCERT Work Package 3, Deliverable 3.7

    Requirements of a global information system for corn production and distribution

    Get PDF
    There are no author-identified significant results in this report

    Preface

    Get PDF
    DAMSS-2018 is the jubilee 10th international workshop on data analysis methods for software systems, organized in Druskininkai, Lithuania, at the end of the year. The same place and the same time every year. Ten years passed from the first workshop. History of the workshop starts from 2009 with 16 presentations. The idea of such workshop came up at the Institute of Mathematics and Informatics. Lithuanian Academy of Sciences and the Lithuanian Computer Society supported this idea. This idea got approval both in the Lithuanian research community and abroad. The number of this year presentations is 81. The number of registered participants is 113 from 13 countries. In 2010, the Institute of Mathematics and Informatics became a member of Vilnius University, the largest university of Lithuania. In 2017, the institute changes its name into the Institute of Data Science and Digital Technologies. This name reflects recent activities of the institute. The renewed institute has eight research groups: Cognitive Computing, Image and Signal Analysis, Cyber-Social Systems Engineering, Statistics and Probability, Global Optimization, Intelligent Technologies, Education Systems, Blockchain Technologies. The main goal of the workshop is to introduce the research undertaken at Lithuanian and foreign universities in the fields of data science and software engineering. Annual organization of the workshop allows the fast interchanging of new ideas among the research community. Even 11 companies supported the workshop this year. This means that the topics of the workshop are actual for business, too. Topics of the workshop cover big data, bioinformatics, data science, blockchain technologies, deep learning, digital technologies, high-performance computing, visualization methods for multidimensional data, machine learning, medical informatics, ontological engineering, optimization in data science, business rules, and software engineering. Seeking to facilitate relations between science and business, a special session and panel discussion is organized this year about topical business problems that may be solved together with the research community. This book gives an overview of all presentations of DAMSS-2018.DAMSS-2018 is the jubilee 10th international workshop on data analysis methods for software systems, organized in Druskininkai, Lithuania, at the end of the year. The same place and the same time every year. Ten years passed from the first workshop. History of the workshop starts from 2009 with 16 presentations. The idea of such workshop came up at the Institute of Mathematics and Informatics. Lithuanian Academy of Sciences and the Lithuanian Computer Society supported this idea. This idea got approval both in the Lithuanian research community and abroad. The number of this year presentations is 81. The number of registered participants is 113 from 13 countries. In 2010, the Institute of Mathematics and Informatics became a member of Vilnius University, the largest university of Lithuania. In 2017, the institute changes its name into the Institute of Data Science and Digital Technologies. This name reflects recent activities of the institute. The renewed institute has eight research groups: Cognitive Computing, Image and Signal Analysis, Cyber-Social Systems Engineering, Statistics and Probability, Global Optimization, Intelligent Technologies, Education Systems, Blockchain Technologies. The main goal of the workshop is to introduce the research undertaken at Lithuanian and foreign universities in the fields of data science and software engineering. Annual organization of the workshop allows the fast interchanging of new ideas among the research community. Even 11 companies supported the workshop this year. This means that the topics of the workshop are actual for business, too. Topics of the workshop cover big data, bioinformatics, data science, blockchain technologies, deep learning, digital technologies, high-performance computing, visualization methods for multidimensional data, machine learning, medical informatics, ontological engineering, optimization in data science, business rules, and software engineering. Seeking to facilitate relations between science and business, a special session and panel discussion is organized this year about topical business problems that may be solved together with the research community. This book gives an overview of all presentations of DAMSS-2018
    corecore