Log in

Relevant bibliographies by topics / Dynamic adaptation

Academic literature on the topic 'Dynamic adaptation'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Dynamic adaptation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Dynamic adaptation"

1

Wang, Jinsung, and Robert L. Sainburg. "Interlimb Transfer of Novel Inertial Dynamics Is Asymmetrical." Journal of Neurophysiology 92, no. 1 (July 2004): 349–60. http://dx.doi.org/10.1152/jn.00960.2003.

Full text

Abstract:

Mechanisms underlying interlimb transfer of adaptation to visuomotor rotations have recently been explored in depth. However, little data are available regarding interlimb transfer of adaptation to novel inertial dynamics. The present study thus investigated interlimb transfer of dynamics by examining the effect of initial training with one arm on subsequent performance with the other in adaptation to a 1.5-kg mass attached eccentrically to the forearm. Using inverse dynamic analysis, we examined the changes in torque strategies associated with adaptation to the extra mass, and with interlimb transfer of that adaptation. Following initial training with the dominant arm, nondominant arm performance improved substantially in terms of linearity and initial direction control as compared with naïve performance. However, initial training with the nondominant arm had no effect on subsequent performance with the dominant arm. Inverse dynamic analysis revealed that improvements in kinematics were implemented by increasing flexor muscle torques at the elbow to counter load-induced increases in extensor interaction torques as well as increasing flexor muscle torques at the shoulder to counter the extensor actions of elbow muscle torque. Following opposite arm adaptation, the nondominant arm adopted this dynamic strategy early in adaptation. These findings suggest that dominant arm adaptation to novel inertial dynamics leads to information that can be accessed and utilized by the opposite arm controller, but not vice versa. When compared with our previous findings on interlimb transfer of visuomotor rotations, our current findings suggest that adaptations to visuomotor and dynamic transformations are mediated by distinct neural mechanisms.

APA, Harvard, Vancouver, ISO, and other styles

2

Hirschfeld, Robert, and Katsuya Kawamura. "Dynamic service adaptation." Software: Practice and Experience 36, no. 11-12 (2006): 1115–31. http://dx.doi.org/10.1002/spe.766.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Cottrell, Garrison W., Mai Nguyen, and Fu-Sheng Tsung. "Dynamic rate adaptation." Artificial Intelligence Review 7, no. 5 (October 1993): 271–83. http://dx.doi.org/10.1007/bf00849055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brogi, Antonio, Javier Cámara, Carlos Canal, Javier Cubo, and Ernesto Pimentel. "Dynamic Contextual Adaptation." Electronic Notes in Theoretical Computer Science 175, no. 2 (June 2007): 81–95. http://dx.doi.org/10.1016/j.entcs.2007.03.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sonnleitner, B. "Dynamic adaptation of microbes." Journal of Biotechnology 65, no. 1 (September 1998): 47–60. http://dx.doi.org/10.1016/s0168-1656(98)00121-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chandrasekhara, M. S., M. C. Wilder, and L. W. Carr. "Compressible Dynamic Stall Control Using Dynamic Shape Adaptation." AIAA Journal 39, no. 10 (October 2001): 2021–24. http://dx.doi.org/10.2514/2.1196.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chandrasekhara, M. S., M. C. Wilder, and L. W. Carr. "Compressible dynamic stall control using dynamic shape adaptation." AIAA Journal 39 (January 2001): 2021–24. http://dx.doi.org/10.2514/3.14964.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Field, Douglas P., Thomas F. Shipley, and Douglas W. Cunningham. "Prism adaptation to dynamic events." Perception & Psychophysics 61, no. 1 (January 1999): 161–76. http://dx.doi.org/10.3758/bf03211957.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mazhukin, A. V., and V. I. Mazhukin. "Dynamic adaptation for parabolic equations." Computational Mathematics and Mathematical Physics 47, no. 11 (November 2007): 1833–55. http://dx.doi.org/10.1134/s0965542507110097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ortin, Francisco, and Juan Manuel Cueva. "Dynamic adaptation of application aspects." Journal of Systems and Software 71, no. 3 (May 2004): 229–43. http://dx.doi.org/10.1016/s0164-1212(02)00157-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Dynamic adaptation"

1

Flanagin, Virginia L. "Dynamic adaptation in fly motion vision." [S.l.] : [s.n.], 2006. http://edoc.ub.uni-muenchen.de/archive/00005980.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Flanagin, Virginia. "Dynamic Adaptation in Fly Motion Vision." Diss., lmu, 2006. http://nbn-resolving.de/urn:nbn:de:bvb:19-59800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Shehadeh, Dareen. "Dynamic network adaptation for energy saving." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2017. http://www.theses.fr/2017IMTA0067/document.

Full text

Abstract:

Notre travail s'inscrit dans le cadre des recherches sur le Sleeping mode. Notre contribution est structurée principalement autour deux axes : l'étude et l'évaluation de la performance des processus de mise en veille/réveil des points d'accès et la sélection du nombre minimal des points d'accès dans un milieu urbain dense. Dans un premier temps, nous étudions les processus de mise en veille/réveil des points d'accès dans un scenario classique de réseau domestique. Ce scenario suppose que le point d'accès mis en veille doit détecter la présence d'un utilisateur potentiel dans sa zone de couverture et réagir par conséquence d'une façon autonome pour se mettre en état de fonctionnement normal. Nous avons choisi quatre processus de réveil du point d'accès, et nous avons ensuite étudié chacun de ces processus, et proposé un protocole de communication qui permette à un utilisateur d'envoyer l'ordre au point d'accès de s'éteindre. Lorsque cela était possible, nous avons utilisé le protocole COAP qui est prévu pour établir des sessions de commande pour l'Internet des Objets. Nous avons ensuite mesuré les performances du point de vue de l'économie d'énergie qu'il permet de réaliser et du délai entre le moment où un utilisateur potentiel est détecté et le moment où le point d'accès devient opérationnel. Nous avons aussi étudié un réseau dense dans un milieu urbain (le centre ville de Rennes) où la zone de couverture d'un point d'accès pouvait être partiellement ou totalement couverte par d'autres points d'accès. Pour évaluer la redondance dans le réseau, nous avons collecté des informations réelles sur les points d'accès en utilisant l'application Wi2Me. Le traitement de ces informations nous a permis d'identifier les points d'accès existants dans la zone étudiée et leurs zones de couverture respectives démontrant ainsi la superposition de ces zones de couverture et le potentiel d'élimination d'un certain nombre de points d'accès sans affecter la couverture globale. Nous avons alors proposé un système centralisé qui collecte les données de couverture des points d'accès observée par les utilisateur. Nous avons donc utilisé ce simple fait pour centraliser la vue du réseau de plusieurs utilisateurs, ce qui permet d'avoir une vue assez précise de la disponibilité des points d'accès dans une zone géographie. Nous avons alors proposé une représentation de ces données de couverture à travers des matrices qui traitent les différentes erreurs de capture (coordonnées GPS non précises, réutilisation des noms de réseaux, etc). Enfin, nous avons ensuite proposé deux algorithmes permettant de sélectionner l'ensemble minimal des points d'accès requis fournissant une couverture identique à celle d'origine
The main goal of the thesis is to design an Energy Proportional Network by taking intelligent decisions into the network such as switching on and off network components in order to adapt the energy consumption to the user needs. Our work mainly focuses on reducing the energy consumption by adapting the number of APs that are operating to the actual user need. In fact, traffic load varies a lot during the day. Traffic is high in urban areas and low in the suburb during day work hours, while it is the opposite at night. Often, peak loads during rush hours are lower than capacities of the networks. Thus they remain lightly utilized for long periods of time. Thus keeping all APs active all the time even when the traffic is low causes a huge waste of energy. Our goal is to benefit from low traffic periods by automatically switch off redundant cells, taking into consideration the actual number of users, their traffic and the bandwidth requested to serve them. Ideally we wish to do so while maintaining reliable service coverage for existing and new coming users. First we consider a home networking scenario. In this case only one AP covers a given area. So when this AP is switched off (when no users are present), there will be no other AP to fill the gap of coverage. Moreover, upon the arrival of new users, no controller or other mechanism exists to wake up the AP. Consequently, new arriving users would not be served and would remain out of coverage. The study of the state of the art allowed us to have a clear overview of the existing approaches in this context. As a result, we designed a platform to investigate different methods to wake up an AP using different technologies. We measure two metrics to evaluate the Switching ON/OFF process for the different methods. The first is the energy consumed by the AP during the three phases it goes through. The second is the delay of time for the AP to wake up and be operational to serve the new users. In the second case we consider a dense network such as the ones found in urban cities, where the coverage area of an AP is also covered by several other APs. In other words, the gap resulting from switching off one or several APs can be covered by other neighbouring ones. Thus the first thing to do was to evaluate the potential of switching off APs using real measurements taken in a dense urban area. Based on this collected information, we evaluate how many APs can be switched off while maintaining the same coverage. To this end, we propose two algorithms that select the minimum set of APs needed to provide full coverage. We compute several performance parameters, and evaluate the proposed algorithms in terms of the number of selected APs, and the coverage they provide

APA, Harvard, Vancouver, ISO, and other styles

4

Gaillard, Julien. "Recommender systems : dynamic adaptation and argumentation." Thesis, Avignon, 2014. http://www.theses.fr/2014AVIG0201/document.

Full text

Abstract:

Cette thèse présente les résultats d'un projet de recherche multidisciplinaire (Agorantic) sur les systèmes de recommandation. Le but de ce travail était de proposer de nouvelles fonctionnalités qui peuvent rendre les systèmes de recommandations (RS) plus attrayants que ceux existants. Nous proposons également une nouvelle approche et une réflexion sur l'évaluation. Dans la conception du système, nous avons voulu répondre aux préoccupations suivantes: 1. Les gens s'habituent à recevoir des recommandations. Néanmoins, après quelques mauvaises recommandations, les utilisateurs ne seront plus convaincus par les RS. 2. En outre, si ces suggestions viennent sans explication, pourquoi les gens devraient les suivre ? 3. Le fait que la perception, les goûts et les humeurs des utilisateurs goûts varient au fil du temps est bien connue. Pourtant, la plupart des systèmes de recommandation ne parviennent pas à offrir le bon niveau de «réactivité» que les utilisateurs attendent, c'est à dire la capacité de détecter et d'intégrer des changements dans les besoins, les préférences, la popularité, etc. Recommander un film une semaine après sa sortie pourrait être trop tard. 4. L'utilisateur pourrait être intéressé par des articles moins populaires (dans la «longue traine»), c'est à dire des recommandations moins systématiques. Pour répondre à ces questions clés, nous avons conçu un nouveau système de recommandation sémantique et adaptatif (SRAS), comportant trois fonctionnalités innovantes, à savoir l'argumentation, l'adaptation dynamique et un algorithme d'appariement. • Adaptation dynamique: le système est mis à jour de façon continue, à chaque nouvelle note / évènement. (Chapitre 4) • Argumentation: chaque recommandation présente les raisons qui ont conduit à cette recommandation. Cela peut être considéré comme une première étape vers une argumentation plus sophistiqué. Notre volonté est de rendre les utilisateurs plus responsables de leur choix, en leur donnant le maximum d'informations. (Chapitre 5) • Algorithme d'appariement: permet aux articles les moins populaires d'être recommandés aux utilisateurs. (Chapitre 6) Nous avons conçu un nouveau système de recommandation capable de générer des recommandations textuellement bien argumentées dans lequel l'utilisateur final aura plusieurs éléments pour faire un choix éclairé. En outre, les paramètres du système sont dynamiquement et continuellement mis à jour, afin de fournir des recommandations et des arguments en la phase avec le passé très récent. Nous avons inclus un niveau sémantique, c'est à dire les mots, termes et expressions comme ils sont naturellement exprimés dans les commentaires utilisateurs. Nous n'utilisons pas d'étiquettes ou lexique pré-déterminé. Les performances de notre système sont comparables à l'état de l'art. En outre, le fait qu'il génère un argumentaire le rend encore plus attrayant et pourrait renforcer la fidélité des utilisateurs
This thesis presents the results of a multidisciplinary research project (Agorantic) on Recommender Systems. The goal of this work was to propose new features that may render recommender systems (RS) more attractive than the existing ones. We also propose a new approach to and a reflection about evaluation. In designing the system, we wanted to address the following concerns: 1. People are getting used to receive recommendations. Nevertheless, after a few bad recommendations, users will not be convinced anymore by the RS. 2. Moreover, if these suggestions come without explanations, why people should trust it? 3. The fact that item perception and user tastes and moods vary over time is well known. Still, most recommender systems fail to offer the right level of “reactivity” that users are expecting, i.e. the ability to detect and to integrate changes in needs, preferences, popularity, etc. Suggesting a movie a week after its release might be too late. In the same vein, it could take only a few ratings to make an item go from not advisable to advisable, or the other way around. 4. Users might be interested in less popular items (in the ” long tail”) and want less systematic recommendations. To answer these key issues, we have designed a new semantic and adaptive recommender system (SARS) including three innovative features, namely Argumentation, Dynamic Adaptation and a Matching Algorithm. • Dynamic Adaptation: the system is updated in a continuous way, as each new review/rating is posted. (Chapter 4) • Argumentation: each recommendation relies on and comes along with some keywords, providing the reasons that led to that recommendation. This can be seen as a first step towards a more sophisticated argumentation. We believe that, by making users more responsible for their choices, it will prevent them from losing confidence in the system. (Chapter 5) • Matching Algorithm: allows less popular items to be recommended by applying a match- ing game to users and items preferences. (Chapter 6) The system should be sensed as less intrusive thanks to relevant arguments (well-chosen words) and less responsible to unsatisfaction of the customers. We have designed a new recommender system intending to provide textually well-argued recommendations in which the end user will have more elements to make a well-informed choice. Moreover, the system parameters are dynamically and continuously updated, in order to pro- vide recommendations and arguments in phase with the very recent past. We have included a semantic level, i.e words, terms and phrases as they are naturally expressed in reviews about items. We do not use tags or pre-determined lexicon. The performances of our system are comparable to the state of the art. In addition, the fact that it provides argumentations makes it even more attractive and could enhance customers loyalty

APA, Harvard, Vancouver, ISO, and other styles

5

Wladdimiro, Cottet Daniel. "Dynamic adaptation in Stream Processing Systems." Electronic Thesis or Diss., Sorbonne université, 2024. http://www.theses.fr/2024SORUS028.

Full text

Abstract:

Le nombre de données produites par les systèmes ou applications Web actuels augmente rapidement en raison des nombreuses interactions avec les utilisateurs (dans le cadre par exemple, transactions boursières en temps réel, des jeux multijoueurs, des données en continu produits par Twitter, etc.). Ainsi, il existe une demande croissante, notamment dans les domaines du commerce, de la sécurité et de la recherche, pour des systèmes capables de traiter ces données en temps réel et de fournir des informations utiles dans un court laps de temps. Les systèmes de traitement des flux (SPS) répondent à ces besoins et ont été largement utilisés à cette fin. L’objectif des SPS est de traiter de grands volumes de données en temps réel en endentent un ensemble d’opérateurs dans des applications structurée en DAG. Le plupart des SPS existants, tels que Flink ou Storm, sont configurés avant leur déploiement, définissant généralement à l’avance le DAG et le nombre de répliques opérateurs. Une surestimation du nombre de répliques entraîne alors un gaspillage des ressources allouées. D’autre part, en fonction de l’interaction avec l’environnement, le taux de données en entrée peut fluctuer de manière dynamique et, par conséquent, les opérateurs peuvent être surchargés, ce qui entraîne une dégradation des performances du système. Ces SPS ne sont pas capables de s’adapter dynamiquement à la charge de travail de l’opérateur et aux variations du taux d’entrée. Pour résoudre ce problème, une solution consiste à augmenter dynamiquement le nombre de ressources, physiques ou logiques, allouées au SPS lorsque la demande de traitement d’un ou plusieurs opérateurs augmente. Nous présentons dans cette thèse deux approches, RA-SPS et PA-SPS, pour modifier dynamiquement le nombre de répliques d’un opérateur. L’approche réactive repose sur l’état courant des opérateurs calculé sur de multiples métriques. Tandis que le modèle prédictif se base sur la variation du taux d’entrée, le temps d’exécution des opérateurs et les événements en file d’attente. Nous avons également étendu Storm pour reconfigurer dynamiquement le nombre de copies sans avoir à geler l’application. Notre SPS met aussi en œuvre un équilibreur de charge qui distribue les événements entrants de manière équitable entre les répliques d’un opérateur. Des expériences sur la Google Cloud Platform (GCP) ont été menées avec des applications qui traitent le flux Twitter, le trafic DNS ou les traces de flux du journal système. Nous avons évalué différentes configurations et les avons comparées avec l’implémentation originale de Storm ainsi qu’avec des travaux de pointe tels que SPS DABS-Storm qui adapte également le nombre de répliques. Les résultat montrent que notre approche permet d’améliorer de manière conséquente le nombre d’événement traité tout en réduisant les coûts
The amount of data produced by today’s web-based systems and applications increases rapidly, due to the many interactions with users (e.g. real-time stock market transactions, multiplayer games, streaming data produced by Twitter, etc.). As a result, there is a growing demand, particularly in the fields of commerce, security and research, for systems capable of processing this data in real time and providing useful information in a short space of time. Stream processing systems (SPS) meet these needs and have been widely used for this purpose. The aim of SPSs is to process large volumes of data in real time by housing a set of operators in applications based on Directed acyclic graphs (DAG). Most existing SPSs, such as Flink or Storm, are configured prior to deployment, usually defining the DAG and the number of operator replicas in advance. Overestimating the number of replicas can lead to a waste of allocated resources. On the other hand, depending on interaction with the environment, the rate of input data can fluctuate dynamically and, as a result, operators can become overloaded, leading to a degradation in system performance. These SPSs are not capable of dynamically adapting to operator workload and input rate variations. One solution to this problem is to dynamically increase the number of resources, physical or logical, allocated to the SPS when the processing demand of one or more operators increases. This thesis presents two SPSs, RA-SPS and PA-SPS, reactive and predictive approach respectively, for dynamically modifying the number of operator replicas. The reactive approach relies on the current state of operators computed on multiple metrics, while the predictive model is based on input rate variation, operator execution time, and queued events. The two SPSs extend Storm SPS to dynamically reconfigure the number of copies without having to downtime the application. They also implement a load balancer that distributes incoming events fairly among operator replicas. Experiments on the Google Cloud Platform (GCP) were carried out with applications that process Twitter data, DNS traffic, or logs traces. Performance was evaluated with different configurations and the results were compared with those of running the same applications on the original Storm as well as with state-of-the-art work such as SPS DABS-Storm, which also adapt the number of replicas. The comparison shows that both RA-SPS and PA-SPS can significantly improve the number of events processed, while reducing costs

APA, Harvard, Vancouver, ISO, and other styles

6

De, Sanctis Martina. "Dynamic Adaptation of Service-Based Systems: a Design for Adaptation Framework." Doctoral thesis, Università degli studi di Trento, 2018. https://hdl.handle.net/11572/368603.

Full text

Abstract:

A key challenge posed by the Next Generation Internet landscape, is that modern service-based systems need to cope with open and continuously evolving environments and to operate under dynamic circumstances. Dynamism is given by changes in the operational context, changes in the availability of resources and variations in their behavior, changes in users goals, etc. Indeed, dynamically discover, select and compose the appropriate services in open and expanding domains is a challenging task. Many approaches for self-adaptive systems have been proposed in the last decades. Unfortunately, although they support run-time adaptation, current approaches tend to foresee the system adaptation requirements and their related solutions at design-time. This makes them inadequate for the application in open environments, where components constantly join/leave the system, since they require for continuous involvement of IT and domain experts for the systems re-configuration. We claim that a new way of approaching the adaptation of systems is needed. In this dissertation, we propose a novel design for adaptation framework for modeling and executing modern service-based systems. The idea of the approach consists in defining the complete life-cycle for the continuous development and deployment of service-based systems, by facilitating (i) the continuous integration of new services that can easily join the systems, and (ii) the systems operation under dynamic circumstances, to face the openness and dynamicity of the environment. Furthermore, Collective Adaptive Systems (CAS) are spreading in new emerging contexts, such as the shared economy trend. Modern systems are expected to handle a multitude of heterogeneous components that cooperate to accomplish collective tasks. In these settings, an extension of our framework in the direction of CAS has also been defined. The core enablers of the proposed framework have been implemented and evaluated in real-world scenarios in the mobility domain. Promising evaluation results demonstrate their practical applicability.

APA, Harvard, Vancouver, ISO, and other styles

7

De, Sanctis Martina. "Dynamic Adaptation of Service-Based Systems: a Design for Adaptation Framework." Doctoral thesis, University of Trento, 2018. http://eprints-phd.biblio.unitn.it/2947/1/Online_PhD-Thesis_MartinaDeSanctis.pdf.

Full text

Abstract:

A key challenge posed by the Next Generation Internet landscape, is that modern service-based systems need to cope with open and continuously evolving environments and to operate under dynamic circumstances. Dynamism is given by changes in the operational context, changes in the availability of resources and variations in their behavior, changes in users goals, etc. Indeed, dynamically discover, select and compose the appropriate services in open and expanding domains is a challenging task. Many approaches for self-adaptive systems have been proposed in the last decades. Unfortunately, although they support run-time adaptation, current approaches tend to foresee the system adaptation requirements and their related solutions at design-time. This makes them inadequate for the application in open environments, where components constantly join/leave the system, since they require for continuous involvement of IT and domain experts for the systems re-configuration. We claim that a new way of approaching the adaptation of systems is needed. In this dissertation, we propose a novel design for adaptation framework for modeling and executing modern service-based systems. The idea of the approach consists in defining the complete life-cycle for the continuous development and deployment of service-based systems, by facilitating (i) the continuous integration of new services that can easily join the systems, and (ii) the systems operation under dynamic circumstances, to face the openness and dynamicity of the environment. Furthermore, Collective Adaptive Systems (CAS) are spreading in new emerging contexts, such as the shared economy trend. Modern systems are expected to handle a multitude of heterogeneous components that cooperate to accomplish collective tasks. In these settings, an extension of our framework in the direction of CAS has also been defined. The core enablers of the proposed framework have been implemented and evaluated in real-world scenarios in the mobility domain. Promising evaluation results demonstrate their practical applicability.

APA, Harvard, Vancouver, ISO, and other styles

8

Sofokleoous, Anastasis A. "An MPEG-21 dynamic content adaptation framework." Thesis, Brunel University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435143.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Marín, Isern Lucas. "Dynamic adaptation of user profiles in recommender systems." Doctoral thesis, Universitat Rovira i Virgili, 2013. http://hdl.handle.net/10803/123905.

Full text

Abstract:

In a period of time in which the content available through the Internet increases exponentially and is more easily accessible every day, techniques for aiding the selection and extraction of important and personalised information are of vital importance. Recommender Systems (RS) appear as a tool to help the user in a decision making process by evaluating a set of objects or alternatives and aiding the user at choosing which one/s of them suits better his/her interests or preferences. Those preferences need to be accurate enough to produce adequate recommendations and should be updated if the user changes his/her likes or if they are incorrect or incomplete. In this work an adequate model for managing user preferences in a multi-attribute (numerical and categorical) environment is presented to aid at providing recommendations in those kinds of contexts. The evaluation process of the recommender system designed is supported by a new aggregation operator (Unbalanced LOWA) that enables the combination of the information that defines an alternative into a single value, which then is used to rank the whole set of alternatives. After the recommendation has been made, learning processes have been designed to evaluate the user interaction with the system to find out, in a dynamic and unsupervised way, if the user profile in which the recommendation process relies on needs to be updated with new preferences. The work detailed in this document also includes extensive evaluation and testing of all the elements that take part in the recommendation and learning processes.

APA, Harvard, Vancouver, ISO, and other styles

10

Kramer, Dean. "Unified GUI adaptation in Dynamic Software Product Lines." Thesis, University of West London, 2014. https://repository.uwl.ac.uk/id/eprint/1270/.

Full text

Abstract:

In the modern world of mobile computing and ubiquitous technology, society is able to interact with technology in new and fascinating ways. To help provide an improved user experience, mobile software should be able to adapt itself to suit the user. By monitoring context information based on the environment and user, the application can better meet the dynamic requirements of the user. Similarly, it is noticeable that programs can require different static changes to suit static requirements. This program commonality and variability can benefit from the use of Software Product Line Engineering, reusing artefacts over a set of similar programs, called a Software Product Line (SPL). Historically, SPLs are limited to handling static compile time adaptations. Dynamic Software Product Lines (DSPL) however, allow for the program configuration to change at runtime, allow for compile time and runtime adaptation to be developed in a single unified approach. While currently DSPLs provide methods for dealing with program logic adaptations, variability in the Graphical User Interface (GUI) has largely been neglected. Due to this, depending on the intended time to apply GUI adaptation, different approaches are required. The main goal of this work is to extend a unified representation of variability to the GUI, whereby GUI adaptation can be applied at compile time and at runtime. In this thesis, an approach to handling GUI adaptation within DSPLs, providing a unified representation of GUI variability is presented. The approach is based on Feature-Oriented Programming (FOP), enabling developers to implement GUI adaptation along with program logic in feature modules. This approach is applied to Document- Oriented GUIs, also known as GUI description languages. In addition to GUI unification, we present an approach to unifying context and feature modelling, and handling context dynamically at runtime, as features of the DSPL. This unification can allow for more dynamic and self-aware context acquisition. To validate our approach, we implemented tool support and middleware prototypes. These different artefacts are then tested using a combination of scenarios and scalability tests. This combination first helps demonstrate the versatility and its relevance of the different approach aspects. It further brings insight into how the approach scales with DSPL size.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Dynamic adaptation"

1

Saunders-Newton, Desmond K. Adaptive battlefield ammunition distribution: The role of systemic adaptation in dynamic emvironments. Santa Monica, CA: Rand, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Olivas, Frumen, Fevrier Valdez, Oscar Castillo, and Patricia Melin. Dynamic Parameter Adaptation for Meta-Heuristic Optimization Algorithms Through Type-2 Fuzzy Logic. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70851-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Valdez, Fevrier, Cinthia Peraza, and Oscar Castillo. General Type-2 Fuzzy Logic in Dynamic Parameter Adaptation for the Harmony Search Algorithm. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43950-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Castillo, Oscar, Patricia Ochoa, and Jose Soria. Differential Evolution Algorithm with Type-2 Fuzzy Logic for Dynamic Parameter Adaptation with Application to Intelligent Control. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-62133-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Adaptation in dynamical systems. Cambridge: Cambridge University Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Michod, Richard E. Darwinian dynamics: Evolutionary transitions in fitness and individuality. Princeton, N.J: Princeton University Press, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Treur, Jan, and Laila Van Ments, eds. Mental Models and Their Dynamics, Adaptation, and Control. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-85821-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Thermal adaptation of conformational dynamics in ribonuclease H. [New York, N.Y.?]: [publisher not identified], 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Adaptation, poverty and development: The dynamics of subjective well-being. Basingstoke: Palgrave Macmillan, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Luo, Maohui. The Dynamics and Mechanism of Human Thermal Adaptation in Building Environment. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1165-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Dynamic adaptation"

1

Liseikin, Vladimir D. "Dynamic Adaptation." In Scientific Computation, 195–226. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-2912-6_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Liseikin, Vladimir. "Dynamic Adaptation." In Scientific Computation, 195–225. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03949-6_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Grace, Paul. "Dynamic Adaptation." In Middleware for Network Eccentric and Mobile Applications, 285–302. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-89707-1_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Melis, Alessandro, Telmo Pievani, and Jose Antonio Lara-Hernandez. "Dynamic Adaptation." In Architectural Exaptation, 75–83. London: Routledge, 2024. http://dx.doi.org/10.4324/9781003347118-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Smagorinsky, Peter. "Adaptation as Reciprocal Dynamic." In Creativity and Community among Autism-Spectrum Youth, 51–76. New York: Palgrave Macmillan US, 2016. http://dx.doi.org/10.1057/978-1-137-54797-2_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schneider, Waldemar. "Jing in Dynamic Adaptation." In Taoist Principles and Practices in Management, 91–106. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-31176-5_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Fleurey, Franck, Vegard Dehlen, Nelly Bencomo, Brice Morin, and Jean-Marc Jézéquel. "Modeling and Validating Dynamic Adaptation." In Models in Software Engineering, 97–108. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01648-6_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Buisson, Jérémy, Françoise André, and Jean-Louis Pazat. "Dynamic Adaptation for Grid Computing." In Advances in Grid Computing - EGC 2005, 538–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11508380_55.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mulhollan, Zachary, Aneesh Rangnekar, Anthony Vodacek, and Matthew J. Hoffman. "Occlusion Detection for Dynamic Adaptation." In Lecture Notes in Computer Science, 337–44. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61725-7_39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Le, Truong Giang, Olivier Hermant, Matthieu Manceny, and Renaud Pawlak. "Dynamic Adaptation through Event Reconfiguration." In On the Move to Meaningful Internet Systems: OTM 2011 Workshops, 637–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25126-9_78.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Dynamic adaptation"

1

Hirschfeld, R., and K. Kawamura. "Dynamic service adaptation." In 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/icdcsw.2004.1284045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chang, David, Thu Nguyen, and Niko Takayesu. "Scrambler: dynamic layout adaptation." In SPLASH '16: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2984043.2998549.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Nagel, Sebastian, and Peter Jax. "Dynamic Binaural Cue Adaptation." In 2018 16th International Workshop on Acoustic Signal Enhancement (IWAENC). IEEE, 2018. http://dx.doi.org/10.1109/iwaenc.2018.8521348.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Vidal, Juan C., Manuel Lama, Beatriz Fern´ndez-Gallego, and Alberto Bugarin. "Dynamic Adaptation in OPENET4LD." In 2011 11th IEEE International Conference on Advanced Learning Technologies (ICALT). IEEE, 2011. http://dx.doi.org/10.1109/icalt.2011.68.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fox, Jorge, and Siobhán Clarke. "Exploring approaches to dynamic adaptation." In the 3rd International DiscCoTec Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1566966.1566970.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Stotts, P. David, and Richard Furuta. "Dynamic adaptation of hypertext structure." In the third annual ACM conference. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/122974.122996.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Unnikrishnan, P., G. Chen, M. Kandemir, and D. R. Mudgett. "Dynamic compilation for energy adaptation." In the 2002 IEEE/ACM international conference. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/774572.774595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Biyani, K. N., and Sandeep S. Ku. "Concurrency Tradeoffs in Dynamic Adaptation." In 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06). IEEE, 2006. http://dx.doi.org/10.1109/icdcsw.2006.32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Pellan, B., and C. Concolato. "Media-Driven Dynamic Scene Adaptation." In Eighth International Workshop on Image Analysis for Multimedia Interactive Services (WIAMIS '07). IEEE, 2007. http://dx.doi.org/10.1109/wiamis.2007.56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Baker, Timothy, and Peter Cavallo. "Dynamic adaptation for deforming tetrahedral meshes." In 14th Computational Fluid Dynamics Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1999. http://dx.doi.org/10.2514/6.1999-3253.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Dynamic adaptation"

1

Balman, Mehmet. Dynamic Adaptation for High-Performance Data Transfers. Office of Scientific and Technical Information (OSTI), January 2011. http://dx.doi.org/10.2172/1165474.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Handley, Holly A., and Alexander H. Levis. On Organizational Adaptation via Dynamic Process Selection. Fort Belvoir, VA: Defense Technical Information Center, January 2000. http://dx.doi.org/10.21236/ada461378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Biyani, Karun N., and Sandeep S. Kulkarni. Concurrency and Complexity in Verifying Dynamic Adaptation: A Case Study. Fort Belvoir, VA: Defense Technical Information Center, January 2005. http://dx.doi.org/10.21236/ada455693.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Gauthier, John H., Nadine E. Miner, Michael L. Wilson, Hai D. Le, Gio K. Kao, Darryl J. Melander, Dennis Earl Longsine, and Robert C. Vander Meer, Jr. Quantitative adaptation analytics for assessing dynamic systems of systems: LDRD Final Report. Office of Scientific and Technical Information (OSTI), January 2015. http://dx.doi.org/10.2172/1167412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ye, Nong. Models of Quality of Service and Quality of Information Assurance Towards Their Dynamic Adaptation. Fort Belvoir, VA: Defense Technical Information Center, March 2011. http://dx.doi.org/10.21236/ada541993.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Prusa, Joseph. COLLABORATIVE RESEARCH: CONTINUOUS DYNAMIC GRID ADAPTATION IN A GLOBAL ATMOSPHERIC MODEL: APPLICATION AND REFINEMENT. Office of Scientific and Technical Information (OSTI), May 2012. http://dx.doi.org/10.2172/1043034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gutowski, William J., Joseph M. Prusa, and Piotr K. Smolarkiewicz. COLLABORATIVE RESEARCH: CONTINUOUS DYNAMIC GRID ADAPTATION IN A GLOBAL ATMOSPHERIC MODEL: APPLICATION AND REFINEMENT. Office of Scientific and Technical Information (OSTI), May 2012. http://dx.doi.org/10.2172/1043077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhu, X., R. Pan, M. Ramalho, and S. Mena. Network-Assisted Dynamic Adaptation (NADA): A Unified Congestion Control Scheme for Real-Time Media. RFC Editor, February 2020. http://dx.doi.org/10.17487/rfc8698.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chen, Yongzhou, Ammar Tahir, and Radhika Mittal. Controlling Congestion via In-Network Content Adaptation. Illinois Center for Transportation, September 2022. http://dx.doi.org/10.36501/0197-9191/22-018.

Full text

Abstract:

Realizing that it is inherently difficult to match precisely the sending rates at the endhost with the available capacity on dynamic cellular links, we built a system, Octopus, that sends real-time data streams over cellular networks using an imprecise controller (that errs on the side of overestimating network capacity) and then drops appropriate packets in the cellular-network buffers to match the actual capacity. We designed parameterized primitives for implementing the packet-dropping logic, which the applications at the endhost can configure differently to express various content-adaptation policies. Octopus transport encodes the app-specified parameters in packet header fields, which the routers can parse to execute the desired dropping behavior. Our evaluation shows how real-time applications involving standard and volumetric videos can be designed to exploit Octopus for various requirements and achieve a performance that is 1.5 to 18 times better than state-of-the-art schemes.

APA, Harvard, Vancouver, ISO, and other styles

10

Greene, Patrick T., Samuel P. Schofield, and Robert Nourgaliev. Dynamic Mesh Adaptation for Front Evolution Using Discontinuous Galerkin Based Weighted Condition Number Mesh Relaxation. Office of Scientific and Technical Information (OSTI), June 2016. http://dx.doi.org/10.2172/1260506.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!