La leptospirose féline : sondage sérologique et de PCR urinaire chez des chats sains et des chats atteints de maladie rénale

La leptospirose est une zoonose à distribution mondiale dont la prévalence chez le chat varie géographiquement de 4.8% à 35%. Bien que l’exposition féline à Leptospira spp. soit rapportée dans des études sérologiques, les conséquences cliniques de cette maladie chez le chat sont peu connues. Le but principal de cette étude était de comparer le statut sérologique et de porteur (PCR urinaire) de Leptospira spp. entre des chats sains et des chats atteints de maladie rénale (insulte rénale aigue et maladie rénale chronique de stades IIb, III et IV). Une étude préliminaire pour valider la sensibilité et la spécificité analytiques de la PCR de Leptospira spp. réalisée par le Laboratoire de Diagnostic Moléculaire de la FMV sur l’urine de chat a été effectuée. La validation in vitro a démontré que la technique de PCR est efficace pour déterminer la présence de leptospires pathogènes dans l’urine du chat. Dans le cadre de l’étude principale, 251 chats ont été recrutés entre janvier 2010 et mars 2012,. De ceux-ci, 240 ont été inclus et divisés en 2 groupes (chats sains (C=125) et chats atteints de maladie rénale (MR=115) en se basant sur un examen physique ainsi que sur des résultats d’hématologie, de biochimie et d’analyse d’urine. Tous les chats recrutés ont également été examinés sérologiquement par test de micro-agglutination pour la présence d’anticorps contre Leptospira spp. (résultat considéré positif si ≥1 :100) et par PCR pour la présence de Leptospira spp. dans l’urine. Le pourcentage prédit de séropositivité pour Leptospira spp. était significativement plus élevé chez les chats atteints de maladie rénale (13,7%) que chez les chats sains (5%) (p=0,02). Les sérovars impliqués étaient Pomona (n=16), Bratislava (n=8) et Grippotyphosa (n=1). De plus, les chats séropositifs pour Pomona présentaient des titres significativement plus élevés que pour les autres sérovars (p=0,04). L’excrétion de Leptospira spp. a été confirmée par PCR dans l’urine de huit chats. Des 26 chats séropositifs, quatre (C=2, MR=2) se sont également révélés PCR positifs. La prévalence a été plus élevée chez les chats du groupe MR (5.3%; 6/113) lorsque comparée à celle du groupe C (1.6%; 2/125), mais cette différence ne s’est pas révélée statistiquement significative (C=0,9% , MR= 5,5% ; p = 0,09). L’âge, le sexe et le milieu de vie (urbain versus rural) n’ont pas influencé le statut sérologique ou d’excrétion pour Leptospira spp. Le pourcentage prédit de séropositivité était significativement plus élevée chez les chasseurs (p<0.01) et pendant les mois de juin à août (p=0.02). La présence d’un autre chat à la maison a également significativement augmenté ce pourcentage (p<0.01), mais la présence d’un chien ne l’a pas influencé. Lors de l’évaluation du PCR par le modèle GGE, seules les variables « contact avec raton laveur » et « contact avec mouffettes » sont ressorties statistiquement significatives (p≤0.03). Le rôle que joue Leptospira spp. comme agent étiologique de maladie rénale chez le chat demeure incertain. Toutefois, la différence significative de statut sérologique entre les chats sains et les chats atteints de maladie rénale suggère que la leptospirose pourrait être une cause sous-diagnostiquée de maladie rénale chez cette espèce. Dans cette étude, plusieurs porteurs asymptomatiques ont été identifiés, ce qui suggère que l’espèce féline puisse être un acteur sous-estimé dans la transmission de la bactérie aux humains.

Réponse métabolique du saumon Atlantique (Salmo salar) aux fluctuations journalières de température : rôles de la température d’acclimatation et de l’historique thermique

En général, le métabolisme des poissons est estimé à des valeurs de température constantes, mais les effets de fluctuations journalières de température similaires à celles retrouvées en milieu naturel semblent peu connus. Les objectifs du présent mémoire sont de quantifier les effets de la température moyenne d’acclimatation et d’évaluer les effets de l’historique thermique des individus, sur les réponses métaboliques de tacons de saumon Atlantique (Salmo salar) aux fluctuations journalières de la température. Des tacons provenant de deux rivières, une fraîche et une chaude, ont été acclimatés à un maximum de quatre régimes thermiques (constant 15 °C ou 20 °C, fluctuant 15 °C ± 2.5 °C ou 20 °C ± 2.5 °C) et leur taux métabolique standard estimés par respirométrie par débit-intermittent. Les fluctuations journalières de température (15 °C ± 2.5 °C) près de l’optimum thermique pour cette espèce (16 °C) n’affectent pas le taux métabolique standard. À l’opposé, les fluctuations journalières de température plus chaudes (20 °C ± 2.5 °C) augmentent de 35.4% le taux métabolique standard des tacons de la rivière plus chaude, mais pas ceux des poissons de la rivière fraîche. Ainsi, la température moyenne à laquelle sont acclimatés les poissons peut affecter leur réponse métabolique aux fluctuations journalières de température, mais cette réponse peut varier entre populations provenant de rivières présentant des régimes thermiques différents. Enfin, grâce aux données de métabolisme précédemment estimées, un modèle de métabolisme standard a été développé pour des tacons de saumon Atlantique soumis à des fluctuations journalières de température.

GABA and 5-HT chitosan nanoparticles enhanced liver cell proliferation and neuronal survival in partially hepatectomised rats: GABAB and 5-HT2A receptors functional

Nanoparticulate drug delivery systems provide wide opportunities for solving problems associated with drug stability or disease states and create great expectations in the area of drug delivery (Bosselmann & Williams, 2012). Nanotechnology, in a simple way, explains the technology that deals with one billionth of a meter scale (Ochekpe, et al., 2009). Fewer side effects, poor bioavailability, absorption at intestine, solubility, specific delivery to site of action with good pharmacological efficiency, slow release, degradation of drug and effective therapeutic outcome, are the major challenges faced by most of the drug delivery systems. To a great extent, biopolymer coated drug delivery systems coupled with nanotechnology alleviate the major drawbacks of the common delivery methods. Chitosan, deacetylated chitin, is a copolymer of β-(1, 4) linked glucosamine (deacetylated unit) and N- acetyl glucosamine (acetylated unit) (Radhakumary et al., 2005). Chitosan is biodegradable, non-toxic and bio compatible. Owing to the removal of acetyl moieties that are present in the amine functional groups of chitin, chitosan is readily soluble in aqueous acidic solution. The solubilisation occurs through the protonation of amino groups on the C-2 position of D-glucosamine residues whereby polysaccharide is converted into polycation in acidic media. Chitosan interacts with many active compounds due to the presence of amine group in it. The presence of this active amine group in chitosan was exploited for the interaction with the active molecules in the present study. Nanoparticles of chitosan coupled drugs are utilized for drug delivery in eye, brain, liver, cancer tissues, treatment of spinal cord injury and infections (Sharma et al., 2007; Li, et a., 2009; Paolicelli et al., 2009; Cho et al., 2010). To deliver drugs directly to the intended site of action and to improve pharmacological efficiency by minimizing undesired side effects elsewhere in the body and decrease the long-term use of many drugs, polymeric drug delivery systems can be used (Thatte et al., 2005).

Genetic Programming meets Model-Driven Development

Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hardwired module of a design framework that assists the engineer to optimize specific aspects of the system to be developed. It provides its results in a fixed format through an internal interface. In this paper we show how the utility of genetic programming can be increased remarkably by isolating it as a component and integrating it into the model-driven software development process. Our genetic programming framework produces XMI-encoded UML models that can easily be loaded into widely available modeling tools which in turn posses code generation as well as additional analysis and test capabilities. We use the evolution of a distributed election algorithm as an example to illustrate how genetic programming can be combined with model-driven development. This example clearly illustrates the advantages of our approach – the generation of source code in different programming languages.

Web Service Composition Systems for the Web Service Challenge - A Detailed Review

This report gives a detailed discussion on the system, algorithms, and techniques that we have applied in order to solve the Web Service Challenges (WSC) of the years 2006 and 2007. These international contests are focused on semantic web service composition. In each challenge of the contests, a repository of web services is given. The input and output parameters of the services in the repository are annotated with semantic concepts. A query to a semantic composition engine contains a set of available input concepts and a set of wanted output concepts. In order to employ an offered service for a requested role, the concepts of the input parameters of the offered operations must be more general than requested (contravariance). In contrast, the concepts of the output parameters of the offered service must be more specific than requested (covariance). The engine should respond to a query by providing a valid composition as fast as possible. We discuss three different methods for web service composition: an uninformed search in form of an IDDFS algorithm, a greedy informed search based on heuristic functions, and a multi-objective genetic algorithm.

Offline Emergence Engineering For Agent Societies

Many examples for emergent behaviors may be observed in self-organizing physical and biological systems which prove to be robust, stable, and adaptable. Such behaviors are often based on very simple mechanisms and rules, but artificially creating them is a challenging task which does not comply with traditional software engineering. In this article, we propose a hybrid approach by combining strategies from Genetic Programming and agent software engineering, and demonstrate that this approach effectively yields an emergent design for given problems.

1st Kassel Student Workshop on Security in Distributed Systems

With this document, we provide a compilation of in-depth discussions on some of the most current security issues in distributed systems. The six contributions have been collected and presented at the 1st Kassel Student Workshop on Security in Distributed Systems (KaSWoSDS’08). We are pleased to present a collection of papers not only shedding light on the theoretical aspects of their topics, but also being accompanied with elaborate practical examples. In Chapter 1, Stephan Opfer discusses Viruses, one of the oldest threats to system security. For years there has been an arms race between virus producers and anti-virus software providers, with no end in sight. Stefan Triller demonstrates how malicious code can be injected in a target process using a buffer overflow in Chapter 2. Websites usually store their data and user information in data bases. Like buffer overflows, the possibilities of performing SQL injection attacks targeting such data bases are left open by unwary programmers. Stephan Scheuermann gives us a deeper insight into the mechanisms behind such attacks in Chapter 3. Cross-site scripting (XSS) is a method to insert malicious code into websites viewed by other users. Michael Blumenstein explains this issue in Chapter 4. Code can be injected in other websites via XSS attacks in order to spy out data of internet users, spoofing subsumes all methods that directly involve taking on a false identity. In Chapter 5, Till Amma shows us different ways how this can be done and how it is prevented. Last but not least, cryptographic methods are used to encode confidential data in a way that even if it got in the wrong hands, the culprits cannot decode it. Over the centuries, many different ciphers have been developed, applied, and finally broken. Ilhan Glogic sketches this history in Chapter 6.

Fluoreszenzspektroskopische Untersuchungen von Autoionisations- und Photodissoziationsprozessen des Stickstoffmoleküls nach monochromatischer Synchrotronstrahlanregung

Autoionisations- und Photodissoziationsprozesse von molekularem Stickstoff wurden mit Hilfe der photoneninduzierten Fluoreszenzspektroskopie nach Anregung von monochromatisierter Synchrotronstrahlung untersucht. Dabei wurden zwei Anregungsprozesse untersucht. Die Anregung eines Sub-Valenzschalenelektrons diente zum Studium des Photodissoziationsverhaltens von hochangeregten Zuständen ("super-excited-states") und die aus den Experimenten gewonnenen partiellen Emissionsquerschnitte wurden absolut normiert. Durch Anregen eines Innerschalenelektrons wurde die 1s^{-1}pi* Resonanz schwingungsselektiv angeregt und die darauf folgende Autoionisation in den N_2^+ C ^2\Sigma_u^+ (v)-Zustand und dessen Relaxation durch Fluoreszenzemission in den Grundzustand des Stickstoffions untersucht. Erstmalig wurden partielle Emissionsquerschnitte nach Photodissoziation in neutrale Fragmente von hochangeregten Zuständen von atomaren Stickstoff im Anregungsenergiebereich zwischen 23eV und 26,7eV und im Fluoreszenzwellenläneninterval zwischen 80nm und 150nm absolut bestimmt. Die schwingungsselektive Besetzung der Innerschalenresonanz des Stickstoffmoleküls ermöglichte eine detaillierte Analyse des Autoionisationsverhaltens der Innerschalenresonanz in den N_2^+ C-Zustand durch Analyse der nachfolgenden Relaxation durch molekulare Fluoreszenz in den Grundzustand des Molekülions.

Global Optimization Algorithms and their Application to Distributed Systems

In this report, we discuss the application of global optimization and Evolutionary Computation to distributed systems. We therefore selected and classified many publications, giving an insight into the wide variety of optimization problems which arise in distributed systems. Some interesting approaches from different areas will be discussed in greater detail with the use of illustrative examples.

Applicability of Emergence Engineering to Distributed Systems Scenarios

Genetic Programming can be effectively used to create emergent behavior for a group of autonomous agents. In the process we call Offline Emergence Engineering, the behavior is at first bred in a Genetic Programming environment and then deployed to the agents in the real environment. In this article we shortly describe our approach, introduce an extended behavioral rule syntax, and discuss the impact of the expressiveness of the behavioral description to the generation success, using two scenarios in comparison: the election problem and the distributed critical section problem. We evaluate the results, formulating criteria for the applicability of our approach.

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.

Automatische Dienstvermittlung in dienstorientierten Architekturen in Aktion (ADDOaction)

In diesem Bericht werden die Ergebnisse und Fortschritte des Forschungsprojekts ADDOaction vorgestellt. Durch die Entwicklung in den letzten Jahrzehnten wurde das Internet zu einer wichtigen Infrastruktur für Geschäftsprozesse. Beliebige Anwendungen können als Dienste angeboten und übers Internet den Kunden online zur Verfügung gestellt werden. Eine flexible Dienstarchitektur ist dabei durch einen gewissen Grad an Dynamik gekennzeichnet, wo Dienste angepasst, ausgetauscht oder entfernt werden können und eventuell gleichzeitig von verschiedenen Anbietern bereitgestellt werden können. Dienste müssen dabei sowohl die funktionalen als auch die nicht-funktionalen Quality of Service (QoS) Anforderungen der Klienten erfüllen, um Kundenzufriedenheit garantieren zu können. Die Vielzahl der angebotenen Dienste und die unterschiedlichen Anforderungen der Klienten machen eine manuelle Entdeckung und ein manuelles Management der Dienste praktisch unmöglich. ADDOaction adressiert genau diese Probleme einer dienstorientierten Architektur und liefert innovative Lösungen von der automatischen Entdeckung von Diensten bis hin zur Überwachung und zum Management von Diensten zur Laufzeit.

Context as a Service

In the vision of Mark Weiser on ubiquitous computing, computers are disappearing from the focus of the users and are seamlessly interacting with other computers and users in order to provide information and services. This shift of computers away from direct computer interaction requires another way of applications to interact without bothering the user. Context is the information which can be used to characterize the situation of persons, locations, or other objects relevant for the applications. Context-aware applications are capable of monitoring and exploiting knowledge about external operating conditions. These applications can adapt their behaviour based on the retrieved information and thus to replace (at least a certain amount) the missing user interactions. Context awareness can be assumed to be an important ingredient for applications in ubiquitous computing environments. However, context management in ubiquitous computing environments must reflect the specific characteristics of these environments, for example distribution, mobility, resource-constrained devices, and heterogeneity of context sources. Modern mobile devices are equipped with fast processors, sufficient memory, and with several sensors, like Global Positioning System (GPS) sensor, light sensor, or accelerometer. Since many applications in ubiquitous computing environments can exploit context information for enhancing their service to the user, these devices are highly useful for context-aware applications in ubiquitous computing environments. Additionally, context reasoners and external context providers can be incorporated. It is possible that several context sensors, reasoners and context providers offer the same type of information. However, the information providers can differ in quality levels (e.g. accuracy), representations (e.g. position represented in coordinates and as an address) of the offered information, and costs (like battery consumption) for providing the information. In order to simplify the development of context-aware applications, the developers should be able to transparently access context information without bothering with underlying context accessing techniques and distribution aspects. They should rather be able to express which kind of information they require, which quality criteria this information should fulfil, and how much the provision of this information should cost (not only monetary cost but also energy or performance usage). For this purpose, application developers as well as developers of context providers need a common language and vocabulary to specify which information they require respectively they provide. These descriptions respectively criteria have to be matched. For a matching of these descriptions, it is likely that a transformation of the provided information is needed to fulfil the criteria of the context-aware application. As it is possible that more than one provider fulfils the criteria, a selection process is required. In this process the system has to trade off the provided quality of context and required costs of the context provider against the quality of context requested by the context consumer. This selection allows to turn on context sources only if required. Explicitly selecting context services and thereby dynamically activating and deactivating the local context provider has the advantage that also the resource consumption is reduced as especially unused context sensors are deactivated. One promising solution is a middleware providing appropriate support in consideration of the principles of service-oriented computing like loose coupling, abstraction, reusability, or discoverability of context providers. This allows us to abstract context sensors, context reasoners and also external context providers as context services. In this thesis we present our solution consisting of a context model and ontology, a context offer and query language, a comprehensive matching and mediation process and a selection service. Especially the matching and mediation process and the selection service differ from the existing works. The matching and mediation process allows an autonomous establishment of mediation processes in order to transfer information from an offered representation into a requested representation. In difference to other approaches, the selection service selects not only a service for a service request, it rather selects a set of services in order to fulfil all requests which also facilitates the sharing of services. The approach is extensively reviewed regarding the different requirements and a set of demonstrators shows its usability in real-world scenarios.

Effects of different tillage treatments on labile soil organic matter pools and stabilization processes

An improved understanding of soil organic carbon (Corg) dynamics in interaction with the mechanisms of soil structure formation is important in terms of sustainable agriculture and reduction of environmental costs of agricultural ecosystems. However, information on physical and chemical processes influencing formation and stabilization of water stable aggregates in association with Corg sequestration is scarce. Long term soil experiments are important in evaluating open questions about management induced effects on soil Corg dynamics in interaction with soil structure formation. The objectives of the present thesis were: (i) to determine the long term impacts of different tillage treatments on the interaction between macro aggregation (>250 µm) and light fraction (LF) distribution and on C sequestration in plots differing in soil texture and climatic conditions. (ii) to determine the impact of different tillage treatments on temporal changes in the size distribution of water stable aggregates and on macro aggregate turnover. (iii) to evaluate the macro aggregate rebuilding in soils with varying initial Corg contents, organic matter (OM) amendments and clay contents in a short term incubation experiment. Soil samples were taken in 0-5 cm, 5-25 cm and 25-40 cm depth from up to four commercially used fields located in arable loess regions of eastern and southern Germany after 18-25 years of different tillage treatments with almost identical experimental setups per site. At each site, one large field with spatially homogenous soil properties was divided into three plots. One of the following three tillage treatments was carried in each plot: (i) Conventional tillage (CT) with annual mouldboard ploughing to 25-30 cm (ii) mulch tillage (MT) with a cultivator or disc harrow 10-15 cm deep, and (iii) no tillage (NT) with direct drilling. The crop rotation at each site consisted of sugar beet (Beta vulgaris L.) - winter wheat (Triticum aestivum L.) - winter wheat. Crop residues were left on the field and crop management was carried out following the regional standards of agricultural practice. To investigate the above mentioned research objectives, three experiments were conducted: Experiment (i) was performed with soils sampled from four sites in April 2010 (wheat stand). Experiment (ii) was conducted with soils sampled from three sites in April 2010, September 2011 (after harvest or sugar beet stand), November 2011 (after tillage) and April 2012 (bare soil or wheat stand). An incubation study (experiment (iii)) was performed with soil sampled from one site in April 2010. Based on the aforementioned research objectives and experiments the main findings were: (i) Consistent results were found between the four long term tillage fields, varying in texture and climatic conditions. Correlation analysis of the yields of macro aggregate against the yields of free LF ( ≤1.8 g cm-3) and occluded LF, respectively, suggested that the effective litter translocation in higher soil depths and higher litter input under CT and MT compensated in the long term the higher physical impact by tillage equipment than under NT. The Corg stocks (kg Corg m−2) in 522 kg soil, based on the equivalent soil mass approach (CT: 0–40 cm, MT: 0–38 cm, NT: 0–36 cm) increased in the order CT (5.2) = NT (5.2) < MT (5.7). Significantly (p ≤ 0.05) highest Corg stocks under MT were probably a result of high crop yields in combination with reduced physical tillage impact and effective litter incorporation, resulting in a Corg sequestration rate of 31 g C-2 m-2 yr-1. (ii) Significantly higher yields of macro aggregates (g kg-2 soil) under NT (732-777) and MT (680-726) than under CT (542-631) were generally restricted to the 0-5 cm sampling depth for all sampling dates. Temporal changes on aggregate size distribution were only small and no tillage induced net effect was detectable. Thus, we assume that the physical impact by tillage equipment was only small or the impact was compensated by a higher soil mixing and effective litter translocation into higher soil depths under CT, which probably resulted in a high re aggregation. (iii) The short term incubation study showed that macro aggregate yields (g kg-2 soil) were higher after 28 days in soils receiving OM (121.4-363.0) than in the control soils (22.0-52.0), accompanied by higher contents of microbial biomass carbon and ergosterol. Highest soil respiration rates after OM amendments within the first three days of incubation indicated that macro aggregate formation is a fast process. Most of the rebuilt macro aggregates were formed within the first seven days of incubation (42-75%). Nevertheless, it was ongoing throughout the entire 28 days of incubation, which was indicated by higher soil respiration rates at the end of the incubation period in OM amended soils than in the control soils. At the same time, decreasing carbon contents within macro aggregates over time indicated that newly occluded OM within the rebuilt macro aggregates served as Corg source for microbial biomass. The different clay contents played only minor role in macro aggregate formation under the particular conditions of the incubation study. Overall, no net changes on macro aggregation were identified in the short term. Furthermore, no indications for an effective Corg sequestration on the long term under NT in comparison to CT were found. The interaction of soil disturbance, litter distribution and the fast re aggregation suggested that a distinct steady state per tillage treatment in terms of soil aggregation was established. However, continuous application of MT with a combination of reduced physical tillage impact and effective litter incorporation may offer some potential in improving the soil structure and may therefore prevent incorporated LF from rapid decomposition and result in a higher C sequestration on the long term.

The Human in the Loop: User Participation in Self-Adaptive Software

Self-adaptive software provides a profound solution for adapting applications to changing contexts in dynamic and heterogeneous environments. Having emerged from Autonomic Computing, it incorporates fully autonomous decision making based on predefined structural and behavioural models. The most common approach for architectural runtime adaptation is the MAPE-K adaptation loop implementing an external adaptation manager without manual user control. However, it has turned out that adaptation behaviour lacks acceptance if it does not correspond to a user’s expectations – particularly for Ubiquitous Computing scenarios with user interaction. Adaptations can be irritating and distracting if they are not appropriate for a certain situation. In general, uncertainty during development and at run-time causes problems with users being outside the adaptation loop. In a literature study, we analyse publications about self-adaptive software research. The results show a discrepancy between the motivated application domains, the maturity of examples, and the quality of evaluations on the one hand and the provided solutions on the other hand. Only few publications analysed the impact of their work on the user, but many employ user-oriented examples for motivation and demonstration. To incorporate the user within the adaptation loop and to deal with uncertainty, our proposed solutions enable user participation for interactive selfadaptive software while at the same time maintaining the benefits of intelligent autonomous behaviour. We define three dimensions of user participation, namely temporal, behavioural, and structural user participation. This dissertation contributes solutions for user participation in the temporal and behavioural dimension. The temporal dimension addresses the moment of adaptation which is classically determined by the self-adaptive system. We provide mechanisms allowing users to influence or to define the moment of adaptation. With our solution, users can have full control over the moment of adaptation or the self-adaptive software considers the user’s situation more appropriately. The behavioural dimension addresses the actual adaptation logic and the resulting run-time behaviour. Application behaviour is established during development and does not necessarily match the run-time expectations. Our contributions are three distinct solutions which allow users to make changes to the application’s runtime behaviour: dynamic utility functions, fuzzy-based reasoning, and learning-based reasoning. The foundation of our work is a notification and feedback solution that improves intelligibility and controllability of self-adaptive applications by implementing a bi-directional communication between self-adaptive software and the user. The different mechanisms from the temporal and behavioural participation dimension require the notification and feedback solution to inform users on adaptation actions and to provide a mechanism to influence adaptations. Case studies show the feasibility of the developed solutions. Moreover, an extensive user study with 62 participants was conducted to evaluate the impact of notifications before and after adaptations. Although the study revealed that there is no preference for a particular notification design, participants clearly appreciated intelligibility and controllability over autonomous adaptations.