Processing decision information is a vital part of Computer Science fields in which pattern recognition problems arise. Decision information can be generalized as alternative decisions (or classes), attributes and attribute values, which are the basis for classification. Different classification approaches exist, such as decision trees, decision tables and Naïve Bayesian classifiers, which capture and manipulate decision information in order to construct a specific decision model (or classifier). These approaches are often tightly coupled to learning strategies, special data structures and the special characteristics of the decision information captured, etc. The approaches are also connected to the way of how certain problems are addressed, e.g., memory consumption, low accuracy, etc. This situation causes problems for a simple choice, comparison, combination and manipulation of different decision models learned over the same or different samples of decision information. The choice and comparison of decision models are not merely the choice of a model with a higher prediction accuracy and a comparison of prediction accuracies, respectively. We also need to take into account that a decision model, when used in a certain application, often has an impact on the application's performance. Often, the combination and manipulation of different decision models are implementation- or application-specific, thus, lacking the generality that leads to the construction of decision models with combined or modified decision information. They also become difficult to transfer from one application domain to another. In order to unify different approaches, we define Decision Algebra, a theoretical framework that presents decision models as higher order decision functions that abstract from their implementation details. Decision Algebra defines the operations necessary to decide, combine, approximate, and manipulate decision functions along with operation signatures and general algebraic laws. Due to its algebraic completeness (i.e., a complete algebraic semantics of operations and its implementation efficiency), defining and developing decision models is simple as such instances require implementing just one core operation based on which other operations can be derived. Another advantage of Decision Algebra is composability: it allows for combination of decision models constructed using different approaches. The accuracy and learning convergence properties of the combined model can be proven regardless of the actual approach. In addition, the applications that process decision information can be defined using Decision Algebra regardless of the different classification approaches. For example, we use Decision Algebra in a context-aware composition domain, where we showed that context-aware applications improve performance when using Decision Algebra. In addition, we suggest an approach to integrate this context-aware component into legacy applications.

Processing decision information is a constitutive part in a number of applicationsin Computer Science fields. In general, decision information can be used to deduce the relationship between a certain context and a certain decision. Decision information is represented by a decision model that captures this information. Frequently used examples of decision models are decision tables and decision trees. The choice of an appropriate decision model has an impact on application performance in terms of memory consumption and execution time. High memory expenses can possibly occur due to redundancy in a decision model; and high execution time is often a consequence of an unsuitable decision model. Applications in different domains try to overcome these problems by introducing new data structures or algorithms for implementing decision models. These solutions are usually domain-specificand hard to transfer from one domain to another. Different application domains of Computer Science often process decision information in a similar way and, hence, have similar problems. We should thus be able to present a unifying approach that can be applicable in all application domains for capturing and manipulating decision information. Therefore, the goal of this thesis is (i) to suggest a general structure(Decision Algebra) which provides a common theoretical framework that captures decision information and defines operations (signatures) for storing, accessing, merging, approximating, and manipulating such information along with some general algebraic laws regardless of the used implementation. Our Decision Algebra allows defining different construction strategiesfor decision models and data structures that capture decision information as implementation variants, and it simplifies experimental comparisons between them. Additionally, this thesis presents (ii) an implementation of Decision Algebra capturing the information in a non-redundant way and performing the operations efficiently. In fact, we show that existing decision models that originated in the field of Data Mining and Machine Learning and variants thereof as exploited in special algorithms can be understood as alternative implementation variants of the Decision Algebra by varying the implementations of the Decision Algebra operations. Hence, this work (iii) will contribute to a classification of existing technology for processing decision information in different application domains of Computer Science. / <p>A thesis for the Degree of Licentiate of Philosophy in Computer Science.</p>

Au cours des dernières décennies, le besoin pour des communications multimédia en mobilité est devenu indéniable dans les réseaux de type IP, ainsi la gestion de la mobilité et la continuité de session est depuis plusieurs années un problème de recherche très important aussi bien pour le milieu académique qu’industriel. Comme l'hétérogénéité des réseaux d’accès est en perpétuelle évolution, l'intégration des différents types de réseaux sans fil au niveau de la couche IP est devenue un domaine de recherche difficile et inévitable. L'un des problèmes les plus importants liés à l'exécution de la gestion de la mobilité concerne le fait que la couche d'application souffre de la modification d'adresses IP au cours du mouvement du nœud mobile alors que celle-ci construit sa session sur la base de l’adresse IP de connexion au réseau. Une nouvelle approche d'amélioration de la prise en charge de la mobilité propose de séparer l'identification de session et l'identification de l’emplacement ou l’attachement au réseau. Donc, par la séparation de ces deux concepts, les sessions ne sont pas identifiés par les adresses IP qui elles sont dynamiques puisque la mobilité dans le réseau impose le changement d’adresse IP, mais les nouveaux identificateurs uniques qui définissent un nœud et qui ne change pas à cause de la mobilité ce qui offrirait une stabilité pour le niveau applicatif. Selon ces concepts, Host Identity Protocol (HIP) est l'une des solutions dominantes en recherches qui est proposé par l'IETF et l’IRTF. Dans cette thèse, le protocole HIP est principalement examiné et de nouvelles améliorations de la mobilité sur la base de ce protocole ont été conçues et mises en place / Over the last decades, with rapid and tremendous growth of IP networks in mobile and wireless environments, mobility management and session continuity has become a more important issue. As the heterogeneity increases in network environments and gradual spread of Internet of Things wave, the integration of different types of wireless networks in the IP layer became a challenging and inevitable research area. One of the most important issues related to mobility management is related to the fact that the application layer suffers from the changing of IP addresses during the movement of the mobile node. It is expected the network layer and above layers to be aware of movement of mobile nodes. New wave in the improvement ideas on this concept is separating the session identification and the location identification. This avoids the applications to suffer when the IP address changes during the mobility. This new approach needs to introduce a new layer in the TCP/IP protocol stack, on top of the IP layer that will handle the new identifiers correspondent with the current IP address or new complete architecture designs which are inheriting locator/identifier separation idea. According to these concepts, Host Identity Protocol (HIP) is one of the dominant and prominent researches that is proposed by IETF and IRTF. This protocol proposes to solve the locator/identifier split problem by also including the security support. In this thesis, predominantly HIP protocol is examined and new mobility enhancements based on this protocol have been designed and introduced