Geometric, Feature-based and Graph-based Approaches for the Structural Analysis of Protein Binding Sites : Novel Methods and Computational Analysis

In this thesis, protein binding sites are considered. To enable the extraction of information from the space of protein binding sites, these binding sites must be mapped onto a mathematical space. This can be done by mapping binding sites onto vectors, graphs or point clouds. To finally enable a structure on the mathematical space, a distance measure is required, which is introduced in this thesis. This distance measure eventually can be used to extract information by means of data mining techniques

Estimation of origin-destination matrix from traffic counts: the state of the art

The estimation of up-to-date origin-destination matrix (ODM) from an obsolete trip data, using current available information is essential in transportation planning, traffic management and operations. Researchers from last 2 decades have explored various methods of estimating ODM using traffic count data. There are two categories of ODM; static and dynamic ODM. This paper presents studies on both the issues of static and dynamic ODM estimation, the reliability measures of the estimated matrix and also the issue of determining the set of traffic link count stations required to acquire maximum information to estimate a reliable matrix

Estimation of origin-destination matrix from traffic counts: the state of the art

The estimation of up-to-date origin-destination matrix (ODM) from an obsolete trip data, using current available information is essential in transportation planning, traffic management and operations. Researchers from last 2 decades have explored various methods of estimating ODM using traffic count data. There are two categories of ODM; static and dynamic ODM. This paper presents studies on both the issues of static and dynamic ODM estimation, the reliability measures of the estimated matrix and also the issue of determining the set of traffic link count stations required to acquire maximum information to estimate a reliable matrix

Traveling Salesman Problem

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering

Navigational Guidance – A Deep Learning Approach

The useful navigation guidance is favorable to considerably reducing navigation time. The navigation problems involved with multiple destinations are formulated as the Directed Steiner Tree (DST) problems over directed graphs. In this paper, we propose a deep learning (to be exact, graph neural networks) based approach to tackle the DST problem in a supervised manner. Experiments are conducted to evaluate the proposed approach, and the results suggest that our approach can effectively solve the DST problems. In particular, the accuracy of the network model can reach 95.04% or even higher

On morphological hierarchical representations for image processing and spatial data clustering

Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing