Relevant bibliographies by topics / Dynamic update

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Dynamic update'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

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

Select a source type:

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

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 update"

1

Deshmukh, Ankosh D., Nitesh D. Shambharkar, and Prashant M. Gade. "Effect of a Mode of Update on Universality Class for Coupled Logistic Maps: Directed Ising to Ising Class." International Journal of Bifurcation and Chaos 31, no. 03 (March 15, 2021): 2150042. http://dx.doi.org/10.1142/s0218127421500425.

Full text
Abstract:
Ising model at zero temperature leads to a ferromagnetic state asymptotically. There are two such possible states linked by symmetry, and Glauber–Ising dynamics are employed to reach them. In some stochastic or deterministic dynamical systems, the same absorbing state with [Formula: see text] symmetry is reached. This transition often belongs to the directed Ising (DI) class where dynamic exponents and persistence exponent are different. In asymmetrically coupled sequentially updated logistic maps, the transition belongs to the DI class. We study changes in the nature of transition with an update scheme. Even with the synchronous update, the transition still belongs to the DI class. We also study a synchronous probabilistic update scheme in which each site is updated with the probability [Formula: see text]. The order parameter decays with an exponent [Formula: see text] in this scheme. Nevertheless, the dynamic exponent [Formula: see text] is less than [Formula: see text] even for small values of [Formula: see text] indicating a very slow crossover to the Ising class. However, with a random asynchronous update, we recover [Formula: see text]. In the presence of feedback, synchronous update leads to a transition in the DI universality class which changes to Ising class for synchronous probabilistic update.
APA, Harvard, Vancouver, ISO, and other styles
2

KOOI, BARTELD, and BRYAN RENNE. "ARROW UPDATE LOGIC." Review of Symbolic Logic 4, no. 4 (October 13, 2011): 536–59. http://dx.doi.org/10.1017/s1755020311000189.

Full text
Abstract:
We presentArrow Update Logic, a theory of epistemic access elimination that can be used to reason about multi-agent belief change. While the belief-changing “arrow updates” of Arrow Update Logic can be transformed into equivalent belief-changing “action models” from the popular Dynamic Epistemic Logic approach, we prove that arrow updates are sometimes exponentially more succinct than action models. Further, since many examples of belief change are naturally thought of from Arrow Update Logic’s perspective of eliminating access to epistemic possibilities, Arrow Update Logic is a valuable addition to the repertoire of logics of information change. In addition to proving basic results about Arrow Update Logic, we introduce a new notion of common knowledge that generalizes both ordinary common knowledge and the “relativized” common knowledge familiar from the Dynamic Epistemic Logic literature.
APA, Harvard, Vancouver, ISO, and other styles
3

SLOTA, MARTIN, and JOÃO LEITE. "Towards closed world reasoning in dynamic open worlds." Theory and Practice of Logic Programming 10, no. 4-6 (July 2010): 547–63. http://dx.doi.org/10.1017/s147106841000027x.

Full text
Abstract:
AbstractThe need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this problem by proposing a unified semantics forhybrid knowledge basescomposed of both an ontology (expressed in a fragment of first-order logic) and nonmonotonic rules. These semantics have matured over the years, but only provide solutions for the static case when knowledge does not need to evolve.In this paper we take a first step towards addressing the dynamics of hybrid knowledge bases. We focus on knowledge updates and, considering the state of the art of belief update, ontology update and rule update, we show that current solutions are only partial and difficult to combine. Then we extend the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties.To the best of our knowledge, this is the first time that an update operator is proposed for hybrid knowledge bases.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhou, Liang, Nan Ya Cao, Lu Li, Li Xin Ke, and Kai Jun Wu. "Research on Service Update Dynamically Based on OSGi Frame." Applied Mechanics and Materials 513-517 (February 2014): 1769–72. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1769.

Full text
Abstract:
It is a key problem for a 7*24 running system to update and maintain online. According to the feature of OSGi (Open Service Gateway Initiative) framework, current service dynamic update policies for OSGi framework are analyzed. In order to solve the problem of service mutual consistency and service state consistency during service update, the service dynamic update policy based on publish & subscribe model is presented. This policy is based on quiescent state theory to ensure mutual consistency when services are updated online. The process of the dynamic service update policy is described by Petri net. We realize the policy using Event Admin Service in the experiment with well-defined program model. The result shows that the policy is validate and feasibility.
APA, Harvard, Vancouver, ISO, and other styles
5

van Benthem, Johan, Jelle Gerbrandy, and Barteld Kooi. "Dynamic Update with Probabilities." Studia Logica 93, no. 1 (September 17, 2009): 67–96. http://dx.doi.org/10.1007/s11225-009-9209-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Han, Min, Sunan Ge, Minghui Wang, Xiaojun Hong, and Jie Han. "A Novel Dynamic Update Framework for Epileptic Seizure Prediction." BioMed Research International 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/957427.

Full text
Abstract:
Epileptic seizure prediction is a difficult problem in clinical applications, and it has the potential to significantly improve the patients’ daily lives whose seizures cannot be controlled by either drugs or surgery. However, most current studies of epileptic seizure prediction focus on high sensitivity and low false-positive rate only and lack the flexibility for a variety of epileptic seizures and patients’ physical conditions. Therefore, a novel dynamic update framework for epileptic seizure prediction is proposed in this paper. In this framework, two basic sample pools are constructed and updated dynamically. Furthermore, the prediction model can be updated to be the most appropriate one for the prediction of seizures’ arrival. Mahalanobis distance is introduced in this part to solve the problem of side information, measuring the distance between two data sets. In addition, a multichannel feature extraction method based on Hilbert-Huang transform and extreme learning machine is utilized to extract the features of a patient’s preseizure state against the normal state. At last, a dynamic update epileptic seizure prediction system is built up. Simulations on Freiburg database show that the proposed system has a better performance than the one without update. The research of this paper is significantly helpful for clinical applications, especially for the exploitation of online portable devices.
APA, Harvard, Vancouver, ISO, and other styles
7

Han, Jian Ping, and Yong Peng Luo. "Static and Dynamic Finite Element Model Updating of a Rigid Frame-Continuous Girders Bridge Based on Response Surface Method." Advanced Materials Research 639-640 (January 2013): 992–97. http://dx.doi.org/10.4028/www.scientific.net/amr.639-640.992.

Full text
Abstract:
Using the static and dynamic test data simultaneously to update the finite element model can increase the available information for updating. It can overcome the disadvantages of updating based on static or dynamic test data only. In this paper, the response surface method is adopted to update the finite element model of the structure based on the static and dynamic test. Using the reasonable experiment design and regression techniques, a response surface model is formulated to approximate the relationships between the parameters and response values instead of the initial finite element model for further updating. First, a numerical example of a reinforced concrete simply supported beam is used to demonstrate the feasibility of this approach. Then, this approach is applied to update the finite element model of a prestressed reinforced concrete rigid frame-continuous girders bridge based on in-situ static and dynamic test data. Results show that this approach works well and achieve reasonable physical explanations for the updated parameters. The results from the updated model are in good agreement with the results from the in-situ measurement. The updated finite element model can accurately represent mechanical properties of the bridge and it can serve as a benchmark model for further damage detection and condition assessment of the bridge.
APA, Harvard, Vancouver, ISO, and other styles
8

Goldstein, Simon. "Generalized Update Semantics." Mind 128, no. 511 (February 8, 2019): 795–835. http://dx.doi.org/10.1093/mind/fzy076.

Full text
Abstract:
Abstract This paper explores the relationship between dynamic and truth conditional semantics for epistemic modals. It provides a generalization of a standard dynamic update semantics for modals. This new semantics derives a Kripke semantics for modals and a standard dynamic semantics for modals as special cases. The semantics allows for new characterizations of a variety of principles in modal logic, including the inconsistency of ‘p and might not p’. Finally, the semantics provides a construction procedure for transforming any truth conditional semantics for modals into a dynamic semantics for modals with similar properties.
APA, Harvard, Vancouver, ISO, and other styles
9

MAELBRÁNCKE, RUDI, and HENK OLIVIÉ. "DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING." International Journal of Foundations of Computer Science 05, no. 03n04 (December 1994): 247–60. http://dx.doi.org/10.1142/s012905419400013x.

Full text
Abstract:
A simple algorithm is given to rebalance a binary search tree of optimal height after a single update. The algorithm uses time which is linear in the number of nodes. In comparison to previous algorithms it is short and very easy to implement. Moreover, this algorithm can be used to implement other classes of balanced trees and it is suitable for each update. When applied to perfectly balanced trees it has a lower average cost than previous algorithms.
APA, Harvard, Vancouver, ISO, and other styles
10

Jung, Yoo Sun, Flávio D. S. Souza, Andrew Q. Philips, Amanda Rutherford, and Guy D. Whitten. "A command to estimate and interpret models of dynamic compositional dependent variables: New features for dynsimpie." Stata Journal: Promoting communications on statistics and Stata 20, no. 3 (September 2020): 584–603. http://dx.doi.org/10.1177/1536867x20953570.

Full text
Abstract:
Philips, Rutherford, and Whitten (2016, Stata Journal 16: 662–677) introduced dynsimpie, a command to examine dynamic compositional dependent variables. In this article, we present an update to dynsimpie and three new adofiles: cfbplot, effectsplot, and dynsimpiecoef. These updates greatly enhance the range of models that can be estimated and the ways in which model results can now be presented. The command dynsimpie has been updated so that users can obtain both prediction plots and change-from-baseline plots using postestimation commands. With the new command dynsimpiecoef, various types of coefficient plots can also be obtained. We illustrate these improvements using monthly data on support for political parties in the United Kingdom.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Dynamic update"

1

Baumann, Andrew Computer Science &amp Engineering Faculty of Engineering UNSW. "Dynamic update for operating systems." Awarded by:University of New South Wales. Computer Science and Engineering, 2007. http://handle.unsw.edu.au/1959.4/28356.

Full text
Abstract:
Patches to modern operating systems, including bug fixes and security updates, and the reboots and downtime they require, cause tremendous problems for system users and administrators. The aim of this research is to develop a model for dynamic update of operating systems, allowing a system to be patched without the need for a reboot or other service interruption. In this work, a model for dynamic update based on operating system modularity is developed and evaluated using a prototype implementation for the K42 operating system. The prototype is able to update kernel code and data structures, even when the interfaces between kernel modules change. When applying an update, at no point is the system's entire execution blocked, and there is no additional overhead after an update has been applied. The base runtime overhead is also very low. An analysis of the K42 revision history shows that approximately 79% of past performance and bug-fix changes to K42 could be converted to dynamic updates, and the proportion would be even higher if the changes were being developed for dynamic update. The model also extends to other systems such as Linux and BSD, that although structured modularly, are not strictly object-oriented like K42. The experience with this approach shows that dynamic update for operating systems is feasible given a sufficiently-modular system structure, allows maintenance patches and updates to be applied without disruption, and need not constrain system performance.
APA, Harvard, Vancouver, ISO, and other styles
2

CAMARA, EDUARDO CASTRO MOTA. "A STUDY OF DYNAMIC UPDATE FOR SOFTWARE COMPONENTS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23529@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO
PROGRAMA DE EXCELENCIA ACADEMICA
O desenvolvimento baseado em sistemas de componentes de software consiste em compor sistemas a partir de unidades de sotfware prontas e reutilizáveis. Muitos sistemas de componentes software em produção, precisam ficar disponíveis durante 24 horas por dia nos 7 dias da semana. Atualizações dinâmicas permitem que os sistemas sejam atualizados sem interromperem a execução dos seus serviços, aplicando a atualização em tempo de execução. Muitas técnicas de atualização dinâmica, na literatura, utilizam aplicações feitas especificamente para cobrir os pontos implementados e poucas utilizam um histórico de necessidades de um sistema real. Este trabalho estuda os principais casos de atualizações que ocorrem em um sistema de componentes de uso extenso, o Openbus, que consiste em uma infraestrutura de integração responsável pela comunicação de diversas aplicações de aquisição, processamento e interpretação de dados. Além deste estudo, implementamos uma solução de atualização dinâmica para acomodar as necessidades deste sistema. Depois, utilizando a solução implementada, apresentamos um teste de sobrecarga e algumas aplicações de atualizações do Openbus.
The component-based development of software systems consists on composing systems from ready and reusable sotfware units. Many software componente systems on production, need to be available 24 hours a day 7 days a week. Dynamic updates allow systems to be upgraded without interrupting the execution of its services, applying the update at runtime. Many dynamics software update techniques in the literature use applications specically implemented to cover the presented points and only a few use a historical need of a real system. This work studies the main cases of updates that occur in a system of components with extensive use, the Openbus, which consists of an integration infrastructure responsible for communication of various applications for acquisition, processing and interpretation of data. In addition to this study, we implement a solution of dynamic software update to accommodate the needs of this system. After, using the implemented solution, we present an overhead test and applications of updates on Openbus.
APA, Harvard, Vancouver, ISO, and other styles
3

Tesone, Pablo. "Dynamic Software Update for Production and Live Programming Environments." Thesis, Ecole nationale supérieure Mines-Télécom Lille Douai, 2018. http://www.theses.fr/2018MTLD0012/document.

Full text
Abstract:
Mettre à jour des applications durant leur exécution est utilisé aussi bien en production pour réduire les temps d’arrêt des applications que dans des environnements de développement interactifs (IDE pour live programming). Toutefois, ces deux scénarios présentent des défis différents qui font que les solutions de mise à jour dynamique (DSU pour Dynamic Software Updating) existantes sont souvent spécifiques à l’un des deux. Par exemple, les DSUs pour la programmation interactives ne supportent généralement pas la détection automatique de points sûrs de mise à jour ni la migration d’instances, alors que les DSUs pour la production nécessitent une génération manuelle de l’ensemble des modifications et manquent d’intégration avec l’IDE. Les solutions existantes ont également une capacité limitées à se mettre à jour elles-mêmes ou à mettre à jour les bibliothèques de base du langage ; et certaines d’entre elles introduisent mêmle une dégradation des performances d’exécution en dehors du processus de mise à jour.Dans cette thèse, nous proposons un DSU (nommé gDSU) unifié qui fonctionne à la fois pour la programmation interactive et les environnements de production. gDSU permet la détection automatique des points sûrs de mise à jour en analysant et manipulant la pile d’exécution, et offre un mécanisme réutilisable de migration d’instances afin de minimiser les interventions manuelles lors de l’application d’une migration. gDSU supporte également la mise à jour des bibliothèques du noyau du langage et du mécanisme de mise à jour lui-même. Ceci est réalisé par une copie incrémentale des objets à modifier et une application atomique de ces modifications.gDSU n’affecte pas les performances globales de l’application et ne présente qu’une pénalité d’exécution lors processus de mise à jour. Par exemple, gDSU est capable d’appliquer une mise à jour sur 100 000 instances en 1 seconde. Durant cette seconde, l’application ne répond pas pendant 250 milli-secondes seulement. Le reste du temps, l’application s’exécute normalement pendant que gDSU recherche un point sûr de mise à jour qui consiste alors uniquement à copier les éléments modifiés.Nous présentons également deux extensions de gDSU permettant un meilleur support du développement interactif dans les IDEs : la programmation interactive transactionnelle et l’application atomique de reusinages (refactorings)
Updating applications during their execution is used both in production to minimize application downtine and in integrated development environments to provide live programming support. Nevertheless, these two scenarios present different challenges making Dynamic Software Update (DSU) solutions to be specifically designed for only one of these use cases. For example, DSUs for live programming typically do not implement safe point detection or insistance migration, while production DSUs require manual generation of patches and lack IDE integration. These sollutions also have a limited ability to update themselves or the language core libraries and some of them present execution penalties outside the update window.In this PhD, we propose a unified DSU named gDSU for both live programming and production environments. gDSU provides safe update point detection using call stack manipulation and a reusable instance migration mechanism to minimize manual intervention in patch generation. It also supports updating the core language libraries as well as the update mechanism itself thanks to its incremental copy of the modified objects and its atomic commit operation.gDSU does not affect the global performance of the application and it presents only a run-time penalty during the window. For example, gDSU is able to apply an update impacting 100,000 instances in 1 second making the application not responsive for only 250 milliseconds. The rest of the time the applications runs normally while gDSU is looking for a safe update point during which modified elements will be copied.We also present extensions of gDSU to support transactional live programming and atomic automactic refactorings which increase the usability of live programming environments
APA, Harvard, Vancouver, ISO, and other styles
4

Pham, Thanh H. "Dynamic Update Techniques for Online Maps and Attributes Data." NSUWorks, 2001. http://nsuworks.nova.edu/gscis_etd/771.

Full text
Abstract:
Online databases containing geographic and related tabular data for maps and attributes often require continuous updates from widely distributed sources afield. For some applications, these data are dynamic, and thus are of little value if they do not reflect the latest information or changes. A status map that depicts graphically temporal data affecting accountability is an example of this type of data. How can accommodations be made collectively for the perpetual data updates in the database and the need to deliver online information in real time without making concessions? The goal of the dissertation was to analyze and evaluate techniques and technology for data collection and storage, online data delivery, and real-time upload. The result of this analysis culminated in the design and prototype of a system that allowed real-time delivery of up-to-date maps and attributes information. A literature review revealed that an ample amount of research material existed on the theory and practice of developing dynamic update techniques. Despite that fact, no research literature was available that specifically dealt with dynamic update techniques that provide for real-time delivery of up-to-date maps while allowing online update of attributes information. This dissertation was the first attempt at providing research material in this important area. The procedure consisted of five major steps encompassing a number of small steps, and culminated in the development of a prototype. The steps included gathering data collection and storage information, investigating technological advances in data delivery and access, studying dynamic update techniques, assessing the feasibility of an implementation solution, and developing a prototype. The results revealed that the dynamic update technique as implemented in the prototype met the need for timely delivery of accountability, geospatial, and metadata information within an infrastructure.
APA, Harvard, Vancouver, ISO, and other styles
5

Anderson, Gabrielle. "Behavioural properties and dynamic software update for concurrent programmes." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/353281/.

Full text
Abstract:
Software maintenance is a major part of the development cycle. The traditional methodology for rolling out an update to existing programs is to shut down the system, modify the binary, and restart the program. Downtime has significant disadvantages. In response to such concerns, researchers and practitioners have investigated how to perform update on running programs whilst maintaining various desired properties. In a multi-threaded setting this is further complicated by the interleaving of different threads' actions. In this thesis we investigate how to prove that safety and liveness are preserved when updating a program. We present two possible approaches; the main intuition behind each of these is to find quiescent points where updates are safe. The first approach requires global synchronisation, and is more generally applicable, but can delay updates indefinitely. The second restricts the class of programs that can be updated, but permits update without global synchronisation, and guarantees application of update. We provide full proofs of all relevant properties.
APA, Harvard, Vancouver, ISO, and other styles
6

Mensah, Pernelle. "Generation and Dynamic Update of Attack Graphs in Cloud Providers Infrastructures." Thesis, CentraleSupélec, 2019. http://www.theses.fr/2019CSUP0011.

Full text
Abstract:
Dans les infrastructures traditionnelles, les graphes d’attaque permettent de brosser un tableau de la sécurité, car ils sont un modèle décrivant les différentes étapes suivies par un attaquant dans le but de compromettre un actif du réseau. Ces graphes peuvent ainsi servir de base à l’évaluation automatisée des risques, en s’appuyant sur l’identification et l’évaluation des actifs essentiels. Cela permet de concevoir des contre-mesures proactives et réactives pour la réduction des risques et peut être utilisé pour la surveillance et le renforcement de la sécurité du réseau.Cette thèse vise à appliquer une approche similaire dans les environnements Cloud, ce qui implique de prendre en compte les nouveaux défis posés par ces infrastructures modernes, la majorité des graphes d’attaque étant conçue pour une application dans des environnements traditionnels. Les nouveaux scénarios d’attaque liés à la virtualisation, ainsi que les propriétés inhérentes du Cloud, à savoir l’élasticité et le caractère dynamique, sont quelques-uns des obstacles à franchir à cette fin.Ainsi, pour atteindre cet objectif, un inventaire complet des vulnérabilités liées à la virtualisation a été effectué, permettant d'inclure cette nouvelle dimension dans les graphes d'attaque existants. Par l'utilisation d'un modèle adapté à l’échelle du Cloud, nous avons pu tirer parti des technologies Cloud et SDN, dans le but de construire des graphes d’attaque et de les maintenir à jour. Des algorithmes capables de faire face aux modifications fréquentes survenant dans les environnements virtualisés ont été conçus et testés à grande échelle sur une plateforme Cloud réelle afin d'évaluer les performances et confirmer la validité des méthodes proposées dans cette thèse pour permettre à l’administrateur de Cloud de disposer d’un graphe d’attaque à jour dans cet environnent
In traditional environments, attack graphs can paint a picture of the security exposure of the environment. Indeed, they represent a model allowing to depict the many steps an attacker can take to compromise an asset. They can represent a basis for automated risk assessment, relying on an identification and valuation of critical assets in the network. This allows to design pro-active and reactive counter-measures for risk mitigation and can be leveraged for security monitoring and network hardening.Our thesis aims to apply a similar approach in Cloud environments, which implies to consider new challenges incurred by these modern infrastructures, since the majority of attack graph methods were designed with traditional environments in mind. Novel virtualization attack scenarios, as well as inherent properties of the Cloud, namely elasticity and dynamism are a cause for concern.To realize this objective, a thorough inventory of virtualization vulnerabilities was performed, for the extension of existing vulnerability templates. Based on an attack graph representation model suitable to the Cloud scale, we were able to leverage Cloud and SDN technologies, with the purpose of building Cloud attack graphs and maintain them in an up-to-date state. Algorithms able to cope with the frequent rate of change occurring in virtualized environments were designed and extensively tested on a real scale Cloud platform for performance evaluation, confirming the validity of the methods proposed in this thesis, in order to enable Cloud administrator to dispose of an up-to-date Cloud attack graph
APA, Harvard, Vancouver, ISO, and other styles
7

Tumati, Pradeep. "Software Hot Swapping." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/31362.

Full text
Abstract:
The emergence of the Internet has sparked a tremendous explosion in the special class of systems called mission critical systems. These systems are so vital to their intended tasks that they must operate continuously. Two problems affect them: unplanned, and therefore disastrous, downtime and planned downtime for software maintenance. As the pressure to keep these systems operating continuously increases, scheduling downtime becomes complex. However, dynamically modifying the mission critical systems without disruption can reduce the need for a planned downtime. Every executing process has an executing code tightly coupled with an associated state, which continuously changes as the code executes. A dynamic modification at this juncture involves modifying the executable code and the state present within the binary image of the associated process. An ill-timed modification can create runtime incompatibilities that are hard to rectify and eventually cause a system crash. The purpose of the research in this thesis is to examine the causes for incompatibilities and propose the design of a dynamic modification technique: Software Hot Swapping. To achieve these objectives, the researcher proposes mechanisms which these incompatibilities can prevent, examines the characteristics and the implementation issues of such mechanisms, and demonstrates dynamic modification with a simple prototype Hot Swapping program.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
8

Yin, Li. "Adaptive Background Modeling with Temporal Feature Update for Dynamic Foreground Object Removal." DigitalCommons@USU, 2016. https://digitalcommons.usu.edu/etd/5040.

Full text
Abstract:
In the study of computer vision, background modeling is a fundamental and critical task in many conventional applications. This thesis presents an introduction to background modeling and various computer vision techniques for estimating the background model to achieve the goal of removing dynamic objects in a video sequence. The process of estimating the background model with temporal changes in the absence of foreground moving objects is called adaptive background modeling. In this thesis, three adaptive background modeling approaches were presented for the purpose of developing \teacher removal" algorithms. First, an adaptive background modeling algorithm based on linear adaptive prediction is presented. Second, an adaptive background modeling algorithm based on statistical dispersion is presented. Third, a novel adaptive background modeling algorithm based on low rank and sparsity constraints is presented. The design and implementation of these algorithms are discussed in detail, and the experimental results produced by each algorithm are presented. Lastly, the results of this research are generalized and potential future research is discussed.
APA, Harvard, Vancouver, ISO, and other styles
9

Weißbach, Martin, Nguonly Taing, Markus Wutzler, Thomas Springer, Alexander Schill, and Siobhán Clarke. "Decentralized Coordination of Dynamic Software Updates in the Internet of Things." IEEE, 2016. https://tud.qucosa.de/id/qucosa%3A75282.

Full text
Abstract:
Large scale IoT service deployments run on a high number of distributed, interconnected computing nodes comprising sensors, actuators, gateways and cloud infrastructure. Since IoT is a fast growing, dynamic domain, the implementation of software components are subject to frequent changes addressing bug fixes, quality insurance or changed requirements. To ensure the continuous monitoring and control of processes, software updates have to be conducted while the nodes are operating without losing any sensed data or actuator instructions. Current IoT solutions usually support the centralized management and automated deployment of updates but are restricted to broadcasting the updates and local update processes at all nodes. In this paper we propose an update mechanism for IoT deployments that considers dependencies between services across multiple nodes involved in a common service and supports a coordinated update of component instances on distributed nodes. We rely on LyRT on all IoT nodes as the runtime supporting local disruption-minimal software updates. Our proposed middleware layer coordinates updates on a set of distributed nodes. We evaluated our approach using a demand response scenario from the smart grid domain.
APA, Harvard, Vancouver, ISO, and other styles
10

Sornil, Ohm. "Parallel Inverted Indices for Large-Scale, Dynamic Digital Libraries." Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/26131.

Full text
Abstract:
The dramatic increase in the amount of content available in digital forms gives rise to large-scale digital libraries, targeted to support millions of users and terabytes of data. Retrieving information from a system of this scale in an efficient manner is a challenging task due to the size of the collection as well as the index. This research deals with the design and implementation of an inverted index that supports searching for information in a large-scale digital library, implemented atop a massively parallel storage system. Inverted index partitioning is studied in a simulation environment, aiming at a terabyte of text. As a result, a high performance partitioning scheme is proposed. It combines the best qualities of the term and document partitioning approaches in a new Hybrid Partitioning Scheme. Simulation experiments show that this organization provides good performance over a wide range of conditions. Further, the issues of creation and incremental updates of the index are considered. A disk-based inversion algorithm and an extensible inverted index architecture are described, and experimental results with actual collections are presented. Finally, distributed algorithms to create a parallel inverted index partitioned according to the hybrid scheme are proposed, and performance is measured on a portion of the equipment that normally makes up the 100 node Virginia Tech PetaPlex™ system. NOTE: (02/2007) An updated copy of this ETD was added after there were patron reports of problems with the file.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Dynamic update"

1

Shaltens, Richard K. Update of the 2 kW solar dynamic ground test demonstration. [Washington, DC]: National Aeronautics and Space Administration, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shaltens, Richard K. Update of the 2 kW solar dynamic ground test demonstration. [Washington, DC]: National Aeronautics and Space Administration, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dynamic asset allocation: Modern portfolio theory updated for the smart investor. New York: Bloomberg Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Picerno, James. Dynamic asset allocation: Modern portfolio theory updated for the smart investor. New York: Bloomberg Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Martinez, Alma I. An overview of Texas juvenile justice population trends and dynamics: An update. Austin, Tex. (P.O. Box 13332, Austin 78711): Criminal Justice Policy Council, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Crookston, Nicholas L. The western spruce budworm dynamics model: Version 3.1 update and notes on behavior. Ogden, Utah: U.S. Dept. of Agriculture, Forest Service, Intermountain Research Station, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Crookston, Nicholas L. The western spruce budworm dynamics model: Version 3.1 update and notes on behavior. Ogden, UT (324 25th St., Ogden 84401): U.S. Dept. of Agriculture, Forest Service, Intermountain Research Station, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Crookston, Nicholas L. The western spruce budworm dynamics model: Version 3.1 update and notes on behavior. Ogden, UT (324 25th St., Ogden 84401): U.S. Dept. of Agriculture, Forest Service, Intermountain Research Station, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1951-, Jentleson Bruce W., ed. Special update to American foreign policy: The Bush administration and the dynamics of choice. New York: W. W. Norton, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Scheuss, Ralph-W. Business update!: So machen Sie sich und Ihr Unternehmen stark für den Hyper-Wettbewerb ; mehr Dynamik, mehr Wachstum, mehr Geschäft. Berlin: Metropolitan, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Dynamic update"

1

Dekker, Paul J. E. "Information Update and Support." In Dynamic Semantics, 49–83. Dordrecht: Springer Netherlands, 2012. http://dx.doi.org/10.1007/978-94-007-4869-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

van Benthem, Johan. "Belief Update as Social Choice." In Dynamic Formal Epistemology, 151–60. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-94-007-0074-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wojciechowski, Paweł T., and Olivier Rütti. "On Correctness of Dynamic Protocol Update." In Lecture Notes in Computer Science, 275–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11494881_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shen, Fei, Siqi Du, and Linpeng Huang. "A Dynamic Update Framework for OSGi Applications." In Lecture Notes in Computer Science, 350–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11842-5_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Hongyu, and Lin Zhang. "Dynamic Subspace Update with Incremental Nyström Approximation." In Computer Vision – ACCV 2010 Workshops, 384–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22819-3_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Anderson, Gabrielle, and Julian Rathke. "Dynamic Software Update for Message Passing Programs." In Programming Languages and Systems, 207–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35182-2_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Read, Amber, Ivy Hurwitz, and Ravi Durvasula. "Leishmaniasis: An Update on a Neglected Tropical Disease." In Dynamic Models of Infectious Diseases, 95–138. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3961-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nam, SungHun, and Hwang Chong-Sun. "Dynamic Remote Update Adapting Wireless Network Connection States." In Mobile Data Management, 282–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44498-x_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gafni, Eli. "Generalized scheme for topology-update in dynamic networks." In Distributed Algorithms, 187–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0019804.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Awerbuch, Baruch, and Yishay Mansour. "An efficient topology update protocol for dynamic networks." In Distributed Algorithms, 185–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56188-9_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Dynamic update"

1

Cimino, Mauro, and Prabhakar R. Pagilla. "Parametrization of LTI Controllers for Multirate Systems." In ASME 2010 Dynamic Systems and Control Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/dscc2010-4191.

Full text
Abstract:
In this work we consider the problem of parametrizing the set of all stabilizing Linear Time-Invariant (LTI) controllers for multirate systems such that model matching is achieved with a desired transfer function. We consider those systems where the plant output can be measured at a rate (measurement update rate) slower than the control signal updates rate. The solution to the parametrization problem is provided for the two cases: (1) model matching at the control update rate, (2) model matching at the measurement update rate. Unlike model matching at the measurement update rate, model matching at the control update rate allows us to directly improve and characterize the transient response of the continuous-time system. Tools such as up-sampling and down-sampling operators, and modified Z-transforms are utilized to model the closed-loop multirate system and to parametrize the sets of LTI controllers.
APA, Harvard, Vancouver, ISO, and other styles
2

Buryan, Yu A., D. V. Sitnikov, M. V. Silkov, and A. A. Buryan. "VIBRATION ISOLATION SYSTEM WITH ACTIVE DYNAMIC VIBRATION DAMPENER FOR NON-STATIONARY OPERATION OF THE PISTON MACHINE." In Mechanical Science and Technology Update. Omsk State Technical University, 2021. http://dx.doi.org/10.25206/978-5-8149-3246-4-2021-18-25.

Full text
Abstract:
В работе рассмотрен активный динамический гаситель колебаний с компенсацией виброактивных сил с управлением по реакции основания для увеличения эффективной виброизоляции при нестационарных режимах работы поршневой машины. В качестве пассивной системы виброизоляции предложена и рассмотрена пневмоопора с дополнительным объёмом, соединённая дросселем. В стационарном зарезонансном режиме пневмоопора позволяет уменьшить собственную частоту подвески и улучшить виброизоляцию. Основное внимание в работе уделено оценке эффективности применения активного гасителя колебаний при нестационарном режиме работы поршневой машины. Составлена математическая модель исследуемой системы и путём численного решения дифференциальных уравнений получены значения усилий на основание с использованием активного динамического гасителя колебаний. Показано на примере, что в режиме «включение - остановки» поршневой машины применение активного динамического гасителя колебаний обеспечивает высокую эффективность виброизоляции в окрестности резонансных частот.
APA, Harvard, Vancouver, ISO, and other styles
3

ZHANG, Shi, and LinPeng HUANG. "Type-Safe Dynamic Update Transaction." In 31st Annual International Computer Software and Applications Conference - Vol. 2 - (COMPSAC 2007). IEEE, 2007. http://dx.doi.org/10.1109/compsac.2007.228.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhenatov, B. D. "EFFECT OF THE NOISE COMPONENT OF THE APERTURE UNCERTAINTY ON THE DYNAMIC RANGE OF THE SAMPLE AND HOLD CIRCUIT." In Mechanical Science and Technology Update. Omsk State Technical University, 2021. http://dx.doi.org/10.25206/978-5-8149-3246-4-2021-173-178.

Full text
Abstract:
В данной статье рассмотрен вопрос влияния шумовой компоненты апертурной неопределенности на динамический диапазон устройства выборки и хранения (УВХ). С этой целью построена математическая модель УВХ, которая представлена в виде идеального дискретизатора, на входе которого включен функциональный блок, имитирующий искажения дискретизируемого колебания в реальном УВХ. Получено аналитическое выражение, позволяющее показать, что шумовая компонента апертурной неопределенности порождает частотные искажения входного сигнала и дополнительный шум, свойства которого определяются характеристиками апертурной неопределенности и дискретизируемого колебания.
APA, Harvard, Vancouver, ISO, and other styles
5

Hongchun, Wang. "Update Parameters Dynamic in Causality Diagram." In 2009 International Forum on Information Technology and Applications (IFITA). IEEE, 2009. http://dx.doi.org/10.1109/ifita.2009.67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nahabedian, Leandro. "Dynamic Update of Business Process Management." In 2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE). IEEE, 2017. http://dx.doi.org/10.1109/icse-c.2017.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gregersen, Allan Raundahl, Douglas Simon, and Bo Nørregaard Jørgensen. "Towards a dynamic-update-enabled JVM." In the Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1562860.1562862.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Junqing, and Linpeng Huang. "Dynamic Service Update Based on OSGi." In 2009 WRI World Congress on Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/wcse.2009.122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Baumann, Andrew, and Jonathan Appavoo. "Improving dynamic update for operating systems." In the twentieth ACM symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1095810.1118622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Behnke, Lutz, Qi Wang, Christos Grecos, and Kai von Luck. "Budget based dynamic state update aggregation." In MMSys '15: Multimedia Systems Conference 2015. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2723695.2723696.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Dynamic update"

1

Thomson, S., Y. Rekhter, and J. Bound. Dynamic Updates in the Domain Name System (DNS UPDATE). Edited by P. Vixie. RFC Editor, April 1997. http://dx.doi.org/10.17487/rfc2136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Eastlake, D. Secure Domain Name System Dynamic Update. RFC Editor, April 1997. http://dx.doi.org/10.17487/rfc2137.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wellington, B. Secure Domain Name System (DNS) Dynamic Update. RFC Editor, November 2000. http://dx.doi.org/10.17487/rfc3007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Deng, X., M. Boucadair, Q. Zhao, J. Huang, and C. Zhou. Using the Port Control Protocol (PCP) to Update Dynamic DNS. RFC Editor, November 2014. http://dx.doi.org/10.17487/rfc7393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hale, Richard Edward, Sacit M. Cetiner, David L. Fugate, John J. Batteh, and Michael M. Tiller. Update on Small Modular Reactors Dynamic System Modeling Tool: Web Application. Office of Scientific and Technical Information (OSTI), January 2015. http://dx.doi.org/10.2172/1252137.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Carroll, C., and F. Quick. Verizon Wireless Dynamic Mobile IP Key Update for cdma2000(R) Networks. RFC Editor, June 2007. http://dx.doi.org/10.17487/rfc4784.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yu, Xin, and Zvi M. Kedem. A Distributed Adaptive Cache Update Algorithm for the Dynamic Source Routing Protocol. Fort Belvoir, VA: Defense Technical Information Center, January 2003. http://dx.doi.org/10.21236/ada439506.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Janecky, D. R., R. S. Rundberg, M. Ott, and A. Mitchell. Update report on fracture flow in saturated tuff: Dynamic transport task for the Nevada Nuclear Waste Investigations. Office of Scientific and Technical Information (OSTI), November 1990. http://dx.doi.org/10.2172/137933.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Carmichael, Joshua. Dynamic Thresholds for STA/LTA Detectors that Output Templates. GNDD Deliverable (Working Group 6: Status Update) [Slides]. Office of Scientific and Technical Information (OSTI), August 2021. http://dx.doi.org/10.2172/1814756.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Subramanian, K. H. Test Plan to Update SRS High Level Waste Tank Material Properties Database by Determining Synergistic Effects of Dynamic Strain Aging and Stress Corrosion Cracking. Office of Scientific and Technical Information (OSTI), March 2002. http://dx.doi.org/10.2172/799694.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Dynamic update' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography