Bibliografie tematiche / Dynamic update

Indice

  1. Articoli di riviste
  2. Tesi
  3. Libri
  4. Capitoli di libri
  5. Atti di convegni
  6. Rapporti di organizzazioni

Letteratura scientifica selezionata sul tema "Dynamic update"

Autore: Grafiati
Pubblicato: 4 giugno 2021
Ultima modifica: 9 giugno 2025

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Dynamic update".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Dynamic update"

1

Banerjee, Debangshu, and R. Inkulu. "Vertex Guarding for Dynamic Orthogonal Art Galleries." International Journal of Computational Geometry & Applications 31, no. 02n03 (June 2021): 123–40. http://dx.doi.org/10.1142/s0218195921500060.

Testo completo
Abstract (sommario):
We devise an algorithm for surveying a dynamic orthogonal polygonal domain by placing one guard at each vertex in a subset of its vertices, i.e., whenever an orthogonal polygonal domain [Formula: see text] is modified to result in another orthogonal polygonal domain [Formula: see text], our algorithm updates the set of vertex guards surveying [Formula: see text] so that the updated guard set surveys [Formula: see text]. Our algorithm modifies the guard placement in [Formula: see text] amortized time, while ensuring the updated orthogonal polygonal domain with [Formula: see text] holes and [Formula: see text] vertices is guarded using at most [Formula: see text] vertex guards. For the special case of the initial orthogonal polygon being hole-free and each update resulting in a hole-free orthogonal polygon, our guard update algorithm takes [Formula: see text] worst-case time. Here, [Formula: see text] and [Formula: see text] are the number of vertices of the orthogonal polygon before and after the update, respectively; and, [Formula: see text] is the sum of [Formula: see text] and the number of updates to a few structures maintained by our algorithm. Further, by giving a construction, we show it suffices for the algorithm to consider only the case in which the parity of the number of reflex vertices of both [Formula: see text] and [Formula: see text] are equal.
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
3

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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
4

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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Bernstein, Aaron, Sebastian Forster, and Monika Henzinger. "A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching." ACM Transactions on Algorithms 17, no. 4 (October 31, 2021): 1–51. http://dx.doi.org/10.1145/3469833.

Testo completo
Abstract (sommario):
Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas) and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability. In this article, we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem. (1) For dynamic spanner, the only known o ( n ) worst-case bounds were O ( n 3/4 ) high-probability worst-case update time for maintaining a 3-spanner and O ( n 5/9 ) for maintaining a 5-spanner. We give a O (1) k log 3 ( n ) high-probability worst-case time bound for maintaining a ( 2k-1 )-spanner, which yields the first worst-case polylog update time for all constant k . (All the results above maintain the optimal tradeoff of stretch 2k-1 and Õ( n 1+1/k ) edges.) (2) For dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O (log 5 ( n )) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2+ϵ)-approximate, and hence not maximal. Our results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: An algorithm is said to have worst-case expected update time ɑ if for every update σ, the expected time to process σ is at most ɑ. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: A worst-case expected update time of O(1) still allows for the possibility that every 1/ f(n) updates requires ϴ ( f(n) ) time to process, for arbitrarily high f(n) . In this article, we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: The query time remains the same, while the update time increases by a factor of O (log 2(n) ). Thus, we achieve our results in two steps: (1) First, we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then, we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms.
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Bernstein, Aaron, Sebastian Forster, and Monika Henzinger. "A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching." ACM Transactions on Algorithms 17, no. 4 (October 31, 2021): 1–51. http://dx.doi.org/10.1145/3469833.

Testo completo
Abstract (sommario):
Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas) and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability. In this article, we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem. (1) For dynamic spanner, the only known o ( n ) worst-case bounds were O ( n 3/4 ) high-probability worst-case update time for maintaining a 3-spanner and O ( n 5/9 ) for maintaining a 5-spanner. We give a O (1) k log 3 ( n ) high-probability worst-case time bound for maintaining a ( 2k-1 )-spanner, which yields the first worst-case polylog update time for all constant k . (All the results above maintain the optimal tradeoff of stretch 2k-1 and Õ( n 1+1/k ) edges.) (2) For dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O (log 5 ( n )) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2+ϵ)-approximate, and hence not maximal. Our results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: An algorithm is said to have worst-case expected update time ɑ if for every update σ, the expected time to process σ is at most ɑ. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: A worst-case expected update time of O(1) still allows for the possibility that every 1/ f(n) updates requires ϴ ( f(n) ) time to process, for arbitrarily high f(n) . In this article, we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: The query time remains the same, while the update time increases by a factor of O (log 2(n) ). Thus, we achieve our results in two steps: (1) First, we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then, we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms.
Gli stili APA, Harvard, Vancouver, ISO e altri
7

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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Kahle, Reinhard. "Default Negation as Explicit Negation plus Update." Logical Investigations 27, no. 1 (May 27, 2021): 64–81. http://dx.doi.org/10.21146/2074-1472-2021-27-1-64-81.

Testo completo
Abstract (sommario):
We argue that under the stable model semantics default negation can be read as explicit negation with update. We show that dynamic logic programming which is based on default negation, even in the heads, can be interpreted in a variant of updates with explicit negation only. As corollaries, we get an easy description of default negation in generalized and normal logic programming where initially negated literals are updated. These results are discussed with respect to the understanding of negation in logic.
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Xu, Tie, Haoran Yang, Jun Ma, Kun Xiong, and Qinyou Hu. "An Improved D* Lite-Based Dynamic Route Planning Algorithm for Ships in Arctic Waters." Journal of Marine Science and Engineering 12, no. 12 (December 18, 2024): 2323. https://doi.org/10.3390/jmse12122323.

Testo completo
Abstract (sommario):
The ice conditions in Arctic waters are complex and variable, requiring ships to dynamically adjust their routes to ensure safe and efficient navigation. Traditional dynamic path planning algorithms struggle to address the extensive variability of Arctic ice conditions. To tackle this issue, this paper improves the D* Lite algorithm by leveraging the gradual and convergent nature of Arctic ice condition changes. The original algorithm’s local update and path extraction rules are modified to prevent chain updates triggered by minor localized changes, thereby reducing the frequency of updates in non-critical areas. By simulating dynamic route planning for ships in Arctic waters during both the freezing and melting periods, the improved D* Lite algorithm was compared with the original D* Lite algorithm and a global update algorithm in terms of voyage distance, risk coefficient, planning time, and the number of node updates. The computational results demonstrate that the improved D* Lite algorithm achieves planning results very similar to those of the original D* Lite algorithm and the global update algorithm at the lowest update cost, significantly enhancing the safety and efficiency of dynamic route planning for ships in Arctic waters.
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Zhang, Fangyuan, and Sibo Wang. "Effective indexing for dynamic structural graph clustering." Proceedings of the VLDB Endowment 15, no. 11 (July 2022): 2908–20. http://dx.doi.org/10.14778/3551793.3551840.

Testo completo
Abstract (sommario):
Graph clustering is a fundamental data mining task that clusters vertices into different groups. The structural graph clustering algorithm ( SCAN ) is a widely used graph clustering algorithm that derives not only clustering results, but also special roles of vertices like hubs and outliers. In this paper, we consider structural graph clustering on dynamic graphs under Jaccard similarity. The state-of-the-art index-based solution focuses on static graphs and incurs prohibitive update costs to maintain indices. Lately, an efficient approximate dynamic structural graph clustering algorithm Dyn-StrClu under Jaccard similarity is proposed. However, their solution needs to fix input parameters while parameter settings of SCAN usually need to be fine-tuned to achieve good clustering results. Motivated by these limitations, we present a study on devising effective index structures for SCAN algorithm on dynamic graphs. Similar to the state-of-the-art dynamic scheme, our main idea to reduce the time complexity is still by bringing approximation to clustering results. However, our solution does not need to fix the input parameters. To achieve this, our solution includes two key components. The first is to maintain a bottom- k sketch for each vertex so that the similarities of affected vertices can be easily updated. The second key is a bucketing strategy that allows us to update clustering results and roles of vertices efficiently. Our theoretical analysis shows that our proposed algorithm achieves O (log n · log M + m / pf ) expected update cost and guarantees to return approximate clustering results with probability 1 - pf after up to M updates. Extensive experiments show that our solution is up to two orders of magnitude faster than the state-of-the-art index-based solution while still achieving high-quality clustering results.
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Tesi sul tema "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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>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.<br>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.
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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)<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
4

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

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

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

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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

Testo completo
Abstract (sommario):
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<br>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
Gli stili APA, Harvard, Vancouver, ISO e altri
7

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

Testo completo
Abstract (sommario):
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.<br>Master of Science
Gli stili APA, Harvard, Vancouver, ISO e altri
8

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

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
10

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

Testo completo
Abstract (sommario):
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.<br>Ph. D.
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Libri sul tema "Dynamic update"

1

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

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

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

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

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

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

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.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

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.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

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.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

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.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Wulczyn, Fred. Foster care dynamics, 1983-1994: California, Illinois, Michigan, Missouri, New York, and Texas : an update from the Multistate Foster Care Data Archive. [Chicago, Ill.]: Chapin Hall Center for Children at the University of Chicago, 1997.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Capitoli di libri sul tema "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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Azarmehr, Amir, Soheil Behnezhad, and Mohammad Roghani. "Fully Dynamic Matching: -Approximation in Polylog Update Time." In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 3040–61. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2024. http://dx.doi.org/10.1137/1.9781611977912.109.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Dynamic update"

1

Lai, Yuqi, Manman He, Chen Yao, Zhijian Yin, Hongliang Zou, and Zhen Yang. "Dynamic update template for visual object tracking." In 5th International Conference on Computer Vision and Data Mining (ICCVDM 2024), edited by Xin Zhang and Minghao Yin, 31. SPIE, 2024. http://dx.doi.org/10.1117/12.3048089.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Roberts, Brad, Eugene Morelli, Jared Cooper, Sean Roark, Sid Xiao, Thomas Schlapkohl, and Donald Gaublomme. "Integrated Methods to Model and Update Rotorcraft Simulations with Experimental Data." In Vertical Flight Society 70th Annual Forum & Technology Display, 1–18. The Vertical Flight Society, 2014. http://dx.doi.org/10.4050/f-0070-2014-9583.

Testo completo
Abstract (sommario):
Updating simulation models based on flight, or other external data, is a laborious process. Despite this, simulation updates are necessary for high-fidelity simulations used in analysis, control development, handling qualities prediction, fleet training, etc. Recent development has yielded an integrated modeling and simulation update suite known as AUSPEX: Algorithms to Update Simulation Parameters with EXperimental Data. AUSPEX combines the steps of the simulation-update process into a single environment and provides a framework to track updates and associated metadata. Mathematically sound and statistically rigorous techniques are used to calculate updates of current model parameters, thereby improving correlation with observed vehicle response. The software can also suggest additional terms to the dynamic equations if these terms are missing from the simulation due to simplifying assumptions made in the modeling phase. Creation of a new model is also possible. This article describes application of AUSPEX to the V-22 tiltrotor specifically, and rotorcraft in general, using a statistically-based frequency domain method. The capability to accurately and automatically update a simulation database to account for nonlinear and unsteady aerodynamic effects embodied in the flight data is demonstrated. Useful features of this novel frequency domain approach are highlighted, including computational efficiency, noise rejection, automated model structure determination in the frequency domain for nonlinear and unsteady aerodynamics, and the ability to generate simulation updates without air flow angle measurements in the flight data. Examples are presented using V-22 simulation and flight test data with the vehicle in airplane, conversion, and helicopter modes. Analysis was performed with both the NAVAIR and Bell simulations of the V-22 hosted in GTRSIM.
Gli stili APA, Harvard, Vancouver, ISO e altri
3

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.

Testo completo
Abstract (sommario):
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.
Gli stili APA, Harvard, Vancouver, ISO e altri
4

O. V., Stukach, Zorin P. A., and Ershov I. A. "THE USE OF THE CONVERGENT CROSS MAPPING METHOD IN THE PROBLEMS OF STUDYING THE CROSS-DEPENDENCE OF TEMPERATURE SERIES." In Mechanical Science and Technology Update. Omsk State Technical University, 2022. http://dx.doi.org/10.25206/978-5-8149-3453-6-2022-228-234.

Testo completo
Abstract (sommario):
The dynamics of temperature series in two problems of temperature measurement by distributed optical sensors and determination of the measure of the dynamic dependence of heat consumption of residential buildings and outdoor temperature are investigated by the method of convergent cross mapping. It is shown that the convergent cross mapping method has prospects in energy efficiency evaluation and can be used to compare buildings by their characteristics, as well as to further solutions to energy efficiency improving.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

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.

Testo completo
Abstract (sommario):
В работе рассмотрен активный динамический гаситель колебаний с компенсацией виброактивных сил с управлением по реакции основания для увеличения эффективной виброизоляции при нестационарных режимах работы поршневой машины. В качестве пассивной системы виброизоляции предложена и рассмотрена пневмоопора с дополнительным объёмом, соединённая дросселем. В стационарном зарезонансном режиме пневмоопора позволяет уменьшить собственную частоту подвески и улучшить виброизоляцию. Основное внимание в работе уделено оценке эффективности применения активного гасителя колебаний при нестационарном режиме работы поршневой машины. Составлена математическая модель исследуемой системы и путём численного решения дифференциальных уравнений получены значения усилий на основание с использованием активного динамического гасителя колебаний. Показано на примере, что в режиме «включение - остановки» поршневой машины применение активного динамического гасителя колебаний обеспечивает высокую эффективность виброизоляции в окрестности резонансных частот.
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Su, S. J., S. Tahir, S. Ramatullayev, C. Kada Kloucha, and H. Mustapha. "Rapid Model Update - Enabling Fast, Structured Dynamic Model Updates Leveraging Automation." In ADIPEC. SPE, 2023. http://dx.doi.org/10.2118/216352-ms.

Testo completo
Abstract (sommario):
Abstract The quality of a reservoir simulation model is essential for reliable field development planning. To reduce uncertainties on production forecast, the data integrated into the model should incorporate all wells drilled along with their completion data and historical production and injection data and reflect accurately the latest understanding of the subsurface based on all the latest measurements performed in the field. Additionally, the model should be able to reproduce the historical production and injection to a good accuracy. To improve the reservoir engineers’ ability to keep the reservoir simulation models up-to-date, a fully automated framework was developed to facilitate the process of gathering data and reviewing the quality of the dynamic reservoir model by connecting directly to production databases from the geomodelling platform, integrating all required data for dynamic reservoir modelling, and providing automated data quality check tools to assess the quality of the input data to the simulation model, as well as the quality of the simulation results against historical data. The framework enables a rapid update of the static modelling data, relative permeability and capillary pressure data, fluid model and initial conditions of the reservoir. Additionally, a direct channel to production databases (e.g., Oracle database, OFM database) is open to retrieve the latest well trajectories, completion data, and associated historical measurements to ensure that the latest available data is integrated with the model without introducing human errors through manual data manipulation. Additionally, provides quality control tools enable checking the consistency in multiple building blocks of the dynamic reservoir model, such as the compatibility of drainage and imbibition relative permeability curves and capillary pressure curves used in modelling hysteresis processes, potential issues in black oil fluid model tables. A streamlined process to evaluate the quality of the model calibration to historical data is also integrated and provides flexible metrics and visualization to assess the quality of the history match of standard properties such as production/injection rates, cumulative production/injection volumes, water cut, gas-oil ratio, static and flowing pressures, and enables the assessment of the model quality against additional advanced metrics such as water breakthrough time, and match to surveillance logs (e.g. saturation logs, pressure logs, production logs). The framework was applied on a giant onshore carbonate oilfield with a large well count. Quality control was performed to assess the consistency of the reservoir simulation model input data against production databases, followed by an update of the model and the assessment of the quality of the history match following the update. The process that the engineer could spend weeks to perform can now be performed in days, with a higher quality and accuracy through automation, with a fast understanding of the model quality to perform reliable field development plan optimization.
Gli stili APA, Harvard, Vancouver, ISO e altri
8

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.

Testo completo
Abstract (sommario):
В данной статье рассмотрен вопрос влияния шумовой компоненты апертурной неопределенности на динамический диапазон устройства выборки и хранения (УВХ). С этой целью построена математическая модель УВХ, которая представлена в виде идеального дискретизатора, на входе которого включен функциональный блок, имитирующий искажения дискретизируемого колебания в реальном УВХ. Получено аналитическое выражение, позволяющее показать, что шумовая компонента апертурной неопределенности порождает частотные искажения входного сигнала и дополнительный шум, свойства которого определяются характеристиками апертурной неопределенности и дискретизируемого колебания.
Gli stili APA, Harvard, Vancouver, ISO e altri
9

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

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

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Auer, Raphael, Mathieu O. Pedemonte, and Raphael S. Schoenle. Sixty Years of Global Inflation: A Post-GFC Update. Federal Reserve Bank of Cleveland, May 2024. http://dx.doi.org/10.26509/frbc-wp-202410.

Testo completo
Abstract (sommario):
Is inflation (still) a global phenomenon? We study the international co-movement of inflation based on a dynamic factor model and in a sample spanning up to 56 countries during the 1960-2023 period. Over the entire period, a first global factor explains approximately 58% of the variation in headline inflation across all countries and over 72% in OECD economies. The explanatory power of global inflation is equally high in a shorter sample spanning the time since 2000. Core inflation is also remarkably global, with 53% of its variation attributable to a first global factor. The explanatory power of a second global factor is lower, except for select emerging economies. Variables such as a broad dollar index, the US federal funds rate, and a measure of commodity prices positively correlate with the first global factor. This global factor is also correlated with US inflation during the 70s, 80s, the GFC, and COVID. However, it lags these variables during the post-COVID period. Country-level integration in global value chains accounts for a significant proportion of the share of both local headline and core inflation dynamics explained by global factors.
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Murray, Matthew, Trace Thornton, Stephen Rowell, and Clifford Grey. Dynamic material properties of Grade 50 steel : effects of high strain rates on ASTM A992 and A572 Grade 50 steels. Engineer Research and Development Center (U.S.), August 2023. http://dx.doi.org/10.21079/11681/47445.

Testo completo
Abstract (sommario):
Uniaxial tensile tests were conducted on American Society for Testing Materials International (ASTM) A992 and A572 Grade 50 steels at increasing strain rates to determine the material strength properties of structural members subjected to dynamic loadings. The increase in dynamic yield strength and ultimate tensile strength was determined to update design criteria within UFC 3-340-02, which are currently limited to ASTM A36 and A514 steels. The proposed updates will provide the necessary information required to design blast-resistant structures utilizing modern-day structural steels. The dynamic material properties determined by high-rate tensile tests were compared to static values obtained from ASTM E8 standard tensile tests. The comparisons were used to calculate dynamic increase factors (DIFs) for each steel at strain rates from 2E-3 to 2E0 inch/inch/second. The experiments revealed that the A992 steel exhibited an increase in yield strength up to 45% and ultimate tensile strength up to 20% as strain rate increased over the range tested. The A572-50 steel exhibited a similar increase in yield strength up to 35% and ultimate tensile strength up to 20%. The DIF design curves developed during this research will allow engineers to more efficiently design structural steel components of hardened structures for the protection of our nation’s critical infrastructure.
Gli stili APA, Harvard, Vancouver, ISO e altri
10

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.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Ti possono interessare anche gli elenchi estesi di opere sul tema "Dynamic update":
Articoli di riviste Tesi Libri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!

Vai alla bibliografia