User Profile Management and Selection in Context-Aware Service Platforms for Networks Beyond 3G

In recent years, progress in the area of mobile telecommunications has changed our way of life, in the private as well as the business domain. Mobile and wireless networks have ever increasing bit rates, mobile network operators provide more and more services, and at the same time costs for the usage of mobile services and bit rates are decreasing. However, mobile services today still lack functions that seamlessly integrate into users’ everyday life. That is, service attributes such as context-awareness and personalisation are often either proprietary, limited or not available at all. In order to overcome this deficiency, telecommunications companies are heavily engaged in the research and development of service platforms for networks beyond 3G for the provisioning of innovative mobile services. These service platforms are to support such service attributes. Service platforms are to provide basic service-independent functions such as billing, identity management, context management, user profile management, etc. Instead of developing own solutions, developers of end-user services such as innovative messaging services or location-based services can utilise the platform-side functions for their own purposes. In doing so, the platform-side support for such functions takes away complexity, development time and development costs from service developers. Context-awareness and personalisation are two of the most important aspects of service platforms in telecommunications environments. The combination of context-awareness and personalisation features can also be described as situation-dependent personalisation of services. The support for this feature requires several processing steps. The focus of this doctoral thesis is on the processing step, in which the user’s current context is matched against situation-dependent user preferences to find the matching user preferences for the current user’s situation. However, to achieve this, a user profile management system and corresponding functionality is required. These parts are also covered by this thesis. Altogether, this thesis provides the following contributions: The first part of the contribution is mainly architecture-oriented. First and foremost, we provide a user profile management system that addresses the specific requirements of service platforms in telecommunications environments. In particular, the user profile management system has to deal with situation-specific user preferences and with user information for various services. In order to structure the user information, we also propose a user profile structure and the corresponding user profile ontology as part of an ontology infrastructure in a service platform. The second part of the contribution is the selection mechanism for finding matching situation-dependent user preferences for the personalisation of services. This functionality is provided as a sub-module of the user profile management system. Contrary to existing solutions, our selection mechanism is based on ontology reasoning. This mechanism is evaluated in terms of runtime performance and in terms of supported functionality compared to other approaches. The results of the evaluation show the benefits and the drawbacks of ontology modelling and ontology reasoning in practical applications.

Model-driven development of sensor network applications with optimization of non-functional constraints

Wireless sensor networks (WSNs) differ from conventional distributed systems in many aspects. The resource limitation of sensor nodes, the ad-hoc communication and topology of the network, coupled with an unpredictable deployment environment are difficult non-functional constraints that must be carefully taken into account when developing software systems for a WSN. Thus, more research needs to be done on designing, implementing and maintaining software for WSNs. This thesis aims to contribute to research being done in this area by presenting an approach to WSN application development that will improve the reusability, flexibility, and maintainability of the software. Firstly, we present a programming model and software architecture aimed at describing WSN applications, independently of the underlying operating system and hardware. The proposed architecture is described and realized using the Model-Driven Architecture (MDA) standard in order to achieve satisfactory levels of encapsulation and abstraction when programming sensor nodes. Besides, we study different non-functional constrains of WSN application and propose two approaches to optimize the application to satisfy these constrains. A real prototype framework was built to demonstrate the developed solutions in the thesis. The framework implemented the programming model and the multi-layered software architecture as components. A graphical interface, code generation components and supporting tools were also included to help developers design, implement, optimize, and test the WSN software. Finally, we evaluate and critically assess the proposed concepts. Two case studies are provided to support the evaluation. The first case study, a framework evaluation, is designed to assess the ease at which novice and intermediate users can develop correct and power efficient WSN applications, the portability level achieved by developing applications at a high-level of abstraction, and the estimated overhead due to usage of the framework in terms of the footprint and executable code size of the application. In the second case study, we discuss the design, implementation and optimization of a real-world application named TempSense, where a sensor network is used to monitor the temperature within an area.

El FONVIS: su trayectoria institucional en el contexto sociopolitíco venezolana de 1980 a 2004

In Venezuela wurden ab 1989 als Reaktion auf die Zahlungsunfähigkeit des Landes erste neoliberale Strukturanpassungsmaßnahmen eingeleitet. Eine daraus resultierende zusätzliche Belastung der armen Bevölkerung mündete in einen völlig unerwarteten, massiven sozialen Aufruhr, dem sogenannten caracazo von 1989. Als eine Antwort darauf gründete die Regierung in Kooperation mit der Interamerikanischen Entwicklungsbank (BID) den venezolanischen Sozialfond FONVIS, der die sozialen Auswirkungen der neoliberalen Anpassung abfedern sollte. In diesem working paper werden unter Berücksichtigung der nationalen Kontextbedingungen die historische Entwicklung und die verschiedenen Konfigurationen des FONVIS beschrieben und analysiert. Als international gefördertes Implementierungsinstrument startete der Fonds mit einer Armutsbekämpfungspolitik, die den Ausbau von sozialer Infrastruktur sowie die Unterstützung des venezolanischen Dezentralisierungsprozesses fokussierte. Mit dem Regierungsantritt von Hugo Chávez 1999 hatte der Fonds dann in einem zunehmend schwierigeren Kontext zu operieren: Durch den Aufbau von neuen zentralstaatlichen sozialpolitischen Instrumenten und regierungsnahen ad hoc-Instanzen wurde der FONVIS zunehmend von einer anfänglich wichtigen Stellung innerhalb der nationalen Sozialpolitik ins institutionelle Abseits verdrängt und schließlich Ende 2005 offiziell aufgelöst. Die hier analysierte Performance des FONVIS macht deutlich, dass in der venezolanischen Fondslandschaft sich nur schwer eine breit entfaltete Multi-Level-Governance entwickeln konnte, weil der nationalstaatliche Kontext die Fondspolitik in allen Momenten dominierte. Schließlich leitete der Staat sogar ohne weitere Absprachen weder mit der internationalen noch regionalen und lokalen Ebene die Abschaffung des Fonds ein.

Evolving Distributed Algorithms with Genetic Programming

Distributed systems are one of the most vital components of the economy. The most prominent example is probably the internet, a constituent element of our knowledge society. During the recent years, the number of novel network types has steadily increased. Amongst others, sensor networks, distributed systems composed of tiny computational devices with scarce resources, have emerged. The further development and heterogeneous connection of such systems imposes new requirements on the software development process. Mobile and wireless networks, for instance, have to organize themselves autonomously and must be able to react to changes in the environment and to failing nodes alike. Researching new approaches for the design of distributed algorithms may lead to methods with which these requirements can be met efficiently. In this thesis, one such method is developed, tested, and discussed in respect of its practical utility. Our new design approach for distributed algorithms is based on Genetic Programming, a member of the family of evolutionary algorithms. Evolutionary algorithms are metaheuristic optimization methods which copy principles from natural evolution. They use a population of solution candidates which they try to refine step by step in order to attain optimal values for predefined objective functions. The synthesis of an algorithm with our approach starts with an analysis step in which the wanted global behavior of the distributed system is specified. From this specification, objective functions are derived which steer a Genetic Programming process where the solution candidates are distributed programs. The objective functions rate how close these programs approximate the goal behavior in multiple randomized network simulations. The evolutionary process step by step selects the most promising solution candidates and modifies and combines them with mutation and crossover operators. This way, a description of the global behavior of a distributed system is translated automatically to programs which, if executed locally on the nodes of the system, exhibit this behavior. In our work, we test six different ways for representing distributed programs, comprising adaptations and extensions of well-known Genetic Programming methods (SGP, eSGP, and LGP), one bio-inspired approach (Fraglets), and two new program representations called Rule-based Genetic Programming (RBGP, eRBGP) designed by us. We breed programs in these representations for three well-known example problems in distributed systems: election algorithms, the distributed mutual exclusion at a critical section, and the distributed computation of the greatest common divisor of a set of numbers. Synthesizing distributed programs the evolutionary way does not necessarily lead to the envisaged results. In a detailed analysis, we discuss the problematic features which make this form of Genetic Programming particularly hard. The two Rule-based Genetic Programming approaches have been developed especially in order to mitigate these difficulties. In our experiments, at least one of them (eRBGP) turned out to be a very efficient approach and in most cases, was superior to the other representations.

Rechtsfragen bei Geoportalen am Beispiel der Leitungsnetzauskunft des Zweckverbands Grevesmühlen

Der Beitrag entstand im Rahmen des Forschungsprojekts „Mobiler Tiefbau-Assistent mit rechtsverbindlicher und sicherer Daten-Aggregation für den Fernzugriff auf ad-hoc integrierbare leitungsnetzbezogene GeoGovernment-Services (TRUFFLE)“ und beleuchtet am Beispiel der Leitungsnetzauskunft des Zweckverbands Grevesmühlen zentrale Rechtsfragen, die sich bei der Errichtung eines Portals für den Abruf von digitalen Geoinformationen stellen.